An elementary algorithm for digital arc segmentation

Abstract : 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.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00185112
Contributor : David Coeurjolly <>
Submitted on : Tuesday, November 6, 2007 - 11:16:54 AM
Last modification on : Wednesday, April 3, 2019 - 3:38:03 PM
Long-term archiving on : Monday, April 12, 2010 - 1:19:05 AM

Files

dam.pdf
Publisher files allowed on an open archive

Identifiers

Citation

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

Share

Metrics

Record views

343

Files downloads

312