A new algorithm for bivariate interpolation of large sets of scattered and track data is presented. Then, the extension to the sphere is analyzed. The method, whose different versions depend partially on the kind of data, is based on the partition of the interpolation domain in a suitable number of parallel strips, and, starting from these, on the construction for any data point of a local neighbourhood containing a convenient number of data points. Then, the well-known modified Shepard’s formula for surface interpolation is applied with some effective improvements. The method is extended to the sphere using a modified spherical Shepard’s interpolant with the employment of zonal basis functions as local approximants. The proposed algorithms are very fast, owing to the optimal nearest neighbour searching, and achieve a good accuracy. The efficiency and reliability of the algorithms are shown by several numerical tests, performed also by Renka’s algorithms for a comparison
Efficient approximation algorithms. Part II: Scattered data interpolation based on strip searching procedures
ALLASIA, Giampietro;BESENGHI, Renata;CAVORETTO, Roberto;DE ROSSI, Alessandra
2010-01-01
Abstract
A new algorithm for bivariate interpolation of large sets of scattered and track data is presented. Then, the extension to the sphere is analyzed. The method, whose different versions depend partially on the kind of data, is based on the partition of the interpolation domain in a suitable number of parallel strips, and, starting from these, on the construction for any data point of a local neighbourhood containing a convenient number of data points. Then, the well-known modified Shepard’s formula for surface interpolation is applied with some effective improvements. The method is extended to the sphere using a modified spherical Shepard’s interpolant with the employment of zonal basis functions as local approximants. The proposed algorithms are very fast, owing to the optimal nearest neighbour searching, and achieve a good accuracy. The efficiency and reliability of the algorithms are shown by several numerical tests, performed also by Renka’s algorithms for a comparisonFile | Dimensione | Formato | |
---|---|---|---|
Efficient approximation algoritms.pdf
Accesso riservato
Tipo di file:
POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione
1.17 MB
Formato
Adobe PDF
|
1.17 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.