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

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 of the plane and each edge of G to a sequence of horizontal and vertical segments between its end-points. A longstanding open question in Graph Drawing, dating back over 30 years, is whether there exists a linear-time algorithm to compute an orthogonal drawing of a plane 4-graph with the minimum number of bends. The term "plane" indicates that the input graph comes together with a planar embedding, which must be preserved by the drawing (i.e., the drawing must have the same set of faces as the input graph). In this paper, we positively answer the question above for the widely-studied class of series-parallel graphs. Our linear-time algorithm is based on a characterization of the planar series-parallel graphs that admit an orthogonal drawing without bends. This characterization is given in terms of the orthogonal spirality that each type of triconnected component of the graph can take; the orthogonal spirality of a component measures how much that component is "rolled-up" in an orthogonal drawing of the graph.

• 24 publications
• 34 publications
• 39 publications
• 13 publications
research
10/25/2019

### Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time

A planar orthogonal drawing Γ of a planar graph G is a geometric represe...
research
08/09/2020

### Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time

A plane graph is rectilinear planar if it admits an embedding-preserving...
research
04/14/2019

### Drawing HV-Restricted Planar Graphs

A strict orthogonal drawing of a graph G=(V, E) in R^2 is a drawing of G...
research
08/20/2020

### On Turn-Regular Orthogonal Representations

An interesting class of orthogonal representations consists of the so-ca...
research
06/25/2020

### A linear time algorithm for constructing orthogonal floor plans with minimum number of bends

Let G = (V, E) be a planar triangulated graph (PTG) having every face tr...
research
08/17/2015

### Knuthian Drawings of Series-Parallel Flowcharts

Inspired by a classic paper by Knuth, we revisit the problem of drawing ...
research
01/25/2018

### Rollercoasters and Caterpillars

A rollercoaster is a sequence of real numbers for which every maximal co...