Spherical interpolation using the partition of unity method: An efficient and flexible algorithm

An efficient and flexible algorithm for the spherical interpolation of large scattered data sets is proposed. It is based on a partition of unity method on the sphere and uses spherical radial basis functions as local approximants. This technique exploits a suitable partition of the sphere into a nu...

Full description

Saved in:

Bibliographic Details
Published in:	Applied mathematics letters Vol. 25; no. 10; pp. 1251 - 1256
Main Authors:	Cavoretto, Roberto, De Rossi, Alessandra
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.10.2012
Subjects:	Fast interpolation algorithms Partition of unity method Scattered data interpolation Spherical radial basis functions Spherical radial basis functions Fast interpolation algorithms Scattered data interpolation Partition of unity method
ISSN:	0893-9659, 1873-5452
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	An efficient and flexible algorithm for the spherical interpolation of large scattered data sets is proposed. It is based on a partition of unity method on the sphere and uses spherical radial basis functions as local approximants. This technique exploits a suitable partition of the sphere into a number of spherical zones, the construction of a certain number of cells such that the sphere is contained in the union of the cells, with some mild overlap among the cells, and finally the employment of an optimized spherical zone searching procedure. Some numerical experiments show the good accuracy of the spherical partition of unity method and the high efficiency of the algorithm.
ISSN:	0893-9659 1873-5452
DOI:	10.1016/j.aml.2011.11.006