Halfspace Range Search: An Algorithmic Application of k-Sets.
B. Chazelle, F.P. Preparata (1986)
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.
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.
The search session has expired. Please query the service again.
Displaying similar documents to “On Lazy Randomized Incremental Construction.”
Halfspace Range Search: An Algorithmic Application of k-Sets.
Algorithms for Ham Sandwich Cuts.
J. Matousek, W. Steiger, Chi-Yuan Lo (1994)
Discrete & computational geometry
Similarity:
On the Average Number of k-Sets.
M. Pellegrini, P.W. Shor (1992)
Discrete & computational geometry
Similarity:
...-Morphic Sets of Prototiles.
P. Schmitt (1987)
Discrete & computational geometry
Similarity:
Shelling Pseudopolyhedra.
P. Goossens (1992)
Discrete & computational geometry
Similarity:
Quantitative Steinitz's Theorems with Applications to Multifingered Grasping.
D. Kirkpatrick, B. Mishra, Chee-Keng Yap (1992)
Discrete & computational geometry
Similarity:
Ammann Bars and Quasicrystals.
T. Stehling (1992)
Discrete & computational geometry
Similarity:
Editors' Notice.
J.E. Goodman, R. Pollack (1993)
Discrete & computational geometry
Similarity:
A New Step in the Solution of the Szökefalvi-Nagy Problem.
V.G. Boltyanski (1992)
Discrete & computational geometry
Similarity: