EDGE: an extendable graph editor
Software—Practice & Experience - Unix tools
Using constraints to achieve stability in automatic graph layout algorithms
CHI '90 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Constraints
GD '95 Proceedings of the Symposium on Graph Drawing
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Maintaining the Mental Map for Circular Drawings
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
On labeling in graph visualization
Information Sciences: an International Journal
A new algorithm for removing node overlapping in graph visualization
Information Sciences: an International Journal
MOVIS: A system for visualizing distributed mobile object environments
Journal of Visual Languages and Computing
IEEE Transactions on Visualization and Computer Graphics
The "mental map" versus "static aesthetic" compromise in dynamic graphs: a user study
AUIC '08 Proceedings of the ninth conference on Australasian user interface - Volume 76
Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs
Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
A layout algorithm for undirected compound graphs
Information Sciences: an International Journal
A simulated annealing algorithm for determining the thickness of a graph
Information Sciences: an International Journal
A layout algorithm for signaling pathways
Information Sciences: an International Journal
How important is the "Mental map"?: an empirical investigation of a dynamic graph layout algorithm
GD'06 Proceedings of the 14th international conference on Graph drawing
Hi-index | 0.07 |
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 the mental 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.