A Lower Bound on the Area Requirements of Series-Parallel Graphs

We show that there exist series-parallel graphs requiring *** (n logn ) area in any straight-line or poly-line grid drawing. Such a result is achieved by proving that, in any straight-line or poly-line drawing of K 2,n , one side of the bounding box has length *** (n ).

[1]  Michael T. Goodrich,et al.  Planar upward tree drawings with optimal area , 1996, Int. J. Comput. Geom. Appl..

[2]  Fabrizio Frati.  Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area , 2007, CCCG.

[3]  Emilio Di Giacomo,et al.  Drawing Series-Parallel Graphs on Restricted Integer 3D Grids , 2003, GD.

[4]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[5]  Therese C. Biedl.  Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs , 2009, Graph Drawing.

[6]  Emilio Di Giacomo,et al.  Book Embeddability of Series–Parallel Digraphs , 2006, Algorithmica.

[7]  Therese C. Biedl,et al.  Drawing Outer-Planar Graphs in O(n log n) Area , 2002, GD.

[8]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[9]  Takao Nishizeki,et al.  Small Grid Drawings of Planar Graphs with Balanced Bipartition , 2010, WALCOM.

[10]  D. Dolev,et al.  Planar Embedding of Planar Graphs , 1983 .

[11]  Timothy M. Chan,et al.  Drawing K2, n: A lower bound , 2003, Inf. Process. Lett..

[12]  Matthew Suderman,et al.  Pathwidth And Layered Drawings Of Trees , 2004, Int. J. Comput. Geom. Appl..

[13]  Xin He.  Grid Embedding of 4-Connected Plane Graphs , 1997, Discret. Comput. Geom..

[14]  M. Stern.  Ueber eine zahlentheoretische Funktion. , 1858 .

[15]  K. Wagner.  Über eine Eigenschaft der ebenen Komplexe , 1937 .

[16]  Ashim Garg,et al.  Straight-Line Drawings of General Trees with Linear Area and Arbitrary Aspect Ratio , 2003, ICCSA.

[17]  Marek Chrobak,et al.  Minimum-width grid drawings of plane graphs , 1994, Comput. Geom..

[18]  Giuseppe Di Battista,et al.  Small Area Drawings of Outerplanar Graphs , 2007, Algorithmica.

[19]  K. Hensel.  Journal für die reine und angewandte Mathematik , 1892 .

[20]  Eugene L. Lawler,et al.  The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[21]  Therese C. Biedl,et al.  Drawing planar bipartite graphs with small area , 2005, CCCG.

[22]  Giuseppe Di Battista,et al.  A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees , 1992, Comput. Geom..

[23]  Ioannis G. Tollis,et al.  How to Draw a Series-Parallel Digraph , 1994, Int. J. Comput. Geom. Appl..

[24]  David Eppstein,et al.  Parallel Recognition of Series-Parallel Graphs , 1992, Inf. Comput..

[25]  C. Kuratowski.  Sur le problème des courbes gauches en Topologie , 1930 .

[26]  Shin-Ichi Nakano,et al.  Grid Drawings of 4-Connected Plane Graphs , 2001, Discret. Comput. Geom..

[27]  Stefan Felsner,et al.  Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions , 2001, J. Graph Algorithms Appl..