Efficient Splitting and Merging Algorithms for Order Decomposable Problems

Information and Computation

Volumn 154, Issue 1, 1999, Pages 1-33

  Grossi, Roberto ^a,c   Italiano, Giuseppe F ^b,d  

^a UNIVERSITY OF FLORENCE   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^c UNIVERSITY OF PISA   (Italy)

^d UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346498278     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2811     Document Type: Article

References (42)

1. Aggarwal, A., Guibas, L., Saxe, J., and Shor, P. W. (1989), A linear-time algorithm for computing the Voronoi diagram of a convex polygon, Discrete Comput. Geom. 4, 591-604.
2. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. (1974), "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA.
3. Arge, L. (1997), personal communication.
4. Arge, L., and Vitter, J. S. (1996), Optimal dynamic interval management in external memory, in "37th IEEE Symp. on Foundations of Computer Science."
5. Bentley, J. L. (1975), Multidimensional binary search trees used for associated searching, Commun. ACM 19, 509-517.
6. Bentley, J. L. (1979), Decomposable searching problems, Inform. Process. Lett. 8, 244-251.
7. Bentley, J. L. (1980), Multidimensional divide-and-conquer, Commun. ACM 23, 214-229.
8. Bentley, J. L., and Saxe, J. L. (1980), Decomposable searching problems I. Static-to-dynamic transformation, J. Algorithms 1, 301-358.
9. Chiang, Y.-J., and Tamassia, R. (1992), Dynamic algorithms in computational geometry, Proc. IEEE (special issue on computational geometry, G. Toussaint, Ed.) 80, 1412-1434.
10. Dobkin, D., and Suri, S. (1991), Maintenance of geometric extrema, J. Assoc. Comput. Mach. 38, 275-298.
11. Edelsbrunner, H. (1983), A new approach to rectangle intersection, Part I, Int. J. Comput. Math. 13, 209-219.
12. Edelsbrunner, H., and Overmars, M. H. (1985), Batched dynamic solutions to decomposable searching problems, J. Algorithms 6, 515-542.
13. Finkel, R. A., and Bentley, J. L. (1974), Quad-trees: A data structure for retrieval of composite keys, Acta Inform. 4, 1-9.
14. Grossi, R., and Italiano, G. F. (1997), Efficient splitting and merging algorithms for order decomposable problems, in "Proc. 24th International Colloquium on Automata, Languages, and Programming (ICALP 97), Bologna, Italy, July 7-11," pp. 605-615, Lecture Notes in Computer Science, Springer-Verlag, Berlin.
15. Grossi, R., and Italiano, G. F. (1999), Efficient cross-trees for external memory, in "External Memory Algorithms and Visualization" (J. Abello and J. S. Vitter, Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS.
16. Gowda, I. G., and Kirkpatrick, G. F. (1980), Exploiting linear merging and extra storage in the maintenance of fully dynamic geometric data structures, in "Proc. 19th Allerton Conference on Communication, Control and Computing," pp. 1-10.
17. van Kreveld, M. J., and Overmars, M. H. (1991), Divided k-d trees, Algorithmica 6, 840-858.
18. van Kreveld, M. J., and Overmars, M. H. (1993), Union-copy structures and dynamic segment trees, J. Assoc. Comput. Mach. 40, 635-652.
19. van Kreveld, M. J., and Overmars, M. H. (1994), Concatenable structures for decomposable problems, Inform. Comput. 110, 130-148.
20. van Leeuwen, J., and Maurer, H. A. (1980), "Dynamic Systems of Static Data Structures," Technical Report 42, Technical University Graz.
21. van Leeuwen, J., and Overmars, M. H. (1981), The art of dynamizing, in "Proc. 10th Mathematical Foundations of Computer Science," Lecture Notes in Comput. Sci., Vol. 118, pp. 121-131, Springer-Verlag, New York/Berlin.
22. van Leeuwen, J., and Wood, D. (1980), Dynamization of decomposable searching problems, Inform. Process. Lett. 10, 51-56.
23. Maurer, H. A., and Ottmann, T. A. (1979), Dynamic solutions of decomposable searching problems, in "Discrete Structures and Algorithms" (U. Pape, Ed.), pp. 17-24, Hanser Verlag, Vienna.
24. McCallum, D., and Avis, D. (1979), A linear algorithm for finding the convex hull of a simple polygon, Inform. Process. Lett. 9, 201-206.
25. Mehlhorn, K. (1981), Lowerbounds on the efficiency of transforming static data structures into dynamic structures, Math. Systems Theory 15, 1-16.
26. Mehlhorn, K. (1984), "Multi-Dimensional Searching and Computational Geometry," EATCS Monographs on Theoretical Computer Science, Vol. 3, Springer-Verlag, Berlin/New York.
27. Mehlhorn, K., and Overmars, M. H. (1981), Optimal dynamization of decomposable searching problems, Inform. Process. Lett. 12, 93-98.
28. Nievergelt, J., and Reingold, E. M. (1973), Binary search trees of bounded balance, SIAM J. Comput. 2, 33-43.
29. Overmars, M. H. (1973), Dynamization of order decomposable set problems, J. Algorithms 2, 245-260.
30. Overmars, M. H. (1983), "The Design of Dynamic Data Structures," Lect. Notes in Comput. Sci., Vol. 156, Springer-Verlag, Berlin/New York.
31. Overmars, M. H., and van Leeuwen, J. (1981), Maintenance of configurations in the plane, J. Comput. System Sci. 23, 166-204.
32. Overmars, M. H., and van Leeuwen, J. (1981), Dynamization of decomposable searching problems yielding good worst-case bounds, in "Proc. 5th GI Conference on Theoretical Computer Science," Lect. Notes in Comput. Sci., Vol. 104, pp. 224-233, Springer-Verlag, New York/Berlin.
33. Overmars, M. H., and van Leeuwen, J. (1981), Some principles for dynamizing decomposable searching problems, Inform. Process. Lett. 12, 49-53.
34. Overmars, M. H., and van Leeuwen, J. (1981), Two general methods for dynamizing decomposable searching problems, Computing 26, 155-166.
35. Overmars, M., and van Leeuwen, J. (1981), Worst-case optimal insertion and deletion methods for decomposable searching problems, Inform. Process. Lett. 12, 168-173.
36. Overmars, M., and van Leeuwen, J. (1982), Dynamic multi-dimensional data structures based on quad- and k-d trees, Acta Inform. 17, 267-285.
37. Rao, N.S.V., Vaishnavi, V. K., and Iyengar, S. S. (1988), On the dynamization of data structures, BIT 28, 37-53.
38. Samet, H., Bibliography on quad-trees and related hierarchical data structures, in "Data Structures for Raster Graphics" (L. Kessenaar, F. Peters, and M. van Lierop, Eds.), pp. 181-201, Springer-Verlag, Berlin.
39. Scholten, H. W., and Overmars, M. H. (1989), General methods for adding range restrictions to decomposable searching problems, J. Symbolic Comput. 7, 1-10.
40. Shamos, M. I., and Hoey, D. (1975), Closest-point problems, in "16th IEEE Symp. Foundations of Computer Science," pp. 151-162.
41. Smid, M. (1990), Algorithms for semi-online updates on decomposable problems, in "Proc. 2nd Canadian Conference in Computational Geometry," pp. 347-350.
42. Willard, D. E., and Lueker, G. S. (1985), Adding range restriction capability to dynamic data structures, J. Assoc. Comput. Mach. 32, 597-617.