Dynamic Minimum Length Polygon - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Dynamic Minimum Length Polygon

Résumé

This paper presents a formal framework for representing all reversible polygonalizations of a digital contour (i.e. the boundary of a digital object). Within these polygonal approximations, a set of local operations is defined with given properties, e.g., decreasing the total length of the polygon or diminishing the number of quadrant changes. We show that, whatever the starting reversible polygonal approximation, iterating these operations leads to a specific polygon: the Minimum Length Polygon. This object is thus the natural representative for the whole class of reversible polygonal approximations of a digital contour. Since all presented operations are local, we obtain the first dynamic algorithm for computing the MLP. This gives us a sublinear time algorithm for computing the MLP of a contour, when the MLP of a slightly different contour is known.
Fichier non déposé

Dates et versions

hal-00943828 , version 1 (09-02-2014)

Identifiants

  • HAL Id : hal-00943828 , version 1

Citer

Jacques-Olivier Lachaud, Xavier Provençal. Dynamic Minimum Length Polygon. International Workshop on Combinatorial Image Analysis, May 2011, Madrid, Spain. pp.208-221. ⟨hal-00943828⟩
43 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More