Tighter Bounds for Reconstruction from $\epsilon$-samples

Håvard Bakke Bjerkevik

We show that reconstructing a curve in ${\mathbb{R}}^d$ for $d\ge 2$ from a $0.66$-sample is always possible using an algorithm similar to the classical NN-Crust algorithm. Previous…