Barnes-hut Approximation
Barnes-Hut Approximation is a computational method in force-directed graph layout algorithms that approximates long-range forces by hierarchically clustering distant nodes using a spatial tree structure, thereby reducing the time complexity of force calculations from quadratic to logarithmic scale.
24
Publications
3.4K
Citations
62
Authors
31
Institutions
Publications per year
2017–2026
6
Parents
24
Accelerating t-SNE using tree-based algorithms
Laurens van der Maaten · 2014 · 2.4K citations
Tina Smets, Nico Verbeeck, Marc Claesen et al. · Analytical Chemistry · 2019 · 118 citations · Full text
Laurens van der Maaten · arXiv (Cornell University) · 2013 · 61 citations · Full text
1–5 of 24
62
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 62
31
The University of Tokyo
Tokyo, Japan
3 h-index
3 publications
106 citations

Delft University of Technology
Delft, The Netherlands
3 h-index
3 publications
2.5K citations
RIKEN
Wako, Japan
2 h-index
4 publications
128 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
5 publications
92 citations
Forschungszentrum Jülich
Jülich, Germany
2 h-index
5 publications
295 citations
Texas A&M University
College Station, United States
1 h-index
2 publications
36 citations
Fahrenheit (Germany)
Munich, Germany
1 h-index
1 publications
118 citations
RIKEN Center for Integrative Medical Sciences
Yokohama, Japan
1 h-index
3 publications
102 citations
1–8 of 31
2 publications · 32 citations
2
h-index
Repository · 2 publications · 78 citations
2
h-index
JETC · 1 publications · 13 citations
1
h-index
1 publications · 58 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5