Rapid Multipole Graph Drawing on the GPU
From MaRDI portal
Recommendations
- Fast multipole methods on graphics processors
- Optimizing the multipole-to-local operator in the fast multipole method for graphical processing units
- The fast multipole method on parallel clusters, multicore processors, and graphics processing units
- Fast evaluation of Helmholtz potential on graphics processing units (GPUs)
Cites work
- scientific article; zbMATH DE number 46317 (Why is no real title available?)
- scientific article; zbMATH DE number 2080097 (Why is no real title available?)
- scientific article; zbMATH DE number 2080098 (Why is no real title available?)
- scientific article; zbMATH DE number 2080101 (Why is no real title available?)
- scientific article; zbMATH DE number 1540682 (Why is no real title available?)
- A multi-dimensional approach to force-directed layouts of large graphs
- An algorithm for drawing general undirected graphs
- Fast multipole methods on graphics processors
- Graph Drawing
- Graph Drawing
- Multidimensional binary search trees used for associative searching
- Scalable parallel formulations of the Barnes--Hut method for n-body simulations
Cited in
(5)- Faster force-directed graph drawing with the well-separated pair decomposition
- A distributed multilevel force-directed algorithm
- Fast multipole methods on graphics processors
- Graph coarsening and clustering on the GPU
- Multipole-Based Force Approximation Revisited – A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree
This page was built for publication: Rapid Multipole Graph Drawing on the GPU
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611842)