Quasi-optimal upper bounds for simplex range searching and new zone theorems
- 1 December 1992
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 8 (1-6), 407-429
- https://doi.org/10.1007/bf01758854
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A singly exponential stratification scheme for real semi-algebraic varieties and its applicationsTheoretical Computer Science, 1991
- Partitioning arrangements of lines II: ApplicationsDiscrete & Computational Geometry, 1990
- Triangulating a nonconvex polytopeDiscrete & Computational Geometry, 1990
- A deterministic view of random sampling and its use in geometryCombinatorica, 1990
- Triangles in space or building (and analyzing) castles in the airCombinatorica, 1990
- 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 Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987