{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T19:00:50Z","timestamp":1763665250601,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Agence nationale de la recherche","award":["ANR-17-CE40-0017"],"award-info":[{"award-number":["ANR-17-CE40-0017"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s00454-023-00499-9","type":"journal-article","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T14:01:56Z","timestamp":1694095316000},"page":"495-549","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved Routing on the Delaunay Triangulation"],"prefix":"10.1007","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7012-6851","authenticated-orcid":false,"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[]},{"given":"Jean-Lou","family":"De Carufel","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Despr\u00e9","sequence":"additional","affiliation":[]},{"given":"Darryl","family":"Hill","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"499_CR1","doi-asserted-by":"crossref","unstructured":"Bonichon, N., Bose, P., De Carufel, J.-L., Perkovi\u0107, L., van Renssen, A.: Upper and lower bounds for online routing on Delaunay triangulations. In: 23rd Annual European Symposium on Algorithms (Patras 2015). Lecture Notes in Comput. Sci., vol. 9294, pp. 203\u2013214. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-48350-3_18"},{"issue":"2","key":"499_CR2","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/s00454-016-9842-y","volume":"58","author":"N Bonichon","year":"2017","unstructured":"Bonichon, N., Bose, P., De Carufel, J.-L., Perkovi\u0107, L., van Renssen, A.: Upper and lower bounds for online routing on Delaunay triangulations. Discrete Comput. Geom. 58(2), 482\u2013504 (2017)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"499_CR3","doi-asserted-by":"publisher","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., Perkovi\u0107, L.: Tight stretch factors for $$L_1$$- and $$L_\\infty $$-Delaunay triangulations. Comput. Geom. 48(3), 237\u2013250 (2015)","journal-title":"Comput. Geom."},{"key":"499_CR4","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 (Copenhagen 2014). Lecture Notes in Comput. Sci., vol. 8503, pp. 98\u2013109. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-08404-6_9"},{"issue":"2","key":"499_CR5","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 $$\\pi \/2$$. Comput. Geom. 44(2), 121\u2013127 (2011)","journal-title":"Comput. Geom."},{"key":"499_CR6","doi-asserted-by":"crossref","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing in the half-$$\\theta _6$$-graph. In: 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (Kyoto 2012), pp. 1319\u20131328. ACM, New York (2012)","DOI":"10.1137\/1.9781611973099.104"},{"key":"499_CR7","doi-asserted-by":"crossref","unstructured":"Bose, P., Morin, P.: Online routing in triangulations. In: 10th International Symposium on Algorithms and Computation (Chennai 1999). Lecture Notes in Comput. Sci., vol. 1741, pp. 113\u2013122. Springer, Berlin (1999)","DOI":"10.1007\/3-540-46632-0_12"},{"key":"499_CR8","doi-asserted-by":"crossref","unstructured":"Chew, L.P.: There is a planar graph almost as good as the complete graph. In: 2nd Annual Symposium on Computational Geometry (Yorktown Heights 1986), pp. 169\u2013177. ACM, New York (1986)","DOI":"10.1145\/10515.10534"},{"issue":"2","key":"499_CR9","doi-asserted-by":"publisher","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":"499_CR10","unstructured":"Dennis, M., Perkovi\u0107, L., T\u00fcrkoglu, D.: The stretch factor of hexagon-Delaunay triangulations. J. Comput. Geom. 12(2), 86\u2013125 (2021)"},{"issue":"4","key":"499_CR11","doi-asserted-by":"publisher","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."},{"issue":"1","key":"499_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"JM Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom. 7(1), 13\u201328 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"499_CR13","doi-asserted-by":"publisher","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":"499_CR14","doi-asserted-by":"crossref","unstructured":"Xia, G.: Improved upper bound on the stretch factor of Delaunay triangulations. In: 27th Annual Symposium on Computational Geometry (Paris 2011), pp. 264\u2013273. ACM, New York (2011)","DOI":"10.1145\/1998196.1998235"},{"key":"499_CR15","doi-asserted-by":"crossref","unstructured":"Xia, G., Zhang, L.: Toward the tight bound of the stretch factor of Delaunay triangulations. In: 23d Canadian Conference on Computational Geometry (Toronto 2011). https:\/\/cccg.ca\/proceedings\/2011\/papers\/paper57.pdf","DOI":"10.1145\/1998196.1998235"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00499-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00499-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00499-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T17:41:55Z","timestamp":1730050915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00499-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,7]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["499"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00499-9","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2023,9,7]]},"assertion":[{"value":"22 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}