期刊文献+

一种面向交互的渐进式图布局算法

An Interactive Oriented and Incremental Algorithm for Graph Layout
下载PDF
导出
摘要 针对力导引算法缺乏交互性、效率低、美观性不足,提出一种面向交互的渐进式图布局算法IIA(Interaction Oriented and Incremental Algorithm)。该算法先对一小部分图数据进行可视化,然后根据用户的选择从已可视化的部分渐进式扩展,再利用改进的算法对扩展部分进行可视化。实验结果表明:IIA算法不仅能与用户交互,而且提高了可视化的效率,在美观性上也有所改善。 Aiming at the force-directed algorithm lacking of interactivity and aesthetics and low efficiency,an interaction oriented and incremental algorithm for graph visualization is proposed. Firstly,the algorithm visualizes a small portion of the graph data,secondly,extends the visualized data by user's selection,and then draws the extended data with the new algorithm. The new algorithm can not only interact with users,but also improve the efficiency of visualization and the aesthetics.
出处 《计算机与现代化》 2014年第8期113-118,共6页 Computer and Modernization
关键词 力导引 可视化 交互式 渐进式 无向图 force-directed visualization interaction increment undirected graph
  • 相关文献

参考文献17

  • 1杨彦波,刘滨,祁明月.信息可视化研究综述[J].河北科技大学学报,2014,35(1):91-102. 被引量:137
  • 2黄竞伟,康立山,陈毓屏.一个新的无向图画图算法[J].软件学报,2000,11(1):138-142. 被引量:25
  • 3Eades P. A heuristci graph drawing[C]// Congressus Numerantium. 1984,42(11):149-160.
  • 4Kamada T, Kawai S. An algorithm for drawing general undirected graphs[J]. Information Processing Letters,1989,31(1):7-15.
  • 5Fruchterman T M J, Reingold E M. Graph drawing by force-directed placement[J]. Software-Practice and Experience, 1991,21(11):1129-1164.
  • 6Walshaw C. A multilevel algorithm for force-directed graph drawing[C]// Proceedings of the 8th International Symposium on Graph Drawing. 2001,1984:171-182.
  • 7Hadany R, Harel D. A multi-scale algorithm for drawing graphs nicely[J]. Discrete Applied Mathematics,2001,113(1):3-21.
  • 8Hu Yifan. Efficient and high-quality force-directed graph drawing[J]. The Mathematica Journal,2005,10:37-71.
  • 9Rodrigues J F, Tong Hanghang, Pan Jiayu, et al. Large graph analysis in the GMine system[J]. IEEE Transactions on Knowledge and Data Engineering, 2013,25(1):106-118.
  • 10张清国,黄竞伟.一个无向平面图的画图算法[J].小型微型计算机系统,2003,24(6):972-975. 被引量:6

二级参考文献104

  • 1任永功,于戈.数据可视化技术的研究与进展[J].计算机科学,2004,31(12):92-96. 被引量:54
  • 2杨峰,李蔚.评价信息可视化技术的指标研究[J].图书情报知识,2007,24(4):80-84. 被引量:7
  • 31.Battista G D, Eades P, Tamassia R et al. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 1994,4(5):235~282
  • 42.Kamada T, Kawai S. An algorithm for drawing general undirected graph. Information Letters, 1989,31(1):7~15
  • 53.Fruchterman T M J , Reingold E M. Graph drawing by force-directed placement. Software-Practice and Experience, 1991,21(11):1129~1164
  • 64.Kosak C, Marks J, Shieber S. Automating the layout of network diagrams with specified visual organization. IEEE Transactions on System, Man and Cybernetics, 1994,24(3):440~454
  • 75.Michalewicz Z. Genetic Algorithms+Data Structures=Evolution Programs. 3rd edition, New York: Springer-Verlag, 1996
  • 8Battista G D, Eades P, Tamassia R and Tollis I G. Algorithms for drawing graphs:an annotated bibliography[J]. Computational Geometry: Theory and Applications, 1994,4 (5) : 235 - 282.
  • 9Battista G D, Eades P, Tamassia R and . Tollis I G. Graph drawing: algorithms for the visualization of graphs[M]. New Jersey:Prentice-Hall, 1999.
  • 10Chiba N, Yamanouchi T and Nishizeki T. Drawing plane graphs nicely[J]. Acta Informatica , 1985 ,22:187-201.

共引文献159

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部