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 in the simple polygon is visible from at least one point of the path. This result is required for the shortest watchman route problem specially when the route is restricted to curved paths.
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.
R
in the
inside a
R
of
on
R
required for
essential for finding
R
problem
inside a simple polygon