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.
Research supported in part by NIST, Advanced Technology Program grant number 70NANB5H11.
Preview
Unable to display preview. Download preview PDF.
References
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.
T. Biedl, Orthogonal Graph Visualization: The Three-Phase Method With Applications, Ph.D. Thesis, RUTCOR, Rutgers University, May 1997.
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.
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.
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.
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.
S. Even and R.E. Tarjan, Computing an st-numbering, Theor. Comp. Sci. 2 (1976), pp. 339–344.
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.
Goos Kant, Drawing Planar Graphs Using the Canonical Ordering, Algorithmica, vol. 16, no. 1, 1996, pp. 4–32.
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.
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.
A. Papakostas, Information Visualization: Orthogonal Drawings of Graphs, Ph.D. Thesis, Comp. Science Dept., The University of Texas at Dallas, November 1996.
A. Papakostas and I. G. Tollis, Algorithms for Area-Efficient Orthogonal Drawings, Technical Report UTDCS-06-95, The University of Texas at Dallas, 1995.
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.
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.
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.
M. Schäffter, Drawing Graphs on Rectangular Grids, Discr. Appl. Math. 63 (1995), pp. 75–89.
J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181–212.
R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Computing 16 (1987), pp. 421–444.
R. Tamassia and I. Tollis, Planar Grid Embeddings in Linear Time, IEEE Trans. on Circuits and Systems CAS-36 (1989), pp. 1230–1234.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Papakostas, A., Tollis, I.G. (1997). Orthogonal drawing of high degree graphs with small area and few bends. In: Dehne, F., Rau-Chaplin, A., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1997. Lecture Notes in Computer Science, vol 1272. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63307-3_74
Download citation
DOI: https://doi.org/10.1007/3-540-63307-3_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63307-5
Online ISBN: 978-3-540-69422-9
eBook Packages: Springer Book Archive