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.
CITATION STYLE
Klette, R., & Bülow, T. (2000). Minimum-length polygons in simple cube-curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1953 LNCS, pp. 467–478). Springer Verlag. https://doi.org/10.1007/3-540-44438-6_38
Mendeley helps you to discover research relevant for your work.