Abstract:
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 a"rubber-band algorithm" is known to compute such a curve approximately. We provide an alternative iterative algorithm for the approximative calculation of the MLP for curves contained in a special class of simple cube-curves (for which we prove the correctness of our alternative algorithm), and the obtained results coincide with those calculated by the rubber-band algorithm.
Description:
You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original CITR web site; http://citr.auckland.ac.nz/techreports/ under terms that include this permission. All other rights are reserved by the author(s).
