Computing the shortest path tree in a weak visibility polygon
In this paper we propose two linear time algorithms for computing the shortest path tree rooted at any vertex of a weak visibility polygon. The first algorithm computes the shortest path tree in a polygon weakly visible from a given internal segment. The second algorithm computes the shortest path tree in a weak visibility polygon without the knowledge of a visibility segment. In both algorithms we use the convexity property of shortest paths in weak visibility polygons established in [4,11].
Unable to display preview. Download preview PDF.
- D. Avis and G. T. Toussaint, An optimal algorithm for determining the visibility of a polygon from an edge, IEEE Trans. Comput., 30, pp. 393–410, 1981.Google Scholar
- B. Chazelle, Triangulating a simple polygon in linear time, Technical Report No. CS-TR-264–90, Department of Computer Science, Princeton University, May 1990.Google Scholar
- S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja, C. E. Veni Madhavan, Characterizing weak visibility polygons and related problems, Technical Report IISc-CSA-90-1, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, January 1990 (Presented at the Second Canadian Conference on Computational Geometry, lOttawa, Ontario, Canada, August 1990).Google Scholar
- L. Guibas, E. McCreight, M. Plass and J. Roberts, A new representation for linear lists, Proceedings of the 9th ACM Symposium on Theory of Computing, pp. 49–60, 1977.Google Scholar
- J. Hershberger, Ph. D. Thesis, Stanford University.Google Scholar
- D. Kirkpatrick, M. M. Klawe and R. E. Tarjan, Polygon triangulation in O(nloglogn) time with simple data structures, Proc. of the Sixth Annual ACM Symposium on Computational Geometry, 1990.Google Scholar
- D. T. Lee and F. P. Preparata, Euclidean shortest paths in the presence of rectilinear barriers, Networks, 14, pp. 393–410, 1984.Google Scholar
- S. P. Pal, Weak visibility and related problems on simple polygons, Ph. D. Thesis, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 560012, India, October 1990.Google Scholar
- S. Suri, A linear time algorithm for the minimun link paths inside a simple polygon, Computer Vision, Graphics and Image Processing, 35, pp. 99–110, 1986.Google Scholar