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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/24/2020

Drawing Two Posets

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

Graph Compact Orthogonal Layout Algorithm

There exist many orthogonal graph drawing algorithms that minimize edge ...
07/31/2019

Level-Planar Drawings with Few Slopes

We introduce and study level-planar straight-line drawings with a fixed ...
02/03/2021

Extending Partial Representations of Rectangular Duals with Given Contact Orientations

A rectangular dual of a graph G is a contact representation of G by axis...
08/20/2020

On Turn-Regular Orthogonal Representations

An interesting class of orthogonal representations consists of the so-ca...
08/05/2019

Graph Drawing with Morphing Partial Edges

A partial edge drawing (PED) of a graph is a variation of a node-link di...
09/02/2015

Confluent Orthogonal Drawings of Syntax Diagrams

We provide a pipeline for generating syntax diagrams (also called railro...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.