Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Interpolation of data on the surface of a sphere
Renka R. (ed) ACM Transactions on Mathematical Software10 (4):417-436,1984.Type:Article
Date Reviewed: Nov 1 1985

Some knowledge of the recent history of multivariate interpolation helps in appreciating the problem of constructing C1 interpolants of data values that are associated with arbitrarily distributed nodes on the surface of a sphere. Recent approaches include:

  • (1) C0 multivariate interpolants [1],

  • (2) C1 interpolants with nodes on the boundary of a planar region [2],

  • (3) C1 interpolants with nodes arbitrarily distributed over a plane (see, e.g., [3]), and

  • (4) the present problem (e.g., [4]).

Here the author extends to a sphere a planar interpolation scheme based on (Thiessen) triangulation of the nodes and estimation of gradients at the nodes (e.g., [3]). Since Lawson has also done this [4], Renka here makes several claims for his variations in the details of the shared approach to the problem. For the weighted least squares fit of a quadratic to data values at nearby nodes to estimate partial derivatives, the method of [3] produces superior accuracy to that of [4]. For univariate interpolation along line segments interior to the triangle and its extension to the sphere, the use of “the planar interpolant on the underlying planar triangle with boundary data obtained by projecting values and gradients onto the plane,” is both more efficient and more accurate than that of [4].

The author implemented his algorithm and Lawson’s “6-arc method” as Method I and Method II, respectively, on the IBM 3033 at the Oak Ridge National Laboratory and compared the programs for four sets of test data. He obtained the following results: “Method I was significantly more accurate than Method II in all cases. Since the difference in accuracy increases with density of the nodal distribution, this result would likely be reversed on a very sparse distribution.” Overall, “Method I is shown to be about 1.5 times as fast as Method II.”

A description of ACM Transactions on Mathematical Software Algorithm 623, Interpolation on the Surface of a Sphere, follows the main article. Program listings are available from the ACM Algorithm Distribution Service.

Reviewer:  G. W. Kimble Review #: CR109295
1) Thatcher, H. C.Derivation of interpolation formulas in several independent variables, Ann. New York Acad. Sci. 86 (1960), 758–775.
2) Barnhill, R. E.Representation and approximation of surfaces, in Mathematical software III, J. R. Rice (Ed.), Academic Press, New York, 1977, 69–120.
3) Renka, R. J.; and Cline, A. K.A triangle-based C1 interpolation method, Rocky Mountain J. Math. 14 (1984), 223–237.
4) Lawson, C. L.C1 surface interpolation for scattered data on a sphere, Rocky Mountain J. Math. 14 (1984), 177–202.
Bookmark and Share
 
Interpolation (G.1.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Interpolation": Date
Systolic computation of interpolating polynomials
Cappello P., Koç Ç., Gallopoulos E. Computing 45(2): 95-117, 2000. Type: Article
Jun 1 1991
Incremental linear interpolation
Field D. ACM Transactions on Graphics (TOG) 4(1): 1-11, 1985. Type: Article
Jun 1 1986
Multivariate interpolation of large sets of scattered data
Renka R. (ed) ACM Transactions on Mathematical Software 14(2): 139-148, 1988. Type: Article
Mar 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy