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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “An Efficient Algorithm for Guard Placement in Polygons with Holes.”
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon.
Shortest Watchman Routes in Simple Polygons.
Wei-Pang Chin, S. Ntafos (1991)
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:
Triangulating Point Sets in Space.
D. Avis, Hossam ElGindy (1987)
Discrete & computational geometry
Similarity:
Separating Two Simple Polygons by a Sequence of Translations.
R. Pollack, M. Sharir, S. Sifrony (1988)
Discrete & computational geometry
Similarity:
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
R.A. Dwyer (1991)
Discrete & computational geometry
Similarity:
Diameter Partitioning.
D. Avis (1986)
Discrete & computational geometry
Similarity:
Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.
P.K. Agarwal (1990)
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:
Geometry of the Gass-Saaty Parametric Cost LP Algorithm.
V. Klee, P. Kleinschmidt (1990)
Discrete & computational geometry
Similarity:
An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.
J.H. Conway, N.J.A. Sloane (1992)
Discrete & computational geometry
Similarity: