Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems

This reviewing paper provides a complete discussion of an algorithm (called rubberband algorithm), which was proposed by Billow and Klette in 2000-2002 for the calculation of minimum-length polygonal curves in cube-curves in 3D space. The paper describes how this original algorithm was transformed afterwards, "step-by-step", into a general, provably correct, and time-efficient algorithm which solves the indented task for simple cube-curves of any complexity. Variations of this algorithm are then used to solve various Euclidean shortest path (ESP) problems, such as calculating the ESP inside of a simple cube arc, inside of a simple polygon, on the surface of a convex polytope, or inside of a simply-connected polyhedron, demonstrating a general (!) methodology of rubberband algorithms. The paper also reports how such algorithms improve various time complexity results of best algorithms for problems such as the touring polygons, parts cutting, safari and zookeeper, and the watchman route

[1]  Thomas Bülow,et al.  Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Leonidas J. Guibas,et al.  Static and kinetic geometric spanners with applications , 2001, SODA '01.

[3]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[4]  M. Talbot,et al.  A Dynamical Programming Solution for Shortest Path Itineraries in Robotics , 2004 .

[5]  Reinhard Klette,et al.  Analysis of the rubberband algorithm , 2007, Image Vis. Comput..

[6]  Reinhard Klette,et al.  Topology of grid continua , 1998, Optics & Photonics.

[7]  Chee-Keng Yap,et al.  Approximate Euclidean shortest path in 3-space , 1994, SCG '94.

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

[9]  Xuehou Tan,et al.  Linear-Time 2-Approximation Algorithm for the Watchman Route Problem , 2006, TAMC.

[10]  Reinhard Klette,et al.  Exact and approximate algorithms for the calculation of shortest paths , 2006 .

[11]  Udatta S. Palekar,et al.  Heuristics for the plate-cutting traveling salesman problem , 1997 .

[12]  Simeon C. Ntafos,et al.  Watchman Routes Under Limited Visibility , 1991, Comput. Geom..

[13]  Reinhard Klette,et al.  Minimum-Length Polygon of a Simple Cube-Curve in 3D Space , 2004, IWCIA.

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

[15]  Azriel Rosenfeld,et al.  Digital geometry , 2002, JCIS.

[16]  Reinhard Klette,et al.  The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points , 2005, DGCI.

[17]  Reinhard Klette,et al.  Shortest Paths in a Cuboidal World , 2006, IWCIA.

[18]  Dennis F. Kibler,et al.  A Theory of Nonuniformly Digitized Binary Pictures , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

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

[20]  Simeon C. Ntafos,et al.  The zookeeper route problem , 1992, Inf. Sci..

[21]  Moshe Dror,et al.  Touring a sequence of polygons , 2003, STOC '03.

[22]  Xuehou Tan,et al.  Fast computation of shortest watchman routes in simple polygons , 2001, Inf. Process. Lett..