{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:17:34Z","timestamp":1768979854884,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"15","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0167-8655(03)00103-x","type":"journal-article","created":{"date-parts":[[2003,6,21]],"date-time":"2003-06-21T04:37:35Z","timestamp":1056170255000},"page":"2585-2595","source":"Crossref","is-referenced-by-count":35,"title":["Approximation of digital curves with line segments and circular arcs using genetic algorithms"],"prefix":"10.1016","volume":"24","author":[{"given":"Biswajit","family":"Sarkar","sequence":"first","affiliation":[]},{"given":"Lokendra K.","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Debranjan","family":"Sarkar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8655(03)00103-X_BIB1","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0167-8655(97)00005-6","article-title":"Pattern classification with genetic algorithms: incorporation of chromosome differentiation","volume":"18","author":"Bandyopadhyay","year":"1997","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0020-0255(97)00069-8","article-title":"Incorporating chromosome differentiation in genetic algorithms","volume":"104","author":"Bandyopadhyay","year":"1998","journal-title":"Inform. Sci."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB3","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/34.784293","article-title":"Fast decomposition of digital curves into polygons using the Haar transform","volume":"21","author":"Davis","year":"1999","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/TPAMI.1986.4767753","article-title":"Optimum uniform piecewise linear approximation of planar curves","volume":"8","author":"Dunham","year":"1986","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB5","series-title":"Genetic algorithms in search, optimization and machine learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0167-8655(03)00103-X_BIB6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0167-8655(00)00104-5","article-title":"A dynamic programming approach for fitting digital planar curves with line segments and circular arcs","volume":"22","author":"Horng","year":"2001","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB7","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1016\/S0031-3203(98)00173-3","article-title":"Polygonal approximation using genetic algorithms","volume":"32","author":"Huang","year":"1999","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0167-8655(03)00103-X_BIB8","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1016\/0167-8655(96)00015-3","article-title":"Segmentation of digital plane curves: a dynamic focusing approach","volume":"17","author":"Ichoku","year":"1996","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB9","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.1109\/34.643901","article-title":"Comments on Nonparametric segmentation of curves into various representations","volume":"19","author":"Kanatani","year":"1997","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB10","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0004-3702(87)90070-1","article-title":"Three-dimensional object recognition from single two-dimensional images","volume":"31","author":"Lowe","year":"1987","journal-title":"Artificial Intell."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0031-3203(94)00086-2","article-title":"Fitting digital curves using circular arcs","volume":"28","author":"Pei","year":"1995","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0167-8655(03)00103-X_BIB12","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0031-3203(95)00104-2","article-title":"Optimum approximation of digital planar curves using circular arcs","volume":"29","author":"Pei","year":"1996","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0167-8655(03)00103-X_BIB13","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/0167-8655(94)90002-7","article-title":"Optimum polygonal approximation of digitized curves","volume":"15","author":"Perez","year":"1994","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB14","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0167-8655(92)90051-Z","article-title":"Detection of significant points and polygonal approximation of digitized curves","volume":"13","author":"Ray","year":"1992","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB15","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1109\/34.601253","article-title":"Techniques for assessing polygonal approximations of curves","volume":"19","author":"Rosin","year":"1997","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB16","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0262-8856(89)90004-8","article-title":"Segmentation of edges into lines and arcs","volume":"7","author":"Rosin","year":"1989","journal-title":"Image Vision Comput."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB17","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1109\/34.476507","article-title":"Nonparametric segmentation of curves into various representations","volume":"17","author":"Rosin","year":"1995","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB18","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1109\/TPAMI.1997.643902","article-title":"Response to Kanatani","volume":"19","author":"Rosin","year":"1997","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0167-8655(00)00088-X","article-title":"An efficient algorithm for the optimal polygonal approximation of digitized curve","volume":"22","author":"Salotti","year":"2001","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB20","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0031-3203(01)00051-6","article-title":"Optimal polygonal approximation of digitized curves using the sum of square deviations criterion","volume":"35","author":"Salotti","year":"2002","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0167-8655(03)00103-X_BIB21","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/0167-8655(93)90004-W","article-title":"A simple algorithm for detection of significant vertices for polygonal approximation of chain coded curves","volume":"14","author":"Sarkar","year":"1993","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB22","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1016\/S0031-3203(96)00181-1","article-title":"Matching structural shape descriptions using genetic algorithms","volume":"30","author":"Singh","year":"1997","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0167-8655(03)00103-X_BIB23","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1109\/34.31447","article-title":"On the detection of dominant points on digital curves","volume":"11","author":"Teh","year":"1989","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB24","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1016\/S0167-8655(98)00082-8","article-title":"A new method for polygonal approximation using genetic algorithms","volume":"19","author":"Yin","year":"1998","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(03)00103-X_BIB25","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1142\/S0218001499000598","article-title":"Genetic algorithms for polygonal approximation of digital curves","volume":"13","author":"Yin","year":"1999","journal-title":"Internat. J. Pattern Recognition Artificial Intell."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016786550300103X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016786550300103X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T06:28:30Z","timestamp":1552976910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016786550300103X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":25,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S016786550300103X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(03)00103-x","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}