WADS 1997: Algorithms and Data Structures pp 354-367

# Orthogonal drawing of high degree graphs with small area and few bends

• Achilleas Papakostas
• Ioannis G. Tollis
Session 10B: Invited Lecture
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1272)

## Abstract

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.

## References

1. 1.
C. Batini, E. Nardelli, and R. Tamassia, A Layout Algorithm for Data-Flow Diagrams, IEEE Trans. on Software Engineering SE-12(4) (1986), pp. 538–546.Google Scholar
2. 2.
T. Biedl, Orthogonal Graph Visualization: The Three-Phase Method With Applications, Ph.D. Thesis, RUTCOR, Rutgers University, May 1997.Google Scholar
3. 3.
T. Biedl and G. Kant, A Better Heuristic for Orthogonal Graph Drawings, Proc. 2nd Ann. European Symposium on Algorithms (ESA '94), Lecture Notes in Computer Science, vol. 855, pp. 24–35, Springer-Verlag, 1994.Google Scholar
4. 4.
G. Di Battista, P. Eades, R. Tamassia and I. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory and Applications, vol. 4, no 5, 1994, pp. 235–282. Also available via anonymous ftp from ftp.cs.brown.edu, gdbiblio.tex.Z and gdbiblio.ps.Z in /pub/papers/compgeo.Google Scholar
5. 5.
G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari and F. Vargiu, An Experimental Comparison of Three Graph Drawing Algorithms, Proc. of ACM Symp. on Computational Geometry, 1995, pp. 306–315. The version of the paper with the four algorithms can be obtained from http://www.cs.brown/people/rt.Google Scholar
6. 6.
S. Even and G. Granot, Grid Layouts of Block Diagrams — Bounding the Number of Bends in Each Connection, Proc. DIMACS Workshop GD '94, Lecture Notes in Comp. Sci. 894, Springer-Verlag, 1994, pp. 64–75.Google Scholar
7. 7.
S. Even and R.E. Tarjan, Computing an st-numbering, Theor. Comp. Sci. 2 (1976), pp. 339–344.Google Scholar
8. 8.
U. Foessmaier and M. Kaufmann, Drawing High Degree Graphs with Low Bend Numbers, Proc. Symposium on Graph Drawing (GD '95), Lecture Notes in Comp. Sci. 1027, Springer-Verlag, Sept. 1995, pp. 254–266.Google Scholar
9. 9.
Goos Kant, Drawing Planar Graphs Using the Canonical Ordering, Algorithmica, vol. 16, no. 1, 1996, pp. 4–32.Google Scholar
10. 10.
A. Lempel, S. Even and I. Cederbaum, An algorithm for planarity testing in graphs, Theory of Graphs, 215–232, Gordon and Breach, New York, 1967.Google Scholar
11. 11.
J. Pach and G. Toth, Graphs Drawn with Few Crossings per Edge, Proc. of Symposium on Graph Drawing (GD'96), Lecture Notes in Comp. Sci. 1190, Springer-Verlag, pp. 345–354.Google Scholar
12. 12.
A. Papakostas, Information Visualization: Orthogonal Drawings of Graphs, Ph.D. Thesis, Comp. Science Dept., The University of Texas at Dallas, November 1996.Google Scholar
13. 13.
A. Papakostas and I. G. Tollis, Algorithms for Area-Efficient Orthogonal Drawings, Technical Report UTDCS-06-95, The University of Texas at Dallas, 1995.Google Scholar
14. 14.
A. Papakostas and I. G. Tollis, Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends, Technical Report UTDCS-04-96, The University of Texas at Dallas, 1996.Google Scholar
15. 15.
A. Papakostas and I. G. Tollis, A Pairing Technique for Area-Efficient Orthogonal Drawings, Proc. of Symposium on Graph Drawing (GD'96), Lecture Notes in Comp. Sci. 1190, Springer-Verlag, pp. 355–370.Google Scholar
16. 16.
A. Papakostas, J.M. Six, and I. G. Tollis, Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing, Proc. of Symposium on Graph Drawing (GD'96), Lecture Notes in Comp. Sci. 1190, Springer-Verlag, pp. 371–386.Google Scholar
17. 17.
M. Schäffter, Drawing Graphs on Rectangular Grids, Discr. Appl. Math. 63 (1995), pp. 75–89.Google Scholar
18. 18.
J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181–212.Google Scholar
19. 19.
R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Computing 16 (1987), pp. 421–444.Google Scholar
20. 20.
R. Tamassia and I. Tollis, Planar Grid Embeddings in Linear Time, IEEE Trans. on Circuits and Systems CAS-36 (1989), pp. 1230–1234.Google Scholar