Answers are grounded in this paper and cite their sources.
We address the problem of adaptive approximation of sequences of noisy data points in arbitrary-dimensional spaces using spline models of any degree and smoothness. Knot vectors are determined as solutions of unconstrained sparse optimization problems, yielding a flexible and compact representation based on a limited number of polynomial segments. Unlike previously proposed methods, the resulting knot vectors may include breakpoints with arbitrary multiplicity. Furthermore, the proposed approach enables the reconstruction of both scalar functions and open or closed parametric curves, always relying on a simple, fully unconstrained optimization framework that ensures robustness and computational efficiency.
No takes yet. Share an insight, caveat, or question.
Bay et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: