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

origin

List of geometries to be nested (curves or surfaces)

geometries

sheetWidth

sheetHeight

Spacing between sheets when laying them out

sheetsGap

Distance from the edges of the sheet to the nested parts

edgeClearance

spacing

seed

Number of rotation increments to test (4 = 0/90/180/270, higher = finer angles)

rotationSteps

Precision for discretizing curves to polylines (mm)

curveTolerance

Nesting Polygon Genetic

Sheet boundary curves. Rectangular outlines for each sheet used.

sheets

Nested geometries transformed to their final positions on sheets.

Translation vectors for each input geometry. Unplaced geometries have zero vectors.

moveVectors

Rotation angles in radians for each input geometry. Unplaced geometries have zero rotation.

rotationAngles

Sheet index for each input geometry. Unplaced geometries have value -1.

sheetIds

Original input geometry indices for each nested geometry.

geometryIds

<p><strong>Nesting for the BeeGraphy Editor.</strong></p>

Rectangular Nesting

True Shape Nesting

nesting-dark.png

nesting-light.png

Nesting

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

Distance from the edges of the sheet to the curves/surfaces to be nested

Nesting MaxRects Best Fit

Sheet boundary curves. Flat array of rectangular curves representing each sheet used in the nesting.

Nested geometries in their final positions. Flat array of all geometries in the order they appear across all sheets.

Translation vectors for each input geometry. Array aligned with input geometries showing movement from original position. Unplaced geometries have zero vectors.

Rotation angles in radians for each input geometry. Array aligned with input geometries showing rotation applied. Unplaced geometries have zero rotation.

Sheet index for each input geometry. Array aligned with input geometries showing which sheet each geometry is placed on. Unplaced geometries have value -1.

Original input geometry indices. Flat array showing which input geometry corresponds to each nested geometry.

Nesting by naive guillotine best fit algorithm

distance from the edges of the sheet to the curves/surfaces to be nested

Nesting Guillotine Best Fit Naive

Nesting by naive guillotine best fit genetic algorithm

Required to get always the same output with the same input

The minimum allowable size for nested pieces to be considered usable

minUsableSize

Genetic Nesting Guillotine Best Fit 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 Row 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 BLF 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.

Number of different orderings to try (more = slower but potentially better packing)

numCursors

Random seed for reproducible results when numCursors > 5

Nesting CBLF Naive

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

Spacing between sheets in the output layout

Gap between parts (kerf / blade thickness)

Allow 90-degree rotation of parts for better fit

allowRotation

Number of sorting heuristics to try (higher = slower but potentially denser)

Nesting Guillotine 3-Stage

Sheet index per geometry (-1 if unplaced).

Original input indices of placed geometries.

Name	Type	Description	Default Value
Origin	Vector	Origin point for sheet placement	[0,0,0]
Geometries	Geometry	List of geometries to be nested (curves or surfaces)
Sheet Width	Number	Width of the sheet used for nesting	500
Sheet Height	Number	Height of the sheet used for nesting	500
SheetsGap	Number	Spacing between sheets when laying them out	10
Edge Clearance	Number	Distance from the edges of the sheet to the nested parts	0
Spacing	Number	Minimum clearance between parts	0
Seed	Number	Random seed for reproducible results	123456
Rotation Steps	Number	Number of rotation increments to test (4 = 0/90/180/270, higher = finer angles)	4
Curve Tolerance	Number	Precision for discretizing curves to polylines (mm)	0.1

Name	Type	Description
Sheets	Curve	Sheet boundary curves. Rectangular outlines for each sheet used.
Geometries	Geometry	Nested geometries transformed to their final positions on sheets.
Move Vectors	Vector	Translation vectors for each input geometry. Unplaced geometries have zero vectors.
Rotation Angles	Number	Rotation angles in radians for each input geometry. Unplaced geometries have zero rotation.
Sheet IDs	Number	Sheet index for each input geometry. Unplaced geometries have value -1.
Geo IDs	Number	Original input geometry indices for each nested geometry.