An algorithm for drawing general undirected graphs
Information Processing Letters
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
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Visualizing Document Space by Force-directed Dynamic Layout
VL '97 Proceedings of the 1997 IEEE Symposium on Visual Languages (VL '97)
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
An extended high-dimensional method for interactive graph drawing
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Propositional Logic Constraint Patterns and Their Use in UML-Based Conceptual Modeling and Analysis
IEEE Transactions on Knowledge and Data Engineering
An Interactive Large Graph Visualizer
SG '08 Proceedings of the 9th international symposium on Smart Graphics
Graph drawing by classical multidimensional scaling: new perspectives
GD'12 Proceedings of the 20th international conference on Graph Drawing
Hi-index | 0.00 |
Graph layout is an information visualization technology for illustrating relations between objects. Interactive graph layout is often important since it is difficult to statically lay out complex graphs such as general undirected graphs. In this paper, we propose a novel approach to interactive layout of general undirected graphs. The basic idea of our approach is to use static graph layouts in high-dimensional spaces to dynamically find two-dimensional layouts according to user interaction. The resulting method that we present exhibits the following two characteristics: (1) it efficiently updates two-dimensional graph layouts during user interaction; (2) it follows users' node dragging operations by actively moving other closely related nodes. Our method adopts eigenvector-based multidimensional scaling to compute high-dimensional graph layouts, and performs constraint satisfaction to determine appropriate two-dimensional planes onto which the high-dimensional layouts will be projected.