Crossing Minimization in Storyline Visualization
Crossing Minimization in Storyline Visualization
复制标题
故事情节可视化中的交叉最小化
DOI：
10.1007/978-3-319-50106-2_29
复制
发表时间：
2016
影响因子：
5.2
通讯作者：
Francesco Mambelli
中科院分区：
文献类型：
--
作者：
M. Gronemann;M. Jünger;F. Liers;Francesco Mambelli
故事情节可视化是一种布局，它通过时间线的收敛来表示沿着时间的社会交互的时间动态。在以提高这种类型的表示的美学和易读性为导向的标准中，少量的线交叉是最难实现的。我们将故事情节可视化中的交叉最小化问题建模为一个带有树约束的多层交叉最小化问题。我们的算法可以计算一个布局的最小数量的交叉的时间线。计算结果表明，它可以解决超过100个相互作用和超过100个时序线的最优性的情况下。
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.1
作者：
Wotzlaw, Andreas;Speckenmeyer, Ewald;Porschen, Stefan
通讯作者：
Porschen, Stefan