A data structure for multi-dimensional range reporting

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 344-353

  Nekrich, Yakov ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Algorithms; Computational geometry; Data structures; Orthogonal range reporting

Indexed keywords

ORTHOGONAL RANGE REPORTING; POLYLOGARITHMIC TIME;

ALGORITHMS; COMPUTATIONAL GEOMETRY; QUERY LANGUAGES;

DATA STRUCTURES;

EID: 35348914306     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247130     Document Type: Conference Paper

References (17)

1. S. Alstrup, G. S. Brodai, T. Rauhe, New Data Structures for Orthogonal Range Searching, Proc. FOCS 2000, 198-207.
2. P. K. Agarwal, J. Erickson, Geometric Range Searching and its Relatives, in "Advances in Discrete and Computational Geometry", 1-56. AMS Press, Providence, RI, 1999.
3. A. Andersson, Faster Deterministic Sorting and Searching in Linear Space, Proc. FOCS 1996, 135-141.
4. M. A. Bender, R. Cole, E. D. Demaine, M. Farach-Colton, J. Zito, Two Simplified Algorithms for Maintaining Order in a List, Proc. ESA 2002, 152-164.
5. J. L. Bentley, Decomposable Searching Problems, Information Processing Letters 8(5), 244-251 (1979).
6. M. de Berg, M. J. van Kreveld, J. Snoeyink, Two-and Three-Dimensional Point Location in Rectangular Subdivisions, J. Algorithms 18(2), 256-277 (1995).
7. B. Chazelle, A Functional Approach to Data Structures and its Use in Multidimensional Searching, SIAM J. on Computing 17, 427-462 (1988).
8. J. L. Chiang, R. Tamassia, Dynamic Algorithms in Computational Geometry, Technical Report CS-91-24, Dept. of Computer Science, Brown University, 1991.
9. P. van Emde Boas, Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space, Inf. Process. Lett. 6(3), 80-82 (1977).
10. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Springer 1984.
11. C. W. Mortensen, Fully Dynamic Orthogonal Range Reporting on RAM, SIAM J. Computing 35(6), 1494-1525 (2006).
12. Y. Nekrich, Space Efficient Dynamic Orthogonal Range Reporting, Proc. Symposium on Computational Geometry 2005, 306-313
13. M. H. Overmars, Design of Dynamic Data Structures, Springer-Verlag New York, Inc., Secaucus, NJ, 1987.
14. M. H. Overmars, Efficient Data Structures for Range Searching on a Grid, J. Algorithms 9(2), 254-275 (1988).
15. S. Subramanian, S. Ramaswamy, The P-range Tree: A New Data Structure for Range Searching in Secondary Memory, Proc. SODA 1995, 378-387.
16. D. E. Vengroff, J. S. Vitter, Efficient 3-D Range Searching in External Memory, Proc. STOC 1996, 192-201.
17. D. E. Willard, A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time, Information and Computation 97, 150-204 (1992).