Crossing Minimization in Storyline Visualization

Beitrag in einem Sammelwerk


Details zur Publikation

Autorinnen und Autoren: Gronemann M, Jünger M, Liers F, Mambelli F
Titel Sammelwerk: Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization
Verlag: Springer
Jahr der Veröffentlichung: 2016
Titel der Reihe: Lecture Notes in Computer Science


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.



FAU-Autorinnen und Autoren / FAU-Herausgeberinnen und Herausgeber

Liers-Bergmann, Frauke Prof. Dr.
Professur für Angewandte Mathematik (Ganzzahlige und robuste Optimierung)


Einrichtungen weiterer Autorinnen und Autoren

Universität Köln


Zitierweisen

APA:
Gronemann, M., Jünger, M., Liers, F., & Mambelli, F. (2016). Crossing Minimization in Storyline Visualization. In Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization Springer.

MLA:
Gronemann, Martin, et al. "Crossing Minimization in Storyline Visualization." Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization Springer, 2016.

BibTeX: 

Zuletzt aktualisiert 2018-10-08 um 06:53