Exact and Minimal Sampling for Riemannian Curve Reconstruction
Develop an algorithm that, given a closed curve C on a Riemannian manifold M, constructs a sample set S ⊂ C that is minimal in cardinality while exactly satisfying the injectivity-radius–constrained ρ-sampling condition defined via the injective local feature size ilfs(p) = min(lfs(p), i_M(p)) and the injective reach of intervals on C, rather than relying on heuristic backtracking to extract a subset of samples meeting these conditions.
References
We then employed a backtracking approach to extract a subset of samples that satisfy our sampling conditions. Generating an exact and minimal sampling remains an open problem.
— Reconstructing Curves from Sparse Samples on Riemannian Manifolds
(2404.09661 - Marin et al., 2024) in Section 4.1 (Non-uniform sparse sampling on surfaces)