 Slerp
Get Slerp essential facts below. View Videos or join the Slerp discussion. Add Slerp to your PopFlock.com topic list for future reference or share this resource on social media.
Slerp

In computer graphics, Slerp is shorthand for spherical linear interpolation, introduced by Ken Shoemake in the context of quaternion interpolation for the purpose of animating 3D rotation. It refers to constant-speed motion along a unit-radius great circle arc, given the ends and an interpolation parameter between 0 and 1.

Geometric Slerp

Slerp has a geometric formula independent of quaternions, and independent of the dimension of the space in which the arc is embedded. This formula, a symmetric weighted sum credited to Glenn Davis, is based on the fact that any point on the curve must be a linear combination of the ends. Let p0 and p1 be the first and last points of the arc, and let t be the parameter, 0 t subtended by the arc, so that , the n-dimensional dot product of the unit vectors from the origin to the ends. The geometric formula is then

$\operatorname {Slerp} (p_{0},p_{1};t)={\frac {\sin {[(1-t)\Omega }]}{\sin \Omega }}p_{0}+{\frac {\sin[t\Omega ]}{\sin \Omega }}p_{1}.$ The symmetry can be seen in the fact that . In the limit as ? -> 0, this formula reduces to the corresponding symmetric formula for linear interpolation,

$\operatorname {Lerp} (p_{0},p_{1};t)=(1-t)p_{0}+tp_{1}.\,\!$ A Slerp path is, in fact, the spherical geometry equivalent of a path along a line segment in the plane; a great circle is a spherical geodesic.

More familiar than the general Slerp formula is the case when the end vectors are perpendicular, in which case the formula is . Letting , and applying the trigonometric identity , this becomes the Slerp formula. The factor of in the general formula is a normalization, since a vector p1 at an angle of ? to p0 projects onto the perpendicular ?p0 with a length of only .

Some special cases of Slerp admit more efficient calculation. When a circular arc is to be drawn into a raster image, the preferred method is some variation of Bresenham's circle algorithm. Evaluation at the special parameter values 0 and 1 trivially yields p0 and p1, respectively; and bisection, evaluation at ½, simplifies to , normalized. Another special case, common in animation, is evaluation with fixed ends and equal parametric steps. If pk-1 and pk are two consecutive values, and if c is twice their dot product (constant for all steps), then the next value, pk+1, is the reflection .

Quaternion Slerp

When Slerp is applied to unit quaternions, the quaternion path maps to a path through 3D rotations in a standard way. The effect is a rotation with uniform angular velocity around a fixed rotation axis. When the initial end point is the identity quaternion, Slerp gives a segment of a one-parameter subgroup of both the Lie group of 3D rotations, SO(3), and its universal covering group of unit quaternions, S3. Slerp gives a straightest and shortest path between its quaternion end points, and maps to a rotation through an angle of 2?. However, because the covering is double (q and -q map to the same rotation), the rotation path may turn either the "short way" (less than 180°) or the "long way" (more than 180°). Long paths can be prevented by negating one end if the dot product, , is negative, thus ensuring that -90°

Slerp also has expressions in terms of quaternion algebra, all using exponentiation. Real powers of a quaternion are defined in terms of the quaternion exponential function, written as and given by the power series equally familiar from calculus, complex analysis and matrix algebra:

$e^{q}=1+q+{\frac {q^{2}}{2}}+{\frac {q^{3}}{6}}+\cdots +{\frac {q^{n}}{n!}}+\cdots .$ Writing a unit quaternion q in versor form, , with v a unit 3-vector, and noting that the quaternion square v2 equals -1 (implying a quaternion version of Euler's formula), we have , and . The identification of interest is , so that the real part of q is , the same as the geometric dot product used above. Here are four equivalent quaternion expressions for Slerp.

{\begin{aligned}\operatorname {Slerp} (q_{0},q_{1},t)&=q_{0}(q_{0}^{-1}q_{1})^{t}\\[6pt]&=q_{1}(q_{1}^{-1}q_{0})^{1-t}\\[6pt]&=(q_{0}q_{1}^{-1})^{1-t}q_{1}\\[6pt]&=(q_{1}q_{0}^{-1})^{t}q_{0}\end{aligned}} The derivative of with respect to t, assuming the ends are fixed, is log(q1q0-1) times the function value, where the quaternion natural logarithm in this case yields half the 3D angular velocity vector. The initial tangent vector is parallel transported to each tangent along the curve; thus the curve is, indeed, a geodesic.

In the tangent space at any point on a quaternion Slerp curve, the inverse of the exponential map transforms the curve into a line segment. Slerp curves not extending through a point fail to transform into lines in that point's tangent space.

Quaternion Slerps are commonly used to construct smooth animation curves by mimicking affine constructions like the de Casteljau algorithm for Bézier curves. Since the sphere is not an affine space, familiar properties of affine constructions may fail, though the constructed curves may otherwise be entirely satisfactory. For example, the de Casteljau algorithm may be used to split a curve in affine space; this does not work on a sphere.

The two-valued Slerp can be extended to interpolate among many unit quaternions, but the extension loses the fixed execution-time of the Slerp algorithm.

Source code

The below C++ code illustrates an implementation of the Slerp algorithm that handles some common edge cases.

Quaternion slerp(Quaternion v0, Quaternion v1, double t) {
// Only unit quaternions are valid rotations.
// Normalize to avoid undefined behavior.
v0.normalize;
v1.normalize;

// Compute the cosine of the angle between the two vectors.
double dot = dot_product(v0, v1);

// If the dot product is negative, slerp won't take
// the shorter path. Note that v1 and -v1 are equivalent when
// the negation is applied to all four components. Fix by
// reversing one quaternion.
if (dot < 0.0f) {
v1 = -v1;
dot = -dot;
}

const double DOT_THRESHOLD = 0.9995;
if (dot > DOT_THRESHOLD) {
// If the inputs are too close for comfort, linearly interpolate
// and normalize the result.

Quaternion result = v0 + t*(v1 - v0);
result.normalize;
return result;
}

// Since dot is in range [0, DOT_THRESHOLD], acos is safe
double theta_0 = acos(dot);        // theta_0 = angle between input vectors
double theta = theta_0*t;          // theta = angle between v0 and result
double sin_theta = sin(theta);     // compute this value only once
double sin_theta_0 = sin(theta_0); // compute this value only once

double s0 = cos(theta) - dot * sin_theta / sin_theta_0;  // == sin(theta_0 - theta) / sin(theta_0)
double s1 = sin_theta / sin_theta_0;

return (s0 * v0) + (s1 * v1);
}

The following is the same algorithm except in Python. It uses NumPy and can calculate multiple slerp interpolations between the two quaternions.

import numpy as np
def slerp(v0, v1, t_array):
# >>> slerp([1,0,0,0],[0,0,0,1],np.arange(0,1,0.001))
t_array = np.array(t_array)
v0 = np.array(v0)
v1 = np.array(v1)
dot = np.sum(v0*v1)

if (dot < 0.0):
v1 = -v1
dot = -dot

DOT_THRESHOLD = 0.9995
if (dot > DOT_THRESHOLD):
result = v0[np.newaxis,:] + t_array[:,np.newaxis]*(v1 - v0)[np.newaxis,:]
return (result.T / np.linalg.norm(result, axis=1)).T

theta_0 = np.arccos(dot)
sin_theta_0 = np.sin(theta_0)

theta = theta_0*t_array
sin_theta = np.sin(theta)

s0 = np.cos(theta) - dot * sin_theta / sin_theta_0
s1 = sin_theta / sin_theta_0
return (s0[:,np.newaxis] * v0[np.newaxis,:]) + (s1[:,np.newaxis] * v1[np.newaxis,:])

This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.