arXiv · 2010.07976
Sampling and homology via bottlenecks
Abstract
In this paper we present an efficient algorithm to produce a provably dense sample of a smooth compact variety. The procedure is partly based on computing $\textit{bottlenecks}$ of the variety. Using geometric information such as the bottlenecks and the $\textit{local reach}$ we also provide bounds on the density of the sample needed in order to guarantee that the homology of the variety can be recovered from the sample. An implementation of the algorithm is provided together with numerical experiments and a computational comparison to the algorithm by Dufresne et. al.
Explore related subjects
Keep this discovery
Sandra Di Rocco, David Eklund, Oliver Gäfvert. 2020-10-15. Sampling and homology via bottlenecks. https://arxiv.org/abs/2010.07976
Cite the original work for its findings. Save a collection to share your selection of sources.