An elementary algorithm for digital arc segmentation - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2004

An elementary algorithm for digital arc segmentation


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
Origin : Publisher files allowed on an open archive

Dates and versions

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



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⟩
175 View
310 Download



Gmail Facebook Twitter LinkedIn More