A plane graph is a planar graph with a fixed embedding. 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. In this paper we consider a class of planar graphs, called subdividions of planar triconnected cubic graphs, and give a linear-time algorithm to examine whether such a planar graph G has a no-bend orthogonal drawing and to find one if G has.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs
Md. Saidur Rahman
- Springer Berlin Heidelberg
ec4u, Neuer Inhalt/© ITandMEDIA