Enum Algorithm 

pub enum Algorithm {
    Poisson,
    BallPivoting,
    Delaunay,
    MovingLeastSquares,
    MarchingCubes,
}

Reconstruction algorithm types available in the pipeline

Variants

Poisson

Poisson surface reconstruction (requires normals)

BallPivoting

Ball Pivoting algorithm (good for uniform sampling)

Delaunay

Delaunay triangulation (fast, works with any point distribution)

MovingLeastSquares

Moving Least Squares (smooth surfaces, handles noise well)

MarchingCubes

Marching Cubes (volumetric approach, good for closed surfaces)

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Algorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for Algorithm

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Algorithm

fn eq(&self, other: &Algorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for Algorithm

impl Eq for Algorithm

impl StructuralPartialEq for Algorithm