A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points
[chapter]
2005
Lecture Notes in Computer Science
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The curve's length is defined to be that of the minimum-length polygonal curve (MLP) fully contained and complete in the tube of the curve. So far only one general algorithm called rubber-band algorithm was known for the approximative calculation of such a MLP. There is an open problem which is related to the
doi:10.1007/978-3-540-31965-8_18
fatcat:n3ujto322ncczoq22cnpvftfwi