interpolation is not a single problem but a family of problems defined by constraints and goals. any interpolation scheme is implicitly a choice along several orthogonal axes.
continuity is typically expressed as ck continuity.
many interpolants overshoot.
the curve parameter is rarely unique.
the following grouping is by construction mechanism rather than historical naming.
piecewise low-degree polynomials with continuity constraints at knots.
cubic hermite splines
catmull-rom splines
natural cubic splines
interpolating
c2 continuity
global solution
second derivative constrained to zero at endpoints
polynomial curves defined by control points rather than interpolation points.
bezier curves
composite bezier splines
piecewise bezier with continuity constraints
manual continuity management
splines defined by basis functions with compact support.
b-splines
nurbs
rational generalization of b-splines
exact representation of conic sections
weights introduce additional degrees of freedom
same locality and continuity structure as b-splines
curves constructed from geometric primitives rather than polynomials.
circular arc interpolation
spherical linear interpolation (slerp)
interpolation on manifolds
preserves constant angular velocity
not polynomial
interpolation performed in transformed spaces.
exponential interpolation
curves defined as minimizers of a functional.
cubic splines