Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends

Most of the work that appears in the orthogonal graph drawing literature deals with graphs whose maximum degree is four. In this paper we present an algorithm for orthogonal drawings of simple graphs with degree higher than four. Vertices are represented by rectangular boxes of perimeter less than twice the degree of the vertex. Our algorithm is based on creating groups/pairs of vertices of the graph both ahead of time and in real drawing time. The orthogonal drawings produced by our algorithm have area at most (m−1) × \(\left( {\frac{m}{2} + 2} \right)\). Two important properties of our algorithm are that the drawings exhibit small total number of bends (less than m), and that there is at most one bend per edge.

[1]  Ioannis G. Tollis,et al.  A Pairing Technique for Area-Efficient Orthogonal Drawings , 1996, Graph Drawing.

[2]  O. Ore.  Theory of Graphs , 1962 .

[3]  Michael Kaufmann,et al.  Drawing High Degree Graphs with Low Bend Numbers , 1995, GD.

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

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

[6]  Giuseppe Liotta,et al.  An experimental comparison of three graph drawing algorithms (extended abstract) , 1995, SCG '95.

[7]  Ioannis G. TollisDept.  Algorithms for Area-eecient Orthogonal Drawings , 1996 .

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

[9]  Robert E. Tarjan,et al.  Rectilinear Planar Layouts and Bipolar Orientations of , 1986 .

[10]  Therese C. Biedl.  Orthogonal graph visualization: the three-phase method with applications , 1998 .

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

[12]  János Pach,et al.  Graphs drawn with few crossings per edge , 1996, GD.

[13]  Ioannis G. Tollis,et al.  Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing , 1996, GD.

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

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

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

[17]  Ioannis G. Tollis,et al.  Information visualization: orthogonal drawings of graphs , 1996 .

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

[19]  Carlo Batini,et al.  A layout algorithm for data flow diagrams , 1986, IEEE Transactions on Software Engineering.

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

[21]  Shimon Even,et al.  Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection , 1994, GD.

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

[23]  F. Leighton,et al.  Drawing Planar Graphs Using the Canonical Ordering , 1996 .

[24]  Ioannis G. Tollis,et al.  Algorithms for area-efficient orthogonal drawings , 1998, Comput. Geom..