{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T13:27:58Z","timestamp":1774877278749,"version":"3.50.1"},"reference-count":43,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"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":[[2001,12]]},"DOI":"10.1016\/s0031-3203(00)00159-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:21:01Z","timestamp":1027632061000},"page":"2305-2317","source":"Crossref","is-referenced-by-count":49,"title":["An efficient evolutionary algorithm for accurate polygonal approximation"],"prefix":"10.1016","volume":"34","author":[{"given":"Shinn-Ying","family":"Ho","sequence":"first","affiliation":[]},{"given":"Yeong-Chinq","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(00)00159-X_BIB1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0734-189X(86)80027-5","article-title":"Computational-geometric methods for polygonal approximations of a curve","volume":"36","author":"Imai","year":"1986","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1142\/S0218195996000058","article-title":"Approximation of polygonal curves with minimum number of line segments or minimum error","volume":"6","author":"Chan","year":"1996","journal-title":"Int. J. Comput. Geom."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB3","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/0167-8655(94)90002-7","article-title":"Optimal polygonal approximation of digital curves","volume":"15","author":"Perez","year":"1994","journal-title":"Pattern Recognition Lett."},{"issue":"2","key":"10.1016\/S0031-3203(00)00159-X_BIB4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0167-8655(85)90014-5","article-title":"An O(n) algorithm for polygonal approximation","volume":"3","author":"Cordella","year":"1985","journal-title":"Pattern Recognition Lett."},{"issue":"3","key":"10.1016\/S0031-3203(00)00159-X_BIB5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1006\/cgip.1994.1021","article-title":"On approximating polygonal curves in two and three dimensions, CVG","volume":"56","author":"Eu","year":"1994","journal-title":"Graph. Models Image Process."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB6","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/366573.366611","article-title":"On the approximation of curves by line segments using dynamic programming","volume":"4","author":"Bellman","year":"1961","journal-title":"Commun. ACM"},{"key":"10.1016\/S0031-3203(00)00159-X_BIB7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/TPAMI.1986.4767753","article-title":"Optimum uniform piecewise linear approximation of planner curves","volume":"8","author":"Dunham","year":"1986","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. PAMI-"},{"key":"10.1016\/S0031-3203(00)00159-X_BIB8","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1109\/TC.1977.1674918","article-title":"Polygonal approximation by Newton's method","volume":"26","author":"Pavlidis","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB9","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/0167-8655(95)80001-A","article-title":"An algorithm for polygonal approximation of digital curves, based on iterative points elimination","volume":"16","author":"Pikaz","year":"1995","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB10","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 Processing"},{"key":"10.1016\/S0031-3203(00)00159-X_BIB11","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0734-189X(84)80023-7","article-title":"Afast sequential method for polygonal approximation of digitized curves","volume":"28","author":"Wall","year":"1984","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB12","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(00)00159-X_BIB13","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(00)00159-X_BIB14","first-page":"571","article-title":"Polygonal approximation of 2-D shapes through boundary merging","volume":"28","author":"Leu","year":"1988","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(00)00159-X_BIB15","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(00)00159-X_BIB16","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0031-3203(91)90057-C","article-title":"On detecting dominant points","volume":"24","author":"Ansari","year":"1991","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(00)00159-X_BIB17","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/S0031-3203(97)00081-2","article-title":"Reliable polygonal approximations of imaged real objects through dominant point detection","volume":"31","author":"Inesta","year":"1998","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(00)00159-X_BIB18","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/0167-8655(92)90084-D","article-title":"An algorithm for detection of dominant points and polygonal approximation of digitized curves","volume":"13","author":"Ray","year":"1992","journal-title":"Pattern Recognition Lett."},{"issue":"8","key":"10.1016\/S0031-3203(00)00159-X_BIB19","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1109\/34.31447","article-title":"On the dominant points on digital curves","volume":"11","author":"Teh","year":"1989","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB20","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, CVG","volume":"55","author":"Wu","year":"1993","journal-title":"Graphical Models Image Process."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB21","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0167-8655(96)00116-X","article-title":"Another look at the dominant point detection of digital curves","volume":"18","author":"Cornic","year":"1997","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB22","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1109\/TC.1973.5009188","article-title":"Angle detection on digital curves","volume":"22","author":"Rosenfeld","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB23","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1109\/T-C.1975.224342","article-title":"An improved method of angle detection on digital curves","volume":"24","author":"Rosenfeld","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB24","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1109\/TC.1977.1674825","article-title":"A corner-fitting algorithm for chain-coded curves","volume":"26","author":"Freeman","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB25","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TPAMI.1986.4767756","article-title":"Perceptual organization and curve partitioning","volume":"8","author":"Fishler","year":"1986","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB26","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/TPAMI.1986.4767750","article-title":"Scale-based description and recognition of planar curves and two-dimensional shapes","volume":"8","author":"Okhtarian","year":"1986","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB27","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1016\/0031-3203(93)90161-O","article-title":"Finding contour-based abstractions of planar patterns","volume":"26","author":"Arcelli","year":"1993","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(00)00159-X_BIB28","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0167-8655(88)90069-4","article-title":"An ISODATA algorithm for straight line fitting","volume":"7","author":"Phillips","year":"1988","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB29","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-8655(97)00154-2","article-title":"Algorithms for straight line fitting using K-means","volume":"19","author":"Yin","year":"1998","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB30","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1016\/S0167-8655(98)00082-8","article-title":"A new method of polygonal approximation using genetic algorithm","volume":"19","author":"Yin","year":"1998","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB31","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":"Yukio","year":"1992","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(00)00159-X_BIB32","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0031-3203(94)00108-X","article-title":"Optimal polygonal approximation of digital curves","volume":"28","author":"Pikaz","year":"1995","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(00)00159-X_BIB33","unstructured":"J.H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB34","unstructured":"D.E. Goldberg, Genetic Algorithms in Search Optimization and Machine Learning, Addison\u2013Wesley, Reading, MA, 1989."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB35","unstructured":"S.-Y. Ho, L.-S. Shu, H.-M. Chen, Intelligent genetic algorithm with a new intelligent crossover using orthogonal arrays, GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida, USA, July 14\u201317, 1999, pp. 289\u2013296."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB36","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0377-2217(95)00077-1","article-title":"Genetic algorithms and traveling salesman problems","volume":"93","author":"Chatterjee","year":"1996","journal-title":"E. J. Oper. Res."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB37","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/91.413232","article-title":"Selecting fuzzy if-then rules for classification problems using genetic algorithms","volume":"3","author":"Ishibuchi","year":"1995","journal-title":"IEEE Trans. Fuzzy Systems"},{"issue":"2","key":"10.1016\/S0031-3203(00)00159-X_BIB38","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/91.755393","article-title":"Implementation of evolutionary fuzzy systems","volume":"7","author":"Shi","year":"1999","journal-title":"IEEE Trans. Fuzzy Systems"},{"issue":"4","key":"10.1016\/S0031-3203(00)00159-X_BIB39","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","article-title":"Adaptive probabilities of crossover and mutation in genetic algorithms, IEEE Trans. System","volume":"24","author":"Hrinivas","year":"1994","journal-title":"Man Cybernet."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB40","first-page":"895","article-title":"Penalty guided genetic search for reliability design optimization","volume":"30","author":"Coit","year":"1996","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(00)00159-X_BIB41","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1080\/00207729808929513","article-title":"Self crossover","volume":"29","author":"Pal","year":"1998","journal-title":"Int. J. Systems Sci."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB42","unstructured":"S. Taguchi, S. Konishi, Orthogonal Arrays and Linear Graphs, America Supplier Institute, Dearbon, MI, 1987."},{"key":"10.1016\/S0031-3203(00)00159-X_BIB43","unstructured":"M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, CA, 1979."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S003132030000159X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S003132030000159X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T12:54:22Z","timestamp":1555764862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S003132030000159X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":43,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["S003132030000159X"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(00)00159-x","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}