ProteoWizard
|
CubicInterpolate Functor. More...
#include <interpolation.hpp>
Public Member Functions | |
CubicInterpolate (TReal epsilon=std::numeric_limits< TReal >::epsilon()) | |
TReal | operator() (TReal y0, TReal y1, TReal y2, TReal y3, double mu) |
operator More... | |
Public Attributes | |
TReal | epsilon_ |
CubicInterpolate Functor.
Cubic interpolation is the simplest method that offers true continuity between the segments. As such it requires more than just the two endpoints of the segment but also the two points on either side of them. So the function requires 4 points in all labeled y0, y1, y2, and y3, in the code below. mu still behaves the same way for interpolating between the segment y1 to y2. This doe s raise issues for how to interpolate between the first and last segments. In the examples here I just haven't bothered. A common solution is the dream up two extra points at the start and end of the sequence, the new points are created so that they have a slope equal to the slope of the start or end segment.
Definition at line 97 of file interpolation.hpp.
|
inline |
Definition at line 100 of file interpolation.hpp.
|
inline |
operator
y0 | y0 |
y1 | y1 |
y2 | y2 |
y3 | y3 |
mu | location parameter in [0.,1.] |
Definition at line 106 of file interpolation.hpp.
References ralab::base::base::utilities::LinearInterpolate< TReal >::epsilon_.
TReal ralab::base::base::utilities::CubicInterpolate< TReal >::epsilon_ |
Definition at line 99 of file interpolation.hpp.