{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:15Z","timestamp":1725701655155},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_19","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:29:11Z","timestamp":1346153351000},"page":"205-216","source":"Crossref","is-referenced-by-count":6,"title":["The Stretch Factor of L 1- and L \u2009\u221e\u2009-Delaunay Triangulations"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Hanusse","sequence":"additional","affiliation":[]},{"given":"Ljubomir","family":"Perkovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1007\/978-3-540-92182-0_58","volume-title":"Algorithms and Computation","author":"P. Bose","year":"2008","unstructured":"Bose, P., Carmi, P., Collette, S., Smid, M.: On the Stretch Factor of Convex Delaunay Graphs. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 656\u2013667. Springer, Heidelberg (2008)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.comgeo.2010.09.009","volume":"44","author":"P. Bose","year":"2011","unstructured":"Bose, P., Devroye, L., L\u00f6ffler, M., Snoeyink, J., Verma, V.: Almost all Delaunay triangulations have stretch factor greater than \u03c0\/2. Comp. Geometry\u00a044, 121\u2013127 (2011)","journal-title":"Comp. Geometry"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing in the half-\u03b8\n                6-graph. In: 23rd ACM Symp. on Discrete Algorithms (SODA), pp. 1319\u20131328 (2012)","DOI":"10.1137\/1.9781611973099.104"},{"issue":"2-3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2004.05.019","volume":"324","author":"P. Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Competitive online routing in geometric graphs. Theoretical Computer Science\u00a0324(2-3), 273\u2013288 (2004)","journal-title":"Theoretical Computer Science"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Paul Chew, L.: There is a planar graph almost as good as the complete graph. In: 2nd Annual ACM Symposium on Computational Geometry (SoCG), pp. 169\u2013177 (August 1986)","DOI":"10.1145\/10515.10534"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"L. Paul Chew","year":"1989","unstructured":"Paul Chew, L.: There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences\u00a039(2), 205\u2013219 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. In: 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 20\u201326. IEEE Computer Society Press (October 1987)","DOI":"10.1109\/SFCS.1987.18"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J. Mark Keil","year":"1992","unstructured":"Mark Keil, J., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry\u00a07(1), 13\u201328 (1992)","journal-title":"Discrete & Computational Geometry"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Xia, G.: Improved upper bound on the stretch factor of delaunay triangulations. In: 27th Annual ACM Symposium on Computational Geometry (SoCG), pp. 264\u2013273 (June 2011)","DOI":"10.1145\/1998196.1998235"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Xia, G., Zhang, L.: Toward the tight bound of the stretch factor of Delaunay triangulations. In: 23rd Canadian Conference on Computational Geometry (CCCG) (August 2011)","DOI":"10.1145\/1998196.1998235"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:54:46Z","timestamp":1620114886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}