Counting Facets and Incidences.
P.K. Agarwal, B. Aronov (1992)
Discrete & computational geometry
Similarity:
Displaying similar documents to “A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem.”
Counting Facets and Incidences.
Lower-Bound Theorems for Pseudomanifolds.
Tiong-Seng Tay (1995)
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:
An Upper Bound for Conforming Delaunay Triangulations.
H. Edelsbrunner, Tiow Seng Tan (1993)
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:
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:
Cutting Hyperplane Arrangements.
J. Matousek (1991)
Discrete & computational geometry
Similarity:
Lower Bounds for the Numbers of Antipodal Pairs and Strictly Antipodal Pairs of Vertices in a Convex Polytope.
V. Soltan, Mahn Hung Nguyen (1994)
Discrete & computational geometry
Similarity:
Bounds on the Size of Tetrahedralizations.
B. Chazelle, N. Shouraboura (1995)
Discrete & computational geometry
Similarity:
On Levels in Arrangements and Voronoi Diagrams.
K. Mulmuley (1991)
Discrete & computational geometry
Similarity:
Lower Bounds on the Length of Monotone Paths in Arrangements.
J. Matousek (1991)
Discrete & computational geometry
Similarity: