On Minimizing Crossings in Storyline Visualizations

Kostitsyna, Irina and Nöllenburg, Martin and Polishchuk, Valentin and Schulz, André and Strash, Darren (2015) On Minimizing Crossings in Storyline Visualizations. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 192-198(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_16).

Full text not available from this repository.


In a storyline visualization, we visualize a collection of interacting characters (e.g., in a movie, play, etc.) by x-monotone curves that converge for each interaction, and diverge otherwise. Given a storyline with n characters, we show tight lower and upper bounds on the number of crossings required in any storyline visualization for a restricted case. In particular, we show that if (1) each meeting consists of exactly two characters and (2) the meetings can be modeled as a tree, then we can always find a storyline visualization with O(nlogn) crossings. Furthermore, we show that there exist storylines in this restricted case that require Ω(nlogn) crossings. Lastly, we show that, in the general case, minimizing the number of crossings in a storyline visualization is fixed-parameter tractable, when parameterized on the number of characters k. Our algorithm runs in time O(k!^2*klogk+k!^2*m), where m is the number of meetings.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.420 Crossings
P Styles > P.480 Layered
P Styles > P.999 Others
Z Theory > Z.999 Others
Depositing User: Administration GDEA
Date Deposited: 04 May 2016 16:12
Last Modified: 04 May 2016 16:12
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1488

Actions (login required)

View Item View Item