manifold-rust 0.9.2

Pure Rust port of the Manifold 3D geometry 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

use super::*;
use crate::linalg::Vec3;

#[test]
fn test_convex_hull_tetrahedron() {
    let pts = vec![
        Vec3::new(0.0, 0.0, 0.0),
        Vec3::new(1.0, 0.0, 0.0),
        Vec3::new(0.0, 1.0, 0.0),
        Vec3::new(0.0, 0.0, 1.0),
    ];
    let hull = convex_hull(&pts);
    assert_eq!(hull.num_vert(), 4);
    assert_eq!(hull.num_tri(), 4);
}

#[test]
fn test_convex_hull_cube_points() {
    let pts = vec![
        Vec3::new(0.0, 0.0, 0.0),
        Vec3::new(1.0, 0.0, 0.0),
        Vec3::new(0.0, 1.0, 0.0),
        Vec3::new(0.0, 0.0, 1.0),
        Vec3::new(1.0, 1.0, 0.0),
        Vec3::new(1.0, 0.0, 1.0),
        Vec3::new(0.0, 1.0, 1.0),
        Vec3::new(1.0, 1.0, 1.0),
    ];
    let hull = convex_hull(&pts);
    assert_eq!(hull.num_vert(), 8);
    assert_eq!(hull.num_tri(), 12);
}

#[test]
fn test_convex_hull_empty() {
    let hull = convex_hull(&[]);
    assert!(hull.is_empty());
}

#[test]
fn test_convex_hull_single_point() {
    let hull = convex_hull(&[Vec3::new(1.0, 2.0, 3.0)]);
    // Degenerate: should produce something (possibly degenerate mesh)
    // Just check it doesn't panic
    let _ = hull.num_tri();
}

#[test]
fn test_convex_hull_two_points() {
    let hull = convex_hull(&[
        Vec3::new(0.0, 0.0, 0.0),
        Vec3::new(1.0, 0.0, 0.0),
    ]);
    let _ = hull.num_tri();
}

#[test]
fn test_convex_hull_coplanar_points() {
    let pts = vec![
        Vec3::new(0.0, 0.0, 0.0),
        Vec3::new(1.0, 0.0, 0.0),
        Vec3::new(1.0, 1.0, 0.0),
        Vec3::new(0.0, 1.0, 0.0),
        Vec3::new(0.5, 0.5, 0.0),
    ];
    let hull = convex_hull(&pts);
    // Planar case -- should still produce a valid mesh
    assert!(hull.num_tri() > 0);
}

#[test]
fn test_convex_hull_sphere_points() {
    // Generate points on a sphere
    let mut pts = Vec::new();
    let n = 20;
    for i in 0..n {
        let phi = std::f64::consts::PI * (i as f64) / (n as f64 - 1.0);
        for j in 0..n {
            let theta = 2.0 * std::f64::consts::PI * (j as f64) / n as f64;
            pts.push(Vec3::new(
                phi.sin() * theta.cos(),
                phi.sin() * theta.sin(),
                phi.cos(),
            ));
        }
    }
    let hull = convex_hull(&pts);
    assert!(hull.num_tri() > 0);
    // All vertices should be at distance ~1 from origin
    for v in &hull.vert_pos {
        let r = (v.x * v.x + v.y * v.y + v.z * v.z).sqrt();
        assert!((r - 1.0).abs() < 0.01, "vertex not on unit sphere: r={}", r);
    }
}

#[test]
fn test_convex_hull_interior_points_excluded() {
    // Cube corners + interior point
    let pts = vec![
        Vec3::new(0.0, 0.0, 0.0),
        Vec3::new(1.0, 0.0, 0.0),
        Vec3::new(0.0, 1.0, 0.0),
        Vec3::new(0.0, 0.0, 1.0),
        Vec3::new(1.0, 1.0, 0.0),
        Vec3::new(1.0, 0.0, 1.0),
        Vec3::new(0.0, 1.0, 1.0),
        Vec3::new(1.0, 1.0, 1.0),
        Vec3::new(0.5, 0.5, 0.5), // interior point
    ];
    let hull = convex_hull(&pts);
    assert_eq!(hull.num_vert(), 8); // interior point should be excluded
    assert_eq!(hull.num_tri(), 12);
}

#[test]
fn test_convex_hull_is_convex() {
    let pts = vec![
        Vec3::new(0.0, 0.0, 0.0),
        Vec3::new(1.0, 0.0, 0.0),
        Vec3::new(0.0, 1.0, 0.0),
        Vec3::new(0.0, 0.0, 1.0),
        Vec3::new(1.0, 1.0, 0.0),
        Vec3::new(1.0, 0.0, 1.0),
        Vec3::new(0.0, 1.0, 1.0),
        Vec3::new(1.0, 1.0, 1.0),
    ];
    let hull = convex_hull(&pts);
    assert!(hull.is_convex());
}