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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
[CT] “Dynamic algorithms in computational geometry” by Y.J. Chiang and R. Tamassia, Proc. IEEE, 80(9):1412–1434
[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.
[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.
[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.
[LP] “Euclidean Shortest Paths in the Presence of Rectilinear Barriers”, D.T. Lee and F.P. Preparata., Networks, vol.14 (1984), pp.393–410.
[ST) “A Data Structure for Dynamic Trees”, D.D.Sleator and R.E. Tarjan, Jour. of Computer and System Sciences, 26, 362–391 (1983).
[V] “Dynamically maintaining the visibility graph”, G. Vegter, WADS, 1991, pp 425–436.
Author information
Authors and Affiliations
Editor information
Rights 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