Crossing Minimization in Storyline Visualization

On Minimizing Crossings in Storyline Visualizations

In a storyline visualization, we visualize a collection of interacting characters (e.g., in a movie, play, etc.) by $x$-monotone curves that converge for each interaction, and diverge otherwise. Given a storyline with $n$ characters, we show tight lower and upper bounds on the number of crossings required in any storyline visualization for a restricted case. In particular, we show that if (1) each meeting consists of exactly two characters and (2) the meetings can be modeled as a tree, then we can always find a storyline visualization with $O(n\log n)$ crossings. Furthermore, we show that ther…

Storyline Visualizations with Ubiquitous Actors

Storyline visualizations depict the temporal dynamics of social interactions, as they describe how groups of actors (individuals or organizations) change over time. A common constraint in storyline visualizations is that an actor cannot belong to two different groups at the same time instant. However, this constraint may be too severe in some application scenarios, thus we generalize the model by allowing an actor to simultaneously belong to distinct groups at any point in time. We call this model Storyline with Ubiquitous Actors (SUA). Essential to our model is that an actor is represented as…

优化故事线中的摆动

Optimizing Wiggle in Storylines

本文研究故事线可视化中的摆动最小化问题，证明摆动次数最小化是NP完全的，提出基于数学规划的高效算法求解线性和二次摆动高度最小化，并引入保持平行曲线等距的新布线方法，还展示了铁路车辆调度可视化新应用。

重新审视用于故事线绘制中精确交叉最小化的ILP模型

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings

本文通过引入问题特定见解和新启发式方法增强整数线性规划模型，在更大更复杂的故事线绘制基准集上实现了比现有方法快2.6-3.2倍的精确交叉最小化求解。

关于最小化堆叠面积图中的波动

On Minimizing Wiggle in Stacked Area Charts

本文首次分析了最小化堆叠面积图波动的计算复杂度，证明其多种变体为NP-hard且难以近似，提出混合整数线性规划精确求解方法，并揭示了其与绝对前缀和最小化排序问题的关联。

平面密度约束下能量最小化的快速多重网格算法

A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints

针对平面密度约束下的二维布局优化问题，提出一种线性时间多重网格算法，并在图绘制实例中验证其有效性。