Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm

We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional Euclidean space. The length of such a simple digital curve is defined to be the length of the minimum-length polygonal curve fully contained and complete in the tube of this digital curve. So far, no algorithm was known for the calculation of such a shortest polygonal curve. The paper provides an iterative algorithmic solution for approximating the minimum-length polygon of a given simple digital space-curve. The theoretical foundations of this algorithm are presented as well as experimental results.

[1]  V. A. Kovalevsky,et al.  Finite Topology and Image Analysis , 1992 .

[2]  Reinhard Klette,et al.  Length estimation of digital curves , 1999, Optics & Photonics.

[3]  K. Voss.  Discrete Images, Objects, and Functions in Zn , 1993 .

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

[5]  Willy Feller,et al.  Krümmungseigenschaften Konvexer Flächen , 1936 .

[6]  A. Tucker,et al.  An Abstract Approach to Manifolds , 1933 .

[7]  Thomas Bülow,et al.  Rubber band algorithm for estimating the length of digitized space-curves , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

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

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

[10]  Reinhard Klette,et al.  The Length of Digital Curves , 1999 .

[11]  Johann Benedict Listing.  der Census räumlicher Complexe, oder Verallgemeinerung des Euler´schen Satzes von den Polyädern , 1862 .

[12]  Nahum Kiryati,et al.  Length Estimation in 3-D Using Cube Quantization , 2004, Journal of Mathematical Imaging and Vision.