5 citations · 9 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CG2021
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…
cs.CG2021★ 5 cited
A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
Yury Elkin, Vitaliy Kurlin
Given a reference set of points and a query set of points in a metric space, this paper studies an important problem of finding -nearest neighbors of every point…