rita 0.1.3

Randomized Incremental Triangulation Algorithms
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

use crate::{trids::node::VertexNode, utils::types::TetIteratorIdx};

use super::{half_tri_iterator::HalfTriIterator, tet_data_structure::TetDataStructure};

pub struct TetIterator<'a> {
    pub tds: &'a TetDataStructure,
    pub tet_idx: usize,
}

impl<'a> TetIterator<'a> {
    pub fn half_triangles(&self) -> [HalfTriIterator<'a>; 4] {
        let idx_first = self.idx() << 2;

        [
            HalfTriIterator {
                tds: self.tds,
                half_tri_idx: idx_first,
            },
            HalfTriIterator {
                tds: self.tds,
                half_tri_idx: idx_first + 1,
            },
            HalfTriIterator {
                tds: self.tds,
                half_tri_idx: idx_first + 2,
            },
            HalfTriIterator {
                tds: self.tds,
                half_tri_idx: idx_first + 3,
            },
        ]
    }

    pub fn idx(&self) -> TetIteratorIdx {
        self.tet_idx
    }

    /// Check if the tetrahedron is casual, i.e. all nodes are casual
    pub fn is_casual(&self) -> bool {
        !self.is_conceptual()
    }

    /// Check if the tetrahedron is conceptual, i.e. one of the nodes is the infinite node
    pub fn is_conceptual(&self) -> bool {
        self.nodes().iter().any(|n| n.is_conceptual())
    }

    pub fn is_sound(&self) -> bool {
        if self.should_del() || self.should_keep() {
            log::error!("{}: tetrahedron remaining after triangulation.", self);
            return false;
        }

        let [n0, n1, n2, n3] = self.nodes();

        let mut sound = true;

        if n0 == n1 || n0 == n2 || n0 == n3 || n1 == n2 || n1 == n3 || n2 == n3 {
            log::error!("{}: tetrahedron with duplicate nodes.", self);
            sound = false;
        }

        sound
    }

    pub fn nodes(&self) -> [VertexNode; 4] {
        let idx_first = self.idx() << 2; // this is equivalent to self.tet_idx * 4 (rounding down to nearest integer), but faster
        [
            self.tds.tet_nodes[idx_first],
            self.tds.tet_nodes[idx_first + 1],
            self.tds.tet_nodes[idx_first + 2],
            self.tds.tet_nodes[idx_first + 3],
        ]
    }

    pub fn should_del(&self) -> bool {
        self.tds.should_del_tet[self.idx()]
    }

    pub fn should_keep(&self) -> bool {
        self.tds.should_keep_tet[self.idx()]
    }
}

impl std::fmt::Display for TetIterator<'_> {
    fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
        let [n0, n1, n2, n3] = self.nodes();
        write!(
            f,
            "Tetrahedron {}: {} -> {} -> {} -> {}",
            self.idx(),
            n0,
            n1,
            n2,
            n3
        )
    }
}