pub struct CsgSmoothIntersection {
pub a: Box<dyn ImplicitSurface>,
pub b: Box<dyn ImplicitSurface>,
pub k: f64,
}Expand description
Smooth CSG intersection.
SDF = smooth_max(sdf_a, sdf_b, k).
Fields§
§a: Box<dyn ImplicitSurface>First operand.
b: Box<dyn ImplicitSurface>Second operand.
k: f64Smoothing factor.
Implementations§
Source§impl CsgSmoothIntersection
impl CsgSmoothIntersection
Sourcepub fn new(
a: Box<dyn ImplicitSurface>,
b: Box<dyn ImplicitSurface>,
k: f64,
) -> Self
pub fn new( a: Box<dyn ImplicitSurface>, b: Box<dyn ImplicitSurface>, k: f64, ) -> Self
Create a new smooth intersection.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for CsgSmoothIntersection
impl !RefUnwindSafe for CsgSmoothIntersection
impl Send for CsgSmoothIntersection
impl Sync for CsgSmoothIntersection
impl Unpin for CsgSmoothIntersection
impl UnsafeUnpin for CsgSmoothIntersection
impl !UnwindSafe for CsgSmoothIntersection
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.