Range searching with efficient hierarchical cuttings
- 1 July 1993
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 10 (2) , 157-182
- https://doi.org/10.1007/bf02573972
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Applications of a new space partitioning techniquePublished by Springer Nature ,2005
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- Quasi-optimal upper bounds for simplex range searching and new zone theoremsAlgorithmica, 1992
- Partitioning arrangements of lines I: An efficient deterministic algorithmDiscrete & Computational Geometry, 1990
- A deterministic view of random sampling and its use in geometryCombinatorica, 1990
- Implicitly representing arrangements of lines or segmentsDiscrete & Computational Geometry, 1989
- Quasi-optimal range searching in spaces of finite VC-dimensionDiscrete & Computational Geometry, 1989
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- Space searching for intersecting objectsJournal of Algorithms, 1987
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987