Computing the Volume is Difficult.
I. Bárány, Zoltán Füredi (1987)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Tessellations Generated by Hyperplanes.”
Computing the Volume is Difficult.
On the Construction of Abstract Voronoi Diagrams.
K. Mehlhorn, St. Meiser, C. ó'Dúnlaing (1991)
Discrete & computational geometry
Similarity:
Ammann Bars and Quasicrystals.
T. Stehling (1992)
Discrete & computational geometry
Similarity:
Finding Minimum Area k-gons.
D. Eppstein, M. Overmars, G Rote, G. Woeginger (1992)
Discrete & computational geometry
Similarity:
Shelling Pseudopolyhedra.
P. Goossens (1992)
Discrete & computational geometry
Similarity:
On Lines Missing Polyhedral Sets in 3-Space.
M. Pellegrini (1994)
Discrete & computational geometry
Similarity:
Castles in the Air Revisited.
M. Sharir, B. Aronov (1994)
Discrete & computational geometry
Similarity:
Nonoverlap of the Star Unfolding.
H. Edelsbrunner (1992)
Discrete & computational geometry
Similarity:
On the Average Number of k-Sets.
M. Pellegrini, P.W. Shor (1992)
Discrete & computational geometry
Similarity:
...-Morphic Sets of Prototiles.
P. Schmitt (1987)
Discrete & computational geometry
Similarity:
A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets.
R. Wenger (1990)
Discrete & computational geometry
Similarity: