2000 character limit reached
A sufficient condition for visibility paths in simple polygons (2004.02227v5)
Published 5 Apr 2020 in cs.CG
Abstract: 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.