aj
1b23ad79f2
After 1b, triangulating both polygons on every pair was the largest remaining overlap cost (27% of main-thread samples on the corpus job). PartOverlapChecker now triangulates each part at most once per check, lazily after the bounding-box gate, and passes the triangles to a new internal Collision.HasOverlap overload that runs the unchanged OverlapRegions body. Triangles are only read by clipping and hole subtraction, so reuse gives identical verdicts. Verification: - 49,000 seeded decisions with reused triangles match LegacyCollision; triangles stay bit-identical to a fresh triangulation afterwards. - Debug PolygonTriangulations: 246 -> 40 and 64 -> 36 per grid check; sharing triangles per Program instead fails 23 tests. - Corpus job (169 parts, --engines Default --parallel 1): median 13,398 -> 12,702 ms over 4+4 alternating runs vs 1b, identical outcomes; serialized layout byte-identical to the base. Also records the Follow-up B' (Slices 1a, 1b, 2a) measurements in docs/performance/fill-performance.md.
81 lines
3.8 KiB
C#
81 lines
3.8 KiB
C#
using System.Diagnostics;
|
|
using System.Threading;
|
|
|
|
namespace OpenNest
|
|
{
|
|
/// <summary>
|
|
/// Debug-only call counters for the fill hot paths. They confirm that a cache or shortcut
|
|
/// actually removes the work it claims to; Release builds compile the increments away.
|
|
/// </summary>
|
|
public static class PerfCounters
|
|
{
|
|
private static long findBestFits;
|
|
private static long offsetPerimeterEntities;
|
|
private static long partIntersects;
|
|
private static long fillScoreComputations;
|
|
private static long partBoundaryPreparations;
|
|
private static long partBoundsUpdates;
|
|
private static long featureBitmaskCells;
|
|
private static long crossingPointScans;
|
|
private static long overlapPolygonPreparations;
|
|
private static long polygonTriangulations;
|
|
|
|
public static long FindBestFits => Interlocked.Read(ref findBestFits);
|
|
public static long OffsetPerimeterEntities => Interlocked.Read(ref offsetPerimeterEntities);
|
|
public static long PartIntersects => Interlocked.Read(ref partIntersects);
|
|
public static long FillScoreComputations => Interlocked.Read(ref fillScoreComputations);
|
|
public static long PartBoundaryPreparations => Interlocked.Read(ref partBoundaryPreparations);
|
|
public static long PartBoundsUpdates => Interlocked.Read(ref partBoundsUpdates);
|
|
public static long FeatureBitmaskCells => Interlocked.Read(ref featureBitmaskCells);
|
|
public static long CrossingPointScans => Interlocked.Read(ref crossingPointScans);
|
|
public static long OverlapPolygonPreparations => Interlocked.Read(ref overlapPolygonPreparations);
|
|
public static long PolygonTriangulations => Interlocked.Read(ref polygonTriangulations);
|
|
|
|
[Conditional("DEBUG")]
|
|
public static void CountFindBestFits() => Interlocked.Increment(ref findBestFits);
|
|
|
|
[Conditional("DEBUG")]
|
|
public static void CountOffsetPerimeterEntities() =>
|
|
Interlocked.Increment(ref offsetPerimeterEntities);
|
|
|
|
[Conditional("DEBUG")]
|
|
public static void CountPartIntersects() => Interlocked.Increment(ref partIntersects);
|
|
|
|
[Conditional("DEBUG")]
|
|
public static void CountFillScoreComputation() => Interlocked.Increment(ref fillScoreComputations);
|
|
|
|
[Conditional("DEBUG")]
|
|
public static void CountPartBoundaryPreparation() => Interlocked.Increment(ref partBoundaryPreparations);
|
|
|
|
[Conditional("DEBUG")]
|
|
public static void CountPartBoundsUpdate() => Interlocked.Increment(ref partBoundsUpdates);
|
|
|
|
[Conditional("DEBUG")]
|
|
public static void CountFeatureBitmaskCell() => Interlocked.Increment(ref featureBitmaskCells);
|
|
|
|
[Conditional("DEBUG")]
|
|
public static void CountCrossingPointScan() => Interlocked.Increment(ref crossingPointScans);
|
|
|
|
[Conditional("DEBUG")]
|
|
public static void CountOverlapPolygonPreparation() =>
|
|
Interlocked.Increment(ref overlapPolygonPreparations);
|
|
|
|
[Conditional("DEBUG")]
|
|
public static void CountPolygonTriangulation() => Interlocked.Increment(ref polygonTriangulations);
|
|
|
|
public static void Reset()
|
|
{
|
|
Interlocked.Exchange(ref findBestFits, 0);
|
|
Interlocked.Exchange(ref offsetPerimeterEntities, 0);
|
|
Interlocked.Exchange(ref partIntersects, 0);
|
|
Interlocked.Exchange(ref fillScoreComputations, 0);
|
|
Interlocked.Exchange(ref partBoundaryPreparations, 0);
|
|
Interlocked.Exchange(ref partBoundsUpdates, 0);
|
|
Interlocked.Exchange(ref featureBitmaskCells, 0);
|
|
Interlocked.Exchange(ref crossingPointScans, 0);
|
|
Interlocked.Exchange(ref overlapPolygonPreparations, 0);
|
|
Interlocked.Exchange(ref polygonTriangulations, 0);
|
|
}
|
|
}
|
|
}
|