Crossing minimization in storyline visualization
Gronemann M, Juenger M, Liers F, Mambelli F (2016)
Publication Type: Conference contribution
Publication year: 2016
Journal
Publisher: Springer Verlag
Book Volume: 9801 LNCS
Pages Range: 367-381
Conference Proceedings Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Event location: Athens
ISBN: 9783319501055
DOI: 10.1007/978-3-319-50106-2_29
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.
Authors with CRIS profile
Involved external institutions
Germany (DE)How to cite
APA:
Gronemann, M., Juenger, M., Liers, F., & Mambelli, F. (2016). Crossing minimization in storyline visualization. In Martin Nollenburg, Yifan Hu (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 367-381). Athens, GR: Springer Verlag.
MLA:
Gronemann, Martin, et al. "Crossing minimization in storyline visualization." Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization, GD 2016, Athens Ed. Martin Nollenburg, Yifan Hu, Springer Verlag, 2016. 367-381.
BibTeX: Download