Struct collision::primitive::Cuboid

pub struct Cuboid<S> { /* fields omitted */ }

Cuboid primitive.

Have a cached set of corner points to speed up computation.

Methods

impl<S> Cuboid<S> where
    S: BaseFloat, 

fn new(dim_x: S, dim_y: S, dim_z: S) -> Self

Create a new rectangle primitive from component dimensions

fn new_impl(dim: Vector3<S>) -> Self

Create a new rectangle primitive from a vector of component dimensions

Trait Implementations

impl<S: Debug> Debug for Cuboid<S>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<S: Clone> Clone for Cuboid<S>

fn clone(&self) -> Cuboid<S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: PartialEq> PartialEq for Cuboid<S>

fn eq(&self, __arg_0: &Cuboid<S>) -> bool

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

fn ne(&self, __arg_0: &Cuboid<S>) -> bool

This method tests for !=.

impl<S> Primitive for Cuboid<S> where
    S: BaseFloat, 

type Point = Point3<S>

Point type

fn support_point<T>(&self, direction: &Vector3<S>, transform: &T) -> Point3<S> where
    T: Transform<Point3<S>>, 

Get the support point on the shape in a given direction.

impl<S> ComputeBound<Aabb3<S>> for Cuboid<S> where
    S: BaseFloat, 

fn compute_bound(&self) -> Aabb3<S>

Compute the bounding volume

impl<S> ComputeBound<Sphere<S>> for Cuboid<S> where
    S: BaseFloat, 

fn compute_bound(&self) -> Sphere<S>

Compute the bounding volume

impl<S> Discrete<Ray3<S>> for Cuboid<S> where
    S: BaseFloat, 

fn intersects(&self, ray: &Ray3<S>) -> bool

Intersection test

impl<S> Continuous<Ray3<S>> for Cuboid<S> where
    S: BaseFloat, 

type Result = Point3<S>

Result returned by the intersection test

fn intersection(&self, ray: &Ray3<S>) -> Option<Point3<S>>

Intersection test