No-Bend Orthogonal Drawings of Series-Parallel Graphs

Rahman, Md. Saidur and Egi, Noritsugu and Nishizeki, Takao (2006) No-Bend Orthogonal Drawings of Series-Parallel Graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 409-420(Official URL: http://dx.doi.org/10.1007/11618058_37).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/11618058_37
Classifications: P Styles > P.600 Poly-line > P.600.700 Orthogonal
P Styles > P.720 Straight-line
URI: http://gdea.informatik.uni-koeln.de/id/eprint/707

Actions (login required)

View Item View Item