Universal Slope Sets for Upward Planar Drawings

03/27/2018
by   Michael A. Bekos, et al.
0

We prove that every set S of Δ slopes containing the horizontal slope is universal for 1-bend upward planar drawings of bitonic st-graphs with maximum vertex degree Δ, i.e., every such digraph admits a 1-bend upward planar drawing whose edge segments use only slopes in S. This result is worst-case optimal in terms of the number of slopes, and, for a suitable choice of S, it gives rise to drawings with worst-case optimal angular resolution. In addition, we prove that every such set S can be used to construct 2-bend upward planar drawings of n-vertex planar st-graphs with at most 4n-9 bends in total. Our main tool is a constructive technique that runs in linear time.

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
02/28/2023

Linear Size Universal Point Sets for Classes of Planar Graphs

A finite set P of points in the plane is n-universal with respect to a c...
research
08/24/2021

Quasi-upward Planar Drawings with Minimum Curve Complexity

This paper studies the problem of computing quasi-upward planar drawings...
research
02/23/2022

The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs

The segment number of a planar graph G is the smallest number of line se...
research
02/22/2023

Approximability of the Four-Vertex Model

We study the approximability of the four-vertex model, a special case of...
research
06/29/2023

Planar splines on a triangulation with a single totally interior edge

We derive an explicit formula, valid for all integers r,d≥ 0, for the di...
research
09/15/2023

A new upper bound for angular resolution

The angular resolution of a planar straight-line drawing of a graph is t...

Please sign up or login with your details

Forgot password? Click here to reset