An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
- Cite this article as:
- Kapoor, S., Maheshwari, S. & Mitchell, J. Discrete Comput Geom (1997) 18: 377. doi:10.1007/PL00009323
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total of n vertices. The algorithm uses O(n) space and requires \(O(n+h^2\log n)\) time.