Skip to main content

LevelSetBoolean

Struct LevelSetBoolean 

Source
pub struct LevelSetBoolean;
Expand description

Boolean operations on level-set fields via min/max composition.

All operations create a new LevelSetField with the same grid layout as field_a. The fields must have identical grid dimensions, spacing, and origin.

Implementations§

Source§

impl LevelSetBoolean

Source

pub fn union(field_a: &LevelSetField, field_b: &LevelSetField) -> LevelSetField

Union of two level-set fields: φ = min(φ_a, φ_b).

Corresponds to the union of the two implicit surfaces.

§Arguments
  • field_a – first operand
  • field_b – second operand (must have same grid as field_a)
Source

pub fn intersection( field_a: &LevelSetField, field_b: &LevelSetField, ) -> LevelSetField

Intersection of two level-set fields: φ = max(φ_a, φ_b).

Corresponds to the intersection of the two implicit surfaces.

§Arguments
  • field_a – first operand
  • field_b – second operand (must have same grid as field_a)
Source

pub fn difference( field_a: &LevelSetField, field_b: &LevelSetField, ) -> LevelSetField

Difference A − B: φ = max(φ_a, −φ_b).

Corresponds to removing the region of field_b from field_a.

§Arguments
  • field_a – base operand
  • field_b – region to subtract
Source

pub fn complement(field_a: &LevelSetField) -> LevelSetField

Complement (negation): φ = −φ_a.

Flips the inside/outside classification of the level-set.

§Arguments
  • field_a – the level-set field to negate
Source

pub fn smooth_union( field_a: &LevelSetField, field_b: &LevelSetField, k: f64, ) -> LevelSetField

Smooth minimum blend (C¹ union): φ = smin(φ_a, φ_b, k).

Produces a smooth blend at the union boundary with blend radius k.

§Arguments
  • field_a – first operand
  • field_b – second operand
  • k – blend radius (larger k → smoother blend)

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.