Translator Disclaimer
Paper
23 September 1999 Length estimation of digital curves
Author Affiliations +
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 an 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.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Reinhard Klette, Vladimir V. Kovalevsky, and Ben Yip "Length estimation of digital curves", Proc. SPIE 3811, Vision Geometry VIII, (23 September 1999); https://doi.org/10.1117/12.364118
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
Back to Top