DeepAI
Log In Sign Up

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

08/09/2020
by   Walter Didimo, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/16/2022

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 ...
08/26/2022

Rectilinear Planarity of Partial 2-Trees

A graph is rectilinear planar if it admits a planar orthogonal drawing w...
08/22/2019

Optimal Morphs of Planar Orthogonal Drawings II

Van Goethem and Verbeek recently showed how to morph between two planar ...
10/01/2021

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

We study the long-standing open problem of efficiently testing rectiline...
04/21/2022

On the location of chromatic zeros of series-parallel graphs

In this paper we consider the zeros of the chromatic polynomial of serie...
11/04/2020

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...
11/01/2019

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

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