use std::f64::consts::{FRAC_1_SQRT_2, FRAC_PI_2, PI, TAU};
use stepmesh::internals::{
Curve, Frame, Nurbs1, Nurbs2, Surface, Units, decode_curve, decode_surface, expand_knots,
};
use stepmesh::p21::parse;
struct Rng(u64);
impl Rng {
fn next(&mut self) -> f64 {
self.0 ^= self.0 << 13;
self.0 ^= self.0 >> 7;
self.0 ^= self.0 << 17;
(self.0 >> 11) as f64 / (1u64 << 53) as f64
}
fn range(&mut self, a: f64, b: f64) -> f64 {
a + (b - a) * self.next()
}
}
fn dist(a: [f64; 3], b: [f64; 3]) -> f64 {
((a[0] - b[0]).powi(2) + (a[1] - b[1]).powi(2) + (a[2] - b[2]).powi(2)).sqrt()
}
fn frame() -> Frame {
Frame::new([1.0, -2.0, 3.0], [0.3, 0.4, 1.0], [1.0, 0.2, 0.0]).unwrap()
}
fn nurbs_circle(r: f64) -> Nurbs1 {
let w = std::f64::consts::FRAC_1_SQRT_2;
let pts = [
(1., 0., 1.),
(1., 1., w),
(0., 1., 1.),
(-1., 1., w),
(-1., 0., 1.),
(-1., -1., w),
(0., -1., 1.),
(1., -1., w),
(1., 0., 1.),
];
Nurbs1 {
degree: 2,
knots: expand_knots(&[3, 2, 2, 2, 3], &[0.0, 1.0, 2.0, 3.0, 4.0]),
ctrl: pts
.iter()
.map(|&(x, y, w)| [x * r * w, y * r * w, 0.0, w])
.collect(),
}
}
fn nurbs_patch(rng: &mut Rng) -> Nurbs2 {
let ctrl = (0..4)
.map(|i| {
(0..5)
.map(|j| {
let w = rng.range(0.6, 1.4);
[
i as f64 * 3.0 * w,
j as f64 * 2.0 * w,
rng.range(-1.0, 1.0) * w,
w,
]
})
.collect()
})
.collect();
Nurbs2 {
du: 3,
dv: 2,
ku: expand_knots(&[4, 4], &[0.0, 1.0]),
kv: expand_knots(&[3, 1, 1, 3], &[0.0, 0.3, 0.7, 1.0]),
ctrl,
closed_u: false,
closed_v: false,
}
}
fn surfaces(rng: &mut Rng) -> Vec<(&'static str, Surface)> {
let f = frame();
vec![
("plane", Surface::Plane(f.clone())),
(
"cylinder",
Surface::Cylinder {
frame: f.clone(),
r: 4.0,
},
),
(
"cone",
Surface::Cone {
frame: f.clone(),
r: 3.0,
half_angle: 0.4,
},
),
(
"sphere",
Surface::Sphere {
frame: f.clone(),
r: 5.0,
},
),
(
"torus",
Surface::Torus {
frame: f.clone(),
major: 10.0,
minor: 3.0,
},
),
("nurbs", Surface::Nurbs(nurbs_patch(rng))),
(
"extrusion",
Surface::Extrusion {
curve: Curve::Nurbs(nurbs_circle(2.0)),
dir: [0.0, 0.6, 0.8],
},
),
(
"revolution",
Surface::Revolution {
curve: Curve::Line {
origin: [3.0, 0.0, 0.0],
dir: [0.287_347_885_566_345_2, 0.0, 0.957_826_285_221_150_7],
},
axis_origin: [0.0, 0.0, 0.0],
axis_dir: [0.0, 0.0, 1.0],
},
),
(
"offset",
Surface::Offset {
basis: Box::new(Surface::Nurbs(nurbs_patch(rng))),
distance: 0.5,
},
),
(
"revolution from the axis",
Surface::Revolution {
curve: Curve::Nurbs(Nurbs1 {
degree: 2,
knots: expand_knots(&[3, 2, 3], &[0.0, 0.5, 1.0]),
ctrl: vec![
[0.0, 0.0, 4.0, 1.0],
[0.0, 4.0 * FRAC_1_SQRT_2, 4.0 * FRAC_1_SQRT_2, FRAC_1_SQRT_2],
[0.0, 4.0, 0.0, 1.0],
[
0.0,
4.0 * FRAC_1_SQRT_2,
-4.0 * FRAC_1_SQRT_2,
FRAC_1_SQRT_2,
],
[0.0, 0.0, -4.0, 1.0],
],
}),
axis_origin: [0.0, 0.0, 0.0],
axis_dir: [0.0, 0.0, 1.0],
},
),
]
}
#[test]
fn rational_quadratic_circle_is_exact() {
let c = Curve::Nurbs(nurbs_circle(3.0));
for i in 0..=1000 {
let p = c.point(4.0 * i as f64 / 1000.0);
assert!(
((p[0].powi(2) + p[1].powi(2)).sqrt() - 3.0).abs() < 1e-12,
"{p:?}"
);
}
}
#[test]
fn knot_multiplicities_expand() {
assert_eq!(
expand_knots(&[4, 4], &[0.0, 1.0]),
[0.0, 0.0, 0.0, 0.0, 1.0, 1.0, 1.0, 1.0]
);
}
#[test]
fn curve_derivative_matches_finite_difference() {
let curves = [
Curve::Nurbs(nurbs_circle(3.0)),
Curve::Circle {
frame: frame(),
r: 2.0,
},
Curve::Ellipse {
frame: frame(),
a: 4.0,
b: 1.5,
},
];
for c in &curves {
for t in [0.3, 1.1, 2.5] {
let h = 1e-6;
let (a, b) = (c.point(t - h), c.point(t + h));
let fd = [
(b[0] - a[0]) / (2.0 * h),
(b[1] - a[1]) / (2.0 * h),
(b[2] - a[2]) / (2.0 * h),
];
let d = c.derivative(t);
assert!(
dist(fd, d) < 1e-5 * (1.0 + dist(d, [0.0; 3])),
"{c:?} {fd:?} {d:?}"
);
}
}
}
#[test]
fn curve_project_round_trip() {
let curves = [
Curve::Line {
origin: [1.0, 2.0, 3.0],
dir: [0.6, 0.8, 0.0],
},
Curve::Nurbs(nurbs_circle(3.0)),
Curve::Circle {
frame: frame(),
r: 2.0,
},
Curve::Ellipse {
frame: frame(),
a: 4.0,
b: 1.5,
},
];
let mut rng = Rng(7);
for c in &curves {
let (t0, t1) = c.param_range();
for _ in 0..200 {
let t = rng.range(t0.max(-50.0), t1.min(50.0));
let p = c.point(t);
let q = c.point(c.project(p));
assert!(dist(p, q) < 1e-9, "{c:?} t={t} {p:?} {q:?}");
}
}
}
#[test]
fn surface_project_round_trip() {
let mut rng = Rng(11);
for (name, s) in surfaces(&mut rng) {
let [(u0, u1), (v0, v1)] = s.param_bounds();
for _ in 0..200 {
let u = rng.range(u0.max(-20.0), u1.min(20.0));
let v = rng.range(v0.max(-20.0), v1.min(20.0));
let p = s.point(u, v);
let (pu, pv) = s
.project(p, None)
.unwrap_or_else(|| panic!("{name}: no projection for ({u}, {v})"));
let q = s.point(pu, pv);
assert!(
dist(p, q) < 1e-9,
"{name}: ({u}, {v}) -> ({pu}, {pv}), {}",
dist(p, q)
);
}
}
}
#[test]
fn project_off_surface_finds_closest() {
let s = Surface::Cylinder {
frame: frame(),
r: 4.0,
};
let f = frame();
let on = s.point(1.0, 2.0);
let n = s.normal(1.0, 2.0);
let off = [on[0] + n[0], on[1] + n[1], on[2] + n[2]];
let (u, v) = s.project(off, None).unwrap();
assert!(dist(s.point(u, v), on) < 1e-9);
assert!((dist(off, s.point(u, v)) - 1.0).abs() < 1e-9);
let _ = f;
}
#[test]
fn surface_normal_is_unit_and_orthogonal() {
let mut rng = Rng(5);
for (name, s) in surfaces(&mut rng) {
let [(u0, u1), (v0, v1)] = s.param_bounds();
for _ in 0..50 {
let u = rng.range(u0.max(-20.0), u1.min(20.0));
let v = rng
.range(v0.max(-20.0), v1.min(20.0))
.clamp(-FRAC_PI_2 + 0.01, 20.0);
let v = if name == "sphere" {
v.min(FRAC_PI_2 - 0.01)
} else {
v
};
let n = s.normal(u, v);
assert!((dist(n, [0.0; 3]) - 1.0).abs() < 1e-9, "{name}");
let h = 1e-6;
for (a, b) in [
(s.point(u - h, v), s.point(u + h, v)),
(s.point(u, v - h), s.point(u, v + h)),
] {
let t = [b[0] - a[0], b[1] - a[1], b[2] - a[2]];
let len = dist(t, [0.0; 3]);
if len > 1e-9 {
let c = (t[0] * n[0] + t[1] * n[1] + t[2] * n[2]) / len;
assert!(c.abs() < 1e-5, "{name}: normal not orthogonal ({c})");
}
}
}
}
}
#[test]
fn periods() {
let f = frame();
assert_eq!(
Surface::Cylinder {
frame: f.clone(),
r: 1.0
}
.period(),
(Some(TAU), None)
);
assert_eq!(
Surface::Torus {
frame: f.clone(),
major: 3.0,
minor: 1.0
}
.period(),
(Some(TAU), Some(TAU))
);
assert_eq!(Surface::Plane(f).period(), (None, None));
let _ = PI;
}
const RATIONAL: &str = "ISO-10303-21;HEADER;FILE_SCHEMA(('AUTOMOTIVE_DESIGN'));ENDSEC;DATA;
#1=CARTESIAN_POINT('',(3.,0.,0.));#2=CARTESIAN_POINT('',(3.,3.,0.));#3=CARTESIAN_POINT('',(0.,3.,0.));
#4=(BOUNDED_CURVE()B_SPLINE_CURVE(2,(#1,#2,#3),.UNSPECIFIED.,.F.,.F.)B_SPLINE_CURVE_WITH_KNOTS((3,3),(0.,1.),.UNSPECIFIED.)
CURVE()GEOMETRIC_REPRESENTATION_ITEM()RATIONAL_B_SPLINE_CURVE((1.,0.7071067811865476,1.))REPRESENTATION_ITEM(''));
#5=CARTESIAN_POINT('',(0.,0.,0.));#6=DIRECTION('',(0.,0.,1.));#7=DIRECTION('',(1.,0.,0.));
#8=AXIS2_PLACEMENT_3D('',#5,#6,#7);#9=CONICAL_SURFACE('',#8,2.,30.);
#10=RECTANGULAR_TRIMMED_SURFACE('',#9,0.,1.,0.,1.,.T.,.T.);
ENDSEC;END-ISO-10303-21;";
const OFFSETS: &str = "ISO-10303-21;HEADER;FILE_SCHEMA(('AUTOMOTIVE_DESIGN'));ENDSEC;DATA;
#5=CARTESIAN_POINT('',(0.,0.,0.));#6=DIRECTION('',(0.,0.,1.));#7=DIRECTION('',(1.,0.,0.));
#8=AXIS2_PLACEMENT_3D('',#5,#6,#7);#9=CYLINDRICAL_SURFACE('',#8,2.);
#10=OFFSET_SURFACE('',#9,1.,.F.);#11=OFFSET_SURFACE('',#9,-0.5,.F.);
#12=OFFSET_SURFACE('',#12,1.,.F.);
ENDSEC;END-ISO-10303-21;";
#[test]
fn offset_surface_moves_along_the_normal() {
let x = parse(OFFSETS.as_bytes()).unwrap();
let units = Units {
length_mm: 1.0,
angle_rad: 1.0,
};
for (id, r) in [(10, 3.0), (11, 1.5)] {
let s = decode_surface(&x, id, units).unwrap();
for (u, v) in [(0.0, 0.0), (1.0, 2.0), (4.0, -3.0)] {
let want = [r * f64::cos(u), r * f64::sin(u), v];
assert!(dist(s.point(u, v), want) < 1e-12, "#{id} at ({u}, {v})");
let (pu, pv) = s.project(want, None).unwrap();
assert!(dist(s.point(pu, pv), want) < 1e-9, "#{id} projects");
}
}
assert!(matches!(
decode_surface(&x, 12, units),
Err(stepmesh::Error::Invalid { .. })
));
}
#[test]
fn rational_bspline_complex_entity_decodes() {
let x = parse(RATIONAL.as_bytes()).unwrap();
let c = decode_curve(
&x,
4,
Units {
length_mm: 2.0,
angle_rad: 1.0,
},
)
.unwrap();
let (t0, t1) = c.param_range();
for i in 0..=20 {
let p = c.point(t0 + (t1 - t0) * i as f64 / 20.0);
assert!(
((p[0].powi(2) + p[1].powi(2)).sqrt() - 6.0).abs() < 1e-12,
"quarter circle of radius 3 in units of 2 mm: {p:?}"
);
}
}
#[test]
fn cone_angle_uses_the_angle_unit() {
let x = parse(RATIONAL.as_bytes()).unwrap();
let s = decode_surface(
&x,
9,
Units {
length_mm: 1.0,
angle_rad: PI / 180.0,
},
)
.unwrap();
match s {
Surface::Cone { r, half_angle, .. } => {
assert_eq!(r, 2.0);
assert!((half_angle - PI / 6.0).abs() < 1e-15);
}
other => panic!("{other:?}"),
}
}
#[test]
fn unknown_surface_is_unsupported() {
let x = parse(RATIONAL.as_bytes()).unwrap();
let r = decode_surface(
&x,
10,
Units {
length_mm: 1.0,
angle_rad: 1.0,
},
);
assert_eq!(
r.err(),
Some(stepmesh::Error::Unsupported {
entity: "RECTANGULAR_TRIMMED_SURFACE".into(),
id: 10
})
);
}
fn ruled_arc() -> Surface {
let w = 1.0 / 3.0;
let arc = |z: f64| {
vec![
[-5.0, 0.0, z, 1.0],
[-5.0 / 3.0, -10.0 / 3.0, z * w, w],
[5.0 / 3.0, -10.0 / 3.0, z * w, w],
[5.0, 0.0, z, 1.0],
]
};
Surface::Nurbs(Nurbs2 {
du: 1,
dv: 3,
ku: vec![0.000_998, 0.000_998, 200.000_998, 200.000_998],
kv: expand_knots(&[4, 4], &[0.0, 30.0]),
ctrl: vec![arc(200.0), arc(0.0)],
closed_u: false,
closed_v: false,
})
}
#[test]
fn projection_on_the_parameter_boundary() {
let s = ruled_arc();
let [(u0, _), (v0, v1)] = s.param_bounds();
let mut hint = None;
for i in 0..=300 {
let v = v0 + (v1 - v0) * i as f64 / 300.0;
let p = s.point(u0, v);
let found = s
.project(p, hint)
.unwrap_or_else(|| panic!("no projection at v = {v} (hint {hint:?})"));
assert!(dist(s.point(found.0, found.1), p) < 1e-9);
assert!(
s.project(p, None).is_some(),
"no projection without a hint at v = {v}"
);
hint = Some(found);
}
}
#[test]
fn projection_recovers_from_a_misleading_hint() {
let mut rng = Rng(3);
let s = Surface::Nurbs(nurbs_patch(&mut rng));
let [(u0, u1), (v0, v1)] = s.param_bounds();
for i in 0..50 {
let (u, v) = (
u0 + (u1 - u0) * (i as f64 / 49.0),
v0 + (v1 - v0) * ((i * 7 % 50) as f64 / 49.0),
);
let p = s.point(u, v);
for hint in [(u0, v0), (u1, v1), (u0, v1), (u1, v0)] {
let (pu, pv) = s.project(p, Some(hint)).expect("projection");
assert!(
dist(s.point(pu, pv), p) < 1e-9,
"({u}, {v}) from hint {hint:?}: ({pu}, {pv})"
);
}
}
}
#[test]
fn closed_bspline_curve_wraps_outside_its_range() {
let c = Curve::Nurbs(nurbs_circle(3.0));
let (t0, t1) = c.param_range();
let per = t1 - t0;
for i in 0..40 {
let t = t0 + per * i as f64 / 40.0;
assert!(dist(c.point(t + per), c.point(t)) < 1e-12, "t = {t}");
assert!(dist(c.point(t - per), c.point(t)) < 1e-12, "t = {t}");
}
let s = Surface::Extrusion {
curve: c,
dir: [0.0, 0.0, 1.0],
};
assert!(dist(s.point(t1 + 0.3, 1.0), s.point(t0 + 0.3, 1.0)) < 1e-12);
}
#[test]
fn projection_of_a_point_just_off_a_boundary() {
let mut rng = Rng(9);
let s = Surface::Nurbs(nurbs_patch(&mut rng));
let [(u0, u1), (_, v1)] = s.param_bounds();
for i in 1..20 {
let u = u0 + (u1 - u0) * i as f64 / 20.0;
let (p, _, sv) = s.derivs(u, v1);
let len = dist(sv, [0.0; 3]);
let q = [
p[0] + sv[0] / len * 1e-8,
p[1] + sv[1] / len * 1e-8,
p[2] + sv[2] / len * 1e-8,
];
let found = s
.project(q, Some((u0, v1)))
.unwrap_or_else(|| panic!("no projection at u = {u}"));
assert!(dist(s.point(found.0, found.1), p) < 1e-6);
}
}
fn pole_patch() -> Surface {
let ctrl = (0..4)
.map(|i| {
(0..5)
.map(|j| {
let r = i as f64 * 3.0;
let a = std::f64::consts::PI * j as f64 / 4.0;
[r * a.cos(), r * a.sin(), 0.5 * r * r / 9.0, 1.0]
})
.collect()
})
.collect();
Surface::Nurbs(Nurbs2 {
du: 3,
dv: 2,
ku: expand_knots(&[4, 4], &[0.0, 1.0]),
kv: expand_knots(&[3, 1, 1, 3], &[0.0, 0.3, 0.7, 1.0]),
ctrl,
closed_u: false,
closed_v: false,
})
}
#[test]
fn projection_near_a_collapsed_side() {
let s = pole_patch();
for i in 1..30 {
for &v in &[0.0, 0.5, 1.0] {
let u = 0.02 * i as f64 / 29.0;
let p = s.point(u, v);
let (pu, pv) = s
.project(p, None)
.unwrap_or_else(|| panic!("no projection at ({u}, {v})"));
assert!(
dist(s.point(pu, pv), p) < 1e-7,
"({u}, {v}) -> ({pu}, {pv}): {}",
dist(s.point(pu, pv), p)
);
}
}
}
const IMPLICIT_KNOTS: &str = "ISO-10303-21;HEADER;FILE_SCHEMA(('AUTOMOTIVE_DESIGN'));ENDSEC;DATA;
#1=CARTESIAN_POINT('',(0.,0.,0.));#2=CARTESIAN_POINT('',(1.,2.,0.));#3=CARTESIAN_POINT('',(3.,2.,0.));
#4=CARTESIAN_POINT('',(4.,0.,0.));#5=CARTESIAN_POINT('',(6.,1.,0.));
#10=QUASI_UNIFORM_CURVE('',2,(#1,#2,#3,#4,#5),.UNSPECIFIED.,.F.,.F.);
#11=B_SPLINE_CURVE_WITH_KNOTS('',2,(#1,#2,#3,#4,#5),.UNSPECIFIED.,.F.,.F.,(3,1,1,3),(0.,1.,2.,3.),.QUASI_UNIFORM_KNOTS.);
#12=(BOUNDED_CURVE()B_SPLINE_CURVE(2,(#1,#2,#3,#4,#5),.UNSPECIFIED.,.F.,.F.)CURVE()GEOMETRIC_REPRESENTATION_ITEM()
QUASI_UNIFORM_CURVE()RATIONAL_B_SPLINE_CURVE((1.,1.,1.,1.,1.))REPRESENTATION_ITEM(''));
#13=BEZIER_CURVE('',2,(#1,#2,#3,#4,#5),.UNSPECIFIED.,.F.,.F.);
#14=B_SPLINE_CURVE_WITH_KNOTS('',2,(#1,#2,#3,#4,#5),.UNSPECIFIED.,.F.,.F.,(3,2,3),(0.,1.,2.),.PIECEWISE_BEZIER_KNOTS.);
#15=UNIFORM_CURVE('',2,(#1,#2,#3,#4,#5),.UNSPECIFIED.,.F.,.F.);
#16=B_SPLINE_CURVE_WITH_KNOTS('',2,(#1,#2,#3,#4,#5),.UNSPECIFIED.,.F.,.F.,(1,1,1,1,1,1,1,1),(-2.,-1.,0.,1.,2.,3.,4.,5.),.UNIFORM_KNOTS.);
ENDSEC;END-ISO-10303-21;";
#[test]
fn implicit_knot_curves_match_explicit_ones() {
let x = parse(IMPLICIT_KNOTS.as_bytes()).unwrap();
let mm = Units {
length_mm: 1.0,
angle_rad: 1.0,
};
for (implicit, explicit) in [(10, 11), (12, 11), (13, 14), (15, 16)] {
let a = decode_curve(&x, implicit, mm).unwrap_or_else(|e| panic!("#{implicit}: {e}"));
let b = decode_curve(&x, explicit, mm).unwrap();
assert_eq!(a.param_range(), b.param_range(), "#{implicit}");
let (t0, t1) = b.param_range();
for i in 0..=20 {
let t = t0 + (t1 - t0) * i as f64 / 20.0;
assert!(dist(a.point(t), b.point(t)) < 1e-12, "#{implicit} at {t}");
}
}
}
const IMPLICIT_KNOT_SURFACE: &str = "ISO-10303-21;HEADER;FILE_SCHEMA(('AUTOMOTIVE_DESIGN'));ENDSEC;DATA;
#1=CARTESIAN_POINT('',(0.,0.,0.));#2=CARTESIAN_POINT('',(1.,0.,1.));#3=CARTESIAN_POINT('',(2.,0.,0.));
#4=CARTESIAN_POINT('',(0.,1.,1.));#5=CARTESIAN_POINT('',(1.,1.,2.));#6=CARTESIAN_POINT('',(2.,1.,1.));
#10=BEZIER_SURFACE('',1,2,((#1,#2,#3),(#4,#5,#6)),.UNSPECIFIED.,.F.,.F.,.F.);
#11=B_SPLINE_SURFACE_WITH_KNOTS('',1,2,((#1,#2,#3),(#4,#5,#6)),.UNSPECIFIED.,.F.,.F.,.F.,(2,2),(3,3),(0.,1.),(0.,1.),.PIECEWISE_BEZIER_KNOTS.);
ENDSEC;END-ISO-10303-21;";
#[test]
fn implicit_knot_surface_matches_explicit_one() {
let x = parse(IMPLICIT_KNOT_SURFACE.as_bytes()).unwrap();
let mm = Units {
length_mm: 1.0,
angle_rad: 1.0,
};
let a = decode_surface(&x, 10, mm).unwrap();
let b = decode_surface(&x, 11, mm).unwrap();
for i in 0..=10 {
for j in 0..=10 {
let (u, v) = (i as f64 / 10.0, j as f64 / 10.0);
assert!(dist(a.point(u, v), b.point(u, v)) < 1e-12);
}
}
}
#[test]
fn bspline_closed_within_tolerance() {
let mut rng = Rng(21);
let mut patch = nurbs_patch(&mut rng);
let last = patch.ctrl.len() - 1;
patch.ctrl[last] = patch.ctrl[0]
.iter()
.map(|c| [c[0] + 1e-6 * c[3], c[1], c[2], c[3]])
.collect();
assert!(Surface::Nurbs(patch).period().0.is_some());
}
#[test]
fn unclamped_periodic_surface_is_closed() {
let ring = |a: f64| {
(0..3)
.map(|j| [5.0 * a.cos(), 5.0 * a.sin(), j as f64, 1.0])
.collect::<Vec<_>>()
};
let rows: Vec<Vec<[f64; 4]>> = (0..6)
.map(|i| ring(std::f64::consts::TAU * (i % 4) as f64 / 4.0))
.collect();
let s = Surface::Nurbs(Nurbs2 {
du: 2,
dv: 1,
ku: (0..9).map(|i| i as f64).collect(),
kv: vec![0.0, 0.0, 1.0, 2.0, 2.0],
ctrl: rows,
closed_u: true,
closed_v: false,
});
assert_eq!(s.period().0, Some(4.0));
}
#[test]
fn projection_settles_a_radius_out_from_a_round_wall() {
let s = Surface::Extrusion {
curve: Curve::Nurbs(nurbs_circle(2.0)),
dir: [0.0, 0.0, 1.0],
};
for k in 0..16 {
let a = 0.1 + TAU * k as f64 / 16.0;
let p = [3.9 * a.cos(), 3.9 * a.sin(), 0.5];
let (u, v) = s
.project(p, None)
.unwrap_or_else(|| panic!("no foot for {p:?}"));
let foot = [2.0 * a.cos(), 2.0 * a.sin(), 0.5];
assert!(
dist(s.point(u, v), foot) < 1e-6,
"{p:?}: foot {:?}",
s.point(u, v)
);
}
}
#[test]
fn projection_reaches_past_the_end_of_a_swept_curve() {
let s = Surface::Extrusion {
curve: Curve::Nurbs(Nurbs1 {
degree: 2,
knots: vec![0.0, 0.0, 0.0, 1.0, 1.0, 1.0],
ctrl: vec![
[0.0, 0.0, 0.0, 1.0],
[5.0, 2.0, 0.0, 1.0],
[10.0, 0.0, 0.0, 1.0],
],
}),
dir: [0.0, 0.0, 1.0],
};
let beyond = s.point(1.0002, 3.0);
let (u, v) = s.project(beyond, Some((0.99, 3.0))).unwrap();
assert!(u > 1.0, "held at the end: u {u}");
assert!(dist(s.point(u, v), beyond) < 1e-9);
}