On range searching with semialgebraic sets
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Applications of a new space partitioning techniquePublished by Springer Nature ,2005
- A deterministic view of random sampling and its use in geometryCombinatorica, 1990
- Solving query-retrieval problems by compacting Voronoi diagramsPublished by Association for Computing Machinery (ACM) ,1990
- Quasi-optimal upper bounds for simplex range searching and new zone theoremsPublished by Association for Computing Machinery (ACM) ,1990
- Applications of random sampling in computational geometry, IIDiscrete & 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
- A singly-exponential stratification scheme for real semi-algebraic varieties and its applicationsPublished by Springer Nature ,1989
- Space searching for intersecting objectsJournal of Algorithms, 1987
- Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimensionPublished by Association for Computing Machinery (ACM) ,1987