# New lower bounds for orthogonal graph drawings

Conference paper

First Online:

## Abstract

An orthogonal drawing is an embedding of a graph such that edges are drawn as sequences of horizontal and vertical segments. In this paper we explore lower bounds. We find lower bounds on the number of bends when crossings are allowed, and lower bounds on both the grid-size and the number of bends for planar and plane drawings.

Download
to read the full conference paper text

### References

- 1.T. Biedl, Embedding Nonplanar Graphs in the Rectangular Grid,
*Rutcor Research Report*27-93, 1993. Available via anonymous ftp from*rutcor.rutgers.edu*, file*/pub/rrr/reports93/27.ps.gz.*Google Scholar - 2.T. Biedl, G. Kant, A better heuristic for orthogonal graph drawings,
*Proc. of the 2nd European Symp. on Algorithms (ESA 94), Lecture Notes in Comp. Science*855, Springer-Verlag (1994), pp. 124–135.Google Scholar - 3.T. Biedl, New Lower Bounds for Orthogonal Graph Drawings,
*Rutcor Research Report*19-95, 1995. Available via anonymous ftp from*rutcor.rutgers.edu*, file*/pub/rrr/reports95/19.ps.gz.*Google Scholar - 4.T. Biedl, Orthogonal Graph Drawings: Algorithms and Lower Bounds, Diploma thesis TU Berlin (to appear).Google Scholar
- 5.M. Formann, F. Wagner, The VLSI layout problem in various embedding models,
*Graph-Theoretic Concepts in Comp. Science (16th Workshop WG'90)*, Springer-Verlag, Berlin/Heidelberg, 1992, pp. 130–139.Google Scholar - 6.A. Garg, R. Tamassia, On the computational complexity of upward and rectilinear planarity testing,
*Proc. Graph Drawing '94, Lecture Notes in Comp. Science*894, Springer Verlag (1994), pp. 286–297.Google Scholar - 7.G. Kant, Drawing planar graphs using the
*lmc*-ordering,*Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science*1992, pp. 101–110, extended and revised version to appear in*Algorithmica, special issue on Graph Drawing*.Google Scholar - 8.M.R. Kramer, J. van Leeuwen, The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits.
*Advances in Computer Research, Vol. 2: VLSI Theory*, JAI Press, Reading, MA, 1992, pp. 129–146.Google Scholar - 9.F.T. Leighton, New lower bounds techniques for VLSI,
*Proc. 22nd Ann. IEEE Symp. on Found. of Comp. Science*1981, pp. 1–12.Google Scholar - 10.P. Rosenstiehl, R.E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs,
*Discr. and Comp. Geometry*1 (1986), pp. 343–353.CrossRefGoogle Scholar - 11.J.A. Storer, On minimal node-cost planar embeddings,
*Networks*14 (1984), pp. 181–212.Google Scholar - 12.R. Tamassia, I.G. Tollis, A Unified Approach to Visibility Representations of Planar Graphs,
*Disc. Comp. Geom.*1 (1986), pp. 321–341.CrossRefGoogle Scholar - 13.R. Tamassia, I.G. Tollis, Efficient embedding of planar graphs in linear time,
*Proc. IEEE Int. Symp. on Circuits and Systems*(1987), pp. 495–498.Google Scholar - 14.R. Tamassia, I.G. Tollis, Planar grid embedding in linear time,
*IEEE Trans. Circ. Syst.*36 (9), 1989, pp. 1230–1234.CrossRefGoogle Scholar - 15.R. Tamassia, I.G. Tollis, J.S. Vitter, Lower bounds for planar orthogonal drawings of graphs,
*Inf. Proc. Letters*39 (1991), pp. 35–40.CrossRefGoogle Scholar - 16.L.G. Valiant, Universality considerations in VLSI circuits,
*IEEE Trans. on Comp.*C-30 (2), 1981, pp. 135–140.Google Scholar

## Copyright information

© Springer-Verlag 1996