An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs: methods and models
Drawing graphs: methods and models
Drawing clusters and hierarchies
Drawing graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
NP-Completness Results for Minimum Planar Spanners
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
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
UberFlow: a GPU-based particle engine
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
ASK-GraphView: A Large Scale Graph Visualization System
IEEE Transactions on Visualization and Computer Graphics
Balancing Systematic and Flexible Exploration of Social Networks
IEEE Transactions on Visualization and Computer Graphics
GPU-Based Interactive Visualization Techniques (Mathematics and Visualization)
GPU-Based Interactive Visualization Techniques (Mathematics and Visualization)
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th 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
| Hi-index | 0.00 |
This paper introduces an approach aimed at improving computation time for spring embedders in a context of graph visualization. The approach relies on recent developments in the utilization of graphic processor units (GPU) for generic numerical computation. We show how a GPU can greatly improve computation time, hence opening many previously unattainable possibilities in terms of interactive applications. Our method has been implemented in software used for benchmarks demonstrating large performance gain.