A near-optimal algorithm for shortest paths among curved obstacles in the plane

We propose an algorithm for the problem of computing shortest paths among curved obstacles in the plane. If the obstacles have O(n) description complexity, then the algorithm runs in O(n log n) time plus a term dependent on the properties of the boundary arcs. Specifically, if the arcs allow a certain kind of bisector intersection to be computed in constant time, or even in O(log n) time, then the running time of the overall algorithm is O(n log n). If the arcs support only constant-time tangent, intersection, and length queries, as is customarily assumed, then the algorithm computes an approximate shortest path, with relative error ε, in time O(n log n + n log 1/ε). In fact, the algorithm computes an approximate shortest path map, a data structure with O(n log n) size, that allows it to report the (approximate) length of a shortest path from a fixed source point to any query point in the plane in O(log n) time.

[1]  Gershon Elber,et al.  Bisector curves of planar rational curves , 1998, Comput. Aided Des..

[2]  Joseph S. B. Mitchell,et al.  Shortest Paths and Networks , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[3]  Micha Sharir,et al.  On shortest paths amidst convex polyhedra , 1987, SCG '86.

[4]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

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

[6]  James A. Storer,et al.  Shortest paths in the plane with polygonal obstacles , 1994, JACM.

[7]  Leonidas J. Guibas,et al.  Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons , 1987, Algorithmica.

[8]  Pankaj K. Agarwal,et al.  Approximate Euclidean shortest paths amid convex obstacles , 2009, SODA.

[9]  Christos H. Papadimitriou,et al.  An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[10]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[11]  WangHaitao,et al.  Computing Shortest Paths among Curved Obstacles in the Plane , 2015 .

[12]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[13]  Haitao Wang,et al.  Computing shortest paths among curved obstacles in the plane , 2011, SoCG '13.

[14]  Subhash Suri,et al.  Practical methods for approximating shortest paths on a convex polytope in R3 , 1998, SODA '95.

[15]  Leonidas J. Guibas,et al.  An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body , 1988, J. Algorithms.

[16]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[17]  Rida T. Farouki,et al.  Computing Point/Curve and Curve/Curve Bisectors , 1992, IMA Conference on the Mathematics of Surfaces.

[18]  Subhash Suri,et al.  A pedestrian approach to ray shooting: shoot a ray, take a walk , 1993, SODA '93.

[19]  Joseph S. B. Mitchell,et al.  Shortest paths among obstacles in the plane , 1993, SCG '93.

[20]  S. Suri,et al.  Practical methods for approximating shortest paths on a convex polytope in R 3 , 1995, SODA 1995.

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

[22]  Haitao Wang,et al.  Computing shortest paths amid pseudodisks , 2011, SODA '11.

[23]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[24]  Leonidas J. Guibas,et al.  Ray shooting in polygons using geodesic triangulations , 1991, Algorithmica.

[25]  Michel Pocchiola,et al.  Topologically sweeping visibility complexes via pseudotriangulations , 1996, Discret. Comput. Geom..

[26]  Ee-Chien Chang,et al.  Shortest path amidst disc obstacles is computable , 2005, Int. J. Comput. Geom. Appl..

[27]  L. Paul Chew,et al.  Planning the shortest path for a disc in O(n2log n) time , 1985, SCG '85.

[28]  Micha Sharir,et al.  On shortest paths in polyhedral spaces , 1986, STOC '84.

[29]  Sariel Har-Peled,et al.  Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions , 1997, SCG '97.

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