{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:03:27Z","timestamp":1743062607686,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193892"},{"type":"electronic","value":"9783319193908"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19390-8_17","type":"book-chapter","created":{"date-parts":[[2015,6,10]],"date-time":"2015-06-10T21:50:46Z","timestamp":1433973046000},"page":"149-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New Method for Obtaining Optimal Polygonal Approximations"],"prefix":"10.1007","author":[{"given":"Angel","family":"Carmona-Poyato","sequence":"first","affiliation":[]},{"given":"Eusebio J.","family":"Aguilera-Aguilera","sequence":"additional","affiliation":[]},{"given":"Francisco J.","family":"Madrid-Cuevas","sequence":"additional","affiliation":[]},{"given":"D.","family":"L\u00f3pez-Fernandez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,9]]},"reference":[{"key":"17_CR1","first-page":"371","volume":"28","author":"A Pikaz","year":"1995","unstructured":"Pikaz, A., Dinstein, I.: Optimal polygonal approximation of digital curves. Pattern Recogn. 28, 371\u2013379 (1995)","journal-title":"Pattern Recogn."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/S0218195903001086","volume":"13","author":"DZ Chen","year":"2003","unstructured":"Chen, D.Z., Daescu, O.: Space-efficient algorithms for approximating polygonal curves in two-dimensional space. Int. J. Comput. Geom. Appl. 13, 95\u2013111 (2003)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/0167-8655(94)90002-7","volume":"15","author":"JC Perez","year":"1994","unstructured":"Perez, J.C., Vidal, E.: Optimum polygonal approximation of digitized curves. Pattern Recogn. Lett. 15, 743\u2013750 (1994)","journal-title":"Pattern Recogn. Lett."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-8655(01)00098-8","volume":"23","author":"JH Horng","year":"2002","unstructured":"Horng, J.H., Li, J.T.: An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves. Pattern Recogn. Lett. 23, 171\u2013182 (2002)","journal-title":"Pattern Recogn. Lett."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0167-8655(00)00088-X","volume":"22","author":"M Salotti","year":"2001","unstructured":"Salotti, M.: An efficient algorithm for the optimal polygonal approximation of digitized curves. Pattern Recogn. Lett. 22, 215\u2013221 (2001)","journal-title":"Pattern Recogn. Lett."},{"key":"17_CR6","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.: Optimal polygonal approximation of digitized curves using the sum of square deviations criterion. Pattern Recogn. 35, 435\u2013443 (2002)","journal-title":"Pattern Recogn."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0031-3203(95)00104-2","volume":"29","author":"SC Pei","year":"1996","unstructured":"Pei, S.C., Horng, J.H.: Optimum approximation of digital planar curves using circular arcs. Pattern Recogn. 29, 383\u2013388 (1996)","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19390-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:48:35Z","timestamp":1676944115000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19390-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193892","9783319193908"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19390-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}