Advertisement

The art of dynamizing

  • Jan van Leeuwen
  • Mark H. Overmars
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)

Abstract

A few years ago J. Bentley initiated a general approach to searching problems and their solution by means of dynamic data structures. As it is often easier to find a static solution first, his goal was to obtain efficient dynamic data structures by applying transformations to static data structures. This approach has become a paradigm (known as "dynamization") in current research in the design of efficient algorithms. We shall outline a number of general techniques that were developed for dynamizing decomposable searching problems and will discuss a recent solution to Bentley's original question to devise a dynamization method for such problems with worst-case optimal insertion and deletion routines.

Keywords

Query Time Segment Tree Dynamic Data Structure Late Reconstruction Equal Block 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. 1.
    Bentley, J.L., Algorithms for Klee's rectangle problems, unpubl. notes, Dept. of Computer Science, Carnegie Mellon University, Pittsburgh, 1977.Google Scholar
  2. 2.
    Bentley, J.L., Decomposable searching problems, Inf. Proc. Lett. 8 (1979) 244–251.Google Scholar
  3. 3.
    Bentley, J.L. and D. Wood, An optimal worst-case algorithm for reporting intersections of rectangles, IEEE Transactions on Computers, C-29 (1980) 571–577.Google Scholar
  4. 4.
    Edelsbrunner, H., Dynamic data structures for orthogonal intersection queries, Bericht 59, Inst. f. Informationsverarb., TU Graz, Graz, 1980.Google Scholar
  5. 5.
    Edelsbrunner, H. and H.A. Maurer, On the intersection of orthogonal objects, Bericht 60, Inst. f. Informationsverarb., TU Graz, Graz, 1980.Google Scholar
  6. 6.
    Gowda, I.G., Dynamic problems in computational geometry, M.Sc. Thesis, Dept. of Computer Science, University of British Columbia, Vancouver, 1980.Google Scholar
  7. 7.
    Gowda, I.G. and D.G. Kirkpatrick, Exploiting linear merging and extra storage in the maintenance of fully dynamic geometric data structures, in: Proc. 18th Annual Allerton Conf. on Communication, Control and Computing, 1980.Google Scholar
  8. 8.
    Kirkpatrick, D.G., Optimal search in planar subdivisions, preprint, Dept. of Computer Science, University of British Columbia, Vancouver, 1979.Google Scholar
  9. 9.
    Lueker, G.S., A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems, Techn. Rep., Dept. of Computer Science, University of California at Irvine, Irvine, 1978.Google Scholar
  10. 10.
    Maurer, H.A. and Th. Ottmann, Dynamic solutions of decomposable searching problems, Bericht 33, Inst. f. Informationsverarb., TU Graz, Graz, 1979.Google Scholar
  11. 11.
    Mehlhorn, K., Lower bounds on the efficiency of static to dynamic transforms of data structures, preprint, Fachbereich 10, University of Saarland, Saarbrücken, 1980.Google Scholar
  12. 12.
    Mehlhorn, K. and M.H. Overmars, Optimal dynamization of decomposable searching problems, preprint, Fachbereich 10, University of Saarland, Saarbrücken, 1980 (to appear in Inf. Proc. Lett.).Google Scholar
  13. 13.
    Overmars, M.H., Dynamization of order decomposable set problems, Techn. Rep. RUU-CS-80-9, Dept. of Computer Science, University of Utrecht, Utrecht, 1980 (to appear in J. Algor.).Google Scholar
  14. 14.
    Overmars, M.H. and J. van Leeuwen, Two general methods for dynamizing decomposable searching problems, Computing 26 (1981) 155–166.Google Scholar
  15. 15.
    Overmars, M.H. and J. van Leeuwen, Some principles for dynamizing decomposable searching problems, Inf. Proc. Lett. 12 (1981) 49–54.Google Scholar
  16. 16.
    Overmars, M.H. and J. van Leeuwen, Maintenance of configurations in the plane, Techn. Rep. RUU-CS-79-9, Dept. of Computer Science, University of Utrecht, 1979 (revised as Techn. Rep. RUU-CS-81-3, to appear in J. Comp. Syst. Sci.).Google Scholar
  17. 17.
    Overmars, M.H. and J. van Leeuwen, Dynamization of decomposable searching problems yielding good worst-case bounds, in: P. Deussen (ed.), Theoretical Computer Science (5th GI-Conf.), Lect. Notes in Comp. Sci. 104, Springer Verlag, Berlin, 1981, pp. 224–233.Google Scholar
  18. 18.
    Overmars, M.H. and J. van Leeuwen, Worst-case optimal insertion and deletion methods for decomposable searching problems, Techn. Rep. RUU-CS-80-10, Dept. of Computer Science, University of Utrecht, Utrecht, 1980 (to appear in Inf. Proc. Lett.).Google Scholar
  19. 19.
    Saxe, J.B. and J.L. Bentley, Transforming static data structures into dynamic structures, Proc. 20th Ann. IEEE Symp. Found. of Comp. Sci., Mayaquez and Rio Piedras, Puerto Rico, 1979, pp. 148–168.Google Scholar
  20. 20.
    Shamos, M.I., Computational geometry, Ph.D. Thesis, Dept. of Computer Science, Yale University, New Haven, 1978 (to be published by Springer Verlag).Google Scholar
  21. 21.
    van Leeuwen, J. and H.A. Maurer, Dynamic systems of static data structures, Bericht 42, Inst. f. Informationsverarb., TU Graz, Graz, 1980.Google Scholar
  22. 22.
    van Leeuwen, J. and D. Wood, Dynamization of decomposable searching problems, Inf. Proc. Lett. 10 (1980) 51–56.Google Scholar
  23. 23.
    Vuillemin, J., A data structure for maintaining priority queues, C.ACM 21 (1978) 309–315.Google Scholar
  24. 24.
    Willard, D.E., The super B-tree algorithm, TR-03-79, The Aiken Comput. Lab., Harvard University, Cambridge (USA), 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Jan van Leeuwen
    • 1
  • Mark H. Overmars
    • 1
  1. 1.Department of Computer ScienceUniversity of UtrechtUtrechtthe Netherlands

Personalised recommendations