{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T07:57:36Z","timestamp":1767167856668,"version":"build-2238731810"},"reference-count":19,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2000,5]]},"abstract":"<jats:p>\n                    A new polygonal approximation algorithm, employing the concept of genetic evolution, is presented. In the proposed method, a chromosome is used to represent a polygon by a binary string. Each bit, called a gene, represents a point on the given curve. Three genetic operators, including selection, crossover, and mutation, are designed to obtain the approximated polygon whose error is bounded by a given norm. Many experiments show that the convergence is guaranteed and the optimal or near-optimal solutions can be obtained. Compared with the Zhu\u2013Seneviratne algorithm,\n                    <jats:sup>24<\/jats:sup>\n                    the proposed algorithm successfully reduced the number of segments under the same error condition in the polygonal approximation.\n                  <\/jats:p>","DOI":"10.1142\/s0218001400000209","type":"journal-article","created":{"date-parts":[[2003,4,22]],"date-time":"2003-04-22T07:42:39Z","timestamp":1050997359000},"page":"297-314","source":"Crossref","is-referenced-by-count":16,"title":["GENETIC ALGORITHMS FOR ERROR-BOUNDED POLYGONAL APPROXIMATION"],"prefix":"10.1142","volume":"14","author":[{"given":"YUNG-NIEN","family":"SUN","sequence":"first","affiliation":[]},{"given":"SHU-CHIEN","family":"HUANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering,   National Cheng Kung University, No. 1, University Road, Taiwan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.1985.276258"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(96)00019-2"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1986.4767753"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1109\/72.265956"},{"key":"p_6","first-page":"154","author":"Goldberg D.","year":"1985","journal-title":"Proc. First Int. Conf. Genetic Algorithms and Their Applications, Lawrence Erlbaum"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1986.289288"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/0146-664X(82)90011-9"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(94)00121-2"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1145\/37402.37422"},{"key":"p_13","first-page":"224","author":"Oliver I.","year":"1987","journal-title":"Proc. Second Int. Conf. Genetic Algorithms and Their Applications, Cambridge, MA"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.224041"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(93)90106-7"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(96)00181-1"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(80)90031-X"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(96)00074-X"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1016\/S0734-189X(84)80023-7"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1016\/0146-664X(78)90055-2"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1016\/0146-664X(81)90047-2"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1049\/ip-vis:19970985"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001400000209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:11:55Z","timestamp":1565129515000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001400000209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":19,"aliases":["10.1016\/s0218-0014(00)00020-9"],"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2000,5]]}},"alternative-id":["10.1142\/S0218001400000209"],"URL":"https:\/\/doi.org\/10.1142\/s0218001400000209","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}