Rapid multipole graph drawing on the GPU

Apeksha Godiyal, Jared Hoberock, Michael Garland, John C. Hart

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationGraph Drawing - 16th International Symposium, GD 2008, Revised Papers
Number of pages12
ISBN (Print)3642002188, 9783642002182
StatePublished - 2009
Event16th International Symposium on Graph Drawing, GD 2008 - Heraklion, Crete, Greece
Duration: Sep 21 2008Sep 24 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5417 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other16th International Symposium on Graph Drawing, GD 2008
CityHeraklion, Crete

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Cite this