Cutting Hyperplane Arrangements.
J. Matousek (1991)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Constructing Arrangements Optimally in Parallel.”
Cutting Hyperplane Arrangements.
Partitioning Arrangements of Lines, II: Applications.
P.K. Agarwal (1990)
Discrete & computational geometry
Similarity:
On Levels in Arrangements and Voronoi Diagrams.
K. Mulmuley (1991)
Discrete & computational geometry
Similarity:
Construction of e-Nets.
J. Matousek (1990)
Discrete & computational geometry
Similarity:
Arrangements of Segments that Share Endpoints: Single Face Results.
K. Kedem, D. Halperin, E.M. Arkin, J. S. B. Mitchell, N. Naor (1995)
Discrete & computational geometry
Similarity:
Voroni Diagrams and Arrangements.
H. Edelsbrunner, Raimund Seidel (1986)
Discrete & computational geometry
Similarity:
The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.
H. Edelsbrunner, L.J. Guibas, M. Sharir (1990)
Discrete & computational geometry
Similarity:
Arrangements of Lines with a Minimum Number of Triangles Are Simple.
J.P. Roudneff (1988)
Discrete & computational geometry
Similarity:
Dynamic Point Location in Arrangements of Hyperplanes.
J. Matousek (1992)
Discrete & computational geometry
Similarity:
Counting Facets and Incidences.
P.K. Agarwal, B. Aronov (1992)
Discrete & computational geometry
Similarity:
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions.
L.J. Guibas, M. Sharir, J. Matousek, D. Halperin (1995)
Discrete & computational geometry
Similarity: