rita 0.1.7

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
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

use super::{
    half_tri_iterator::HalfTriIterator,
    tet_data_structure::{TetDataStructure, NEIGHBOR_HALFEDGE, TRIANGLE_SUBINDICES},
};
use crate::VertexNode;

pub struct HedgeIterator<'a> {
    pub tds: &'a TetDataStructure,
    pub half_tri_idx: usize,
    pub hedge_idx: usize,
}

impl<'a> HedgeIterator<'a> {
    pub fn first_node(&self) -> VertexNode {
        // TODO: refactor the first two lines
        let mod4 = self.half_tri_idx % 4;

        let sub_idx = TRIANGLE_SUBINDICES[mod4];

        self.tds.tet_nodes[self.half_tri_idx - mod4 + sub_idx[self.hedge_idx]]
    }

    pub const fn idx(&self) -> usize {
        self.hedge_idx
    }

    pub fn is_sound(&self) -> bool {
        let first_node = self.first_node();
        let last_node = self.last_node();

        let hedge_next = self.next();
        let hedge_prev = self.prev();
        let hedge_opposite = self.opposite();
        let hedge_neighbor = self.neighbor();

        let mut valid = true;

        if !(hedge_next.first_node() == last_node) {
            log::error!("{self}: Wrong next hedge");
            valid = false;
        }
        if !(hedge_prev.last_node() == first_node) {
            log::error!("{self}: Wrong prev hedge");
            valid = false;
        }
        if !(hedge_opposite.first_node() == last_node)
            || !(hedge_opposite.last_node() == first_node)
        {
            log::error!("{self}: Wrong opposite hedge");
            valid = false;
        }
        if !(hedge_neighbor.first_node() == last_node)
            || !(hedge_neighbor.last_node() == first_node)
        {
            log::error!("{self}: Wrong neighboring hedge");
            valid = false;
        }

        valid
    }

    pub fn last_node(&self) -> VertexNode {
        // TODO: refactor the first two lines
        let mod4 = self.half_tri_idx % 4;

        let sub_idx = TRIANGLE_SUBINDICES[mod4];

        self.tds.tet_nodes[self.half_tri_idx - mod4 + sub_idx[(self.hedge_idx + 1) % 3]]
    }

    pub const fn neighbor(&self) -> HedgeIterator<'a> {
        let mod4 = self.half_tri_idx % 4;

        let (neighbor_half_tri_idx, neighbor_hedge_idx) = NEIGHBOR_HALFEDGE[mod4][self.hedge_idx];

        HedgeIterator {
            tds: self.tds,
            hedge_idx: neighbor_hedge_idx,
            half_tri_idx: self.half_tri_idx - mod4 + neighbor_half_tri_idx,
        }
    }

    pub const fn next(&self) -> HedgeIterator<'a> {
        HedgeIterator {
            tds: self.tds,
            hedge_idx: (self.hedge_idx + 1) % 3,
            half_tri_idx: self.half_tri_idx,
        }
    }

    pub fn opposite(&self) -> HedgeIterator<'a> {
        let [hedge0, hedge1, hedge2] = self.tri().opposite().hedges(); // TODO impl HalfTriIterator

        let last_node = self.last_node();

        if hedge0.first_node() == last_node {
            hedge0
        } else if hedge1.first_node() == last_node {
            hedge1
        } else {
            hedge2
        }
    }

    pub const fn prev(&self) -> HedgeIterator<'a> {
        HedgeIterator {
            tds: self.tds,
            hedge_idx: (self.hedge_idx + 2) % 3,
            half_tri_idx: self.half_tri_idx,
        }
    }

    pub const fn tri(&self) -> HalfTriIterator<'a> {
        HalfTriIterator {
            tds: self.tds,
            half_tri_idx: self.half_tri_idx,
        }
    }
}

impl std::fmt::Display for HedgeIterator<'_> {
    fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
        write!(f, "Edge: {} -> {}", self.first_node(), self.last_node())
    }
}