Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.
P.K. Agarwal (1990)
Discrete & computational geometry
Similarity:
Displaying similar documents to “A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.”
Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.
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:
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:
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
R.A. Dwyer (1991)
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:
An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.
K. Kedem, M. Sharir (1990)
Discrete & computational geometry
Similarity:
Cutting Hyperplanes for Divide-and-Conquer.
B. Chazelle (1993)
Discrete & computational geometry
Similarity:
On the Coordinatization of Oriented Matroids.
J. Bokowski, Bernd Sturmfels (1986)
Discrete & computational geometry
Similarity:
An Optimal Convex Hull Algorithm in Any Fixed Dimension.
B. Chazelle (1993)
Discrete & computational geometry
Similarity:
A Geometric Inequality and the Complexity of Computing Volume.
G. Elekes (1986)
Discrete & computational geometry
Similarity:
Diameter Partitioning.
D. Avis (1986)
Discrete & computational geometry
Similarity: