Rapid Multipole Graph Drawing on the GPU
University of Illinois
Graph Drawing, Lecture Notes in Computer Science, 2009, Volume 5417/2009, 90-101
@conference{godiyal2009rapid,
title={Rapid multipole graph drawing on the gpu},
author={Godiyal, A. and Hoberock, J. and Garland, M. and Hart, J.},
booktitle={Graph Drawing},
pages={90–101},
year={2009},
organization={Springer}
}
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.
December 22, 2010 by hgpu
