Abstract.
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.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received March 30, 1993, and in revised form August 26, 1994, and May 1, 1997.
Rights and permissions
About this article
Cite this article
Kapoor, S., Maheshwari, S. & Mitchell, J. An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. Discrete Comput Geom 18, 377–383 (1997). https://doi.org/10.1007/PL00009323
Issue Date:
DOI: https://doi.org/10.1007/PL00009323