Efficient splitting and merging algorithms for order decomposable problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 605-615

  Grossi, Roberto ^a   Italiano, Giuseppe F ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORESTRY;

D-DIMENSIONAL SEARCH TREES; DECOMPOSABLE PROBLEMS; EXTERNAL MEMORY; MEMBERSHIP QUERY; NOVEL TECHNIQUES; OUTPUT-SENSITIVE; PRIORITY QUEUES; SPLITTING AND MERGING;

ROBOTS;

EID: 84951073330     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_215     Document Type: Conference Paper

References (29)

1. A. Aggarwal, L. Guibas, J. Saxe and P.W. Shor, A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete and Computational Geometry 4 (1989), 591-604.
2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
3. L. Arge and J.S. Vitter, Optimal dynamic interval management in external memory. 37th IEEE Symp. on Foundations of Computer Science (1996).
4. R. Bayer and C. MeCreight, Organization and maintenance of large ordered indexes. Acta Informatica 1, 3 (1972), 173-189.
5. J.L. Bentley, Multidimensional binary search trees used for associated searching. Comm. ACM, 19 (1975), 509-517.
6. J.L. Bentley, Decomposable Searching Problems. Information Processing Letters, 8 (1979), 244-251.
7. J.L. Bentley and J.B. Saxe, Decomposable Searching Problems I. Static-to-Dynamic Transformation. J. of Algorithms, 1 (1980), 301-358.
8. Y.-J. Chiang and R. Tamassia, Dynamic Algorithms in Computational Geometry, Proceedings of the IEEE, Special issue on Computational Geometry, G. Toussaint, ed., 80 (1992) 1412-1434.
9. R.A. Finkel and J.L. Bentley, Quad-trees: a data structure for retrieval of composite keys. Acta Inform., 4 (1974), 1-9.
10. I.G. Gowda and D.G. Kirkpatrick, 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 (1980), 1-10.
11. M.J. van Kreveld and M.H. Overmars, Divided k-d trees, Algorithmica, 6 (1991), 840-858.
12. M.J. van Kreveld and M.H. Overmars, Union-copy structures and dynamic segment trees, J. ACM, 40 (1993), 635-652.
13. M.J. van Kreveld and M.H. Overmars, Concatenable structures for decomposable problems, Information and Computation, 110 (1994), 130-148.
14. J. van Leeuwen and M.H. Overmars, The art of dynamizing. In Proc. 10th Mathematical Foundations of Computer Science, LNCS, 118 (1981), 121-131.
15. J. van Leeuwen and D. Wood, Dynamization of decomposable searching problems. Information Processing Letters, 10 (1980), 51-56.
16. K. Mehlhom, Lowerbounds on the efficiency of transforming static data structures into dynamic structures. Mathematical System Theory, 15 (1981), 1-16.
17. K. Mehlhorn, Multi-Dimensional Searching and Computational Geometry EATCS Monographs on Theoretical Computer Science, vol. 3, Springer-Verlag, 1984.
18. H.A. Maurer and T.A. Ottmann, Dynamic solutions of decomposable searching problems. In Discrete Structures and Algorithms, U. Pape ed., Hanser Verlag, Wien, (1979), 17-24.
19. K. Mehlhom and M.H. Overmars, Optimal dynamization of decomposable searching problems. Information Processing Letters, 12 (1981), 93-98
20. M. H. Overmars, Dynamization of order decomposable set problems. J. Algorithms, 2 (1981), 245-260.
21. M.H. Overmars, The Design of Dynamic Data Structures, LNCS 156, Springer-Verlag, Berlin/New York, 1983.
22. M.H. Overmars and J. van Leeuwen, Maintenance of configurations in the plane. Journal of Computer and System Sciences, 23 (1981), 166-204.
23. M.H. Overmars and J. van Leeuwen, Dynamization of decomposable searching problems yielding good worst-case bounds. In Proc. 5th GI Conference on Theoretical Computer Science, LNCS, 104 (1981), 224-233.
24. M.H. Overmars and J. van Leeuwen, Some principles for dynamizing decomposable searching problems. Information Processing Letters, 12 (1981), 49-53.
25. M.H. Overmars and J. van Leeuwen, Worst-case optimal insertion and deletion methods for decomposable searching problems. Information Processing Letters, 12 (1981), 168-173.
26. M.H. Overmars and J. van Leeuwen, Dynamic Multi-dimensional data structures based on quad- and k-d trees. Acta Inform., 17 (1982), 267-285.
27. H. Samet, Bibliography on quad-trees and related hierarchical data structures. In Data Structures for Raster Graphics, L. Kessenaar, F. Peters, and M. van Lierop eds., Springer-Verlag, Berlin, (1986), 181-201.
28. H.W. Schölten and M.H. Overmars, General methods for adding range restrictions to decomposable searching problems, J. of Symbolic Computation, 7 (1989), 1-10.
29. D.E. Willard and G.S. Lueker, Adding range restriction capability to dynamic data structures, J. ACM, 32 (1985), 597-617.