论文标题
简单多边形中和弦增加的最短路径
The Shortest Path with Increasing Chords in a Simple Polygon
论文作者
论文摘要
我们研究了在简单多边形中找到最短路径的问题。当且仅在任何点a，b，c和d时，路径就会增加和弦，以该顺序为| AD | > = | bc |。在本文中，我们表明，增加和弦的最短路径是独一无二的，并提出了构建算法的算法。
We study the problem of finding the shortest path with increasing chords in a simple polygon. A path has increasing chords if and only if for any points a, b, c, and d that lie on the path in that order, |ad| >= |bc|. In this paper we show that the shortest path with increasing chords is unique and present an algorithm to construct it.
