Vantage-point Trees
Vantage-Point Trees is a space-partitioning data structure that organizes metric data by recursively selecting distinguished points (vantage points) and partitioning the remaining points based on their distance from these vantage points.
14
Publications
1.5K
Citations
39
Authors
27
Institutions
Publications per year
2017–2026
3
Variants
Vp Trees
Parents
14
Tzi‐cker Chiueh · 1994 · 157 citations
Laurens van der Maaten · arXiv (Cornell University) · 2013 · 61 citations · Full text
Fast indexing for image retrieval based on local appearance with re-ranking
Hao Shao, Tomáš Svoboda, Vittorio Ferrari et al. · 2004 · 36 citations
1–5 of 14
39
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 39
27
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
27 citations

Delft University of Technology
Delft, The Netherlands
2 h-index
2 publications
78 citations

University of Nairobi
Nairobi, Kenya
1 h-index
1 publications
88 citations
KU Leuven
Leuven, Belgium
1 h-index
1 publications
36 citations
Institute of Applied Physics
Sumy, Ukraine
1 h-index
1 publications
14 citations
Aristotle University of Thessaloniki
Thessaloniki, Greece
1 h-index
1 publications
28 citations
Arqule (United States)
Burlington, United States
1 h-index
1 publications
14 citations

University of Massachusetts Amherst
Amherst Center, United States
1 h-index
2 publications
28 citations
1–8 of 27
Repository · 2 publications · 78 citations
2
h-index
1 publications · 19 citations
1
h-index
1 publications · 12 citations
1
h-index
1 publications · 20 citations
1
h-index
1 publications · 88 citations
1
h-index
1–5