Skip to main content
SpringerLink
Log in

Succinct Greedy Geometric Routing in the Euclidean Plane

  • Conference paper
Algorithms and Computation (ISAAC 2009)

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

Included in the following conference series:

Abstract

We show that greedy geometric routing schemes exist for the Euclidean metric in R 2, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(logn) bits, where n is the number of vertices in the graph.

This work was supported by NSF grants 0724806, 0713046, 0830403, and ONR grant N00014-08-1-1015.

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

Access this chapter

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 26–37. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Dhandapani, R.: Greedy drawings of triangulations. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 102–111. SIAM, Philadelphia (2008)

    Google Scholar 

  3. Eppstein, D., Goodrich, M.T.: Succinct greedy graph drawing in the hyperbolic plane. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 14–25. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Knuth, D.E.: Optimum binary search trees. Acta Informatica 1, 14–25 (1971)

    Article  MATH  Google Scholar 

  5. Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 337–346. IEEE Press, Los Alamitos (2008)

    Google Scholar 

  6. Lillis, K.M., Pemmaraju, S.V.: On the efficiency of a local iterative algorithm to compute delaunay realizations. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 69–86. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Muhammad, R.B.: A distributed geometric routing algorithm for ad hoc wireless networks. In: Proceedings of the 4th International Conference on Information Technology (ITNG 2007), pp. 961–963. IEEE Press, Los Alamitos (2007)

    Chapter  Google Scholar 

  8. Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theoretical Computer Science 344(1), 3–14 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences 26(3), 362–391 (1983)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of California, Irvine, USA

    Michael T. Goodrich & Darren Strash

Authors
  1. Michael T. Goodrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Darren Strash
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical and Computer Engineering, University of Hawaii, Holmes Hall 483, 2540 Dole Street, 96822, Honolulu, HI, USA

    Yingfei Dong

  2. Department of Computer Science, University of Texas at Dallas, 75083, Dallas, TX, USA

    Ding-Zhu Du

  3. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goodrich, M.T., Strash, D. (2009). Succinct Greedy Geometric Routing in the Euclidean Plane. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_79

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10631-6_79

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10630-9

  • Online ISBN: 978-3-642-10631-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation