ajandClaude Opus 5.5 b1a03c1796 feat(engine): solve rectangular cutouts as a knapsack of boxes ...

Search insert selections as boxes with a counted beam search over maximal
free rectangles, pair low-density parts with their half turn, then gap-fill
with the frontier packer. The router takes it on seated outline area.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>

2026-11-01 23:42:26 -05:00

..

AreaPacker.cs

style: use one spelling across the codebase

2026-10-30 16:11:30 -04:00

Bin.cs

refactor(engine): align namespaces with directory layout under OpenNest.Engine

2026-09-21 13:18:34 -04:00

BinConverter.cs

feat(fill): pack leftover parts with maximal rectangles

2026-09-30 22:19:25 -04:00

FillBestFit.cs

refactor(engine): align namespaces with directory layout under OpenNest.Engine

2026-09-21 13:18:34 -04:00

FillEngine.cs

refactor(engine): align namespaces with directory layout under OpenNest.Engine

2026-09-21 13:18:34 -04:00

FillSpiral.cs

feat(fill): search every spiral combination in rectangle best fit

2026-11-01 23:42:25 -05:00

Item.cs

refactor(engine): align namespaces with directory layout under OpenNest.Engine

2026-09-21 13:18:34 -04:00

MaxRectsPacker.cs

refactor(packing): share the maximal-rectangles packing loop

2026-09-30 22:11:12 -04:00

MaxRectsSheet.cs

feat(engine): solve rectangular cutouts as a knapsack of boxes

2026-11-01 23:42:26 -05:00

RectFill.cs

feat(fill): search every spiral combination in rectangle best fit

2026-11-01 23:42:25 -05:00