research
∙
08/19/2022
Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006
This paper is motivated by the k-nearest neighbors search: given an arbi...
share
research
∙
05/20/2022
A new compressed cover tree for k-nearest neighbour search and the stable-under-noise mergegram of a point cloud
This thesis consists of two topics related to computational geometry and...
research
∙
01/17/2022
Paired compressed cover trees guarantee a near linear parametrized complexity for all k-nearest neighbors search in an arbitrary metric space
This paper studies the important problem of finding all k-nearest neighb...
research
∙
11/30/2021
A new compressed cover tree guarantees a near linear parameterized complexity for all k-nearest neighbors search in metric spaces
This paper studies the classical problem of finding all k nearest neighb...
research
∙
11/08/2021
Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence
Rigid shapes should be naturally compared up to rigid motion or isometry...
research
∙
07/22/2020
The mergegram of a dendrogram and its stability
This paper extends the key concept of persistence within Topological Dat...
research
∙
07/17/2020