Enum NfpMethod 

pub enum NfpMethod {
    MinkowskiSum,
    Sliding,
}

Method for computing No-Fit Polygons.

Variants

MinkowskiSum

Minkowski sum algorithm.

• Convex polygons: O(n+m) time complexity
• Non-convex polygons: Uses convex decomposition + union
• Best for: Simple shapes, fast computation

Sliding

Sliding/orbiting algorithm (Burke et al. 2007).

• Traces the NFP boundary by sliding one polygon around another
• More robust for complex interlocking shapes
• Better handles edge cases like perfect fits
• Best for: Complex non-convex shapes, high accuracy requirements

Trait Implementations

impl Clone for NfpMethod

fn clone(&self) -> NfpMethod

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NfpMethod

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

Formats the value using the given formatter.

impl Default for NfpMethod

fn default() -> NfpMethod

Returns the “default value” for a type.

impl PartialEq for NfpMethod

fn eq(&self, other: &NfpMethod) -> 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 NfpMethod

impl Eq for NfpMethod

impl StructuralPartialEq for NfpMethod