Abstract
Consider a weighted graph G whose vertices are points in the plane and edges are line segments between pairs of points. The weight of each edge is the Euclidean distance between its two endpoints. A routing algorithm on G has a competitive ratio of c if the length of the path produced by the algorithm from any vertex s to any vertex t is at most c times the length of the shortest path from s to t in G. If the length of the path is at most c|[st]| (where |[st]| is the length of the line segment [st]), we say that the routing algorithm has a routing ratio of c. The routing algorithm is online if it makes forwarding decisions based on (1) the k-neighborhood in G (for some integer constant \(k>0\)) of the current position of the message and (2) limited information stored in the message header. We present an online routing algorithm on the Delaunay triangulation with routing ratio less than 5.90. This improves upon the algorithm with best known routing ratio of 15.48. The algorithm is an adaptation, to the Delaunay triangulation, of the classic routing algorithm by Chew on the \(L_1\)-Delaunay triangulation. It makes forwarding decisions based on the 1-neighborhood of the current position of the message and the positions of the message source and destination only. This last requirement is an improvement over the best known online routing algorithms on the Delaunay triangulation which require the header of a message to also contain partial sums of distances along the routing path. We show that the routing ratio of Chew’s algorithm on the Delaunay triangulation can be greater than 5.72 so the 5.90 upper bound is close to the best possible. We also show that the routing (resp., competitive) ratio of any deterministic k-local algorithm is at least 1.70 (resp., 1.33) for the Delaunay triangulation and 2.70 (resp. 1.12) for the \(L_1\)-Delaunay triangulation. In the case of the \(L_1\)-Delaunay triangulation, this implies that even though there always exists a path between s and t whose length is at most 2.61|[st]|, it is not always possible to route a message along a path of length less than 2.70|[st]|.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
This definition assumes that points are in general position; we discuss this restriction further in Sect. 2.
GeoGebra files that describe the two examples presented in this section are available at the following url: http://www.labri.fr/perso/bonichon/DelaunayRouting/
References
Bonichon, N., Gavoille, C., Hanusse, N., Perkovic, L.: Tight stretch factors for L\(_{1}\)- and L\(_{\infty }\)-Delaunay triangulations. Comput. Geom. 48(3), 237–250 (2015)
Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comput. 33(4), 937–951 (2004)
Bose, P., Smid, M.: On plane geometric spanners: a survey and open problems. Comput. Geom. 46(7), 818–830 (2013)
Bose, P., Devroye, L., Löffler, M., Snoeyink, J., Verma, V.: Almost all Delaunay triangulations have stretch factor greater than \(\pi \)/2. Comput. Geom. 44(2), 121–127 (2011)
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)
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–1649 (2015)
Braunl, T.: Embedded Robotics: Mobile Robot Design and Applications with Embedded Systems. Springer, Berlin (2006)
Broutin, N., Devillers, O., Hemsley, R.: Efficiently navigating a random Delaunay triangulation. In: AofA 2014—25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, pp. 49–60 (2014)
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–177 (1986)
Chew, L.P.: There are planar graphs almost as good as the complete graph. J. Comput. Syst. Sci. 39(2), 205–219 (1989)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom. 5(4), 399–407 (1990)
Hofmann-Wellenhof, B., Legat, K., Wieser, M.: Navigation: Principles of Positioning and Guidance. Springer, New York (2003)
Murgante, B., Borruso, G., Lapucci, A.: Geocomputation and Urban Planning. Springer, Berlin (2010)
Narasimhan, G., Smid, M.H.M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)
Stojmenovic, I.: Handbook of Wireless Networks and Mobile Computing. Wiley, New York (2002)
Worboys, M.F., Duckham, M.: GIS: A Computing Perspective, 2nd edn. CRC Press, Boca Raton (2004)
Xia, G.: The stretch factor of the Delaunay triangulation is less than 1.998. SIAM J. Comput. 42(4), 1620–1659 (2013)
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)
Acknowledgements
We thank the reviewers for their thorough reviews and comments, which improved the quality and clarity of the paper. N. Bonichon was partially supported by ANR Grant JCJC EGOS ANR-12-JS02-002-01 and LIRCO. P. Bose was partially supported by NSERC.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: Kenneth Clarkson
Rights and permissions
About this article
Cite this article
Bonichon, N., Bose, P., De Carufel, JL. et al. Upper and Lower Bounds for Online Routing on Delaunay Triangulations. Discrete Comput Geom 58, 482–504 (2017). https://doi.org/10.1007/s00454-016-9842-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-016-9842-y