Skip to main content
SpringerLink
Log in

Dynamic maintenance of shortest path trees in simple polygons

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1180))

Abstract

We present a scheme to dynamically maintain a tooted shortest path tree in a simple polygon. Both insertion and deletion of vertices of the simple polygon are supported. Both operations require O(k log(n/k)) time where k is the number of changes in the shortest path tree. Only simple balanced binary trees are used in the data structure. O(n) space is required.

This work was supported by grant No. SR/OY/E13/92 from Dept. of Sc. & Techn., Govt. of India.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CT] “Dynamic algorithms in computational geometry” by Y.J. Chiang and R. Tamassia, Proc. IEEE, 80(9):1412–1434

    Google Scholar 

  2. [GH] “Optimal Shortest Path Queries in a Simple Polygon”, L.J. Guibas and J.Hershberger. Proceedings of the 3rd ACM Symposium on computational Geometry, Waterloo, Canada (1987), pp 50–63.

    Google Scholar 

  3. [GHLST) “Linear time algorithms for visibility and shortest path problems inside simple polygons” by L.Guibas, J.Hershberger, D.Leven, M.Sharir and R.Tarjan, Proc. of the 3rd ACM Symposium on Computational Geometry, June 1987.

    Google Scholar 

  4. [GT] “Dynamic trees and dynamic point location”, by M. Goodrich and R. Tamassia,Proceedings of the 23rd Annu. ACM Sympos. Theory Comput., pp 523–533, 1991.

    Google Scholar 

  5. [LP] “Euclidean Shortest Paths in the Presence of Rectilinear Barriers”, D.T. Lee and F.P. Preparata., Networks, vol.14 (1984), pp.393–410.

    Google Scholar 

  6. [ST) “A Data Structure for Dynamic Trees”, D.D.Sleator and R.E. Tarjan, Jour. of Computer and System Sciences, 26, 362–391 (1983).

    Google Scholar 

  7. [V] “Dynamically maintaining the visibility graph”, G. Vegter, WADS, 1991, pp 425–436.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering, Indian Institute of Technology, Hauz Khas, New Delhi

    Sanjiv Kapoor & Tripurari Singh

Authors
  1. Sanjiv Kapoor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tripurari Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. Chandru V. Vinay

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kapoor, S., Singh, T. (1996). Dynamic maintenance of shortest path trees in simple polygons. In: Chandru, V., Vinay, V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62034-6_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-62034-6_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62034-1

  • Online ISBN: 978-3-540-49631-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation