Crossing Minimization in Storyline Visualization

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.

[1]  Alexander Wolff,et al.  Drawing Binary Tanglegrams: An Experimental Evaluation , 2008, ALENEX.

[2]  Michael Kaufmann,et al.  Comparing trees via crossing minimization , 2010, J. Comput. Syst. Sci..

[3]  Mengchen Liu,et al.  StoryFlow: Tracking the Evolution of Stories , 2013, IEEE Transactions on Visualization and Computer Graphics.

[4]  Martin Nöllenburg,et al.  On Minimizing Crossings in Storyline Visualizations , 2015, Graph Drawing.

[5]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[6]  Alexander Wolff,et al.  Drawing (Complete) Binary Tanglegrams , 2008, Graph Drawing.

[7]  Michael Jünger,et al.  The ABACUS system for branch‐and‐cut‐and‐price algorithms in integer programming and combinatorial optimization , 2000, Softw. Pract. Exp..

[8]  Kwan-Liu Ma,et al.  Egocentric storylines for visual analysis of large dynamic graphs , 2013, 2013 IEEE International Conference on Big Data.

[9]  Michael A. Bekos,et al.  Line Crossing Minimization on Metro Maps , 2007, Graph Drawing.

[10]  Martin Fink,et al.  Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases , 2013, GD.

[11]  Kwan-Liu Ma,et al.  Software evolution storylines , 2010, SOFTVIS '10.

[12]  Michael Jünger,et al.  A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem , 1997, GD.

[13]  Michael Jünger,et al.  Level Planarity Testing in Linear Time , 1998, Graph Drawing.

[14]  Kwan-Liu Ma,et al.  An Efficient Framework for Generating Storyline Visualizations from Streaming Data , 2015, IEEE Transactions on Visualization and Computer Graphics.

[15]  Christoph Buchheim,et al.  Exact Bipartite Crossing Minimization under Tree Constraints , 2010, SEA.

[16]  Kwan-Liu Ma,et al.  Design Considerations for Optimizing Storyline Visualizations , 2012, IEEE Transactions on Visualization and Computer Graphics.

[17]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[18]  Giuseppe Di Battista,et al.  The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity) , 2014, Graph Drawing.

[19]  Michael Jünger,et al.  An SDP approach to multi-level crossing minimization , 2012, JEAL.

[20]  P. L. Ivanescu.  Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .

[21]  Fabian Beck,et al.  Visualizing the Evolution of Communities in Dynamic Graphs , 2015, Comput. Graph. Forum.

[22]  Martin Grötschel,et al.  Facets of the linear ordering polytope , 1985, Math. Program..

[23]  Patrick Healy,et al.  Algorithms for multi-level graph planarity testing and layout , 2004, Theor. Comput. Sci..

[24]  G. Reinelt,et al.  2 Computing Exact Ground Statesof Hard Ising Spin Glass Problemsby Branch-and-Cut , 2005 .

[25]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..

[26]  Michael Jünger,et al.  Experiments in quadratic 0–1 programming , 1989, Math. Program..

[27]  Xin Tong,et al.  TextFlow: Towards Better Understanding of Evolving Topics in Text , 2011, IEEE Transactions on Visualization and Computer Graphics.

[28]  Stefan Porschen,et al.  Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation , 2012, Discret. Appl. Math..

[29]  Christoph Buchheim,et al.  Exact Algorithms for the Quadratic Linear Ordering Problem , 2010, INFORMS J. Comput..

[30]  Caterina De Simone,et al.  The cut polytope and the Boolean quadric polytope , 1990, Discret. Math..