No-bend Orthogonal Drawings of Series-Parallel Graphs
In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing if at least one of its plane embeddings has a no-bend orthogonal drawing. Every series-parallel graph is planar. In this paper we give a linear-time algorithm to examine whether a series-parallel graph G of the maximum degree three has a no-bend orthogonal drawing and to find one if G has.
KeywordsPlanar Graph Algorithm Graph Drawing Orthogonal Drawing Bend SPQ tree
- [REN05]Rahman, M.S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs. IEICE Trans. Inf. & Syst. E88-D(1), 23–30 (2005)Google Scholar