Abstract:
The paper details two linear-time algorithms, one for the partition of the boundary line of a digital region into digital straight segments, and one for calculating the minimum length polygon within a simple open boundary of a digital region. Both techniques allow the estimation of the length of digital curves or the perimeter of digital regions due to known multigrid convergence theorems. The algorithms are compared with respect to convergence speed and number of generated segments.
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).
