Struct flo_curves::bezier::Curve

pub struct Curve<Coord: Coordinate> {
    pub start_point: Coord,
    pub end_point: Coord,
    pub control_points: (Coord, Coord),
}

Represents a Bezier curve

Fields

start_point: Coord

end_point: Coord

control_points: (Coord, Coord)

Trait Implementations

impl<Coord: Coordinate> BezierCurve for Curve<Coord>

fn start_point(&self) -> Coord

The start point of this curve

fn end_point(&self) -> Coord

The end point of this curve

fn control_points(&self) -> (Coord, Coord)

The control points in this curve

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

Reverses the direction of 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 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) -> f64

Attempts to estimate the length of this curve

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

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

impl<Coord: Coordinate> BezierCurveFactory for Curve<Coord>

fn from_points( start: Coord, (control_point1, control_point2): (Coord, Coord), end: Coord ) -> Self

Creates a new bezier curve of the same type from some points

fn from_curve<Curve: BezierCurve<Point = Self::Point>>(curve: &Curve) -> Self

Creates a new bezier curve of this type from an equivalent curve of another type

fn fit_from_points(points: &[Self::Point], max_error: f64) -> Option<Vec<Self>>

Generates a curve by attempting to find a best fit against a set of points

impl<Coord: Clone + Coordinate> Clone for Curve<Coord>

fn clone(&self) -> Curve<Coord>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Coord: Debug + Coordinate> Debug for Curve<Coord>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<Coord: Coordinate> Geo for Curve<Coord>

type Point = Coord

The type of a point in this geometry

impl<Coord: Coordinate> HasBoundingBox for Curve<Coord>

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

Computes the bounds of this bezier curve

impl<Coord: PartialEq + Coordinate> PartialEq<Curve<Coord>> for Curve<Coord>

fn eq(&self, other: &Curve<Coord>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Coord: Copy + Coordinate> Copy for Curve<Coord>

impl<Coord: Coordinate> StructuralPartialEq for Curve<Coord>