A sufficient condition for visibility paths in simple polygons [article]

Mohammad Reza Zarrabi, Nasrollah Moghaddam Charkari
2022 arXiv   pre-print
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.
arXiv:2004.02227v4 fatcat:cnpuqctaebcsdompo65s7vgk44