Construction of e-Nets.
J. Matousek (1990)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Counting Facets and Incidences.”
Construction of e-Nets.
Cutting Hyperplane Arrangements.
J. Matousek (1991)
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:
On Levels in Arrangements and Voronoi Diagrams.
K. Mulmuley (1991)
Discrete & computational geometry
Similarity:
Constructing Arrangements Optimally in Parallel.
M.T. Goodrich (1993)
Discrete & computational geometry
Similarity:
Partitioning Arrangements of Lines, II: Applications.
P.K. Agarwal (1990)
Discrete & computational geometry
Similarity:
Castles in the Air Revisited.
M. Sharir, B. Aronov (1994)
Discrete & computational geometry
Similarity:
How Hard Is Half-Space Range Searching?
J. Pach, B. Chazelle, H. Brönnimann (1993)
Discrete & computational geometry
Similarity:
On the Number of Views of Polyhedral Terrains.
M. Sharir, P.K. Agarwal (1994)
Discrete & computational geometry
Similarity:
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.
H. Edelsbrunner, Micha Sharir, Leonidas J. Guibas (1989)
Discrete & computational geometry
Similarity:
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.
M. Sharir, D. Halperin (1994)
Discrete & computational geometry
Similarity: