4.7 Article

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

Journal

APPLIED MATHEMATICS LETTERS
Volume 25, Issue 10, Pages 1251-1256

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.aml.2011.11.006

Keywords

Partition of unity method; Spherical radial basis functions; Fast interpolation algorithms; Scattered data interpolation

Ask authors/readers for more resources

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. (C) 2011 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available