Mental map preserving graph drawing using simulated annealing

Visualizing graphs has been studied extensively in the community of graph drawing and information visualization over the years. In some applications, the user is required to interact with a graph by making slight changes to the underlying graph structure. To visualize graphs in such an interactive environment, it is desirable that the differences between the displays of the original and the modified graphs be kept minimal, allowing the user to comprehend the changes in the graph structure faster. As the mental map concept refers to the presentation of a person's mind while exploring visual information, the better the mental map is preserved, the easier the structure change of a graph is understood. It is somewhat surprising that preserving the user's mental map has largely been ignored in the graph drawing community in the past. We propose an effective mental-map-preserving graph drawing algorithm for straight-line drawings of general undirected graphs based on the simulated-annealing technique. Our experimental results and questionnaire analysis suggest this new approach to be promising.

[1]  Ulrik Brandes,et al.  An Experimental Study on Distance-Based Graph Drawing , 2009, GD.

[2]  Alan M. MacEachren,et al.  How Maps Work - Representation, Visualization, and Design , 1995 .

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  N Mendonca,et al.  A layout system for information system diagrams , 1994 .

[5]  Ioannis G. Tollis,et al.  A Framework for Circular Drawings of Networks , 1999, GD.

[6]  Hausi A. Müller,et al.  Graph Layout Adjustment Strategies , 1995, GD.

[7]  Timo Poranen,et al.  A simulated annealing algorithm for determining the thickness of a graph , 2005, Inf. Sci..

[8]  I. Thornton,et al.  Change Detection Without Awareness: Do Explicit Reports Underestimate the Representation of Change in the Visual System? , 2000 .

[9]  Rmk Fox,et al.  Enhancing Learning Through Technology , 2007 .

[10]  Michael Kaufmann,et al.  Drawing graphs: methods and models , 2001 .

[11]  Ronald A. Rensink.  Change detection. , 2002, Annual review of psychology.

[12]  Helen C. Purchase,et al.  Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.

[13]  Helen C. Purchase,et al.  Metrics for Graph Drawing Aesthetics , 2002, J. Vis. Lang. Comput..

[14]  Jin Xu,et al.  A simple simulated annealing algorithm for the maximum clique problem , 2007, Inf. Sci..

[15]  Helen C. Purchase,et al.  The 'Mental Map' versus 'Static Aesthetic' Compromise in Dynamic Graphs : A User Study , 2008, AUIC.

[16]  D. Simons,et al.  Do New Objects Capture Attention? , 2005, Psychological science.

[17]  Junbin Gao,et al.  A new algorithm for removing node overlapping in graph visualization , 2007, Inf. Sci..

[18]  Ulrik Brandes,et al.  On the Hardness of Orthogonal-Order Preserving Graph Drawing , 2009, GD.

[19]  David Harel,et al.  Randomized graph drawing with heavy-duty preprocessing , 1994, AVI '94.

[20]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[21]  Walter F. Tichy,et al.  Edge: An extendible graph editor , 1990, Softw. Pract. Exp..

[22]  Stephen C. North,et al.  Incremental Layout in DynaDAG , 1995, GD.

[23]  Frances Paulisch,et al.  Using constraints to achieve stability in automatic graph layout algorithms , 1990, CHI '90.

[24]  Michael Kaufmann,et al.  Maintaining the Mental Map for Circular Drawings , 2002, GD.

[25]  Vincent Tam,et al.  INTELLIGENT VISUALIZATION TECHNIQUES FOR REUSABLE LEARNING OBJECTS TO FACILITATE AN ONLINE LEARNING ENVIRONMENT , 2006 .

[26]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[27]  Ugur Dogrusöz,et al.  A layout algorithm for signaling pathways , 2006, Inf. Sci..

[28]  Eve E. Hoggan,et al.  How Important Is the "Mental Map"? - An Empirical Investigation of a Dynamic Graph Layout Algorithm , 2006, GD.

[29]  David G. Stork,et al.  Pattern Classification , 1973 .

[30]  Ioannis G. Tollis,et al.  On labeling in graph visualization , 2007, Inf. Sci..

[31]  Ayellet Tal,et al.  Online Dynamic Graph Drawing , 2008, IEEE Transactions on Visualization and Computer Graphics.

[32]  Emek Demir,et al.  A layout algorithm for undirected compound graphs , 2009, Inf. Sci..

[33]  Kim Marriott,et al.  Constrained Graph Layout , 1996, Constraints.

[34]  Kozo Sugiyama,et al.  Layout Adjustment and the Mental Map , 1995, J. Vis. Lang. Comput..

[35]  Ayellet Tal,et al.  MOVIS: A system for visualizing distributed mobile object environments , 2008, J. Vis. Lang. Comput..

[36]  Ronald A. Rensink,et al.  Obscuring length changes during animated motion , 2004, SIGGRAPH 2004.

[37]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[38]  Helen C. Purchase,et al.  Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs , 2008, Diagrams.

[39]  Shigeo Abe DrEng.  Pattern Classification , 2001, Springer London.

[40]  Helen C. Purchase,et al.  Performance of Layout Algorithms: Comprehension, not Computation , 1998, J. Vis. Lang. Comput..