CHI '86 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Graph drawing by force-directed placement
Software—Practice & Experience
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Communications of the ACM
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
How to Draw a Planar Clustered Graph
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Fast Interactive 3-D Graph Visualization
GD '95 Proceedings of the Symposium on Graph Drawing
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
GRIP: Graph dRawing with Intelligent Placement
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Simple Algorithm for Drawing Large Graphs on Small Screens
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A Multi-Scale Algorithm for Drawing Graphs Nicely
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
A Fast Multi-Scale Method for Drawing Large Graphs
A Fast Multi-Scale Method for Drawing Large Graphs
GRIP: Graph dRawing with Intelligent Placement
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
JSNVA: A Java Straight-Line Drawing Framework for Network Visual Analysis
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Human-centered visualization environments
Human-centered visualization environments
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Energy-based clustering of graphs with nonuniform degrees
GD'05 Proceedings of the 13th international conference on Graph Drawing
Graph drawing by stress majorization
GD'04 Proceedings of the 12th international conference on Graph Drawing
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
Visualisation and analysis of large and complex scale-free networks
EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization
Graph drawing by subspace optimization
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
Graph drawing by classical multidimensional scaling: new perspectives
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higher-dimensional embedding into a two or three dimensional subspace of E. Projecting high-dimensional drawings onto two or three dimensions often results in drawings that are "smoother" and more symmetric. Among the other notable features of our approach are the utilization of a maximal independent set filtration of the set of vertices of a graph, a fast energy function minimization strategy, efficient memory management, and an intelligent initial placement of vertices. Our implementation of the algorithm can draw graphs with tens of thousands of vertices using a negligible amount of memory in less than one minute on a mid-range PC.