Scattered data interpolation using minimum energy Powell-Sabin elements and data dependent triangulations
The author notes that in the interpolation problem in two variables, patching together a function interpolating given data points \((x_ i,y_ i,f_ i)\) it is best to let the triangulation of the point set \((x_ i,y_ i)\) depend on the problem. His main tool is a theorem of \textit{C. L. Lawson} [Discrete Math. 3, 365-372 (1972; Zbl 0253.05116)] that any triangulation of a finite planar set can be transformed into any other triangulation of the same set by looking at the convex quadrilaterals formed by two adjacent triangles and replacing one diagonal by the other. Given an interpolation function \(S(x,y)\) and starting with a given triangulation, in particular, starting with the Delaunay triangulation and using the Powell-Sabin piecewise quadratic interpolant [\textit{M. J. D. Powell} and \textit{M. A. Sabin} [ACM Trans. Math. Software 3, 316-325 (1977; Zbl 0375.41010)] the author uses as measure of smoothness the total (euclidean) norm of the Hessian \(H(S)\) of \(S\), \(C = \Sigma\int \| H(S)\|^ 2 dxdy\), the integral taken over each triangle, the sum over the triangulation. Since \(S\) is locally quadratic, the entire operation is algebraic. For each Lawson operation, the change of \(C\) is computed and the triangulation with a (local) minimum of \(C\) is the final result. Some numerical examples are given showing locally optimal triangulations with very slim triangles.
- Interior improvement of piecewise linear interpolants defined over Delaunay triangulations
- Optimal Triangular Mesh Generation by Coordinate Transformation
- Interpolation of convex scattered data in R^ 3 based upon an edge convex minimum norm network
- Publication:3197185
- Minimal roughness property of the Delaunay triangulation
- Optimal Lagrange interpolation with bivariate C^1 quadratic splines of Powell-Sabin triangulations
- scientific article; zbMATH DE number 4105501
- scientific article; zbMATH DE number 1985290
- Vertex based data dependent triangulations
- A variational approach to subdivision
- A triangle-based C^ 1 interpolation method
- Cubic spline fitting using data dependent triangulations
- Data Dependent Triangulations for Piecewise Linear Interpolation
- Derivative generation from multivariate scattered data by functional minimization
- Estimation of gradients from scattered data
- scientific article; zbMATH DE number 18417 (Why is no real title available?)
- scientific article; zbMATH DE number 19420 (Why is no real title available?)
- scientific article; zbMATH DE number 3633695 (Why is no real title available?)
- Long and Thin Triangles Can Be Good for Linear Interpolation
- Piecewise Quadratic Approximations on Triangles
- Scattered Data Interpolation: Tests of Some Method
- Transforming triangulations
- Transforming triangulations in polygonal domains
- Powell-Sabin splines in range restricted interpolation of scattered data
- Interpolation of scattered 3D PTV data to a regular grid
- Data-dependent triangulations for scattered data interpolation and finite element approximation
- Energy minimization method for scattered data Hermite interpolation
- On Optimal Interpolation Triangle Incidences
- Preconditioned conjugate gradient method for finding minimal energy surfaces on Powell-Sabin triangulations
- scientific article; zbMATH DE number 1284008 (Why is no real title available?)
- Scattered Data Interpolation Using Data Dependant Optimization Techniques
- Interpolating minimal energy \(C^{1}\)-surfaces on Powell-Sabin triangulations: Application to the resolution of elliptic problems
- Convexity preserving scattered data interpolation using Powell-Sabin elements
This page was built for publication: Scattered data interpolation using minimum energy Powell-Sabin elements and data dependent triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315246)
