A sufficient condition for visibility paths in simple polygons
Computational Geometry
2022-12-05 v5
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.
Cite
@article{arxiv.2004.02227,
title = {A sufficient condition for visibility paths in simple polygons},
author = {Mohammad Reza Zarrabi and Nasrollah Moghaddam Charkari},
journal= {arXiv preprint arXiv:2004.02227},
year = {2022}
}