Geometric range searching
- 1 December 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 26 (4), 422-461
- https://doi.org/10.1145/197405.197408
Abstract
No abstract availableKeywords
This publication has 83 references indexed in Scilit:
- On range searching with semialgebraic setsDiscrete & Computational Geometry, 1994
- Counting Circular Arc IntersectionsSIAM Journal on Computing, 1993
- Ray Shooting and Parametric SearchSIAM Journal on Computing, 1993
- Selecting distances in the planeAlgorithmica, 1993
- On the zone of a surface in a hyperplane arrangementDiscrete & Computational Geometry, 1993
- Applications of a new space-partitioning techniqueDiscrete & Computational Geometry, 1993
- Partitioning arrangements of lines II: ApplicationsDiscrete & Computational Geometry, 1990
- Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimensionPublished by Association for Computing Machinery (ACM) ,1987
- Non-partitionable point setsInformation Processing Letters, 1984
- Multidimensional divide-and-conquerCommunications of the ACM, 1980