SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
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
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Low-Level Components of Analytic Activity in Information Visualization
INFOVIS '05 Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization
Dust & magnet: multivariate information visualization using a magnet metaphor
Information Visualization
Task taxonomy for graph visualization
Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization
NodeTrix: a Hybrid Visualization of Social Networks
IEEE Transactions on Visualization and Computer Graphics
Multi-Level Graph Layout on the GPU
IEEE Transactions on Visualization and Computer Graphics
Energy-based clustering of graphs with nonuniform degrees
GD'05 Proceedings of the 13th international conference on Graph Drawing
Towards automated analysis and visualization of distributed software systems
Proceedings of the 5th international symposium on Software visualization
Interactive analysis of Likert scale data using a multichart visualization tool
Proceedings of the 10th Brazilian Symposium on on Human Factors in Computing Systems and the 5th Latin American Conference on Human-Computer Interaction
Hi-index | 0.00 |
This paper presents an interactive physics-based technique for the exploration and dynamic reorganization of graph layouts that takes into account semantic properties which the user might need to emphasize. Many techniques have been proposed that take a graph as input and produce a visualization solely based on its topology, seldom ever relying on the semantic attributes of nodes and edges. These automatic topology-based algorithms might generate aesthetically interesting layouts, but they neglect information that might be important for the user. Among these are the force-directed or energy minimization algorithms, which use physics analogies to produce satisfactory layouts. They consist of applying forces on the nodes, which move until the physical system enters a state of mechanical equilibrium. We propose an extension of this metaphor to include tools for the interactive manipulation of such layouts. These tools are comprised of magnets, which attract nodes with user-specified criteria to the regions surrounding the magnets. Magnets can be nested and also used to intuitively perform set operations such as union and intersection, becoming thus an intuitive visual tool for sorting through the datasets. To evaluate the technique we discuss how they can be used to perform common graph visualization tasks.