Sciweavers

Share
DGCI
2009
Springer

Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour

10 years 7 months ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexity of the shape, its perimeter is a good estimate of the perimeter of the digitized shape. We present here two novel equivalent definitions of MLP, one arithmetic, one combinatorial, and both definitions lead to two different linear time algorithms to compute them.
Xavier Provençal, Jacques-Olivier Lachaud
Added 04 Sep 2010
Updated 04 Sep 2010
Type Conference
Year 2009
Where DGCI
Authors Xavier Provençal, Jacques-Olivier Lachaud
Comments (0)
books