{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T17:12:07Z","timestamp":1774458727929,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"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":["Computer Vision, Graphics, and Image Processing"],"published-print":{"date-parts":[[1986,10]]},"DOI":"10.1016\/s0734-189x(86)80027-5","type":"journal-article","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T02:01:00Z","timestamp":1154224860000},"page":"31-41","source":"Crossref","is-referenced-by-count":124,"title":["Computational-geometric methods for polygonal approximations of a curve"],"prefix":"10.1016","volume":"36","author":[{"given":"Hiroshi","family":"Imai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masao","family":"Iri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0734-189X(86)80027-5_bib1","series-title":"Computational Geometry","first-page":"23","article-title":"Simple on-line algorithms for convex polygons","author":"Avis","year":"1985"},{"issue":"No. 5","key":"10.1016\/S0734-189X(86)80027-5_bib2","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1145\/358645.358661","article-title":"Strip trees: A hierarchical representation for curves","volume":"24","author":"Ballard","year":"1981","journal-title":"Commun. ACM"},{"key":"10.1016\/S0734-189X(86)80027-5_bib3","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","article-title":"An efficient algorithm for determining the convex hull of a finite planar set","volume":"1","author":"Graham","year":"1972","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/S0734-189X(86)80027-5_bib4","first-page":"689","article-title":"Segmentation of plane curves","volume":"58-D","author":"Ichida","year":"1975","journal-title":"Trans. Electron. Commun. Eng. Japan"},{"key":"10.1016\/S0734-189X(86)80027-5_bib5","article-title":"Studies on Algorithms in Computational Geometry","author":"Imai","year":"1986"},{"key":"10.1016\/S0734-189X(86)80027-5_bib6","author":"Imai","year":"1985"},{"key":"10.1016\/S0734-189X(86)80027-5_bib7","unstructured":"H. Imai and M. Iri, An optimal algorithm for approximating a piecewise linear function, J. Inf. Process. submitted."},{"key":"10.1016\/S0734-189X(86)80027-5_bib8","author":"Imai","year":"1986"},{"key":"10.1016\/S0734-189X(86)80027-5_bib9","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. Vision Graphics Image Process"},{"key":"10.1016\/S0734-189X(86)80027-5_bib10","series-title":"Polygonal chain approximation: An improvement to an algorithm of Imai and Iri","author":"O'Rourke","year":"1985"},{"key":"10.1016\/S0734-189X(86)80027-5_bib11","unstructured":"J. O'Rourke, private communication, 1985."},{"key":"10.1016\/S0734-189X(86)80027-5_bib12","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1145\/359131.359132","article-title":"An optimal real time algorithm for planar convex hulls","volume":"22","author":"Preparata","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/S0734-189X(86)80027-5_bib13","article-title":"Computational Geometry","author":"Shamos","year":"1978"},{"key":"10.1016\/S0734-189X(86)80027-5_bib14","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 Recognit."},{"key":"10.1016\/S0734-189X(86)80027-5_bib15","series-title":"Proceedings, IEEE MELECON","article-title":"Solving geometric problems with the \u201crotating calipers\u201d","author":"Toussaint","year":"1983"},{"key":"10.1016\/S0734-189X(86)80027-5_bib16","series-title":"Proceedings, IASTED Int. Symp. Robotics and Automation","article-title":"On the complexity of approximating polygonal curves in the plane","author":"Toussaint","year":"1985"},{"key":"10.1016\/S0734-189X(86)80027-5_bib17","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/0146-664X(78)90055-2","article-title":"An efficient algorithm for the piecewise linear approximation of planar curves","volume":"8","author":"Williams","year":"1978","journal-title":"Comput. Vision Graphics Image Process"}],"container-title":["Computer Vision, Graphics, and Image Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0734189X86800275?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0734189X86800275?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T13:51:22Z","timestamp":1547473882000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0734189X86800275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["S0734189X86800275"],"URL":"https:\/\/doi.org\/10.1016\/s0734-189x(86)80027-5","relation":{},"ISSN":["0734-189X"],"issn-type":[{"value":"0734-189X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}