by Klette, R and Bülow, T
Abstract:
Simple cube-curves in a 3D orthogonal grid are polyhedrally bounded sets which 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. A critical edge is a grid edge contained in three consecutive cubes of a simple cube-curve. This paper shows that critical edges are the only possible locations of vertices of the minimum-length polygonal curve fully contained and complete in the tube of this digital curve. © Springer-Verlag Berlin Heidelberg 2000.
Reference:
Minimum-length polygons in simple cube-curves (Klette, R and Bülow, T), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 1953 LNCS, 2000.
Bibtex Entry:
@inproceedings{klette2000minimum-lengthcube-curves,
author = "Klette, R and Bülow, T",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "467--478",
title = "Minimum-length polygons in simple cube-curves",
volume = "1953 LNCS",
year = "2000",
abstract = "Simple cube-curves in a 3D orthogonal grid are polyhedrally bounded sets which 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. A critical edge is a grid edge contained in three consecutive cubes of a simple cube-curve. This paper shows that critical edges are the only possible locations of vertices of the minimum-length polygonal curve fully contained and complete in the tube of this digital curve. © Springer-Verlag Berlin Heidelberg 2000.",
isbn = "3540413960",
isbn = "9783540413967",
issn = "0302-9743",
eissn = "1611-3349",
language = "eng",
}