Kd-trees

KD-Trees is a space-partitioning data structure that recursively divides k-dimensional space into axis-aligned hyperrectangular regions through alternating coordinate-axis splits at each level of the binary tree.

182

Publications

15.4K

Citations

457

Authors

219

Institutions

Publications per year

2017–2026

45

Authors

457

  1. AM
    Andrew Moore

    Carnegie Mellon University, United States

    5 publications · 658 citations

    5

    h-index

  2. JP
    Jingliang Peng

    Shandong University, China

    4 publications · 229 citations

    4

    h-index

  3. CJ
    C.‐C. Jay Kuo

    University of Southern California, United States

    4 publications · 229 citations

    4

    h-index

  4. IW
    Ingo Wald

    University of Utah, United States

    3 publications · 354 citations

    3

    h-index

  5. GD
    Guozhu Dong

    Wright State University, United States

    2 publications · 257 citations

    2

    h-index

1–5 of 457

Venues

  1. Information Processing Letters

    6 publications · 117 citations

    6

    h-index

  2. Discrete Applied Mathematics

    5 publications · 139 citations

    5

    h-index

  3. Theoretical Computer Science

    4 publications · 1.2K citations

    4

    h-index

  4. arXiv (Cornell University)

    Repository · 4 publications · 87 citations

    4

    h-index

  5. Discrete Mathematics

    4 publications · 406 citations

    4

    h-index

1–5