Nesting for the BeeGraphy Editor.
Nesting brings 2D sheet packing and cutting-layout nodes to the BeeGraphy Editor. Use it to place flat parts onto a sheet or container with minimal waste, whether you need fast rectangular heuristics, genetic optimisation, or true-shape nesting for curved and irregular outlines. The package also includes an overlay node for combining nested results with other geometry in a parametric graph.
Nodes in this group place rectangles into a rectangular sheet using different strategies.
Nesting Guillotine Best Fit Naive – rapid guillotine best-fit placement for simple layouts.Genetic Nesting Guillotine Best Fit Naive – genetic algorithm variant of the guillotine best-fit placement, usually producing denser results.Nesting Row Naive – places items sequentially in horizontal rows; each new part is placed next to the previous one until the row is full, then a new row starts below.Nesting MaxRects Best Fit – tracks the largest free rectangles and places each part where it leaves minimal leftover space.Nesting BLF Naive – bottom-left-fill greedy placement: each part goes to the lowest possible position, then the leftmost available space.Nesting CBLF Naive – corner-bottom-left-fill placement, selecting the lowest possible position and leftmost available corner.Nesting Guillotine 3-Stage – cuts the sheet into horizontal strips, then vertical stacks, then parts; optimized for format-cutting machines.These nodes handle non-rectangular, curved, concave, and holed shapes.
Nesting Polygon Genetic – true-shape polygon nesting with a genetic algorithm and bitmap collision detection. Supports hole filling and multi-angle rotation.Nesting Bitmap Polygon – true-shape nesting via bitmap pixel-mask collision. Handles curved, concave, and holed shapes natively. Supports fast BLF and dense GA packing, per-part rotation, kerf-aware spacing, a hex pre-pass for circle inputs, and QLM post-pass compaction.Overlay Nested Geometry – overlays one geometry onto another: applies Translation if given, rotates it about the base geometry’s bbox center if Rotation is given, then applies Offset if given, rotated to match. The base geometry meta is copied onto the result. Wire arrays into the ports and use the node’s List Matching options (Shortest List / Longest List / Cross Reference) to control how items pair up.Connect a container rectangle and a list of part rectangles to Nesting Row Naive for a fast row-based layout. If the result is too loose, swap the node for Nesting MaxRects Best Fit to use free-rectangle tracking and reduce wasted space.
Feed flat part outlines—including curved or holed shapes—into Nesting Bitmap Polygon. Use BLF for a fast preview, then switch to GA for a denser packing. Enable kerf-aware spacing when cutting with a tool that removes material. Overlay the nested result onto the sheet with Overlay Nested Geometry, adding translation, rotation, or offset as needed.
For format-cutting machines, route rectangular parts through Nesting Guillotine 3-Stage to generate a layout made of horizontal strips and vertical stacks. For a more optimised placement, replace the naive guillotine path with Genetic Nesting Guillotine Best Fit Naive and compare sheet utilisation.
7
Nesting Guillotine Best Fit Naive
Nesting by naive guillotine best fit algorithm
Genetic Nesting Guillotine Best Fit Naive
Nesting by naive guillotine best fit genetic algorithm
Nesting Row Naive
NestingRowNaive is a simple row-based nesting algorithm used in 2D bin packing / cutting optimization. It places items sequentially in horizontal rows inside a container (sheet/material). Each new item is placed next to the previous one in the current row until the row width is filled; then a new row is started below.
Nesting MaxRects Best Fit
NestingMaxRectsBestFit is a rectangle nesting algorithm used to place multiple rectangular shapes into a larger container while minimizing wasted space. It works by tracking the largest available free rectangles in the container and placing each new item in the position where it best fits according to a chosen heuristic (usually minimal leftover space).
Nesting BLF Naive
NestingBLFNaive (Bottom-Left-Fill Naive) is a simple rectangle nesting algorithm that places items sequentially into a container by always positioning each new piece in the lowest possible position and then the leftmost available space. It does not perform complex optimization or backtracking; instead, it follows a straightforward greedy placement strategy.
Nesting CBLF Naive
NestingCBLFNaive (Corner-Bottom-Left-Fill Naive) is a simple 2D nesting / bin-packing heuristic that places shapes or rectangles into a container by always selecting the lowest possible position and then the leftmost available corner. It follows a bottom-left placement strategy without complex optimization or backtracking.
Nesting Guillotine 3-Stage
3-stage guillotine nesting: sheet is cut into horizontal strips, strips into vertical stacks, stacks into parts. Optimized for format-cutting machines.
2
Nesting Polygon Genetic
True-shape polygon nesting using genetic algorithm with bitmap collision detection. Supports hole filling and multi-angle rotation.
Nesting Bitmap Polygon
True-shape nesting via bitmap pixel-mask collision. Handles curved, concave, and holed shapes natively. Supports BLF (fast) and GA (dense) packing, per-part rotation, kerf-aware spacing, hex pre-pass for circle inputs, and QLM post-pass compaction.
1