How Important Is the “Mental Map”? – An Empirical Investigation of a Dynamic Graph Layout Algorithm

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4372)


While some research has been performed on the human understanding of static graph layout algorithms, dynamic graph layout algorithms have only recently been developed sufficiently to enable similar investigations. This paper presents the first empirical analysis of a dynamic graph layout algorithm, focusing on the assumption that maintaining the “mental map” between time-slices assists with the comprehension of the evolving graph. The results confirm this assumption with respect to some categories of tasks.


Mental Model Average Response Time Dynamic Graph Response Time Data Graph Drawing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Brandes, U., Corman, S.R.: Visual unrolling of network evolution and the analysis of dynamic discourse. In: INFOVIS ’02: Proceedings of the IEEE Symposium on Information Visualization (InfoVis’02), Washington, DC, USA, p. 145. IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
  2. 2.
    Coleman, M.K., Parker, D.S.: Aesthetics-based graph layout for human consumption. Softw. Pract. Exper. 26(12), 1415–1438 (1996)CrossRefGoogle Scholar
  3. 3.
    Collberg, C., Kobourov, S., Nagra, J., Pitts, J., Wampler, K.: A system for graph-based visualization of the evolution of software. In: SoftVis ’03: Proceedings of the 2003 ACM symposium on Software visualization, San Diego, California, p. 77. ACM Press, New York (2003), doi:10.1145/774833.774844CrossRefGoogle Scholar
  4. 4.
    Diehl, S., Görg, C.: Graphs, they are changing – dynamic graph drawing for a sequence of graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 23–30. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Erten, C., Harding, P.J., Kobourov, S.G., Wampler, K., Yee, G.V.: Graphael: Graph animations with evolving layouts. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 98–110. Springer, Heidelberg (2004)Google Scholar
  6. 6.
    Görg, C., Birke, P., Pohl, M., Diehl, S.: Dynamic graph drawing of sequences of orthogonal and hierarchical graphs. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 228–238. Springer, Heidelberg (2005)Google Scholar
  7. 7.
    Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interacting with Computers 13(2), 147–162 (2000)CrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  1. 1.Department of Computing Science, University of Glasgow, GlasgowUK
  2. 2.College of Computing, Georgia Institute of Technology, AtlantaUSA

Personalised recommendations