interpolate 2-D scattered data using the linear triangular interpolation method
listlist, Array, or Matrix of the form x1,y1,x2,y2,…,xn,yn; the (x,y) coordinates of the sample points
list, Array, or Vector of sample values corresponding to the (x,y) points
evaluate f at (x,y)
a k x 2 Matrix of points at which to evaluate f
The LinearTriangularInterpolation command creates a function f⁡x,y=z which can then be evaluated at arbitrary points within the convex hull of the sample points.
The linear triangular interpolant is defined as follows. The Delaunay triangulation on the given input points xy is determined, and the interpolant is defined on each triangle as the linear interpolant between the three z-values at its vertices.
A linear triangular interpolant is C0 continuous.
This interpolation method does not introduce local minima or maxima which are not already present in the input data.
Results may be poor when interpolating near the convex hull of the sample points.
Evaluating f at points outside of the convex hull produces Float⁡undefined.
As with all interpolation methods, the interpolant f always passes through all of the sample values.
Input sample points must not contain duplicates. The presence of duplicate points can lead to unexpected results.
In order to evaluate f at k points, you can put each point in a row of a Matrix M and call f(M) to obtain the k values of f in a k-element Vector. This will be most efficient if M's options are such that its datatype is float, its order is C_order, and its storage is rectangular.
f≔Linear Triangular interpolation object with 9 sample points
f can be polled at specific points.
M := Matrix([[1.5, 0.3], [0.7, 1.4], [1.2, 1.8]], datatype = float, order = C_order);
Use plot3d to plot the interpolated surface.
The Interpolation[LinearTriangularInterpolation] command was introduced in Maple 2018.
For more information on Maple 2018 changes, see Updates in Maple 2018.
Download Help Document
What kind of issue would you like to report? (Optional)