splinosaurus 0.2.2

flexible spline and surface 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

use crate::algorithms::cox_de_boor_uv;
use crate::surfaces::{BSurface, Surface, UV};
use crate::types::{Scalar, Vector};
use core::ops::RangeInclusive;
use nalgebra::allocator::Allocator;
use nalgebra::{Const, DefaultAllocator, Dim, DimDiff, DimName, DimSub, U1};

/// NURBS (surface). Representing a weighted BSurface.
#[derive(Debug)]
pub struct NURBSurface<'a, D: Dim, T: Scalar>
where
    DefaultAllocator: Allocator<T, D>,
{
    spline: &'a BSurface<D, T>,
}

impl<'a, D: Dim, T: Scalar> NURBSurface<'a, D, T>
where
    DefaultAllocator: Allocator<T, D>,
{
    pub(crate) fn new(spline: &'a BSurface<D, T>) -> Self {
        Self { spline }
    }
}

impl<D: Dim + DimSub<U1>, T: Scalar> Surface<DimDiff<D, U1>, T> for NURBSurface<'_, D, T>
where
    <D as DimSub<Const<1>>>::Output: DimName,
    DefaultAllocator: Allocator<T, D>,
    DefaultAllocator: Allocator<T, <D as DimSub<Const<1>>>::Output>,
    <DefaultAllocator as Allocator<T, D>>::Buffer: Default,
    <DefaultAllocator as Allocator<T, <D as DimSub<Const<1>>>::Output>>::Buffer: Default,
{
    fn u_range(&self) -> RangeInclusive<T> {
        self.spline.u_range()
    }

    fn v_range(&self) -> RangeInclusive<T> {
        self.spline.v_range()
    }

    fn at(&self, uv: UV<T>) -> Vector<DimDiff<D, U1>, T> {
        let higher = cox_de_boor_uv(
            uv,
            self.spline.degree(),
            &self.spline.u_knots(),
            &self.spline.v_knots(),
            |i| {
                let mut weighted = self.spline.control_grid()[i].clone();
                for i in 0..weighted.len() - 1 {
                    let w = weighted[i] * weighted[weighted.len() - 1];
                    weighted[i] = w;
                }
                weighted
            },
        );
        let mut lower = Vector::<DimDiff<D, U1>, T>::default();
        for i in 0..lower.len() {
            lower[i] = higher[i] / higher[higher.len() - 1];
        }
        lower
    }
}