Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions.
M. Sharir (1994)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Almost Tight Bounds for e-Nets.”
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions.
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.
M. Sharir, D. Halperin (1994)
Discrete & computational geometry
Similarity:
Tight Upper Bounds for the Discrepancy of Half-Spaces.
J. Matousek (1995)
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:
Bounds on the Size of Tetrahedralizations.
B. Chazelle, N. Shouraboura (1995)
Discrete & computational geometry
Similarity:
How Hard Is Half-Space Range Searching?
J. Pach, B. Chazelle, H. Brönnimann (1993)
Discrete & computational geometry
Similarity:
Lower-Bound Theorems for Pseudomanifolds.
Tiong-Seng Tay (1995)
Discrete & computational geometry
Similarity:
An Elementary Approach to Lower Bounds in Geometric Discrepancy.
B. Chazelle, M. Sharir, J. Matousek (1995)
Discrete & computational geometry
Similarity:
Counting Facets and Incidences.
P.K. Agarwal, B. Aronov (1992)
Discrete & computational geometry
Similarity:
An Upper Bound on the Number of Planar K-Sets.
J. Pach, E. Szemeredi, W. Steiger (1992)
Discrete & computational geometry
Similarity: