5 citations · 9 across the 7 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.CG2022★ 1 cited
Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006
Yury Elkin, Vitaliy Kurlin
This paper is motivated by the k-nearest neighbors search: given an arbitrary metric space, and its finite subsets (a reference set R and a query set Q), design a fast algorithm to…
cs.CG2022
A new compressed cover tree for k-nearest neighbour search and the stable-under-noise mergegram of a point cloud
Yury Elkin
This thesis consists of two topics related to computational geometry and one topic related to topological data analysis (TDA), which combines fields of computational geometry and a…
cs.CG2022
Paired compressed cover trees guarantee a near linear parametrized complexity for all -nearest neighbors search in an arbitrary metric space
Yury Elkin, Vitaliy Kurlin
This paper studies the important problem of finding all -nearest neighbors to points of a query set in another reference set within any metric space. Our previous work d…