tri-mesh 0.6.1

A triangle mesh data structure including basic operations.
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

//! See [Mesh](crate::mesh::Mesh).

use crate::mesh::*;

/// # Connectivity
impl Mesh {
    /// Returns whether or not the mesh is closed, ie. contains no holes.
    pub fn is_closed(&self) -> bool {
        for halfedge_id in self.edge_iter() {
            if self.is_edge_on_boundary(halfedge_id) {
                return false;
            }
        }
        true
    }
    ///
    /// Returns the connecting edge between the two vertices or `None` if no edge is found.
    ///
    /// **Note:** This method assumes that the mesh is properly connected.
    /// See [vertex_halfedge_iter](#method.vertex_halfedge_iter) for more information.
    ///
    pub fn connecting_edge(
        &self,
        vertex_id1: VertexID,
        vertex_id2: VertexID,
    ) -> Option<HalfEdgeID> {
        for halfedge_id in self.vertex_halfedge_iter(vertex_id1) {
            if self.walker_from_halfedge(halfedge_id).vertex_id().unwrap() == vertex_id2 {
                return Some(halfedge_id);
            }
        }
        None
    }

    /// Returns whether or not the vertex is on a boundary.
    pub fn is_vertex_on_boundary(&self, vertex_id: VertexID) -> bool {
        for halfedge_id in self.vertex_halfedge_iter(vertex_id) {
            let mut walker = self.walker_from_halfedge(halfedge_id);
            if walker.face_id().is_none() || walker.as_twin().face_id().is_none() {
                return true;
            }
        }
        false
    }

    /// Returns whether or not the edge is on a boundary.
    pub fn is_edge_on_boundary(&self, halfedge_id: HalfEdgeID) -> bool {
        let mut walker = self.walker_from_halfedge(halfedge_id);
        walker.face_id().is_none() || walker.as_twin().face_id().is_none()
    }

    /// Returns the vertex id of the two adjacent vertices to the given edge.
    pub fn edge_vertices(&self, halfedge_id: HalfEdgeID) -> (VertexID, VertexID) {
        let mut walker = self.walker_from_halfedge(halfedge_id);
        let v1 = walker.vertex_id().unwrap();
        let v2 = walker.as_twin().vertex_id().unwrap();
        (v1, v2)
    }

    /// Returns the vertex id of the two adjacent vertices to the given edge
    /// and ordered such that `ordered_edge_vertices.0 < ordered_edge_vertices.1`.
    pub fn ordered_edge_vertices(&self, halfedge_id: HalfEdgeID) -> (VertexID, VertexID) {
        let mut walker = self.walker_from_halfedge(halfedge_id);
        let v1 = walker.vertex_id().unwrap();
        let v2 = walker.as_twin().vertex_id().unwrap();
        if v1 < v2 {
            (v1, v2)
        } else {
            (v2, v1)
        }
    }

    /// Returns the vertex id of the three connected vertices to the given face.
    pub fn face_vertices(&self, face_id: FaceID) -> (VertexID, VertexID, VertexID) {
        let mut walker = self.walker_from_face(face_id);
        let v1 = walker.vertex_id().unwrap();
        walker.as_next();
        let v2 = walker.vertex_id().unwrap();
        walker.as_next();
        let v3 = walker.vertex_id().unwrap();
        (v1, v2, v3)
    }

    /// Returns the vertex id of the three connected vertices to the given face
    /// and ordered such that `ordered_face_vertices.0 < ordered_face_vertices.1 < ordered_face_vertices.2`.
    pub fn ordered_face_vertices(&self, face_id: FaceID) -> (VertexID, VertexID, VertexID) {
        let mut walker = self.walker_from_face(face_id);
        let v1 = walker.vertex_id().unwrap();
        walker.as_next();
        let v2 = walker.vertex_id().unwrap();
        walker.as_next();
        let v3 = walker.vertex_id().unwrap();
        if v1 < v2 {
            if v2 < v3 {
                (v1, v2, v3)
            } else {
                if v1 < v3 {
                    (v1, v3, v2)
                } else {
                    (v3, v1, v2)
                }
            }
        } else {
            if v1 < v3 {
                (v2, v1, v3)
            } else {
                if v2 < v3 {
                    (v2, v3, v1)
                } else {
                    (v3, v2, v1)
                }
            }
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use three_d_asset::TriMesh;
    #[test]
    fn test_is_closed_when_not_closed() {
        let mesh = crate::test_utility::subdivided_triangle();
        assert!(!mesh.is_closed());
    }

    #[test]
    fn test_is_closed_when_closed() {
        let mesh: Mesh = TriMesh::sphere(4).into();
        assert!(mesh.is_closed());
    }
}