{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:48:25Z","timestamp":1725828505277},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_18","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T21:40:34Z","timestamp":1441057234000},"page":"203-214","source":"Crossref","is-referenced-by-count":4,"title":["Upper and Lower Bounds for Online Routing on Delaunay Triangulations"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Lou","family":"De Carufel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ljubomir","family":"Perkovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-3-642-33090-2_19","volume-title":"Algorithms \u2013 ESA 2012","author":"N. Bonichon","year":"2012","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovi\u0107, L.: The stretch factor of l 1- and l \u2009\u221e\u2009-delaunay triangulations. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 205\u2013216. Springer, Heidelberg (2012)"},{"issue":"4","key":"18_CR2","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1137\/S0097539700369387","volume":"33","author":"P. Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comp.\u00a033(4), 937\u2013951 (2004)","journal-title":"SIAM J. Comp."},{"issue":"7","key":"18_CR3","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1016\/j.comgeo.2013.04.002","volume":"46","author":"P. Bose","year":"2013","unstructured":"Bose, P., Smid, M.: On plane geometric spanners: A survey and open problems. Comput. Geom.\u00a046(7), 818\u2013830 (2013)","journal-title":"Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Bose, P., De Carufel, J.L., Durocher, S., Taslakian, P.: Competitive online routing on Delaunay triangulations. In: SWAT, pp. 98\u2013109 (2014)","key":"18_CR4","DOI":"10.1007\/978-3-319-08404-6_9"},{"doi-asserted-by":"crossref","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing in the half-\u03b8 6-graph. In: SODA, pp. 1319\u20131328 (2012)","key":"18_CR5","DOI":"10.1137\/1.9781611973099.104"},{"unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing on a bounded-degree plane spanner. In: CCCG, pp. 299\u2013304 (2012)","key":"18_CR6"},{"unstructured":"Braunl, T.: Embedded Robotics: Mobile Robot Design and Applications with Embedded Systems. Springer (2006)","key":"18_CR7"},{"doi-asserted-by":"crossref","unstructured":"Broutin, N., Devillers, O., Hemsley, R.: Efficiently navigating a random Delaunay triangulation. In: AofA, pp. 49\u201360 (2014)","key":"18_CR8","DOI":"10.1002\/rsa.20630"},{"doi-asserted-by":"crossref","unstructured":"Chew, L.P.: There is a planar graph almost as good as the complete graph. In: SoCG, pp. 169\u2013177 (1986)","key":"18_CR9","DOI":"10.1145\/10515.10534"},{"issue":"2","key":"18_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"L.P. Chew","year":"1989","unstructured":"Chew, L.P.: There are planar graphs almost as good as the complete graph. J. Comp. System Sci.\u00a039(2), 205\u2013219 (1989)","journal-title":"J. Comp. System Sci."},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math.\u00a01, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"doi-asserted-by":"crossref","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete & Comput. Geom.\u00a05(4), 399\u2013407 (1990). doi:10.1007\/BF02187801","key":"18_CR12","DOI":"10.1007\/BF02187801"},{"doi-asserted-by":"crossref","unstructured":"Hofmann-Wellenhof, B., Legat, K., Wieser, M.: Navigation: Principles of Positioning and Guidance. Springer (2003)","key":"18_CR13","DOI":"10.1007\/978-3-7091-6078-7"},{"key":"18_CR14","series-title":"SCI","first-page":"1","volume-title":"Geocomputation and Urban Planning","author":"B. Murgante","year":"2010","unstructured":"Murgante, B., Borruso, G., Lapucci, A.: Geocomputation and Urban Planning. In: Murgante, B., Borruso, G., Lapucci, A. (eds.) Geocomputation and Urban Planning. SCI, vol.\u00a0176, pp. 1\u201317. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Narasimhan, G., Smid, M.H.M.: Geometric spanner networks. Cambridge University Press (2007)","key":"18_CR15","DOI":"10.1017\/CBO9780511546884"},{"doi-asserted-by":"crossref","unstructured":"Stojmenovic, I.: Handbook of Wireless Networks and Mobile Computing. Wiley-Interscience (2002)","key":"18_CR16","DOI":"10.1002\/0471224561"},{"doi-asserted-by":"crossref","unstructured":"Worboys, M.F., Duckham, M.: GIS: A Computing Perspective, 2nd edn. CRC Press (2004)","key":"18_CR17","DOI":"10.4324\/9780203481554"},{"issue":"4","key":"18_CR18","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1137\/110832458","volume":"42","author":"G. Xia","year":"2013","unstructured":"Xia, G.: The stretch factor of the Delaunay triangulation is less than 1. 998. SIAM J. Comput.\u00a042(4), 1620\u20131659 (2013)","journal-title":"998. SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Xia, G., Zhang, L.: Toward the tight bound of the stretch factor of Delaunay triangulations. In: CCCG, pp. 175\u2013180 (2011)","key":"18_CR19","DOI":"10.1145\/1998196.1998235"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T21:38:16Z","timestamp":1567114696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}