Construction of e-Nets.
J. Matousek (1990)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Cutting Hyperplanes for Divide-and-Conquer.”
Construction of e-Nets.
Constructing Arrangements Optimally in Parallel.
M.T. Goodrich (1993)
Discrete & computational geometry
Similarity:
Computing Simple Circuits from a Set of Line Segments.
D. Rappaport, H. Imai, G.T. Toussaint (1990)
Discrete & computational geometry
Similarity:
On Lines Missing Polyhedral Sets in 3-Space.
M. Pellegrini (1994)
Discrete & computational geometry
Similarity:
Triangulating Point Sets in Space.
D. Avis, Hossam ElGindy (1987)
Discrete & computational geometry
Similarity:
Nonrealizability Proofs in Computational Geometry.
B. Sturmfels, J. Bokowski, J. Richter (1990)
Discrete & computational geometry
Similarity:
Diameter, Width, Closest Line Pair, and Parametric Searching.
H. Edelsbrunner, B. Chazelle, M. Sharir, L. Guibas (1993)
Discrete & computational geometry
Similarity:
On Lazy Randomized Incremental Construction.
O. Schwarzkopf, M. de Berg, K. Dobrindt (1995)
Discrete & computational geometry
Similarity:
Polyhedral Line Transversals in Space.
D. Avis, Rephael Wenger (1988)
Discrete & computational geometry
Similarity:
On the Coordinatization of Oriented Matroids.
J. Bokowski, Bernd Sturmfels (1986)
Discrete & computational geometry
Similarity:
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
R.A. Dwyer (1991)
Discrete & computational geometry
Similarity: