{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:38:39Z","timestamp":1770064719658,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540739487","type":"print"},{"value":"9783540739517","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73951-7_29","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"325-336","source":"Crossref","is-referenced-by-count":4,"title":["On Generalized Diamond Spanners"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Bose, P., Keil, M.: On the stretch factor of the constrained delaunay triangulation. In: Proc. of Voronoi Diagrams in Sci. and Eng., pp. 25\u201331 (2006)","DOI":"10.1109\/ISVD.2006.28"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Chew, L.P.: There is a planar graph almost as good as the complete graph. In: Proc. 2nd Annu. ACM Symp. Comp. Geom., pp. 169\u2013177 (1986)","DOI":"10.1145\/10515.10534"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-51859-2_15","volume-title":"Optimal Algorithms","author":"G. Das","year":"1989","unstructured":"Das, G., Joseph, D.: Which triangulations approximate the complete graph. In: Djidjev, H.N. (ed.) Optimal Algorithms. LNCS, vol.\u00a0401, pp. 168\u2013192. Springer, Heidelberg (1989)"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Dickerson, M.T., Drysdale, R.L.S., McElfresh, S.A., Welzl, E.: Fast greedy triangulation algorithms. In: Proc. ACM Symp. Comp. Geom., pp. 211\u2013220 (1994)","DOI":"10.1145\/177424.177649"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. In: Proc. IEEE Symp. Found. CS, pp. 20\u201326 (1987)","DOI":"10.1109\/SFCS.1987.18"},{"key":"29_CR6","unstructured":"Drysdale, R.L., Rote, G., Aichholzer, O.: A simple linear time greedy triangulation algorithm for uniformly distributed points. Rep IIG-408, U. Graz (1995)"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/B978-044482537-7\/50010-3","volume-title":"Handbook of Comp. Geom.","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Handbook of Comp. Geom., pp. 425\u2013461. Elsevier, Amsterdam (2000)"},{"key":"29_CR8","unstructured":"Karavelas, M.I.: Proximity Structures for Moving Objects in Constrained and Unconstrained Environments. Ph.D. thesis, Stanford University (2001)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J.M. Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Disc. Comp. Geom.\u00a07, 13\u201328 (1992)","journal-title":"Disc. Comp. Geom."},{"key":"29_CR10","volume-title":"Handbook of approximation algorithms and metaheuristics","author":"C. Knauer","year":"2007","unstructured":"Knauer, C., Gudmundsson, J.: Dilation and detour in geometric networks. In: Handbook of approximation algorithms and metaheuristics, CRC Press, Boca Raton (2007)"},{"key":"29_CR11","unstructured":"Lee, D.T.: Proximity and reachability in the plane. Report R-831, Dept. Elect. Engrg., Univ. Illinois, Urbana, IL (1978)"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0020-0190(79)90104-2","volume":"9","author":"G.K. Manacher","year":"1979","unstructured":"Manacher, G.K., Zobrist, A.L.: Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation. Inform. Process. Lett.\u00a09, 31\u201334 (1979)","journal-title":"Inform. Process. Lett."},{"key":"29_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G. Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/B978-044482537-7\/50021-8","volume-title":"Handbook of Comp. Geom.","author":"M. Smid","year":"2000","unstructured":"Smid, M.: Closest-point problems in computational geometry. In: Handbook of Comp. Geom., pp. 877\u2013935. Elsevier, Amsterdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T13:35:22Z","timestamp":1737380122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739487","9783540739517"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}