How hard is half-space range searching?
- 1 July 1993
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 10 (2) , 143-155
- https://doi.org/10.1007/bf02573971
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- Quasi-optimal upper bounds for simplex range searching and new zone theoremsAlgorithmica, 1992
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- Convex bodies, economic cap coverings, random polytopesMathematika, 1988
- Halfplanar range search in linear space and O(n0.695) query timeInformation Processing Letters, 1986
- Geometric retrieval problemsInformation and Control, 1984
- Inherent complexity trade-offs for range query problemsTheoretical Computer Science, 1981
- A Lower Bound on the Complexity of Orthogonal Range QueriesJournal of the ACM, 1981
- On the mean value of the volume of a random polytope in a convex setArchiv der Mathematik, 1974
- The directions of the line segments and of the r ‐dimensional balls on the boundary of a convex body in Euclidean spaceMathematika, 1970
- A Theorem on Non-Homogeneous LatticesAnnals of Mathematics, 1952