Algorithm 661: QSHEP3D: Quadratic Shepard method for trivariate interpolation of scattered data
RJ Renka - ACM Transactions on Mathematical Software (TOMS), 1988 - dl.acm.org
ACM Transactions on Mathematical Software (TOMS), 1988•dl.acm.org
QSHEP3D is an implementation of the modified quadratic Shepard method [l] for the case of
three independent variables. The software conforms to both the 1966 and 1977 (Subset)
ANSI Standards for FORTRAN, and has no system dependencies. Header comments in
each routine contain detailed descriptions of the calling sequences, and all parameter
names conform to the FORTRAN typing default. The primary purpose of the package is to
construct a once-continuously differentiable function Q (X, Y, 2) such that Q interpolates a set …
three independent variables. The software conforms to both the 1966 and 1977 (Subset)
ANSI Standards for FORTRAN, and has no system dependencies. Header comments in
each routine contain detailed descriptions of the calling sequences, and all parameter
names conform to the FORTRAN typing default. The primary purpose of the package is to
construct a once-continuously differentiable function Q (X, Y, 2) such that Q interpolates a set …
QSHEP3D is an implementation of the modified quadratic Shepard method [l] for the case of three independent variables. The software conforms to both the 1966 and 1977 (Subset) ANSI Standards for FORTRAN, and has no system dependencies. Header comments in each routine contain detailed descriptions of the calling sequences, and all parameter names conform to the FORTRAN typing default.
The primary purpose of the package is to construct a once-continuously differentiable function Q (X, Y, 2) such that Q interpolates a set of N data values Fi at arbitrarily distributed nodes (Xi, Yi, Zi) for i= 1,..., N. Also, two of the subroutines, STORE3 and GETNP3, may be used alone to solve closest point problems.