aj 1c6d02c480 perf(cutting): try a bounded entry catalogue before full search

2026-10-09 21:26:40 -04:00

..

BestEffortCuttingPlan.cs

feat(cutting): offer unverified best-effort plans for imperfect geometry

2026-10-06 14:44:53 -04:00

ContourEntryFeasibility.cs

fix(cutting): validate choice ownership before cached verdicts

2026-10-07 15:53:28 -04:00

ContourEntrySelection.cs

fix(cutting): reuse clear candidates across side coverage scans

2026-10-07 16:05:25 -04:00

CuttingDependencyGraph.cs

feat(cutting): offer unverified best-effort plans for imperfect geometry

2026-10-06 14:44:53 -04:00

CuttingHoleOrder.cs

feat(cutting): propose hole paths toward the perimeter entry

2026-10-07 11:43:26 -04:00

CuttingPartOrder.cs

feat(cutting): propose hole paths toward the perimeter entry

2026-10-07 11:43:26 -04:00

CuttingPlanBatch.cs

perf(cutting): try a bounded entry catalogue before full search

2026-10-09 21:26:40 -04:00

CuttingPlanModels.cs

perf(cutting): try a bounded entry catalogue before full search

2026-10-09 21:26:40 -04:00

CuttingPlanService.cs

feat(cutting): offer unverified best-effort plans for imperfect geometry

2026-10-06 14:44:53 -04:00

FixedProgramSearch.cs

feat(cutting): order cutoffs and nested parts before their hosts

2026-10-05 00:01:29 -04:00

JointCuttingPlanSearch.cs

perf(cutting): generate ranked alternatives only when visited

2026-10-09 20:40:10 -04:00

PreferredContourEntries.cs

fix(cutting): exclude scribes from downstream pierce targets

2026-10-07 14:46:30 -04:00