On range searching with semialgebraic sets
Open Access
- 1 April 1994
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 11 (4), 393-418
- https://doi.org/10.1007/bf02574015
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Intersection Queries in Curved ObjectsJournal of Algorithms, 1993
- Ray Shooting and Parametric SearchSIAM Journal on Computing, 1993
- On the zone of a surface in a hyperplane arrangementDiscrete & Computational Geometry, 1993
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- Applications of a new space-partitioning techniqueDiscrete & Computational Geometry, 1993
- Ray Shooting and Other Applications of Spanning Trees with Low Stabbing NumberSIAM Journal on Computing, 1992
- Efficient ray shooting and hidden surface removalPublished by Association for Computing Machinery (ACM) ,1991
- Solving query-retrieval problems by compacting Voronoi diagramsPublished by Association for Computing Machinery (ACM) ,1990
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimensionPublished by Association for Computing Machinery (ACM) ,1987