Layered Area-Proportional Rectangle Contact Representations

08/24/2021
by   Martin Nöllenburg, et al.
0

We investigate two optimization problems on area-proportional rectangle contact representations for layered, embedded planar graphs. The vertices are represented as interior-disjoint unit-height rectangles of prescribed widths, grouped in one row per layer, and each edge is ideally realized as a rectangle contact of positive length. Such rectangle contact representations find applications in semantic word or tag cloud visualizations, where a collection of words is displayed such that pairs of semantically related words are close to each other. In this paper, we want to maximize the number of realized rectangle contacts or minimize the overall area of the rectangle contact representation, while avoiding any false adjacencies. We present a network flow model for area minimization, a linear-time algorithm for contact maximization of two-layer graphs, and an ILP model for maximizing contacts of k-layer graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/05/2020

Weak Unit Disk Contact Representations for Graphs without Embedding

Weak unit disk contact graphs are graphs that admit representing nodes a...
research
10/05/2020

Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard

Weak unit disk contact graphs are graphs that admit a representation of ...
research
09/13/2019

Characterising circular-arc contact B_0-VPG graphs

A contact B_0-VPG graph is a graph for which there exists a collection o...
research
04/13/2020

Pentagon contact representations

Representations of planar triangulations as contact graphs of a set of i...
research
08/01/2023

Side-Contact Representations with Convex Polygons in 3D: New Results for Complete Bipartite Graphs

A polyhedral surface 𝒞 in ℝ^3 with convex polygons as faces is a side-co...
research
10/01/2017

Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs

A square-contact representation of a planar graph G=(V,E) maps vertices ...
research
12/06/2021

Morphing Rectangular Duals

We consider the problem of morphing between rectangular duals of a plane...

Please sign up or login with your details

Forgot password? Click here to reset