Priority Search Trees
A Priority Search Tree is a geometric data structure that organizes two-dimensional points to support efficient range queries by combining the properties of binary search trees and priority queues, distinguishing it from other spatial data structures through its ability to prioritize queries based on one coordinate while searching on another.
19
Publications
6.4K
Citations
42
Authors
25
Institutions
Publications per year
2017–2026
1
19
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
Marius Muja, David Lowe · 2009 · 2.6K citations · Full text
Optimised KD-trees for fast image descriptor matching
Chanop Silpa-Anan, Richard Hartley · 2008 · 678 citations
Edward M. McCreight · SIAM Journal on Computing · 1985 · 499 citations
1–5 of 19
42
3
h-index
3
h-index
2
h-index
2
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
2 publications · 231 citations
2
h-index
1–5 of 42
25

University of British Columbia
Vancouver, Canada
3 h-index
5 publications
7.2K citations
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
3 publications
347 citations

Sichuan University
Chengdu, China
1 h-index
3 publications
54 citations

Carleton University
Ottawa, Canada
1 h-index
2 publications
20 citations
McKinsey & Company (United States)
New York, United States
1 h-index
1 publications
382 citations
Microsoft (United States)
Redmond, United States
1 h-index
1 publications
17 citations
Princeton University
Princeton, United States
1 h-index
2 publications
764 citations
Institute of Electrical and Electronics Engineers
Piscataway, United States
1 h-index
1 publications
43 citations
1–8 of 25
ICDE · 1 publications · 56 citations
1
h-index
TALG · 1 publications · 116 citations
1
h-index
1 publications · 18 citations
1
h-index
1 publications · 17 citations
1
h-index
TPAMI · 1 publications · 1.4K citations
1
h-index
1–5