Publication 2002 Issue No. 7 - July Abstract - Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
July 2002 (vol. 24 no. 7)
pp. 962-970
 ASCII Text x Thomas Bülow, Reinhard Klette, "Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 962-970, July, 2002.
 BibTex x @article{ 10.1109/TPAMI.2002.1017622,author = {Thomas Bülow and Reinhard Klette},title = {Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm},journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence},volume = {24},number = {7},issn = {0162-8828},year = {2002},pages = {962-970},doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2002.1017622},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Pattern Analysis and Machine IntelligenceTI - Digital Curves in 3D Space and a Linear-Time Length Estimation AlgorithmIS - 7SN - 0162-8828SP962EP970EPD - 962-970A1 - Thomas Bülow, A1 - Reinhard Klette, PY - 2002KW - Digital geometryKW - curve lengthKW - space curvesKW - cellular complexes.VL - 24JA - IEEE Transactions on Pattern Analysis and Machine IntelligenceER -

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. This 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] T. Bülow and R. Klette, “Rubber Band Algorithm for Estimating the Length of Digitized Space-Curves,” Proc. 15th Int'l Conf. Pattern Recognition (ICPR 2000), vol. III, pp. 551-555, Sept. 2000.
[2] R. Busemann and W. Feller, “Krümmungseigenschaften konvexer Flächen,” Acta Mathematica, vol. 66, pp. 27-45, 1935.
[3] J. Canny and J.H. Reif, “New Lower Bound Techniques for Robot Motion Planning Problems,” IEEE Foundations of Computer Science, vol. 28, pp. 49-60, 1987.
[4] J. Choi, J. Sellen, and C.-K. Yap, “Approximate Euclidean Shortest Path in 3-Space,” Proc. 10th ACM Conf. Computational Geometry, pp. 41-48, 1994.
[5] A. Jonas and N. Kiryati, “Length Estimation in 3-D Using Cube Quantization,” J. Mathematical Imaging and Vision, vol. 8, pp. 215-238, 1998.
[6] R. Klette and B. Yip, “The Length of Digital Curves,” Machine Graphics&Vision, vol. 9, pp. 673-703, 2000.
[7] A. Rosenfeld, Picture Languages. New York: Academic Press, 1979.
[8] F. Sloboda, B. Zatko, and J. Stoer, “On Approximation of Planar One-Dimensional Continua,” Advances in Digital and Computational Geometry, R. Klette, A. Rosenfeld, and F. Sloboda, eds. pp. 113-160, 1998.
[9] F. Sloboda, B. Zatko, and R. Klette, “On the Topology of Grid Continua,” SPIE Conf. Proc. Vision Geometry VII, vol. 3454, pp. 52-63, 1998.
[10] K. Voss, Discrete Images, Objects, and Functions in$\big. Z^n\bigr.$. Berlin: Springer, 1993.

Index Terms:
Digital geometry, curve length, space curves, cellular complexes.
Citation:
Thomas Bülow, Reinhard Klette, "Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 962-970, July 2002, doi:10.1109/TPAMI.2002.1017622