A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An elementary algorithm for digital arc segmentation
2004
Discrete Applied Mathematics
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. ?
doi:10.1016/j.dam.2003.08.003
fatcat:tkxvkuqsdzb4tb5fdgr3nr4y6a