Cubic spline fitting using data dependent triangulations (Q2277754): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 624 / rank
 
Normal rank

Revision as of 11:00, 28 February 2024

scientific article
Language Label Description Also known as
English
Cubic spline fitting using data dependent triangulations
scientific article

    Statements

    Cubic spline fitting using data dependent triangulations (English)
    0 references
    0 references
    0 references
    1990
    0 references
    A kind of data dependent triangulation technique is effectively developed by the authors to investigate the data fitting problem: ``Given a set of points \({\mathcal P}=\{(x_ i,y_ i)\}^ n_{i=1}\) in \({\mathbb{R}}\) and a corresponding set of measurements \(\{z_ i=f(x_ i,y_ i)\}^ n_{i=1}\) on a function f, construct a surface s approximating f.'' They make use of piecewise cubic \(C^ 1\)-surfaces, and base the selection of the triangulation upon the idea of minimizing the energy of the resulting surface. Some explicit constructions and a pair of algorithms are given.
    0 references
    cubic spline fitting
    0 references
    scattered data fitting
    0 references
    energy of a surface
    0 references
    data dependent triangulation
    0 references

    Identifiers