{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:56:22Z","timestamp":1767239782773},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_6","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:07:54Z","timestamp":1330204074000},"page":"47-56","source":"Crossref","is-referenced-by-count":39,"title":["The Delaunay triangulation closely approximates the complete Euclidean graph"],"prefix":"10.1007","author":[{"given":"J. Mark","family":"Keil","sequence":"first","affiliation":[]},{"given":"Carl A.","family":"Gutwin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Chew, P., There is a planar graph almost as good as the complete graph, Proceedings of the 2nd Symposium on Computational Geometry, Yorktown Heights NY, 1986, 169\u2013177.","DOI":"10.1145\/10515.10534"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Dobkin, D., S. Friedman and K. Supowit, Delaunay Graphs are Almost as Good as Complete Graphs, Proceedings of the 28th Annual Symposium on Foundations of Computing, Los Angeles Ca., 1987, 20\u201326.","DOI":"10.1109\/SFCS.1987.18"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Keil. J.M., Approximating the Complete Euclidean Graph, Proceedings of the First Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 1988, Springer-Verlag Lecture Notes in Computer Science No. 318, 208\u2013213.","DOI":"10.1007\/3-540-19487-8_23"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Preparata, F. and M. Shamos, Computational Geometry: an Introduction, Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"issue":"1","key":"6_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01840435","volume":"1","author":"R. Sedgewick","year":"1986","unstructured":"Sedgewick, R. and J. Vitter, Shortest paths in Euclidean graphs, Algorithmica, 1,1(1986), 31\u201348.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:58Z","timestamp":1605648118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}