Abstract
Research on effective algorithms for efficient graph layout continues apace, and faster technology has led to increasing research on algorithms for the depiction of dynamic graphs which represent changing relational information over time. Like the static layout algorithms that preceded these, empirical work lags behind their design, and assumptions are made about how users’ comprehension may be enhanced without human data to support them. This paper presents an experiment investigating an existing dynamic layout algorithm, focusing on the effect of the preservation of the mental map on comprehension. The results indicate that extremes produce better performance, suggesting that individual preference may be important.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brandes, U., Corman, S.R.: Visual unrolling of network evolution and the analysis of dynamic discourse. Information Visualization 2(1), 40–50 (2003)
Branke, J.: Dynamic Graph Drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 228–246. Springer, Heidelberg (2001)
Coleman, M.K., Stott Parker, D.: Aesthetics-based graph layout for human consumption. Software Practice and Experience 26(12), 1415–1438 (1996)
Collberg, C., Kobourov, S., Nagra, J., Pitts, J., Wampler, K.: A system for graph-based visualization of the evolution of software. In: Proceedings of the ACM symposium on Software Visualization, pp. 77–86. ACM Press, New York (2003)
Dempster, L.M.: Information Visualisation: Dynamic graph layout with GDG. Unpublished Computing Science Honours project, Department of Computing Science, University of Glasgow (2006)
Diehl, S., Görg, C.: Graphs, they are changing. In: Proceedings of Graph Drawing 2002. LNCS, vol. 2538, pp. 23–30. Springer, Heidelberg (2002)
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)
Forrester, D., Kobourov, S.G., Navabi, A., Wampler, K., Yee, G.V.: Graphael: A System for Generalized Force-Directed Layouts. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 454–464. Springer, Heidelberg (2005)
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)
Lee, Y., Lin, C., Yen, H.: Mental Map Preserving Graph Drawing Using Simulated Annealing. In: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation, pp. 179–188. Australian Computer Society (2006)
Purchase, H.C., Görg, C., Hoggan, E.: How Important is the "Mental Map"? - an Empirical Investigation of a Dynamic Graph Layout Algorithm. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 184–195. Springer, Heidelberg (2007)
Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interacting with Computers 13(2), 147–162 (2000)
Saffrey, P., Purchase, H.C.: The "Mental Map" versus "Static Aesthetic" Compromise in Dynamic Graphs: A User Study. In: Proceedings of 9th Australasian User Interface Conference, pp. 85-93 (2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Purchase, H.C., Samra, A. (2008). Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs. In: Stapleton, G., Howse, J., Lee, J. (eds) Diagrammatic Representation and Inference. Diagrams 2008. Lecture Notes in Computer Science(), vol 5223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87730-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-87730-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87729-5
Online ISBN: 978-3-540-87730-1
eBook Packages: Computer ScienceComputer Science (R0)