toms661


toms661, a Fortran90 code which interpolates scattered 3D data, also known as "qshep3d", by Robert Renka.

The code takes a set of data values WDAT(XDAT,YDAT,ZDAT), where the points (XDAT,YDAT,ZDAT) are "scattered" in 3D, and constructs an interpolating function W(X,Y,Z) which matches the given data and extends smoothly through 3D space.

The code is primarily a translation of a Fortran77 program which was written by Robert Renka and published in the ACM Transactions on Mathematical Software.

The text of many ACM TOMS algorithms is available online through ACM: https://calgo.acm.org/ or NETLIB: https://www.netlib.org/toms/index.html.

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

toms661 is available in a Fortran90 version.

Related Data and Programs:

toms661_test

rbf_interp_nd, a Fortran90 code which defines and evaluates radial basis interpolants to multidimensional data.

test_interp_nd, a Fortran90 code which defines test problems for interpolation of data z(x), depending on an M-dimensional argument.

toms526, a Fortran90 code which interpolates scattered bivariate data, This is a version of ACM TOMS algorithm 526, by Hiroshi Akima;

toms660, a Fortran90 code which takes scattered 2D data and produces an interpolating function F(X,Y), this is a version of ACM TOMS algorithm 660, called qshep2d(), by Robert Renka.

toms886, a Fortran90 code which defines the Padua points for interpolation in a 2D region, including the rectangle, triangle, and ellipse, by Marco Caliari, Stefano de Marchi, Marco Vianello. This is ACM TOMS algorithm 886.

Author:

Robert Renka

Reference:

  1. Richard Franke,
    Scattered Data Interpolation: Tests of Some Methods,
    Mathematics of Computation,
    Volume 38, Number 157, January 1982, pages 181-200.
  2. Robert Renka,
    Algorithm 661: QSHEP3D, Quadratic Shepard method for trivariate interpolation of scattered data,
    ACM Transactions on Mathematical Software,
    Volume 14, 1988, pages 151-152.

Source Code:


Last revised on 14 March 2021.