Linear Space Data Structures for Two Types of Range Search.
B. Chazelle, Herbert Edelsbrunner (1987)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Range Searching with Efficient Hierarchical Cuttings.”
Linear Space Data Structures for Two Types of Range Search.
Halfspace Range Search: An Algorithmic Application of k-Sets.
B. Chazelle, F.P. Preparata (1986)
Discrete & computational geometry
Similarity:
On Range Searching with Semialgebraic Sets.
J. Matousek, P.K. Agarwal (1994)
Discrete & computational geometry
Similarity:
On Lazy Randomized Incremental Construction.
O. Schwarzkopf, M. de Berg, K. Dobrindt (1995)
Discrete & computational geometry
Similarity:
On the Average Number of k-Sets.
M. Pellegrini, P.W. Shor (1992)
Discrete & computational geometry
Similarity:
Nonrealizability Proofs in Computational Geometry.
B. Sturmfels, J. Bokowski, J. Richter (1990)
Discrete & computational geometry
Similarity:
Shelling Pseudopolyhedra.
P. Goossens (1992)
Discrete & computational geometry
Similarity:
...-Morphic Sets of Prototiles.
P. Schmitt (1987)
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: