Skip to main content

BSpline

Struct BSpline 

Source
pub struct BSpline {
    pub control_points: Vec<[f64; 3]>,
    pub knot_vector: Vec<f64>,
    pub degree: usize,
}
Expand description

A non-uniform B-spline curve defined by a knot vector and control points.

Uses the Cox–de Boor recursion for evaluation and supports knot insertion.

Fields§

§control_points: Vec<[f64; 3]>

Control points.

§knot_vector: Vec<f64>

Knot vector (must have length = control_points.len() + degree + 1).

§degree: usize

Polynomial degree.

Implementations§

Source§

impl BSpline

Source

pub fn new( degree: usize, control_points: Vec<[f64; 3]>, knot_vector: Vec<f64>, ) -> Self

Construct a new B-spline curve.

§Panics

Panics if knot_vector.len() != control_points.len() + degree + 1.

Source

pub fn clamped_uniform(degree: usize, control_points: Vec<[f64; 3]>) -> Self

Create a clamped uniform B-spline (interpolates first and last control points).

Source

pub fn eval(&self, t: f64) -> [f64; 3]

Evaluate the B-spline at parameter t using the de Boor algorithm.

Source

pub fn insert_knot(&self, t_new: f64) -> Self

Insert knot t_new into the knot vector (Boehm’s algorithm).

Returns a new BSpline with one additional control point and knot.

Source§

impl BSpline

Source

pub fn insert_knot_inplace(&mut self, t: f64)

Insert knot t in place, modifying this B-spline (Boehm’s algorithm).

Source§

impl BSpline

Source

pub fn derivative(&self, t: f64) -> [f64; 3]

Derivative of the B-spline at parameter t using finite differences.

Source

pub fn arc_length(&self, n_samples: usize) -> f64

Arc length approximation by sampling n_samples parameter values.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.