A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
S. Suri, C. Monma (1992)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.”
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
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:
Voroni Diagrams and Arrangements.
H. Edelsbrunner, Raimund Seidel (1986)
Discrete & computational geometry
Similarity:
Cutting Hyperplanes for Divide-and-Conquer.
B. Chazelle (1993)
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:
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
R.A. Dwyer (1991)
Discrete & computational geometry
Similarity:
Constructing Arrangements Optimally in Parallel.
M.T. Goodrich (1993)
Discrete & computational geometry
Similarity:
On the Coordinatization of Oriented Matroids.
J. Bokowski, Bernd Sturmfels (1986)
Discrete & computational geometry
Similarity:
Triangulating Point Sets in Space.
D. Avis, Hossam ElGindy (1987)
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:
Diameter Partitioning.
D. Avis (1986)
Discrete & computational geometry
Similarity: