Log In Sign Up

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

by   Walter Didimo, et al.

A plane graph is rectilinear planar if it admits an embedding-preserving straight-line drawing where each edge is either horizontal or vertical. We prove that rectilinear planarity testing can be solved in optimal O(n) time for any plane series-parallel graph G with n vertices. If G is rectilinear planar, an embedding-preserving rectilinear planar drawing of G can be constructed in O(n) time. Our result is based on a characterization of rectilinear planar series-parallel graphs in terms of intervals of orthogonal spirality that their components can have, and it leads to an algorithm that can be easily implemented.


page 1

page 2

page 3

page 4


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 ...

Rectilinear Planarity of Partial 2-Trees

A graph is rectilinear planar if it admits a planar orthogonal drawing w...

Optimal Morphs of Planar Orthogonal Drawings II

Van Goethem and Verbeek recently showed how to morph between two planar ...

Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs

We study the long-standing open problem of efficiently testing rectiline...

On the location of chromatic zeros of series-parallel graphs

In this paper we consider the zeros of the chromatic polynomial of serie...

2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees

Given a bipartite graph G=(V_b,V_r,E), the 2-Level Quasi-Planarity probl...

An Experimental Study of a 1-planarity Testing and Embedding Algorithm

The definition of 1-planar graphs naturally extends graph planarity, nam...