A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
Leonidas J. Guibas, Peter W. Shor, A. Aggarwal, James Saxe (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 Optimal Convex Hull Algorithm in Any Fixed Dimension.”
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
A Postscript on Distances in Convex n-Gons.
P. Erdös, P. Fishburn (1994)
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:
The Order of Points on the Second Convex Hull of a Simple Polygon.
A. Garcia, J. Tejel (1995)
Discrete & computational geometry
Similarity:
On the Modality of Convex Polygons.
K. Abrahamson (1990)
Discrete & computational geometry
Similarity:
The Different Ways of Stabbing Disjoint Convex Sets.
M. Katchalski, T. Lewis, A. Liu (1992)
Discrete & computational geometry
Similarity:
On the Expected Number of k-Sets.
I. Bárány, W. Steiger (1994)
Discrete & computational geometry
Similarity:
On Convex Body Chasing.
J. Friedman, N. Linial (1993)
Discrete & computational geometry
Similarity:
An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.
K. Kedem, M. Sharir (1990)
Discrete & computational geometry
Similarity:
Generalized Breadths, Circular Cantor Sets, and the Least Area UCC .
Gy. Elekes (1994)
Discrete & computational geometry
Similarity:
Computing the Volume is Difficult.
I. Bárány, Zoltán Füredi (1987)
Discrete & computational geometry
Similarity: