Part.Intersects has been silently non-functional everywhere it's used. Shape.ToPolygon()/ToPolygonWithTolerance() never called UpdateBounds(), so every freshly-built polygon kept Entity's constructor-default zero-size bounding box regardless of its actual vertices. Collision.Check's first step is a bounding-box pre-filter, and a zero-size box can never overlap anything, so it always short-circuited to "no overlap" no matter what the real geometry looked like. That masked a second bug: Part.Intersects built its polygons via the unconditional 1000-segments-per-arc ToPolygon() default instead of an adaptive tolerance. For parts with several small fillets/holes this produced tens of thousands of vertices, making the now-correct bbox check fall through into a triangulation/clip step too slow to return in practice. Switched to ToPolygonWithTolerance at a named tolerance matching PartGeometry's existing convention. PairEvaluator's own Keep/overlap check had a third, independent bug: it used Shape.Intersects (edge-crossing detection only) at a coarse 0.01 chord tolerance, which misses containment-style overlaps and can polygonize rounded corners coarsely enough to hide a genuine sliver overlap. Switched to Collision.HasOverlap (full polygon clip, handles containment) at a tighter dedicated tolerance. Verified against a real nest file: PairFiller was tiling a BestFit pair that PairEvaluator had incorrectly marked Keep=true, producing visibly overlapping parts on the plate that no downstream overlap check ever caught. Known follow-up: OpenNest.Tests.BestFit.BestFitOverlapTests.KeptPairs_NoOverlap still fails on 3/1082 synthetic candidates that overlap by a sub-0.001 sliver right at a rounded-corner tangent point — a separate, much smaller precision edge case in PairEvaluator's raw (pre-transform) coordinate frame, not a regression from this change.
176 lines
6.4 KiB
C#
176 lines
6.4 KiB
C#
using System.Collections.Concurrent;
|
|
using System.Collections.Generic;
|
|
using System.Linq;
|
|
using System.Threading.Tasks;
|
|
using OpenNest.Converters;
|
|
using OpenNest.Engine.Fill;
|
|
using OpenNest.Geometry;
|
|
using OpenNest.Math;
|
|
|
|
namespace OpenNest.Engine.BestFit
|
|
{
|
|
public class PairEvaluator : IPairEvaluator
|
|
{
|
|
private const double ChordTolerance = 0.01;
|
|
|
|
/// <summary>
|
|
/// Tighter chord tolerance for the overlap check only. Rounded-corner arcs
|
|
/// polygonized at the coarser <see cref="ChordTolerance"/> can "cut the corner"
|
|
/// enough to hide a genuine but tiny sliver overlap between two candidates —
|
|
/// this needs to match the precision Part.Intersects uses elsewhere so BestFit's
|
|
/// Keep decision agrees with the same overlap check callers rely on downstream.
|
|
/// </summary>
|
|
private const double OverlapChordTolerance = 0.001;
|
|
|
|
public List<BestFitResult> EvaluateAll(List<PairCandidate> candidates)
|
|
{
|
|
if (candidates.Count == 0)
|
|
return new List<BestFitResult>();
|
|
|
|
// Build a perimeter-only drawing once — all candidates share the same drawing.
|
|
// This avoids cloning the full program (with all cutouts) for every candidate.
|
|
var perimeterDrawing = CreatePerimeterDrawing(candidates[0].Drawing);
|
|
|
|
var resultBag = new ConcurrentBag<BestFitResult>();
|
|
|
|
Parallel.ForEach(
|
|
candidates,
|
|
c =>
|
|
{
|
|
resultBag.Add(Evaluate(c, perimeterDrawing));
|
|
}
|
|
);
|
|
|
|
return resultBag.ToList();
|
|
}
|
|
|
|
public BestFitResult Evaluate(PairCandidate candidate)
|
|
{
|
|
var perimeterDrawing = CreatePerimeterDrawing(candidate.Drawing);
|
|
return Evaluate(candidate, perimeterDrawing);
|
|
}
|
|
|
|
private BestFitResult Evaluate(PairCandidate candidate, Drawing perimeterDrawing)
|
|
{
|
|
var part1 = Part.CreateAtOrigin(perimeterDrawing);
|
|
|
|
var part2 = Part.CreateAtOrigin(perimeterDrawing, candidate.Part2Rotation);
|
|
part2.Location = candidate.Part2Offset;
|
|
part2.UpdateBounds();
|
|
|
|
// Overlap check — perimeter vs perimeter. Uses Collision.HasOverlap (full polygon
|
|
// clip) rather than Shape.Intersects (edge-crossing only), which misses containment-
|
|
// style overlaps where one perimeter's boundary never crosses the other's.
|
|
var shape1 = GetPerimeterShape(part1);
|
|
var shape2 = GetPerimeterShape(part2);
|
|
var overlaps =
|
|
shape1 != null
|
|
&& shape2 != null
|
|
&& Collision.HasOverlap(
|
|
shape1.ToPolygonWithTolerance(OverlapChordTolerance),
|
|
shape2.ToPolygonWithTolerance(OverlapChordTolerance)
|
|
);
|
|
|
|
// Convex hull vertices from perimeter polygons only
|
|
var allPoints = GetPartVertices(part1);
|
|
allPoints.AddRange(GetPartVertices(part2));
|
|
|
|
// Find optimal bounding rectangle via rotating calipers
|
|
double bestArea,
|
|
bestWidth,
|
|
bestHeight,
|
|
bestRotation;
|
|
List<double> hullAngles = null;
|
|
|
|
if (allPoints.Count >= 3)
|
|
{
|
|
var hull = ConvexHull.Compute(allPoints);
|
|
var result = RotatingCalipers.MinimumBoundingRectangle(hull);
|
|
bestArea = result.Area;
|
|
bestWidth = result.Width;
|
|
bestHeight = result.Height;
|
|
bestRotation = result.Angle;
|
|
hullAngles = RotationAnalysis.GetHullEdgeAngles(hull);
|
|
}
|
|
else
|
|
{
|
|
var combinedBox = (
|
|
(IEnumerable<IBoundable>)new IBoundable[] { part1, part2 }
|
|
).GetBoundingBox();
|
|
bestArea = combinedBox.Area();
|
|
bestWidth = combinedBox.Width;
|
|
bestHeight = combinedBox.Length;
|
|
bestRotation = 0;
|
|
hullAngles = new List<double> { 0 };
|
|
}
|
|
|
|
var trueArea = candidate.Drawing.Area * 2;
|
|
|
|
// Normalize to landscape (width >= height) for consistent display.
|
|
if (bestHeight > bestWidth)
|
|
{
|
|
var tmp = bestWidth;
|
|
bestWidth = bestHeight;
|
|
bestHeight = tmp;
|
|
bestRotation += Angle.HalfPI;
|
|
}
|
|
|
|
return new BestFitResult
|
|
{
|
|
Candidate = candidate,
|
|
RotatedArea = bestArea,
|
|
BoundingWidth = bestWidth,
|
|
BoundingHeight = bestHeight,
|
|
OptimalRotation = bestRotation,
|
|
TrueArea = trueArea,
|
|
HullAngles = hullAngles,
|
|
Keep = !overlaps,
|
|
Reason = overlaps ? "Overlap detected" : "Valid",
|
|
};
|
|
}
|
|
|
|
private static Drawing CreatePerimeterDrawing(Drawing source)
|
|
{
|
|
var entities = ConvertProgram
|
|
.ToGeometry(source.Program)
|
|
.Where(e => e.Layer != SpecialLayers.Rapid)
|
|
.ToList();
|
|
var profile = new ShapeProfile(entities);
|
|
var program = ConvertGeometry.ToProgram(profile.Perimeter);
|
|
return new Drawing(source.Name, program);
|
|
}
|
|
|
|
private static Shape GetPerimeterShape(Part part)
|
|
{
|
|
var entities = ConvertProgram
|
|
.ToGeometry(part.Program)
|
|
.Where(e => e.Layer != SpecialLayers.Rapid)
|
|
.ToList();
|
|
var shapes = ShapeBuilder.GetShapes(entities);
|
|
if (shapes.Count == 0)
|
|
return null;
|
|
shapes[0].Offset(part.Location);
|
|
return shapes[0];
|
|
}
|
|
|
|
private static List<Vector> GetPartVertices(Part part)
|
|
{
|
|
var entities = ConvertProgram
|
|
.ToGeometry(part.Program)
|
|
.Where(e => e.Layer != SpecialLayers.Rapid)
|
|
.ToList();
|
|
var shapes = ShapeBuilder.GetShapes(entities);
|
|
var points = new List<Vector>();
|
|
|
|
foreach (var shape in shapes)
|
|
{
|
|
var polygon = shape.ToPolygonWithTolerance(ChordTolerance);
|
|
polygon.Offset(part.Location);
|
|
points.AddRange(polygon.Vertices);
|
|
}
|
|
|
|
return points;
|
|
}
|
|
}
|
|
}
|