rene 0.2.0

Computational geometry.
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
145
146
147
148
149
150
151
152
153
154
155

use super::edge::Edge;
use super::trapezoid::Trapezoid;
use crate::operations::Orient;

#[derive(Clone)]
pub(crate) enum Node {
    Leaf {
        trapezoid: Trapezoid,
    },
    X {
        point_index: usize,
        left_node_index: usize,
        right_node_index: usize,
    },
    Y {
        edge_index: usize,
        below_node_index: usize,
        above_node_index: usize,
    },
}

impl Node {
    pub(super) fn new_leaf(
        left_point_index: usize,
        right_point_index: usize,
        below_edge_index: usize,
        above_edge_index: usize,
        edges: &[Edge],
        nodes: &mut Vec<Self>,
    ) -> usize {
        let result = nodes.len();
        let node = Self::Leaf {
            trapezoid: Trapezoid::new(
                edges[below_edge_index].interior_to_left
                    && !edges[above_edge_index].interior_to_left,
                left_point_index,
                right_point_index,
                below_edge_index,
                above_edge_index,
                result,
            ),
        };
        nodes.push(node);
        result
    }

    pub(super) fn new_x_node(
        point_index: usize,
        left_node_index: usize,
        right_node_index: usize,
        nodes: &mut Vec<Self>,
    ) -> usize {
        let result = nodes.len();
        let node = Self::X {
            point_index,
            left_node_index,
            right_node_index,
        };
        nodes.push(node);
        result
    }

    pub(super) fn new_y_node(
        edge_index: usize,
        below_node_index: usize,
        above_node_index: usize,
        nodes: &mut Vec<Self>,
    ) -> usize {
        let result = nodes.len();
        let node = Self::Y {
            edge_index,
            below_node_index,
            above_node_index,
        };
        nodes.push(node);
        result
    }

    pub(super) fn height(&self, nodes: &[Self]) -> usize {
        match self {
            Self::Leaf { .. } => 0,
            Self::X {
                left_node_index,
                right_node_index,
                ..
            } => {
                nodes[*left_node_index]
                    .height(nodes)
                    .max(nodes[*right_node_index].height(nodes))
                    + 1
            }
            Self::Y {
                above_node_index,
                below_node_index,
                ..
            } => {
                nodes[*above_node_index]
                    .height(nodes)
                    .max(nodes[*below_node_index].height(nodes))
                    + 1
            }
        }
    }

    pub(super) fn get_trapezoid(&self) -> &Trapezoid {
        match self {
            Self::Leaf { trapezoid } => trapezoid,
            _ => unreachable!("Only leaves have trapezoids."),
        }
    }

    pub(super) fn get_trapezoid_mut(&mut self) -> &mut Trapezoid {
        match self {
            Self::Leaf { trapezoid } => trapezoid,
            _ => unreachable!("Only leaves have trapezoids."),
        }
    }

    pub(super) fn search_intersecting_trapezoid<'a, Point: PartialOrd>(
        &'a self,
        edge: &Edge,
        edges: &[Edge],
        endpoints: &[Point],
        nodes: &'a [Node],
    ) -> &'a Trapezoid
    where
        for<'b> &'b Point: Orient,
    {
        match self {
            Self::Leaf { trapezoid } => trapezoid,
            Self::X {
                left_node_index,
                right_node_index,
                point_index,
            } => nodes[if endpoints[edge.left_point_index]
                .lt(&endpoints[*point_index])
            {
                *left_node_index
            } else {
                *right_node_index
            }]
            .search_intersecting_trapezoid(edge, edges, endpoints, nodes),
            Self::Y {
                above_node_index,
                below_node_index,
                edge_index,
            } => nodes[if edges[*edge_index].is_under(edge, endpoints) {
                *above_node_index
            } else {
                *below_node_index
            }]
            .search_intersecting_trapezoid(edge, edges, endpoints, nodes),
        }
    }
}