e01 Chapter Contents
e01 Chapter Introduction
NAG C Library Manual

# NAG Library Function Documentnag_3d_shep_interp (e01tgc)

## 1  Purpose

nag_3d_shep_interp (e01tgc) generates a three-dimensional interpolant to a set of scattered data points, using a modified Shepard method.

## 2  Specification

 #include #include
 void nag_3d_shep_interp (Integer m, const double x[], const double y[], const double z[], const double f[], Integer nw, Integer nq, Integer iq[], double rq[], NagError *fail)

## 3  Description

nag_3d_shep_interp (e01tgc) constructs a smooth function $Q\left(x,y,z\right)$ which interpolates a set of $m$ scattered data points $\left({x}_{r},{y}_{r},{z}_{r},{f}_{r}\right)$, for $r=1,2,\dots ,m$, using a modification of Shepard's method. The surface is continuous and has continuous first partial derivatives.
The basic Shepard method, which is a generalization of the two-dimensional method described in Shepard (1968), interpolates the input data with the weighted mean
 $Qx,y,z=∑r=1mwrx,y,zqr ∑r=1mwrx,y,z ,$
where
 $qr=fr ​ and ​ wrx,y,z= 1dr2 ​ and ​ dr2= x-xr 2+ y-yr 2+ z-zr 2.$
The basic method is global in that the interpolated value at any point depends on all the data, but this function uses a modification (see Franke and Nielson (1980) and Renka (1988a)), whereby the method becomes local by adjusting each ${w}_{r}\left(x,y,z\right)$ to be zero outside a sphere with centre $\left({x}_{r},{y}_{r},{z}_{r}\right)$ and some radius ${R}_{w}$. Also, to improve the performance of the basic method, each ${q}_{r}$ above is replaced by a function ${q}_{r}\left(x,y,z\right)$, which is a quadratic fitted by weighted least squares to data local to $\left({x}_{r},{y}_{r},{z}_{r}\right)$ and forced to interpolate $\left({x}_{r},{y}_{r},{z}_{r},{f}_{r}\right)$. In this context, a point $\left(x,y,z\right)$ is defined to be local to another point if it lies within some distance ${R}_{q}$ of it. Computation of these quadratics constitutes the main work done by this function.
The efficiency of the function is further enhanced by using a cell method for nearest neighbour searching due to Bentley and Friedman (1979).
The radii ${R}_{w}$ and ${R}_{q}$ are chosen to be just large enough to include ${N}_{w}$ and ${N}_{q}$ data points, respectively, for user-supplied constants ${N}_{w}$ and ${N}_{q}$. Default values of these arguments are provided by the function, and advice on alternatives is given in Section 8.2.
This function is derived from the function QSHEP3 described by Renka (1988b).
Values of the interpolant $Q\left(x,y,z\right)$ generated by this function, and its first partial derivatives, can subsequently be evaluated for points in the domain of the data by a call to nag_3d_shep_eval (e01thc).

## 4  References

Bentley J L and Friedman J H (1979) Data structures for range searching ACM Comput. Surv. 11 397–409
Franke R and Nielson G (1980) Smooth interpolation of large sets of scattered data Internat. J. Num. Methods Engrg. 15 1691–1704
Renka R J (1988a) Multivariate interpolation of large sets of scattered data ACM Trans. Math. Software 14 139–148
Renka R J (1988b) Algorithm 661: QSHEP3D: Quadratic Shepard method for trivariate interpolation of scattered data ACM Trans. Math. Software 14 151–152
Shepard D (1968) A two-dimensional interpolation function for irregularly spaced data Proc. 23rd Nat. Conf. ACM 517–523 Brandon/Systems Press Inc., Princeton

## 5  Arguments

1:     mIntegerInput
On entry: $m$, the number of data points.
Constraint: ${\mathbf{m}}\ge 10$.
2:     x[m]const doubleInput
3:     y[m]const doubleInput
4:     z[m]const doubleInput
On entry: ${\mathbf{x}}\left[\mathit{r}-1\right]$, ${\mathbf{y}}\left[\mathit{r}-1\right]$, ${\mathbf{z}}\left[\mathit{r}-1\right]$ must be set to the Cartesian coordinates of the data point $\left({x}_{\mathit{r}},{y}_{\mathit{r}},{z}_{\mathit{r}}\right)$, for $\mathit{r}=1,2,\dots ,m$.
Constraint: these coordinates must be distinct, and must not all be coplanar.
5:     f[m]const doubleInput
On entry: ${\mathbf{f}}\left[\mathit{r}-1\right]$ must be set to the data value ${f}_{\mathit{r}}$, for $\mathit{r}=1,2,\dots ,m$.
6:     nwIntegerInput
On entry: the number ${N}_{w}$ of data points that determines each radius of influence ${R}_{w}$, appearing in the definition of each of the weights ${w}_{\mathit{r}}$, for $\mathit{r}=1,2,\dots ,m$ (see Section 3). Note that ${R}_{w}$ is different for each weight. If ${\mathbf{nw}}\le 0$ the default value ${\mathbf{nw}}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(32,{\mathbf{m}}-1\right)$ is used instead.
Constraint: ${\mathbf{nw}}\le \mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(40,{\mathbf{m}}-1\right)$.
7:     nqIntegerInput
On entry: the number ${N}_{q}$ of data points to be used in the least squares fit for coefficients defining the nodal functions ${q}_{r}\left(x,y,z\right)$ (see Section 3). If ${\mathbf{nq}}\le 0$ the default value ${\mathbf{nq}}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(17,{\mathbf{m}}-1\right)$ is used instead.
Constraint: ${\mathbf{nq}}\le 0$ or $9\le {\mathbf{nq}}\le \mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(40,{\mathbf{m}}-1\right)$.
8:     iq[$\left(2×{\mathbf{m}}+1\right)$]IntegerOutput
On exit: integer data defining the interpolant $Q\left(x,y,z\right)$.
9:     rq[$\left(10×{\mathbf{m}}+7\right)$]doubleOutput
On exit: real data defining the interpolant $Q\left(x,y,z\right)$.
10:   failNagError *Input/Output
The NAG error argument (see Section 3.6 in the Essential Introduction).

## 6  Error Indicators and Warnings

On entry, argument $〈\mathit{\text{value}}〉$ had an illegal value.
NE_DATA_COPLANAR
All nodes are coplanar. There is no unique solution.
NE_DUPLICATE_NODE
There are duplicate nodes in the dataset. $\left({\mathbf{x}}\left[i-1\right],{\mathbf{y}}\left[i-1\right],{\mathbf{z}}\left[i-1\right]\right)=\left({\mathbf{x}}\left[j-1\right],{\mathbf{y}}\left[j-1\right],{\mathbf{z}}\left[j-1\right]\right)$ for: $i=〈\mathit{\text{value}}〉$ and $j=〈\mathit{\text{value}}〉$. The interpolant cannot be derived.
NE_INT
On entry, ${\mathbf{m}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{m}}\ge 10$.
On entry, ${\mathbf{nq}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nq}}\le 0$ or ${\mathbf{nq}}\ge 9$.
NE_INT_2
On entry, ${\mathbf{nq}}=〈\mathit{\text{value}}〉$ and ${\mathbf{m}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nq}}\le \mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(40,{\mathbf{m}}-1\right)$.
On entry, ${\mathbf{nw}}=〈\mathit{\text{value}}〉$ and ${\mathbf{m}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nw}}\le \mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(40,{\mathbf{m}}-1\right)$.
NE_INTERNAL_ERROR
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.

## 7  Accuracy

On successful exit, the function generated interpolates the input data exactly and has quadratic accuracy.

## 8  Further Comments

### 8.1  Timing

The time taken for a call to nag_3d_shep_interp (e01tgc) will depend in general on the distribution of the data points. If x, y and z are uniformly randomly distributed, then the time taken should be O(m). At worst $\mathit{O}\left({{\mathbf{m}}}^{2}\right)$ time will be required.

### 8.2  Choice of ${N}_{w}$ and ${N}_{q}$

Default values of the arguments ${N}_{w}$ and ${N}_{q}$ may be selected by calling nag_3d_shep_interp (e01tgc) with ${\mathbf{nw}}\le 0$ and ${\mathbf{nq}}\le 0$. These default values may well be satisfactory for many applications.
If nondefault values are required they must be supplied to nag_3d_shep_interp (e01tgc) through positive values of nw and nq. Increasing these arguments makes the method less local. This may increase the accuracy of the resulting interpolant at the expense of increased computational cost. The default values ${\mathbf{nw}}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(32,{\mathbf{m}}-1\right)$ and ${\mathbf{nq}}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(17,{\mathbf{m}}-1\right)$ have been chosen on the basis of experimental results reported in Renka (1988a). In these experiments the error norm was found to vary smoothly with ${N}_{w}$ and ${N}_{q}$, generally increasing monotonically and slowly with distance from the optimal pair. The method is not therefore thought to be particularly sensitive to the argument values. For further advice on the choice of these arguments see Renka (1988a).

## 9  Example

This program reads in a set of $30$ data points and calls nag_3d_shep_interp (e01tgc) to construct an interpolating function $Q\left(x,y,z\right)$. It then calls nag_3d_shep_eval (e01thc) to evaluate the interpolant at a set of points.
Note that this example is not typical of a realistic problem: the number of data points would normally be larger.

### 9.1  Program Text

Program Text (e01tgce.c)

### 9.2  Program Data

Program Data (e01tgce.d)

### 9.3  Program Results

Program Results (e01tgce.r)