Quasi-upward Planar Drawings with Minimum Curve Complexity

08/24/2021
by   Carla Binucci, et al.
0

This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of bends per edge is minimized. We prove that every bimodal plane digraph admits a quasi-upward planar drawing with curve complexity two, which is worst-case optimal. We also show that the problem of minimizing the curve complexity in a quasi-upward planar drawing can be modeled as a min-cost flow problem on a unit-capacity planar flow network. This gives rise to an Õ(m^4/3)-time algorithm that computes a quasi-upward planar drawing with minimum curve complexity; in addition, the drawing has the minimum number of bends when no edge can be bent more than twice. For a contrast, we show bimodal planar digraphs whose bend-minimum quasi-upward planar drawings require linear curve complexity even in the variable embedding setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2018

Efficient Algorithms for Bend-minimum Orthogonal Drawings of Planar 3-Graphs

Let G be a planar 3-graph (i.e., a planar graph with vertex degree at mo...
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
03/27/2018

Universal Slope Sets for Upward Planar Drawings

We prove that every set S of Δ slopes containing the horizontal slope i...
research
08/30/2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

While orthogonal drawings have a long history, smooth orthogonal drawing...
research
09/21/2018

Polyline Drawings with Topological Constraints

Let G be a simple topological graph and let Γ be a polyline drawing of G...
research
08/29/2022

Planar Confluent Orthogonal Drawings of 4-Modal Digraphs

In a planar confluent orthogonal drawing (PCOD) of a directed graph (dig...
research
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...

Please sign up or login with your details

Forgot password? Click here to reset