An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
- 296 Downloads
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.
Unable to display preview. Download preview PDF.
© 1997 Springer-Verlag New York Inc.