The Shortest Path with Increasing Chords in a Simple Polygon
Mart Hagedoorn, Irina Kostitsyna · arXiv (Cornell University) · 2022
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.