Mental map preserving graph drawing using simulated annealing
نویسندگان
چکیده
Visualizing graphs has been studied extensively in the community of graph drawing and information visualization over the years. In some applications, the user is required to interact with a graph by making slight changes to the underlying graph structure. To visualize graphs in such an interactive environment, it is desirable that the differences between the displays of the original and the modified graphs be kept minimal, allowing the user to comprehend the changes in the graph structure faster. As themental map concept refers to the presentation of a person’s mind while exploring visual information, the better the mental map is preserved, the easier the structure change of a graph is understood. It is somewhat surprising that preserving the user’s mental map has largely been ignored in the graph drawing community in the past. We propose an effective mental-map-preserving graph drawing algorithm for straight-line drawings of general undirected graphs based on the simulated-annealing technique. Our experimental results and questionnaire analysis suggest this new approach to be promising.
منابع مشابه
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a clustering which satisfies the conditions for compound-planarity (c-planarity). Using the clustering, we obtain a representation of the graph as a collection of O(logn) layers, where each succeeding layer represents t...
متن کاملDynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs
In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parameterized to trade layout quality for dynamic stability. In particular, we had to develop new metrics which work upon the intermediate results of layout phases. We discuss some properties of the resulting animations by means of e...
متن کاملDifference Metrics for Interactive Orthogonal Graph Drawing Algorithms
Abstract Preserving the “mental map” is a major goal of interactive graph drawing algorithms. Several models have been proposed for formalizing the notion of mental map. Additional work needs to be done to formulate and validate “difference” metrics which can be used in practice. This paper introduces a framework for defining and validating metrics to measure the difference between two drawings...
متن کامل3D Graph Drawing with Simulated Annealing
A recent trend in graph drawing is directed to the visualiza-tion of graphs in 3D 1, 5, 6]. A promising research direction concerns the extension of proven 2D techniques to 3D. We present a system extending the simulated annealing algorithm of Davidson and Harel 2] for straight-line two-dimensional drawings of general undirected graphs to three dimensions. This system features an advanced 3D us...
متن کاملCOMAIDE: Information Visualization using Cooperative 3D Diagram Layout
COMAIDE is a toolkit for user-system cooperation through joint multi-focal graph browsing. It supports cooperative force-directed layout management, concurrent with dialogue handling, for heterogeneous multi-layered 3D interactive diagrams. The layout manager's intu-itively`natural' animations of multi-layered 3D graph drawings support: 1. Cooperative tidying of user-manipulable 3D layout; 2. O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006