arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.01055cs.CGcs.DM
收藏

使用较少的块交叉计算故事情节可视化

Computing Storyline Visualizations with Few Block Crossings

Thomas C. van Dijk, Fabian Lipp, Peter Markfelder, Alexander Wolff

摘要:

故事情节可视化通过描绘角色随时间的互动来显示故事的结构。每个角色都由一条从左到右的x单调曲线表示,而一次会议则由参与角色的曲线在一段时间内靠在一起来表示。已经存在以自动方式绘制故事情节可视化的各种方法。为了保持较低的视觉复杂度,而不是最小化曲线的成对交叉,我们计数块交叉,即成对的相交线束。部分受到Gronemann等人[GD 2016]的基于ILP的方法的启发,用于最小化成对交叉的数量,我们将问题建模为可满足性问题(因为直接的ILP公式变得更加复杂,更难解决)。在将自己限制在决策问题上之后,我们可以应用强大的SAT求解器在合理的时间内找到最佳图纸。我们比较这种基于SAT的方法与两个精确的算法块交叉最小化,使用Gronemann等人的基准实例。和随机实例。我们表明,SAT的方法是适合于现实世界的情况下,并确定其他算法是优选的情况下。

英文摘要:

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 crossings, that is, pairs of intersecting bundles of lines. Partly inspired by the ILP-based approach of Gronemann et al. [GD 2016] for minimizing the number of pairwise crossings, we model the problem as a satisfiability problem (since the straightforward ILP formulation becomes more complicated and harder to solve). Having restricted ourselves to a decision problem, we can apply powerful SAT solvers to find optimal drawings in reasonable time. We compare this SAT-based approach with two exact algorithms for block crossing minimization, using both the benchmark instances of Gronemann et al. and random instances. We show that the SAT approach is suitable for real-world instances and identify cases where the other algorithms are preferable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑