del-msh-cpu 0.1.49

mesh utility library for computer graphics research and prototyping
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205

//! computing BVH using the Linear BVH method (i.e., binary tree based on the Morton code)
//!  * `bvhnodes` - array of index
//!
//!  when the number of query object is N, `bvhnodes` is sized as (2N-1)*3
//!  bvhnodes store the `parent node`, `left node` and `right node` index
//!  if `right node` index is the maximum numbe, the left node stores the index of an object

use num_traits::AsPrimitive;

pub fn update_bvhnodes<Index>(bvhnodes: &mut [[Index; 3]], idx2vtx: &[Index], idx2morton: &[u32])
where
    Index: num_traits::PrimInt + 'static + Copy,
    usize: AsPrimitive<Index>,
{
    assert_eq!(idx2vtx.len(), idx2morton.len());
    assert!(!idx2morton.is_empty());
    assert_eq!(bvhnodes.len(), idx2morton.len() * 2 - 1);
    bvhnodes[0][0] = Index::max_value();

    let num_branch = idx2morton.len() - 1; // number of branch
    for i_branch in 0..num_branch {
        let range = crate::mortons::range_of_binary_radix_tree_node(idx2morton, i_branch);
        let isplit = crate::mortons::split_of_binary_radix_tree_node(idx2morton, range.0, range.1);
        assert_ne!(isplit, usize::MAX);
        if range.0 == isplit {
            let i_bvhnode_a = num_branch + isplit; // leaf node
            bvhnodes[i_branch][1] = i_bvhnode_a.as_();
            bvhnodes[i_bvhnode_a][0] = i_branch.as_();
            bvhnodes[i_bvhnode_a][1] = idx2vtx[isplit];
            bvhnodes[i_bvhnode_a][2] = Index::max_value();
        } else {
            let i_bvhnode_a = isplit;
            bvhnodes[i_branch][1] = i_bvhnode_a.as_();
            bvhnodes[i_bvhnode_a][0] = i_branch.as_();
        }
        // ----
        if range.1 == isplit + 1 {
            // leaf node
            let i_bvhnode_b = num_branch + isplit + 1;
            bvhnodes[i_branch][2] = i_bvhnode_b.as_();
            bvhnodes[i_bvhnode_b][0] = i_branch.as_();
            bvhnodes[i_bvhnode_b][1] = idx2vtx[isplit + 1];
            bvhnodes[i_bvhnode_b][2] = Index::max_value();
        } else {
            let i_bvhnode_b = isplit + 1;
            bvhnodes[i_branch][2] = i_bvhnode_b.as_();
            bvhnodes[i_bvhnode_b][0] = i_branch.as_();
        }
    }
}

#[test]
fn test_3d() {
    let num_vtx = 100000;
    let vtx2xyz: Vec<f32> = {
        use rand::RngExt;
        let mut rng = rand::rng();
        (0..num_vtx * 3).map(|_| rng.random::<f32>()).collect()
    };
    let mut idx2vtx = vec![0usize; num_vtx];
    let mut idx2morton = vec![0u32; num_vtx];
    let mut vtx2morton = vec![0u32; num_vtx];
    crate::mortons::sorted_morten_code3(
        &mut idx2vtx,
        &mut idx2morton,
        &mut vtx2morton,
        vtx2xyz.as_chunks::<3>().0,
        &del_geo_core::mat4_col_major::from_identity(),
    );
    for idx in 0..num_vtx - 1 {
        let jdx = idx + 1;
        assert!(idx2morton[idx] <= idx2morton[jdx]);
    }
    crate::mortons::check_morton_code_range_split(&idx2morton);
    let mut bvhnodes = vec![[0usize; 3]; num_vtx * 2 - 1];
    update_bvhnodes(&mut bvhnodes, &idx2vtx, &idx2morton);
    crate::bvhnodes::check_bvh_topology(&bvhnodes, num_vtx);
}

#[test]
fn test_2d() {
    let num_vtx = 100000;
    let vtx2xy: Vec<f32> = {
        use rand::RngExt;
        let mut rng = rand::rng();
        (0..num_vtx * 2).map(|_| rng.random::<f32>()).collect()
    };
    let mut idx2vtx = vec![0usize; num_vtx];
    let mut idx2morton = vec![0u32; num_vtx];
    let mut vtx2morton = vec![0u32; num_vtx];
    crate::mortons::sorted_morten_code2(
        &mut idx2vtx,
        &mut idx2morton,
        &mut vtx2morton,
        vtx2xy.as_chunks::<2>().0,
        &del_geo_core::mat3_col_major::from_identity::<f32>(),
    );
    for idx in 0..num_vtx - 1 {
        let jdx = idx + 1;
        assert!(idx2morton[idx] <= idx2morton[jdx]);
    }
    crate::mortons::check_morton_code_range_split(&idx2morton);
    let mut bvhnodes = vec![0usize; (num_vtx * 2 - 1) * 3];
    update_bvhnodes(bvhnodes.as_chunks_mut::<3>().0, &idx2vtx, &idx2morton);
    crate::bvhnodes::check_bvh_topology(bvhnodes.as_chunks::<3>().0, num_vtx);
}

/*
pub fn update_for_vtx2xyz<Index>(bvhnodes: &mut [Index], vtx2xyz: &[f32], num_dim: usize)
where
    Index: num_traits::PrimInt + AsPrimitive<usize>,
    usize: AsPrimitive<Index>,
{
    let num_tri = vtx2xyz.len() / num_dim;
    assert_eq!(bvhnodes.len(), (num_tri * 2 - 1) * 3);
    let mut idx2tri = vec![Index::one(); num_tri];
    let mut idx2morton = vec![0u32; num_tri];
    let mut tri2morton = vec![0u32; num_tri];
    update_for_sorted_morton_code(
        &mut idx2tri,
        &mut idx2morton,
        &mut tri2morton,
        vtx2xyz,
        num_dim,
    );
    bvhnodes_morton(bvhnodes, &idx2tri, &idx2morton);
}
 */

pub fn from_vtx2xyz<Index, const NDIM: usize>(vtx2xyz: &[[f32; NDIM]]) -> Vec<[Index; 3]>
where
    Index: num_traits::PrimInt + AsPrimitive<usize>,
    usize: AsPrimitive<Index>,
{
    let num_vtx = vtx2xyz.len();
    let mut idx2vtx = vec![Index::one(); num_vtx];
    let mut idx2morton = vec![0u32; num_vtx];
    let mut vtx2morton = vec![0u32; num_vtx];
    crate::mortons::update_sorted_morton_code::<_, NDIM>(
        &mut idx2vtx,
        &mut idx2morton,
        &mut vtx2morton,
        vtx2xyz,
    );
    let mut bvhnodes = vec![[Index::zero(); 3]; num_vtx * 2 - 1];
    update_bvhnodes(&mut bvhnodes, &idx2vtx, &idx2morton);
    bvhnodes
}

pub fn from_triangle_mesh<Index, const NDIM: usize>(
    tri2vtx: &[[Index; 3]],
    vtx2xy: &[[f32; NDIM]],
) -> Vec<[Index; 3]>
where
    Index: num_traits::PrimInt + AsPrimitive<usize>,
    usize: AsPrimitive<Index>,
{
    let tri2cntr =
        crate::elem2center::from_uniform_mesh_as_points::<Index, f32, 3, NDIM>(tri2vtx, vtx2xy);
    from_vtx2xyz::<_, NDIM>(&tri2cntr)
}

pub fn update_for_triangle_mesh<Index>(
    bvhnodes: &mut [[Index; 3]],
    tri2vtx: &[[Index; 3]],
    vtx2xy: &[f32],
    num_dim: usize,
) where
    Index: num_traits::PrimInt + AsPrimitive<usize>,
    usize: AsPrimitive<Index>,
{
    let num_tri = tri2vtx.len();
    assert_eq!(bvhnodes.len(), num_tri * 2 - 1);
    let mut idx2tri = vec![Index::one(); num_tri];
    let mut idx2morton = vec![0u32; num_tri];
    let mut tri2morton = vec![0u32; num_tri];
    match num_dim {
        2 => {
            let tri2cntr = crate::elem2center::from_uniform_mesh_as_points::<Index, f32, 3, 2>(
                tri2vtx,
                vtx2xy.as_chunks::<2>().0,
            );
            crate::mortons::update_sorted_morton_code::<_, 2>(
                &mut idx2tri,
                &mut idx2morton,
                &mut tri2morton,
                &tri2cntr,
            );
        }
        3 => {
            let tri2cntr = crate::elem2center::from_uniform_mesh_as_points::<Index, f32, 3, 3>(
                tri2vtx,
                vtx2xy.as_chunks::<3>().0,
            );
            crate::mortons::update_sorted_morton_code::<_, 3>(
                &mut idx2tri,
                &mut idx2morton,
                &mut tri2morton,
                &tri2cntr,
            );
        }
        _ => panic!("unsupported num_dim: {num_dim}"),
    };
    update_bvhnodes(bvhnodes, &idx2tri, &idx2morton);
}