Share Email Print

Proceedings Paper

Length estimation of digital curves
Author(s): Reinhard Klette; Vladimir V. Kovalevsky; Ben Yip
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 23 September 1999
PDF: 12 pages
Proc. SPIE 3811, Vision Geometry VIII, (23 September 1999); doi: 10.1117/12.364118
Show Author Affiliations
Reinhard Klette, Univ. of Auckland (New Zealand)
Vladimir V. Kovalevsky, Univ. of Rostock (Russia)
Ben Yip, Univ. of Auckland (New Zealand)

Published in SPIE Proceedings Vol. 3811:
Vision Geometry VIII
Longin Jan Latecki; Robert A. Melter; David M. Mount; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top