期刊文献+

一种基于空间距离的边绑定方法 被引量:1

A Distance-Based Edge-Bundling Method
在线阅读 下载PDF
导出
摘要 边绑定方法是近年来信息可视化领域的一个研究热点,解决图可视化中由于边的过多交叉而引起的视觉混乱问题。在现有的边绑定方法中,基于路径构建的算法通常能够在时间和绑定效果上获得较好的结果,其中基于边聚类和骨架构建路径的方法具有良好的数据表达能力。在此基础上,提出一种基于空间距离的边绑定的方法,结合边的空间距离和骨架生成的特点,在实现边绑定功能的同时针对以往基于骨架路径的方法做了进一步的改进。实验结果表明,该方法相比原方法有着更高的时间效率,对数据的细节保留更为合理,消除了原方法存在的绑定过度的问题,简化原方法的计算过程,并避免奇异性问题,更为实用。 Edge bundling has become a research hotspot in the field of information visualization. The edge-bundling methods address the visual clutter problem caused by extensive edge crossings in graphs. Among the recent edge-bundling methods, the algorithms which are based on the path construction are generally efficient and have good bundling results, the algorithms which are based on edge clustering and the skeleton construction can effectively reveal underlying patterns. Based on these works, a distance-based edge-bundling method is presented, with the features of space distances and skeletons, which can improve the edge-bundling results generated by the skeleton-based edge-bundling method. The experiment results demonstrate that the distance-based method is efficient and effective in pattern revealing, so that this method can avoid the over bundling problem of the previous one. In summary, this method is a practical one that can simplify the computing process and avoid the singularity problem.
作者 杨豪斌 周虹
出处 《图学学报》 CSCD 北大核心 2016年第3期296-301,共6页 Journal of Graphics
基金 国家自然科学基金青年科学基金项目(61103055)
关键词 边绑定 边聚类 图像骨架算法 图简化 信息可视化 edge bundling edge clustering skeleton-based algorithm graph visualization information visualization
  • 相关文献

参考文献12

  • 1Telea A, Ersoy O, Hoogendorp H, et al. Comparison of nodelLink and hierarchical edge bundling layouts: a user study [C/OL]//Dagstuhl Seminar Proceedings 09211: Visualization and Monitoring of Network Traffic. [2015-04-15]. http://drops.dagstuhl.de/protals/index.php? semnr=09211.
  • 2Holten D. Hierarchical edge bundles: visualization of adjacency relations in hierarchical data [J]. IEEE Transactions on Visualization and Computer Graphics, 2006, 12(5): 741-748.
  • 3Cui W W, Zhou H, Qu H M, et al. Geometry-based edge clustering for graph visualization [J]. IEEE Transactions on Visualization and Computer Graphics, 2008, 14(6): 1277-1284.
  • 4Lambert A, Bourqui R, Auber D. Winding roads: routing edges into bundles [J]. Computer Graphics Forum, 2010, 29(3): 853-862.
  • 5Holten D, Wijk J J V. Force-directed edge bundling for graph visualization [J]. Computer Graphics Forum, 2009, 28(3): 983-990.
  • 6姚中华,吴玲达,宋汉辰.网络图中边集束优化问题[J].北京航空航天大学学报,2015,41(5):871-878. 被引量:3
  • 7Gansner E R, Hu Y, North S, et al. Multilevel agglomerative edge bundling for visualizing large graphs [C]//In Proceedings oflEEE Pacific Visualization Symposium. Washington: IEEE Computer Society, 2011 187-194.
  • 8Ersoy O, Hurter C, Paulovich F V, et al. Skeleton-based edge bundling for graph visualization [J]. IEEE Transactions on Visualization and Computer Graphics, 2011, 17(12): 2364-2373.
  • 9Telea A, Van Wijk J J. An augmented fast marching method for computing skeletons and centerlines [C]//In Proceedings of the symposium on Data Visualisation 2002. Aire-La-Ville: Eurographics Association, 2002: 251-259.
  • 10赵春江,施文康,邓勇.具有鲁棒性的图像骨架提取方法[J].计算机应用,2005,25(6):1305-1306. 被引量:9

二级参考文献36

  • 1高春鸣.二值图像骨架的数学形态学描述及重建[J].长沙铁道学院学报,1996,14(4):89-93. 被引量:4
  • 2TSAI H-R. Parallel algorithms for the medial axis transform on linear arrays with a reconfigurable pipelined bus system [ A]. Parallel and Distributed Systems, 2002, Proceedings, Ninth International Conference[ C], 2002, 12:123 - 128.
  • 3FUJIWARA A, INOUE M, MASUSAWA T, et al. A simple parallel algorithm for the medial axis transform of binary images[ A]. A1gorithms and Architectures for Parallel Processing, 1996.ICAPP'96. 1996 IEEE Second International Conference[ C], 1996,6:1 -8.
  • 4Eades P. A heuristic for graph drawing[ J ]. Congressus Numer- antium, 1984,42( 1 ) : 149-160.
  • 5Kamada T,Kawai S. An algorithm for drawing general undirected graphs [ J ]. Information Processing Letters, 1989,31 ( 1 ) :7-15.
  • 6Davidson R, Harel D. Drawing graphs nicely using simulated an- nealing[ J ]. ACM Transactions on Graphics, 1996, 15 (4) : 301-331.
  • 7Fruchterman T M J, Reingold E M. Graph drawing by force- directed placement [ J ]. Software: Practice and Experience, 1991,21( 11 ) :1129-1164.
  • 8Ellis G,Dix A. A taxonomy of clutter reduction for information visualization[ J]. IEEE Transactions on Visualization and Com- puter Graphics, 2007,13 ( 6 ) : 1216-1223.
  • 9Hohen D. Hierarchical edge bundles: visualization of adjacency relations in hierarchical data [ J ]. IEEE Transactions on Visual-ization and Computer Graphics,2006,12 ( 5 ) : 805-812.
  • 10Chung P J, Deek J, Feinstein H E, et al. A structure-function study of map Tau : analyzing distinct map Tau domains in media- ting microtubule assembly and bundling using synchrotron SAXS [ J]. Biophysical Journal ,2012,102 (3) :700a.

共引文献28

同被引文献2

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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