Computing Shortest Paths among Curved Obstacles in the Plane
Computing Shortest Paths among Curved Obstacles in the Plane
A fundamental problem in computational geometry is to compute an obstacle-avoiding Euclidean shortest path between two points in the plane. The case of this problem on polygonal obstacles is well studied. In this article, we consider the problem version on curved obstacles, which are commonly modeled as splinegons . A …