1. [Publications](/publications)
2. Rapid Multipole Graph Drawing on the GPU
 
 # Rapid Multipole Graph Drawing on the GPU

  ![](/sites/default/files/styles/wide/public/pubs/2008-09_Rapid-Multipole-Graph/default.jpg?itok=SWCkB-tW)

 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.



 ## Authors



Apeksha Godiyal (UIUC)

Jared Hoberock (UIUC)

[Michael Garland](/person/michael-garland)

John C. Hart (UIUC)

 

 

 ## Publication Date



Monday, September 1, 2008

 

 ## Published in



[Proc. Graph Drawing 2008](http://www.ics.forth.gr/gd2008/)

 

 ## Research Area



[Algorithms and Numerical Methods](/research-area/algorithms)

[Computer Graphics](/research-area/computer-graphics)

 

 

 ## External Links



[Paper (SpringerLink)](http://dx.doi.org/10.1007/978-3-642-00219-9_10)