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

Purchase, Helen C.; Hoggan, Eve; Görg, Carsten

doi:10.1007/978-3-540-70904-6_19

Cited by 123 publications

(81 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A number of dynamic graph drawing algorithms have looked at effective ways of preserving the mental map [16,8,7,9,14,11,13,5], and various experiments have investigated the effect of preserving the mental map [17,20,18,1].…”

Section: Dynamic Graph Drawing and The Mental Mapmentioning

confidence: 99%

Difference Map Readability for Dynamic Graphs

2011

Self Cite

View full text Add to dashboard Cite

Abstract. Difference maps are one way to show changes between timeslices in a dynamic graph. They highlight, using colour, the nodes and edges that were added, removed, or persisted between every pair of adjacent timeslices. Although some work has used difference maps for visualization, no user study has been performed to gauge their performance. In this paper, we present a user study to evaluate the effectiveness of difference maps in comparison with presenting the evolution of the dynamic graph over time on three interfaces. We found evidence that difference maps produced significantly fewer errors when determining the number of edges inserted or removed from a graph as it evolves over time. Also, difference maps were significantly preferred on all tasks.

show abstract

Section: Dynamic Graph Drawing and The Mental Mapmentioning

confidence: 99%

Difference Map Readability for Dynamic Graphs

2011

Self Cite

View full text Add to dashboard Cite

show abstract

“…Misue et al [20] described three mental map models, i.e., the orthogonal order, proximity, and topology models, that measure the extent by which the graphical attributes have been changed due to a layout adjustment. While two empirical analyses on the mental map by Purchase et al [23], [24] lead to somewhat contradictory suggestions, we consider that maintaining the mental map and allowing the user to fine tune the degree of mental map preservation are essential. Naïvely applying a static graph layout algorithm to graphs of individual time steps often fails to preserve the mental map well, which makes it difficult for the viewers to track the evolution of graphs.…”

Section: B Layout Algorithms For Dynamic Graphsmentioning

confidence: 92%

Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction

Feng

Wang

Shen

et al. 2012

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Abstract-We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach utilizes existing graph layout algorithms to produce the initial graph layout, and formulates the problem of generating coherent time-varying graph visualization with the focus+context capability as a specially-tailored deformation optimization problem. We adopt the concept of the super graph to maintain spatiotemporal coherence and further balance the needs for aesthetic quality and dynamic stability when interacting with time-varying graphs through focus+context visualization. Our method is particularly useful for multifocus+context visualization of time-varying graphs where we can preserve the mental map by preventing nodes in the focus from undergoing abrupt changes in size and location in the time sequence. Experiments demonstrate that our method strikes a good balance between maintaining spatiotemporal coherence and accentuating visual foci, thus providing a more engaging viewing experience for the users.

show abstract

“…The approach is best suited for layout refinement, which starts with an initial layout and performs minor changes to improve it while still preserving the "mental map" [2] of the original layout. Algorithm.…”

Section: Methodsmentioning

confidence: 99%

Visual Specification of Layout

2009

View full text Add to dashboard Cite

Abstract.We give an overview of a drawing approach that combines the concepts constraint satisfaction, attribute evaluation and transformation. The approach is tailored to an editor for visual languages, which supports structured editing as well as free-hand editing. In this paper, we focus on the visual specification of such a layout algorithm. As a running example, deterministic finite automata are used.

show abstract

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

Cited by 123 publications

References 7 publications

Difference Map Readability for Dynamic Graphs

Difference Map Readability for Dynamic Graphs

Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction

Visual Specification of Layout

Contact Info

Product

Resources

About