A linear time algorithm for minimum conic link path in a simple polygon
The studied problem is the generalization of the well-known straight line version. A linear time algorithm for the problem is proposed. The result has inherently broadened applications than that of its degenerate case. Practitioners in the fields of computational geometry may find merits herein.
conic link path computational geometry path planning conic visibility circular visibility splinegon