A method for polygonal approximation of digital planar curves is proposed. This method is relied on the supression of dominant points. Initially, the method uses the set of all breakpoints as dominant points. The method eliminates dominant points until a final condition is satisfied. The residuary dominant points are the polygonal approximation. This aproximation is compared with other classical algorithms. The experimental results show that this method works well for digital planar curves with features of several sizes. © 2010 Springer-Verlag.
CITATION STYLE
Carmona-Poyato, A., Medina-Carnicer, R., Fernandez-Garcia, N. L., Madrid-Cuevas, F. J., & Muñoz-Salinas, R. (2010). Method for polygonal approximation through dominant points deletion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6098 LNAI, pp. 350–358). https://doi.org/10.1007/978-3-642-13033-5_36
Mendeley helps you to discover research relevant for your work.