imgal 0.3.1

A fast and open-source scientific image processing and algorithm library.
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
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

use imgal::spatial::geometry::tetrahedron_volume;
use ndarray::{Array1, arr2, array, s};

use imgal::ImgalError;
use imgal::spatial::KDTree;
use imgal::spatial::convex_hull::{chan_2d, graham_scan, jarvis_march, quickhull_3d};
use imgal::spatial::halfspace::{
    face_to_halfspace, halfspace_intersection, hull_to_halfspace, inside_halfspace_interior,
};

const TOLERANCE: f64 = 1e-10;
const POINTS_2D: [[f64; 2]; 12] = [
    [-3.9, 5.8],
    [-4.7, 8.1],
    [-1.2, 9.4],
    [3.6, 7.2],
    [-4.7, 2.3],
    [5.2, 3.1],
    [3.9, -0.8],
    [0.4, -2.5],
    [-1.3, 1.7],
    [-0.2, 4.6],
    [7.9, 9.9],
    [-11.3, 3.4],
];
const THREADS: Option<usize> = Some(0);

fn approx_equal(a: f64, b: f64) -> bool {
    (a - b).abs() < TOLERANCE
}

/// Tests that `chan_2d` returns the expected convex hull with the start point
/// at index `0` and hull size.
#[test]
fn convex_hull_chan_2d_expected_results() -> Result<(), ImgalError> {
    let points = arr2(&POINTS_2D);
    let hull_par = chan_2d(&points, THREADS)?;
    let hull_seq = chan_2d(&points, None)?;
    assert_eq!(hull_par.slice(s![0, ..]), array![0.4, -2.5]);
    assert_eq!(hull_seq.slice(s![0, ..]), array![0.4, -2.5]);
    assert_eq!(hull_par.dim().0, 6);
    assert_eq!(hull_seq.dim().0, 6);
    Ok(())
}

/// Tests that `graham_scan` returns the expected convex hull with the pivot
/// point at index `0` and hull size.
#[test]
fn convex_hull_graham_scan_expected_results() -> Result<(), ImgalError> {
    let points = arr2(&POINTS_2D);
    let hull_par = graham_scan(&points, THREADS)?;
    let hull_seq = graham_scan(&points, None)?;
    assert_eq!(hull_par.slice(s![0, ..]), array![-11.3, 3.4]);
    assert_eq!(hull_seq.slice(s![0, ..]), array![-11.3, 3.4]);
    assert_eq!(hull_par.dim().0, 6);
    assert_eq!(hull_seq.dim().0, 6);
    Ok(())
}

/// Tests that `jarvis_march` returns the expected convex hull with the start
/// point at index `0` and hull size.
#[test]
fn convex_hull_jarvis_march_expected_results() -> Result<(), ImgalError> {
    let points = arr2(&POINTS_2D);
    let hull_par = jarvis_march(&points, THREADS)?;
    let hull_seq = jarvis_march(&points, None)?;
    assert_eq!(hull_par.slice(s![0, ..]), array![0.4, -2.5]);
    assert_eq!(hull_seq.slice(s![0, ..]), array![0.4, -2.5]);
    assert_eq!(hull_par.dim().0, 6);
    assert_eq!(hull_seq.dim().0, 6);
    Ok(())
}

/// Tests that `quickhull_3d` returns a 3D convex hull with the expected number
/// of vertices and faces.
#[test]
fn convex_hull_quickhull_3d_expected_results() -> Result<(), ImgalError> {
    let cube = arr2(&[
        [0.0, 0.0, 0.0],
        [0.0, 0.0, 1.0],
        [0.0, 1.0, 0.0],
        [0.0, 1.0, 1.0],
        [1.0, 0.0, 0.0],
        [1.0, 0.0, 1.0],
        [1.0, 1.0, 0.0],
        [1.0, 1.0, 1.0],
    ]);
    let cube_with_inside = arr2(&[
        [0.0, 0.0, 0.0],
        [0.0, 0.0, 1.0],
        [0.0, 1.0, 0.0],
        [0.0, 1.0, 1.0],
        [1.0, 0.0, 0.0],
        [1.0, 0.0, 1.0],
        [1.0, 1.0, 0.0],
        [1.0, 1.0, 1.0],
        [0.5, 0.5, 0.5],
        [0.2, 0.3, 0.7],
    ]);
    let octahedron = arr2(&[
        [0.0, 0.0, 1.0],
        [0.0, 0.0, -1.0],
        [0.0, 1.0, 0.0],
        [0.0, -1.0, 0.0],
        [1.0, 0.0, 0.0],
        [-1.0, 0.0, 0.0],
    ]);
    let tetrahedron = arr2(&[
        [0.0, 0.0, 0.0],
        [0.0, 0.0, 1.0],
        [0.0, 1.0, 0.0],
        [1.0, 0.0, 0.0],
    ]);
    let phi = (1.0 + 5.0_f64.sqrt()) / 2.0;
    let icosahedron = arr2(&[
        [0.0, 1.0, phi],
        [0.0, -1.0, phi],
        [0.0, 1.0, -phi],
        [0.0, -1.0, -phi],
        [1.0, phi, 0.0],
        [-1.0, phi, 0.0],
        [1.0, -phi, 0.0],
        [-1.0, -phi, 0.0],
        [phi, 0.0, 1.0],
        [phi, 0.0, -1.0],
        [-phi, 0.0, 1.0],
        [-phi, 0.0, -1.0],
    ]);
    let cube_hull_par = quickhull_3d(&cube, THREADS)?;
    let cube_hull_seq = quickhull_3d(&cube, None)?;
    let cube_with_inside_hull_par = quickhull_3d(&cube_with_inside, THREADS)?;
    let cube_with_inside_hull_seq = quickhull_3d(&cube_with_inside, None)?;
    let icosohedron_hull_par = quickhull_3d(&icosahedron, THREADS)?;
    let icosohedron_hull_seq = quickhull_3d(&icosahedron, None)?;
    let oct_hull_par = quickhull_3d(&octahedron, THREADS)?;
    let oct_hull_seq = quickhull_3d(&octahedron, None)?;
    let tet_hull_par = quickhull_3d(&tetrahedron, THREADS)?;
    let tet_hull_seq = quickhull_3d(&tetrahedron, None)?;
    assert_eq!(cube_hull_par.0.dim().0, 8);
    assert_eq!(cube_hull_seq.0.dim().0, 8);
    assert_eq!(cube_hull_par.1.dim().0, 12);
    assert_eq!(cube_hull_seq.1.dim().0, 12);
    assert_eq!(cube_with_inside_hull_par.0.dim().0, 8);
    assert_eq!(cube_with_inside_hull_seq.0.dim().0, 8);
    assert_eq!(cube_with_inside_hull_par.1.dim().0, 12);
    assert_eq!(cube_with_inside_hull_seq.1.dim().0, 12);
    assert_eq!(icosohedron_hull_par.0.dim().0, 12);
    assert_eq!(icosohedron_hull_seq.0.dim().0, 12);
    assert_eq!(icosohedron_hull_par.1.dim().0, 20);
    assert_eq!(icosohedron_hull_seq.1.dim().0, 20);
    assert_eq!(oct_hull_par.0.dim().0, 6);
    assert_eq!(oct_hull_seq.0.dim().0, 6);
    assert_eq!(oct_hull_par.1.dim().0, 8);
    assert_eq!(oct_hull_seq.1.dim().0, 8);
    assert_eq!(tet_hull_par.0.dim().0, 4);
    assert_eq!(tet_hull_seq.0.dim().0, 4);
    assert_eq!(tet_hull_par.1.dim().0, 4);
    assert_eq!(tet_hull_seq.1.dim().0, 4);
    Ok(())
}

/// Tests that `tetrahedron_volume` returns the expected signed tetrahedron
/// volumes.
#[test]
fn geometry_tetrahedron_volume_expected_results() -> Result<(), ImgalError> {
    let neg_vol_tet = arr2(&[
        [1.0, 1.0, 1.0],
        [-1.0, -1.0, 1.0],
        [1.0, -1.0, -1.0],
        [-1.0, 1.0, -1.0],
    ]);
    let pos_vol_tet = arr2(&[
        [1.0, 1.0, 1.0],
        [1.0, -1.0, -1.0],
        [-1.0, -1.0, 1.0],
        [-1.0, 1.0, -1.0],
    ]);
    assert!(approx_equal(
        tetrahedron_volume(
            neg_vol_tet.row(0),
            neg_vol_tet.row(1),
            neg_vol_tet.row(2),
            neg_vol_tet.row(3)
        )?,
        -2.6666666666
    ));
    assert!(approx_equal(
        tetrahedron_volume(
            pos_vol_tet.row(0),
            pos_vol_tet.row(1),
            pos_vol_tet.row(2),
            pos_vol_tet.row(3)
        )?,
        2.6666666666
    ));
    Ok(())
}

/// Tests that `face_to_halfspace` returns the expected halfspace normal vector
/// values.
#[test]
fn halfspace_face_to_halfspace_expected_results() -> Result<(), ImgalError> {
    let a_ideal = array![1.0, 2.0, 3.0];
    let b_ideal = array![4.0, 0.0, 1.0];
    let c_ideal = array![0.0, 3.0, 5.0];
    let a_degen = array![0.0, 0.0, 0.0];
    let b_degen = array![0.0, 0.0, 1.0];
    let c_degen = array![0.0, 1.0, 0.0];
    let hs_ideal = face_to_halfspace(&a_ideal, &b_ideal, &c_ideal)?;
    let hs_degen = face_to_halfspace(&a_degen, &b_degen, &c_degen)?;
    assert_eq!(hs_ideal, Array1::from_vec(vec![-2.0, -4.0, 1.0, 7.0]));
    assert_eq!(hs_degen, Array1::from_vec(vec![-1.0, 0.0, 0.0, -0.0]));
    Ok(())
}

/// Tests that `halfspace_intersection` returns the expected number of vertices
/// and faces for a regular octahedron.
#[test]
fn halfspace_halfspace_intersection_expected_results() -> Result<(), ImgalError> {
    let oct_hs = arr2(&[
        [1.0, 1.0, 1.0, -1.0],
        [1.0, 1.0, -1.0, -1.0],
        [1.0, -1.0, 1.0, -1.0],
        [1.0, -1.0, -1.0, -1.0],
        [-1.0, 1.0, 1.0, -1.0],
        [-1.0, 1.0, -1.0, -1.0],
        [-1.0, -1.0, 1.0, -1.0],
        [-1.0, -1.0, -1.0, -1.0],
    ]);
    let oct_interior = array![0.0, 0.0, 0.0];
    let (oct_verts_par, oct_faces_par) = halfspace_intersection(&oct_hs, &oct_interior, THREADS)?;
    let (oct_verts_seq, oct_faces_seq) = halfspace_intersection(&oct_hs, &oct_interior, None)?;
    assert_eq!(oct_verts_par.dim().0, 6);
    assert_eq!(oct_verts_seq.dim().0, 6);
    assert_eq!(oct_faces_par.dim().0, 8);
    assert_eq!(oct_faces_seq.dim().0, 8);
    Ok(())
}

/// Tests that `hull_to_halfspace` returns the expected halfspace vectors for
/// each face of an axis-aligned tetrahedron.
#[test]
fn halfspace_hull_to_halfspace_expected_results() -> Result<(), ImgalError> {
    let vertices = arr2(&[
        [0.0, 0.0, 0.0],
        [0.0, 0.0, 1.0],
        [0.0, 1.0, 0.0],
        [1.0, 0.0, 0.0],
    ]);
    let faces = arr2(&[[0, 2, 1], [0, 1, 3], [0, 3, 2], [3, 1, 2]]);
    let hs_par = hull_to_halfspace(&vertices, &faces, THREADS)?;
    let hs_seq = hull_to_halfspace(&vertices, &faces, None)?;
    assert_eq!(hs_par.dim(), (4, 4));
    assert_eq!(hs_seq.dim(), (4, 4));
    assert_eq!(hs_seq.row(0), array![1.0, 0.0, 0.0, -0.0]);
    assert_eq!(hs_seq.row(1), array![0.0, 1.0, 0.0, -0.0]);
    assert_eq!(hs_seq.row(2), array![0.0, 0.0, 1.0, -0.0]);
    assert_eq!(hs_seq.row(3), array![-1.0, -1.0, -1.0, 1.0]);
    Ok(())
}

/// Tests that `inside_halfspace_interior` returns the expected results for
/// points that are inside, outside, and on the boundary of a cube.
#[test]
fn halfspace_inside_halfspace_interior_expected_results() -> Result<(), ImgalError> {
    let cube_hs = arr2(&[
        [1.0, 0.0, 0.0, -1.0],
        [-1.0, 0.0, 0.0, -1.0],
        [0.0, 1.0, 0.0, -1.0],
        [0.0, -1.0, 0.0, -1.0],
        [0.0, 0.0, 1.0, -1.0],
        [0.0, 0.0, -1.0, -1.0],
    ]);
    let inside = array![0.0, 0.0, 0.0];
    let outside = array![2.0, 0.0, 0.0];
    let boundary = array![1.0, 0.0, 0.0];
    assert!(inside_halfspace_interior(
        &cube_hs, &inside, false, THREADS
    )?);
    assert!(inside_halfspace_interior(&cube_hs, &inside, false, None)?);
    assert!(inside_halfspace_interior(&cube_hs, &inside, true, THREADS)?);
    assert!(inside_halfspace_interior(&cube_hs, &inside, true, None)?);
    assert!(!inside_halfspace_interior(
        &cube_hs, &outside, false, THREADS
    )?);
    assert!(!inside_halfspace_interior(&cube_hs, &outside, false, None)?);
    assert!(!inside_halfspace_interior(
        &cube_hs, &outside, true, THREADS
    )?);
    assert!(!inside_halfspace_interior(&cube_hs, &outside, true, None)?);
    assert!(inside_halfspace_interior(
        &cube_hs, &boundary, true, THREADS
    )?);
    assert!(inside_halfspace_interior(&cube_hs, &boundary, true, None)?);
    assert!(!inside_halfspace_interior(
        &cube_hs, &boundary, false, THREADS
    )?);
    assert!(!inside_halfspace_interior(
        &cube_hs, &boundary, false, None
    )?);
    Ok(())
}

/// Tests that `KDTree` can be constructed and returns the expected values when
/// searching for coordinates and indices.
#[test]
fn spatial_kdtree_expected_results() -> Result<(), ImgalError> {
    let cloud = array![
        [-2.7, 3.9, 5.0],
        [0.1, 0.0, 4.0],
        [1.4, 0.2, 2.1],
        [-3.2, -1.8, -2.3],
        [-4.9, -3.7, -1.1],
    ];
    let tree = KDTree::build(&cloud);
    let query = [0.0, 0.0, 0.0];
    let result_inds = tree.search_for_indices(&query, 4.3)?;
    let result_coords = tree.search_for_coords(&query, 4.3)?;
    assert!(tree.root.is_some());
    assert_eq!(tree.nodes.len(), 5);
    assert_eq!(result_inds.len(), 2);
    assert_eq!(result_inds, array!(2, 1));
    assert_eq!(result_coords.dim().0, 2);
    assert_eq!(result_coords.row(0), cloud.row(2));
    assert_eq!(result_coords.row(1), cloud.row(1));
    Ok(())
}