Maximizing Ink in Partial Edge Drawings of k-plane Graphs

08/23/2019
by   Matthias Hummel, et al.
0

Partial edge drawing (PED) is a drawing style for non-planar graphs, in which edges are drawn only partially as pairs of opposing stubs on the respective end-vertices. In a PED, by erasing the central parts of edges, all edge crossings and the resulting visual clutter are hidden in the undrawn parts of the edges. In symmetric partial edge drawings (SPEDs), the two stubs of each edge are required to have the same length. It is known that maximizing the ink (or the total stub length) when transforming a straight-line graph drawing with crossings into a SPED is tractable for 2-plane input drawings, but NP-hard for unrestricted inputs. We show that the problem remains NP-hard even for 3-plane input drawings and establish NP-hardness of ink maximization for PEDs of 4-plane graphs. Yet, for k-plane input drawings whose edge intersection graph forms a collection of trees or, more generally, whose intersection graph has bounded treewidth, we present efficient algorithms for computing maximum-ink PEDs and SPEDs. We implemented the treewidth-based algorithms and show a brief experimental evaluation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/03/2020

Saturated k-Plane Drawings with Few Edges

A drawing of a graph is k-plane if no edge is crossed more than k times....
research
06/05/2023

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges

Orienting the edges of an undirected graph such that the resulting digra...
research
08/31/2017

On the Edge-length Ratio of Outerplanar Graphs

We show that any outerplanar graph admits a planar straightline drawing ...
research
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...
research
08/29/2018

Short Plane Supports for Spatial Hypergraphs

A graph G=(V,E) is a support of a hypergraph H=(V,S) if every hyperedge ...
research
08/24/2017

Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity

We introduce and study the problem Ordered Level Planarity which asks fo...
research
11/26/2019

On The Sitting Closer to Friends than Enemies Problem in Trees and An Intersection Model for Strongly Chordal Graphs

A signed graph is a graph with a sign assignment to its edges. The Sitti...

Please sign up or login with your details

Forgot password? Click here to reset