Triangulating a Simple Polygon in Linear Time.
B. Chazelle (1991)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Computing the Link Center of a Simple Polygon.”
Triangulating a Simple Polygon in Linear Time.
Minimum Dissection of a Rectilinear Polygon with Arbitrary Holes into Rectangles.
V. Soltan, A. Gorpinevich (1993)
Discrete & computational geometry
Similarity:
Nonobtuse Triangulation of Polygons.
B.S. Baker, Eric Grosse, Conor, S. Rafferty (1988)
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:
X-Rays of Polygons.
R.J. Gardner (1992)
Discrete & computational geometry
Similarity:
On Lines Missing Polyhedral Sets in 3-Space.
M. Pellegrini (1994)
Discrete & computational geometry
Similarity:
Quantitative Steinitz's Theorems with Applications to Multifingered Grasping.
D. Kirkpatrick, B. Mishra, Chee-Keng Yap (1992)
Discrete & computational geometry
Similarity:
Ammann Bars and Quasicrystals.
T. Stehling (1992)
Discrete & computational geometry
Similarity:
Tiling Polygons with Parallelograms.
S. Kannan, D. Soroker (1992)
Discrete & computational geometry
Similarity: