Nesting

By

BeeGraphy

Version 1.4.0

Nesting

Version history

Groups: 2
Nodes: 0
Groups: 2
Nodes: 0
Groups: 2
Nodes: 8
Groups: 2
Nodes: 3
Groups: 1
Nodes: 2
Groups: 1
Nodes: 2
Groups: 1
Nodes: 2
Groups: 1
Nodes: 2
Groups: 1
Nodes: 2
Groups: 1
Nodes: 2
Groups: 1
Nodes: 2
Groups: 1
Nodes: 2
Groups: 1
Nodes: 2

Nesting for the BeeGraphy Editor.

What's New in v1.3.1

Released on June 5, 2026

This release includes 0 nodes and 2 groups, providing expanded capabilities for your workflows.

What's New

  • Expanded node library with 0 available nodes
  • Organized into 2 functional groups
  • Enhanced plugin capabilities and workflow options

Changes in This Version

  • Update this section with specific features, fixes, or improvements
  • List breaking changes if any
  • Mention deprecated features or migration notes

Release notes generated on June 5, 2026. Edit this content to add version-specific details.

Documentation

Rectangular Nesting

Nesting by naive guillotine best fit algorithm

Nesting by naive guillotine best fit genetic algorithm

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.

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).

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.

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.

3-stage guillotine nesting: sheet is cut into horizontal strips, strips into vertical stacks, stacks into parts. Optimized for format-cutting machines.

True Shape Nesting

True-shape polygon nesting using genetic algorithm with bitmap collision detection. Supports hole filling and multi-angle rotation.