/// Given a bounding box and a point, compute and return a new `BBox` that
/// encompasses the point and the space the original box encompassed.
Given a bounding box and a point, compute and return a new `BBox` that
encompasses the point and the space the original box encompassed.
Given a bounding box and a point compute and return a new ` BBox ` that encompasses the point and the space the original box encompassed .
pub fn union_point(b: &BBox, p: &Vec3) -> BBox {
    BBox {
        min: Vec3 {
            x: b.min.x.min(p.x),
            y: b.min.y.min(p.y),
            z: b.min.z.min(p.z)
        },
        max: Vec3 {
            x: b.max.x.max(p.x),
            y: b.max.y.max(p.y),
            z: b.max.z.max(p.z)
        }
    }
}
pub fn union_point ( b : & BBox , p : & Vec3 ) -> BBox { BBox { min : Vec3 { x : b . min . x . min ( p . x ) , y : b . min . y . min ( p . y ) , z : b . min . z . min ( p . z ) } , max : Vec3 { x : b . max . x . max ( p . x ) , y : b . max . y . max ( p . y ) , z : b . max . z . max ( p . z ) } } }
Given a bounding box and a point, compute and return a new `BBox` that
encompasses the point and the space the original box encompassed.
Given a bounding box and a point compute and return a new ` BBox ` that encompasses the point and the space the original box encompassed .
b
&BBox
p
&Vec3