微信服务号

微信订阅号

2025年4月4日 14:07 星期五
首页 > 过刊浏览>2016年第27卷第5期 >1103-1113. DOI:10.13328/j.cnki.jos.004952
PDF HTML阅读 XML下载 导出引用 引用提醒
面向层次化数据的变分圆形树图
作者:
基金项目:

国家自然科学基金(61572291,61202147);山东省自然科学基金(ZR2012FQ026)


Variational Circular Treemaps for Hierarchical Data
Author:
Fund Project:

National Natural Science Foundation of China (61572291, 61202147); Natural Science Foundation of Shandong Province of China (ZR2012FQ026)

  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [38]
    • |
  • 相似文献 [20]
    • | | |
  • 文章评论
    摘要:

    圆形树图(circular treemap)是面向层次化数据的一种信息可视化方法.提出一种圆形树图构造方法,将圆形树图的布局问题与组合优化中的圆排列(disk packing)问题相结合,以一种基于变分连续优化的算法求解多个半径不同圆的优化布局,由此提高圆形树图的空间利用率,并支持层次下行、层次上行与焦点+上下文等自然交互方式.实验结果表明了该方法的有效性.

    Abstract:

    Circular treemaps provide an efficient approach for visualization of hierarchical data. This article presents variational circular treemaps with a layout algorithm by solving disk packing as a continuous optimization problem. Compared with the traditional circular treemaps, variational circular treemaps can achieve a higher space utilization ratio, and support natural interactions for data navigation, including focus+context distortions and drill-down and roll-up operations. Experimental results show the effectiveness of the presented method for visualization and interaction.

    参考文献
    [1] Holten D. Hierarchical edge bundles:Visualization of adjacency relations in hierarchical data. IEEE Trans. on Visualization and Computer Graphics, 2006,12(5):741-748.[doi:10.1109/TVCG.2006.147]
    [2] Schulz HJ. Treevis.net:A tree visualization reference. IEEE Computer Graphics and Applications, 2011,31(6):11-15.[doi:10.1109/MCG.2011.103]
    [3] Stolte C, Tang D, Hanrahan P. Query, analysis, and visualization of hierarchically structured data using Polaris. In:Proc. of the 8th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (KDD 2002). New York:ACM Press, 2002. 112-122.[doi:10.1145/775047.775064]
    [4] Schulz HJ, Schumann H. Visualizing graphs-A generalized view. In:Proc. of the Conf. on Information Visualization (IV 2006). Washington:IEEE Computer Society, 2006. 166-173.[doi:10.1109/IV.2006.130]
    [5] Johnson B, Shneiderman B. Tree-Maps:A space-filling approach to the visualization of hierarchical information structures. In:Nielson GM, Rosenblum L, eds. Proc. of the 2nd Conf. on Visualization (VIS'91). Los Alamitos:IEEE Computer Society Press, 1991. 284-291.[doi:10.1109/VISUAL.1991.175815]
    [6] Shneiderman B. Tree visualization with tree-maps:2-d space-filling approach. ACM Trans. on Graphics, 1992,11(1):92-99.[doi:10.1145/102377.115768]
    [7] Lam HC, Dinov ID. Hyperbolic wheel:A novel hyperbolic space graph viewer for hierarchical information content. ISRN Computer Graphics, 2012,2012:Article ID 609234.[doi:10.5402/2012/609234]
    [8] Tak S, Cockburn A. Enhanced spatial stability with hilbert and Moore treemaps. IEEE Trans. on Visualization and Computer Graphics, 2013,19(1):141-148.[doi:10.1109/TVCG.2012.108]
    [9] Van Wijk JJ, van de Wetering H. Cushion treemaps:Visualization of hierarchical information. In:Proc. of the 1999 IEEE Symp. on Information Visualization (INFOVIS'99). Washington:IEEE Computer Society, 1999. 73-78.[doi:10.1109/INFVIS.1999.801860]
    [10] Wattenberg M. A note on space-filling visualizations and space-filling curves. In:Proc. of the IEEE Symp. on Information Visualization (INFOVIS 2005). 2005. 181-186.[doi:10.1109/INFVIS.2005.1532145]
    [11] van Ham F, van Wijk JJ. Beamtrees:Compact visualization of large hierarchies. Information Visualization, 2003,2(1):31-39.
    [12] Linsen L, Behrendt S. Linked treemap:A 3D treemap node link layout for visualizing hierarchical structures. Computational Statistics, 2011,26(4):679-697.[doi:10.1007/s00180-011-0272-2]
    [13] Nguyen QV, Huang ML. Space-Optimized tree:A connection+enclosure approach for the visualization of large hierarchies. Information Visualization, 2003,2(1):3-15.[doi:10.1057/palgrave.ivs.9500031]
    [14] Zhao S, McGuffin MJ, Chignell MH. Elastic hierarchies:Combining treemaps and node-link diagrams. In:Proc. of the IEEE Symp. on Information Visualization (INFOVIS 2005). IEEE, 2005. 57-64.[doi:10.1109/INFVIS.2005.1532129]
    [15] Chen Y, Zhang XY, Feng YC, Liang J, Chen HQ. Sunburst with ordered nodes based on hierarchical clustering:A visual analyzing method for associated hierarchical pesticide residue data. Journal of Visualization, 2015,18(2):237-254.[doi:10.1007/s12650-014-0269-3]
    [16] Wetzel K. Pebbles-Using circular treemaps to visualize disk usage. http://lip.sourceforge.net/ctreemap.html
    [17] Wang W, Wang H, Dai G, Wang H. Visualization of large hierarchical data by circle packing. In:Proc. of the SIGCHI Conf. on Human Factors in Computing Systems (CHI 2006). New York:ACM Press, 2006. 517-520.[doi:10.1145/1124772.1124851]
    [18] Bruls M, Huizing K, van Wijk JJ. Squarified treemaps. In:Proc. of the Joint Eurographics and IEEE TCVG Symp. on Visualization (TCVG 2000). IEEE Press, 2000. 33-42.[doi:10.1007/978-3-7091-6783-0_4]
    [19] Bederson BB, Shneiderman B, Wattenberg M. Ordered and quantum treemaps:Making effective use of 2D space to display hierarchies. ACM Trans. on Graphics (TOG), 2002,21(4):833-854.[doi:10.1145/571647.571649]
    [20] Itoh T, Yamaguchi Y, Ikehata Y, Kajinaga Y. Hierarchical data visualization using a fast rectangle-packing algorithm. IEEE Trans. on Visualization and Computer Graphics, 2004,10(3):302-313.[doi:10.1109/TVCG.2004.1272729]
    [21] Balzer M, Deussen O. Voronoi treemaps. In:Proc. of the 2005 IEEE Symp. on Information Visualization (INFOVIS 2005). Washington:IEEE Computer Society, 2005. 7-14.[doi:10.1109/INFVIS.2005.1532128]
    [22] Schulz HJ, Hadlak S, Schumann H. The design space of implicit hierarchy visualization:A survey. IEEE Trans. on Visualization and Computer Graphics, 2011,17(4):393-411.[doi:10.1109/TVCG.2010.79]
    [23] Zhang X, Yuan XZ. Treemap visualization. Journal of Computer-Aided Design & Computer Graphics, 2012,24(9):1113-1124(in Chinese with English abstract).
    [24] Shneiderman B. Treemaps for space-constrained visualization of hierarchies. http://www.cs.umd.edu/hcil/treemap-history/
    [25] Parsia B, Wang T, Golbeck J. Visualizing Web ontologies with cropcircles. In:Proc. of the 4th Int'l Semantic Web Conf. 2005. 6-10.
    [26] Fischer F, Fuchs J, Mansmann F. Clockmap:Enhancing circular treemaps with temporal glyphs for time-series data. In:Proc. of the Eurographics Conf. on Visualization (EuroVis). 2012. 97-101.
    [27] Ren L, Wang WX, Teng XD, Ma CX, Dai GZ, Wang HA. Focus+Context technique for interactive visualization of large hierarchies. Ruan Jian Xue Bao/Journal of Software, 2008,19(11):3073-3082(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/19/3073.htm
    [28] Aurenhammer F. Power diagrams:Properties, algorithms and applications. SIAM Journal on Computing, 1987,16(1):78-96.[doi:10.1137/0216006]
    [29] Du Q, Faber V, Gunzburger M. Centroidal voronoi tessellations:Applications and algorithms. SIAM Review, 1999,41(4):637-676.[doi:10.1137/S0036144599352836]
    [30] Lloyd SP. Least squares quantization in PCM. IEEE Trans. on Information Theory, 1982,28(2):129-136.[doi:10.1109/TIT.1982.1056489]
    [31] Fowler RJ, Paterson M, Tanimoto SL. Optimal packing and covering in the plane are NP-complete. Information Processing Letters, 1981,12(3):133-137.[doi:10.1016/0020-0190(81)90111-3]
    [32] Lu L, Choi YK, Sun F, Wang W. Variational circle packing based on power diagram. Technical Report, The University of Hong Kong, 2011.
    [33] Encyclopedia of life. http://www.eol.org
    [34] IT IS. Integrated taxonomic information system. http://www.itis.gov
    [35] CGAL. Computational geometry algorithms library. http://www.cgal.org
    附中文参考文献:
    [23] 张昕,袁晓如.树图可视化.计算机辅助设计与图形学学报,2012,24(9):1113-1124.
    [27] 任磊,王威信,滕东兴,马翠霞,戴国忠,王宏安.海量层次信息的Focus+Context交互式可视化技术.软件学报,2008,19(11):3073-3082. http://www.jos.org.cn/1000-9825/19/3073.htm
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

赵海森,吕琳,薄志涛.面向层次化数据的变分圆形树图.软件学报,2016,27(5):1103-1113

复制
分享
文章指标
  • 点击次数:5964
  • 下载次数: 6600
  • HTML阅读次数: 2567
  • 引用次数: 0
历史
  • 收稿日期:2015-06-20
  • 最后修改日期:2015-11-09
  • 在线发布日期: 2016-05-06
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19786513位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号