Provable surface reconstruction from noisy samples
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Manifold reconstruction from point samples
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge Monographs on Applied and Computational Mathematics)
Finding the Homology of Submanifolds with High Confidence from Random Samples
Discrete & Computational Geometry
Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees
Computational Geometry: Theory and Applications
Random Projections of Smooth Manifolds
Foundations of Computational Mathematics
Introduction to Nonparametric Estimation
Introduction to Nonparametric Estimation
Manifold reconstruction using tangential Delaunay complexes
Proceedings of the twenty-sixth annual symposium on Computational geometry
Hi-index | 0.00 |
We find the minimax rate of convergence in Hausdorff distance for estimating a manifold M of dimension d embedded in RD given a noisy sample from the manifold. Under certain conditions, we show that the optimal rate of convergence is n-2/(2+d). Thus, the minimax rate depends only on the dimension of the manifold, not on the dimension of the space in which M is embedded.