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

Authors

62

  1. LV
    Laurens van der Maaten

    Delft University of Technology, Netherlands

    3 publications · 2.5K citations

    3

    h-index

  2. RG
    Robert Gove

    University of Maryland, College Park, United States

    2 publications · 26 citations

    2

    h-index

  3. AG
    Ananth Grama

    Purdue University West Lafayette, United States

    2 publications · 41 citations

    2

    h-index

  4. AS
    Ahmed Sameh

    Purdue University West Lafayette, United States

    2 publications · 41 citations

    2

    h-index

  5. JM
    Junichiro Makino

    The University of Tokyo, Japan

    2 publications · 72 citations

    2

    h-index

1–5 of 62

Venues

  1. SIAM Journal on Scientific Computing

    2 publications · 32 citations

    2

    h-index

  2. arXiv (Cornell University)

    Repository · 2 publications · 78 citations

    2

    h-index

  3. ACM Journal on Emerging Technologies in Computing Systems

    JETC · 1 publications · 13 citations

    1

    h-index

  4. 1

    h-index

  5. IEEE Transactions on Plasma Science

    1 publications · 11 citations

    1

    h-index

1–5