Block Crossings in Storyline Visualizations

@inproceedings{Dijk2016BlockCI,
  title={Block Crossings in Storyline Visualizations},
  author={Thomas C. van Dijk and Martin Fink and Norbert Fischer and Fabian Lipp and Peter Markfelder and Alexander Ravsky and Subhash Suri and Alexander Wolff},
  booktitle={Graph Drawing},
  year={2016}
}
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… 

Computing Storyline Visualizations with Few Block Crossings

TLDR
This paper compares this SAT-based approach with two exact algorithms for block crossing minimization, using both the benchmark instances of Gronemann et al. and random instances, and shows that the SAT approach is suitable for real-world instances and identifies cases where the other algorithms are preferable.

On Block Crossing Optimal Drawings of Storylines

TLDR
This work model the storyline visualizations problem as a satis(cid:28)ability problem, and shows that the new model is superior in runtime compared to the old approach, by evaluating the model on the same real-world instances and random instances as in previous work.

Approximating the Bundled Crossing Number

TLDR
There is a polynomial time algorithm to compute an 8-approximation of the bundled crossing number of a good drawing (up to adding a term depending on the facial structure of the drawing).

Temporal Treemaps: Static Visualization of Evolving Trees

TLDR
This work considers temporally evolving trees with changing topology and data: tree nodes may persist for a time range, merge or split, and the associated data may change, and presents a method to visualize this dynamic data in a static, nested, and space-filling visualization.

Stable visualization of connected components in dynamic graphs

TLDR
This work investigates the scenario where the changes are determined by a stream of events, each being either an edge addition or an edge removal, and describes two different visualization models, one for the 1-dimensional space and the other for the 2- dimensional space.

A Survey on Visualization Techniques to Narrate Interpersonal Interactions between Sportsmen

TLDR
This article explores time-oriented data visualization techniques and investigates visualizations that might be used to narrate activities about interpersonal interactions, looking for a flow visualization technique from events that can describe the event in detail.

Spatially and Temporally Coherent Visual Summaries

TLDR
The Stable Principal Component method is explicitly parametrized for stability, allowing a trade-off between the two quality criteria, and computational experiments demonstrate that the stable algorithms outperform existing methods on stability, without sacrificing spatial quality or efficiency.

Stable Visual Summaries for Trajectory Collections

TLDR
Stable dimensionality reduction outperforms existing methods on stability, without sacrificing spatial quality or efficiency; in particular, the new SPC method does so at a fraction of the computational costs.

In Search of Patient Zero: Visual Analytics of Pathogen Transmission Pathways in Hospitals

TLDR
A novel visual analytics approach is presented to support the analysis of transmission pathways, patient contacts, the progression of the outbreak, and patient timelines during hospitalization to bring significant benefits for analyzing outbreaks.

The worst graph layout algorithm ever

Graph layout algorithms strive to improve the utility of node-link visualizations or graph drawings by optimizing for readability criteria. One such criteria that has been widely used is to count

References

SHOWING 1-10 OF 20 REFERENCES

Computing Storyline Visualizations with Few Block Crossings

TLDR
This paper compares this SAT-based approach with two exact algorithms for block crossing minimization, using both the benchmark instances of Gronemann et al. and random instances, and shows that the SAT approach is suitable for real-world instances and identifies cases where the other algorithms are preferable.

Crossing Minimization in Storyline Visualization

TLDR
The algorithm can compute a layout with the minimum number of crossings of the chronological lines in a storyline visualization problem as a multi-layer crossing minimization problem with tree constraints.

On Minimizing Crossings in Storyline Visualizations

TLDR
This work shows tight lower and upper bounds on the number of crossings required in any storyline visualization for a restricted case, and shows that, in the general case, minimizing theNumber of crossings in a storyline visualization is fixed-parameter tractable, when parameterized on thenumber of characters k.

Design Considerations for Optimizing Storyline Visualizations

TLDR
This paper presents a set of design considerations for generating aesthetically pleasing and legible storyline visualizations and shows that the resulting visualizations have significantly improved aesthetics and legibility compared to existing techniques.

Egocentric storylines for visual analysis of large dynamic graphs

TLDR
An egocentric, bottom-up method to exploring a large dynamic network using a storyline representation to summarise localized behavior of the network over time is presented.

Tracing genealogical data with TimeNets

TLDR
TimeNets, a new visualization technique for genealogical data that facilitates perception of temporal trends and provides a substrate for communicating non-hierarchical patterns such as divorce, remarriage, and plural marriage is presented.

Ordering Metro Lines by Block Crossings

TLDR
This work gives approximation algorithms for special classes of graphs and an asymptotically worst-case optimal algorithm for block crossings on general graphs and suggests merging crossings into block crossings, that is, crossings of two neighboring groups of consecutive lines.

Sorting a bridge hand