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

use super::VertexBasics;
use crate::mesh::{EdgeBasics, HalfEdge, MeshType};
use itertools::Itertools;

/// Basic vertex functionality for a mesh
pub trait HalfEdgeVertex<T: MeshType>: VertexBasics<T>
where
    T::Edge: HalfEdge<T>,
{
    /// Changes the representative of the outgoing edges
    fn set_edge(&mut self, edge: T::E);

    /// Returns an outgoing boundary edge incident to the vertex
    fn outgoing_boundary_edge(&self, mesh: &T::Mesh) -> Option<T::E> {
        // TODO: Assumes a manifold vertex. Otherwise, there can be multiple boundary edges!
        debug_assert!(
            self.edges_out(mesh).count() == 0
                || self
                    .edges_out(mesh)
                    .filter(|e| e.is_boundary_self())
                    .exactly_one()
                    .is_ok(),
            "Vertex {} is not manifold, edges are: {:?}",
            self.id(),
            self.edges_out(mesh).map(|e| e.id()).collect_vec()
        );

        self.edges_out(mesh).find_map(|e| {
            if e.is_boundary_self() {
                Some(e.id())
            } else {
                None
            }
        })
    }

    /// Returns an ingoing boundary edge incident to the vertex
    fn ingoing_boundary_edge(&self, mesh: &T::Mesh) -> Option<T::E> {
        debug_assert!(
            self.edges_in(mesh)
                .filter(|e| e.is_boundary_self())
                .exactly_one()
                .is_ok(),
            "Vertex {} is not manifold",
            self.id()
        );

        self.edges_in(mesh).find_map(|e| {
            if e.is_boundary_self() {
                Some(e.id())
            } else {
                None
            }
        })
    }
}