Name
Abstract | ||
|---|---|---|
Storyline visualizations help visualize encounters of the characters in a story over time. Each character is represented by an x-monotone curve that goes from left to right. A meeting is represented by having the characters that participate in the meeting run close together for some time. In order to keep the visual complexity low, rather than just minimizing pairwise crossings of curves, we propose to count block crossings, that is, pairs of intersecting bundles of lines.Our main results are as follows. We show that minimizing the number of block crossings is NP-hard, and we develop, for meetings of bounded size, a constant-factor approximation. We also present two fixed-parameter algorithms and, for meetings of size 2, a greedy heuristic that we evaluate experimentally. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-50106-2_30 | GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016) |
DocType | Volume | Issue |
Conference | 9801 | 5 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.39 |
References | Authors | |
7 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas C. van Dijk | 1 | 63 | 9.52 |
| Martin Fink | 2 | 72 | 6.55 |
| Norbert Fischer | 3 | 2 | 0.39 |
| Fabian Lipp | 4 | 14 | 4.44 |
| Peter Markfelder | 5 | 2 | 0.39 |
| Alexander Ravsky | 6 | 10 | 2.31 |
| Subhash Suri | 7 | 5255 | 455.58 |
| Alexander Wolff | 8 | 43 | 6.65 |