arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2106.08843cs.CG
收藏

可视化进化树

Visualizing Evolving Trees

Kathryn Gray, Mingwei Li, Reyan Ahmed, Stephen Kobourov

摘要:

进化树出现在许多现实生活场景中,从计算机文件系统和动态调用图,到假新闻传播和疾病传播。大多数静态树的布局算法在不断发展的环境中不能很好地工作(例如,它们并没有被设计为在时间步长之间保持稳定)。动态图布局算法更适合于此任务,尽管它们经常引入不必要的边交叉。考虑到这一点,我们提出了两种方法来可视化进化树,保证没有边缘交叉,同时优化(1)所需的边长实现,(2)布局紧凑性,(3)稳定性。我们评估了这两种新方法,以及五个以前的方法(三个静态和两个动态),在现实世界的数据集上使用定量指标:压力,所需的边长实现,布局紧凑性,稳定性和运行时间。新方法功能齐全,可以在github上使用。

英文摘要:

Evolving trees arise in many real-life scenarios from computer file systems and dynamic call graphs, to fake news propagation and disease spread. Most layout algorithms for static trees do not work well in an evolving setting (e.g., they are not designed to be stable between time steps). Dynamic graph layout algorithms are better suited to this task, although they often introduce unnecessary edge crossings. With this in mind we propose two methods for visualizing evolving trees that guarantee no edge crossings, while optimizing (1) desired edge length realization, (2) layout compactness, and (3) stability. We evaluate the two new methods, along with five prior approaches (three static and two dynamic), on real-world datasets using quantitative metrics: stress, desired edge length realization, layout compactness, stability, and running time. The new methods are fully functional and available on github.

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

↑