{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:14:08Z","timestamp":1761621248013,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2016,2,4]],"date-time":"2016-02-04T00:00:00Z","timestamp":1454544000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00521-016-2198-7","type":"journal-article","created":{"date-parts":[[2016,2,4]],"date-time":"2016-02-04T05:44:46Z","timestamp":1454564686000},"page":"2383-2394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["New method for obtaining optimal polygonal approximations to solve the min-\n                $$\\varepsilon$$\n                \n                    \n                                    \n                        \u03b5\n                    \n                \n             problem"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8820-8396","authenticated-orcid":false,"given":"A.","family":"Carmona-Poyato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. J.","family":"Aguilera-Aguilera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. J.","family":"Madrid-Cuevas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. J.","family":"Mar\u00edn-Jim\u00e9nez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. L.","family":"Fern\u00e1ndez-Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,4]]},"reference":[{"key":"2198_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0004-3702(87)90070-1","volume":"31","author":"DG Lowe","year":"1987","unstructured":"L\nowe DG (1987) Three-dimensional object recognition from single two-dimensional images. Artif Intell 31:355\u2013395","journal-title":"Artif Intell"},{"key":"2198_CR2","doi-asserted-by":"publisher","unstructured":"Grauman K, Darrell T (2004) Fast contour matching using approximate earth mover\u2019s distance. In: Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004, vol 1, pp I\u2013220\u2013I\u2013227. doi:\n                        10.1109\/CVPR.2004.1315035","DOI":"10.1109\/CVPR.2004.1315035"},{"issue":"5","key":"2198_CR3","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TIP.2012.2186146","volume":"21","author":"M Chen","year":"2012","unstructured":"Chen M, Xu M, Franti P (2012) A fast multiresolution polygonal approximation algorithm for GPS trajectory simplification. IEEE Trans Image Process 21(5):2770\u20132785. doi:\n                        10.1109\/TIP.2012.2186146\n                        \n                     (ISSN 1057-7149)","journal-title":"IEEE Trans Image Process"},{"issue":"2","key":"2198_CR4","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"DH Douglas","year":"1973","unstructured":"Douglas \nDH, Peucker TK (1973) Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartogr Int J Geogr Inf Geovis 10(2):112\u2013122. doi:\n                        10.3138\/FM57-6770-U75U-7727","journal-title":"Cartogr Int J Geogr Inf Geovis"},{"issue":"01","key":"2198_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0218195996000058","volume":"06","author":"WS Chan","year":"1996","unstructured":"Chan WS, Chin F (1996) Approximation of polygonal curves with minimum number of line segments or minimum error. Int J Comput Geom Appl 06(01):59\u201377. doi:\n                        10.1142\/S0218195996000058\n                        \n                     (ISSN 0218-1959)","journal-title":"Int J Comput Geom Appl"},{"key":"2198_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/83.650847","volume":"7","author":"GM Schuster","year":"1998","unstructured":"Schuster GM, Katsaggelos AK (1998) An optimal polygonal boundary encoding scheme in the rate distortion sense. IEEE Trans Image Process 7:13\u201326","journal-title":"IEEE Trans Image Process"},{"issue":"02","key":"2198_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/S0218195903001086","volume":"13","author":"DZ Chen","year":"2003","unstructured":"Chen DZ, Daescu O (2003) Space-efficient algorithms for approximating polygonal curves in two-dimensional space. Int J Comput Geom Appl 13(02):95\u2013111. doi:\n                        10.1142\/S0218195903001086\n                        \n                     (ISSN 0218-1959)","journal-title":"Int J Comput Geom Appl"},{"issue":"8","key":"2198_CR8","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/0167-8655(94)90002-7","volume":"15","author":"J-C Perez","year":"1994","unstructured":"Perez J-C, Vidal E (1994) Optimum polygonal approximation of digitized curves. Pattern Recogn Lett 15(8):743\u2013750. doi:\n                        10.1016\/0167-8655(94)90002-7\n                        \n                     (ISSN 0167-8655)","journal-title":"Pattern Recogn Lett"},{"issue":"1\u20133","key":"2198_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-8655(01)00098-8","volume":"23","author":"J-H Horng","year":"2002","unstructured":"Horng J-H, Li JT (2002) An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves. Pattern Recogn Lett 23(1\u20133):171\u2013182. doi:\n                        10.1016\/S0167-8655(01)00098-8\n                        \n                     (ISSN 0167-8655)","journal-title":"Pattern Recogn Lett"},{"issue":"22","key":"2198_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0167-8655(00)00088-X","volume":"2","author":"M Salotti","year":"2001","unstructured":"Salotti M (2001) An efficient algorithm for the optimal polygonal approximation of digitized curves. Pattern Recogn Lett 2(22):215\u2013221. doi:\n                        10.1016\/S0167-8655(00)00088-X\n                        \n                     (ISSN 0167-8655)","journal-title":"Pattern Recogn Lett"},{"issue":"4","key":"2198_CR11","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1016\/j.patcog.2006.09.002","volume":"40","author":"A Kolesnikov","year":"2007","unstructured":"Kolesnikov A, Franti P (2007) Polygonal approximation of closed discrete curves. Pattern Recogn 40(4):1282\u20131293. doi:\n                        10.1016\/j.patcog.2006.09.002\n                        \n                     (ISSN 0031-3203)","journal-title":"Pattern Recogn"},{"issue":"6","key":"2198_CR12","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0167-8655(95)80001-A","volume":"16","author":"A Pikaz","year":"1995","unstructured":"Pikaz A, Dinstein I (1995) An algorithm for polygonal approximation based on iterative point elimination. Pattern Recogn Lett 16(6):557\u2013563. doi:\n                        10.1016\/0167-8655(95)80001-A\n                        \n                     (ISSN 0167-8655)","journal-title":"Pattern Recogn Lett"},{"issue":"3","key":"2198_CR13","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0031-3203(95)00104-2","volume":"29","author":"S-C Pei","year":"1996","unstructured":"Pei S-C, Horng J-H (1996) Optimum approximation of digital planar curves using circular arcs. Pattern Recogn 29(3):383\u2013388. doi:\n                        10.1016\/0031-3203(95)00104-2\n                        \n                     (ISSN 0031-3203)","journal-title":"Pattern Recogn"},{"issue":"14","key":"2198_CR14","doi-asserted-by":"publisher","first-page":"2243","DOI":"10.1016\/S0167-8655(03)00051-5","volume":"24","author":"A Kolesnikov","year":"2003","unstructured":"Kolesnikov A, Franti P (2003) Reduced-search dynamic programming for approximation of polygonal curves. Pattern Recogn Lett 24(14):2243\u20132254. doi:\n                        10.1016\/S0167-8655(03)00051-5\n                        \n                     (ISSN 0167-8655)","journal-title":"Pattern Recogn Lett"},{"issue":"2","key":"2198_CR15","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0031-3203(01)00051-6","volume":"35","author":"M Salotti","year":"2002","unstructured":"Salotti M (2002) Optimal polygonal approximation of digitized curves using the sum of square deviations criterion. Pattern Recogn 35(2):435\u2013443. doi:\n                        10.1016\/S0031-3203(01)00051-6\n                        \n                     (ISSN 0031-3203)","journal-title":"Pattern Recogn"},{"key":"2198_CR16","doi-asserted-by":"crossref","unstructured":"Carmona-Poyato A, Aguilera-Aguilera EJ, Madrid-Cuevas FJ, Lopez-Fernandez D (2015) New method for obtaining optimal polygonal approximations. In: Paredes R, Cardoso JS, Pardo XM (eds) Pattern recognition and image analysis, number 9117 in Lecture Notes in Computer Science. Springer, Berlin, pp 149\u2013156 (ISBN 978-3-319-19389-2 978-3-319-19390-8)","DOI":"10.1007\/978-3-319-19390-8_17"},{"key":"2198_CR17","doi-asserted-by":"publisher","unstructured":"Latecki LJ, Lakamper R, Eckhardt T (2000) Shape descriptors for non-rigid shapes with a single closed contour. In: Proceedings of IEEE conference on computer vision and pattern recognition, 2000. CVPR 2000, vol 1, pp 424\u2013429. doi:\n                        10.1109\/CVPR.2000.855850","DOI":"10.1109\/CVPR.2000.855850"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2198-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2198-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2198-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2198-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T22:21:29Z","timestamp":1559082089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2198-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,4]]},"references-count":17,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2198"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2198-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2016,2,4]]}}}