2018
DOI: 10.1007/978-3-319-73915-1_29
|View full text |Cite
|
Sign up to set email alerts
|

Computing Storyline Visualizations with Few Block Crossings

Abstract: 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 crossin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0
1

Year Published

2018
2018
2025
2025

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(20 citation statements)
references
References 14 publications
0
12
0
1
Order By: Relevance
“…Curiosamente, es la tira cómica y no el mapa de Minard el que ha derivado en la aparición de una técnica de visualización de datos denominada storyline (Ogawa y Ma, 2010); los autores adaptaron la representación propuesta por Munroe al análisis de las interacciones entre desarrolladores de un proyecto software. Desde entonces se han sucedido diversas propuestas para la automatización de la creación de este tipo de diagramas (T. Chen et al, 2012;Tanahashi y Ma, 2012;van Dijk et al, 2017;Tang et al, 2018;Padia et al, 2018;Tang et al, 2020;Araya et al, 2021).…”
Section: Las Dos Culturas De La Visualización De Datos En La Historiaunclassified
“…Curiosamente, es la tira cómica y no el mapa de Minard el que ha derivado en la aparición de una técnica de visualización de datos denominada storyline (Ogawa y Ma, 2010); los autores adaptaron la representación propuesta por Munroe al análisis de las interacciones entre desarrolladores de un proyecto software. Desde entonces se han sucedido diversas propuestas para la automatización de la creación de este tipo de diagramas (T. Chen et al, 2012;Tanahashi y Ma, 2012;van Dijk et al, 2017;Tang et al, 2018;Padia et al, 2018;Tang et al, 2020;Araya et al, 2021).…”
Section: Las Dos Culturas De La Visualización De Datos En La Historiaunclassified
“…Branch Permutation. We exploit a state-of-the-art algorithm for classical storyline visualizations, namely the algorithm by van Dijk et al [4] based on a SAT formulation, which optimally solves the problem of minimizing block crossings. To this aim, we transform the output of Step 1 into an instance for a classical storyline visualization: Each actor tree is partitioned into a set of edge-disjoint paths by duplicating each node with k ≥ 2 children into k nodes each having one child (see Fig.…”
Section: The Sua Algorithmic Pipelinementioning
confidence: 99%
“…3(a)). Each path is processed by the algorithm in [4] as a distinct actor. All copies of the same node are then recombined into a single node to restore the tree.…”
Section: The Sua Algorithmic Pipelinementioning
confidence: 99%
See 1 more Smart Citation
“…[18,21]) and storyline visualizations (see e.g. [22]). However, most approaches from the graph drawing literature, including orthogonal layout methods, produce outputs that have a distinct style and are not suited to be customized to adhere to engineering drawing conventions.…”
Section: Introductionmentioning
confidence: 99%