Orthogonal Drawings of Plane Graphs without Bends
In an orthogonal drawing of a plane graph G each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A point at which the drawing of an edge changes its direction is called a bend. Every plane graph of the maximum degree at most four has an orthogonal drawing, but may need bends. A simple necessary and sufficient condition has not been known for a plane graph to have an orthogonal drawing without bends. In this paper we obtain a necessary and sufficient condition for a plane graph G of the maximum degree three to have an orthogonal drawing without bends. We also give a linear-time algorithm to find such a drawing of G if it exists.
KeywordsGraph Algorithm Graph Drawing Orthogonal Drawing Bend
- [GT95]A. Garg and R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, Proc. of Graph Drawing’94, Lect. Notes in Computer Science, 894, pp. 99–110, 1995.Google Scholar
- [GT97]A. Garg and R. Tamassia, A new minimum cost flow algorithm with applications to graph drawing, Proc. of Graph Drawing’96, Lect. Notes in Computer Science, 1190, pp. 201–206, 1997.Google Scholar
- [L90]T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, Chichester, 1990.Google Scholar
- [RNN00b]M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular drawings of plane graphs without designated corners, Proc. of COCOON’2000, Lect. Notes in Computer Science, 1858, pp. 85–94, 2000, also Comp. Geom. Theo. Appl., to appear.Google Scholar
- [T84]C. Thomassen, Plane representations of graphs, (Eds.) J.A. Bondy and U.S.R. Murty, Progress in Graph Theory, Academic Press Canada, pp. 43–69, 1984.Google Scholar