arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.12131cs.CG
收藏

简单多边形中弦递增的最短路径

The Shortest Path with Increasing Chords in a Simple Polygon

Mart Hagedoorn, Irina Kostitsyna

摘要:

研究了在简单多边形中求弦递增的最短路径问题。一条路径有递增的弦当且仅当对于按该顺序位于路径上的任何点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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑