New Lower Bounds for Orthogonal Graph Drawings

Biedl, Therese (1996) New Lower Bounds for Orthogonal Graph Drawings. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 28-39 (Official URL:

Full text not available from this repository.


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.

Item Type:Conference Paper
Additional Information:10.1007/BFb0021788
Classifications:M Methods > M.600 Planar
G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.210 Bends
P Styles > P.600 Poly-line > P.600.700 Orthogonal
ID Code:45

Repository Staff Only: item control page


T. Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27-93, 1993. Available via anonymous ftp from, file /pub/rrr/reports93/

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.

T. Biedl, New Lower Bounds for Orthogonal Graph Drawings, Rutcor Research Report 19-95, 1995. Available via anonymous ftp from, file /pub/rrr/reports95/

T. Biedl, Orthogonal Graph Drawings: Algorithms and Lower Bounds, Diploma thesis TU Berlin (to appear).

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.

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.

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 an Graph Drawing.

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.

F.T. Leighton, New lower bounds techniques for VLSI, Proc. 22nd Ann. IEEE Symp. on Found. of Comp. Science 1981, pp. 1-12.

P. Rosenstiehl, R.E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 343-353.

J.A. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181-212.

R. Tamassia, I.G. Tollis, A Unified Approach to Visibility Representations of Planar Graphs, Disc. Comp. Geom. 1 (1986), pp. 321- 341.

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.

R. Tamassia, I.G. Tollis, Planar grid embedding in linear time, IEEE Trans. Circ. Syst. 36 (9), 1989, pp. 1230-1234.

R. Tamassia, I.G. Tollis, J.S. Vitter, Lower bounds for planar orthogonal drawings of graphs, Inf. Proc. Letters 39 (1991), pp. 35-40.

L.G. Valiant, Universality considerations in VLSI circuits, IEEE Trans. on Comp. C-30 (2), 1981, pp. 135- 140.