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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
use ndarray::{Array1, ArrayView1, ArrayView2, Axis};
use rusty_kernel_tools::RealType;
use std::collections::{HashMap, HashSet};
use std::fmt;
use std::time::Duration;
pub mod adaptive_octree;
pub mod regular_octree;
pub use adaptive_octree::*;
pub use regular_octree::*;
pub enum OctreeType {
Regular,
BalancedAdaptive,
UnbalancedAdaptive,
}
pub struct Octree<'a, T: RealType> {
pub particles: ArrayView2<'a, T>,
pub max_level: usize,
pub origin: [f64; 3],
pub diameter: [f64; 3],
pub level_keys: HashMap<usize, HashSet<usize>>,
pub particle_keys: Array1<usize>,
pub near_field: HashMap<usize, HashSet<usize>>,
pub interaction_list: HashMap<usize, HashSet<usize>>,
pub leaf_key_to_particles: HashMap<usize, HashSet<usize>>,
pub all_keys: HashSet<usize>,
pub octree_type: OctreeType,
pub statistics: Statistics,
}
pub struct Statistics {
pub number_of_particles: usize,
pub max_level: usize,
pub number_of_leafs: usize,
pub number_of_keys: usize,
pub creation_time: Duration,
pub minimum_number_of_particles_in_leaf: usize,
pub maximum_number_of_particles_in_leaf: usize,
pub average_number_of_particles_in_leaf: f64,
}
impl std::fmt::Display for Statistics {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(
f,
"\n\nOctree Statistics\n\
==============================\n\
Number of Particles: {}\n\
Maximum level: {}\n\
Number of leaf keys: {}\n\
Number of keys in tree: {}\n\
Creation time [s]: {}\n\
Minimum number of particles in leaf node: {}\n\
Maximum number of particles in leaf node: {}\n\
Average number of particles in leaf node: {:.2}\n\
==============================\n\n
",
self.number_of_particles,
self.max_level,
self.number_of_leafs,
self.number_of_keys,
(self.creation_time.as_millis() as f64) / 1000.0,
self.minimum_number_of_particles_in_leaf,
self.maximum_number_of_particles_in_leaf,
self.average_number_of_particles_in_leaf
)
}
}
pub fn compute_interaction_list_map(all_keys: &HashSet<usize>) -> HashMap<usize, HashSet<usize>> {
use crate::morton::compute_interaction_list;
use rayon::prelude::*;
let mut interaction_list_map = HashMap::<usize, HashSet<usize>>::new();
for &key in all_keys {
interaction_list_map.insert(key, HashSet::<usize>::new());
}
interaction_list_map
.par_iter_mut()
.for_each(|(&key, hash_set)| {
let current_interaction_list = compute_interaction_list(key);
hash_set.extend(¤t_interaction_list);
});
interaction_list_map
}
pub fn compute_near_field_map(all_keys: &HashSet<usize>) -> HashMap<usize, HashSet<usize>> {
use crate::morton::compute_near_field;
use rayon::prelude::*;
let mut near_field_map = HashMap::<usize, HashSet<usize>>::new();
for &key in all_keys {
near_field_map.insert(key, HashSet::<usize>::new());
}
near_field_map.par_iter_mut().for_each(|(&key, hash_set)| {
let current_near_field = compute_near_field(key);
hash_set.extend(¤t_near_field);
});
near_field_map
}
pub fn compute_leaf_map(particle_keys: ArrayView1<usize>) -> HashMap<usize, HashSet<usize>> {
use itertools::Itertools;
let mut leaf_key_to_particles = HashMap::<usize, HashSet<usize>>::new();
for &key in particle_keys.iter().unique() {
leaf_key_to_particles.insert(key, HashSet::<usize>::new());
}
for (index, key) in particle_keys.iter().enumerate() {
leaf_key_to_particles.get_mut(key).unwrap().insert(index);
}
leaf_key_to_particles
}
pub fn compute_level_information(
particle_keys: ArrayView1<usize>,
) -> (usize, HashSet<usize>, HashMap<usize, HashSet<usize>>) {
use crate::morton::{find_level, find_parent};
use std::iter::FromIterator;
let max_level = particle_keys
.iter()
.map(|&item| find_level(item))
.max()
.unwrap();
let nlevels = max_level + 1;
let leaf_keys: HashSet<usize> = particle_keys.iter().copied().collect();
let mut level_keys = HashMap::<usize, HashSet<usize>>::new();
for current_level in 0..nlevels {
level_keys.insert(
current_level,
HashSet::from_iter(
leaf_keys
.iter()
.filter(|&&key| find_level(key) == current_level)
.copied(),
),
);
}
for current_level in (1..nlevels).rev() {
let parent_index = current_level - 1;
let current_set: HashSet<usize> = level_keys
.get(¤t_level)
.unwrap()
.iter()
.copied()
.collect();
let parent_set = level_keys.get_mut(&parent_index).unwrap();
parent_set.extend(current_set.iter().map(|&key| find_parent(key)));
}
let mut all_keys = HashSet::<usize>::new();
for (_, current_keys) in level_keys.iter() {
all_keys.extend(current_keys.iter());
}
(max_level, all_keys, level_keys)
}
pub fn compute_complete_regular_tree<T: RealType>(
particles: ArrayView2<T>,
max_level: usize,
origin: &[f64; 3],
diameter: &[f64; 3],
) -> HashSet<usize> {
use super::morton::encode_points;
let keys = encode_points(particles, max_level, origin, diameter);
let (_, all_keys, _) = compute_level_information(keys.view());
all_keys
}
pub fn export_to_vtk<T: RealType>(tree: &Octree<T>, filename: &str) {
use super::morton::{serialize_box_from_key};
use std::iter::FromIterator;
use vtkio::model::*;
use std::path::PathBuf;
let filename = filename.to_owned();
const POINTS_PER_CELL: usize = 8;
let num_particles = tree.particles.len_of(Axis(1));
let all_keys = &tree.all_keys;
let num_keys = all_keys.len();
let num_floats = 3 * POINTS_PER_CELL * num_keys;
let mut cell_points = Vec::<f64>::with_capacity(num_floats);
for &key in all_keys {
let serialized = serialize_box_from_key(key, &tree.origin, &tree.diameter);
cell_points.extend(serialized);
}
for index in 0..num_particles {
cell_points.push(tree.particles[[0, index]].to_f64().unwrap());
cell_points.push(tree.particles[[1, index]].to_f64().unwrap());
cell_points.push(tree.particles[[2, index]].to_f64().unwrap());
}
let num_points = 8 * (num_keys as u64) + (num_particles as u64);
let connectivity = Vec::<u64>::from_iter(0..num_points);
let mut offsets = Vec::<u64>::from_iter((0..(num_keys as u64)).map(|item| 8 * item + 8));
offsets.push(num_points);
let mut types = vec![CellType::Voxel; num_keys];
types.push(CellType::PolyVertex);
let mut cell_data = Vec::<i32>::with_capacity(num_points as usize);
for _ in 0..num_keys {
cell_data.push(0);
}
cell_data.push(1);
let model = Vtk {
version: Version { major: 1, minor: 0 },
title: String::new(),
byte_order: ByteOrder::BigEndian,
file_path: Some(PathBuf::from(&filename)),
data: DataSet::inline(UnstructuredGridPiece {
points: IOBuffer::F64(cell_points),
cells: Cells {
cell_verts: VertexNumbers::XML {
connectivity: connectivity,
offsets: offsets,
},
types: types,
},
data: Attributes {
point: vec![],
cell: vec![Attribute::DataArray(DataArrayBase {
name: String::from("colors"),
elem: ElementType::Scalars {
num_comp: 1,
lookup_table: None,
},
data: IOBuffer::I32(cell_data),
})],
},
}),
};
model.export(filename).unwrap();
}