The Shortest Path with Increasing Chords in a Simple Polygon
Computational Geometry
2022-02-25 v1
Abstract
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.
Cite
@article{arxiv.2202.12131,
title = {The Shortest Path with Increasing Chords in a Simple Polygon},
author = {Mart Hagedoorn and Irina Kostitsyna},
journal= {arXiv preprint arXiv:2202.12131},
year = {2022}
}