shambler 0.2.0

A rusty, hulking, lighting-tossing geometry processor.
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

use std::collections::BTreeMap;

use rayon::iter::{IntoParallelRefIterator, ParallelIterator};
use usage::Usage;

use super::{FaceBases, FaceId, FacePlanes, FaceVertices};
use crate::{face::FaceLines, line::Lines, EPSILON};

pub enum FaceFaceContainmentTag {}

pub type FaceFaceContainment = Usage<FaceFaceContainmentTag, BTreeMap<FaceId, Vec<FaceId>>>;

// Find contained faces
pub fn face_face_containment(
    faces: &Vec<FaceId>,
    lines: &Lines,
    face_planes: &FacePlanes,
    face_bases: &FaceBases,
    face_vertices: &FaceVertices,
    face_lines: &FaceLines,
) -> FaceFaceContainment {
    faces
        .par_iter()
        .flat_map(|lhs_id| {
            let lhs_verts = &face_vertices[&lhs_id];
            let lhs_plane = &face_planes[&lhs_id];
            let lhs_basis = &face_bases[&lhs_id];

            faces
                .par_iter()
                .flat_map(move |rhs_id| {
                    let mut contained_faces = BTreeMap::<FaceId, Vec<FaceId>>::default();
                    let rhs_verts = &face_vertices[&rhs_id];
                    let rhs_plane = &face_planes[&rhs_id];

                    // Skip comparing with self
                    if lhs_id == rhs_id {
                        return None;
                    }

                    // Skip faces that don't lie on the same plane
                    if !lhs_plane.opposes(rhs_plane) {
                        return None;
                    }

                    let contained = &face_lines[lhs_id].par_iter().all(|line_id| {
                        let line = lines[line_id];

                        let v0 = lhs_verts[line.i0];
                        let v1 = lhs_verts[line.i1];

                        let vd0 = nalgebra::vector![v0.dot(&lhs_basis.x), v0.dot(&lhs_basis.y)];
                        let vd1 = nalgebra::vector![v1.dot(&lhs_basis.x), v1.dot(&lhs_basis.y)];

                        let u = (vd1 - vd0).normalize();
                        let v = nalgebra::vector![-u.y, u.x];

                        rhs_verts.par_iter().all(|vert| {
                            let vert =
                                nalgebra::vector![vert.dot(&lhs_basis.x), vert.dot(&lhs_basis.y)];
                            vert.dot(&v) > vd0.dot(&v) + EPSILON
                        })
                    });

                    if !contained {
                        return None;
                    }

                    contained_faces.entry(*lhs_id).or_default().push(*rhs_id);
                    Some(contained_faces)
                })
                .flatten()
        })
        .collect()
}