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

Authors

21

  1. PP
    Paolo Piro

    Université Côte d'Azur, France

    1 publications · 27 citations

    1

    h-index

  2. AG
    Alexander Gray

    Georgia Institute of Technology, United States

    1 publications · 42 citations

    1

    h-index

  3. AM
    Andrew Moore

    Carnegie Mellon University, United States

    1 publications · 42 citations

    1

    h-index

  4. KQ
    Kilian Q. Weinberger

    Cornell University, United States

    1 publications · 242 citations

    1

    h-index

  5. LK
    Lawrence K. Saul

    University of California San Diego, United States

    1 publications · 242 citations

    1

    h-index

1–5 of 21

Venues

  1. American Scientist

    1 publications · 10 citations

    1

    h-index

  2. Memoirs of the American Mathematical Society

    1 publications · 59 citations

    1

    h-index

  3. Knowledge-Based Systems

    1 publications · 39 citations

    1

    h-index

1–3