Crate u_nesting 

U-Nesting

Domain-agnostic 2D/3D spatial optimization engine.

This crate provides algorithms for:

• 2D Nesting: Polygon placement optimization (cutting, packing)
• 3D Bin Packing: Box placement in containers

Quick Start

use u_nesting::d2::{Nester2D, Geometry2D, Boundary2D};
use u_nesting::core::{Solver, Config, Strategy};

// Create geometries and boundary
let boundary = Boundary2D::new(1000.0, 500.0);
let geometries = vec![/* your polygons */];

// Solve
let mut nester = Nester2D::new(boundary, geometries);
let result = nester.solve(&Config::default())?;

Feature Flags

• d2 (default): 2D nesting algorithms
• d3 (default): 3D bin packing algorithms
• serde: Serialization support

Re-exports

pub use u_nesting_core as core;

pub use u_nesting_d2 as d2;

pub use u_nesting_d3 as d3;

Structs

Config

Common configuration for solvers.

Placement

Represents the placement of a geometry within a boundary.

SolveResult

Result of a nesting or packing solve operation.

Enums

Strategy

Optimization strategy.

Traits

Solver

Trait for nesting/packing solvers.