论文标题
简单多边形中可见性路径的足够条件
A sufficient condition for visibility paths in simple polygons
论文作者
论文摘要
本注释的目的是为简单多边形的可见性路径提供简单的证明。可见性路径是一条曲线，因此从路径上的至少一个点可以看到简单多边形内部的每个点。该结果对于在路线仅限于弯曲路径时，特别是在简单的多边形内找到最短的守望者路线至关重要。
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.
