by Klette, R, Kovalevsky, V and Yip, B
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.
Reference:
On the length estimation of digital curves (Klette, R, Kovalevsky, V and Yip, B), In Proceedings of SPIE – The International Society for Optical Engineering, Society of Photo-Optical Instrumentation Engineers, volume 3811, 1999.
Bibtex Entry:
@inproceedings{klette1999oncurves,
author = "Klette, R and Kovalevsky, V and Yip, B",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",
pages = "117--128",
publisher = "Society of Photo-Optical Instrumentation Engineers",
title = "On the length estimation of digital curves",
volume = "3811",
year = "1999",
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.",
issn = "0277-786X",
language = "eng",
}