How hard is half-space range searching?

Discrete & Computational Geometry

Volumn 10, Issue 1, 1993, Pages 143-155

  Brönnimann, Hervé ^a   Chazelle, Bernard ^a   Pach, János ^b,c  

^a PRINCETON UNIVERSITY   (United States)

^b CITY COLLEGE OF NEW YORK   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 51249163483     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/BF02573971     Document Type: Article

References (29)

1. Applications of a new partitioning scheme
2. Convex bodies, economic cap coverings, random polytopes
3. Inherent complexity trade-offs for range query problems
4. Lower bounds on the complexity of polytope range searching
5. Lower bounds for orthogonal range searching: I. The reporting case
6. Lower bounds for orthogonal range searching: II. The arithmetic model
7. The complexity of computing partial sums off-line
8. Lower bounds on the complexity of simplex range reporting on a pointer machine
9. Quasi-optimal upper bounds for simplex range searching and new zone theorems
10. Quasi-optimal range searching in spaces of finite VC-dimension
11. Applications of random sampling to computational geometry, II
12. Geometric retrieval problems
13. Halfplanar range search in linear space and O(n0.695) query time
14. The directions of the line segments and of the r-dimensional balls on the boundary of a convex body in Euclidean space
15. A lower bound on the complexity of orthogonal range queries
16. Lower bounds on the complexity of some optimal data structures
17. On the mean value of the volume of a random polytope in a convex set
18. Epsilon-nets and simplex range queries
19. A theorem on non-homogeneous lattices
20. Polygon retrieval
21. On the complexity of maintaining partial sums