Analysis of the rubberband algorithm

12 years 9 months ago
Analysis of the rubberband algorithm
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) contained and complete in the tube of the curve. Only one general algorithm, called rubberband algorithm, was known for the approximative calculation of such an MLP so far. An open problem in [7] is related to the design of algorithms for the calculation of the MLP of a simple cube-curve: Is there a simple cubecurve such that none of the nodes of its MLP is a grid vertex? This paper constructs an example of such a simple cube-curve, and we also characterize the class of all of such cube-curves. This study leads to a correction in Option 3 of the rubberband algorithm (by adding one missing test). We also prove that the rubberband algorithm has linear time complexity O(m) where m is the number of critical edges of a give...
Fajie Li, Reinhard Klette
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where IVC
Authors Fajie Li, Reinhard Klette
Comments (0)