Browse > Article
http://dx.doi.org/10.6109/jkiice.2010.14.2.369

A Fast Shortest Path Algorithm Between Two Points inside a Segment-Visible Polygon  

Kim, Soo-Hwan (부산외국어대학교 임베디드IT학과)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.14, no.2, 2010 , pp. 369-374 More about this Journal
Abstract
The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. In this paper, we present the customized shortest path algorithm for a segment-visible polygon which is a simple polygon weakly visible from an internal line segment. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls, so it is easy to implement and runs very fast in linear time.
Keywords
Visibility; Segment-Visible Polygon; Shortest Path; Convex Hull;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Inkulu and S. Kapoor, "Planar Rectilinear Shortest Path Computation Using Corridors," Computational Geometry, Vol 42, No. 9, pp. 873-884, 2009.   DOI   ScienceOn
2 B. K. Bhattacharya, G. Das, A. Mukhopadhyay, and G. arasimhan, "Optimally Computing a Shortest Weakly Visible Line Segment inside a Simple Polygon," Compur. Geom. Theory and Applications, Vol. 23, No. 1, pp. 1-29, 2002.   DOI   ScienceOn
3 R. L. Graham, "An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set," Inform. Process. Lett., Vol. 1, No. 4, pp. 132-133, 1972.   DOI   ScienceOn
4 F.P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, 1985.
5 R. Khosravi and M. Ghodsi, "Shortest Paths in Simple Polygons with Polygon-Meet Constraints," Information Processing Letters, Vol. 91, No. 4, pp. 171-176, 2004.   DOI   ScienceOn
6 L. Guibas, J. Hershberger, D. Leven, M. Shrir, and R. Tarjan, "Linear Time Algorithm for Visibility and Shortest Path Problems inside Triangulated Simple Polygons," Algorithmica, Vol. 2, No. 1-4, pp. 209-233, 1987.   DOI   ScienceOn
7 B. Chazelle, "Triangulating a Simple Polygon in Linear Time," Discrete Comput. Geom., Vol. 6, No. 1, pp. 485-524, 1991.   DOI
8 J. O'rourke, Art Gallery Theorems and Algorithms, Oxford Univ. Press, 1987.
9 S.-Q. Xin and G.-J. Wang, "Efficiently Determining a Locally Exact Shortest Path on Polyhedral Surfaces," Computer-Aided Design, Vol. 39, No. 12, pp. 1081-1090, 2007.   DOI   ScienceOn