Space efficient dynamic orthogonal range reporting

Algorithmica (New York)

Volumn 49, Issue 2, 2007, Pages 94-108

  Nekrich, Y ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

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

Indexed keywords

DYNAMIC DATA STRUCTURES; ORTHOGONAL RANGE SEARCHING; SEARCH TIME;

ALGORITHMS; COMPUTATIONAL GEOMETRY; QUERY LANGUAGES; RANDOM ACCESS STORAGE; STORAGE ALLOCATION (COMPUTER);

DATA STRUCTURES;

EID: 35348916578     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9030-9     Document Type: Article

References (25)

1. P.K. Agarwal J. Erickson 1999 Geometric range searching and its relatives B. Chazelle J.E. Goodman R. Pollack Advances in Discrete and Computational Geometry Contemporary Mathematics 23 Am. Math. Soc. Providence 1 56 Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 23, pp. 1-56. Am. Math. Soc., Providence (1999). Available at http://citeseer.ist.psu.edu/article/ agarwal99geometric.html
2. Agarwal, P.K., Arge, L., Danner, A., Holland-Minkley, B.: Cache-oblivious data structures for orthogonal range searching. In: Proc. 9th Symp. on Computational Geometry, pp. 237-245 (2003)
3. Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: Proc. 41st FOCS, pp. 198-207 (2000)
4. Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious B-trees. In: Proc. 41st FOCS, pp. 399-409 (2000)
5. Chazelle, B.: Filtering search: a new approach to query answering. SIAM J. Comput. 15, 703-724 (1986)
6. Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17, 427-462 (1988)
7. Chazelle, B.: Lower bounds for orthogonal range search II. The arithmetic model. J. ACM 37, 439-463 (1990)
8. Chiang, J.L., Tamassia, R.: Dynamic algorithms in computational geometry. Technical Report CS-91-24, Dept. of Computer Science, Brown University (1991)
9. Gabow, H., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. 16th STOC, pp. 135-143 (1984)
10. Goodman, J.E., O'Rourke, J. (ed.): Handbook of Discrete and Computational Geometry, 2nd edn. CRC Press (April 2004)
11. Itai, A., Konheim, A.G., Rodeh, M.: A sparse table implementation of priority queues. In: Proc. 8th ICALP, pp. 417-431 (1981)
12. Klein, R., Nurmi, O., Ottman, T., Wood, D.: A dynamic fixed windowing problem. Algorithmica 4, 535-550 (1989)
13. Lueker, G.S.: A data structure for orthogonal range queries. In: Proc. 19th FOCS, pp. 28-34 (1978)
14. McCreight, E.M.: Priority search trees. SIAM J. Comput. 14, 257-276 (1985)
15. Mehlhorn, K.: Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. Springer, New York (1984)
16. Mehlhorn, K., Näher, S.: Dynamic fractional cascading. Algorithmica 5, 215-241 (1990)
17. Mortensen, C.W.: Fully dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time. In: Proc. of the 14th SODA, pp. 618-627 (2003)
18. Mortensen, C.W.: Fully dynamic orthogonal range reporting on RAM. SIAM J. Comput. 35, 1494-1525 (2006)
19. Overmars, M.H.: Design of Dynamic Data Structures. Springer, New York (1987)
20. Tarjan, R.E.: A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput. Syst. Sci. 18, 110-127 (1979)
21. Van Kreveld, M., Overmars, M.H.: Divided K-d trees. Algorithmica 6(6), 840-858 (1991)
22. Van Kreveld, M., Overmars M.H.: Concatenable structures for decomposable problems, Inf. Comput. 110(1), 130-148 (1994)
23. Willard, D.E.: New data structures for orthogonal range queries. SIAM J. Comput. 14, 232-253 (1985)
24. Willard, D.E.: Multidimensional search trees that provide new types of memory reductions. J. ACM 34, 846-858 (1987)
25. Willard, D.E.: Applications of range query theory to relational data base join and select operations. J. Comput. Syst. Sci. 52, 157-169 (1996)