The Shortest Path with Increasing Chords in a Simple Polygon

02/24/2022

∙

by   Mart Hagedoorn, et al.

∙

0

∙

share

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.