solvr 0.2.0

Advanced computing library for real-world problem solving - optimization, differential equations, interpolation, statistics, and more
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

//! CPU implementation of halfspace intersection.

use crate::spatial::impl_generic::halfspace_intersection_impl;
use crate::spatial::traits::halfspace_intersection::{
    HalfspaceIntersection, HalfspaceIntersectionAlgorithms,
};
use numr::error::Result;
use numr::runtime::cpu::{CpuClient, CpuRuntime};
use numr::tensor::Tensor;

impl HalfspaceIntersectionAlgorithms<CpuRuntime> for CpuClient {
    fn halfspace_intersection(
        &self,
        halfspaces: &Tensor<CpuRuntime>,
        interior_point: &Tensor<CpuRuntime>,
    ) -> Result<HalfspaceIntersection<CpuRuntime>> {
        halfspace_intersection_impl(self, halfspaces, interior_point)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use numr::runtime::cpu::CpuDevice;

    fn setup() -> (CpuClient, CpuDevice) {
        let device = CpuDevice::new();
        let client = CpuClient::new(device.clone());
        (client, device)
    }

    #[test]
    fn test_halfspace_2d_triangle() {
        let (client, device) = setup();

        // Triangle: x >= 0, y >= 0, x + y <= 1
        // As n·x + b ≤ 0:
        // -x ≤ 0       → [-1, 0, 0]
        // -y ≤ 0       → [0, -1, 0]
        // x + y - 1 ≤ 0 → [1, 1, -1]
        #[rustfmt::skip]
        let halfspaces = Tensor::<CpuRuntime>::from_slice(&[
            -1.0,  0.0,  0.0,
             0.0, -1.0,  0.0,
             1.0,  1.0, -1.0,
        ], &[3, 3], &device);

        let interior = Tensor::<CpuRuntime>::from_slice(&[0.25, 0.25], &[2], &device);

        let result = client
            .halfspace_intersection(&halfspaces, &interior)
            .unwrap();

        // Should have 3 vertices: (0,0), (1,0), (0,1)
        assert_eq!(result.intersections.shape()[1], 2);
        let n_verts = result.intersections.shape()[0];
        assert_eq!(
            n_verts, 3,
            "Triangle should have 3 vertices, got {}",
            n_verts
        );

        let verts: Vec<f64> = result.intersections.to_vec();
        // Verify all expected vertices are present
        let expected = vec![(0.0, 0.0), (1.0, 0.0), (0.0, 1.0)];
        for (ex, ey) in &expected {
            let found = (0..n_verts).any(|i| {
                let vx = verts[i * 2];
                let vy = verts[i * 2 + 1];
                (vx - ex).abs() < 1e-6 && (vy - ey).abs() < 1e-6
            });
            assert!(found, "Expected vertex ({}, {}) not found", ex, ey);
        }
    }

    #[test]
    fn test_halfspace_2d_square() {
        let (client, device) = setup();

        // Unit square: 0 ≤ x ≤ 1, 0 ≤ y ≤ 1
        // As n·x + b ≤ 0:
        // -x ≤ 0     → [-1, 0, 0]
        // x - 1 ≤ 0  → [1, 0, -1]
        // -y ≤ 0     → [0, -1, 0]
        // y - 1 ≤ 0  → [0, 1, -1]
        #[rustfmt::skip]
        let halfspaces = Tensor::<CpuRuntime>::from_slice(&[
            -1.0,  0.0,  0.0,
             1.0,  0.0, -1.0,
             0.0, -1.0,  0.0,
             0.0,  1.0, -1.0,
        ], &[4, 3], &device);

        let interior = Tensor::<CpuRuntime>::from_slice(&[0.5, 0.5], &[2], &device);

        let result = client
            .halfspace_intersection(&halfspaces, &interior)
            .unwrap();

        assert_eq!(result.intersections.shape()[0], 4);
        assert_eq!(result.intersections.shape()[1], 2);

        let verts: Vec<f64> = result.intersections.to_vec();
        let expected = vec![(0.0, 0.0), (1.0, 0.0), (0.0, 1.0), (1.0, 1.0)];
        for (ex, ey) in &expected {
            let found = (0..4)
                .any(|i| (verts[i * 2] - ex).abs() < 1e-6 && (verts[i * 2 + 1] - ey).abs() < 1e-6);
            assert!(found, "Expected vertex ({}, {}) not found", ex, ey);
        }
    }

    #[test]
    fn test_halfspace_3d_cube() {
        let (client, device) = setup();

        // Unit cube: 6 halfspaces
        #[rustfmt::skip]
        let halfspaces = Tensor::<CpuRuntime>::from_slice(&[
            -1.0,  0.0,  0.0,  0.0,  // -x ≤ 0
             1.0,  0.0,  0.0, -1.0,  // x - 1 ≤ 0
             0.0, -1.0,  0.0,  0.0,  // -y ≤ 0
             0.0,  1.0,  0.0, -1.0,  // y - 1 ≤ 0
             0.0,  0.0, -1.0,  0.0,  // -z ≤ 0
             0.0,  0.0,  1.0, -1.0,  // z - 1 ≤ 0
        ], &[6, 4], &device);

        let interior = Tensor::<CpuRuntime>::from_slice(&[0.5, 0.5, 0.5], &[3], &device);

        let result = client
            .halfspace_intersection(&halfspaces, &interior)
            .unwrap();

        // Cube has 8 vertices
        assert_eq!(result.intersections.shape()[0], 8);
        assert_eq!(result.intersections.shape()[1], 3);
    }

    #[test]
    fn test_halfspace_invalid_interior() {
        let (client, device) = setup();

        #[rustfmt::skip]
        let halfspaces = Tensor::<CpuRuntime>::from_slice(&[
            -1.0, 0.0, 0.0,
             0.0,-1.0, 0.0,
             1.0, 1.0,-1.0,
        ], &[3, 3], &device);

        // Point outside the halfspaces
        let interior = Tensor::<CpuRuntime>::from_slice(&[2.0, 2.0], &[2], &device);

        assert!(
            client
                .halfspace_intersection(&halfspaces, &interior)
                .is_err()
        );
    }
}