{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:59:34Z","timestamp":1757311174242,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,11,22]],"date-time":"2016-11-22T00:00:00Z","timestamp":1479772800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00454-016-9842-y","type":"journal-article","created":{"date-parts":[[2016,11,22]],"date-time":"2016-11-22T12:33:15Z","timestamp":1479817995000},"page":"482-504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Upper and Lower Bounds for Online Routing on Delaunay Triangulations"],"prefix":"10.1007","volume":"58","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[]},{"given":"Jean-Lou","family":"De Carufel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6048-763X","authenticated-orcid":false,"given":"Ljubomir","family":"Perkovi\u0107","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,22]]},"reference":[{"issue":"3","key":"9842_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.comgeo.2014.10.005","volume":"48","author":"N Bonichon","year":"2015","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovic, L.: Tight stretch factors for L $$_{1}$$ 1 - and L $$_{\\infty }$$ \u221e -Delaunay triangulations. Comput. Geom. 48(3), 237\u2013250 (2015)","journal-title":"Comput. Geom."},{"issue":"4","key":"9842_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. Comput. 33(4), 937\u2013951 (2004)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"9842_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. 46(7), 818\u2013830 (2013)","journal-title":"Comput. Geom."},{"issue":"2","key":"9842_CR4","doi-asserted-by":"crossref","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 $$\\pi $$ \u03c0 \/2. Comput. Geom. 44(2), 121\u2013127 (2011)","journal-title":"Comput. Geom."},{"key":"9842_CR5","doi-asserted-by":"crossref","unstructured":"Bose, P., De Carufel, J.-L., Durocher, S., Taslakian, P.: Competitive online routing on Delaunay triangulations. In: 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT). (To appear in the Int. J. Comput. Geom. Appl.) (2014)","DOI":"10.1007\/978-3-319-08404-6_9"},{"issue":"6","key":"9842_CR6","doi-asserted-by":"crossref","first-page":"1626","DOI":"10.1137\/140988103","volume":"44","author":"P Bose","year":"2015","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. SIAM J. Comput. 44(6), 1626\u20131649 (2015)","journal-title":"SIAM J. Comput."},{"key":"9842_CR7","volume-title":"Embedded Robotics: Mobile Robot Design and Applications with Embedded Systems","author":"T Braunl","year":"2006","unstructured":"Braunl, T.: Embedded Robotics: Mobile Robot Design and Applications with Embedded Systems. Springer, Berlin (2006)"},{"key":"9842_CR8","unstructured":"Broutin, N., Devillers, O., Hemsley, R.: Efficiently navigating a random Delaunay triangulation. In: AofA 2014\u201425th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, pp. 49\u201360 (2014)"},{"key":"9842_CR9","doi-asserted-by":"crossref","unstructured":"Chew, L.P.: There is a planar graph almost as good as the complete graph. In: Proceedings of the Second Annual Symposium on Computational Geometry (SoCG), pp. 169\u2013177 (1986)","DOI":"10.1145\/10515.10534"},{"issue":"2","key":"9842_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"LP Chew","year":"1989","unstructured":"Chew, L.P.: There are planar graphs almost as good as the complete graph. J. Comput. Syst. Sci. 39(2), 205\u2013219 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"9842_CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"4","key":"9842_CR12","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"DP Dobkin","year":"1990","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom. 5(4), 399\u2013407 (1990)","journal-title":"Discrete Comput. Geom."},{"key":"9842_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7091-6078-7","volume-title":"Navigation: Principles of Positioning and Guidance","author":"B Hofmann-Wellenhof","year":"2003","unstructured":"Hofmann-Wellenhof, B., Legat, K., Wieser, M.: Navigation: Principles of Positioning and Guidance. Springer, New York (2003)"},{"key":"9842_CR14","volume-title":"Geocomputation and Urban Planning","author":"B Murgante","year":"2010","unstructured":"Murgante, B., Borruso, G., Lapucci, A.: Geocomputation and Urban Planning. Springer, Berlin (2010)"},{"key":"9842_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.H.M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"9842_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/0471224561","volume-title":"Handbook of Wireless Networks and Mobile Computing","author":"I Stojmenovic","year":"2002","unstructured":"Stojmenovic, I.: Handbook of Wireless Networks and Mobile Computing. Wiley, New York (2002)"},{"key":"9842_CR17","doi-asserted-by":"crossref","DOI":"10.4324\/9780203481554","volume-title":"GIS: A Computing Perspective","author":"MF Worboys","year":"2004","unstructured":"Worboys, M.F., Duckham, M.: GIS: A Computing Perspective, 2nd edn. CRC Press, Boca Raton (2004)","edition":"2"},{"issue":"4","key":"9842_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. 42(4), 1620\u20131659 (2013)","journal-title":"SIAM J. Comput."},{"key":"9842_CR19","doi-asserted-by":"crossref","unstructured":"Xia, G., Zhang, L.: Toward the tight bound of the stretch factor of Delaunay triangulations. In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry (CCCG) (2011)","DOI":"10.1145\/1998196.1998235"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-016-9842-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9842-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9842-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T17:29:42Z","timestamp":1568568582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-016-9842-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,22]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["9842"],"URL":"https:\/\/doi.org\/10.1007\/s00454-016-9842-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2016,11,22]]}}}