Affiliation:
1. Brandeis Univ., Waltham, MA
2. Duke Univ., Durham, NC
Abstract
We present a practical algorithm for finding minimum-length paths between points in the Euclidean plane with (not necessarily convex) polygonal obstacles. Prior to this work, the best known algorithm for finding the shortest path between two points in the plane required
Ω(n
2
log
n)
time and
O
(n
2
) space, where
n
denotes the number of obstacle edges. Assuming that a triangulation or a Voronoi diagram for the obstacle space is provided with the input (if is not, either one can be precomputed in
O
(
n
log
n)
time), we present an
O(kn)
time algorithm, where
k
denotes the number of “islands” (connected components) in the obstacle space. The algorithm uses only
O(n)
space and, given a source point
s
, produces an
O(n)
size data structure such that the distance between
s
and any other point
x
in the plane (
x
) is not necessarily an obstacle vertex or a point on an obstacle edge) can be computed in
O
(1) time. The algorithm can also be used to compute shortest paths for the movement of a disk (so that optimal movement for arbitrary objects can be computed to the accuracy of enclosing them with the smallest possible disk).
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference37 articles.
1. ~AHO A. V. HOPCROFT J. E. AND Ut LMAN J. D. 1983. Data Stntctures and Algorithms. ~Addison-Wesley Reading Mass. ~AHO A. V. HOPCROFT J. E. AND Ut LMAN J. D. 1983. Data Stntctures and Algorithms. ~Addison-Wesley Reading Mass.
2. ~ASANO T. GUIBAS L. HERSHBERGER J. AND IMAI H. 1986. Vis~Nhty of disjoint polygons. ~Algorittmuca 1 49 63. 10.1007/BF01840436 ~ASANO T. GUIBAS L. HERSHBERGER J. AND IMAI H. 1986. Vis~Nhty of disjoint polygons. ~Algorittmuca 1 49 63. 10.1007/BF01840436
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献