Crossing Minimization in Storyline Visualization

Gronemann, Martin; Jünger, Michael; Liers, Frauke; Mambelli, Francesco

doi:10.1007/978-3-319-50106-2_29

Cited by 28 publications

(48 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…48 From a dynamic graph drawing perspective, minimizing the changes in the linear ordering of our 1D drawing model seems to be related to the problem of minimizing crossings in a storyline visualization. 49,50 Indeed, a crossing between the lines representing two characters in a storyline visualization occurs when we invert the linear ordering of these lines along the vertical axis.…”

Section: Models Metrics and Algorithmsmentioning

confidence: 99%

Stable visualization of connected components in dynamic graphs

Giacomo

Didimo

Kaufmann

et al. 2020

Information Visualization

View full text Add to dashboard Cite

One of the primary goals of many systems for the visual analysis of dynamically changing networks is to maintain the stability of the drawing throughout the sequence of graph changes. We investigate the scenario where the changes are determined by a stream of events, each being either an edge addition or an edge removal. The visualization must be updated immediately after each new event is received. Our main goal is to provide the user with an intuitive visualization that highlights the different connected components of the graph while preserving the user’s mental map after each event. The drawing stability is measured in terms of changes in the orthogonal relationships between vertices of two consecutive drawings. We describe two different visualization models, one for the 1-dimensional space and the other for the 2-dimensional space. In both models the connected components are drawn inside rectangular regions. To validate our approach, we report the results of an experimental analysis that compares the drawing stability of the online algorithm with that of an offline algorithm that knows in advance the whole sequence of events. We also present a case study of our online algorithm on a collaboration network.

show abstract

Section: Models Metrics and Algorithmsmentioning

confidence: 99%

Stable visualization of connected components in dynamic graphs

Giacomo

Didimo

Kaufmann

et al. 2020

Information Visualization

View full text Add to dashboard Cite

show abstract

“…In 2013, Liu et al [9] developed an efficient optimization approach to storyline visualization that handles the hierarchical relationships between entities over time. Gronemann et al [5] delved further in to the storyline visualization problem by modeling the crossing minimization as a multi-layer crossing minimization problem with tree constraints.…”

Section: Storyline Visualizationmentioning

confidence: 99%

StoryPrint

Watson

Sohn

Schriber

et al. 2019

Proceedings of the 24th International Conference on Intelligent User Interfaces

View full text Add to dashboard Cite

show abstract

“…They proved the problem NP-hard, presented an FPT algorithm, and gave an upper bound on the number of crossings in a restricted setting. Gronemann et al [8] designed an integer linear program (ILP) to minimize the number of pairwise crossings and evaluated it experimentally. Their approach is able to solve instances with 10-20 characters and up to about 50 meetings from real-world movies (and to a lesser degree, books) to optimality in a few seconds.…”

Section: Concurrentmentioning

confidence: 99%

“…From a satisfying truth assignment we can derive the solution for S. The optimal number of block crossings can then be found using this decision problem by searching for the minimum satisfiable λ, for example using linear or exponential search. Our formulation is inspired by the ILP of Gronemann et al [8], which minimizes the number of pairwise crossings in a storyline visualization.…”

Section: Sat Formulation For the Decision Problemmentioning

confidence: 99%

See 1 more Smart Citation

Computing Storyline Visualizations with Few Block Crossings

Dijk

Lipp

Markfelder

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Storyline visualizations show the structure of a story, by depicting the interactions of the characters over time. Each character is represented by an x-monotone curve from left to right, and a meeting is represented by having the curves of the participating characters run close together for some time. There have been various approaches to drawing storyline visualizations in an automated way. In order to keep the visual complexity low, rather than minimizing pairwise crossings of curves, we count block crossings, that is, pairs of intersecting bundles of lines. Partly inspired by the ILP-based approach of Gronemann et al. [GD 2016] for minimizing the number of pairwise crossings, we model the problem as a satisfiability problem (since the straightforward ILP formulation becomes more complicated and harder to solve). Having restricted ourselves to a decision problem, we can apply powerful SAT solvers to find optimal drawings in reasonable time. We compare this SAT-based approach with two exact algorithms for block crossing minimization, using both the benchmark instances of Gronemann et al. and random instances. We show that the SAT approach is suitable for real-world instances and identify cases where the other algorithms are preferable.

show abstract

Crossing Minimization in Storyline Visualization

Cited by 28 publications

References 33 publications

Stable visualization of connected components in dynamic graphs

Stable visualization of connected components in dynamic graphs

StoryPrint

Computing Storyline Visualizations with Few Block Crossings

Contact Info

Product

Resources

About