Minimum-link paths among obstacles in the plane

Given a set of nonintersecting polygonal obstacles in the plane, thelink distance between two pointss andt is the minimum number of edges required to form a polygonal path connectings tot that avoids all obstacles. We present an algorithm that computes the link distance (and a corresponding minimum-link path) between two points in timeO(Eα(n) log2n) (and spaceO(E)), wheren is the total number of edges of the obstacles,E is the size of the visibility graph, and α(n) denotes the extremely slowly growing inverse of Ackermann's function. We show how to extend our method to allow computation of a tree (rooted ats) of minimum-link paths froms to all obstacle vertices. This leads to a method of solving the query version of our problem (for query pointst).

[1]  John F. Canny,et al.  A new algebraic method for robot motion planning and real geometry , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[2]  David M. Mount,et al.  An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.

[3]  Leonidas J. Guibas,et al.  The complexity of many faces in arrangements of lines of segments , 1988, SCG '88.

[4]  S. Suri.  A linear time algorithm with minimum link paths inside a simple polygon , 1986 .

[5]  Micha Sharir,et al.  Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.

[6]  Yan Ke,et al.  An efficient algorithm for link-distance problems , 1989, SCG '89.

[7]  Joseph O'Rourke,et al.  Worst-case optimal algorithms for constructing visibility polygons with holes , 1986, SCG '86.

[8]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[9]  Micha Sharir,et al.  Computing the link center of a simple polygon , 1987, SCG '87.

[10]  Joseph S. B. Mitchell,et al.  Minimum-link paths among obstacles in the plane , 1990, SCG '90.

[11]  Andrzej Lingas,et al.  AnO(n logn) algorithm for computing the link center of a simple polygon , 1992, Discret. Comput. Geom..

[12]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[13]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[14]  S. N. Maheshwari,et al.  Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles , 1988, SCG '88.

[15]  Micha Sharir,et al.  Intersection and decomposition algorithms for arrangements of curves in the plane , 1989 .

[16]  D. T. Lee,et al.  Visibility of a simple polygon , 1983, Comput. Vis. Graph. Image Process..

[17]  Leonidas J. Guibas,et al.  The complexity and construction of many faces in arrangements of lines and of segments , 1990, Discret. Comput. Geom..

[18]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..

[19]  B. Joe,et al.  Corrections to Lee's visibility polygon algorithm , 1987, BIT.

[20]  Leonidas J. Guibas,et al.  Implicitly representing arrangements of lines or segments , 2011, SCG '88.

[21]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[22]  David M. Mount,et al.  An output sensitive algorithm for computing visibility graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[23]  Colm Ó'Dúnlaing.  A Tight Lower Bound for the Complexity of Path-Planning for a Disc , 1988, Inf. Process. Lett..

[24]  Jörg-Rüdiger Sack,et al.  An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon , 1989, STACS.