Space efficient dynamic orthogonal range reporting

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 306-313

  Nekrich, Yakov ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Algorithms and data structures; Computational geometry; Dynamic data structures; Orthogonal range searching

Indexed keywords

ALGORITHMS AND DATA STRUCTURES; DYNAMIC DATA STRUCTURES; ORTHOGONAL RANGE SEARCHING;

ALGORITHMS; COMPUTATIONAL GEOMETRY;

DATA STRUCTURES;

EID: 33244497359     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064139     Document Type: Conference Paper

References (21)

1. P. K. Agarwal, L. Arge, A. Danner, B. Holland-Minkley "Cache-oblivious data structures for orthogonal range searching."Proc. 9th Symp. on Computational Geometry , 237-245, 2003.
2. P. K. Agarwal and J. Erickson "Geometric range searching and its relatives" In B. Chazelle, J. E. Goodman, and R. Pollack, editors, "Advances in Discrete and Computational Geometry", vol. 23 of Contemporary Mathematics, 1-56. AMS Press, Providence, RI, 1999. Available at http://citeseer.ist.psu.edu/article/agarwal99geometric.html.
3. S. Alstrup, G. S. Brodal, T. Rauhe " New Data Structures for Orthogonal Range Searching", Proc. 41st FOCS, 198-207, 2000.
4. M. A. Bender, E. D. Demaine, M. Farach-Colton "Cache-Oblivious B-Trees", Proc. 41st FOCS, 399-409 , 2000.
5. B. Chazelle "Filtering Search: A New Approach To Query Answering", SIAM J. on Computing, 1986, vol. 15, 703-724.
6. B. Chazelle "A Functional Approach to Dynamic Data Structures", SIAM J. on Computing, vol. 17, 1988, 427-462.
7. B. Chazelle "Lower Bounds for Orthogonal Range Search II. The Arithmetic Model", J. of the ACM, vol. 37, 1990, 439-463.
8. J. L. Chiang, R. Tamassia "Dynamic Algorithms in Computational Geometry", Technical Report CS-91-24, Dept. of Computer Science, Brown University, 1991.
9. A. Itai, A. G. Konheim, M. Rodeh "A Sparse Table Implementation of Priority Queues", Proc. 8th ICALP,417-431, 1981.
10. M. Van Kreveld and M.H. Overmars " Divided K-d Trees", Tech. Report RUU-CS-88-28, Dept. of Comp. Science, Univ. of Utrecht.
11. M. Van Kreveld and M.H. Overmars "Concatenable Structures for Decomposable Problems" Tech. Report RUU-CS-89-16, Dept. of Comp. Science, Univ. of Utrecht.
12. G. S. Lueker "A Data Structure for Orthogonal Range Queries", 19th ACM Symp. on Foundations of Computer Science, 28-34, 1978.
13. Kurt Mehlhorn "Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry" Springer-Verlag New York, Inc., New York, NY, 1984.
14. K. Mehlhorn and S. Näher "Dynamic Fractional Cascading" , Algorithmica vol. 5, 1990, 215-241.
15. E.M. McCreight "Priority Search Trees", SIAM J. on Computing, vol. 14, 1985, 257-276.
16. C. W. Mortenesen "Fully Dynamic Two Dimensional Orthogonal Range and Line Segment Intersection Reporting in Logarithmic Time" Proc. of the 14th ACM-SIAM Symposium on Discrete Algorithms, 618-627, 2003.
17. M. H. Overmars "Design of Dynamic Data Structures" Springer-Verlag New York, Inc., Secaucus, NJ, 1987.
18. R.E. Tarjan "A Class of Algorithms Which Require Nonlinear Time to Maintain Disjoint Sets", JCSS, vol. 18, 1979, 110-127.
19. D. E. Willard "New Data Structures for Orthogonal Range Queries", SIAM J. on Computing, vol. 14, 1985, 232-253.
20. D. E. Willard "Multidimensional Search Trees That Provide New Types of Memory Reductions", J. of the ACM, vol. 34, 1987, 846-858.
21. D. E. Willard "Applications of Range Query Theory to Relational Data Base Join and Select Operations", Journal of Computer and System Sciences, vol. 52, 1996, 157-169.