Struct collision::Ray

pub struct Ray<S, P, V> {
    pub origin: P,
    pub direction: V,
    // some fields omitted
}

A generic ray starting at origin and extending infinitely in direction.

Fields

origin: P

Ray origin

direction: V

Normalized ray direction

Methods

impl<S, V, P> Ray<S, P, V> where     S: BaseNum,     V: VectorSpace<Scalar = S>,     P: EuclideanSpace<Scalar = S, Diff = V>,

pub fn new(origin: P, direction: V) -> Ray<S, P, V>

Create a generic ray starting at origin and extending infinitely in direction.

pub fn transform<T>(&self, transform: T) -> Self where     T: Transform<P>,

Create a new ray by applying a transform.

Trait Implementations

impl<S> Continuous<Ray<S, Point2<S>, Vector2<S>>> for Circle<S> where     S: BaseFloat,

type Result = Point2<S>

Result returned by the intersection test

fn intersection(&self, r: &Ray2<S>) -> Option<Point2<S>>

Intersection test

impl<S> Continuous<Ray<S, Point3<S>, Vector3<S>>> for Cylinder<S> where     S: BaseFloat,

type Result = Point3<S>

Result returned by the intersection test

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

Intersection test

impl<S> Continuous<Ray<S, Point3<S>, Vector3<S>>> for Capsule<S> where     S: BaseFloat,

type Result = Point3<S>

Result returned by the intersection test

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

Intersection test

impl<S> Continuous<Ray<S, Point3<S>, Vector3<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

impl<S> Continuous<Ray<S, Point3<S>, Vector3<S>>> for Cube<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

impl<P> Continuous<Ray<<P as EuclideanSpace>::Scalar, P, <P as EuclideanSpace>::Diff>> for Particle<P> where     P: EuclideanSpace,     P::Diff: InnerSpace,     P::Scalar: BaseFloat,

type Result = P

Result returned by the intersection test

fn intersection(&self, ray: &Ray<P::Scalar, P, P::Diff>) -> Option<P>

Ray needs to be in particle object space

impl<S> Continuous<Ray<S, Point2<S>, Vector2<S>>> for ConvexPolygon<S> where     S: BaseFloat,

type Result = Point2<S>

Result returned by the intersection test

fn intersection(&self, ray: &Ray2<S>) -> Option<Point2<S>>

Ray must be in object space

impl<S> Continuous<Ray<S, Point3<S>, Vector3<S>>> for ConvexPolyhedron<S> where     S: BaseFloat,

type Result = Point3<S>

Result returned by the intersection test

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

Ray must be in object space

impl<S> Continuous<Ray<S, Point2<S>, Vector2<S>>> for Rectangle<S> where     S: BaseFloat,

type Result = Point2<S>

Result returned by the intersection test

fn intersection(&self, ray: &Ray2<S>) -> Option<Point2<S>>

Ray must be in object space of the rectangle

impl<S> Continuous<Ray<S, Point2<S>, Vector2<S>>> for Square<S> where     S: BaseFloat,

type Result = Point2<S>

Result returned by the intersection test

fn intersection(&self, ray: &Ray2<S>) -> Option<Point2<S>>

Ray must be in object space of the rectangle

impl<S> Continuous<Ray<S, Point3<S>, Vector3<S>>> for Quad<S> where     S: BaseFloat,

type Result = Point3<S>

Result returned by the intersection test

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

Ray must be in object space of the rectangle

impl<S> Continuous<Ray<S, Point3<S>, Vector3<S>>> for Sphere<S> where     S: BaseFloat,

type Result = Point3<S>

Result returned by the intersection test

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

Intersection test

impl<S: BaseFloat> Continuous<Ray<S, Point3<S>, Vector3<S>>> for Plane<S>

type Result = Point3<S>

Result returned by the intersection test

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

Intersection test

impl<S, P> Continuous<Ray<S, P, <P as EuclideanSpace>::Diff>> for P where     S: BaseFloat,     P: EuclideanSpace<Scalar = S>,     P::Diff: InnerSpace<Scalar = S>,

type Result = P

Result returned by the intersection test

fn intersection(&self, ray: &Ray<S, P, P::Diff>) -> Option<P>

Intersection test

impl<S: BaseFloat> Continuous<Ray<S, Point2<S>, Vector2<S>>> for Line2<S>

type Result = Point2<S>

Result returned by the intersection test

fn intersection(&self, ray: &Ray2<S>) -> Option<Self::Result>

Intersection test

impl<S: BaseFloat> Continuous<Ray<S, Point2<S>, Vector2<S>>> for Aabb2<S>

type Result = Point2<S>

Result returned by the intersection test

fn intersection(&self, ray: &Ray2<S>) -> Option<Point2<S>>

Intersection test

impl<S: BaseFloat> Continuous<Ray<S, Point3<S>, Vector3<S>>> for Aabb3<S>

type Result = Point3<S>

Result returned by the intersection test

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

Intersection test

impl<S: BaseFloat> Continuous<Ray<S, Point3<S>, Vector3<S>>> for Sphere<S>

type Result = Point3<S>

Result returned by the intersection test

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

Intersection test

impl<S> Discrete<Ray<S, Point2<S>, Vector2<S>>> for Circle<S> where     S: BaseFloat,

fn intersects(&self, r: &Ray2<S>) -> bool

Intersection test

impl<S> Discrete<Ray<S, Point3<S>, Vector3<S>>> for Cylinder<S> where     S: BaseFloat,

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

Intersection test

impl<S> Discrete<Ray<S, Point3<S>, Vector3<S>>> for Capsule<S> where     S: BaseFloat,

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

Intersection test

impl<S> Discrete<Ray<S, Point3<S>, Vector3<S>>> for Cuboid<S> where     S: BaseFloat,

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

Intersection test

impl<S> Discrete<Ray<S, Point3<S>, Vector3<S>>> for Cube<S> where     S: BaseFloat,

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

Intersection test

impl<P> Discrete<Ray<<P as EuclideanSpace>::Scalar, P, <P as EuclideanSpace>::Diff>> for Particle<P> where     P: EuclideanSpace,     P::Diff: InnerSpace,     P::Scalar: BaseFloat,

fn intersects(&self, ray: &Ray<P::Scalar, P, P::Diff>) -> bool

Ray needs to be in particle object space

impl<S> Discrete<Ray<S, Point2<S>, Vector2<S>>> for ConvexPolygon<S> where     S: BaseFloat,

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

Ray must be in object space

impl<S> Discrete<Ray<S, Point3<S>, Vector3<S>>> for ConvexPolyhedron<S> where     S: BaseFloat,

TODO: better algorithm for finding faces to intersect with?

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

Ray must be in object space

impl<S> Discrete<Ray<S, Point2<S>, Vector2<S>>> for Rectangle<S> where     S: BaseFloat,

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

Ray must be in object space of the rectangle

impl<S> Discrete<Ray<S, Point2<S>, Vector2<S>>> for Square<S> where     S: BaseFloat,

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

Ray must be in object space of the rectangle

impl<S> Discrete<Ray<S, Point3<S>, Vector3<S>>> for Quad<S> where     S: BaseFloat,

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

Ray must be in object space of the rectangle

impl<S> Discrete<Ray<S, Point3<S>, Vector3<S>>> for Sphere<S> where     S: BaseFloat,

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

Intersection test

impl<S: BaseFloat> Discrete<Ray<S, Point3<S>, Vector3<S>>> for Plane<S>

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

Intersection test

impl<S, P> Discrete<Ray<S, P, <P as EuclideanSpace>::Diff>> for P where     S: BaseFloat,     P: EuclideanSpace<Scalar = S>,     P::Diff: InnerSpace<Scalar = S>,

fn intersects(&self, ray: &Ray<S, P, P::Diff>) -> bool

Intersection test

impl<S: BaseFloat> Discrete<Ray<S, Point2<S>, Vector2<S>>> for Line2<S>

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

Intersection test

impl<S: BaseFloat> Discrete<Ray<S, Point2<S>, Vector2<S>>> for Aabb2<S>

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

Intersection test

impl<S: BaseFloat> Discrete<Ray<S, Point3<S>, Vector3<S>>> for Aabb3<S>

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

Intersection test

impl<S: BaseFloat> Discrete<Ray<S, Point3<S>, Vector3<S>>> for Sphere<S>

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

Intersection test

impl<S> DiscreteTransformed<Ray<S, Point2<S>, Vector2<S>>> for Primitive2<S> where     S: BaseFloat,

type Point = Point2<S>

Point type for transformation of self

fn intersects_transformed<T>(&self, ray: &Ray2<S>, transform: &T) -> bool where     T: Transform<Self::Point>,

Intersection test for transformed self

impl<S> DiscreteTransformed<Ray<S, Point3<S>, Vector3<S>>> for Primitive3<S> where     S: BaseFloat,

type Point = Point3<S>

Point type for transformation of self

fn intersects_transformed<T>(&self, ray: &Ray3<S>, transform: &T) -> bool where     T: Transform<Self::Point>,

Intersection test for transformed self

impl<P, C> DiscreteTransformed<Ray<<P as EuclideanSpace>::Scalar, P, <P as EuclideanSpace>::Diff>> for C where     C: Discrete<Ray<P::Scalar, P, P::Diff>>,     P: EuclideanSpace,     P::Scalar: BaseFloat,

type Point = P

Point type for transformation of self

fn intersects_transformed<T>(     &self,     ray: &Ray<P::Scalar, P, P::Diff>,     transform: &T ) -> bool where     T: Transform<P>,

Intersection test for transformed self

impl<S> ContinuousTransformed<Ray<S, Point2<S>, Vector2<S>>> for Primitive2<S> where     S: BaseFloat,

type Point = Point2<S>

Point type for transformation of self

type Result = Point2<S>

Result of intersection test

fn intersection_transformed<T>(     &self,     ray: &Ray2<S>,     transform: &T ) -> Option<Point2<S>> where     T: Transform<Point2<S>>,

Intersection test for transformed self

impl<S> ContinuousTransformed<Ray<S, Point3<S>, Vector3<S>>> for Primitive3<S> where     S: BaseFloat,

type Point = Point3<S>

Point type for transformation of self

type Result = Point3<S>

Result of intersection test

fn intersection_transformed<T>(     &self,     ray: &Ray3<S>,     transform: &T ) -> Option<Point3<S>> where     T: Transform<Point3<S>>,

Intersection test for transformed self

impl<P, C> ContinuousTransformed<Ray<<P as EuclideanSpace>::Scalar, P, <P as EuclideanSpace>::Diff>> for C where     C: Continuous<Ray<P::Scalar, P, P::Diff>, Result = P>,     P: EuclideanSpace,     P::Scalar: BaseFloat,

type Point = P

Point type for transformation of self

type Result = P

Result of intersection test

fn intersection_transformed<T>(     &self,     ray: &Ray<P::Scalar, P, P::Diff>,     transform: &T ) -> Option<P> where     T: Transform<P>,

Intersection test for transformed self

impl<S: Copy, P: Copy, V: Copy> Copy for Ray<S, P, V>

impl<S: PartialEq, P: PartialEq, V: PartialEq> PartialEq<Ray<S, P, V>> for Ray<S, P, V>

fn eq(&self, other: &Ray<S, P, V>) -> bool

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

fn ne(&self, other: &Ray<S, P, V>) -> bool

This method tests for !=.

impl<S: Clone, P: Clone, V: Clone> Clone for Ray<S, P, V>

fn clone(&self) -> Ray<S, P, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Debug, P: Debug, V: Debug> Debug for Ray<S, P, V>

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

Formats the value using the given formatter.