Multipole-Based Force Approximation Revisited – A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree

DOI10.1007/978-3-540-70904-6_4zbMATH Open1185.68487OpenAlexW1538724667MaRDI QIDQ3595464FDOQ3595464

Authors: Ulrich Lauther 

Publication date: 28 August 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_4

Recommendations

• Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
• scientific article; zbMATH DE number 2080097
• Faster force-directed graph drawing with the well-separated pair decomposition
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• Rapid Multipole Graph Drawing on the GPU

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (1)

• A graph-based N-body approximation with application to stochastic neighbor embedding

This page was built for publication: Multipole-Based Force Approximation Revisited – A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595464)