Rapid Multipole Graph Drawing on the GPU

DOI10.1007/978-3-642-00219-9_10zbMath1213.68451OpenAlexW1595997489MaRDI QIDQ3611842

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

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_10

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

A Distributed Multilevel Force-Directed Algorithm ⋮ Faster force-directed graph drawing with the well-separated pair decomposition

Uses Software

• CUDA
• GRIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast multipole methods on graphics processors
• Scalable parallel formulations of the Barnes--Hut method for n-body simulations
• An algorithm for drawing general undirected graphs
• A multi-dimensional approach to force-directed layouts of large graphs
• Multidimensional binary search trees used for associative searching
• Graph Drawing
• Graph Drawing

This page was built for publication: Rapid Multipole Graph Drawing on the GPU