Ball Trees
Ball Trees is a space-partitioning tree data structure that organizes points in a metric space by recursively dividing them into nested balls, where each node represents a ball containing all points in its subtree and splits the space based on a selected pivot and median distance.
8
Publications
857
Citations
21
Authors
10
Institutions
Publications per year
2017–2026
1
8
1–5 of 8
21
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 21
10
Yahoo (United States)
Sunnyvale, United States
1 h-index
1 publications
242 citations
Shandong Academy of Sciences
Jinan, China
1 h-index
1 publications
39 citations
Laboratoire d'Informatique de Paris-Nord
Villetaneuse, France
1 h-index
3 publications
126 citations

Fuzhou University
Fuzhou, China
1 h-index
5 publications
195 citations
Carnegie Mellon University
Pittsburgh, United States
1 h-index
3 publications
126 citations
Laboratoire d'Informatique, Signaux et Systèmes de Sophia Antipolis
Valbonne, France
1 h-index
2 publications
54 citations
University of California, Los Angeles
Los Angeles, United States
1 h-index
1 publications
242 citations
The University of Texas at Austin
Austin, United States
1 h-index
3 publications
66 citations
1–8 of 10
1 publications · 10 citations
1
h-index
1 publications · 59 citations
1
h-index
1 publications · 39 citations
1
h-index
1–3