An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Applications of graph drawing to software engineering (abstract)
ACM SIGACT News
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
A performance study of cosmological simulations on message-passing and shared-memory multiprocessors
ICS '96 Proceedings of the 10th international conference on Supercomputing
Multidimensional binary search trees used for associative searching
Communications of the ACM
Analyzing the error bounds of multipole-based treecodes
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Truly distribution-independent algorithms for the N-body problem
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Scalable parallel formulations of the barnes-hut method for n-body simulations
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
A Fast Multi-scale Method for Drawing Large Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
GRIP: Graph dRawing with Intelligent Placement
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Multilevel Algorithm for Force-Directed 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
The rapid evaluation of potential fields in particle systems
The rapid evaluation of potential fields in particle systems
A multi-dimensional approach to force-directed layouts of large graphs
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation (Gpu Gems)
KD-tree acceleration structures for a GPU raytracer
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Fast GPU ray tracing of dynamic meshes using geometry images
GI '06 Proceedings of Graphics Interface 2006
Scan primitives for GPU computing
Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Multi-Level Graph Layout on the GPU
IEEE Transactions on Visualization and Computer Graphics
Fast multipole methods on graphics processors
Journal of Computational Physics
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
An experimental evaluation of multilevel layout methods
GD'10 Proceedings of the 18th international conference on Graph drawing
HD-GraphViz: highly distributed graph visualization on tiled displays
Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
| Hi-index | 0.00 |
As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the computationally expensive task of drawing large graphs. This paper describes a new parallel analysis of the multipole method of graph drawing to support its efficient GPU implementation. We use a variation of the Fast Multipole Method to estimate the long distance repulsive forces in force directed layout. We support these multipole computations efficiently with a k-d tree constructed and traversed on the GPU. The algorithm achieves impressive speedup over previous CPU and GPU methods, drawing graphs with hundreds of thousands of vertices within a few seconds via CUDA on an NVIDIA GeForce 8800 GTX.