The computation of polygonal approximations for 2D contours based on a concavity tree. - Eusebio J. Aguilera-Aguilera; Ángel Carmona-Poyato; Francisco José Madrid-Cuevas; Rafael Medina Carnicer (J. Vis. Commun. Image Represent., 2014)

Unsupervised Approximation of Digital Planar Curves. - Eusebio J. Aguilera-Aguilera; Ángel Carmona-Poyato; Francisco José Madrid-Cuevas; Rafael Medina Carnicer (IbPRIA, 2015)

New Method for Obtaining Optimal Polygonal Approximations. - Ángel Carmona-Poyato; Eusebio J. Aguilera-Aguilera; Francisco José Madrid-Cuevas; David López-Fernández (IbPRIA, 2015)

Novel method to obtain the optimal polygonal approximation of digital planar curves based on Mixed Integer Programming. - Eusebio J. Aguilera-Aguilera; Ángel Carmona-Poyato; Francisco José Madrid-Cuevas; Rafael Muñoz-Salinas (J. Vis. Commun. Image Represent., 2015)

Fast computation of optimal polygonal approximations of digital planar closed curves. - Eusebio J. Aguilera-Aguilera; Ángel Carmona-Poyato; Francisco José Madrid-Cuevas; Manuel Jesús Marín-Jiménez (Graph. Model., 2016)

An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves. - Francisco José Madrid-Cuevas; Eusebio J. Aguilera-Aguilera; Ángel Carmona-Poyato; Rafael Muñoz-Salinas; Rafael Medina Carnicer; Nicolás Luis Fernández García (J. Vis. Commun. Image Represent., 2016)

New method for obtaining optimal polygonal approximations to solve the min- $$ varepsilon$$ ε problem. - Ángel Carmona-Poyato; Eusebio J. Aguilera-Aguilera; Francisco José Madrid-Cuevas; Manuel J. Marín-Jiménez; Nicolás Luis Fernández García (Neural Comput. Appl., 2017)