e01ebc performs barycentric interpolation, at a given set of points, using a set of function values on a scattered grid and a triangulation of that grid computed by e01eac.

2 Specification

#include <nag.h>

void	e01ebc (Integer m, Integer n, const double x[], const double y[], const double f[], const Integer triang[], const double px[], const double py[], double pf[], NagError *fail)

The function may be called by the names: e01ebc, nag_interp_dim2_triang_bary_eval or nag_2d_triang_bary_eval.

3 Description

e01ebc takes as input a set of scattered data points

(x_{r}, y_{r}, f_{r})

, for

r = 1, 2, \dots, n

, and a Thiessen triangulation of the

(x_{r}, y_{r})

computed by e01eac, and interpolates at a set of points

({px}_{i}, {py}_{i})

, for

i = 1, 2, \dots, m

If the

i

th interpolation point

({px}_{i}, {py}_{i})

is equal to

(x_{r}, y_{r})

for some value of

r

, the returned value will be equal to

f_{r}

; otherwise a barycentric transformation will be used to calculate the interpolant.

For each point

({px}_{i}, {py}_{i})

, a triangle is sought which contains the point; the vertices of the triangle and

f_{r}

values at the vertices are then used to compute the value

F ({px}_{i}, {py}_{i})

If any interpolation point lies outside the triangulation defined by the input arguments, the returned value is the value provided,

f_{s}

, at the closest node

(x_{s}, y_{s})

e01ebc must only be called after a call to e01eac.

4 References

Cline A K and Renka R L (1984) A storage-efficient method for construction of a Thiessen triangulation Rocky Mountain J. Math. 14 119–139

Lawson C L (1977) Software for

C^{1}

surface interpolation Mathematical Software III (ed J R Rice) 161–194 Academic Press

Renka R L (1984) Algorithm 624: triangulation and interpolation of arbitrarily distributed points in the plane ACM Trans. Math. Software 10 440–442

Renka R L and Cline A K (1984) A triangle-based

C^{1}

interpolation method Rocky Mountain J. Math. 14 223–237

5 Arguments

1: $m$ – Integer Input: On entry: $m$ , the number of points to interpolate.

Constraint: $m \geq 1$ .
2: $n$ – Integer Input: On entry: $n$ , the number of data points. n must be unchanged from the previous call of e01eac.

Constraint: $n \geq 3$ .
3: $x [n]$ – const double Input
4: $y [n]$ – const double Input: On entry: the coordinates of the $r$ th data point, $(x_{r}, y_{r})$ , for $r = 1, 2, \dots, n$ . x and y must be unchanged from the previous call of e01eac.
5: $f [n]$ – const double Input: On entry: the function values $f_{r}$ at $(x_{r}, y_{r})$ , for $r = 1, 2, \dots, n$ .
6: $triang [7 \times n]$ – const Integer Input: On entry: the triangulation computed by the previous call of e01eac. See Section 9 in e01eac for details of how the triangulation used is encoded in triang.
7: $px [m]$ – const double Input
8: $py [m]$ – const double Input: On entry: the coordinates $({px}_{i}, {py}_{i})$ , for $i = 1, 2, \dots, m$ , at which interpolated function values are sought.
9: $pf [m]$ – double Output: On exit: the interpolated values $F ({px}_{i}, {py}_{i})$ , for $i = 1, 2, \dots, m$ .
10: $fail$ – NagError * Input/Output: The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

6 Error Indicators and Warnings

NE_ALLOC_FAIL: Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
NE_BAD_PARAM: On entry, argument $〈value〉$ had an illegal value.
NE_INT: On entry, $m = 〈value〉$ .
Constraint: $m \geq 1$ .

On entry, $n = 〈value〉$ .
Constraint: $n \geq 3$ .
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.
See Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
NE_NO_LICENCE: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.
NE_TRIANG_INVALID: On entry, the triangulation information held in the array triang does not specify a valid triangulation of the data points. triang has been corrupted since the call to e01eac.
NW_EXTRAPOLATION: At least one evaluation point lies outside the nodal triangulation. For each such point the value returned in pf is that corresponding to a node on the closest boundary line segment.