A Fast Las Vegas Algorithm for Triangulating a Simple Polygon.
Robert E. Tarjan, K.L. Clarkson, Christopher J. van Wyk (1989)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Geometry of the Gass-Saaty Parametric Cost LP Algorithm.”
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon.
An Efficient Algorithm for Guard Placement in Polygons with Holes.
I. Bjorling-Sachs, D.L. Souvaine (1995)
Discrete & computational geometry
Similarity:
Triangulating Point Sets in Space.
D. Avis, Hossam ElGindy (1987)
Discrete & computational geometry
Similarity:
Diameter Partitioning.
D. Avis (1986)
Discrete & computational geometry
Similarity:
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time.
A. Mukhopadhyay, S. Jadhav (1994)
Discrete & computational geometry
Similarity:
Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.
P.K. Agarwal (1990)
Discrete & computational geometry
Similarity:
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
R.A. Dwyer (1991)
Discrete & computational geometry
Similarity:
An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.
P.M. Vaidya (1989)
Discrete & computational geometry
Similarity:
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
S. Suri, C. Monma (1992)
Discrete & computational geometry
Similarity:
An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
C.K. Yap (1987)
Discrete & computational geometry
Similarity:
Computing Circular Separability.
J. O'Rourke, S.Rao Kosaraju, Nimrod Megiddo (1986)
Discrete & computational geometry
Similarity: