Euclidean shortest paths in simple cube curves at a glance
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Approximate ESPs on surfaces of polytopes using a rubberband algorithm
PSIVT'07 Proceedings of the 2nd Pacific Rim conference on Advances in image and video technology
Approximate shortest paths in simple polyhedra
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
| Hi-index | 0.00 |
This reviewing paper provides a complete discussion of an algorithm (called rubberband algorithm), which was proposed by Bülow 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.