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
//! Cylinder primitive SDF (Deep Fried Edition)
//!
//! # Deep Fried Optimizations
//! - **Branchless Capped Cylinder**: Rewrote Inigo Quilez's implementation
//! to use branchless selection logic (max/min) instead of if/else chains.
//! - **Forced Inlining**: Zero call overhead.
//!
//! Author: Moroya Sakamoto
use crate::compiled::real::{Real, Vec3R};
use glam::Vec3;
/// Capped cylinder along Y (generic over [`Real`]).
#[inline(always)]
pub fn sdf_cylinder_r<R: Real>(p: Vec3R<R>, radius: f32, half_height: f32) -> R {
let dx = (p.x * p.x + p.z * p.z).sqrt() - R::splat(radius);
let dy = p.y.abs() - R::splat(half_height);
let ox = dx.max(R::zero());
let oy = dy.max(R::zero());
dx.max(dy).min(R::zero()) + (ox * ox + oy * oy).sqrt()
}
/// Capped cylinder along Y.
#[inline(always)]
pub fn sdf_cylinder(point: Vec3, radius: f32, half_height: f32) -> f32 {
sdf_cylinder_r::<f32>(point.into(), radius, half_height)
}
/// Signed distance to a capped cylinder between two points (Deep Fried Branchless)
///
/// # Deep Fried Optimization
///
/// Original code had 4 branches (if/else if/else if/else).
/// Replaced with branchless selection using max(0.0) pattern:
/// ```text
/// // Before: 4 branches
/// if x.max(y) < 0.0 { -x2.min(y2) }
/// else if x > 0.0 && y > 0.0 { x2 + y2 }
/// else if x > 0.0 { x2 }
/// else { y2 }
///
/// // After: Branchless
/// inner = -x2.min(y2)
/// outer = x.max(0.0)² + y.max(0.0)² * baba
/// d = select(x.max(y) < 0.0, inner, outer)
/// ```
#[inline(always)]
pub fn sdf_cylinder_capped(point: Vec3, a: Vec3, b: Vec3, radius: f32) -> f32 {
let ba = b - a;
let pa = point - a;
let baba = ba.dot(ba);
let paba = pa.dot(ba);
let x = radius * -baba + (pa * baba - ba * paba).length();
let y = baba * -0.5 + (baba * -0.5 + paba).abs();
let x2 = x * x;
let y2 = y * y * baba;
// Deep Fried Branchless Logic
// Interior case: both x and y are negative (inside cylinder)
let dist_sq_inner = -x2.min(y2);
// Exterior case: at least one of x or y is positive
// x.max(0.0)² contributes if outside radially
// y.max(0.0)² * baba contributes if outside axially
let dist_sq_outer =
alice_det_math::powi(y.max(0.0), 2) * baba + alice_det_math::powi(x.max(0.0), 2);
// Select based on whether we're inside or outside
let inside = x.max(y) < 0.0;
let d = if inside { dist_sq_inner } else { dist_sq_outer };
d.signum() * d.abs().sqrt() / baba
}
/// Signed distance to an infinite cylinder along Y-axis
///
/// Bit-identical duplicate of [`super::sdf_infinite_cylinder`], which is the
/// name that matches `SdfNode::InfiniteCylinder` and the other primitives.
#[deprecated(
since = "5.0.0",
note = "bit-identical duplicate; use sdf_infinite_cylinder"
)]
// ALLOW-UNWIRED: deprecated duplicate of sdf_infinite_cylinder, callers moved to it
#[inline(always)]
pub fn sdf_cylinder_infinite(point: Vec3, radius: f32) -> f32 {
// Only XZ distance matters - direct scalar math
alice_det_math::hypot(point.x, point.z) - radius
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_cylinder_origin() {
let d = sdf_cylinder(Vec3::ZERO, 1.0, 1.0);
assert!(d < 0.0); // Inside
}
#[test]
fn test_cylinder_surface_side() {
// On the side surface
let d = sdf_cylinder(Vec3::new(1.0, 0.0, 0.0), 1.0, 1.0);
assert!(d.abs() < 0.0001);
}
#[test]
fn test_cylinder_surface_top() {
// On the top cap
let d = sdf_cylinder(Vec3::new(0.0, 1.0, 0.0), 1.0, 1.0);
assert!(d.abs() < 0.0001);
}
#[test]
fn test_cylinder_outside_side() {
let d = sdf_cylinder(Vec3::new(2.0, 0.0, 0.0), 1.0, 1.0);
assert!((d - 1.0).abs() < 0.0001);
}
#[test]
fn test_cylinder_outside_top() {
let d = sdf_cylinder(Vec3::new(0.0, 2.0, 0.0), 1.0, 1.0);
assert!((d - 1.0).abs() < 0.0001);
}
#[test]
#[allow(deprecated)] // the duplicate stays tested while it exists
fn test_cylinder_infinite() {
// Infinite cylinder - only radial distance matters
let d = sdf_cylinder_infinite(Vec3::new(2.0, 100.0, 0.0), 1.0);
assert!((d - 1.0).abs() < 0.0001);
}
#[test]
fn test_cylinder_capped_vertical() {
// Vertical capped cylinder from (0,0,0) to (0,2,0)
let a = Vec3::ZERO;
let b = Vec3::new(0.0, 2.0, 0.0);
let radius = 0.5;
// At center
let d = sdf_cylinder_capped(Vec3::new(0.0, 1.0, 0.0), a, b, radius);
assert!(d < 0.0); // Inside
// On side surface
let d = sdf_cylinder_capped(Vec3::new(0.5, 1.0, 0.0), a, b, radius);
assert!(d.abs() < 0.01);
}
}