Partition of unity algorithm for two-dimensional interpolation using compactly supported radial basis functions
From MaRDI portal
Publication:3456392
zbMATH Open1329.65040MaRDI QIDQ3456392FDOQ3456392
Authors: Roberto Cavoretto
Publication date: 14 December 2015
Recommendations
- Spherical interpolation using the partition of unity method: an efficient and flexible algorithm
- A meshless interpolation algorithm using a cell-based searching procedure
- Adaptive radial basis function partition of unity interpolation: a bivariate algorithm for unstructured data
- Efficient computation of partition of unity interpolants through a block-based searching technique
- scientific article; zbMATH DE number 1981794
Numerical smoothing, curve fitting (65D10) Numerical interpolation (65D05) Approximation by other special function classes (41A30)
Cited In (9)
- Partition of unity interpolation using stable kernel-based techniques
- A trivariate interpolation algorithm using a cube-partition searching procedure
- Efficient computation of partition of unity interpolants through a block-based searching technique
- Scattered data approximation by regular grid weighted smoothing
- Adaptive radial basis function partition of unity interpolation: a bivariate algorithm for unstructured data
- A meshless interpolation algorithm using a cell-based searching procedure
- Spherical interpolation using the partition of unity method: an efficient and flexible algorithm
- Adaptive partition of unity interpolation method with moving patches
- A least squares radial basis function partition of unity method for solving PDEs
This page was built for publication: Partition of unity algorithm for two-dimensional interpolation using compactly supported radial basis functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3456392)