{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:16:03Z","timestamp":1648980963068},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2000,10]]},"abstract":"<jats:p> We present algorithms for the approximation of a convex n-gon by a convex k-gon (k&lt;n) which inscribes or circumscribes the original polygon. Our algorithms run in O(n+(n-k) log n) time and are easy to implement. Their accuracy, in the sense of area-difference, is analyzed and shown to be of the best order possible for a general algorithm. In particular, this analysis settles a question raised by O'Rourke on the performance of the approximation algorithm of Dori and Ben-Bassat. <\/jats:p>","DOI":"10.1142\/s0218195900000267","type":"journal-article","created":{"date-parts":[[2003,5,7]],"date-time":"2003-05-07T08:18:55Z","timestamp":1052295535000},"page":"445-452","source":"Crossref","is-referenced-by-count":7,"title":["EFFICIENT APPROXIMATION OF CONVEX POLYGONS"],"prefix":"10.1142","volume":"10","author":[{"given":"MARIO A.","family":"LOPEZ","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Denver, Denver, Colorado 80208, U.S.A"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SHLOMO","family":"REISNER","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Haifa, Haifa, 31905, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01898354"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-44.2.351"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01571662"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1137\/0214011"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(83)90040-3"},{"key":"p_7","first-page":"1953","author":"Fejes Toth L.","year":"1972","journal-title":"Raum. Springer-Verlag"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1145\/360881.360919"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1953.3.403"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90005-7"},{"key":"p_11","first-page":"448","volume":"34","author":"Longinetti M.","year":"1985","journal-title":"Ser. II"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00149270"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(85)90167-7"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90007-6"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535300"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195900000267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:14:55Z","timestamp":1565093695000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195900000267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":14,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2000,10]]}},"alternative-id":["10.1142\/S0218195900000267"],"URL":"https:\/\/doi.org\/10.1142\/s0218195900000267","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}