This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction
Aug. 2012 (vol. 18 no. 8)
pp. 1330-1342
Chaoli Wang, Dept. of Comput. Sci., Michigan Technol. Univ., Houghton, MI, USA
Kun-Chuan Feng, Dept. of Comput. Sci. & Inf. Eng, Nat. Cheng Kung Univ., Tainan, Taiwan
Han-Wei Shen, Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA
Tong-Yee Lee, Dept. of Comput. Sci. & Inf. Eng, Nat. Cheng Kung Univ., Tainan, Taiwan
We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach utilizes existing graph layout algorithms to produce the initial graph layout, and formulates the problem of generating coherent time-varying graph visualization with the focus+context capability as a specially tailored deformation optimization problem. We adopt the concept of the super graph to maintain spatiotemporal coherence and further balance the needs for aesthetic quality and dynamic stability when interacting with time-varying graphs through focus+context visualization. Our method is particularly useful for multifocus+context visualization of time-varying graphs where we can preserve the mental map by preventing nodes in the focus from undergoing abrupt changes in size and location in the time sequence. Experiments demonstrate that our method strikes a good balance between maintaining spatiotemporal coherence and accentuating visual foci, thus providing a more engaging viewing experience for the users.

[1] U. Brandes, "Drawing on Physical Analogies," Drawing Graphs: Methods and Models, M. Kaufmann and D. Wagner, eds., pp. 71-86, Springer-Verlag, 2001.
[2] U. Brandes and D. Wagner, "A Bayesian Paradigm for Dynamic Graph Layout," Proc. Int'l Symp. Graph Drawing, pp. 236-247, 1997.
[3] J. Branke, "Dynamic Graph Drawing," Drawing Graphs: Methods and Models, M. Kaufmann and D. Wagner, eds., pp. 228-246, Springer-Verlag, 2001.
[4] L. Buatois, G. Caumon, and B. Lévy, "Concurrent Number Cruncher: A GPU Implementation of a General Sparse Linear Solver," Int'l J. Parallel, Emergent and Distributed Systems, vol. 24, no. 3, pp. 205-223, 2009.
[5] S. Diehl and C. Görg, "Graphs, They Are Changing," Proc. Int'l Symp. Graph Drawing, pp. 23-30, 2002.
[6] S. Diehl, C. Görg, and A. Kerren, "Preserving the Mental Map Using Foresighted Layout," Proc. Eurographics - IEEE TCVG Symp. Visualization, pp. 175-184, 2001.
[7] P. Eades, "A Heuristic for Graph Drawing," Congressus Numerantium, vol. 42, pp. 149-160, 1984.
[8] Y. Frishman and A. Tal, "Dynamic Drawing of Clustered Graphs," Proc. IEEE Symp. Information Visualization, pp. 191-198, 2004.
[9] Y. Frishman and A. Tal, "Online Dynamic Graph Drawing," Proc. Eurographics - IEEE VGTC Symp. Visualization, pp. 75-82, 2007.
[10] T.M.J. Fruchterman and E.M. Reingold, "Graph Drawing by Force-Directed Placement," Software—Practice and Experience, vol. 21, no. 11, pp. 1129-1164, 1991.
[11] G.W. Furnas, "Generalized Fisheye Views," ACM SIGCHI Bull., vol. 17, no. 4, pp. 16-23, 1986.
[12] G.W. Furnas, "A Fisheye Follow-Up: Further Reflections on Focus+Context," Proc. ACM SIGCHI Conf. Human Factors in Computing Systems, pp. 999-1008, 2006.
[13] E. Gansner, Y. Koren, and S. North, "Topological Fisheye Views for Visualizing Large Graphs," Proc. IEEE Symp. Information Visualization, pp. 175-182, 2004.
[14] E.R. Gansner and Y. Hu, "Efficient, Proximity-Preserving Node Overlap Removal," J. Graph Algorithms and Applications, vol. 14, no. 1, pp. 53-74, 2010.
[15] E.R. Gansner, Y. Koren, and S. North, "Graph Drawing by Stress Majorization," Proc. Int'l Symp. Graph Drawing, pp. 239-250, 2005.
[16] C. Görg, P. Birke, M. Pohl, and S. Diehl, "Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs," Proc. Int'l Symp. Graph Drawing, pp. 228-238, 2005.
[17] D. Harel and Y. Koren, "Graph Drawing by High-Dimensional Embedding," Proc. Int'l Symp. Graph Drawing, pp. 299-345, 2002.
[18] T. Kamada and S. Kawai, "An Algorithm for Drawing General Undirected Graphs," Information Processing Letters, vol. 31, no. 1, pp. 7-15, 1989.
[19] G. Kumar and M. Garland, "Visual Exploration of Complex Time-Varying Graphs," IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 5, pp. 805-812, Sept. 2006.
[20] 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.
[21] A. Noack, "An Energy Model for Visual Graph Clustering," Proc. Int'l Symp. Graph Drawing, pp. 425-436, 2004.
[22] S.C. North, "Incremental Layout in DynaDAG," Proc. Int'l Symp. Graph Drawing, pp. 409-418, 1996.
[23] H.C. Purchase, E. Hoggan, and C. Görg, "How Important Is the "Mental Map"? - An Empirical Investigation of a Dynamic Graph Layout Algorithm," Proc. Int'l Symp. Graph Drawing, pp. 184-195, 2006.
[24] H.C. Purchase and A. Samra, "Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs," Proc. Int'l Symp. Graph Drawing, pp. 60-73, 2008.
[25] M. Sarkar and M.H. Brown, "Graphical Fisheye Views of Graphs," Proc. ACM SIGCHI Conf. Human Factors in Computing Systems, pp. 83-91, 1992.
[26] M. Sarkar, S.S. Snibbe, O.J. Tversky, and S.P. Reiss, "Stretching the Rubber Sheet: A Metaphor for Viewing Large Layouts on Small Screens," Proc. ACM Symp. User Interface Software and Technology, pp. 81-91, 1993.
[27] J.R. Shewchuk, "Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator," Proc. ACM Workshop Applied Computational Geometry, pp. 203-222, 1996.
[28] C. Wang, H. Yu, and K.-L. Ma, "Importance-Driven Time-Varying Data Visualization," IEEE Trans. Visualization and Computer Graphics, vol. 14, no. 6, pp. 1547-1554, Nov./Dec. 2008.
[29] Y.-S. Wang, H. Fu, O. Sorkine, T.-Y. Lee, and H.-P. Seidel, "Motion-Aware Temporal Coherence for Video Resizing," ACM Trans. Graphics, vol. 28, no. 5, p. 127, 2009.
[30] Y.-S. Wang, T.-Y. Lee, and C.-L. Tai, "Focus+Context Visualization with Distortion Minimization," IEEE Trans. Visualization and Computer Graphics, vol. 14, no. 6, pp. 1731-1738, Nov. 2008.
[31] Y.-S. Wang, C. Wang, T.-Y. Lee, and K.-L. Ma, "Feature-Preserving Volume Data Reduction and Focus+Context Visualization," IEEE Trans. Visualization and Computer Graphics, vol. 17, no. 2, pp. 171-181, Feb. 2011.
[32] S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications. Cambridge Univ. Press, 1994.

Index Terms:
optimisation,graph theory,visual foci,coherent time-varying graph drawing,multifocus+context interaction,spatiotemporal coherence,multifocus+context visualization,graph layout algorithms,coherent time-varying graph visualization,focus+context capability,deformation optimization problem,aesthetic quality,dynamic stability,focus+context visualization,Layout,Visualization,Context,Heuristic algorithms,Coherence,Data visualization,Spatiotemporal phenomena,focus+context visualization.,Graph drawing,time-varying graphs,spatiotemporal coherence
Citation:
Chaoli Wang, Kun-Chuan Feng, Han-Wei Shen, Tong-Yee Lee, "Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction," IEEE Transactions on Visualization and Computer Graphics, vol. 18, no. 8, pp. 1330-1342, Aug. 2012, doi:10.1109/TVCG.2011.128
Usage of this product signifies your acceptance of the Terms of Use.