Space-partitioning Trees
Space-Partitioning Trees is a spatial data structure that recursively subdivides a multidimensional space into non-overlapping regions through hierarchical tree-based decomposition, enabling efficient nearest neighbor search by localizing queries within successively finer partitions.
172
Publications
8.8K
Citations
422
Authors
200
Institutions
Publications per year
2017–2026
18
Variants
Space Partitioning Trees
172
Fast distance queries with rectangular swept sphere volumes
Eric Larsen, S. Gottschalk, Ming C. Lin et al. · 2002 · 277 citations
Group nearest neighbor queries
Dimitris Papadias, Qiongmao Shen, Yufei Tao et al. · 2004 · 259 citations · Full text
1–5 of 172
422
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 422
200
Purdue University West Lafayette
West Lafayette, United States
6 h-index
14 publications
338 citations
AT&T (United States)
Bedminster, United States
6 h-index
9 publications
513 citations
Simon Fraser University
Burnaby, Canada
5 h-index
11 publications
1K citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
4 h-index
7 publications
903 citations
Fudan University
Shanghai, China
4 h-index
11 publications
627 citations

Peking University
Beijing, China
4 h-index
9 publications
565 citations
University of Chile
Santiago, Chile
4 h-index
5 publications
155 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
96 citations
1–8 of 200
TKDE · 5 publications · 237 citations
5
h-index
PVLDB · 5 publications · 265 citations
5
h-index
5 publications · 525 citations
5
h-index
4 publications · 125 citations
4
h-index
Repository · 4 publications · 102 citations
4
h-index
1–5