Struct QuadraticBezier 

pub struct QuadraticBezier {
    pub p0: Vec3,
    pub p1: Vec3,
    pub p2: Vec3,
}

Quadratic Bezier curve through 3 control points.

Fields

p0: Vec3

p1: Vec3

p2: Vec3

Implementations

impl QuadraticBezier

pub fn new(p0: Vec3, p1: Vec3, p2: Vec3) -> Self

pub fn through_point(p0: Vec3, through: Vec3, p2: Vec3) -> Self

Construct a curve that passes through through at t=0.5, using De Casteljau to find the implied control point.

pub fn split(&self, t: f32) -> (Self, Self)

Split at t into two quadratic curves.

Trait Implementations

impl Curve for QuadraticBezier

fn sample(&self, t: f32) -> Vec3

Sample position at parameter t ∈ [0, 1].

fn tangent(&self, t: f32) -> Vec3

Sample tangent (unnormalized derivative) at t.

fn unit_tangent(&self, t: f32) -> Vec3

Sample unit tangent at t.

fn normal_2d(&self, t: f32) -> Vec3

Sample the normal (perpendicular to tangent) at t, in the XY plane.

fn arc_length(&self, n: u32) -> f32

Approximate arc length using n segments.

fn build_arc_table(&self, n: u32) -> ArcTable

Build an arc-length table with n segments for uniform-speed queries.

fn sample_uniform(&self, n: usize) -> Vec<Vec3>

Sample n evenly-spaced points along the curve (by parameter).

fn sample_arc_uniform(&self, n: usize, table_resolution: u32) -> Vec<Vec3>

Sample n points at equal arc-length intervals.

fn bounding_box(&self, resolution: u32) -> (Vec3, Vec3)

Bounding box as (min, max).

fn closest_point(&self, query: Vec3, resolution: u32) -> (f32, Vec3)

Find the closest point on the curve to query, returning (t, point).