Skip to main content

LevelSetField

Struct LevelSetField 

Source
pub struct LevelSetField {
    pub nx: usize,
    pub ny: usize,
    pub nz: usize,
    pub dx: f64,
    pub origin: [f64; 3],
    pub data: Vec<f64>,
}
Expand description

Signed distance function sampled on a uniform 3-D Cartesian grid.

The grid has nx × ny × nz cells. Values are stored in row-major order as data[iz * ny * nx + iy * nx + ix]. Positive values are outside the surface; negative values are inside.

Fields§

§nx: usize

Number of grid points along x.

§ny: usize

Number of grid points along y.

§nz: usize

Number of grid points along z.

§dx: f64

Grid spacing (uniform in all directions).

§origin: [f64; 3]

Origin of the grid (coordinates of node [0,0,0]).

§data: Vec<f64>

Flat array of signed distance values, length nx * ny * nz.

Implementations§

Source§

impl LevelSetField

Source

pub fn new(nx: usize, ny: usize, nz: usize, dx: f64, origin: [f64; 3]) -> Self

Create a new LevelSetField filled with f64::MAX (uninitialized).

§Arguments
  • nx, ny, nz – grid dimensions
  • dx – uniform grid spacing
  • origin – world-space coordinates of node (0,0,0)
Source

pub fn idx(&self, ix: usize, iy: usize, iz: usize) -> usize

Linear index for grid node (ix, iy, iz).

Source

pub fn node_pos(&self, ix: usize, iy: usize, iz: usize) -> [f64; 3]

World-space coordinates of grid node (ix, iy, iz).

Source

pub fn get(&self, ix: usize, iy: usize, iz: usize) -> f64

Get the level-set value at grid node (ix, iy, iz).

Returns f64::MAX for out-of-bounds nodes.

Source

pub fn set(&mut self, ix: usize, iy: usize, iz: usize, value: f64)

Set the level-set value at grid node (ix, iy, iz).

Silently ignores out-of-bounds writes.

Source

pub fn interpolate(&self, p: [f64; 3]) -> f64

Tri-linear interpolation of the level-set field at world position p.

Returns f64::MAX for positions outside the grid.

Source

pub fn gradient(&self, ix: usize, iy: usize, iz: usize) -> [f64; 3]

Numerical gradient of the level-set field at grid node (ix, iy, iz).

Uses central differences where possible, one-sided differences at boundaries.

Source

pub fn mean_curvature(&self, ix: usize, iy: usize, iz: usize) -> f64

Mean curvature κ = div(∇φ / |∇φ|) at grid node (ix, iy, iz).

Computed via second-order finite differences.

Source

pub fn init_sphere(&mut self, center: [f64; 3], radius: f64)

Initialize the level-set as a sphere SDF.

Sets φ(x) = |x − center| − radius for all nodes.

Source

pub fn init_box(&mut self, lo: [f64; 3], hi: [f64; 3])

Initialize the level-set as an axis-aligned box SDF.

Sets φ(x) to the signed distance to the box [lo, hi].

Source

pub fn count_inside(&self) -> usize

Count nodes with φ ≤ 0 (inside or on the interface).

Source

pub fn min_value(&self) -> f64

Minimum value of φ over all nodes.

Source

pub fn max_value(&self) -> f64

Maximum value of φ over all nodes.

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.