Skip to main content

Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs

  • Conference paper

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

Abstract

Geometric routing by using virtual locations is an elegant way for solving network routing problems. Greedy routing, where a message is simply forwarded to a neighbor that is closer to the destination, is a simple form of geometric routing. Papadimitriou and Ratajczak conjectured that every 3-connected plane graph has a greedy drawing in the \(\mathcal R^2\) plane [10]. Leighton and Moitra settled this conjecture positively in [9]. However, their drawings have two major drawbacks: (1) their drawings are not necessarily planar; and (2) Ω(nlogn) bits are needed to represent the coordinates of their drawings, which is too large for routing algorithms for wireless networks. Recently, He and Zhang [8] showed that every triangulated plane graph has a succinct (using O(logn) bit coordinates) greedy drawing in \(\mathcal R^2\) plane with respect to a metric function derived from Schnyder realizer. However, their method fails for 3-connected plane graphs. In this paper, we show that every 3-connected plane graph has drawing in the \(\mathcal R^2\) plane, that is succinct, planar, strictly convex, and is greedy with respect to a metric function based on parameters derived from Schnyder wood.

Keywords

  • Plane Graph
  • Euclidean Plane
  • Consecutive Vertex
  • Schnyder Wood
  • Edge Pattern

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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., Felsner, S., Mosbah, M.: Convex drawings of 3-connected planar graph. Algorithmica 47, 399–420 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Angelini, P., Di Battista, G., Frati, F.: Succinct Greedy Drawings Do Not Always Exist. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 171–182. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  3. Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawing of triangulations. Journal of Graph Algorithms and Applications 14(1), 19–51 (2010)

    MathSciNet  MATH  Google Scholar 

  4. Rote, G.: Strictly Convex Drawings of Planar Graphs. In: Proc. 16th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA 2005, pp. 728–734 (2005)

    Google Scholar 

  5. Cao, L., Strelzoff, A., Sun, J.Z.: On succinctness of geometric greedy routing in Euclidean plane. In: Proc. ISPAN, pp. 326–331 (2009)

    Google Scholar 

  6. Felsner, S.: Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes. Order 18, 19–37 (2001)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Goodrich, M.T., Strash, D.: Succinct Greedy Geometric Routing in the Euclidean Plane. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 781–791. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  8. He, X., Zhang, H.: Succinct Convex Greedy Drawing of 3-Connected Plane Graphs. In: SODA 2011 (2011)

    Google Scholar 

  9. Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. Discrete Comput. Geom. 44(3), 686–705 (2010)

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  Google Scholar 

  11. Schnyder, W.: Planar graphs and poset dimension. Order 5, 323–343 (1989)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Schnyder, W.: Embedding planar graphs on the grid. In: in Proc. 1st ACM-SIAM Symp. Discrete Algorithms, pp. 138–148 (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, JJ., He, X. (2012). Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29700-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29700-7_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29699-4

  • Online ISBN: 978-3-642-29700-7

  • eBook Packages: Computer ScienceComputer Science (R0)