Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time

Walter Didimo, Michael Kaufmann, Giuseppe Liotta +1

A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point o…