Crossing Minimization in Storyline Visualization

Gronemann, Martin and Jünger, Michael and Liers, Frauke and Mambelli, Francesco (2016) Crossing Minimization in Storyline Visualization. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 367-381(Official URL: http://dx.doi.org/10.1007/978-3-319-50106-2_28).

Full text not available from this repository.

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.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.420 Crossings
P Styles > P.480 Layered
P Styles > P.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1556

Actions (login required)

View Item View Item