{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:09:57Z","timestamp":1760440197699},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1016\/0020-0190(87)90170-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"247-251","source":"Crossref","is-referenced-by-count":29,"title":["An \u03c9(\u221an) lower bound for the nonoptimality of the greedy triangulation"],"prefix":"10.1016","volume":"25","author":[{"given":"Christos","family":"Levcopoulos","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90170-0_BIB1","article-title":"New results in planar triangulations","author":"Gilbert","year":"1979"},{"issue":"3","key":"10.1016\/0020-0190(87)90170-0_BIB2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(80)90062-9","article-title":"A note on Delaunay and optimal triangulations","volume":"10","author":"Kirkpatrick","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90170-0_BIB3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70044-X","article-title":"Minimal triangulations of polygonal domains","volume":"9","author":"Klincsek","year":"1980","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0020-0190(87)90170-0_BIB4","doi-asserted-by":"crossref","unstructured":"C. Levcopoulos and A. Lingas, On approximation behavior of the greedy triangulation for convex polygons, Algorithmica, to appear.","DOI":"10.1007\/BF01840358"},{"key":"10.1016\/0020-0190(87)90170-0_BIB5","series-title":"Proc. 23rd Allerton Conf. on Computing, Communication and Control","article-title":"A linear-time heuristic for minimum weight triangulation of convex polygons","author":"Lingas","year":"1985"},{"issue":"1","key":"10.1016\/0020-0190(87)90170-0_BIB6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(86)90038-4","article-title":"The greedy and Delaunay triangulations are not bad in the average case","volume":"22","author":"Lingas","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90170-0_BIB7","series-title":"Proc. 2nd Symp. on Computational Geometry","article-title":"On approximation behavior and implementation of the greedy triangulation for convex planar point sets","author":"Lingas","year":"1986"},{"key":"10.1016\/0020-0190(87)90170-0_BIB8","series-title":"Proc. 18th Ann. IEEE Conf. on the Foundations of Computer Science","article-title":"On triangulations of a set of points in the plane","author":"Lloyd","year":"1977"},{"issue":"1","key":"10.1016\/0020-0190(87)90170-0_BIB9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(79)90104-2","article-title":"Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation","volume":"9","author":"Manacher","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90170-0_BIB10","series-title":"The use of probabilistic methods and of heaps for fast-average-case, space-optimal greedy algorithms (Extended abstract)","author":"Manacher","year":"1982"},{"key":"10.1016\/0020-0190(87)90170-0_BIB11","series-title":"Texts and Monographs in Computer Science","article-title":"Computational Geometry, An Introduction","author":"Preparata","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901700?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901700?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:54:17Z","timestamp":1553594057000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087901700"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["0020019087901700"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90170-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}