Ambiguity-free edge-bundling for interactive graph visualization

IEEE Transactions on Visualization and Computer Graphics

Volumn 18, Issue 5, 2012, Pages 810-821

  Luo, Sheng Jie ^a   Liu, Chun Liang ^a   Chen, Bing Yu ^a   Ma, Kwan Liu ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b University of California   (United States)

Author keywords

detail on demand; edge ambiguity; edge bundling; edge congestion; Graph visualization; interactive navigation; network visualization

Indexed keywords

DETAIL-ON-DEMAND; EDGE AMBIGUITY; EDGE BUNDLING; EDGE CONGESTION; GRAPH VISUALIZATION; NETWORK VISUALIZATION;

COMPUTER GRAPHICS; SOFTWARE ENGINEERING;

VISUALIZATION;

EID: 84862797112     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2011.104     Document Type: Article

References (33)

1. D. Phan, L. Xiao, R. Yeh, P. Hanrahan, and T. Winograd, "Flow Map Layout," Proc. IEEE Symp. Information Visualization, pp. 219-224, 2005. (Pubitemid 44500059)
2. D. Holten, "Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data," IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 5, pp. 741-748, Sept./Oct. 2006. (Pubitemid 44955599)
3. H. Qu, H. Zhou, and Y. Wu, "Controllable and Progressive Edge Clustering for Large Networks," Proc. 14th Int'l Symp. Graph Drawing, pp. 399-404, 2006.
4. W. Cui, H. Zhou, H. Qu, P.C. Wong, and X. Li, "Geometry-Based Edge Clustering for Graph Visualization," IEEE Trans. Visualization and Computer Graphics, vol. 14, no. 6, pp. 1277-1284, Nov./Dec. 2008.
5. H. Zhou, X. Yuan, W. Cui, H. Qu, and B. Chen, "Energy-Based Hierarchical Edge Clustering of Graphs," Proc. IEEE Symp. Pacific Visualization, pp. 55-61, 2008.
6. D. Holten and J.J. van Wijk, "Force-Directed Edge Bundling for Graph Visualization," Computer Graphics Forum, vol. 28, no. 3, pp. 983-990, 2009.
7. S. Milgram, "The Small World Problem," Psychology Today, vol. 1, no. 1, pp. 60-67, 1967.
8. D.J. Watts, Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton Univ. Press, 1999.
9. F. van Ham and J.J. van Wijk, "Interactive Visualization of Small World Graphs," Proc. IEEE Symp. Information Visualization, pp. 199-206, 2004. (Pubitemid 40449146)
10. F. van Ham, "Using Multilevel Call Matrices in Large Software Projects," Proc. IEEE Symp. Information Visualization, pp. 227-232, 2003.
11. P. Eades, Q. Feng, X. Lin, and H. Nagamochi, "Straight-line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs," Algorithmica, vol. 44, no. 1, pp. 1-32, 2006. (Pubitemid 43018032)
12. Q. Feng, "Algorithms for Drawing Clustered Graphs," PhD dissertation, Univ. of Newcastle, 1997.
13. R.A. Becker, S.G. Eick, and A.R. Wilks, "Visualizing Network Data," IEEE Trans. Visualization and Computer Graphics, vol. 1, no. 1, pp. 16-28, Mar. 1995.
14. G.W. Furnas, "Generalized Fisheye Views," ACM SIGCHI Bull., vol. 17, no. 4, pp. 16-23, 1986.
15. K. Misue, P. Eades, W. Lai, and K. Sugiyama, "Layout Adjustment and the Mental Map," J. Visual Languages and Computing, vol. 6, no. 2, pp. 183-210, 1995.
16. T.A. Keahey and E.L. Robertson, "Techniques for Non-linear Magnification Transformations," Proc. IEEE Symp. Information Visualization, pp. 38-45, 1996.
17. T.A. Keahey and E.L. Robertson, "Nonlinear Magnification Fields," Proc. IEEE Symp. Information Visualization, pp. 51-58, 1997.
18. G.W. Furnas, "The FISHEYE View: A New Look at Structured Files," Readings in Information Visualization: Using Vision to Think, pp. 312-330, Morgan Kaufmann Publishers, 1999.
19. D. Schaffer, Z. Zuo, S. Greenberg, L. Bartram, J. Dill, S. Dubs, and M. Roseman, "Navigating Hierarchically Clustered Networks through Fisheye and Full-Zoom Methods," ACM Trans. Computer-Human Interaction, vol. 3, no. 2, pp. 162-188, 1996.
20. M. Sarkar and M.H. Brown, "Graphical Fisheye Views of Graphs," Proc. ACM SIGCHI Conf. Human Factors in Computing Systems (CHI), pp. 83-91, 1992.
21. Y.K. Leung and M.D. Apperley, "A Review and Taxonomy of Distortion-Oriented Presentation Techniques," Trans. ACM Computer-Human Interaction, vol. 1, no. 2, pp. 126-160, 1994.
22. N. Wong, S. Carpendale, and S. Greenberg, "Edgelens: An Interactive Method for Managing Edge Congestion in Graphs," Proc. IEEE Symp. Information Visualization, pp. 51-58, 2003.
23. N. Wong and S. Carpendale, "Using Edge Plucking for Interactive Graph Exploration," Proc. IEEE Symp. Information Visualization, 2005.
24. T. Dwyer, K. Marriott, and M. Wybrow, "Topology Preserving Constrained Graph Layout," Proc. Symp. Graph Drawing, pp. 230-241, 2008.
25. M.S.T. Carpendale and X. Rong, "Examining Edge Congestion," Proc. ACM Extended Abstracts on Human Factors in Computing Systems (CHI), pp. 115-116, 2001.
26. M. Dickerson, M.T. Goodrich, and J.Y. Meng, "Confluent Drawings: Visualizing Non-Planar Diagrams in a Planar Way," Proc. Int'l Symp. Graph Drawing, pp. 1-12, 2003. (Pubitemid 38170475)
27. P. Eades and R. Tamassia, "Algorithms for Drawing Graphs: An Annotated Bibliography," technical report, 1988.
28. I. Herman, G. Melancon, and M. Scott Marshall, "Visualiation and Navigation in Information Visualization: A Survey," IEEE Trans. Visualization and Computer Graphics, vol. 6, no. 1, pp. 24-43, Jan.-Mar. 2000. (Pubitemid 30594718)
29. H. Samet, "The Quadtree and Related Hierarchical Data Structures," ACM Computing Surveys, vol. 16, no. 2, pp. 187-260, 1984. (Pubitemid 15421391)
30. J. Barnes and P. Hut, "A Hierarchical O(N Log N) Forcecalculation Algorithm," Nature, vol. 324, no. 6096, pp. 446-449, 1986.
31. H.C. Purchase, "Which Aesthetic Has the Greatest Effect on Human Understanding?," Proc. Int'l Symp. Graph Drawing, pp. 248-261, 1997.
32. C. Ware, H. Purchase, L. Colpoys, and M. McGill, "Cognitive Measurements of Graph Aesthetics," Information Visualization, vol. 1, no. 2, pp. 103-110, 2002.
33. M.E.J. Newman, "Finding Community Structure in Networks Using the Eigenvectors of Matrices," Physical Rev. E, vol. 74, no. 3, p. 036104, 2006.