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.
In particular for non-planar and non-biconnected planar graphs, this is a big improvement. The algorithm is very simple, easy to implement, and it handles both planar and non-planar graphs at the same time.
Unable to display preview. Download preview PDF.
- 1.G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis Algorithms for Automatic Graph Drawing: An Annotated Bibliography, to appear in Comp. Geom.: Theory and Applications, Preliminary version also available via anonymous ftp from wilma.cs.brown.edu (188.8.131.52), files /pub/gdbiblio.tex.Z and /pub/gdbiblio.ps.Z.Google Scholar
- 2.G. Di Battista, G. Liotta, and F. Vargiu, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs, In: Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 709, Springer-Verlag, 1993, pp. 151–162.Google Scholar
- 4.P.F. Dietz, and D.D. Sleator, Two algorithms for maintaining order in a list, in: Proc. 19th Annual ACM Symp. Theory of Computing, 1987, pp. 365–372.Google Scholar
- 5.S. Even, and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Manuscript, Faculty of Comp. Science, the Technion, Haifa (Israel), 1993.Google Scholar
- 7.M. Formann, and F. Wagner, The VLSI layout problem in various embedding models, Graph-Theoretic Concepts in Computer Science (16th Workshop WG'90), Springer-Verlag, Berlin/Heidelberg, 1992, pp. 130–139.Google Scholar
- 8.A. Garg, and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, Tech. Report CS-94-10, Dept. of Comp. Science, Brown University, Providence, 1994.Google Scholar
- 10.G. Kant, Drawing planar graphs using the lmc-ordering, Extended Abstract in: Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, Pittsburgh, 1992, pp. 101–110. Extended and revised version in: G. Kant, Algorithms for Drawing Planar Graphs, PhD thesis, Dept. of Computer Science, Utrecht University, 1993.Google Scholar
- 11.M.R. Kramer, and J. van Leeuwen, The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits. In: F.P. Preparata (Ed.), Advances in Computer Research, Vol. 2: VLSI Theory, JAI Press, Reading, MA, 1992, pp. 129–146.Google Scholar
- 12.Th. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Teubner/Wiley & Sons, Stuttgart/Chichester, 1990.Google Scholar
- 13.A. Lempel, S. Even, and I. Cederbaum, An algorithm for planarity testing of graphs, Theory of Graphs, Int. Symp. Rome (1966), pp. 215–232.Google Scholar
- 15.M. Schäffter, Drawing graphs on rectangular grids, Discr. Appl. Math. (to appear).Google Scholar
- 18.R. Tamassia, and I.G. Tollis, Efficient embedding of planar graphs in linear time, Proc. IEEE Int. Symp. on Circuits and Systems, Philadelphia, pp. 495–498, 1987.Google Scholar