grana-object 0.1.1

Next-generation microscopy image visualization and analysis platform
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

use bytemuck::{Pod, Zeroable};

#[repr(C)]
#[derive(Clone, Copy, Debug, PartialEq, Pod, Zeroable)]
pub struct MeshVertex {
    position: [f32; 3],
    normal: [f32; 3],
    object: u32,
}

impl MeshVertex {
    pub fn new(position: [f32; 3], normal: [f32; 3], object: u32) -> Self {
        assert!(
            position
                .iter()
                .chain(normal.iter())
                .all(|value| value.is_finite()),
            "a mesh vertex is finite"
        );
        let length_squared = normal.iter().map(|value| value * value).sum::<f32>();
        assert!(
            (length_squared - 1.0).abs() < 1.0e-3,
            "a mesh normal has unit length"
        );
        Self {
            position,
            normal,
            object,
        }
    }

    pub fn position(self) -> [f32; 3] {
        self.position
    }

    pub fn normal(self) -> [f32; 3] {
        self.normal
    }

    pub fn object(self) -> u32 {
        self.object
    }
}

const _: () = assert!(size_of::<MeshVertex>() == 28);

#[derive(Clone, Debug, Default, PartialEq)]
pub struct Mesh {
    vertices: Vec<MeshVertex>,
    indices: Vec<u32>,
}

impl Mesh {
    pub fn new(vertices: Vec<MeshVertex>, indices: Vec<u32>) -> Self {
        assert!(
            indices.len().is_multiple_of(3),
            "a mesh holds whole triangles"
        );
        assert!(
            indices
                .iter()
                .all(|index| (*index as usize) < vertices.len()),
            "every mesh index addresses a vertex"
        );
        Self { vertices, indices }
    }

    pub fn vertices(&self) -> &[MeshVertex] {
        &self.vertices
    }

    pub fn indices(&self) -> &[u32] {
        &self.indices
    }

    pub fn vertex_count(&self) -> usize {
        self.vertices.len()
    }

    pub fn triangle_count(&self) -> usize {
        self.indices.len() / 3
    }

    pub fn is_empty(&self) -> bool {
        self.indices.is_empty()
    }

    pub fn triangle(&self, index: usize) -> [MeshVertex; 3] {
        [0, 1, 2].map(|corner| self.vertices[self.indices[index * 3 + corner] as usize])
    }
}