using OpenNest.Engine.BestFit; using OpenNest.Engine.Strategies; using OpenNest.Geometry; using OpenNest.Math; using System; using System.Collections.Generic; using System.Diagnostics; using System.Linq; using System.Threading; using OpenNest.Engine; namespace OpenNest.Engine.Fill { public class PairFillResult { public List Parts { get; set; } = new List(); public List BestFits { get; set; } } /// /// Fills a work area using interlocking part pairs from BestFitCache. /// public class PairFiller { private const int MaxTopCandidates = 50; private const int MaxStripCandidates = 100; private const double MinStripUtilization = 0.3; private const int EarlyExitMinTried = 10; private const int EarlyExitStaleLimit = 10; private readonly Plate plate; private readonly Size plateSize; private readonly double partSpacing; private readonly IFillComparer comparer; public PairFiller(Plate plate, IFillComparer comparer = null) { this.plate = plate; this.plateSize = plate.Size; this.partSpacing = plate.PartSpacing; this.comparer = comparer ?? new DefaultFillComparer(); } public PairFillResult Fill(NestItem item, Box workArea, int plateNumber = 0, CancellationToken token = default, IProgress progress = null) { var bestFits = BestFitCache.GetOrCompute( item.Drawing, plateSize.Length, plateSize.Width, partSpacing); var candidates = SelectPairCandidates(bestFits, workArea); Debug.WriteLine($"[PairFiller] Total: {bestFits.Count}, Kept: {bestFits.Count(r => r.Keep)}, Trying: {candidates.Count}"); Debug.WriteLine($"[PairFiller] Plate: {plateSize.Length:F2}x{plateSize.Width:F2}, WorkArea: {workArea.Width:F2}x{workArea.Length:F2}"); var targetCount = item.Quantity > 0 ? item.Quantity : 0; var parts = EvaluateCandidates(candidates, item.Drawing, workArea, targetCount, plateNumber, token, progress); return new PairFillResult { Parts = parts, BestFits = bestFits }; } private List EvaluateCandidates( List candidates, Drawing drawing, Box workArea, int targetCount, int plateNumber, CancellationToken token, IProgress progress) { List best = null; var sinceImproved = 0; var effectiveWorkArea = workArea; try { for (var i = 0; i < candidates.Count; i++) { token.ThrowIfCancellationRequested(); var filled = EvaluateCandidate(candidates[i], drawing, effectiveWorkArea, token); if (comparer.IsBetter(filled, best, effectiveWorkArea)) { best = filled; sinceImproved = 0; effectiveWorkArea = TryReduceWorkArea(filled, targetCount, workArea, effectiveWorkArea); } else { sinceImproved++; } NestEngineBase.ReportProgress(progress, new ProgressReport { Phase = NestPhase.Pairs, PlateNumber = plateNumber, Parts = best, WorkArea = workArea, Description = $"Pairs: {i + 1}/{candidates.Count} candidates, best = {best?.Count ?? 0} parts", }); if (i + 1 >= EarlyExitMinTried && sinceImproved >= EarlyExitStaleLimit) { Debug.WriteLine($"[PairFiller] Early exit at {i + 1}/{candidates.Count} — no improvement in last {sinceImproved} candidates"); break; } } } catch (OperationCanceledException) { Debug.WriteLine("[PairFiller] Cancelled mid-phase, using results so far"); } Debug.WriteLine($"[PairFiller] Best pair result: {best?.Count ?? 0} parts"); return best ?? new List(); } private static Box TryReduceWorkArea(List parts, int targetCount, Box workArea, Box effectiveWorkArea) { if (targetCount <= 0 || parts.Count <= targetCount) return effectiveWorkArea; var reduced = ReduceWorkArea(parts, targetCount, workArea); if (reduced.Area() >= effectiveWorkArea.Area()) return effectiveWorkArea; Debug.WriteLine($"[PairFiller] Reduced work area to {reduced.Width:F2}x{reduced.Length:F2} (trimmed to {targetCount + 1} parts)"); return reduced; } /// /// Given parts that exceed targetCount, sorts by BoundingBox.Top descending, /// removes parts from the top until exactly targetCount remain, then returns /// the Top of the remaining parts as the new work area height to beat. /// private static Box ReduceWorkArea(List parts, int targetCount, Box workArea) { if (parts.Count <= targetCount) return workArea; var sorted = parts .OrderByDescending(p => p.BoundingBox.Top) .ToList(); var trimCount = sorted.Count - targetCount; var remaining = sorted.Skip(trimCount).ToList(); var newTop = remaining.Max(p => p.BoundingBox.Top); return new Box(workArea.X, workArea.Y, workArea.Width, System.Math.Min(newTop - workArea.Y, workArea.Length)); } private List EvaluateCandidate(BestFitResult candidate, Drawing drawing, Box workArea, CancellationToken token) { var pairParts = candidate.BuildParts(drawing); var angles = BuildTilingAngles(candidate); // Phase 1: evaluate all grids (fast) var grids = new List<(List Parts, NestDirection Dir)>(); foreach (var angle in angles) { token.ThrowIfCancellationRequested(); var pattern = FillHelpers.BuildRotatedPattern(pairParts, angle); if (pattern.Parts.Count == 0) continue; var engine = new FillLinear(workArea, partSpacing); foreach (var dir in new[] { NestDirection.Horizontal, NestDirection.Vertical }) { var gridParts = engine.Fill(pattern, dir); if (gridParts != null && gridParts.Count > 0) grids.Add((gridParts, dir)); } } if (grids.Count == 0) return null; // Sort by count descending so we try the best grids first grids.Sort((a, b) => b.Parts.Count.CompareTo(a.Parts.Count)); // Phase 2: try remnant for each grid, skip if grid is too far behind List best = null; var maxRemnantEstimate = EstimateMaxRemnantParts(drawing, workArea); foreach (var (gridParts, dir) in grids) { token.ThrowIfCancellationRequested(); // If this grid + max possible remnant can't beat current best, skip if (best != null && gridParts.Count + maxRemnantEstimate <= best.Count) break; // sorted descending, so remaining are even smaller var remnantParts = FillRemnant(gridParts, drawing, workArea, token); List total; if (remnantParts != null && remnantParts.Count > 0) { total = new List(gridParts.Count + remnantParts.Count); total.AddRange(gridParts); total.AddRange(remnantParts); } else { total = gridParts; } if (comparer.IsBetter(total, best, workArea)) best = total; } return best; } private static int EstimateMaxRemnantParts(Drawing drawing, Box workArea) { var partBox = drawing.Program.BoundingBox(); var partArea = System.Math.Max(partBox.Width * partBox.Length, 1); var remnantArea = workArea.Area() * 0.3; // remnant is at most ~30% of work area return (int)(remnantArea / partArea) + 1; } private List FillRemnant(List gridParts, Drawing drawing, Box workArea, CancellationToken token) { var gridBox = ((IEnumerable)gridParts).GetBoundingBox(); var partBox = drawing.Program.BoundingBox(); var minDim = System.Math.Min(partBox.Width, partBox.Length) + 2 * partSpacing; List bestRemnant = null; // Try top remnant (full width, above grid) var topY = gridBox.Top + partSpacing; var topLength = workArea.Top - topY; if (topLength >= minDim) { var topBox = new Box(workArea.X, topY, workArea.Width, topLength); var parts = FillRemnantBox(drawing, topBox, token); if (parts != null && parts.Count > (bestRemnant?.Count ?? 0)) bestRemnant = parts; } // Try right remnant (full height, right of grid) var rightX = gridBox.Right + partSpacing; var rightWidth = workArea.Right - rightX; if (rightWidth >= minDim) { var rightBox = new Box(rightX, workArea.Y, rightWidth, workArea.Length); var parts = FillRemnantBox(drawing, rightBox, token); if (parts != null && parts.Count > (bestRemnant?.Count ?? 0)) bestRemnant = parts; } return bestRemnant; } private List FillRemnantBox(Drawing drawing, Box remnantBox, CancellationToken token) { var cachedResult = FillResultCache.Get(drawing, remnantBox, partSpacing); if (cachedResult != null) { Debug.WriteLine($"[PairFiller] Remnant CACHE HIT: {cachedResult.Count} parts"); return cachedResult; } FillStrategyRegistry.SetEnabled("Pairs", "RectBestFit", "Extents", "Linear"); try { var remnantEngine = NestEngineRegistry.Create(plate); var item = new NestItem { Drawing = drawing }; var parts = remnantEngine.Fill(item, remnantBox, null, token); Debug.WriteLine($"[PairFiller] Remnant: {parts?.Count ?? 0} parts in " + $"{remnantBox.Width:F2}x{remnantBox.Length:F2}"); if (parts != null && parts.Count > 0) { FillResultCache.Store(drawing, remnantBox, partSpacing, parts); return parts; } return null; } finally { FillStrategyRegistry.SetEnabled(null); } } private static List BuildTilingAngles(BestFitResult candidate) { var angles = new List(candidate.HullAngles); var optAngle = -candidate.OptimalRotation; if (!angles.Any(a => a.IsEqualTo(optAngle))) angles.Add(optAngle); var optAngle90 = Angle.NormalizeRad(optAngle + Angle.HalfPI); if (!angles.Any(a => a.IsEqualTo(optAngle90))) angles.Add(optAngle90); return angles; } private List SelectPairCandidates(List bestFits, Box workArea) { var kept = bestFits.Where(r => r.Keep).ToList(); var workShortSide = System.Math.Min(workArea.Width, workArea.Length); var plateShortSide = System.Math.Min(plateSize.Width, plateSize.Length); if (workShortSide < plateShortSide * 0.5) { // Strip mode: prioritize candidates that fit the narrow dimension. var stripCandidates = kept .Where(r => r.ShortestSide <= workShortSide + Tolerance.Epsilon && r.Utilization >= MinStripUtilization) .ToList(); SortByEstimatedCount(stripCandidates, workArea); var top = stripCandidates.Take(MaxStripCandidates).ToList(); Debug.WriteLine($"[PairFiller] Strip mode: {top.Count} candidates (shortSide <= {workShortSide:F1})"); return top; } var result = kept.Take(MaxTopCandidates).ToList(); SortByEstimatedCount(result, workArea); return result; } private void SortByEstimatedCount(List candidates, Box workArea) { var w = workArea.Width; var l = workArea.Length; candidates.Sort((a, b) => { var aCount = EstimateTileCount(a, w, l); var bCount = EstimateTileCount(b, w, l); if (aCount != bCount) return bCount.CompareTo(aCount); return b.Utilization.CompareTo(a.Utilization); }); } private int EstimateTileCount(BestFitResult r, double areaW, double areaL) { var h = EstimateCount(r.BoundingWidth, r.BoundingHeight, areaW, areaL); var v = EstimateCount(r.BoundingHeight, r.BoundingWidth, areaW, areaL); return System.Math.Max(h, v); } private int EstimateCount(double pairW, double pairH, double areaW, double areaL) { if (pairW <= 0 || pairH <= 0) return 0; var cols = (int)((areaW + partSpacing) / (pairW + partSpacing)); var rows = (int)((areaL + partSpacing) / (pairH + partSpacing)); return cols * rows * 2; } } }