A new compressed cover tree for k-nearest neighbour search and the stable-under-noise mergegram of a point cloud

05/20/2022

∙

by   Yury Elkin, et al.

∙

0

∙

share

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 algebraic topology for analyzing data. The first part studies the classical problem of finding k nearest neighbors to m query points in a larger set of n reference points in any metric space. The second part is about the construction of a Minimum Spanning Tree (MST) on any finite metric space. The third part extends the key concept of persistence within Topological Data Analysis in a new direction.