Expand description
3D ray, represented by a starting point and a normalized direction vector.
Fields§
§origin: Vec3<T>
The ray’s starting point.
direction: Vec3<T>
The ray’s direction. Methods expect it to be normalized.
Implementations§
source§impl<T: Real + Add<T, Output = T>> Ray<T>
impl<T: Real + Add<T, Output = T>> Ray<T>
sourcepub fn new(origin: Vec3<T>, direction: Vec3<T>) -> Self
pub fn new(origin: Vec3<T>, direction: Vec3<T>) -> Self
Creates a Ray
from a starting point and direction.
This doesn’t check if direction
is normalized, because either you know it is, or
it isn’t and maybe it doesn’t matter for your use case.
sourcepub fn triangle_intersection(&self, tri: [Vec3<T>; 3]) -> Option<T>
pub fn triangle_intersection(&self, tri: [Vec3<T>; 3]) -> Option<T>
Tests if this ray intersects the given triangle, returning the distance from the ray’s origin along its direction where the intersection lies.
If the returned value is Some(x)
where x < EPSILON
, then you should
assume there was a line intersection, NOT a ray intersection.
This uses the Möller–Trumbore intersection algorithm.
Trait Implementations§
source§impl<'de, T> Deserialize<'de> for Ray<T>where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for Ray<T>where
T: Deserialize<'de>,
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more