Struct ConvexHull 

pub struct ConvexHull<S: Scalar, const N: usize> {
    pub points: Vec<Vector<S, N>>,
}

A convex hull represented by its defining point set (e.g. the control points of a NURBS curve or surface), in N-dimensional space.

The hull is never computed explicitly — overlap and containment queries operate directly on the point set via gjk. By the convex-hull property of B-spline / NURBS bases, every point on a curve or surface patch lies within the convex hull of its (dehomogenized) control points.

Fields

points: Vec<Vector<S, N>>

Implementations

impl<S: Scalar, const N: usize> ConvexHull<S, N>

pub fn new(points: Vec<Vector<S, N>>) -> Self

pub fn centroid(&self) -> Vector<S, N>

The average of this hull’s defining points — a representative position for the region it bounds, used e.g. to detect near-duplicate solutions at a caller-chosen distance tolerance (see curve_surface_intersect’s dedup check, which can’t rely solely on could_overlap since that bottoms out in each Scalar’s own built-in equality tolerance rather than the search’s own epsilon).

pub fn could_overlap(&self, other: &Self) -> bool

True if self and other could overlap (intersect or touch).

pub fn definitely_no_overlap(&self, other: &Self) -> bool

Negation of Self::could_overlap.

pub fn could_contain(&self, point: &Vector<S, N>) -> bool

True if point could lie within this convex hull.

pub fn definitely_not_contains(&self, point: &Vector<S, N>) -> bool

Negation of Self::could_contain.

Trait Implementations

impl<S: Clone + Scalar, const N: usize> Clone for ConvexHull<S, N>

fn clone(&self) -> ConvexHull<S, N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Debug + Scalar, const N: usize> Debug for ConvexHull<S, N>

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

Formats the value using the given formatter.