Finding Approximately Convex Ropes in the Plane
Abstract
The convex rope problem is to find a counterclockwise or clockwise convex rope starting at the vertex a and ending at the vertex b of a simple polygon P, where a is a vertex of the convex hull of P and b is visible from infinity. The convex rope mentioned is the shortest path joining a and b that does not enter the interior of P. In this paper, the problem is reconstructed as the one of finding such shortest path in a simple polygon and solved by the method of multiple shooting. We then show that if the collinear condition of the method holds at all shooting points, then these shooting points form the shortest path. Otherwise, the sequence of paths obtained by the update of the method converges to the shortest path. The algorithm is implemented in C++ for numerical experiments.
Cite
@article{arxiv.2201.06290,
title = {Finding Approximately Convex Ropes in the Plane},
author = {Le Hong Trang and Nguyen Thi Le and Phan Thanh An},
journal= {arXiv preprint arXiv:2201.06290},
year = {2023}
}
Comments
21 pages, 10 figures, added references for the proof of Theorem 3 Corrected some spelling errors and replace some figures