First we introduce the concept of graph animations as a sequence of evolving graphs and a generic algorithm which computes a Foresighted Layout for dynamically drawing these graphs while preserving the mental map. The algorithm is generic in the sense that it takes a static graph drawing algorithm as a parameter. In other words, trees can be animated with a static tree layouter, graphs with a static Sugiyama-style layouter or a spring embedder, etc. Second we discuss applications of Foresighted Layout in algorithm animation and visualization of navigation behaviour.
CITATION STYLE
Diehl, S., Görg, C., & Kerren, A. (2001). Preserving the Mental Map using Foresighted Layout (pp. 175–184). https://doi.org/10.1007/978-3-7091-6215-6_19
Mendeley helps you to discover research relevant for your work.