Crossing Minimization in Storyline Visualization

TL;DR

This paper introduces an algorithm for minimizing line crossings in storyline visualizations, improving readability by optimally arranging social interaction timelines.

Contribution

It models crossing minimization as a multi-layer problem with tree constraints and provides an algorithm that computes optimal layouts for large instances.

Findings

Successfully solves instances with over 100 interactions and lines

Achieves minimal crossings for complex social interaction data

Enhances aesthetic and legibility of storyline visualizations

Abstract

A storyline visualization is a layout that represents the temporal dynamics of social interactions along time by the convergence of chronological lines. Among the criteria oriented at improving aesthetics and legibility of a representation of this type, a small number of line crossings is the hardest to achieve. We model the crossing minimization in the storyline visualization problem as a multi-layer crossing minimization problem with tree constraints. Our algorithm can compute a layout with the minimum number of crossings of the chronological lines. Computational results demonstrate that it can solve instances with more than 100 interactions and with more than 100 chronological lines to optimality.