{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:42:53Z","timestamp":1773081773808,"version":"3.50.1"},"reference-count":22,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2000,3]]},"abstract":"<jats:p> Most of the previous polygonal approximation methods are sub-optimal and their compression ratio with respect to a given error tolerance is not good enough for some applications. Recently, a genetic-based approach which can provide near-optimal solutions is presented, but the demands on computation and memory are too high. In this paper, a new polygonal approximation method using the tabu search technique is presented. The proposed method produces a higher compression ratio than the suboptimal approach and the genetic-based approach, and the computation cost and the memory store are more efficient. <\/jats:p>","DOI":"10.1142\/s0218001400000167","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T07:03:21Z","timestamp":1027753401000},"page":"243-255","source":"Crossref","is-referenced-by-count":30,"title":["A TABU SEARCH APPROACH TO POLYGONAL APPROXIMATION OF DIGITAL CURVES"],"prefix":"10.1142","volume":"14","author":[{"given":"PENG-YENG","family":"YIN","sequence":"first","affiliation":[{"name":"Department of Information Management, Ming Chuan University,  Taipei, Taiwan 111, ROC"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(95)00022-R"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(91)90057-C"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.43.7.908"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1986.4767753"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(97)00127-1"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.1.4"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1109\/21.293514"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00052-4"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)E0174-V"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.224041"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/S0146-664X(72)80017-0"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(93)90106-7"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(94)00081-D"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(92)90126-4"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(80)90031-X"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.108"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1109\/34.31447"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1016\/S0734-189X(84)80023-7"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1006\/cgip.1993.1006"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(98)00082-8"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001499000598"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001400000167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:12:00Z","timestamp":1565129520000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001400000167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":22,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2000,3]]}},"alternative-id":["10.1142\/S0218001400000167"],"URL":"https:\/\/doi.org\/10.1142\/s0218001400000167","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}