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
Variants
K-d TreesK-dimensional Trees
182
Andrea Vedaldi, Brian Fulkerson · 2010 · 2.7K citations
Optimised KD-trees for fast image descriptor matching
Chanop Silpa-Anan, Richard Hartley · 2008 · 678 citations
An efficient k-means clustering algorithm
Khaled Alsabti, Sanjay Ranka, Vineet Kumar Singh · 1997 · 494 citations · Full text
1–5 of 182
457
5
h-index
4
h-index
4
h-index
3
h-index
2
h-index
1–5 of 457
219
Carnegie Mellon University
Pittsburgh, United States
9 h-index
9 publications
1.2K citations
Purdue University West Lafayette
West Lafayette, United States
7 h-index
7 publications
155 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
4 h-index
4 publications
488 citations
University of Southern California
Los Angeles, United States
4 h-index
4 publications
229 citations
Microsoft Research Asia (China)
Beijing, China
4 h-index
4 publications
266 citations
Intel (United States)
Santa Clara, United States
4 h-index
4 publications
185 citations
University of Utah
Salt Lake City, United States
4 h-index
4 publications
420 citations

Johns Hopkins University
Baltimore, United States
3 h-index
3 publications
139 citations
1–8 of 219
6 publications · 117 citations
6
h-index
5 publications · 139 citations
5
h-index
4 publications · 1.2K citations
4
h-index
Repository · 4 publications · 87 citations
4
h-index
4 publications · 406 citations
4
h-index
1–5