Crossing Minimization in Storyline Visualization
Gronemann, Martin and Jünger, Michael and Liers, Frauke and Mambelli, Francesco
(2016)
Crossing Minimization in Storyline Visualization.
Published In:
Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016), Lecture Notes in Computer Science. 9801 Springer 2016, pp. 367-381.
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.
Download: |
![]() Download (663kB) |
---|---|
Editorial actions: | ![]() |
Item Type: | Proceedings article |
---|---|
Citations: | No citation data. |
Uncontrolled Keywords: | |
Subjects: |
|
Divisions: | Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger |
Related URLs: |
ZAIK Number: | UNSPECIFIED |
---|---|
Depositing User: | Martin Gronemann |
Date Deposited: | 12 Mar 2018 14:21 |
Last Modified: | 13 Mar 2018 09:36 |
URI: | http://e-archive.informatik.uni-koeln.de/id/eprint/924 |