using OpenNest.CNC; using OpenNest.Converters; using OpenNest.Geometry; using OpenNest.IO; namespace OpenNest.Tests.IO; public class DxfRoundtripTests { private const double Tolerance = 0.01; private static List ExportAndReimport(List geometry) { var program = ConvertGeometry.ToProgram(geometry); using var exportStream = new MemoryStream(); Dxf.ExportProgram(program, exportStream); var bytes = exportStream.ToArray(); var importStream = new MemoryStream(bytes); var reimported = Dxf.GetGeometry(importStream); Assert.NotEmpty(reimported); return reimported; } private static List FilterByLayer(List entities, string layerName) where T : Entity { return entities.Where(e => e is T && e.Layer?.Name == layerName).Cast().ToList(); } [Fact] public void Roundtrip_Lines_PreservesGeometry() { // A simple triangle (non-collinear lines to avoid GeometryOptimizer merging) var original = new List { new Line(0, 0, 10, 0), new Line(10, 0, 5, 8), new Line(5, 8, 0, 0), }; var reimported = ExportAndReimport(original); var cutLines = FilterByLayer(reimported, "Cut"); Assert.Equal(original.Count, cutLines.Count); for (var i = 0; i < original.Count; i++) { var orig = (Line)original[i]; var rt = cutLines[i]; Assert.Equal(orig.StartPoint.X, rt.StartPoint.X, Tolerance); Assert.Equal(orig.StartPoint.Y, rt.StartPoint.Y, Tolerance); Assert.Equal(orig.EndPoint.X, rt.EndPoint.X, Tolerance); Assert.Equal(orig.EndPoint.Y, rt.EndPoint.Y, Tolerance); } } [Fact] public void Roundtrip_Circle_PreservesCenterAndRadius() { var original = new Circle(5, 3, 4); var geometry = new List { original }; var reimported = ExportAndReimport(geometry); var circles = FilterByLayer(reimported, "Cut"); Assert.Single(circles); var rt = circles[0]; Assert.Equal(original.Center.X, rt.Center.X, Tolerance); Assert.Equal(original.Center.Y, rt.Center.Y, Tolerance); Assert.Equal(original.Radius, rt.Radius, Tolerance); } [Fact] public void Roundtrip_Arc_PreservesCenterRadiusAndAngles() { var original = new Arc(5, 3, 4, 0.0, System.Math.PI / 2); var geometry = new List { original }; var reimported = ExportAndReimport(geometry); var arcs = FilterByLayer(reimported, "Cut"); Assert.Single(arcs); var rt = arcs[0]; Assert.Equal(original.Center.X, rt.Center.X, Tolerance); Assert.Equal(original.Center.Y, rt.Center.Y, Tolerance); Assert.Equal(original.Radius, rt.Radius, Tolerance); } [Fact] public void Roundtrip_Mixed_PreservesEntityTypes() { var original = new List { new Line(0, 0, 10, 0), new Line(10, 0, 10, 5), new Circle(20, 20, 3), new Arc(15, 15, 5, 0.0, System.Math.PI), }; var reimported = ExportAndReimport(original); var cutLines = FilterByLayer(reimported, "Cut"); var cutCircles = FilterByLayer(reimported, "Cut"); var cutArcs = FilterByLayer(reimported, "Cut"); Assert.Equal(2, cutLines.Count); Assert.Single(cutCircles); Assert.Single(cutArcs); } [Fact] public void Roundtrip_Rectangle_PreservesBoundingBox() { // Rectangle with distinct width/height so optimizer won't merge var original = new List { new Line(0, 0, 20, 0), new Line(20, 0, 20, 10), new Line(20, 10, 0, 10), new Line(0, 10, 0, 0), }; var reimported = ExportAndReimport(original); var cutLines = FilterByLayer(reimported, "Cut"); // Verify bounding box is preserved regardless of line order var origMinX = original .Cast() .Min(l => System.Math.Min(l.StartPoint.X, l.EndPoint.X)); var origMaxX = original .Cast() .Max(l => System.Math.Max(l.StartPoint.X, l.EndPoint.X)); var origMinY = original .Cast() .Min(l => System.Math.Min(l.StartPoint.Y, l.EndPoint.Y)); var origMaxY = original .Cast() .Max(l => System.Math.Max(l.StartPoint.Y, l.EndPoint.Y)); var rtMinX = cutLines.Min(l => System.Math.Min(l.StartPoint.X, l.EndPoint.X)); var rtMaxX = cutLines.Max(l => System.Math.Max(l.StartPoint.X, l.EndPoint.X)); var rtMinY = cutLines.Min(l => System.Math.Min(l.StartPoint.Y, l.EndPoint.Y)); var rtMaxY = cutLines.Max(l => System.Math.Max(l.StartPoint.Y, l.EndPoint.Y)); Assert.Equal(origMinX, rtMinX, Tolerance); Assert.Equal(origMaxX, rtMaxX, Tolerance); Assert.Equal(origMinY, rtMinY, Tolerance); Assert.Equal(origMaxY, rtMaxY, Tolerance); } [Fact] public void PlateExport_PlacesSubProgramHolesAtTheirOffsets() { // A planned part: each hole is a sub-program called at an offset from the part origin. var hole = new Program(Mode.Incremental); hole.Codes.Add(new RapidMove(0.5, 0)); hole.Codes.Add(new ArcMove(new Vector(0, 0), new Vector(-0.5, 0), RotationType.CCW)); var pgm = new Program(Mode.Incremental); pgm.SubPrograms[1] = hole; pgm.Codes.Add(new SubProgramCall { Id = 1, Program = hole, Offset = new Vector(2, 2) }); pgm.Codes.Add(new SubProgramCall { Id = 1, Program = hole, Offset = new Vector(8, 3) }); pgm.Codes.Add(new RapidMove(-8.5, -3)); pgm.Codes.Add(new LinearMove(10, 0)); pgm.Codes.Add(new LinearMove(0, 5)); pgm.Codes.Add(new LinearMove(-10, 0)); pgm.Codes.Add(new LinearMove(0, -5)); var plate = new Plate(100, 50) { Quadrant = 1 }; var part = new Part(new Drawing("Holes") { Program = pgm }); part.Location = new Vector(20, 30); plate.Parts.Add(part); using var stream = new MemoryStream(); Dxf.ExportPlate(plate, stream); var exported = Dxf.GetGeometry(new MemoryStream(stream.ToArray())); // The exporter must agree with the geometry the plate view draws. var expected = ConvertProgram.ToGeometry(part.Program).OfType().ToList(); foreach (var circle in expected) circle.Offset(part.Location); var actual = FilterByLayer(exported, "Cut"); Assert.Equal(2, expected.Count); Assert.Equal(expected.Count, actual.Count); foreach (var circle in expected) Assert.Contains( actual, c => c.Center.DistanceTo(circle.Center) < Tolerance && System.Math.Abs(c.Radius - circle.Radius) < Tolerance ); var cutLines = FilterByLayer(exported, "Cut"); Assert.Equal(part.BoundingBox.Left, cutLines.Min(l => l.BoundingBox.Left), Tolerance); Assert.Equal(part.BoundingBox.Bottom, cutLines.Min(l => l.BoundingBox.Bottom), Tolerance); // Rapids follow the tool from pierce to pierce: none detours through the part origin // or a hole center, which the tool never visits. var rapids = FilterByLayer(exported, "Rapid"); var stops = new[] { new Vector(0, 0), new Vector(22.5, 32), new Vector(28.5, 33), new Vector(20, 30), }; Assert.Equal(stops.Length - 1, rapids.Count); for (var i = 0; i < rapids.Count; i++) Assert.Contains( rapids, r => r.StartPoint.DistanceTo(stops[i]) < Tolerance && r.EndPoint.DistanceTo(stops[i + 1]) < Tolerance ); } }