• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.807-810
• /
• 2009

In this paper, we consider the shortest path problems in a simple polygon. The shortest path between two points inside a 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 cases without very large input size. In this paper, we present the customized shortest path algorithms for specific polygon classes such as star-shaped polygons, edge-visible polygons, and monotone polygons. These algorithms need not triangulating as preprocessing, so they are simple and run very fast in linear time.