论文信息 - A 3D Efficient Procedure for Shepard Interpolants on Tetrahedra

A 3D Efficient Procedure for Shepard Interpolants on Tetrahedra

The need of scattered data interpolation methods in the multivariate framework and, in particular, in the trivariate case, motivates the generalization of the fast algorithm for triangular Shepard method. A block-based partitioning structure procedure was already applied to make the method very fast in the bivariate setting. Here the searching algorithm is extended, it allows to partition the domain and nodes in cubic blocks and to find the nearest neighbor points that need to be used in the tetrahedral Shepard interpolation.

Roberto Cavoretto | Alessandra De Rossi | Francesco Dell'Accio | Filomena Di Tommaso

[1] Roberto Cavoretto,et al. Hermite-Birkhoff interpolation on scattered data on the sphere and other manifolds , 2017, Appl. Math. Comput..

[2] K. Hormann,et al. On the approximation order of triangular Shepard interpolation , 2015 .

[3] Gregory E. Fasshauer,et al. Meshfree Approximation Methods with Matlab , 2007, Interdisciplinary Mathematical Sciences.

[4] Roberto Cavoretto,et al. Efficient computation of partition of unity interpolants through a block-based searching technique , 2016, Comput. Math. Appl..

[5] Roberto Cavoretto,et al. Fast computation of triangular Shepard interpolants , 2019, J. Comput. Appl. Math..

[6] Gregory E. Fasshauer,et al. Kernel-based Approximation Methods using MATLAB , 2015, Interdisciplinary Mathematical Sciences.

[7] Xue-Zhang Liang,et al. On a Hermite interpolation on the sphere , 2011 .

[8] Holger Wendland,et al. Scattered Data Approximation: Conditionally positive definite functions , 2004 .

[9] Robert J. Renka,et al. Multivariate interpolation of large sets of scattered data , 1988, TOMS.