Two linear-time algorithms for computing the minimum length polygon of a digital contour
X Provençal, JO Lachaud - Discrete Geometry for Computer Imagery: 15th …, 2009 - Springer
Abstract 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.
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.
[HTML][HTML] Two linear-time algorithms for computing the minimum length polygon of a digital contour
JO Lachaud, X Provençal - Discrete applied mathematics, 2011 - Elsevier
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. This paper extends
the work presented in Provençal and Lachaud (2009)[26], by detailing the algorithms and …
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. This paper extends
the work presented in Provençal and Lachaud (2009)[26], by detailing the algorithms and …
以上显示的是最相近的搜索结果。 查看全部搜索结果