One possible definition of the length of a digitized curve in 3D is the length of the shortest polygonal curve lying entirely in a cube curve. In earlier work the authors proposed an iterative algorithm for the calculation of this minimal length polygonal curve (MLP). This paper reviews the algorithm and suggests methods to speed it up by reducing the set of possible locations of vertices of the MLP, or by directly calculating MLP-vertices in specific situations. Altogether, the paper suggests an in-depth analysis of cube curves.
['Thomas Bülow', 'Reinhard Klette']
Approximation of 3D Shortest Polygons in Simple Cube Curves