by Bülow, T and Klette, R
Abstract:
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, including a presentation of its foundations and of experimental results. © 2000 IEEE.
Reference:
Rubber band algorithm for estimating the length of digitized space-curves (Bülow, T and Klette, R), In Proceedings – International Conference on Pattern Recognition, volume 15, 2000.
Bibtex Entry:
@article{blow2000rubberspace-curves,
author = "Bülow, T and Klette, R",
journal = "Proceedings - International Conference on Pattern Recognition",
pages = "547--551",
title = "Rubber band algorithm for estimating the length of digitized space-curves",
volume = "15",
year = "2000",
abstract = "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, including a presentation of its foundations and of experimental results. © 2000 IEEE.",
issn = "1051-4651",
issue = "3",
language = "eng",
}