Files
OpenNest/OpenNest.Tests
AJ Isaacs bc78ddc49c perf: use convex hull NFP to avoid Clipper2 union bottleneck
ConvexMinkowskiSum is O(n+m) with no boolean geometry ops.
The concave Minkowski path was doing triangulation + pairwise
sums + Clipper2 Union, which hung at 100% CPU for complex parts.

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
2026-03-20 20:54:19 -04:00
..
2026-03-18 16:47:42 -04:00
2026-03-18 16:47:42 -04:00
2026-03-20 00:32:45 -04:00
2026-03-18 16:47:42 -04:00