I would like to have more information of the theory behind this. What it means that it is "quadratic"? Should it be exact for 2nd. degree functions? I tried this
X=[1:10 1:10];Y=[zeros(1,10) ones(1,10)];%Data points
f=100*(X').^2; %data points
triplot(tri,X,Y) %to interpret the case
plot(diff(fC));%should be linear if the interpolant is exact for 2nd degree
Apparently from this example the interpolant is C0 (i.e. continuous but not differentiable), but it is a little bit misleading what is meant by "quadratic".
I tried to contact the author before posting, but apparently changed addres. Thank you anyway for his contribution.
I make hundreds of 2D interpolations for a given triangulation. This function is exactly what I need. Thx.
01 Dec 2006
An alternative to griddata - similar in speed when you add in the time for the triangulation.
The advantage of this code is if you already have a triangulation, then this saves the time to regenerate it. It also allows you to use a custom, non-delaunay triangulation - not an option at all for griddata.
A disadvantage of this code is it forces you to do the triangulation to call it. Its an unnecessary step for many people, so I'd probably be tempted to allow the user to not supply the triangulation, so if t is empty it could just call delaunay.
This code offers properties similar to griddata. It will not extrapolate beyond the convex hull of the data, Extrapolation is risky business of course, so thats not necessarily bad.
Good help, examples. The quadratic interpolant is an interesting idea.