{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T22:57:31Z","timestamp":1777157851718,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540305064","type":"print"},{"value":"9783540324201","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590316_58","type":"book-chapter","created":{"date-parts":[[2005,12,6]],"date-time":"2005-12-06T15:18:20Z","timestamp":1133882300000},"page":"382-387","source":"Crossref","is-referenced-by-count":5,"title":["A Split-Based Method for Polygonal Approximation of Shape Curves"],"prefix":"10.1007","author":[{"given":"R.","family":"Dinesh","sequence":"first","affiliation":[]},{"given":"Santhosh S.","family":"Damle","sequence":"additional","affiliation":[]},{"given":"D. S.","family":"Guru","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","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.: Reduced-search dynamic programming for approximation of polygonal curves. Pattern Recognition Letters\u00a024, 2243\u20132254 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"58_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0031-3203(03)00234-6","volume":"37","author":"D.S. Guru","year":"2004","unstructured":"Guru, D.S., Dinesh, R.: Non-parametric adaptive region of support useful for corner detection: a novel approach. Pattern Recognition\u00a037, 165\u2013168 (2004)","journal-title":"Pattern Recognition"},{"key":"58_CR3","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.: Optimum polygonal approximation of digitized curves. Pattern Recognition Letters\u00a015, 743\u2013750 (1994)","journal-title":"Pattern Recognition Letters"},{"key":"58_CR4","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1016\/S0031-3203(03)00119-5","volume":"36","author":"M. Marji","year":"2003","unstructured":"Marji, M., Siy, P.: A new algorithm for dominant points detection and polygonization of digital curves. Pattern Recognition\u00a036, 2239\u20132251 (2003)","journal-title":"Pattern Recognition"},{"key":"58_CR5","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 deviation criterion. Pattern Recognition\u00a035, 435\u2013443 (2002)","journal-title":"Pattern Recognition"},{"key":"58_CR6","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.: An algorithm for polygonal approximation based on iterative point elimination. Pattern Recognition Letter\u00a016, 557\u2013564 (1995)","journal-title":"Pattern Recognition Letter"},{"key":"58_CR7","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/0167-8655(92)90084-D","volume":"13","author":"B.K. Ray","year":"1992","unstructured":"Ray, B.K., Ray, K.S.: An algorithm for detection of dominant and polygonal approximation of digitized curves. Pattern Recognition Letters\u00a013, 849\u2013856 (1992)","journal-title":"Pattern Recognition Letters"},{"key":"58_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0167-8655(94)00081-D","volume":"16","author":"B.K. Ray","year":"1995","unstructured":"Ray, B.K., Ray, K.S.: A new split-and-merge technique for polygonal approximation of chain coded curves. Pattern Recognition Letters\u00a016, 161\u2013169 (1995)","journal-title":"Pattern Recognition Letters"},{"key":"58_CR9","doi-asserted-by":"crossref","unstructured":"Rosin, P.L.: Techniques for Assessing Polygonal Approximation of curves. IEEE Transaction on Pattern Analysis and Machine Intelligence\u00a019(6) (June 1997)","DOI":"10.1109\/34.601253"},{"key":"58_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0167-8655(98)00130-5","volume":"20","author":"D.M. Tsai","year":"1999","unstructured":"Tsai, D.M., Hou, H.T., Su, H.J.: Boundary-based corner detection using eigenvalue of covariance matrices. Pattern Recognition Letters\u00a020, 31\u201340 (1999)","journal-title":"Pattern Recognition Letters"},{"key":"58_CR11","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/0167-8655(95)80003-C","volume":"16","author":"M.J.J. Wang","year":"1995","unstructured":"Wang, M.J.J., Wu, W.Y., Huang, L.K., Wang, D.M.: Corner detection using bending value. Pattern Recognition Letters\u00a016, 575\u2013583 (1995)","journal-title":"Pattern Recognition Letters"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590316_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:58Z","timestamp":1619506198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590316_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305064","9783540324201"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11590316_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}