Interpolation Slides - EFTF
Interpolation Slides - EFTF
If models are a collection of implicit functions, the models do not require discretisation, could be
updated with new datasets.
Implicit modelling constraints
f(X) – f’(X) = 0
Gradient normal constraints
Interface
Scalar value
value
constraint
constraint
f(X) – f’(X) = 0
How implicit modelling works
The value of the implicit function is important – derivative = change of function value in x,y,z
◦ Wider range in function value = steeper gradient
Data supported interpolation has one degree of freedom per data point exact interpolation
◦ Combination of fitting a polynomial trend and a local residual
◦ Implicit function guaranteed to fit data
◦ High curvature geometries can require high order polynomials poor extrapolation away from data
and high curvature local features
Different interpolation algorithms are suited to different problems, most software uses only one.
Simple example
Surface locations sampled from flat plane, value =0