alice-sdf 2.1.0

ALICE-SDF: 3D/Spatial Data Specialist — Store laws, not polygons. GLSL/WGSL/HLSL transpile, SVO, GPU marching cubes, texture-fit, procedural CSG. Optional bridges to alice-physics / alice-codec / libasp / alice-cache behind features.
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

//! Intersection operation for SDFs (Deep Fried Edition)
//!
//! # Deep Fried Optimizations
//! - **Forced Inlining**: `#[inline(always)]` guarantees no call overhead.
//!
//! Author: Moroya Sakamoto

use crate::compiled::real::Real;

/// Intersection of two SDFs (maximum distance)
///
/// # Returns
/// Maximum of the two distances
#[inline(always)]
pub const fn sdf_intersection(d1: f32, d2: f32) -> f32 {
    d1.max(d2)
}

/// Intersection of multiple SDFs
#[inline(always)]
pub fn sdf_intersection_multi(distances: &[f32]) -> f32 {
    distances
        .iter()
        .copied()
        .reduce(|a, b| a.max(b))
        .unwrap_or(f32::MIN)
}

/// Intersection (generic over [`Real`]).
#[inline(always)]
pub fn sdf_intersection_r<R: Real>(d1: R, d2: R) -> R {
    d1.max(d2)
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_intersection() {
        assert_eq!(sdf_intersection(1.0, 2.0), 2.0);
    }

    #[test]
    fn test_intersection_multi() {
        let distances = vec![-0.5, -0.3, -0.8, -0.2];
        assert!((sdf_intersection_multi(&distances) + 0.2).abs() < 0.0001);
    }

    #[test]
    fn test_intersection_multi_empty() {
        assert_eq!(sdf_intersection_multi(&[]), f32::MIN);
    }
}