2 Commits

Author	SHA1	Message	Date
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
AJ Isaacs	5f4288a786	feat: add NfpSlideStrategy for NFP-based best-fit candidate generation ... Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>	2026-03-20 20:03:52 -04:00