, Volume 18, Issue 4, pp 377-383

An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.