geom3d 0.2.0

Data structures and algorithms for 3D geometric modeling.
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

use super::Surface;
use crate::basis::bernstein;
use crate::{Float, Grid, Point3, Point4};

#[derive(Debug)]
pub struct BezierSurface<P> {
    pub control_points: Grid<P>,
}

impl<P: Clone> BezierSurface<P> {
    pub fn new(control_points: Grid<P>) -> Self {
        assert!(control_points.rows() > 1 && control_points.cols() > 1);
        Self { control_points }
    }
}

impl Surface for BezierSurface<Point3> {
    fn get_point(&self, u: Float, v: Float) -> Point3 {
        let (n, m) = self.control_points.size();
        let basis_u = bernstein(n, u); // n rows
        let basis_v = bernstein(m, v); // m cols
        let mut point = Point3::ZERO;
        for i in 0..n {
            for j in 0..m {
                let p = self.control_points[i][j];
                point += basis_u[i] * basis_v[j] * p;
            }
        }
        point
    }
}

/// Rational bezier surface, point (x,y,z) with weight w is (wx,wy,wz,w)
impl Surface for BezierSurface<Point4> {
    fn get_point(&self, u: Float, v: Float) -> Point3 {
        let (n, m) = self.control_points.size();
        let basis_u = bernstein(n, u); // n rows
        let basis_v = bernstein(m, v); // m cols
        let mut point = Point4::ZERO;
        for i in 0..n {
            for j in 0..m {
                let p = self.control_points[i][j];
                point += basis_u[i] * basis_v[j] * p;
            }
        }
        (1.0 / point.w) * point.truncate()
    }
}