del-geo 0.1.13

2D/3D geometry utility codes
Documentation 
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

//! methods for 3D Axis-aligned Bounding Box (AABB)

#[allow(clippy::identity_op)]
pub fn from_list_of_vertices<T>(
    idx2vtx: &[usize],
    vtx2xyz: &[T],
    eps: T) -> [T;6]
where T: num_traits::Float
{
    assert!(!idx2vtx.is_empty());
    let mut aabb = [T::zero();6];
    {
        let i_vtx = idx2vtx[0];
        {
            let cgx = vtx2xyz[i_vtx * 3 + 0];
            aabb[0] = cgx - eps;
            aabb[3] = cgx + eps;
        }
        {
            let cgy = vtx2xyz[i_vtx * 3 + 1];
            aabb[1] = cgy - eps;
            aabb[4] = cgy + eps;
        }
        {
            let cgz = vtx2xyz[i_vtx * 3 + 2];
            aabb[2] = cgz - eps;
            aabb[5] = cgz + eps;
        }
    }
    for &i_vtx in idx2vtx.iter().skip(1) {
        {
            let cgx = vtx2xyz[i_vtx * 3 + 0];
            aabb[0] = if cgx - eps < aabb[0] { cgx - eps } else { aabb[0] };
            aabb[3] = if cgx + eps > aabb[3] { cgx + eps } else { aabb[3]};
        }
        {
            let cgy = vtx2xyz[i_vtx * 3 + 1];
            aabb[1] = if cgy - eps < aabb[1] { cgy - eps } else { aabb[1] };
            aabb[4] = if cgy + eps > aabb[4] { cgy + eps } else { aabb[4] };
        }
        {
            let cgz = vtx2xyz[i_vtx * 3 + 2];
            aabb[2] = if cgz - eps < aabb[2] { cgz - eps } else { aabb[2] };
            aabb[5] = if cgz + eps > aabb[5] { cgz + eps } else { aabb[5] };
        }
    }
    assert!(aabb[0] <= aabb[3]);
    assert!(aabb[1] <= aabb[4]);
    assert!(aabb[2] <= aabb[5]);
    aabb
}

#[allow(clippy::identity_op)]
pub fn from_two_aabbs_slice6<T>(
    i0: &[T],
    i1: &[T]) -> [T; 6]
where T: num_traits::Float
{
    assert_eq!(i0.len(), 6);
    assert_eq!(i1.len(), 6);
    let mut o = [T::zero(); 6];
    for i in 0..3 {
        o[i + 0] = if i0[i + 0] < i1[i + 0] { i0[i + 0] } else { i1[i + 0] };
        o[i + 3] = if i0[i + 3] > i1[i + 3] { i0[i + 3] } else { i1[i + 3] };
    }
    o
}

pub fn is_active<T>(i0: &[T]) -> bool
where T: std::cmp::PartialOrd
{
    i0[0] <= i0[3]
}

pub fn is_intersect<T>(
    i0: &[T],
    i1: &[T]) -> bool
where T: std::cmp::PartialOrd
{
    assert_eq!(i0.len(), 6);
    assert_eq!(i1.len(), 6);
    if !is_active(i0) { return false; }
    if !is_active(i1) { return false; }
    if i0[0] > i1[3] { return false; }
    if i0[1] > i1[4] { return false; }
    if i0[2] > i1[5] { return false; }
    if i0[3] < i1[0] { return false; }
    if i0[4] < i1[1] { return false; }
    if i0[5] < i1[2] { return false; }
    true
}