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)
Multidimensional binary search trees used for associative searching
Communications of the ACM
JIGGLE: Java Interactive Graph Layout Environment
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
TopicNets: Visual Analysis of Large Text Corpora with Topic Modeling
ACM Transactions on Intelligent Systems and Technology (TIST)
Fast edge-routing for large graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Layout with circular and other non-linear constraints using procrustes projection
GD'09 Proceedings of the 17th international conference on Graph Drawing
Scalable, versatile and simple constrained graph layout
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
Most force-directed graph drawing algorithms depend for speed crucially on efficient methods for approximating repulsive forces between a large number of particles. A combination of various tree data structures and multi-pole approximations has been successfully used by a number of authors. If a multi-level approach is taken, in the late (and due to the large number of particles computationally intensive) steps, movements of particles are quite limited. We utilize this fact by basing force-calculations on an easy updatable tree data structure. Using explicit distance checks instead of relying on implicit guarantees provided by quadtrees and avoiding local expansions of the multi-pole expansion leads to a very simple implementation that is faster than comparable earlier methods. The latter claim is supported by experimental results.