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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
use glam::Vec2;
#[cfg(feature = "tracing")]
use tracing::instrument;
use crate::{instance::U32Layer, Layer, Mesh};
impl Mesh {
/// Reorder all the neighboring polygons of all the vertices so that they are CCW ordered, and correctly mark corners.
pub fn reorder_neighbors_ccw_and_fix_corners(&mut self) {
let mut reordered_neighbors = vec![];
for layer in self.layers.iter() {
let mut reordered_neighbors_in_layer = vec![];
for vertex in &layer.vertices {
let vertex_coords = vertex.coords + layer.offset;
// For each polygon using a vertex, sort them in CCW order
let mut polygons = vertex
.polygons
.iter()
.filter(|p| **p != u32::MAX)
.cloned()
.collect::<Vec<_>>();
// Sort by the angle between the Y axis and the direction from the vertex to the center of the polygon
polygons.sort_unstable_by_key(|p| {
let vertices =
&self.layers[p.layer() as usize].polygons[p.polygon() as usize].vertices;
let center = vertices
.iter()
.map(|v| self.layers[p.layer() as usize].vertices[*v as usize].coords)
.sum::<Vec2>()
/ vertices.len() as f32
+ self.layers[p.layer() as usize].offset;
let direction = center - vertex_coords;
let angle = Vec2::Y.angle_to(direction);
(angle * 100000.0) as i32
});
polygons.dedup_by_key(|p| *p);
if polygons.is_empty() {
reordered_neighbors_in_layer.push(vec![u32::MAX]);
} else {
// Reintroduce empty markers
// For two following polygons on a vertex, check their previous / next vertices
// If they are different, there is a hole between them
let first = polygons[0];
let last = *polygons.last().unwrap();
if first == last {
polygons.push(u32::MAX);
} else {
polygons = polygons
.windows(2)
.map(|pair| [pair[0], pair[1]])
.chain(std::iter::once([last, first]))
.flat_map(|[pair0, pair1]| {
let layer0 = &self.layers[pair0.layer() as usize];
let layer1 = &self.layers[pair1.layer() as usize];
let mut polygon0 =
layer0.polygons[pair0.polygon() as usize].vertices.clone();
polygon0.reverse();
let mut found = false;
let Some(previous0) =
polygon0.iter().cycle().take(polygon0.len() * 2).find(|v| {
if found {
return true;
}
if (layer0.vertices[**v as usize].coords + layer0.offset)
.distance_squared(vertex_coords)
< 0.0001
{
found = true;
}
false
})
else {
return vec![pair0, u32::MAX];
};
let polygon1 = &layer1.polygons[pair1.polygon() as usize].vertices;
let mut found = false;
let Some(next1) =
polygon1.iter().cycle().take(polygon1.len() * 2).find(|v| {
if found {
return true;
}
if (layer1.vertices[**v as usize].coords + layer1.offset)
.distance_squared(vertex_coords)
< 0.0001
{
found = true;
}
false
})
else {
return vec![pair0, u32::MAX];
};
if layer0.vertices[*previous0 as usize].coords + layer0.offset
!= layer1.vertices[*next1 as usize].coords + layer1.offset
{
vec![pair0, u32::MAX]
} else {
vec![pair0]
}
})
.collect();
}
reordered_neighbors_in_layer.push(polygons);
}
}
reordered_neighbors.push(reordered_neighbors_in_layer);
}
for (layer, new) in self.layers.iter_mut().zip(reordered_neighbors.into_iter()) {
for (vertex, new) in layer.vertices.iter_mut().zip(new.into_iter()) {
vertex.is_corner = new.contains(&u32::MAX);
vertex.polygons = new;
}
}
}
/// Remove vertices that are not used by any polygon, and update indexes.
#[cfg_attr(feature = "tracing", instrument(skip_all))]
pub fn remove_useless_vertices(&mut self) -> bool {
!self
.layers
.iter_mut()
.map(|layer| layer.remove_useless_vertices())
.all(|m| !m)
}
/// Update the `is_one_way` flag for each polygon.
#[cfg_attr(feature = "tracing", instrument(skip_all))]
pub fn update_is_one_way(&mut self) {
self.layers
.iter_mut()
.for_each(|layer| layer.update_is_one_way());
}
}
impl Layer {
/// Remove vertices that are not used by any polygon, and update indexes.
#[cfg_attr(feature = "tracing", instrument(skip_all))]
pub fn remove_useless_vertices(&mut self) -> bool {
let mut removed = false;
let mut new_indexes = vec![u32::MAX; self.vertices.len()];
let mut kept = 0;
for (i, vertex) in self.vertices.iter().enumerate() {
if vertex.polygons.is_empty() || vertex.polygons == [u32::MAX] {
removed = true;
} else {
new_indexes[i] = kept;
kept += 1;
}
}
for polygon in self.polygons.iter_mut() {
for vertex in polygon.vertices.iter_mut() {
*vertex = new_indexes[*vertex as usize];
}
}
self.vertices = self
.vertices
.iter()
.enumerate()
.filter_map(|(i, _)| {
if new_indexes[i] != u32::MAX {
Some(self.vertices[i].clone())
} else {
None
}
})
.collect();
if !self.height.is_empty() {
self.height = self
.height
.iter()
.enumerate()
.filter_map(|(i, _)| {
if new_indexes[i] != u32::MAX {
Some(self.height[i])
} else {
None
}
})
.collect();
}
removed
}
/// Update the `is_one_way` flag for each polygon.
#[cfg_attr(feature = "tracing", instrument(skip_all))]
pub fn update_is_one_way(&mut self) {
for polygon in self.polygons.iter_mut() {
if polygon.vertices.len() == 3 {
polygon.is_one_way = polygon
.vertices
.iter()
.any(|vertex| self.vertices[*vertex as usize].polygons.len() == 2);
} else {
polygon.is_one_way = polygon
.vertices
.iter()
.filter(|vertex| self.vertices[**vertex as usize].polygons.len() == 2)
.count()
== polygon.vertices.len() - 2;
}
}
}
}