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:
Displaying similar documents to “An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.”
An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
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:
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:
Triangulating Point Sets in Space.
D. Avis, Hossam ElGindy (1987)
Discrete & computational geometry
Similarity:
An Efficient Algorithm for Guard Placement in Polygons with Holes.
I. Bjorling-Sachs, D.L. Souvaine (1995)
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:
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:
Geometry of the Gass-Saaty Parametric Cost LP Algorithm.
V. Klee, P. Kleinschmidt (1990)
Discrete & computational geometry
Similarity:
On Lazy Randomized Incremental Construction.
O. Schwarzkopf, M. de Berg, K. Dobrindt (1995)
Discrete & computational geometry
Similarity:
Halfspace Range Search: An Algorithmic Application of k-Sets.
B. Chazelle, F.P. Preparata (1986)
Discrete & computational geometry
Similarity: