Lecture scope: spatial interpolation and approximation
Opening overview of the lecture topic and planned sequence: definition and applications, methods and properties, optimization, accuracy evaluation, and trivariate examples.
NCSU GeoForAll Lab · YouTube · 12:06
This 180-second lecture fragment introduces spatial interpolation and approximation, then moves from a course outline to concrete application cases. It defines bivariate interpolation as constructing a surface from values measured at 2D points, illustrated by converting scattered points to a regular raster grid and by mentioning TIN densification and raster resampling. It then generalizes to trivariate interpolation for 3D soil-property modeling and finally introduces quadrivariate interpolation for spatiotemporal groundwater pollution, although the last spoken explanation is cut off. This 180-second lecture segment uses a groundwater pollution case over 10 years to motivate quadrivariate interpolation, defined as interpolation in 3D space plus time producing a 4D raster. Two visualizations distinguish spatial scatter of wells from their temporal sampling pattern, and an animation shows the resulting evolving subsurface volume. The lecture then states the general interpolation problem: find a function that passes through or close to discrete points and use it to compute values at another set of points, usually a regular grid. Finally, it specializes to the bivariate formulation with m points (,,), a function , the exact-fit condition called interpolation, the error-form called approximation, and grid evaluation . This 180-second lecture segment introduces interpolation principles in a bivariate setting. It first defines the problem as finding a function for given points (, , ), distinguishing exact interpolation from approximation , and then evaluating the fitted function on grid points via . The lecturer next shows that the basic interpolation problem has no unique solution by displaying several different curves through the same data points, concluding that additional conditions are required. The final slide lists three such conditions: locality, geostatistical conditions, and smoothness, with locality explained verbally as limited-distance influence of each point. This lecture segment covers the mathematical foundations of spatial interpolation. It defines three key conditions—locality, geostatistical, and smoothness—that dictate the behavior of interpolation surfaces. The speaker presents a general solution formula combining a trend function and a weighted sum of radial basis functions or variograms. Finally, the lecture introduces local interpolation methods, such as Voronoi polygons, TIN, and IDW, which apply the locality condition by using only a subset of data points for computation. This brief video segment displays a presentation slide introducing the concept of local interpolation. The slide defines local interpolation as using only a small subset of total data points and lists three specific methods or frameworks associated with it: Voronoi polygons, Triangular Irregular Network (TIN), and the Inverse Distance Weighted (IDW) method.
Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.
Generated from the video's visuals and explanation; not verbatim speech.
The fragment opens by naming the subject: spatial interpolation and approximation. The title slide and the lecturer’s first sentence align, establishing that this is the introductory section of a geospatial analysis lecture.
The outline slide then lays out the progression of the full lecture: definition and applications first, then methods and properties, then optimization, accuracy evaluation, and trivariate examples. This is structural context rather than a derivation, but it tells the viewer that the immediate goal is to understand what interpolation is used for.
The first substantive concept is bivariate interpolation. The slide defines it as finding a surface representation from values measured at 2D points. The lecturer expands this definition with three application patterns: converting scattered points, profiles, or isolines to raster; computing a denser or smoother TIN; and resampling a continuous-data raster such as elevation to higher resolution. The key point is that interpolation is not limited to one output format; it serves several related spatial-modeling tasks.
A concrete visual example follows. The slide titled “Scattered points to raster” contrasts an irregular set of red sample points with a regular grid containing both the original red points and new blue points. The lecturer explicitly identifies the red points as given measurements and the blue points as interpolated values. This makes the input-output relationship of bivariate interpolation visible: irregular observations are mapped onto a regular lattice.
The lecture then generalizes from 2D to 3D. The slide states “Trivariate: values measured at 3D points to 3D raster,” and the soil-properties example shows why this is needed: samples may be partially regular horizontally but scattered vertically, with missing locations. The lecturer explains that interpolation can build a volume model from these 3D samples, after which isolines or cross sections can be extracted. This preserves the same logic as the bivariate case while increasing the dimensionality of both input and output.
Finally, the fragment introduces quadrivariate interpolation. The slide defines it as values measured at 3D points over time to a 4D raster, explicitly described as 3D space plus time. The groundwater-pollution example over 10 years illustrates a spatiotemporal field rather than a static surface or volume. The spoken explanation is cut off before the lecturer completes the thought, but the visual definition is clear: this is the next generalization, adding time as an additional interpolation dimension.
The segment opens with the question of when interpolation must handle more than ordinary 2D or 3D fields. The slide states that quadrivariate interpolation applies to values measured at 3D points over time and produces a 4D raster, explicitly decomposed as 3D space plus time. The lecturer reinforces this by saying there are four variables.
The first visualization supports that claim by showing the same groundwater dataset in two ways. On the right, points are placed in a dark 3D volume to show their spatial distribution, with depth exaggerated so vertical scatter is visible. On the left, the same wells are drawn over a surface with vertical stems whose lengths encode time, not depth.
This distinction is crucial: in the time view, each point still has an x,y location, but the plotted vertical extent now represents when measurements occur. The lecturer gives concrete temporal scales, pointing to a length labeled 250 days and another example around 500 days. Some wells have only two temporal observations, while others have four or five, so the data are scattered both in space and in time.
The next slide, “Volume change in time,” shows the intended result of such interpolation: a 4D raster for groundwater pollution over 10 years. Inside a fixed bounding box, a green upper surface and orange-red subsurface plumes evolve through time, illustrating a continuous volumetric field rather than isolated well measurements.
The lecture then abstracts away from the example and states the general interpolation problem. One must find a function that passes through, or at least close to, a given set of discrete points, and then use that function to compute values at a different set of points, usually a regular grid. This makes clear that gridding is the common output target, but the core mathematical object is the fitted function itself.
Finally, the bivariate formulation writes this idea symbolically. Given m points (, , ) for ,m, seek a function . If exactly for every sample point, the slide labels this interpolation. If instead , with an error term, the slide labels this approximation. After F is obtained, values on the output grid are computed as , where (,) are grid points. The slide ends by asking, “Why is this a difficult problem?”, but the clip stops before that question is developed.
The segment opens on a slide titled "Interpolation: principles." The lecturer states the core setup: for a given point , the value of the sought function should equal the measured value . This corresponds to the slide's bivariate formulation with points , , and an unknown function .
The lecture then contrasts exact fitting with relaxed fitting. If one allows a small deviation from the measured value, the slide writes and labels this approximation. The speaker explicitly motivates this by noisy data and the desire to smooth it out.
After the function is constructed, the next step is evaluation elsewhere. The slide states where are grid points, and the lecturer paraphrases this as using the function to compute new values at those locations.
The speaker then poses the key conceptual question: why is this a difficult problem if finding a function through the data points seems simple? The answer given is that the difficulty is not existence but uniqueness.
A new slide appears reading "Problem does not have a unique solution:". Over a set of fixed blue data points, the animation first shows a step-like curve passing through them. The lecturer treats this as one valid interpolant.
A second curve, red and piecewise-linear, is overlaid through the same points. This visual change demonstrates that a different geometric form can satisfy the same interpolation condition.
A third curve, smooth and green, is added. The lecturer comments that although it goes smoothly around the points, it still jumps substantially and has wild geometry, showing that smooth appearance alone does not settle the choice.
A fourth, thick black curve is drawn through the same data points, and the slide text adds "we need additional conditions." The lecturer summarizes the situation: all displayed functions fulfill the given condition, so the real question is which one is right.
The final slide, "Interpolation: conditions," lists three families of extra constraints. First is the locality condition: each point influences the surface only up to a certain distance, equivalently values at a point are similar to values at nearby points. The lecturer explains this verbally as distant points no longer influencing one another.
The same slide also lists geostatistical conditions, described as treating the surface as one realization of a random function with spatial covariance, and smoothness, described as requiring the function to pass through or close to the data points and be as smooth as possible. In this clip, only locality receives a completed spoken explanation before the segment ends.
The lecture begins by outlining the fundamental conditions that govern spatial interpolation surfaces. First, the geostatistical condition treats the surface as a single realization of a random function characterized by spatial covariance, which mathematically describes how the relationship between data points changes as the distance between them increases.
Next, the smoothness condition is introduced. This principle dictates that the interpolation function must pass through or closely approximate the known data points while remaining as smooth as possible. The goal is to avoid artificial sharp turns, abrupt changes, or rough features, ensuring the resulting surface represents the simplest and most continuous function fitting the data.
These conditions converge into a general mathematical solution for interpolation, expressed as . In this equation, is the interpolated value at an unsampled grid point , and represents a low-order polynomial trend. The core of the formula is the summation of weighted functions , where are the coefficients and are the locations of the measured data points.
The function is crucial because it determines the specific shape of the interpolation surface based on the distance between the unsampled and measured points. If the smoothness condition is applied, takes the form of a radial basis function. Conversely, if the geostatistical condition is used, is modeled as a variogram.
Finally, the lecture shifts to local interpolation methods, which directly apply the locality condition. Instead of using all data points to calculate a single grid value, these methods restrict the computation to a small subset of nearby points. Key examples of local methods include Voronoi polygons (nearest neighbor), Triangulated Irregular Networks (TIN), and Inverse Distance Weighted (IDW) interpolation.
The video presents a slide titled 'Interpolation: local'. It explains that local interpolation uses only a small subset of the total points. Three methods are listed: Voronoi polygons, Triangular Irregular Network (TIN) based approaches, and the Inverse distance weighted method. The speaker notes that the properties of these methods will be described in the next section.
Opening overview of the lecture topic and planned sequence: definition and applications, methods and properties, optimization, accuracy evaluation, and trivariate examples.
Bivariate interpolation constructs a surface representation from values measured at 2D points. The video links it to point-to-raster conversion, TIN densification or smoothing, and resampling continuous rasters such as elevation.
The lecturer explicitly lists several uses: converting scattered points, profiles, or isolines to raster; computing denser or smoother TIN; and resampling continuous-data raster to higher resolution.
Example showing irregular red given points transformed into a regular grid with blue interpolated points. The color coding distinguishes observed samples from computed values.
Extension of interpolation from 2D point data to 3D point data, producing a 3D raster. The soil-properties example emphasizes scattered vertical sampling and the creation of a volume model from which isolines or cross sections can be extracted.
Further extension to spatiotemporal data: values measured at 3D points over time are interpolated to a 4D raster combining 3D space and time. The groundwater-pollution example illustrates this case, though the spoken explanation is truncated.
The video defines quadrivariate interpolation as the method needed when values are measured at 3D points over time. It explicitly identifies the four variables as 3D space plus time and states that the desired output is a 4D raster. The groundwater pollution example over 10 years is used to motivate this case.
Scattered well data are shown in two complementary views. One view places points in 3D space with exaggerated depth; the other plots the same wells over a surface where vertical extent represents time. The lecturer notes that wells differ both in horizontal and vertical position and in how many temporal observations they contain, with some having two points over time and others four or five.
In the “surface points in time” display, the vertical direction should not be read as physical depth. The lecturer explains that each point still has an x,y location, but the plotted z-like extent represents distribution in time, illustrated by lengths corresponding to 250 days and around 500 days.
The “Volume change in time” slide visualizes the result of interpolating the groundwater data: a 4D raster over 10 years. A fixed bounding box contains a green surface and orange-red subsurface volumes that change shape through time, representing a continuous pollution field rather than isolated samples.
Interpolation is defined as a two-step problem. First, find a function that passes through or close to a given set of discrete points. Second, use that function to compute values at a different set of points, usually a regular grid. This separates function construction from prediction at new locations.
For simplicity, the lecture specializes to two independent variables. Given m points (, , ), ,m, the task is to find a function that represents the data and can then be evaluated elsewhere.
The slide distinguishes exact fitting from error-based fitting. If at every sample point, that is called interpolation. If , with an error term , that is called approximation.
After constructing , the output field is obtained by evaluating the function at new locations. The slide writes this as , where (,) are grid points.
The lecture defines interpolation as finding a function that passes through, or close to, a given set of discrete points and then using that function to compute values at another set of points, usually a regular grid.
In two spatial dimensions, the input is a set of m points (, , ), and the goal is to determine a function satisfying the chosen fitting condition at each data location.
Interpolation requires exact agreement with the measured values at the data points.
Approximation relaxes exact fitting by allowing a deviation term . The lecturer links this to noisy data and smoothing.
Once is known, new values are computed at target locations (, ), which the slide identifies as grid points.
The main difficulty is not constructing an interpolant but selecting among many possible ones. The video illustrates this by showing several different curves that all pass through the same data points.
Because the basic interpolation condition admits multiple solutions, the lecture states that extra conditions are needed to obtain a unique interpolation function.
Locality means each data point affects the surface only within a limited distance, so far-apart points stop influencing one another. The slide also phrases this as similarity between a point's value and values at nearby points.
The slide presents a probabilistic viewpoint in which the surface is one realization of a random function with spatial covariance.
The slide lists smoothness as another constraint: the function should pass through or close to the data points and be as smooth as possible.
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
Slide text reads “Bivariate interpolation: find surface representation based on values measured at 2D points”.
The lecturer explains using interpolation to convert scattered points, profiles, or isolines to raster and to compute denser or smoother TIN or higher-resolution raster.
Bivariate interpolation
Interpolation that finds a surface representation from values measured at 2D points.
2D point data used to construct a surface or raster representation
Slide text reads “Trivariate: values measured at 3D points to 3D raster”.
The lecturer says interpolation can convert values measured at three-dimensional points to three-dimensional raster.
Trivariate
Interpolation from values measured at 3D points to a 3D raster.
3D point data used to construct a 3D volume model
Slide text reads “Quadrivariate: values measured at 3D points over time to 4D raster (3D space + time)”.
The lecturer introduces higher-dimension interpolation for points in three dimensions over time.
The spoken explanation is cut off before the lecturer completes the quadrivariate example.
Quadrivariate
Interpolation from values measured at 3D points over time to a 4D raster combining 3D space and time.
Spatiotemporal point data with three spatial dimensions plus time
Slide text reads “Quadrivariate: values measured at 3D points over time to 4D raster (3D space + time)”.
The lecturer says that when values are measured over time in three-dimensional space, quadrivariate interpolation is needed because there are four variables.
Quadrivariate
An interpolation setting with four variables, namely three spatial coordinates plus time.
Values measured at 3D points over time; output described as a 4D raster.
Slide text states “4D raster (3D space + time)”.
The lecturer describes obtaining an actual four-dimensional model by interpolating in 3D space and time.
4D raster
A gridded representation whose dimensions are three spatial dimensions plus time.
Used for the groundwater pollution example over 10 years.
The lecturer says each point has its x, y location.
Left visualization shows surface points distributed over a horizontal plane.
x, y
Horizontal spatial coordinates of a measurement point.
Spatial location in the groundwater example.
The lecturer says the z depth is exaggerated in the 3D-space view.
Right visualization is labeled “points in3D space” and shows vertical dispersion of points.
z
Vertical coordinate or depth in the three-dimensional spatial view.
Depth coordinate in the 3D-space visualization.
The lecturer says that in the time-distribution view the z value does not represent the actual three-dimensional location but rather distribution in time.
Left visualization is labeled “surface points in time” and includes a marked length labeled “250 days”.
The lecturer’s wording uses z for the plotted vertical axis in the time view; whether this is a formal coordinate symbol or a descriptive reference to the display axis is not separately defined on screen.
z
In the left “surface points in time” visualization, the plotted vertical extent represents time rather than physical depth.
Time-distribution visualization of well data.
A marked length in the left visualization is labeled “250 days”.
The lecturer says, “for example this length here is 250 days,” then says another point would be around 500 days.
The exact numeric label for the second point is spoken rather than clearly shown as a separate printed value.
250 days
Example time length used to illustrate how vertical extent encodes elapsed time in the surface-points-in-time view.
Temporal scale in the groundwater well example.
Bivariate formulation slide states “Given m-points (, , ), ,m”.
The lecturer says, “So we have m points given by their coordinates.”
m
Number of given discrete points.
Index range ,m in the bivariate interpolation formulation.
Slide shows “(, , ), ,m”.
The lecturer says they will look at the bivariate formulation and have m points x, y, z.
(, , )
Coordinates of the i-th given discrete point, with and as independent spatial coordinates and as the observed value.
,m in the bivariate formulation.
Slide states “find such that for each ,m”.
The lecturer says they are trying to find a function that passes through these points.
The interpolation or approximation function to be found from the discrete data.
Function of two independent variables x and y in the bivariate formulation.
The lecturer states that the lecture discusses spatial interpolation and approximation.
Title slide reads “Spatial interpolation and approximation section I” and “Geospatial Analysis and Modeling: Lecture notes Helena Mitasova, NCSU MEAS”.
Outline slide lists “spatial interpolation: definition, applications”, “methods and their properties”, “optimizing interpolation using splines”, “evaluating interpolation accuracy”, and “trivariate interpolation of volumes and topo-climatology”.
This opening segment defines the lecture topic as spatial interpolation and approximation and previews the structure: first the definition and applications of spatial interpolation, then methods and their properties including Voronoi/TIN, IDW, geostatistics, radial basis functions and splines, followed by optimization, accuracy evaluation, and trivariate interpolation of volumes and topo-climatology.
Applies to the introductory overview of the lecture rather than to a worked mathematical derivation.
Slide text reads “Bivariate interpolation: find surface representation based on values measured at 2D points”.
The lecturer says interpolation is used to convert scattered points, profiles, or isolines to raster, and to compute denser or smoother TIN or resample continuous-data raster such as elevation to higher resolution.
Bivariate interpolation is presented as the construction of a surface representation from values measured at 2D points. The video gives three application patterns: converting scattered point sets, profiles, or isolines into raster form; computing a denser or smoother TIN; and resampling a raster representing continuous data such as elevation to higher resolution.
Input values are measured at 2D points.
Output is a surface representation, raster, or denser/smoothed TIN.
Slide title reads “Scattered points to raster” with labels “Given Points” and “Regular Grid”.
The lecturer says they go from scattered or irregularly distributed points to a regular grid, where red points are given points and blue points are interpolated points.
Left panel shows irregular red points; right panel shows a regular grid of blue points with red given points overlaid.
The example illustrates the basic bivariate interpolation task of transforming an irregular set of known samples into a regular grid. The known samples are visually marked in red, while the interpolated grid nodes are shown in blue, making the distinction between observed data and computed values explicit.
Known samples are irregularly distributed.
Target output is a regular grid.
Slide text reads “Trivariate: values measured at 3D points to 3D raster” and “Soils properties”.
The lecturer says interpolation can convert values measured at three-dimensional points to three-dimensional raster, using soil properties as an example with missing horizontal points and scattered vertical distribution.
Left figure shows colored sample points on a 3D grid with an elevation legend; right figures show layered surfaces and a volume labeled “Volume with high %clay”.
Trivariate interpolation extends the same idea from 2D surfaces to 3D volumes: values measured at 3D points are converted into a 3D raster. The soil-properties example emphasizes that sampling may be only partly regular horizontally but scattered vertically, so interpolation is needed to build a continuous volume model from discrete samples.
Input values are measured at 3D points.
Output is a 3D raster or volume model.
Slide text reads “Quadrivariate: values measured at 3D points over time to 4D raster (3D space + time)” and “Groundwater pollution over 10 years”.
The lecturer begins discussing even higher dimension interpolation when points exist in three dimensions over time.
Left figure shows surface points in time with concentration legend and scale bars; right figure shows animated points in 3D space.
The spoken explanation is truncated before the lecturer finishes the quadrivariate discussion.
Quadrivariate interpolation is introduced as interpolation from values measured at 3D points over time to a 4D raster that combines three spatial dimensions with time. The groundwater-pollution example over 10 years shows that the method applies to spatiotemporal fields rather than only static spatial surfaces or volumes.
Input values are measured at 3D points over time.
Output is a 4D raster combining 3D space and time.
Slide title “When to use interpolation” and text “Quadrivariate: values measured at 3D points over time to 4D raster (3D space + time)”.
The lecturer says that if values were measured over time in three-dimensional space, quadrivariate interpolation is needed because there are four variables.
Quadrivariate interpolation is introduced as the method needed when observations are scattered in three-dimensional space and also vary over time. The video explicitly identifies the four variables as 3D space plus time, and the desired output is a 4D raster.
Input values are measured at 3D points over time.
Output is a 4D raster consisting of 3D space plus time.
Slide text: “Problem definition: find a function which passes through (or close to) the given set of discrete points and then use this function to compute the values at a different set of points – usually a regular grid”.
The lecturer restates that the task is to find a function passing through or close to the given discrete points and then use it to compute values at a different set of points, usually a regular grid.
The video defines interpolation at the level of the whole problem: first construct a function that matches or closely fits a given set of discrete observations, then evaluate that function at another set of locations, typically a regular grid. This separates the fitting stage from the prediction stage.
There is a given set of discrete points.
A function must pass through or close to those points.
The function is then evaluated at a different set of points, usually a regular grid.
Slide text: “Given m-points (, , ), ,m find such that for each ,m” followed by “ - interpolation” and “ - approximation”.
The lecturer says they will look at the bivariate formulation for simplicity and describes finding a function that passes through the points.
The spoken explanation reaches only the start of the interpolation condition before the clip ends; the full verbal elaboration of both formulas is not present in the audio.
The bivariate formulation takes m observed points (, , ) and seeks a function . If the function satisfies exactly at every sample point, the video labels this interpolation. If instead , with an added error term, the video labels this approximation. The same function is then used to compute at grid points (,).
Given m points (,,) with ,m.
Find a function .
Interpolation requires exact matching at the sample points.
Approximation allows an error term .
Grid values are computed by evaluating F at (,).
Slide heading: Problem definition.
Slide text: find a function which passes through (or close to) the given set of discrete points; use this function to compute the values at a different set of points – usually a regular grid.
The lecturer explains finding a function and then using it to compute new z values at grid points.
The video defines the interpolation problem as finding a function that passes through, or close to, a given set of discrete points, and then using that function to compute values at another set of points, usually a regular grid.
Input is a discrete set of points.
Output is evaluated at a different set of points, usually a regular grid.
Slide heading: Bivariate formulation.
Given m-points (, , ), ,m find such that for each ,m ...
In the bivariate setting, one is given m points (, , ) and seeks a function satisfying the chosen fitting condition at each data location.
There are m given data points.
The unknown is a function of two variables x and y.
Slide line labeled interpolation: .
The lecturer says the value of this function will be the measured value .
Interpolation requires the fitted function to match the measured value exactly at every given data point.
Applies when exact passage through all data points is required.
Slide line labeled approximation: .
The lecturer says we can allow a small deviation from this value , and this deviation will be this e.
The lecturer adds that approximation is needed if the data are noisy and we are trying to smooth it out.
Approximation relaxes exact fitting by allowing a deviation between the measured value and the fitted function value. The lecturer explicitly links this relaxation to noisy data and smoothing.
Used when the fitted surface need not pass exactly through the data.
Motivated in the video by noisy data and smoothing.
Slide text equates quadrivariate with “3D space + time” and a “4D raster”.
The lecturer says, “We have four variables.”
When data are measured at 3D points over time, the interpolation problem is quadrivariate because it involves four variables: three spatial dimensions and time.
Values are measured at 3D points.
Measurements occur over time.
For the groundwater example and the stated class of 3D-plus-time data.
The slide explicitly labels “” as interpolation and “” as approximation.
In the bivariate formulation, interpolation means the fitted function matches the observed values exactly at the sample points, while approximation means the observed values differ from the function by an error term.
A function is being fitted to m points (,,).
For each ,m.
Slide text: Problem does not have a unique solution:
The lecturer says the difficulty is there is no unique solution to this problem.
Several different curves are drawn through the same set of blue points.
Given only the requirement that a function pass through the data points, the interpolation problem does not have a unique solution.
A finite set of data points is given.
No extra constraints beyond passage through the points are imposed.
There exist multiple functions satisfying the same interpolation condition.
Slide text: we need additional conditions.
The lecturer says to find a unique interpolation function, we need additional conditions.
To obtain a unique interpolation function, additional conditions must be imposed beyond merely passing through the data points.
The underlying interpolation problem is non-unique without further restrictions.
For the class of problems discussed in the lecture.
The lecturer says we need this approximation if the data are noisy and we are trying to smooth it out.
The approximation equation includes the deviation term .
Approximation is needed when the data are noisy and the goal is to smooth them out rather than force exact passage through every point.
The data contain noise.
Smoothing is desired.
Stated as a practical motivation in the lecture.
The lecturer explains that the groundwater wells are scattered in horizontal and vertical directions and also over time, with some wells having only two temporal points and others four or five.
Two visualizations show points in 3D space and surface points in time for groundwater pollution over 10 years.
The example data are well measurements located in three-dimensional space.
The slide labels the case as values measured at 3D points and the right visualization is titled “points in3D space”.
The same wells are also sampled repeatedly over time, not just once.
The lecturer states that some wells have only two points over time and others have four or five points over time.
Therefore the data are scattered both in space and in time.
The lecturer explicitly says the data are scattered both in space and time.
To obtain an actual four-dimensional model, one must interpolate in 3D space and time.
This is the lecturer’s concluding statement for the example before moving to the animation.
The groundwater pollution example motivates quadrivariate interpolation because the observations vary across three spatial dimensions and time simultaneously.
Slide shows the sequence from given m-points to finding , then computing where (,) are grid points.
The clip ends before the lecturer verbally develops the “Why is this a difficult problem?” prompt.
Start with m discrete observed points, each having two independent coordinates and one observed value.
This is the given data statement on the bivariate formulation slide.
Seek a function of two variables that represents the sample data.
The slide explicitly asks to find such .
If the function reproduces every observed exactly at its own sample location, the relation is called interpolation.
The slide labels this equation “interpolation”.
If the observed value differs from the function value by an error term, the relation is called approximation.
The slide labels this equation “approximation”.
Once F is chosen, evaluate it at new locations (,) to produce values on a regular grid.
The slide states “and compute where (,) are grid points”.
The bivariate formulation turns discrete samples into predicted grid values by first constructing , either exactly interpolating or approximately fitting the data, and then evaluating F at grid locations.
A step-like curve through the blue points is shown first.
A piecewise-linear red curve through the same points is added.
A smooth green curve through the same points is added.
A thick black curve through the same points is added.
The lecturer contrasts steps, spikes, smooth behavior, and wild geometry while noting all functions pass through the blue points.
Start with a fixed set of blue data points.
These are the given points that any candidate interpolant must pass through.
Draw one admissible function as a step-like curve through the points.
The lecturer presents this as a function that passes through the data points.
Draw a second admissible function as a piecewise-linear curve through the same points.
This shows a different geometric form satisfying the same passage condition.
Draw a third admissible function as a smooth curve through the same points.
The lecturer uses it to contrast with the previous sharper shapes.
Draw a fourth admissible function as a thick black curve through the same points.
The lecturer explicitly says this black function again fulfills the given condition.
Conclude that multiple different functions satisfy the same interpolation condition.
Since all displayed curves pass through the same blue points, the solution cannot be unique without extra constraints.
The example sequence proves non-uniqueness constructively by exhibiting several different functions that all interpolate the same data.
The lecturer asks why this is a difficult problem and says finding a function which passes through the data points should be fairly simple.
The lecturer then says the difficulty is there is no unique solution to this problem.
The later slide states: Problem does not have a unique solution: we need additional conditions.
The lecturer first frames the task as finding a function through the data points.
This matches the earlier problem definition on the slide.
She notes that this part sounds fairly simple.
This is stated directly in the audio.
She identifies the actual difficulty as non-uniqueness of the solution.
The audio explicitly says the difficulty is there is no unique solution.
Therefore the problem becomes difficult not because no interpolant exists, but because many do.
This follows from the visual demonstration of multiple admissible curves.
The central difficulty of interpolation is selecting among many valid functions, not merely constructing one.
Slide title “Scattered points to raster”; labels “Given Points” and “Regular Grid”.
The lecturer explicitly identifies red points as given points and blue points as interpolated points.
Two side-by-side panels compare irregular red samples with a regular blue grid containing the same red samples.
Given an irregular set of measured points, produce values on a regular grid.
Red points represent given measurements.
The target layout is a regular grid.
Transform scattered observations into interpolated values at regular grid nodes.
Start from the left panel showing irregularly distributed known points.
The slide labels this panel “Given Points”.
Move to the right panel where a regular grid of blue points is overlaid with the original red points.
The lecturer states that the blue points are interpolated points and the red points are given points.
The example demonstrates bivariate interpolation as conversion from scattered 2D samples to a regular raster grid.
Visual comparison of the two panels confirms that the original red samples remain present while additional blue grid nodes are introduced.
Slide text “Trivariate: values measured at 3D points to 3D raster” and “Soils properties”.
The lecturer describes missing horizontal points and scattered vertical distribution, then says a volume model can be created and isolines or cross sections extracted.
Left figure shows 3D sample points with elevation legend; right figures show layered surfaces and a volume labeled “Volume with high %clay”.
Use 3D point measurements of soil properties to create a continuous 3D model.
Measurements are located at 3D points.
Horizontal coverage has missing points.
Vertical sampling is scattered.
Generate a 3D raster volume from which isolines or cross sections can be extracted.
Begin with discrete soil-horizon samples plotted in 3D space.
The left figure shows colored sample points associated with elevation.
Apply trivariate interpolation to convert those 3D point values into a 3D raster.
The slide text explicitly states “values measured at 3D points to 3D raster”.
From the resulting volume model, extract derived representations such as layered surfaces, isolines, or cross sections.
The lecturer says these outputs can be extracted from the 3D raster.
The example shows trivariate interpolation producing a 3D volume model of soil properties from scattered 3D samples.
The right-side figures display layered surfaces and a volume labeled “Volume with high %clay”, consistent with the stated extraction from a 3D raster.
Slide text “Quadrivariate: values measured at 3D points over time to 4D raster (3D space + time)” and “Groundwater pollution over 10 years”.
Left figure shows “surface points in time” with concentration legend and scale bars; right figure shows animated “points in 3D space”.
The lecturer begins introducing higher-dimension interpolation for points in three dimensions over time, but the sentence is cut off.
The spoken explanation is incomplete because the clip ends during the introduction.
No explicit final result is stated within this fragment.
Represent groundwater pollution measured at 3D points over a 10-year period as a 4D field.
Measurements occur at 3D points.
The example spans time over 10 years.
The target representation is a 4D raster combining 3D space and time.
Introduce quadrivariate interpolation for spatiotemporal data.
Recognize that the data include both spatial location and time.
The slide text explicitly says “3D points over time to 4D raster (3D space + time)”.
Use the groundwater-pollution example to motivate interpolation beyond static 3D volumes.
The slide title and figures present “Groundwater pollution over 10 years”.
The fragment presents quadrivariate interpolation as extension of trivariate interpolation by adding the time dimension.
The visual pairing of “surface points in time” and animated “points in 3D space” supports the stated 3D-space-plus-time formulation.
Slide text: “Groundwater pollution over 10 years” and “Quadrivariate: values measured at 3D points over time to 4D raster (3D space + time)”.
Left image labeled “surface points in time”; right image labeled “points in3D space”; later slide “Volume change in time” shows an animated 3D volume evolving within a bounding box.
The lecturer describes wells scattered horizontally and vertically, with different numbers of temporal observations per well, and says a 4D model requires interpolation in 3D space and time.
The exact pollutant variable represented by the color scale is not fully legible from the available evidence; the clip clearly supports groundwater pollution over time but not a precise chemical name.
Use scattered groundwater measurements over space and time to motivate what kind of interpolation is needed.
Groundwater pollution data over 10 years.
Measurements come from wells distributed in 3D space.
Each well may have multiple temporal observations.
Some wells have only two points over time; others have four or five.
Explain why this dataset calls for quadrivariate interpolation and what the resulting model represents.
Identify the spatial scatter of the wells in horizontal and vertical directions.
The lecturer explicitly points out scatter in both directions using the 3D-space visualization.
Identify the temporal scatter by noting unequal numbers of repeated measurements per well.
The lecturer says some wells have two temporal points and others have four or five.
Conclude that the data live in 3D space plus time, so the interpolation problem has four variables.
This follows directly from the slide definition of quadrivariate interpolation.
Show the desired result as a 4D raster or evolving volume model.
The slide text names a 4D raster, and the next slide animates volume change in time.
The groundwater example requires quadrivariate interpolation because the observations are scattered in three spatial dimensions and over time; the desired output is a 4D raster representing the evolving pollution volume.
The conclusion is checked against the slide text “3D space + time” and the animation titled “Volume change in time”, which visualizes the interpolated 4D result.
Static title slide followed by a static outline slide listing lecture sections.
The lecturer verbally matches the outline topics.
Title slide
Outline slide
Transition from title slide to outline slide at about 6 seconds.
Text content remains static while displayed.
These slides establish the lecture topic and sequence of subtopics without showing mathematical animation.
Slide titled “When to use interpolation” with text defining bivariate interpolation and two images: a blue point cloud and a colored 3D surface.
A green arrow is drawn from the point cloud toward the surface around 90–95 seconds.
Blue scattered point cloud
Colored 3D surface
Green arrow
Green arrow is added from the point cloud to the surface near the end of the interval.
The underlying slide text and images remain unchanged.
The arrow visually encodes the transformation from discrete 2D-point measurements to a continuous surface representation.
Two-panel slide labeled “Given Points” and “Regular Grid”.
A green arrow is drawn from the left panel to the right panel around 105–110 seconds.
Left panel with red irregular points
Right panel with blue regular grid and red points
Green arrow
Green arrow appears connecting the left panel to the right panel.
Point colors and panel labels remain fixed.
The diagram distinguishes observed samples (red) from interpolated grid nodes (blue) and shows the mapping from irregular sampling to regular raster structure.
Slide titled “When to use interpolation” with text “Trivariate: values measured at 3D points to 3D raster” and “Soils properties”.
Left figure includes an elevation legend and 3D sample points; right figures show layered surfaces and a volume labeled “Volume with high %clay”.
A green arrow is drawn from the left figure toward the right-side outputs around 155–165 seconds.
3D sample-point figure
Elevation legend
Layered surface figures
Volume with high %clay
Green arrow
Green arrow is added from the sample-point figure to the derived 3D outputs.
Slide text and figure labels remain static.
The visual sequence represents construction of a 3D raster volume from scattered 3D measurements and subsequent extraction of layered or volumetric features.
Slide titled “When to use interpolation” with text “Quadrivariate: values measured at 3D points over time to 4D raster (3D space + time)” and “Groundwater pollution over 10 years”.
Right-side figure animates points in 3D space while the left figure remains static.
The clip ends before the lecturer completes the explanation.
Left static 3D plot labeled “surface points in time”
Right animated plot labeled “points in 3D space”
Concentration legend
Scale bars
Right-side point cloud animates through time-like evolution.
Slide text and left figure remain fixed.
The animation illustrates that the field varies not only in 3D space but also over time, motivating a 4D raster representation.
Left panel labeled “surface points in time” shows colored vertical stems over a green surface with a marked “250 days” length; right panel labeled “points in3D space” shows white points and stems inside a dark 3D volume.
The lecturer contrasts the two views, saying one shows distribution in 3D space with exaggerated depth and the other shows distribution in time where z no longer represents physical location.
The exact meaning of the color legend on the left panel is not fully readable from the available evidence.
Green topographic or surface plane
Colored vertical stems and points
Dark 3D volume with white points
Labels “surface points in time” and “points in3D space”
Marked length “250 days”
The lecturer shifts attention from the right 3D-space view to the left time view.
In the left view, vertical extent is interpreted as time rather than depth.
Different wells are described as having different numbers of temporal observations.
Both panels represent the same groundwater dataset.
The overall topic remains scattered measurements requiring interpolation.
The two visualizations separate the two sources of scatter: spatial distribution in 3D and temporal repetition at the wells. Together they justify a four-variable interpolation problem.
Slide title “Volume change in time” with subtitle “Groundwater pollution over 10 years - 4D raster (3D space + time)”.
A green upper surface and orange-red subsurface volumes appear inside a red bounding box and change shape over time.
The lecturer says, “you have already seen this animation,” linking it to the need to interpolate in 3D space and time.
The exact quantitative meaning of the orange-red volume boundaries is not stated in the clip.
Red wireframe bounding box
Green surface layer
Orange and red subsurface plume volumes
The subsurface plume volumes expand, contract, and shift position through the animation.
The green surface remains as a reference boundary above the subsurface volumes.
The bounding box frame stays fixed.
The scene is presented as a 4D raster over 10 years.
The animation visualizes the result of interpolating scattered groundwater measurements into a continuous time-evolving 3D volume field.
Slide title “Interpolation: principles” with section “Problem definition” and the sentence about finding a function through or close to discrete points and computing values at a different set of points, usually a regular grid.
A pointer moves under key phrases such as “function”, “discrete points”, and “different set of points” while the lecturer speaks.
Title “Interpolation: principles”
Section heading “Problem definition”
Pointer or cursor highlighting words in the sentence
The pointer emphasizes successive phrases in the definition as the lecturer paraphrases them.
The slide remains text-only during this interval.
The definition stays focused on function construction and evaluation at new points.
This segment converts the motivating examples into a general mathematical problem statement: fit a function to discrete data, then evaluate it elsewhere, usually on a regular grid.
Slide adds “Bivariate formulation” with “Given m-points (, , ), ,m find such that for each ,m”, then the two equations for interpolation and approximation, then “and compute where (,) are grid points”, plus the red question “Why is this a difficult problem?”.
A pointer circles or underlines parts of the formulas as the lecturer begins explaining them.
The lecturer’s spoken explanation of the formulas is incomplete within the clip.
Bivariate formulation equations
Pointer marks around
Red question text “Why is this a difficult problem?”
Attention moves from the general problem statement to explicit symbolic notation.
The distinction between interpolation and approximation is highlighted by separate equations.
The setting remains bivariate, with two independent variables x and y.
The output locations are identified as grid points (,).
The slide formalizes the earlier verbal definition: discrete samples lead to a function , exact fitting is interpolation, error-based fitting is approximation, and grid prediction uses .
Static slide titled Interpolation: principles with problem definition, bivariate formulation, interpolation and approximation equations, and grid-point evaluation.
A pointer moves over the equations and the phrase 'usually a regular grid'.
Title 'Interpolation: principles'
Problem definition text
Bivariate formulation text
Equation
Equation
Grid-point formula
Pointer
Pointer highlights the interpolation equation, then the approximation equation, then the grid-point formula.
The slide content remains the same throughout this interval.
This visual establishes the formal definitions of interpolation, approximation, and subsequent evaluation on grid points.
A dark blue step-like curve passes through six light-blue circular data points.
The lecturer says we can draw or find a function which looks like this and it passes through the data points.
Six light-blue data points
Dark blue step-like curve
Pointer
The step-like curve is introduced as one admissible solution.
The data points remain fixed.
This shows that a discontinuous-looking step function can still satisfy the condition of passing through the given points.
A red piecewise-linear curve is overlaid through the same six data points.
The lecturer says we don't like these steps and want a different kind of function.
Same six data points
Red piecewise-linear curve
Previous step-like curve
A new red polygonal curve is added through the same points.
The data points remain unchanged.
This provides a second geometrically different interpolant, reinforcing non-uniqueness.
The lecturer lists multiple uses of interpolation: converting scattered points, profiles, or isolines to raster; computing denser or smoother TIN; and resampling continuous-data raster to higher resolution.
Slide text includes both raster conversion and TIN/resampling applications.
One might think spatial interpolation only means turning scattered points into a raster.
The video explicitly presents additional uses: creating denser or smoother TINs and resampling existing continuous-data rasters to higher resolution.
The lecturer states that red points are given points and blue points are interpolated points.
The right panel overlays blue regular-grid nodes with the original red samples.
In the regular-grid figure, all visible points could be mistaken for measured data.
The video distinguishes red given points from blue interpolated points, so only the red points are original measurements.
The lecturer explicitly says that in the time-distribution view the z value does not represent the actual three-dimensional location but rather distribution in time.
The left visualization is labeled “surface points in time” and uses vertical extent to indicate days.
Because both visualizations use a vertical direction, one may assume the upward axis always means spatial depth.
The video distinguishes two views: in “points in3D space” the vertical coordinate is depth, but in “surface points in time” the vertical extent encodes time, with example lengths such as 250 days and around 500 days.
The problem definition says to find a function through or close to discrete points and then use that function to compute values at a different set of points, usually a regular grid.
The lecturer frames gridding as the usual target set, not the whole definition.
One might think interpolation is only the act of placing values onto a regular grid.
The video defines interpolation as a two-stage problem: first construct a function from discrete observations, then evaluate that function at other points, which are often but not definitionally restricted to a regular grid.
The slide separately labels “ - interpolation” and “ - approximation”.
One might use “interpolation” loosely for any fitted surface through data.
In the displayed bivariate formulation, interpolation requires exact equality at the sample points, whereas approximation allows an error term .
The lecturer says finding a function which passes through the data points should be fairly simple.
She immediately follows with: The difficulty is there is no unique solution to this problem.
One may think interpolation is difficult because no function can pass through the data points.
The video states that such functions are easy to find; the real difficulty is that many different functions satisfy the same condition, so the solution is not unique.
The lecturer says we would like it to go smoothly around the points, but then comments that it jumps quite a bit around these points and has a pretty wild geometry.
The green curve is smooth yet still visually extreme between data points.
A smooth curve through the points may be taken as automatically satisfactory.
In the video's example, even a smooth curve can have wild geometry between points, so smoothness by itself is presented as only one possible condition, not a complete solution.
After the outline, the lecturer moves to the first substantive topic, “when do we need to use interpolation”.
Outline lists “spatial interpolation: definition, applications”, then the next slide defines bivariate interpolation.
The general lecture topic contains the specific case of bivariate interpolation as its first application-focused subsection.
The lecturer says “So here is the example that we have already used” after describing conversion of scattered points to raster.
The next slide is titled “Scattered points to raster”.
The scattered-points-to-raster example is a direct application of the bivariate interpolation definition.
The lecturer transitions from 2D surface examples to “values measured at three-dimensional points to three-dimensional raster”.
Slide changes from bivariate surface examples to “Trivariate: values measured at 3D points to 3D raster”.
Trivariate interpolation generalizes the same interpolation idea from 2D point data and surfaces to 3D point data and volumes.
The lecturer says they can also use even higher dimension interpolation if points exist in three dimensions over time.
Slide text changes to “Quadrivariate: values measured at 3D points over time to 4D raster (3D space + time)”.
The spoken explanation is cut off before completion.
Quadrivariate interpolation generalizes trivariate interpolation by adding time as an extra dimension to the 3D spatial field.
The same slide presents “Quadrivariate” and “Groundwater pollution over 10 years” together.
The lecturer uses the groundwater wells as the motivating case for needing four-variable interpolation.
The groundwater pollution dataset is used as the concrete application that motivates quadrivariate interpolation.
The lecture moves from “Problem definition” to “Bivariate formulation” on consecutive slides.
The lecturer says they will look at the bivariate formulation for the sake of simplicity.
The bivariate formulation is the simplified two-variable version of the general interpolation problem stated just before it.
The slide places the exact-fit equation and the error-term equation side by side with different labels.
Within the bivariate formulation, exact matching and error-based fitting are contrasted as interpolation versus approximation.
The problem definition mentions computing values at a different set of points, usually a regular grid; the bivariate slide then writes where (,) are grid points.
The symbolic bivariate formulas depend on the earlier verbal definition: first find a function from discrete points, then evaluate it at new grid locations.
The slide first gives the general problem definition and then the bivariate formulation beneath it.
The bivariate formulation is the specific mathematical version of the general interpolation problem definition shown on the same slide.
Within the bivariate formulation, the line is labeled interpolation.
The exact interpolation condition is one of the two alternatives specified inside the bivariate formulation.
Within the bivariate formulation, the line is labeled approximation.
The approximation condition is the second alternative specified inside the bivariate formulation.
The slide places the interpolation and approximation equations one above the other with contrasting labels.
The lecturer contrasts exact matching with allowing a small deviation e.
Interpolation requires exact equality at the data points, whereas approximation allows a deviation term .
Slide explicitly defines bivariate interpolation.
Lecturer explains its uses for surfaces, rasters, and TINs.
The lecturer states red points are given points and blue points are interpolated points.
Two-panel slide contrasts “Given Points” and “Regular Grid”.
Slide text contrasts 2D-point surface interpolation with 3D-point to 3D-raster interpolation.
Lecturer explains soil properties sampled in 3D and modeled as a volume.
Slide text states “3D points over time to 4D raster (3D space + time)”.
Lecturer begins explaining higher-dimension interpolation but is cut off.
The spoken explanation is incomplete in this fragment.
The lecturer lists conversion to raster, denser/smoother TIN, and resampling continuous rasters.
Slide bullets list these applications.
Slide text defines quadrivariate as 3D space + time.
The lecturer says there are four variables.
The lecturer says the z value in the left view represents distribution in time, not actual 3D location.
The left visualization is labeled “surface points in time” and includes “250 days”.
Problem definition slide text is fully visible.
The lecturer paraphrases the same definition.
The slide explicitly labels the two equations as interpolation and approximation.
Slide states “compute where (,) are grid points”.
Slide heading Problem definition and the text about finding a function through discrete points.
Two adjacent equations labeled interpolation and approximation.
The lecturer contrasts exact matching with allowing a small deviation e.
Covered · Title slide and opening statement identify the lecture topic as spatial interpolation and approximation.
Covered · Outline slide lists the lecture sections and the lecturer verbally previews them.
Covered · Slide defines bivariate interpolation and the lecturer lists applications including point-to-raster conversion, TIN densification/smoothing, and resampling continuous rasters.
Covered · Diagram contrasts given red points with interpolated blue grid points in a scattered-points-to-raster example.
Covered · Slide and narration introduce trivariate interpolation using soil properties sampled at 3D points and converted to a 3D raster volume.
Covered · Slide introduces quadrivariate interpolation for groundwater pollution over 10 years as 3D space plus time; the spoken explanation is truncated but the visual definition is complete enough to cover the interval.
Covered · Lecture introduces quadrivariate interpolation using groundwater pollution over 10 years and contrasts spatial scatter with temporal scatter.
Covered · Slide “Volume change in time” shows the 4D raster result as an animated evolving subsurface volume.
Covered · Text slide gives the general problem definition of interpolation: find a function through or close to discrete points, then evaluate it at another set of points, usually a regular grid.
Covered · Bivariate formulation slide introduces m points, , exact interpolation versus approximation with error term, and computation at grid points; the red question “Why is this a difficult problem?” appears but is not developed further within the clip.
Covered · Static principles slide with spoken definitions of interpolation, approximation, and grid evaluation.
Covered · Graphical demonstration that multiple different functions pass through the same data points, followed by the statement that additional conditions are needed.
Covered · Conditions slide listing locality, geostatistical conditions, and smoothness; only locality is verbally developed before the clip ends.
Covered · Discussion of interpolation conditions.
Covered · Presentation of the general interpolation formula.
Covered · Introduction to local interpolation methods.
Covered · The entire 6-second clip consists of a single static slide introducing local interpolation and listing three related methods.
Reviewed subject paths
The groundwater example requires quadrivariate interpolation because the observations are scattered in three-dimensional space and also vary over time. This involves four variables: three spatial dimensions and time.
Conditions: Input values are measured at 3D points over time.; Output is a 4D raster combining 3D space and time.
Bivariate interpolation is the process of finding a surface representation based on values measured at 2D points. Its main applications include converting scattered points, profiles, or isolines into a raster format, computing a denser or smoother Triangulated Irregular Network (TIN), and resampling continuous-data rasters, such as elevation, to a higher resolution.
Conditions: Input values are measured at 2D points.; Output is a surface representation, raster, or denser/smoothed TIN.
In the bivariate formulation, interpolation requires the fitted function to match the measured values exactly at every given data point, expressed as . Approximation relaxes this exact fitting by allowing a deviation or error term , expressed as .
Conditions: Given m points with .; Find a function .; Interpolation requires exact matching at the sample points.; Approximation allows an error term .
Interpolation is said to have no unique solution because, given only the requirement that a function pass through the data points, there exist infinitely many different functions that can satisfy this exact condition. The difficulty of the problem lies not in the existence of an interpolant, but in selecting among the many valid functions.
Conditions: A finite set of data points is given.; No extra constraints beyond passage through the points are imposed.
The locality condition means that each data point influences the interpolated surface only up to a certain distance. Equivalently, the value at a given point will be similar to the values at nearby points, and distant points do not continue to influence one another.
Conditions: Presented as a basic condition fulfilled by almost all interpolation methods.; Applies to local interpolation methods.
Local interpolation methods differ from global ones by using only a small subset of the total available data points to compute the value at a specific grid point. Global methods, by contrast, typically use all data points to construct a single continuous function for the entire domain.
Conditions: The method is a local interpolation technique.; The total number of available data points is .; The number of points in the local subset is , where .
In the “surface points in time” visualization, the vertical axis represents the distribution in time, not the actual three-dimensional physical location or depth. Each point still has an x, y horizontal location, but the plotted vertical extent encodes elapsed time, as illustrated by lengths corresponding to 250 days and around 500 days.
Conditions: The visualization is the left panel labeled “surface points in time”.; The data represents groundwater measurements over time.
Trivariate interpolation differs from bivariate interpolation by operating on values measured at 3D points to produce a 3D raster or volume model, whereas bivariate interpolation uses 2D points to produce a 2D surface. In trivariate interpolation, the sampling may be only partly regular horizontally but scattered vertically, requiring the construction of a continuous volume model from discrete 3D samples.
Conditions: Input values are measured at 3D points.; Output is a 3D raster or volume model.