Skip to main content
SpringerLink
Log in
Book cover

Algorithms - ESA 2015 pp 203–214Cite as

Upper and Lower Bounds for Online Routing on Delaunay Triangulations

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9294))

Abstract

Consider a weighted graph G whose vertices are points in the plane and edges are line segments between pairs of points whose weight is the Euclidean distance between its endpoints. A routing algorithm on G sends a message from any vertex s to any vertex t in G. The algorithm has a competitive ratio of c if the length of the path taken by the message is at most c times the length of the shortest path from s to t in G. It has a routing ratio of c if the length of the path is at most c times the Euclidean distance from s to t. The algorithm is online if it makes forwarding decisions based on (1) the k-neighborhood in G of the message’s current position (for constant k > 0) 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, improving the best known routing ratio of 15.48. Our algorithm 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.

We present a lower bound of 5.7282 on the routing ratio of our algorithm, 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.23) for the Delaunay triangulation and 2.70 (resp. 1.23) 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]| using only local information.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bonichon, N., Gavoille, C., Hanusse, N., Perković, L.: The stretch factor of l 1- and l  ∞ -delaunay triangulations. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 205–216. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comp. 33(4), 937–951 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bose, P., Smid, M.: On plane geometric spanners: A survey and open problems. Comput. Geom. 46(7), 818–830 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bose, P., De Carufel, J.L., Durocher, S., Taslakian, P.: Competitive online routing on Delaunay triangulations. In: SWAT, pp. 98–109 (2014)

    Google Scholar 

  5. Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing in the half-θ 6-graph. In: SODA, pp. 1319–1328 (2012)

    Google Scholar 

  6. Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing on a bounded-degree plane spanner. In: CCCG, pp. 299–304 (2012)

    Google Scholar 

  7. Braunl, T.: Embedded Robotics: Mobile Robot Design and Applications with Embedded Systems. Springer (2006)

    Google Scholar 

  8. Broutin, N., Devillers, O., Hemsley, R.: Efficiently navigating a random Delaunay triangulation. In: AofA, pp. 49–60 (2014)

    Google Scholar 

  9. Chew, L.P.: There is a planar graph almost as good as the complete graph. In: SoCG, pp. 169–177 (1986)

    Google Scholar 

  10. Chew, L.P.: There are planar graphs almost as good as the complete graph. J. Comp. System Sci. 39(2), 205–219 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  11. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  12. 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). doi:10.1007/BF02187801

    Google Scholar 

  13. Hofmann-Wellenhof, B., Legat, K., Wieser, M.: Navigation: Principles of Positioning and Guidance. Springer (2003)

    Google Scholar 

  14. Murgante, B., Borruso, G., Lapucci, A.: Geocomputation and Urban Planning. In: Murgante, B., Borruso, G., Lapucci, A. (eds.) Geocomputation and Urban Planning. SCI, vol. 176, pp. 1–17. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Narasimhan, G., Smid, M.H.M.: Geometric spanner networks. Cambridge University Press (2007)

    Google Scholar 

  16. Stojmenovic, I.: Handbook of Wireless Networks and Mobile Computing. Wiley-Interscience (2002)

    Google Scholar 

  17. Worboys, M.F., Duckham, M.: GIS: A Computing Perspective, 2nd edn. CRC Press (2004)

    Google Scholar 

  18. Xia, G.: The stretch factor of the Delaunay triangulation is less than 1. 998. SIAM J. Comput. 42(4), 1620–1659 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  19. Xia, G., Zhang, L.: Toward the tight bound of the stretch factor of Delaunay triangulations. In: CCCG, pp. 175–180 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Univ. Bordeaux, LaBRI, UMR 5800, F-33400, Talence, France

    Nicolas Bonichon

  2. CNRS, LaBRI, UMR 5800, F-33400, Talence, France

    Nicolas Bonichon

  3. School of Computer Science, Carleton University, Ottawa, Canada

    Prosenjit Bose & Jean-Lou De Carufel

  4. School of Computing, DePaul University, Chicago, USA

    Ljubomir Perković

  5. National Institute of Informatics, Tokyo, Japan

    André van Renssen

  6. JST, ERATO, Kawarabayashi Large Graph Project, Tokyo, Japan

    André van Renssen

Authors
  1. Nicolas Bonichon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prosenjit Bose
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean-Lou De Carufel
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ljubomir Perković
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. André van Renssen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Technology, Eindhoven, The Netherlands

    Nikhil Bansal

  2. Sapienza University of Rome, Rome, Italy

    Irene Finocchi

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonichon, N., Bose, P., De Carufel, JL., Perković, L., van Renssen, A. (2015). Upper and Lower Bounds for Online Routing on Delaunay Triangulations. In: Bansal, N., Finocchi, I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science(), vol 9294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48350-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48350-3_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48349-7

  • Online ISBN: 978-3-662-48350-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation