DeepAI

# Small Point-Sets Supporting Graph Stories

In a graph story the vertices enter a graph one at a time and each vertex persists in the graph for a fixed amount of time ω, called viewing window. At any time, the user can see only the drawing of the graph induced by the vertices in the viewing window and this determines a sequence of drawings. For readability, we require that all the drawings of the sequence are planar. For preserving the user's mental map we require that when a vertex or an edge is drawn, it has the same drawing for its entire life. We study the problem of drawing the entire sequence by mapping the vertices only to ω+k given points, where k is as small as possible. We show that: (i) The problem does not depend on the specific set of points but only on its size; (ii) the problem is NP-hard and is FPT when parameterized by ω+k; (iii) there are families of graph stories that can be drawn with k=0 for any ω, while for k=0 and small values of ω there are families of graph stories that can be drawn and others that cannot; (iv) there are families of graph stories that cannot be drawn for any fixed k and families of graph stories that require at least a certain k.

• 12 publications
• 21 publications
• 3 publications
• 2 publications
• 11 publications
• 19 publications
• 18 publications
08/25/2019

### Graph Stories in Small Area

We study the problem of drawing a dynamic graph, where each vertex appea...
10/24/2020

### Drawing Two Posets

We investigate the problem of drawing two posets of the same ground set ...
11/15/2018

### A Note On Universal Point Sets for Planar Graphs

We investigate which planar point sets allow simultaneous straight-line ...
09/01/2022

### On the Complexity of the Storyplan Problem

Motivated by dynamic graph visualization, we study the problem of repres...
08/06/2021

### CFGConf: Supporting high level requirements for visualizing Control Flow Graphs

Control Flow Graphs (CFGs) are directed graphs that represent all possib...
08/23/2018

### Crossing Minimization in Perturbed Drawings

Due to data compression or low resolution, nearby vertices and edges of ...
08/25/2020

### Accelerating Force-Directed Graph Drawing with RT Cores

Graph drawing with spring embedders employs a V x V computation phase ov...