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...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2004-04, Vol.139 (1), p.31-50
Main Authors: Coeurjolly, D., Gérard, Y., Reveillés, J.-P., Tougne, L.
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Artificial intelligence
Combinatorics
Combinatorics. Ordered structures
Computational Geometry
Computer Science
Computer science
control theory
systems
Exact sciences and technology
Image Processing
Mathematics
Pattern recognition. Digital image processing. Computational geometry
Sciences and techniques of general use
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2003.08.003