Skip to main content

LevelSetEvolution

Struct LevelSetEvolution 

Source
pub struct LevelSetEvolution {
    pub dt: f64,
    pub n_steps: usize,
}
Expand description

Level-set evolution by advection and mean curvature flow.

Implements the upwind finite difference scheme for advection and the explicit mean-curvature-flow equation for smoothing.

Fields§

§dt: f64

Time step for explicit integration.

§n_steps: usize

Number of time steps per evolution call.

Implementations§

Source§

impl LevelSetEvolution

Source

pub fn new(dt: f64, n_steps: usize) -> Self

Create a new LevelSetEvolution solver.

§Arguments
  • dt – explicit time step (should satisfy CFL: dt ≤ dx/|v|_max)
  • n_steps – number of time steps per advect or mean_curvature_flow call
Source

pub fn advect(&self, field: &mut LevelSetField, velocity: [f64; 3])

Advect the level-set field by a uniform velocity field using the upwind scheme.

Solves ∂φ/∂t + v · ∇φ = 0 with first-order upwind spatial discretisation.

§Arguments
  • field – level-set field (modified in place)
  • velocity – uniform velocity vector [vx, vy, vz]
Source

pub fn mean_curvature_flow(&self, field: &mut LevelSetField)

Evolve the level-set by mean curvature flow.

Solves ∂φ/∂t = κ |∇φ| where κ is the mean curvature. Uses explicit Euler integration.

§Arguments
  • field – level-set field (modified in place)
Source

pub fn normal_velocity_extension( &self, field: &mut LevelSetField, normal_velocity: f64, )

Normal velocity extension: propagate the interface normal velocity outward.

For each node computes the update φ_new = φ - dt * F |∇φ| where F is a prescribed scalar normal velocity.

§Arguments
  • field – level-set field (modified in place)
  • normal_velocity – scalar normal speed (positive = expansion)

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.