{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:28:38Z","timestamp":1773080918352,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0031-3203(02)00321-7","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T04:06:40Z","timestamp":1051243600000},"page":"1783-1797","source":"Crossref","is-referenced-by-count":71,"title":["Ant colony search algorithms for optimal polygonal approximation of plane curves"],"prefix":"10.1016","volume":"36","author":[{"given":"Peng-Yeng","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(02)00321-7_BIB1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0031-3203(80)90031-X","article-title":"Fast polygonal approximation of digitized curves","volume":"12","author":"Sklansky","year":"1980","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(02)00321-7_BIB2","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0146-664X(82)90011-9","article-title":"Polygonal approximation by the minimax method","volume":"19","author":"Kurozumi","year":"1982","journal-title":"Comput. Graphics Image Process."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB3","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/0031-3203(93)90106-7","article-title":"Determination of optimal polygon from digital curve using L1 norm","volume":"26","author":"Ray","year":"1993","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(02)00321-7_BIB4","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/S0146-664X(72)80017-0","article-title":"An iterative procedure for the polygonal approximation of plane curves","volume":"1","author":"Ramer","year":"1972","journal-title":"Comput. Graphics Image Process."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB5","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0031-3203(91)90057-C","article-title":"On detection dominant points","volume":"24","author":"Ansari","year":"1991","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(02)00321-7_BIB6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0167-8655(94)00081-D","article-title":"A new split-and-merge technique for polygonal approximation of chain coded curves","volume":"16","author":"Ray","year":"1995","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB7","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. Mach. Intell."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1006\/cgip.1993.1006","article-title":"Detecting the dominant points by the curvature-based polygonal approximation","volume":"55","author":"Wu","year":"1993","journal-title":"CVGIP: Graphical Models Image Process."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB9","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/21.293514","article-title":"Towards a hierarchical contour description via dominant point detection","volume":"24","author":"Held","year":"1994","journal-title":"IEEE Trans. System Man Cybernet."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB10","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. Mach. Intell."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB11","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1016\/0031-3203(92)90126-4","article-title":"Piecewise linear approximation of plane curves by perimeter optimization","volume":"25","author":"Sato","year":"1992","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(02)00321-7_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218001499000021","article-title":"Genetic algorithms for polygonal approximation of digital curves","volume":"13","author":"Yin","year":"1999","journal-title":"Int. J. Pattern Recognition Artif. Intell."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB13","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\/S0031-3203(02)00321-7_BIB14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1142\/S0218001400000167","article-title":"A tabu search approach to the polygonal approximation of digital curves","volume":"14","author":"Yin","year":"2000","journal-title":"Int. J. Pattern Recognition Artif. Intell."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB15","unstructured":"M. Dorigo, Optimization, learning, and natural algorithms, Ph.D. Thesis, Dip. Elettronica e Informazione, Politecnico di Milano, Italy, 1992."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB17","unstructured":"V. Maniezzo, A. Colorni, M. Dorigo, The ant system applied to the quadratic assignment problem, Universite Libre de Bruxelles, Belgium, Technical Report IRIDIA\/94-28, 1994."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0378-7796(99)00011-5","article-title":"Combined heat and power economic dispatch by improved ant colony search algorithm","volume":"52","author":"Song","year":"1999","journal-title":"Electric Power Systems Res."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB19","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1109\/70.795795","article-title":"Distributed covering by Ant-Robotics using evaporating traces","volume":"15","author":"Wagner","year":"1999","journal-title":"IEEE Trans. Robotics Automat."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB20","unstructured":"I.A. Wagner, M. Lindenbaum, A.M. Bruckstein, On-line graph searching by a smell-oriented vertex process, in: Proceedings of AAAI\u201997 Workshop On-Line Search, Providence, RI, 1997, pp. 122\u2013125."},{"key":"10.1016\/S0031-3203(02)00321-7_BIB21","series-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg","year":"1989"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320302003217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320302003217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:58:54Z","timestamp":1553648334000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320302003217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0031320302003217"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(02)00321-7","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}