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

基于力导向算法的复杂图形快照可视化

Snapshot Visualization of Complex Graphs with Force-Directed Algorithms

Se-Hang Cheong, Yain-Whar Si

摘要:

力导向算法被广泛用于图形的可视化。然而,这些算法在为复杂图生成高质量布局时计算代价很高。布局质量在很大程度上受执行时间和方法输入参数的影响,特别是对于大型复杂图。从这些算法生成的可视化的快照是有用的,在呈现当前视图或过去的状态的时间片上的信息。因此,研究人员经常需要在可视化质量和选择适当的力导向算法之间进行权衡。在本文中,我们评估质量的快照产生的7个力导向算法的边缘交叉的数量和边缘长度的标准偏差。我们的实验结果表明,KK,FA 2和DH算法不能产生令人满意的可视化大图的时间限制。KK-MS-DS算法可以处理大的平面图,但对平均度较低的图表现不佳。与KK-MS-DS算法相比,KK-MS算法对稀疏图和非聚类图产生更好的可视化效果。

英文摘要:

Force-directed algorithms are widely used for visualizing graphs. However, these algorithms are computationally expensive in producing good quality layouts for complex graphs. The layout quality is largely influenced by execution time and methods' input parameters especially for large complex graphs. The snapshots of visualization generated from these algorithms are useful in presenting the current view or a past state of an information on timeslices. Therefore, researchers often need to make a trade-off between the quality of visualization and the selection of appropriate force-directed algorithms. In this paper, we evaluate the quality of snapshots generated from 7 force-directed algorithms in terms of number of edge crossing and the standard deviations of edge length. Our experimental results showed that KK, FA2 and DH algorithms cannot produce satisfactory visualizations for large graphs within the time limit. KK-MS-DS algorithm can process large and planar graphs but it does not perform well for graphs with low average degrees. KK-MS algorithm produces better visualizations for sparse and non-clustered graphs than KK-MS-DS algorithm.

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

↑