procedural_modelling 0.4.2

A framework-agnostic Procedural Modelling crate.
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

use crate::{
    math::{Scalar, Transformable},
    mesh::{
        DefaultEdgePayload, DefaultFacePayload, EdgeBasics, EuclideanMeshType, FaceBasics,
        HalfEdge, MeshTypeHalfEdge, VertexBasics,
    },
    operations::MeshLoft,
};
use itertools::Itertools;

// TODO: Adjust this to not be halfedge-specific

/// Extrude operations for meshes.
pub trait MeshExtrude<T: MeshTypeHalfEdge<Mesh = Self>>: MeshLoft<T>
where
    T::EP: DefaultEdgePayload,
    T::FP: DefaultFacePayload,
{
    /// Extrudes all boundary edges using the given transformation.
    ///
    /// Uses one row of quad faces.
    fn extrude_boundary<const D: usize>(&mut self, transform: T::Trans)
    where
        T::VP: Transformable<D, Trans = T::Trans, S = T::S>,
        T: EuclideanMeshType<D, Mesh = Self>,
    {
        let faces = self.face_ids().collect_vec();
        for f in faces {
            let e = self.face(f).edge(self).twin_id();
            if self.edge(e).is_boundary_self() {
                self.extrude(e, transform);
            }
        }
    }

    /// Extrudes the given edge using the given transformation.
    /// Returns an edge on the boundary of the extrusion.
    ///
    /// Uses one row of quad faces.
    fn extrude<const D: usize>(&mut self, e: T::E, transform: T::Trans) -> T::E
    where
        T::VP: Transformable<D, Trans = T::Trans, S = T::S>,
        T: EuclideanMeshType<D, Mesh = Self>,
    {
        assert!(self.edge(e).is_boundary_self());
        // TODO: avoid collecting
        let vps: Vec<_> = self
            .edges_back_from(self.edge(e).next_id())
            .map(|v| v.origin(self).payload().transformed(&transform))
            .collect();
        let start = self.loft_polygon_back(e, 2, 2, vps);
        self.close_hole(start, Default::default(), false);
        start
    }

    /// Remove the given face and extrude the boundary using the given transformation.
    fn extrude_face<const D: usize>(&mut self, f: T::F, transform: T::Trans) -> T::E
    where
        T::VP: Transformable<D, Trans = T::Trans, S = T::S>,
        T: EuclideanMeshType<D, Mesh = Self>,
    {
        let e = self.face(f).edge_id();
        self.remove_face(f);
        return self.extrude(e, transform);
    }

    /// Remove the given face and extrude the boundary using the given transformation.
    fn extrude_tri_face<const D: usize>(&mut self, f: T::F, transform: T::Trans) -> T::E
    where
        T::VP: Transformable<D, Trans = T::Trans, S = T::S>,
        T: EuclideanMeshType<D, Mesh = Self>,
    {
        let e = self.face(f).edge_id();
        self.remove_face(f);
        return self.extrude_tri(e, transform);
    }

    /// Extrudes the given boundary using the given transformation.
    /// Returns an edge on the boundary of the extrusion.
    ///
    /// Uses two rows of triangle faces.
    fn extrude_tri<const D: usize>(&mut self, e: T::E, transform: T::Trans) -> T::E
    where
        T::VP: Transformable<D, Trans = T::Trans, S = T::S>,
        T: EuclideanMeshType<D, Mesh = Self>,
    {
        assert!(self.edge(e).is_boundary_self());
        // TODO: avoid collecting
        let vps: Vec<_> = self
            .edges_from(self.edge(e).next_id())
            .map(|v| v.origin(self).payload().transformed(&transform))
            .collect();
        let start = self.loft_tri_closed(e, vps);
        self.close_hole(start, Default::default(), false);
        start
    }

    /// Extrudes the given boundary using the given transformation.
    /// Returns an edge on the boundary of the extrusion.
    ///
    /// Uses two rows of triangle faces.
    fn extrude_tri2<const D: usize>(&mut self, e: T::E, transform: T::Trans) -> T::E
    where
        T::VP: Transformable<D, Trans = T::Trans, S = T::S>,
        T: EuclideanMeshType<D, Mesh = Self>,
    {
        assert!(self.edge(e).is_boundary_self());
        // TODO: avoid collecting

        let mut vps: Vec<_> = self
            .edges_from(self.edge(e).next_id())
            .map(|v| v.origin(self).payload().transformed(&transform))
            .collect::<Vec<_>>()
            .iter()
            .circular_tuple_windows()
            .map(|(a, b)| a.lerped(&b, T::S::HALF))
            .collect();
        vps.rotate_right(1);
        let start = self.loft_tri_closed(e, vps);
        self.close_hole(start, Default::default(), false);
        start
    }

    /// Assumes `start` is on the boundary of the edge.
    /// Will insert a vertex `apex` with the given vp and fill the hole along the boundary with triangles connected to the apex vertex.
    /// Returns the id of the apex vertex.
    fn fill_hole_apex(&mut self, start: T::E, apex: T::VP) -> T::V {
        // TODO: replace with loft n=1
        let e0 = self.edge(start);
        let origin = e0.origin_id();
        let mut input = self.edge(start).prev_id();
        let (v, _, _) = self.add_vertex_via_edge_default(input, start, apex);
        loop {
            let e = self.edge(input);
            if e.origin_id() == origin {
                break;
            }
            input = e.prev_id();
            self.close_face_default(self.edge(input).next(&self).next_id(), input, false);
        }
        self.close_hole(input, Default::default(), false);
        v
    }
}