1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

use na::Real;
use bounding_volume::AABB;
use shape::{Cuboid, FeatureId};
use query::{PointProjection, PointQuery};
use math::{Isometry, Point};

impl<N: Real> PointQuery<N> for Cuboid<N> {
    #[inline]
    fn project_point(&self, m: &Isometry<N>, pt: &Point<N>, solid: bool) -> PointProjection<N> {
        let dl = Point::origin() + (-*self.half_extents());
        let ur = Point::origin() + *self.half_extents();
        AABB::new(dl, ur).project_point(m, pt, solid)
    }

    #[inline]
    fn project_point_with_feature(&self, m: &Isometry<N>, pt: &Point<N>) -> (PointProjection<N>, FeatureId) {
        let dl = Point::origin() + (-*self.half_extents());
        let ur = Point::origin() + *self.half_extents();
        AABB::new(dl, ur).project_point_with_feature(m, pt)
    }

    #[inline]
    fn distance_to_point(&self, m: &Isometry<N>, pt: &Point<N>, solid: bool) -> N {
        let dl = Point::origin() + (-*self.half_extents());
        let ur = Point::origin() + *self.half_extents();
        AABB::new(dl, ur).distance_to_point(m, pt, solid)
    }

    #[inline]
    fn contains_point(&self, m: &Isometry<N>, pt: &Point<N>) -> bool {
        let dl = Point::origin() + (-*self.half_extents());
        let ur = Point::origin() + *self.half_extents();
        AABB::new(dl, ur).contains_point(m, pt)
    }
}