Simple linear interpolation in $\mathbb{R}^k$?

Question

When doing simple linear interpolation on a data set in $\mathbb{R}^2$, I just sort the points by one co-ordinate and then do piecewise interpolation between a point and its successor in the sorted data set.

How would I do this in $\mathbb{R}^3$, and generally in $\mathbb{R}^k$?
How would I know which points to "connect"? (In the two-dimensional case the sorting takes care of that.)
How complex would it be to calculate such simple interpolations?

score 3 · Accepted Answer · answered Mar 21 '11 at 16:59

3

You need to triangulate the data set then do linear interpolation within each triangle (simplex, in higer-dimensions).

answered Mar 21 '11 at 16:59

lhf

216,483

Is it also called triangulation for data sets of higher dimensions (my spatial imagination ends at three dimensions :P)? – Mar 21 '11 at 17:12
Mostly, yes, although some people say tetrahedralization in 3d solid data, in contrast with 3d surface data, which can be triangularized. – lhf Mar 21 '11 at 17:16

Simple linear interpolation in $\mathbb{R}^k$?

1 Answers1