A simple proof for visibility paths in simple polygons

04/05/2020

∙

by   Mohammad Reza Zarrabi, et al.

∙

0

∙

share

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.