Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

  1. How would I do this in $\mathbb{R}^3$, and generally in $\mathbb{R}^k$?

  2. How would I know which points to "connect"? (In the two-dimensional case the sorting takes care of that.)

  3. How complex would it be to calculate such simple interpolations?

share|cite|improve this question
up vote 3 down vote accepted

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

share|cite|improve this answer
Is it also called triangulation for data sets of higher dimensions (my spatial imagination ends at three dimensions :P)? – user8534 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

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.