André Schulz
Rolf C. Hagen Group
graph drawing | 2015
Irina Kostitsyna; Martin Nöllenburg; Valentin Polishchuk; André Schulz; Darren Strash
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
workshop on graph theoretic concepts in computer science | 2013
André Schulz
Journal of Graph Algorithms and Applications | 2017
Alexander Igamberdiev; W Wouter Meulemans; André Schulz
On\log n
graph drawing | 2015
Alexander Igamberdiev; Wouter Meulemans; André Schulz
workshop on graph theoretic concepts in computer science | 2017
Gregor Hültenschmidt; Philipp Kindermann; W Wouter Meulemans; André Schulz
crossings. Furthermore, we show that there exist storylines in this restricted case that require
graph drawing | 2018
Philipp Kindermann; W Wouter Meulemans; André Schulz
graph drawing | 2017
Philipp Kindermann; Stephen G. Kobourov; Maarten Löffler; Martin Nöllenburg; André Schulz; Birgit Vogtenhuber
\varOmega n\log n
Computational Geometry: Theory and Applications | 2016
Alexander Igamberdiev; André Schulz
workshop on graph theoretic concepts in computer science | 2015
Péter Hajnal; Alexander Igamberdiev; Günter Rote; André Schulz
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
graph drawing | 2015
Wouter Meulemans; André Schulz
