Struct ncollide_geometry::query::RayIntersectionCostFn

pub struct RayIntersectionCostFn<'a, P: 'a + Point> { /* fields omitted */ }

A search thet selects the objects that has the smallest time of impact with a given ray.

Methods

impl<'a, P: Point> RayIntersectionCostFn<'a, P>

pub fn new(
    ray: &'a Ray<P>,
    solid: bool,
    uvs: bool
) -> RayIntersectionCostFn<'a, P>

Creates a new BestRayInterferenceSearch.

Trait Implementations

impl<'a, P, B, BV> BVTCostFn<P::Real, B, BV> for RayIntersectionCostFn<'a, P> where
    P: Point,
    B: RayCast<P, Id>,
    BV: RayCast<P, Id>, 

type UserData = RayIntersection<P::Vector>

User-defined data attached to each BVT leaf.

fn compute_bv_cost(&mut self, bv: &BV) -> Option<P::Real>

Computes the cost of a bounding volume.

fn compute_b_cost(
    &mut self,
    b: &B
) -> Option<(P::Real, RayIntersection<P::Vector>)>

Computes the cost of an object, and the result to be returned if it is the best one.