Scattered data interpolation using minimum energy Powell-Sabin elements and data dependent triangulations
type: Item
instance of: scholarly article
title: Scattered data interpolation using minimum energy Powell-Sabin elements and data dependent triangulations
zbMATH Open document ID: 0789.65003
DOI: 10.1007/BF02113893
published in: Numerical Algorithms
publication date: 1994-03-17T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65D05
Mathematics Subject Classification ID: 41A05
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 41A63
zbMATH DE Number: 510230
zbMATH Keywords: scattered data interpolation
zbMATH Keywords: data dependent triangulations
zbMATH Keywords: Delaunay triangulation
zbMATH Keywords: Powell-Sabin piecewise quadratic interpolant
zbMATH Keywords: numerical examples
zbMATH Keywords: locally optimal triangulations
author: Samuel Rippa
reviewed by: Heinrich Guggenheimer
MaRDI profile type: Publication
cites work: Derivative generation from multivariate scattered data by functional minimization
cites work: Q4194439
cites work: Q3975809
cites work: A triangle-based \(C^ 1\) interpolation method
cites work: Data Dependent Triangulations for Piecewise Linear Interpolation
cites work: Q3978906
cites work: Transforming triangulations in polygonal domains
cites work: Scattered Data Interpolation: Tests of Some Method
cites work: Transforming triangulations
cites work: Piecewise Quadratic Approximations on Triangles
cites work: Cubic spline fitting using data dependent triangulations
cites work: Long and Thin Triangles Can Be Good for Linear Interpolation
cites work: Estimation of gradients from scattered data
Recommended article: Interior improvement of piecewise linear interpolants defined over Delaunay triangulations
Recommended article: Optimal Triangular Mesh Generation by Coordinate Transformation
Recommended article: Interpolation of convex scattered data in \(R^ 3\) based upon an edge convex minimum norm network
Recommended article: Q3197185
Recommended article: Minimal roughness property of the Delaunay triangulation
Recommended article: Q3118496
Recommended article: Q3829949
Recommended article: Q4429154
Recommended article: Vertex based data dependent triangulations
Recommended article: A variational approach to subdivision
description: scientific article; zbMATH DE number 510230