Struct bevy_internal::math::prelude::CubicHermite

pub struct CubicHermite<P>
where
    P: Point,
{ /* private fields */ }

A spline interpolated continuously between the nearest two control points, with the position and velocity of the curve specified at both control points. This curve passes through all control points, with the specified velocity which includes direction and parametric speed.

Useful for smooth interpolation when you know the position and velocity at two points in time, such as network prediction.

Interpolation

The curve passes through every control point.

Tangency

Explicitly defined at each control point.

Continuity

At minimum C0 continuous, up to C1.

Usage

let points = [
    vec2(-1.0, -20.0),
    vec2(3.0, 2.0),
    vec2(5.0, 3.0),
    vec2(9.0, 8.0),
];
let tangents = [
    vec2(0.0, 1.0),
    vec2(0.0, 1.0),
    vec2(0.0, 1.0),
    vec2(0.0, 1.0),
];
let hermite = CubicHermite::new(points, tangents).to_curve();
let positions: Vec<_> = hermite.iter_positions(100).collect();

Implementations

impl<P> CubicHermite<P>

where P: Point,

pub fn new( control_points: impl IntoIterator<Item = P>, tangents: impl IntoIterator<Item = P> ) -> CubicHermite<P>

Create a new Hermite curve from sets of control points.

Trait Implementations

impl<P> CubicGenerator<P> for CubicHermite<P>

where P: Point,

fn to_curve(&self) -> CubicCurve<P>

Build a CubicCurve by computing the interpolation coefficients for each curve segment.