del-msh-cpu 0.1.46

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

pub fn merge<T>(
    out_elem2vtx: &mut Vec<usize>,
    out_vtx2xyz: &mut Vec<T>,
    elem2vtx: &[usize],
    vtx2xyz: &[T],
    num_dim: usize,
) where
    T: Copy,
{
    let num_vtx0 = out_vtx2xyz.len() / num_dim;
    elem2vtx
        .iter()
        .for_each(|&v| out_elem2vtx.push(num_vtx0 + v));
    vtx2xyz.iter().for_each(|&v| out_vtx2xyz.push(v));
}

pub fn merge_with_vtx2rgb<T>(
    out_elem2vtx: &mut Vec<usize>,
    out_vtx2xyz: &mut Vec<T>,
    out_vtx2rgb: &mut Vec<T>,
    elem2vtx: &[usize],
    vtx2xyz: &[T],
    vtx2rgb: &[T],
    num_dim: usize,
) where
    T: Copy,
{
    let num_vtx0 = out_vtx2xyz.len() / num_dim;
    elem2vtx
        .iter()
        .for_each(|&v| out_elem2vtx.push(num_vtx0 + v));
    vtx2xyz.iter().for_each(|&v| out_vtx2xyz.push(v));
    vtx2rgb.iter().for_each(|&v| out_vtx2rgb.push(v));
}

pub fn vtx2vtx(
    elem2vtx: &[usize],
    num_node: usize,
    num_vtx: usize,
    is_self: bool,
) -> (Vec<usize>, Vec<usize>) {
    crate::vtx2vtx::from_uniform_mesh(elem2vtx, num_node, num_vtx, is_self)
}

/// Compute vertex-to-element adjacency.
/// Returns (vtx2idx, idx2elem) where vtx2idx gives index ranges for each vertex's adjacent elements.
pub fn vtx2elem(elem2vtx: &[usize], num_node: usize, num_vtx: usize) -> (Vec<usize>, Vec<usize>) {
    crate::vtx2elem::from_uniform_mesh(elem2vtx, num_node, num_vtx)
}

/// Compute element-to-element adjacency through shared faces.
/// Returns flattened array where each element has one neighbor index per face.
pub fn elem2elem(
    elem2vtx: &[usize],
    num_node: usize,
    face2idx_offset: &[usize],
    idx2node: &[usize],
    num_vtx: usize,
) -> Vec<usize> {
    crate::elem2elem::from_uniform_mesh(elem2vtx, num_node, face2idx_offset, idx2node, num_vtx)
}