Abstract
A new solution is proposed to decompose a curve into arcs and straight line segments in O(nlogn) time. It is a combined solution based on arc detection [1] and dominant point detection [2] to strengthen the quality of the segmentation results. Experimental results show the fastness of the proposed method. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Nguyen, T. P., & Debled-Rennesson, I. (2011). Decomposition of a curve into arcs and line segments based on dominant point detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6688 LNCS, pp. 794–805). https://doi.org/10.1007/978-3-642-21227-7_74
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
