Linear-Size Nonobtuse Triangulation of Polygons.
J. Ruppert, M. Bern, S. Mitchell (1995)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Optimality of the Delaunay Triangulation in Rd .”
Linear-Size Nonobtuse Triangulation of Polygons.
Nonobtuse Triangulation of Polygons.
B.S. Baker, Eric Grosse, Conor, S. Rafferty (1988)
Discrete & computational geometry
Similarity:
Shelling Pseudopolyhedra.
P. Goossens (1992)
Discrete & computational geometry
Similarity:
Ammann Bars and Quasicrystals.
T. Stehling (1992)
Discrete & computational geometry
Similarity:
An Upper Bound for Conforming Delaunay Triangulations.
H. Edelsbrunner, Tiow Seng Tan (1993)
Discrete & computational geometry
Similarity:
On the Construction of Abstract Voronoi Diagrams.
K. Mehlhorn, St. Meiser, C. ó'Dúnlaing (1991)
Discrete & computational geometry
Similarity:
Nonrealizability Proofs in Computational Geometry.
B. Sturmfels, J. Bokowski, J. Richter (1990)
Discrete & computational geometry
Similarity:
Triangulating a Simple Polygon in Linear Time.
B. Chazelle (1991)
Discrete & computational geometry
Similarity:
On Lines Missing Polyhedral Sets in 3-Space.
M. Pellegrini (1994)
Discrete & computational geometry
Similarity:
On the Average Number of k-Sets.
M. Pellegrini, P.W. Shor (1992)
Discrete & computational geometry
Similarity:
Repeated Angles in E4 .
G. Purdy (1988)
Discrete & computational geometry
Similarity: