Struct CubicSegment

#[repr(C)]
pub struct CubicSegment {
    pub p0: Point,
    pub p1: Point,
    pub p2: Point,
    pub p3: Point,
}

A cubic bezier curve segment in 2-dimensional Euclidian space.

Fields

p0: Point

p1: Point

p2: Point

p3: Point

Implementations

impl CubicSegment

pub fn new(p0: Point, p1: Point, p2: Point, p3: Point) -> CubicSegment

Creates a new cubic bezier curve segment with the given control points.

pub fn is_approximately_linear(self, epsilon: f64) -> bool

Returns true if self is approximately linear with tolerance epsilon.

pub fn split(self, t: f64) -> (CubicSegment, CubicSegment)

Splits self into two quadratic Bezier curve segments, at parameter t.

pub fn linearize(self, epsilon: f64) -> Linearize

Returns an iterator over the points of a polyline that approximates self with tolerance epsilon, excluding the first point.

Trait Implementations

impl Clone for CubicSegment

fn clone(&self) -> CubicSegment

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for CubicSegment

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

Formats the value using the given formatter.

impl PartialEq for CubicSegment

fn eq(&self, other: &CubicSegment) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl Transform for CubicSegment

fn transform<T>(self, t: &T) -> CubicSegment

where T: Transformation,

fn transform_mut<T>(&mut self, t: &T)

where T: Transformation,

impl Copy for CubicSegment

impl StructuralPartialEq for CubicSegment