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. © 2008 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Purchase, H. C., & Samra, A. (2008). Extremes are better: Investigating mental map preservation in dynamic graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5223 LNAI, pp. 60–73). https://doi.org/10.1007/978-3-540-87730-1_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.