Skip to main content

EdgeCollapseSimplifier

threecrate_simplification::edge_collapse

Struct EdgeCollapseSimplifier 

Source 
pub struct EdgeCollapseSimplifier {
    pub error_threshold: Option<f64>,
    pub preserve_boundary: bool,
    pub boundary_weight: f64,
}
Expand description

Edge collapse mesh simplifier using half-edge data structure and QEM.

This simplifier builds a half-edge mesh for efficient local topology queries (neighbor iteration, boundary detection, link condition checks) and uses quadric error metrics to prioritize edge collapses.

Fields§

§error_threshold: Option<f64>

Stop when the minimum collapse cost exceeds this threshold

§preserve_boundary: bool

Preserve mesh boundary edges

§boundary_weight: f64

Extra penalty weight applied to boundary edge costs

Implementations§

Source§

impl EdgeCollapseSimplifier

Source

pub fn new() -> Self

Source

pub fn with_params( error_threshold: Option<f64>, preserve_boundary: bool, boundary_weight: f64, ) -> Self

Trait Implementations§

Source§

impl Default for EdgeCollapseSimplifier

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl MeshSimplifier for EdgeCollapseSimplifier

Source§

fn simplify( &self, mesh: &TriangleMesh, reduction_ratio: f32, ) -> Result<TriangleMesh>

Simplify mesh with target reduction ratio (0.0 = no reduction, 1.0 = maximum reduction)

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.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V