Reconstruction and interpolation of manifolds I: The geometric Whitney problem
Charles Fefferman, Sergei Ivanov, Yaroslav Kurylev, Matti Lassas,, Hariharan Narayanan

TL;DR
This paper addresses the problem of reconstructing Riemannian manifolds from metric spaces and point clouds, providing constructive solutions, characterizations, and algorithms with complexity estimates for manifold approximation in various geometric contexts.
Contribution
It offers new constructive methods and characterizations for approximating metric spaces by Riemannian manifolds with bounded geometry, and develops algorithms for manifold reconstruction with complexity analysis.
Findings
Characterization of metric spaces approximable by Riemannian manifolds with bounded geometry
New criteria for approximating Alexandrov spaces with curvature bounds
Algorithmic procedures with complexity estimates for manifold reconstruction
Abstract
We study the geometric Whitney problem on how a Riemannian manifold can be constructed to approximate a metric space . This problem is closely related to manifold reconstruction where a smooth -dimensional submanifold , needs to be constructed to approximate a point cloud in . These questions are encountered in differential geometry, machine learning, and in many inverse problems encountered in applications. The determination of a Riemannian manifold includes the construction of its topology, differentiable structure, and metric. We give constructive solutions to the above problems. Moreover, we characterize the metric spaces that can be approximated, by Riemannian manifolds with bounded geometry: We give sufficient conditions to ensure that a metric space can be approximated, in the Gromov-Hausdorff or quasi-isometric…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
