New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.
M. Sharir, D. Halperin (1994)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Bounds on the Size of Tetrahedralizations.”
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.
How Hard Is Half-Space Range Searching?
J. Pach, B. Chazelle, H. Brönnimann (1993)
Discrete & computational geometry
Similarity:
Lower Bounds on Moving a Ladder in Two and Three Dimensions.
Y. Ke, Joseph O'Rourke (1988)
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:
Tight Upper Bounds for the Discrepancy of Half-Spaces.
J. Matousek (1995)
Discrete & computational geometry
Similarity:
Lower-Bound Theorems for Pseudomanifolds.
Tiong-Seng Tay (1995)
Discrete & computational geometry
Similarity:
Computing the Volume is Difficult.
I. Bárány, Zoltán Füredi (1987)
Discrete & computational geometry
Similarity:
An Upper Bound for Conforming Delaunay Triangulations.
H. Edelsbrunner, Tiow Seng Tan (1993)
Discrete & computational geometry
Similarity:
Counting Facets and Incidences.
P.K. Agarwal, B. Aronov (1992)
Discrete & computational geometry
Similarity:
An Elementary Approach to Lower Bounds in Geometric Discrepancy.
B. Chazelle, M. Sharir, J. Matousek (1995)
Discrete & computational geometry
Similarity:
On the Number of Views of Polyhedral Terrains.
M. Sharir, P.K. Agarwal (1994)
Discrete & computational geometry
Similarity: