Multivariate interpolation of large sets of scattered data
ACM Transactions on Mathematical Software (TOMS)
Modified multiquadric methods for scattered data interpolation over a sphere
Computer Aided Geometric Design
Algorithm 661: QSHEP3D: quadratic Shepard method for trivariate interpolation of scattered data
ACM Transactions on Mathematical Software (TOMS)
Fitting scattered data on sphere-like surfaces using spherical splines
Journal of Computational and Applied Mathematics - Special issue on scattered data
Strictly positive definite functions on spheres in Euclidean spaces
Mathematics of Computation
Locally supported kernels for spherical spline interpolation
Journal of Approximation Theory
Sampling with Hammersley and Halton points
Journal of Graphics Tools
ACM Transactions on Mathematical Software (TOMS)
Scattered data fitting on the sphere
Proceedings of the international conference on Mathematical methods for curves and surfaces II Lillehammer, 1997
Error estimates for scattered data interpolation on spheres
Mathematics of Computation
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Radial basis functions for the multivariate interpolation of large scattered data sets
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the 9th International Congress on computational and applied mathematics
Lp-error estimates for radial basis function interpolation on the sphere
Journal of Approximation Theory
Meshfree Approximation Methods with MATLAB
Meshfree Approximation Methods with MATLAB
A meshless interpolation algorithm using a cell-based searching procedure
Computers & Mathematics with Applications
Hi-index | 7.29 |
In this paper a new efficient algorithm for spherical interpolation of large scattered data sets is presented. The solution method is local and involves a modified spherical Shepard's interpolant, which uses zonal basis functions as local approximants. The associated algorithm is implemented and optimized by applying a nearest neighbour searching procedure on the sphere. Specifically, this technique is mainly based on the partition of the sphere in a suitable number of spherical zones, the construction of spherical caps as local neighbourhoods for each node, and finally the employment of a spherical zone searching procedure. Computational cost and storage requirements of the spherical algorithm are analyzed. Moreover, several numerical results show the good accuracy of the method and the high efficiency of the proposed algorithm.