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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97

use i_bound::IBound;
use i_shape::{IShape, ShapeType};
use i_vicinity::IVicinity;

use bound::AxisAlignedBBox;
use mat::Mat3x1;

#[derive(Debug, Clone)]
pub struct Point3 {
    pub _ori: Mat3x1<f64>,
    pub _bound: AxisAlignedBBox,
    pub _vicinity: f64,
}

impl Point3 {
    pub fn init(origin: &[f64]) -> Point3 {
        assert!(origin.len() == 3);
        Point3 {
            _ori: Mat3x1 {
                _val: [origin[0], origin[1], origin[2]],
            },
            _bound: AxisAlignedBBox::init(ShapeType::Point, &origin[0..3]),
            _vicinity: 0.000001f64,
        }
    }
}

impl IShape for Point3 {
    fn get_shape_data(&self) -> Vec<f64> {
        vec![self._ori[0], self._ori[1], self._ori[2]]
    }
    fn get_type(&self) -> ShapeType {
        ShapeType::Point
    }
    fn get_bound(&self) -> &dyn IBound {
        &self._bound
    }
    // this shall test for intersection of bounding shapes first before procedding to test intersection using algorithms of higher complexity
    fn get_intersect(&self, other: &dyn IShape) -> (bool, Option<Mat3x1<f64>>) {
        if !self.get_bound().intersect(other.get_bound()) {
            return (false, None);
        } else {
            match other.get_type() {
                ShapeType::Point => {
                    let other_shape_data = other.get_shape_data();
                    if !self.within_vicinity(self._ori[0], other_shape_data[0])
                        || !self.within_vicinity(self._ori[1], other_shape_data[1])
                        || !self.within_vicinity(self._ori[2], other_shape_data[2])
                    {
                        return (false, None);
                    } else {
                        return (true, Some(self._ori));
                    }
                }
                ShapeType::Ray => {
                    //see Ray3 for ray point intersection
                    other.get_intersect(self)
                }
                ShapeType::Sphere => {
                    //see sphere for sphere point intersection
                    other.get_intersect(self)
                }
                ShapeType::Plane => {
                    //see plane for plane point intersection
                    other.get_intersect(self)
                }
                ShapeType::Box => {
                    //see recbox for box point intersection
                    other.get_intersect(self)
                }
                ShapeType::TriPrism => {
                    //see tri prism for intersection
                    other.get_intersect(self)
                }
                _ => {
                    unimplemented!();
                }
            }
        }
    }
    fn get_support(&self, _v: &Mat3x1<f64>) -> Option<Mat3x1<f64>> {
        Some(self._ori)
    }
}

impl IVicinity<f64> for Point3 {
    fn set_vicinity(&mut self, epsilon: f64) {
        self._vicinity = epsilon.abs();
    }
    fn within_vicinity(&self, a: f64, b: f64) -> bool {
        if a + self._vicinity >= b && a - self._vicinity <= b {
            true
        } else {
            false
        }
    }
}