Drawing planar graphs using the canonical ordering

AbstractWe introduce a new method to optimize the required area, minimum angle, and number of bends of planar graph drawings on a grid. The main tool is a new type of ordering on the vertices and faces of triconnected planar graphs. Using this method linear-time-and-space algorithms can be designed for many graph-drawing problems. Our main results are as follows:Every triconnected planar graphG admits a planar convex grid drawing with straight lines on a (2n−4)×(n−2) grid, wheren is the number of vertices.Every triconnected planar graph with maximum degree 4 admits a planar orthogonal grid drawing on ann×n grid with at most [3n/2]+4 bends, and ifn>6, then every edge has at most two bends.Every planar graph with maximum degree 3 admits a planar orthogonal grid drawing with at most [n/2]+1 bends on an [n/2]×[n/2] grid.Every triconnected planar graphG admits a planar polyline grid drawing on a (2n−6)×(3n−9) grid with minimum angle larger than 2/d radians and at most 5n−15 bends, withd the maximum degree. These results give in some cases considerable improvements over previous results, and give new bounds in other cases. Several other results, e.g., concerning visibility representations, are included.

[1]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[2]  Sartaj Sahni,et al.  A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.

[3]  Giuseppe Di Battista,et al.  Angles of planar triangular graphs , 1993, STOC '93.

[4]  Rossella Petreschi,et al.  Theoretical results on at most 1-bend embeddability of graphs , 1992 .

[5]  G. Kant.  Algorithms for drawing planar graphs , 1993 .

[6]  M. Chrobak,et al.  Convex Grid Drawings of 3-Connected Planar Graphs , 1997, Int. J. Comput. Geom. Appl..

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

[8]  K. Wagner.  Bemerkungen zum Vierfarbenproblem. , 1936 .

[9]  Roberto Tamassia,et al.  Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract) , 1994, ESA.

[10]  Achilleas Papakostas,et al.  On the Angular Resolution of Planar Graphs , 1994, SIAM J. Discret. Math..

[11]  Ioannis G. Tollis,et al.  Lower Bounds for Planar Orthogonal Drawings of Graphs , 1991, Inf. Process. Lett..

[12]  Jyrki Nummenmaa.  Constructing Compact Rectilinear Planar Layouts Using Canonical Representation of Planar Graphs , 1992, Theor. Comput. Sci..

[13]  W. T. Tutte.  How to Draw a Graph , 1963 .

[14]  Gerhard J. Woeginger,et al.  Drawing graphs in the plane with high resolution , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[15]  Goos Kant.  Hexagonal Grid Drawings , 1992, WG.

[16]  Xin He,et al.  Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs , 1993, ISAAC.

[17]  W. T. Tutte.  Convex Representations of Graphs , 1960 .

[18]  Goos Kant,et al.  Two Algorithms for Finding Rectangular Duals of Planar Graphs , 1993, WG.

[19]  Rossella Petreschi,et al.  At most single-bend embeddings of cubic graphs , 1994 .

[20]  F. Leighton,et al.  Drawing graphs in the plane with high resolution , 1993 .

[21]  Norishige Chiba,et al.  Drawing plane graphs nicely , 1985, Acta Informatica.

[22]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[23]  Ioannis G. Tollis,et al.  A framework for dynamic graph drawing , 1992, SCG '92.

[24]  Goos Kant,et al.  A More Compact Visibility Representation , 1997, Int. J. Comput. Geom. Appl..

[25]  Roberto Tamassia,et al.  On the Compuational Complexity of Upward and Rectilinear Planarity Testing , 1994, Graph Drawing.

[26]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[27]  Ioannis G. Tollis,et al.  Algorithms for automatic graph drawing: an annotated bibliography , 1994 .

[28]  Norishige Chiba,et al.  A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[29]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[30]  Ioannis G. Tollis,et al.  Area requirement and symmetry display in drawing graphs , 1989, SCG '89.

[31]  Goos Kant,et al.  A Better Heuristic for Orthogonal Graph Drawings , 1994, ESA.

[32]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

[33]  Ioannis G. Tollis,et al.  Area requirement and symmetry display of planar upward drawings , 1992, Discret. Comput. Geom..

[34]  James A. Storer,et al.  On minimal-node-cost planar embeddings , 1984, Networks.

[35]  Xin He,et al.  On Finding the Rectangular Duals of Planar Triangular Graphs , 1993, SIAM J. Comput..

[36]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[37]  Steven Skiena,et al.  Complexity aspects of visibility graphs , 1995, Int. J. Comput. Geom. Appl..

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

[39]  Robert E. Tarjan,et al.  Computing an st -Numbering , 1976, Theor. Comput. Sci..

[40]  Roberto Tamassia,et al.  Incremental planarity testing , 1989, 30th Annual Symposium on Foundations of Computer Science.

[41]  Ioannis G. Tollis,et al.  Planar grid embedding in linear time , 1989 .

[42]  M.N.S. Swamy,et al.  Planar embedding: linear-time algorithms for vertex placement and edge orderings , 1988 .

[43]  Carsten Thomassen,et al.  Planarity and duality of finite and infinite graphs , 1980, J. Comb. Theory B.

[44]  Giuseppe Liotta,et al.  Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract) , 1993, WADS.

[45]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[46]  Goos Kant.  A More Compact Visibility Representation , 1993, WG.

[47]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..