Counting Facets and Incidences.
P.K. Agarwal, B. Aronov (1992)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Lower Bounds on the Length of Monotone Paths in Arrangements.”
Counting Facets and Incidences.
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.
M. Sharir, D. Halperin (1994)
Discrete & computational geometry
Similarity:
The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces.
H. Edelsbrunner (1989)
Discrete & computational geometry
Similarity:
On Levels in Arrangements and Voronoi Diagrams.
K. Mulmuley (1991)
Discrete & computational geometry
Similarity:
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:
Partitioning Arrangements of Lines, II: Applications.
P.K. Agarwal (1990)
Discrete & computational geometry
Similarity:
A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem.
K.L. Clarkson (1993)
Discrete & computational geometry
Similarity:
How Hard Is Half-Space Range Searching?
J. Pach, B. Chazelle, H. Brönnimann (1993)
Discrete & computational geometry
Similarity:
Construction of e-Nets.
J. Matousek (1990)
Discrete & computational geometry
Similarity:
Voroni Diagrams and Arrangements.
H. Edelsbrunner, Raimund Seidel (1986)
Discrete & computational geometry
Similarity: