GD 1994: Graph Drawing pp 40-51

# Improved algorithms and bounds for orthogonal drawings

• Achilleas Papakostas
• Ioannis G. Tollis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 894)

## Abstract

An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our algorithm needs area no greater than 0.8n2 and no more than 1.9n bends. Notice that our upper bound on the bends is below the lower bound for planar orthogonal drawings of planar graphs. To the best of our knowledge, this is the first algorithm for orthogonal drawings that needs area less than n2. If the maximum degree is three, then the drawing produced by our algorithm needs (n/2+1)×n/2 area and at most n/2+3 bends. These upper bounds match the upper bounds known for triconnected planar graphs of degree 3.

## References

1. 1.
Therese Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27-93, 1993.Google Scholar
2. 2.
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
3. 3.
G. DiBattista, P. Eades, R. Tamassia and I. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Dept. of Comp. Science, Brown Univ., Tech. Report, 1993. To appear in Comput. Geom. Theory Appl. Preliminary version available via anonymous ftp from ftp.cs.brown.edu, gdbiblio.tex.Z and gdbiblio.ps.Z in /pub/papers/compgeo.Google Scholar
4. 4.
G. DiBattista, G. Liotta and F. Vargiu, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs, Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 709, Springer-Verlag, 1993, pp. 151–162.Google Scholar
5. 5.
S. Even and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Tech. Report 797, Comp. Science Dept., Technion, Israel Inst. of Tech., 1994.Google Scholar
6. 6.
S. Even and R.E. Tarjan, Computing an st-numbering, Theor. Comp. Sci. 2 (1976), pp. 339–344.Google Scholar
7. 7.
A. Garg and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, Tech. Report CS-94-10, Dept. of Computer Science, Brown University, Providence, 1994, also in these proceedings.Google Scholar
8. 8.
Goos Kant, Drawing planar graphs using the lmc-ordering, Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, 1992, pp. 101–110.Google Scholar
9. 9.
F. T. Leighton, New lower bound techniques for VLSI, Proc. 22nd Ann. IEEE Symp. on Found. of Comp. Science, 1981, pp. 1–12.Google Scholar
10. 10.
Charles E. Leiserson, Area-Efficient Graph Layouts (for VLSI), Proc. 21st Ann. IEEE Symp. on Found. of Comp. Science, 1980, pp. 270–281.Google Scholar
11. 11.
Markus Schäffter, Drawing Graphs on Rectangular Grids, Discr. Appl. Math. (to appear).Google Scholar
12. 12.
J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181–212.Google Scholar
13. 13.
R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987), pp. 421–444.Google Scholar
14. 14.
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
15. 15.
R. Tamassia, I. Tollis and J. Vitter, Lower Bounds for Planar Orthogonal Drawings of Graphs, Information Processing Letters 39 (1991), pp. 35–40.Google Scholar
16. 16.
L. Valiant, Universality Considerations in VLSI Circuits, IEEE Trans. on Comp., vol. C-30, no 2, (1981), pp. 135–140.Google Scholar

## Authors and Affiliations

• Achilleas Papakostas
• 1
• Ioannis G. Tollis
• 1
1. 1.Dept. of Computer ScienceThe University of Texas at DallasRichardson