On Polyhedra with Transitivity Properties.
J.M. Wills (1986)
Discrete & computational geometry
Similarity:
Displaying similar documents to “On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.”
On Polyhedra with Transitivity Properties.
Optimality of the Delaunay Triangulation in Rd .
V.T. Rajan (1994)
Discrete & computational geometry
Similarity:
Linear-Size Nonobtuse Triangulation of Polygons.
J. Ruppert, M. Bern, S. Mitchell (1995)
Discrete & computational geometry
Similarity:
Nonobtuse Triangulation of Polygons.
B.S. Baker, Eric Grosse, Conor, S. Rafferty (1988)
Discrete & computational geometry
Similarity:
Partitioning Euclidean Space.
J.H. Schmerl (1993)
Discrete & computational geometry
Similarity:
Triangulating a Simple Polygon in Linear Time.
B. Chazelle (1991)
Discrete & computational geometry
Similarity:
Shelling Pseudopolyhedra.
P. Goossens (1992)
Discrete & computational geometry
Similarity:
Ammann Bars and Quasicrystals.
T. Stehling (1992)
Discrete & computational geometry
Similarity:
Nonrealizability Proofs in Computational Geometry.
B. Sturmfels, J. Bokowski, J. Richter (1990)
Discrete & computational geometry
Similarity: