Struct flo_curves::bezier::CurveSection

pub struct CurveSection<'a, C: 'a + BezierCurve> { /* fields omitted */ }

Represents a subsection of a bezier curve

Methods

impl<'a, C: 'a + BezierCurve> CurveSection<'a, C>

pub fn new(curve: &'a C, t_min: f64, t_max: f64) -> CurveSection<'a, C>

Creates a new curve section from a region of another bezier curve

pub fn t_for_t(&self, t: f64) -> f64

Returns the t value on the full curve for a t value on the section

pub fn is_tiny(&self) -> bool

Returns true if this section is so small as to represent a point

pub fn subsection(&self, t_min: f64, t_max: f64) -> CurveSection<'a, C>

Creates a sub-section from this curve section (dividing it further)

Unlike calling section, this keeps the same type and avoids the need for recursive recalculation for things like the control points. This means that original_curve_t_values will return the coordinates for the same original curve as the curve that this subsection was created from.

pub fn original_curve_t_values(&self) -> (f64, f64)

Returns the original t values (t_min, t_max) that this section was created from

pub fn section_t_for_original_t(&self, t: f64) -> f64

Given a 't' value on the original curve, returns the equivalent value on this section

Trait Implementations

impl<'a, C: 'a + BezierCurve> BezierCurve for CurveSection<'a, C>

fn start_point(&self) -> Self::Point

The start point of this curve

fn end_point(&self) -> Self::Point

The end point of this curve

fn control_points(&self) -> (Self::Point, Self::Point)

The control points in this curve

fn point_at_pos(&self, t: f64) -> Self::Point

Given a value t from 0 to 1, returns a point on this curve

fn reverse<Curve: BezierCurveFactory<Point = Self::Point>>(self) -> Curve

Reverses the direction of this curve

fn t_for_point(&self, point: &Self::Point) -> Option<f64>

Given a point that is on or very close to the curve, returns the t value where the point can be found (or None if the point is not very close to the curve)

fn subdivide<Curve: BezierCurveFactory<Point = Self::Point>>(
    &self,
    t: f64
) -> (Curve, Curve)

Given a value t from 0 to 1, finds a point on this curve and subdivides it, returning the two resulting curves

fn bounding_box<Bounds: BoundingBox<Point = Self::Point>>(&self) -> Bounds

Computes the bounds of this bezier curve

fn fast_bounding_box<Bounds: BoundingBox<Point = Self::Point>>(&self) -> Bounds

Faster but less accurate bounding box for a curve

fn search_with_bounds<MatchFn: Fn(Self::Point, Self::Point) -> bool>(
    &self,
    max_error: f64,
    match_fn: MatchFn
) -> Vec<f64>

Given a function that determines if a searched-for point is within a bounding box, searches the curve for the t values for the corresponding points

fn find_extremities(&self) -> Vec<f64>

Finds the t values where this curve has extremities

fn estimate_length(&self, max_t: f64) -> f64

Attempts to estimate the length of this curve

fn section<'a>(&'a self, t_min: f64, t_max: f64) -> CurveSection<'a, Self>

Create a section from this curve. Consider calling subsection for curves that are already CurveSections.

impl<'a, C: Clone + 'a + BezierCurve> Clone for CurveSection<'a, C> where
    C::Point: Clone,
    C::Point: Clone, 

fn clone(&self) -> CurveSection<'a, C>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a, C: 'a + BezierCurve> Geo for CurveSection<'a, C>

type Point = C::Point

The type of a point in this geometry