Extending Partial Orthogonal Drawings

08/24/2020
by   Patrizio Angelini, et al.
0

We study the planar orthogonal drawing style within the framework of partial representation extension. Let (G,H,Γ_H ) be a partial orthogonal drawing, i.e., G is a graph, H⊆ G is a subgraph and Γ_H is a planar orthogonal drawing of H. We show that the existence of an orthogonal drawing Γ_G of G that extends Γ_H can be tested in linear time. If such a drawing exists, then there also is one that uses O(|V(H)|) bends per edge. On the other hand, we show that it is NP-complete to find an extension that minimizes the number of bends or has a fixed number of bends per edge.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2020

Drawing Two Posets

We investigate the problem of drawing two posets of the same ground set ...
research
07/24/2018

Graph Compact Orthogonal Layout Algorithm

There exist many orthogonal graph drawing algorithms that minimize edge ...
research
09/01/2023

Evaluating Animation Parameters for Morphing Edge Drawings

Partial edge drawings (PED) of graphs avoid edge crossings by subdividin...
research
07/31/2019

Level-Planar Drawings with Few Slopes

We introduce and study level-planar straight-line drawings with a fixed ...
research
08/24/2022

Improved Scheduling of Morphing Edge Drawing

Morphing edge drawing (MED), a graph drawing technique, is a dynamic ext...
research
02/20/2023

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable

The task of finding an extension to a given partial drawing of a graph w...
research
10/10/2022

Parameterized Approaches to Orthogonal Compaction

Orthogonal graph drawings are used in applications such as UML diagrams,...

Please sign up or login with your details

Forgot password? Click here to reset