Issue No. 07 - July (2002 vol. 24)
<p>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.</p>
Digital geometry, curve length, space curves, cellular complexes.
T. Bülow and R. Klette, "Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 24, no. , pp. 962-970, 2002.