pub struct CubicHermite<P: VectorSpace> {
pub control_points: Vec<(P, P)>,
}Expand description
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
Tangents are explicitly defined at each control point.
§Continuity
The curve is at minimum C1 continuous, meaning that it has no holes or jumps and the tangent vector also has no sudden jumps.
§Parametrization
The first segment of the curve connects the first two control points, the second connects the second and
third, and so on. This remains true when a cyclic curve is formed with to_curve_cyclic, in which case
the final curve segment connects the last control point to the first.
§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().unwrap();
let positions: Vec<_> = hermite.iter_positions(100).collect();Fields§
§control_points: Vec<(P, P)>The control points of the Hermite curve.
Implementations§
Source§impl<P: VectorSpace> CubicHermite<P>
impl<P: VectorSpace> CubicHermite<P>
Sourcepub fn new(
control_points: impl IntoIterator<Item = P>,
tangents: impl IntoIterator<Item = P>,
) -> Self
pub fn new( control_points: impl IntoIterator<Item = P>, tangents: impl IntoIterator<Item = P>, ) -> Self
Create a new Hermite curve from sets of control points.
Trait Implementations§
Source§impl<P: Clone + VectorSpace> Clone for CubicHermite<P>
impl<P: Clone + VectorSpace> Clone for CubicHermite<P>
Source§fn clone(&self) -> CubicHermite<P>
fn clone(&self) -> CubicHermite<P>
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<P: VectorSpace<Scalar = f32>> CubicGenerator<P> for CubicHermite<P>
Available on crate feature alloc only.
impl<P: VectorSpace<Scalar = f32>> CubicGenerator<P> for CubicHermite<P>
alloc only.Source§type Error = InsufficientDataError
type Error = InsufficientDataError
Source§fn to_curve(&self) -> Result<CubicCurve<P>, Self::Error>
fn to_curve(&self) -> Result<CubicCurve<P>, Self::Error>
CubicCurve by computing the interpolation coefficients for each curve segment.Source§impl<P: VectorSpace<Scalar = f32>> CyclicCubicGenerator<P> for CubicHermite<P>
Available on crate feature alloc only.
impl<P: VectorSpace<Scalar = f32>> CyclicCubicGenerator<P> for CubicHermite<P>
alloc only.Source§type Error = InsufficientDataError
type Error = InsufficientDataError
Source§fn to_curve_cyclic(&self) -> Result<CubicCurve<P>, Self::Error>
fn to_curve_cyclic(&self) -> Result<CubicCurve<P>, Self::Error>
CubicCurve by computing the interpolation coefficients for each curve segment,
treating the control data as cyclic so that the result is a closed curve.Auto Trait Implementations§
impl<P> Freeze for CubicHermite<P>
impl<P> RefUnwindSafe for CubicHermite<P>where
P: RefUnwindSafe,
impl<P> Send for CubicHermite<P>where
P: Send,
impl<P> Sync for CubicHermite<P>where
P: Sync,
impl<P> Unpin for CubicHermite<P>where
P: Unpin,
impl<P> UnsafeUnpin for CubicHermite<P>
impl<P> UnwindSafe for CubicHermite<P>where
P: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T, W> HasTypeWitness<W> for Twhere
W: MakeTypeWitness<Arg = T>,
T: ?Sized,
impl<T, W> HasTypeWitness<W> for Twhere
W: MakeTypeWitness<Arg = T>,
T: ?Sized,
Source§impl<T> Identity for Twhere
T: ?Sized,
impl<T> Identity for Twhere
T: ?Sized,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> TypeData for T
impl<T> TypeData for T
Source§fn clone_type_data(&self) -> Box<dyn TypeData>
fn clone_type_data(&self) -> Box<dyn TypeData>
self.