Rapid Multipole Graph Drawing on the GPU

Godiyal, Apeksha and Hoberock, Jared and Garland, Michael and Hart, John C. (2009) Rapid Multipole Graph Drawing on the GPU. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 90-101(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_10).

Full text not available from this repository.

Abstract

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.

Item Type:	Conference Paper
Additional Information:	10.1007/978-3-642-00219-9_10
Classifications:	M Methods > M.400 Force-directed / Energy-based P Styles > P.720 Straight-line G Algorithms and Complexity > G.560 Geometry
URI:	http://gdea.informatik.uni-koeln.de/id/eprint/899

Actions (login required)

View Item