Enum GJKResult

pub enum GJKResult<N: RealField + Copy> {
    Intersection,
    ClosestPoints(Point<N>, Point<N>, Unit<Vector<N>>),
    Proximity(Unit<Vector<N>>),
    NoIntersection(Unit<Vector<N>>),
}

Results of the GJK algorithm.

Variants

Intersection

Result of the GJK algorithm when the origin is inside of the polytope.

ClosestPoints(Point<N>, Point<N>, Unit<Vector<N>>)

Result of the GJK algorithm when a projection of the origin on the polytope is found.

Proximity(Unit<Vector<N>>)

Result of the GJK algorithm when the origin is too close to the polytope but not inside of it.

NoIntersection(Unit<Vector<N>>)

Result of the GJK algorithm when the origin is too far away from the polytope.

Trait Implementations

impl<N: Clone + RealField + Copy> Clone for GJKResult<N>

fn clone(&self) -> GJKResult<N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Debug + RealField + Copy> Debug for GJKResult<N>

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

Formats the value using the given formatter.

impl<N: PartialEq + RealField + Copy> PartialEq for GJKResult<N>

fn eq(&self, other: &GJKResult<N>) -> 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<N: RealField + Copy> StructuralPartialEq for GJKResult<N>