Finding Approximately Convex Ropes in the Plane

Le Hong Trang, Nguyen Thi Le, Phan Thanh An

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…