Force-directed Graph Visualization with Pre-positioning - Improving Convergence Time and Quality of Layout

Jie Hua, M. Huang, Weidong Huang, Junhu Wang, Quang Vinh Nguyen
{"title":"Force-directed Graph Visualization with Pre-positioning - Improving Convergence Time and Quality of Layout","authors":"Jie Hua, M. Huang, Weidong Huang, Junhu Wang, Quang Vinh Nguyen","doi":"10.1109/IV.2012.31","DOIUrl":null,"url":null,"abstract":"Modern visual analytics tools provide mechanism for users to gain unknown knowledge through effective visual interactions for user to quickly understand the progress of algorithms and adjust the input parameters on intermediate visualizations that towards the production of most satisfied outcome. This requires the quick production of a sequence of graph visualizations. However, the traditional force-directed graph drawing algorithms are very slow to reach an equilibrium configuration of forces. They usually spend tens of seconds producing the layout of a graph converge. Thus, they do not satisfy the requirement of rapid drawing of graphs. This paper proposes a fast convergence method for drawing force-directed graphs. We essentially pre-calculate the geometrical position of all vertices before applying a force-directed layout algorithm to reach the energy minimization of the graph layout. The experimental results have shown that this approach could not only reduce the convergence time but also the number of edge crossings that approves the quality of layout significantly.","PeriodicalId":264951,"journal":{"name":"2012 16th International Conference on Information Visualisation","volume":"44 20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 16th International Conference on Information Visualisation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IV.2012.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Modern visual analytics tools provide mechanism for users to gain unknown knowledge through effective visual interactions for user to quickly understand the progress of algorithms and adjust the input parameters on intermediate visualizations that towards the production of most satisfied outcome. This requires the quick production of a sequence of graph visualizations. However, the traditional force-directed graph drawing algorithms are very slow to reach an equilibrium configuration of forces. They usually spend tens of seconds producing the layout of a graph converge. Thus, they do not satisfy the requirement of rapid drawing of graphs. This paper proposes a fast convergence method for drawing force-directed graphs. We essentially pre-calculate the geometrical position of all vertices before applying a force-directed layout algorithm to reach the energy minimization of the graph layout. The experimental results have shown that this approach could not only reduce the convergence time but also the number of edge crossings that approves the quality of layout significantly.
具有预定位的力导向图形可视化-改善布局的收敛时间和质量
现代可视化分析工具为用户提供了通过有效的可视化交互获取未知知识的机制,用户可以快速了解算法的进展,并调整中间可视化的输入参数,以产生最满意的结果。这需要快速生成一系列图形可视化。然而,传统的力导向图绘制算法在达到力的平衡配置时速度很慢。它们通常花费数十秒的时间来生成一个图形收敛的布局。因此,它们不能满足快速绘制图形的要求。提出了一种绘制力向图的快速收敛方法。在应用力导向布局算法之前,我们基本上预先计算了所有顶点的几何位置,以达到图形布局的能量最小化。实验结果表明,该方法不仅缩短了收敛时间,而且显著减少了边界交叉次数,从而提高了布局的质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信