A Better Heuristic for Orthogonal Graph Drawings

An orthogonal drawing of a graph is an embedding in the plane such that all edges are drawn as sequences of horizontal and vertical segments. We present a linear time and space algorithm to draw any connected graph orthogonally on a grid of size n×n with at most 2n+2 bends. Each edge is bent at most twice.

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

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

[3]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

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

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

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

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

[8]  Goos Kant.  Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract) , 1992, FOCS 1992.

[9]  Ioannis G. Tollis,et al.  Improved Algorithms and Bounds for Orthogonal Drawings , 1994, Graph Drawing.

[10]  Leslie G. Valiant,et al.  On non-linear lower bounds in computational complexity , 1975, STOC.

[11]  Charles E. Leiserson,et al.  Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.

[12]  Frank Wagner,et al.  The VLSI layout in various embedding models , 1990, WG.

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

[14]  Goos Kant,et al.  Drawing planar graphs using the lmc-ordering , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

[16]  Paul F. Dietz,et al.  Two algorithms for maintaining order in a list , 1987, STOC.

[17]  F. Leighton.  New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

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

[20]  Markus W. Schäffter,et al.  Drawing Graphs on Rectangular Grids , 1995, Discret. Appl. Math..

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