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.

翻译：二次曲线的绳索问题是从一个简单的多边形P的顶点开始,到一个简单的多边形P的顶点b的顶点结束,找到一条逆时针或顺时针的锥形绳索,其中的一条是P和b的锥壳的顶点,从无限处可以看到。提到的锥形绳索是连接一个和b的最短路径,而没有进入P的内部。在本文中,问题被重建为在一个简单的多边形中找到这样最短的路径,并通过多次射击的方法解决。我们然后显示,如果该方法的共线性条件维持在所有射击点,然后这些射击点形成最短的路径。否则,通过更新方法获得的路径序列会汇合到最短的路径。计算法是在C++中进行数字实验。