Abstract
A linear algorithm based on a discrete geometry approach is proposed for the detection of digital arcs and digital circles using a new representation of them. It is introduced by inspiring from the work of Latecki [1]. By utilizing this representation, we transform the problem of digital arc detection into a problem of digital straight line recognition. We then develop a linear method for arc segmentation of digital curves. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Nguyen, T. P., & Debled-Rennesson, I. (2011). Arc segmentation in linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6854 LNCS, pp. 84–92). Springer Verlag. https://doi.org/10.1007/978-3-642-23672-3_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
