An elementary algorithm for digital arc segmentation - Archive ouverte HAL
Article Dans Une Revue Discrete Applied Mathematics Année : 2004

An elementary algorithm for digital arc segmentation

Résumé

This paper concerns the digital circle recognition problem, especially in the form of the circular separation problem. General fundamentals, based on classical tools, as well as algorithmic details are given (the latter by providing pseudo-code for major steps of the algorithm). After recalling the geometrical meaning of the separating circle problem, we present an incremental algorithm to segment a discrete curve into digital arcs.
Fichier principal
Vignette du fichier
dam.pdf (284.34 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00185112 , version 1 (06-11-2007)

Identifiants

Citer

David Coeurjolly, Yan Gerard, Jean-Pierre Reveillès, Laure Tougne. An elementary algorithm for digital arc segmentation. Discrete Applied Mathematics, 2004, 139 (1-3), pp.31--50. ⟨10.1016/j.dam.2003.08.003⟩. ⟨hal-00185112⟩
189 Consultations
350 Téléchargements

Altmetric

Partager

More