# A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs

Left and Right Turns

First Online:

## Abstract

An orthogonal drawing of a plane graph *G* is a drawing of *G* in which each edge is drawn as a sequence of alternate horizontal and vertical line segments. In this paper we give a linear-time algorithm to find an orthogonal drawing of a given 3-connected cubic plane graph with the minimum number of bends. The best known algorithm takes time *O*(*n*^{7/4}√log *n*) for any plane graph of *n* vertices.

Download
to read the full conference paper text

## References

- [B96]T. C. Biedl,
*Optimal orthogonal drawings of triconnected plane graphs*, Proc. of SWAT'96, LNCS 1097 (1996), pp. 333–344.Google Scholar - [GT94]A. Garg and R. Tamassia,
*On the computational complexity of upward and rectilinear planarity testing*, Proc. of Graph Drawing'94, LNCS 894 (1995), pp. 286–297.Google Scholar - [GT96]A. Garg and R. Tamassia,
*A new minimum cost flow algorithm with applications to graph drawing*, Proc. of Graph Drawing'96, LNCS 1190 (1997), pp. 201–226.Google Scholar - [K96]G. Kant,
*Drawing planar graphs using the canonical ordering*, Algorithmica 16 (1996), pp. 4–32.Google Scholar - [KH94]G. Kant and X. He,
*Two algorithms for finding rectangular duals of planar graphs*, Proc. of WG'93, LNCS 790 (1994), pp. 396–410.Google Scholar - [RNN96]M. S. Rahman, S. Nakano and T. Nishizeki,
*Rectangular grid drawings of plane graphs*, Proc. of COCOON'96, LNCS 1090 (1996), pp. 92–105. Also, Comp. Geom. Theo. Appl. (submitted).Google Scholar - [T87]R. Tamassia,
*On embedding a graph in the grid with the minimum number of bends*, SIAM J. Comput. 16 (1987), pp. 421–444.CrossRefGoogle Scholar - [T84]C. Thomassen,
*Plane representations of graphs*, (Eds.) J.A. Bondy and U.S.R. Murty, Progress in Graph Theory, Academic Press Canada, (1984), pp. 43–69.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1997