{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:03:51Z","timestamp":1770995031312,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":[[1986,1]]},"DOI":"10.1016\/0020-0190(86)90038-4","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"25-31","source":"Crossref","is-referenced-by-count":26,"title":["The Greedy and Delauney triangulations are not bad in the average case"],"prefix":"10.1016","volume":"22","author":[{"given":"Andrzej","family":"Lingas","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90038-4_BIB1","series-title":"Proc. 9th Ann. ACM Symp. on Theory of Computing","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","author":"Angluin","year":"1978"},{"key":"10.1016\/0020-0190(86)90038-4_BIB2","article-title":"Automatische Interpolation von Isolinen bei willkurlichen Stutzpunkten","volume":"77","author":"Duppe","year":"1970","journal-title":"Allgemeine Vermessungsnachrichten"},{"key":"10.1016\/0020-0190(86)90038-4_BIB3","series-title":"Graph Theory","author":"Harary","year":"1969"},{"issue":"3","key":"10.1016\/0020-0190(86)90038-4_BIB4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(80)90062-9","article-title":"A note on Delauney and optimal triangulations","volume":"10","author":"Kirkpatrick","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(86)90038-4_BIB5","series-title":"Proc. 18th Annual 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(86)90038-4_BIB6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(79)90104-2","article-title":"Neither the Greedy nor the Delauney 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(86)90038-4_BIB7","series-title":"Proc. 16th Ann. Symp. on the Foundations of Computer Science","article-title":"Closest point problems","author":"Shamos","year":"1975"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900384?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900384?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:28:43Z","timestamp":1553592523000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["0020019086900384"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90038-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}