A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing
A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing
复制标题
离线动态绘图的应力最小化方法的定量比较
DOI：
10.1007/978-3-642-25878-7_11
复制
发表时间：
2011
影响因子：
2.5
通讯作者：
Martin Mader
中科院分区：
文献类型：
--
作者：
U. Brandes;Martin Mader
在动态图形绘制中，输入是一系列图形，将为其生成一系列布局，以便随着时间的推移，各个布局的质量与布局稳定性保持平衡。已经提出了静态图绘制算法到动态情况的定性不同扩展，但人们对它们的相对效用知之甚少。我们报告了一项定量研究，通过对压力最小化框架的适应来比较三种原型扩展。虽然有些发现更为微妙，但连接同一顶点的连续实例的链接方法被发现是整体的选择方法。
In dynamic graph drawing, the input is a sequence of graphs for which a sequence of layouts is to be generated such that the quality of individual layouts is balanced with layout stability over time. Qualitatively different extensions of drawing algorithms for static graphs to the dynamic case have been proposed, but little is known about their relative utility. We report on a quantitative study comparing the three prototypical extensions via their adaptation for the stress-minimization framework. While some findings are more subtle, the linking approach connecting consecutive instances of the same vertex is found to be the overall method of choice.