Advertisement

Small Grid Drawings of Planar Graphs with Balanced Bipartition

  • Xiao Zhou
  • Takashi Hikino
  • Takao Nishizeki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5942)

Abstract

In a grid drawing of a planar graph, every vertex is located at a grid point, and every edge is drawn as a straight-line segment without any edge-intersection. It has been known that every planar graph G of n vertices has a grid drawing on an (n − 2)×(n − 2) integer grid and such a drawing can be found in linear time. In this paper we show that if a planar graph G has a balanced bipartition then G has a grid drawing with small grid area. More precisely, if a separation pair bipartitions G into two edge-disjoint subgraphs G 1 and G 2, then G has a grid drawing on a W×H grid such that both the width W and height H are smaller than the larger number of vertices in G 1 and in G 2. In particular, we show that every series-parallel graph G has a grid drawing on a (2n/3)×(2n/3) grid and such a drawing can be found in linear time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)zbMATHGoogle Scholar
  2. 2.
    Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. International Journal of Computational Geometry and Applications 7, 211–223 (1997)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Schnyder, W.: Embedding planar graphs on the grid. In: Proc. of First ACM-SIAM Symposium on Discrete Algorithms, pp. 138–148 (1990)Google Scholar
  4. 4.
    Dolev, D., Leighton, F.T., Trickey, H.: Planar embedding of planar graphs. Advances in Computing Research 2, 147–161 (1984)Google Scholar
  5. 5.
    Frati, F., Patrignami, M.: A note on minimum-area straight-line drawings of planar graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 339–344. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Miura, K., Nakano, S., Nishizeki, T.: Grid drawings of 4-connected plane graphs. Discrete & Computational Geometry 26, 73–87 (2001)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Shiloach, Y.: Arrangements of Planar Graphs on the Planar Lattice. PhD thesis, Weizmann Institute of Science (1976)Google Scholar
  8. 8.
    Battista, G.D., Frati, F.: Small area drawings of outerplanar graphs. Algorithmica 54, 25–53 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Information Processing Letters 54, 241–246 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41–51 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29, 623–641 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. Dover Publications, New York (2008)Google Scholar
  13. 13.
    Biedl, T.: On small drawings of series-parallel graphs and other subclasses of planar graphs. In: Proc. of GD 2009 (to appear)Google Scholar
  14. 14.
    Frati, F.: A lower bound on the area requirements of series-parallel graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 159–170. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  15. 15.
    Biedl, T.: Drawing outer-planar graphs in o(nlogn) area. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 54–65. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Xiao Zhou
    • 1
  • Takashi Hikino
    • 1
  • Takao Nishizeki
    • 1
  1. 1.Graduate School of Information SciencesTohoku UniversitySendaiJapan

Personalised recommendations