2020/04/05 by Mohammad Reza Zarrabi, Zarrabi, Mohammad Reza, Nasrollah Moghadam Charkari +1
Computer Science · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #Robotic Path Planning Algorithms
paper · pdf · doi:10.48550/arxiv.2004.02227
openalex publication_date 2020/04/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The purpose of this note is to give a simple proof for a necessary and sufficient condition for visibility paths in simple polygons. A visibility path is a curve such that every point inside a simple polygon is visible from at least one point on the path. This result is essential for finding the shortest watchman route inside a simple polygon specially when the route is restricted to curved paths.