Linear interpolation  From Wikipedia, the free encyclopedia
  (Redirected from Lerp (computing)) Jump to: navigation, search
Given the two red points, the blue line is the linear
interpolant between the points, and the value y at x may be
found by linear interpolation.  In mathematics, linear
interpolation is a method of curve fitting using linear
polynomials.  Linear interpolation between two known
points[edit]  In this geometric visualisation, the value at the
green circle multiplied by the distance between the red and blue
circles is equal to the sum of the value at the red circle
multiplied by the distance between the green and blue circles,
and the value at the blue circle multiplied by the distance
between the green and red circles.  If the two known points are
given by the coordinates \scriptstyle(x_0,y_0) and
\scriptstyle(x_1,y_1), the linear interpolant is the straight
line between these points. For a value x in the interval
\scriptstyle(x_0, x_1), the value y along the straight line is
given from th