Lower Bounds on Moving a Ladder in Two and Three Dimensions.
Y. Ke, Joseph O'Rourke (1988)
Discrete & computational geometry
Similarity:
Displaying similar documents to “How Hard Is Half-Space Range Searching?”
Lower Bounds on Moving a Ladder in Two and Three Dimensions.
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.
M. Sharir, D. Halperin (1994)
Discrete & computational geometry
Similarity:
Lower-Bound Theorems for Pseudomanifolds.
Tiong-Seng Tay (1995)
Discrete & computational geometry
Similarity:
On Range Searching with Semialgebraic Sets.
J. Matousek, P.K. Agarwal (1994)
Discrete & computational geometry
Similarity:
Halfspace Range Search: An Algorithmic Application of k-Sets.
B. Chazelle, F.P. Preparata (1986)
Discrete & computational geometry
Similarity:
An Upper Bound for Conforming Delaunay Triangulations.
H. Edelsbrunner, Tiow Seng Tan (1993)
Discrete & computational geometry
Similarity:
Bounds on the Size of Tetrahedralizations.
B. Chazelle, N. Shouraboura (1995)
Discrete & computational geometry
Similarity:
Tight Upper Bounds for the Discrepancy of Half-Spaces.
J. Matousek (1995)
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:
Counting Facets and Incidences.
P.K. Agarwal, B. Aronov (1992)
Discrete & computational geometry
Similarity:
On the Average Number of k-Sets.
M. Pellegrini, P.W. Shor (1992)
Discrete & computational geometry
Similarity: