3 citations · 3 across the 4 of their papers we have counts for
4 papers
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…
Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence
Yury Elkin, Vitaliy Kurlin
Rigid shapes should be naturally compared up to rigid motion or isometry, which preserves all inter-point distances. The same rigid shape can be often represented by noisy point cl…
The mergegram of a dendrogram and its stability
Yury Elkin, Vitaliy Kurlin
This paper extends the key concept of persistence within Topological Data Analysis (TDA) in a new direction. TDA quantifies topological shapes hidden in unorganized data such as cl…
A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space
Yury Elkin, Di Liu, Vitaliy Kurlin
The tree reconstruction problem is to find an embedded straight-line tree that approximates a given cloud of unorganized points in up to a certain error. A practical…