Approximate Shortest Path Calculations in Simple Polyhedra

This paper considers the calculation of a Euclidean shortest path (ESP) in a three-dimensional (3D) polyhedral space Π . We propose an approximate κ(e) · O(M |V |) 3D ESP algorithm (excluding preprocessing), with preprocessing time complexity O(M |E| + |S| + |V | log |V |), for solving a special, but ‘fairly general’ case of the 3D ESP problem, where Π does not need to be convex, V and E are the sets of vertices and edges of Π , respectively, and S is the set of faces (triangles) of Π; M is the maximal number of vertices of a socalled critical polygon; κ(e) = (L0 − L)/e where L0 is the length of an initial path and L is the true (i.e., optimum) path length. The given algorithm solves approximately three (previously known to be) NP-complete or NP-hard 3D ESP problems in time κ(e) · O(k), where k is the number of layers in a stack, which is introduced in this paper as being the problem environment. The proposed approximation method has straightforward applications for ESP problems when analyzing polyhedral objects (e.g., in 3D imaging), of for ‘flying’ over a polyhedral terrain.

[1]  Kenneth L. Clarkson,et al.  Approximation algorithms for shortest path motion planning , 1987, STOC.

[2]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[3]  Sariel Har-Peled,et al.  Constructing approximate shortest path maps in three dimensions , 1998, SCG '98.

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

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

[6]  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).

[7]  Yanhong A. Liu,et al.  Optimizing Ackermann's function by incrementalization , 2003, PEPM.

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

[9]  Hamid Zarrabi-Zadeh.  Flying over a polyhedral terrain , 2008, Inf. Process. Lett..

[10]  Chee-Keng Yap,et al.  Precision-Sensitive Euclidean Shortest Path in 3-Space , 2000, SIAM J. Comput..

[11]  C. Bajaj.  The Algebraic Complexity of Shortest Paths in Polyhedral Spaces , 1985 .

[12]  Reinhard Klette,et al.  Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems , 2007, 2007 International Conference on Computing: Theory and Applications (ICCTA'07).

[13]  Joseph S. B. Mitchell,et al.  New results on shortest paths in three dimensions , 2004, SCG '04.

[14]  Jörg-Rüdiger Sack,et al.  Approximation algorithms for geometric shortest path problems , 2000, STOC '00.

[15]  Lawrence H. Staib,et al.  3D Brain surface matching based on geodesics and local geometry , 2003, Comput. Vis. Image Underst..

[16]  Chee-Keng Yap,et al.  Towards Exact Geometric Computation , 1997, Comput. Geom..