Crossing Minimization in Storyline Visualization
From MaRDI portal
Abstract: A storyline visualization is a layout that represents the temporal dynamics of social interactions along time by the convergence of chronological lines. Among the criteria oriented at improving aesthetics and legibility of a representation of this type, a small number of line crossings is the hardest to achieve. We model the crossing minimization in the storyline visualization problem as a multi-layer crossing minimization problem with tree constraints. Our algorithm can compute a layout with the minimum number of crossings of the chronological lines. Computational results demonstrate that it can solve instances with more than 100 interactions and with more than 100 chronological lines to optimality.
Recommendations
- On minimizing crossings in storyline visualizations
- Computing storyline visualizations with few block crossings
- Block crossings in storyline visualizations
- Block Crossings in Storyline Visualizations
- Crossing minimization in perturbed drawings
- Crossing minimization in perturbed drawings
- Crossing minimization in extended level drawings of graphs
- Crossing Layout in Non-planar Graph Drawings
- Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
- Crossing minimization in linear embeddings of graphs
Cites work
- Algorithms for multi-level graph planarity testing and layout
- An SDP approach to multi-level crossing minimization
- Comparing trees via crossing minimization
- Crossing Number is NP-Complete
- Drawing (complete) binary tanglegrams
- Exact algorithms for the quadratic linear ordering problem
- Experiments in quadratic 0-1 programming
- Facets of the linear ordering polytope
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- Line Crossing Minimization on Metro Maps
- Metro-line crossing minimization: hardness, approximations, and tractable cases
- On minimizing crossings in storyline visualizations
- On the cut polytope
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- The cut polytope and the Boolean quadric polytope
- The importance of being proper
Cited in
(7)- On minimizing crossings in storyline visualizations
- Block Crossings in Storyline Visualizations
- Computing storyline visualizations with few block crossings
- Storyline visualizations with ubiquitous actors
- Block crossings in storyline visualizations
- Revisiting ILP models for exact crossing minimization in storyline drawings
- Storylines with a protagonist
This page was built for publication: Crossing Minimization in Storyline Visualization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961530)
