Spaces:
Sleeping
Sleeping
File size: 71,744 Bytes
29c82ca c7f0b44 29c82ca c7f0b44 29c82ca 4b11c98 29c82ca 8f71a0b 29c82ca 4b11c98 29c82ca 4b11c98 29c82ca 4b11c98 29c82ca b8e790e 29c82ca b8e790e 29c82ca b8e790e 29c82ca b8e790e 29c82ca b8e790e 4b11c98 b8e790e 29c82ca 4b11c98 29c82ca 4b11c98 29c82ca 4b11c98 29c82ca 859a75d 4b11c98 859a75d 29c82ca 4b11c98 29c82ca 4b11c98 29c82ca c7f0b44 29c82ca c7f0b44 29c82ca c7f0b44 29c82ca c7f0b44 b8e790e c7f0b44 b8e790e c7f0b44 b8e790e c7f0b44 4b11c98 c7f0b44 4b11c98 c7f0b44 b8e790e 4b11c98 b8e790e 4b11c98 b8e790e 29c82ca 4b11c98 29c82ca 4d202b8 29c82ca 4b11c98 29c82ca 4b11c98 29c82ca 4d202b8 4b11c98 4d202b8 29c82ca 4d202b8 859a75d 29c82ca c7f0b44 4b11c98 c7f0b44 4b11c98 c7f0b44 4b11c98 c7f0b44 4b11c98 c7f0b44 4b11c98 c7f0b44 8478b27 4b11c98 8478b27 4b11c98 8478b27 49307ad 4b11c98 49307ad 4b11c98 49307ad 4b11c98 49307ad 4b11c98 49307ad 4b11c98 49307ad 4b11c98 49307ad 4b11c98 49307ad 4b11c98 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 | from __future__ import annotations
import math
from shapely.geometry import MultiPolygon, Point, Polygon, box
from stl_slicer import LayerStack
from vector_gcode import generate_vector_gcode
from vector_toolpath import (
RASTER_PATTERN_CIRCLE_SPIRAL,
RASTER_PATTERN_RECTANGULAR_SPIRAL,
RASTER_PATTERN_WOODPILE,
RASTER_PATTERN_Y_DIRECTION,
ContourSource,
_append_layer_contours,
_circle_ring_radii,
_circle_rings_polyline,
_layer_contour_loops,
_rectangular_spiral_polyline,
build_reference_stack,
split_layer_stack_grid,
)
def _stack(
*layers: Polygon | MultiPolygon | None,
layer_height: float = 1.0,
name: str = "shape",
) -> LayerStack:
multipolygons: list[MultiPolygon] = []
for layer in layers:
if layer is None:
multipolygons.append(MultiPolygon())
elif isinstance(layer, MultiPolygon):
multipolygons.append(layer)
else:
multipolygons.append(MultiPolygon([layer]))
bounds_list = [layer.bounds for layer in multipolygons if not layer.is_empty]
if bounds_list:
x_min = min(b[0] for b in bounds_list)
y_min = min(b[1] for b in bounds_list)
x_max = max(b[2] for b in bounds_list)
y_max = max(b[3] for b in bounds_list)
else:
x_min = y_min = x_max = y_max = 0.0
return LayerStack(
layers=multipolygons,
z_values=[(index + 0.5) * layer_height for index in range(len(multipolygons))],
bounds=((x_min, y_min, 0.0), (x_max, y_max, len(multipolygons) * layer_height)),
layer_height=layer_height,
name=name,
)
def _move_signature(gcode_text: str) -> list[tuple[float | None, float | None, float | None]]:
signature: list[tuple[float | None, float | None, float | None]] = []
for line in gcode_text.splitlines():
if not line.startswith(("G0", "G1")):
continue
axes: dict[str, float] = {}
for token in line.split():
if token[:1] in {"X", "Y", "Z"}:
axes[token[0]] = float(token[1:])
signature.append((axes.get("X"), axes.get("Y"), axes.get("Z")))
return signature
def _move_endpoints_for_color(gcode_text: str, color: int) -> list[tuple[float, float]]:
x = y = 0.0
endpoints: list[tuple[float, float]] = []
for line in gcode_text.splitlines():
if not line.startswith(("G0", "G1")):
continue
start = (x, y)
for token in line.split():
if token.startswith("X"):
x += float(token[1:])
if token.startswith("Y"):
y += float(token[1:])
if f"; Color {color}" in line:
endpoints.extend([start, (x, y)])
return endpoints
def _moves_with_colors(gcode_text: str) -> list[dict]:
x = y = z = 0.0
moves: list[dict] = []
for line in gcode_text.splitlines():
if not line.startswith(("G0", "G1")):
continue
start = (x, y, z)
for token in line.split():
if token.startswith("X"):
x += float(token[1:])
if token.startswith("Y"):
y += float(token[1:])
if token.startswith("Z"):
z += float(token[1:])
color = None
if "; Color " in line:
color = int(line.rsplit("; Color ", 1)[1])
moves.append({"start": start, "end": (x, y, z), "color": color})
return moves
def _pressure_set_count(gcode_text: str) -> int:
return gcode_text.count("\\x30\\x38\\x50\\x53") + gcode_text.count("setpress(")
def test_gcode_writes_fixed_point_coordinates_never_scientific(tmp_path) -> None:
from vector_gcode import write_gcode_file
gcode_path = tmp_path / "noise.txt"
write_gcode_file(
gcode_path,
[
{"X": -5.1e-08, "Y": 0.8, "Color": 0},
{"X": 1.2e-05, "Y": 0.0, "Color": 255},
{"X": 4.0, "Y": -0.0, "Color": 0},
],
pressure=25,
valve=7,
port=3,
increase_pressure_per_layer=0.1,
pressure_ramp_enabled=True,
all_g1=False,
)
move_lines = [
line for line in gcode_path.read_text().splitlines() if line.startswith(("G0", "G1"))
]
assert move_lines == [
"G0 X0.0 Y0.8 ; Color 0",
"G1 X0.000012 Y0.0 ; Color 255",
"G0 X4.0 Y0.0 ; Color 0",
]
def test_slanted_shape_gcode_round_trips_through_the_viewer(tmp_path) -> None:
from gcode_viewer import parse_gcode_path
# Slanted edges produce float-noise sweep bounds that differ between rows
# (the pyramid failure mode); the parsed positions must stay inside the
# material footprint on every layer.
layers = [
Polygon(
[
(inset, inset),
(20.0 - inset, inset),
(20.0 - inset, 20.0 - inset),
(inset, 20.0 - inset),
]
)
for inset in (0.0, 0.57735026918962, 1.15470053837925, 1.73205080756887)
]
gcode_path = generate_vector_gcode(
_stack(*layers),
shape_name="slanted",
pressure=25,
valve=7,
port=3,
fil_width=0.8,
layer_height=1.0,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
parsed = parse_gcode_path(gcode_path.read_text())
for segment in parsed["print_segments"]:
for x, y, _z in segment:
# Origin sits one fil_width left of the layer-0 sweep start; all
# print positions stay within the 20 mm footprint plus buffers.
assert -1.0 <= x <= 21.0
assert -1.0 <= y <= 21.0
def test_gcode_file_is_named_after_the_shape(tmp_path) -> None:
gcode_path = generate_vector_gcode(
_stack(box(0.0, 0.0, 1.0, 1.0)),
shape_name="Simple_Circle",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
assert gcode_path.name == "Simple_Circle_gcode.txt"
def test_gcode_header_writes_presets_before_initial_aux_commands(tmp_path) -> None:
gcode_path = generate_vector_gcode(
_stack(box(0.0, 0.0, 1.0, 1.0)),
shape_name="header_order",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
lines = [
line.strip()
for line in gcode_path.read_text().splitlines()
if line.strip()
]
assert lines[0] == "G91"
# No metadata comments: the file starts straight with machine commands
# (the toolpath's world anchor is returned via origin_sink instead).
assert not any("PathOrigin" in line for line in lines)
assert lines[1] == "{aux_command}WAGO_ValveCommands(7, 0)"
assert lines[2] == "serialPort3.write(eval(setpress(25)))"
assert lines[3] == "serialPort3.write(eval(togglepress()))"
assert lines[4].startswith("{aux_command}WAGO_ValveCommands(")
assert lines[5].startswith("{aux_command}WAGO_ValveCommands(")
def test_gcode_lead_in_runs_once_before_first_layer(tmp_path) -> None:
gcode_path = generate_vector_gcode(
_stack(box(0.0, 0.0, 0.5, 0.5), box(0.0, 0.0, 0.5, 0.5)),
shape_name="lead_in",
pressure=25,
valve=7,
port=3,
fil_width=0.5,
layer_height=1.0,
lead_in_enabled=True,
lead_in_length=3.0,
lead_in_clearance=4.0,
lead_in_lines=3,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
moves = _moves_with_colors(gcode_path.read_text())
assert moves[:9] == [
{"start": (0.0, 0.0, 0.0), "end": (-7.0, 0.0, 0.0), "color": 0},
{"start": (-7.0, 0.0, 0.0), "end": (-4.0, 0.0, 0.0), "color": 255},
{"start": (-4.0, 0.0, 0.0), "end": (-4.0, 0.5, 0.0), "color": 0},
{"start": (-4.0, 0.5, 0.0), "end": (-7.0, 0.5, 0.0), "color": 255},
{"start": (-7.0, 0.5, 0.0), "end": (-7.0, 1.0, 0.0), "color": 0},
{"start": (-7.0, 1.0, 0.0), "end": (-4.0, 1.0, 0.0), "color": 255},
# Return route: exit the patch one spacing to the outside, travel
# home through the clearance lane, then step onto the start point —
# never dragging the primed nozzle back across the purge lines.
{"start": (-4.0, 1.0, 0.0), "end": (-4.0, -0.5, 0.0), "color": 0},
{"start": (-4.0, -0.5, 0.0), "end": (0.0, -0.5, 0.0), "color": 0},
{"start": (0.0, -0.5, 0.0), "end": (0.0, 0.0, 0.0), "color": 0},
]
assert all(move["end"][2] == 0.0 for move in moves[:9])
first_z_index = next(index for index, move in enumerate(moves) if move["end"][2] > 0.0)
assert first_z_index > 9
assert not any(
move["start"][0] < -3.0 or move["end"][0] < -3.0
for move in moves[first_z_index:]
)
def test_gcode_lead_in_direction_points_the_purge_patch(tmp_path) -> None:
from vector_toolpath import LEAD_IN_DIRECTION_UP
gcode_path = generate_vector_gcode(
_stack(box(0.0, 0.0, 0.5, 0.5)),
shape_name="lead_in_up",
pressure=25,
valve=7,
port=3,
fil_width=0.5,
lead_in_enabled=True,
lead_in_length=3.0,
lead_in_clearance=4.0,
lead_in_lines=2,
lead_in_direction=LEAD_IN_DIRECTION_UP,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
moves = _moves_with_colors(gcode_path.read_text())
# Patch is ABOVE the start: first travel goes +7 in Y, purge strokes are
# vertical and sit in y in [4, 7]; only the half-fil-wide return lane
# dips to the negative lateral side.
assert moves[0]["end"] == (0.0, 7.0, 0.0)
lead_prints = [m for m in moves[:6] if m["color"] == 255]
assert lead_prints
assert all(abs(m["end"][0] - m["start"][0]) < 1e-9 for m in lead_prints)
assert all(
3.9 <= min(m["start"][1], m["end"][1]) and max(m["start"][1], m["end"][1]) <= 7.1
for m in lead_prints
)
assert all(m["end"][0] >= -0.5 - 1e-9 for m in moves[:9])
def test_lead_in_opt_out_travels_shared_patch_but_skips_it_solo(tmp_path) -> None:
small = _stack(box(0.0, 0.0, 2.0, 2.0), name="small")
big = _stack(box(0.0, 0.0, 4.0, 4.0), name="big")
reference = build_reference_stack([small, big])
def _generate(stack: LayerStack, dispense: bool, motion, label: str):
path = generate_vector_gcode(
stack,
shape_name=label,
pressure=25,
valve=7,
port=3,
fil_width=1.0,
motion=motion,
lead_in_enabled=True,
lead_in_length=3.0,
lead_in_clearance=4.0,
lead_in_lines=3,
lead_in_dispense=dispense,
output_dir=tmp_path / label,
)
return _moves_with_colors(path.read_text())
# Shared motion: the opted-out head traverses the identical patch with
# the valve shut; totals and endpoints match the dispensing head exactly.
priming = _generate(big, True, reference, "priming")
passive = _generate(small, False, reference, "passive")
assert priming[-1]["end"] == passive[-1]["end"]
assert abs(_total_length(priming) - _total_length(passive)) < 1e-6
assert any(m["color"] == 255 for m in priming[:6])
assert all(m["color"] == 0 for m in passive[:9])
# Solo (no shared motion): the opted-out shape skips the lead-in
# entirely — its first move is the raster approach, not the purge travel.
solo = _generate(small, False, None, "solo")
with_lead = _generate(small, True, None, "with_lead")
assert len(solo) < len(with_lead)
assert solo[0]["end"] != (-7.0, 0.0, 0.0)
assert with_lead[0]["end"] == (-7.0, 0.0, 0.0)
def test_gcode_lead_in_return_never_crosses_the_purge_lines(tmp_path) -> None:
for lines in (1, 2, 3, 4):
gcode_path = generate_vector_gcode(
_stack(box(0.0, 0.0, 0.5, 0.5)),
shape_name=f"lead_return_{lines}",
pressure=25,
valve=7,
port=3,
fil_width=0.5,
lead_in_enabled=True,
lead_in_length=3.0,
lead_in_clearance=4.0,
lead_in_lines=lines,
output_dir=tmp_path / str(lines),
)
moves = _moves_with_colors(gcode_path.read_text())
lead_end = next(i for i, m in enumerate(moves) if m["end"] == (0.0, 0.0, 0.0))
prints = [m for m in moves[: lead_end + 1] if m["color"] == 255]
travels = [m for m in moves[: lead_end + 1] if m["color"] == 0]
# No travel move's interior crosses a printed purge line: every
# printed line sits on a lane y = k*0.5, and travels only run along
# x = const (lane changes at line ends) or at y = -0.5 / y <= 0.
for travel in travels[1:]:
y0, y1 = travel["start"][1], travel["end"][1]
x0, x1 = travel["start"][0], travel["end"][0]
if abs(y1 - y0) < 1e-9 and abs(x1 - x0) > 1e-9:
# Horizontal travel: must be outside the printed lanes.
assert y0 < -1e-9 or not any(
abs(p["start"][1] - y0) < 1e-9 for p in prints
), (lines, travel)
def test_gcode_pressure_ramp_can_be_disabled(tmp_path) -> None:
stack = _stack(box(0.0, 0.0, 1.0, 1.0), box(0.0, 0.0, 1.0, 1.0))
ramped_path = generate_vector_gcode(
stack,
shape_name="pressure_ramped",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
layer_height=1.0,
pressure_ramp_enabled=True,
output_dir=tmp_path / "ramped",
)
fixed_path = generate_vector_gcode(
stack,
shape_name="pressure_fixed",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
layer_height=1.0,
pressure_ramp_enabled=False,
output_dir=tmp_path / "fixed",
)
assert _pressure_set_count(ramped_path.read_text()) > 1
assert _pressure_set_count(fixed_path.read_text()) == 1
def test_gcode_uses_g1_for_print_and_g0_for_travel(tmp_path) -> None:
gcode_path = generate_vector_gcode(
_stack(box(0.0, 0.0, 1.0, 1.0)),
shape_name="move_types",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
move_lines = [
line.strip()
for line in gcode_path.read_text().splitlines()
if line.startswith(("G0", "G1"))
]
assert any(line.startswith("G1") and "; Color 255" in line for line in move_lines)
assert all(not line.startswith("G0") for line in move_lines if "; Color 255" in line)
assert all(not line.startswith("G1") for line in move_lines if "; Color 0" in line)
def test_woodpile_raster_switches_print_axis_between_layers(tmp_path) -> None:
layer = box(0.0, 0.0, 3.0, 2.0)
gcode_path = generate_vector_gcode(
_stack(layer, layer, layer, layer),
shape_name="woodpile",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
raster_pattern=RASTER_PATTERN_WOODPILE,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
gcode_text = gcode_path.read_text()
move_lines = [
line.strip()
for line in gcode_text.splitlines()
if line.startswith(("G0", "G1"))
]
z_move_index = next(i for i, line in enumerate(move_lines) if " Z" in line)
first_layer_prints = [
line
for line in move_lines[:z_move_index]
if line.startswith("G1") and "; Color 255" in line
]
second_layer_end = next(
(i for i, line in enumerate(move_lines[z_move_index + 1 :], start=z_move_index + 1) if " Z" in line),
len(move_lines),
)
second_layer_prints = [
line
for line in move_lines[z_move_index + 1 : second_layer_end]
if line.startswith("G1") and "; Color 255" in line
]
assert move_lines[0] == "G0 X1.0 Y0.0 ; Color 0"
# Layer 0 prints sweep along X, layer 1 prints sweep along Y.
assert first_layer_prints
assert all("Y0.0" in line for line in first_layer_prints)
assert second_layer_prints
assert all("X0.0" in line for line in second_layer_prints)
x = y = 0.0
x_positions = [x]
y_positions = [y]
for line in move_lines:
for token in line.split():
if token.startswith("X"):
x += float(token[1:])
if token.startswith("Y"):
y += float(token[1:])
x_positions.append(x)
y_positions.append(y)
assert min(x_positions) == 0.0
assert max(x_positions) == 5.0
assert min(y_positions) == -1.5
assert max(y_positions) == 2.5
# Each layer restarts at the sweep-start candidate nearest the previous
# layer's endpoint. Candidates are the four buffered sweep corners, here
# in cumulative coordinates (origin = layer 0's start at world (-1, 0.5)).
y_axis_candidates = [(1.5, -1.5), (1.5, 2.5), (3.5, -1.5), (3.5, 2.5)]
x_axis_candidates = [(0.0, 0.0), (0.0, 1.0), (5.0, 0.0), (5.0, 1.0)]
moves = _moves_with_colors(gcode_text)
layer_changes = [move for move in moves if move["end"][2] > move["start"][2]]
assert len(layer_changes) == 3
for layer_number, layer_change in enumerate(layer_changes, start=1):
candidates = y_axis_candidates if layer_number % 2 == 1 else x_axis_candidates
start = layer_change["start"][:2]
end = layer_change["end"][:2]
assert end in candidates
best = min(math.dist(start, candidate) for candidate in candidates)
assert math.dist(start, end) <= best + 1e-9
def test_y_direction_raster_prints_each_layer_along_y_axis(tmp_path) -> None:
layer = box(0.0, 0.0, 3.0, 2.0)
gcode_path = generate_vector_gcode(
_stack(layer, layer),
shape_name="y_direction",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
raster_pattern=RASTER_PATTERN_Y_DIRECTION,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
gcode_text = gcode_path.read_text()
move_lines = [
line.strip()
for line in gcode_text.splitlines()
if line.startswith(("G0", "G1"))
]
print_lines = [
line
for line in move_lines
if line.startswith("G1") and "; Color 255" in line
]
assert print_lines
assert move_lines[0] == "G0 X0.0 Y1.0 ; Color 0"
assert all("X0.0" in line and "Y0.0" not in line for line in print_lines)
x = y = 0.0
x_positions = [x]
y_positions = [y]
for line in move_lines:
for token in line.split():
if token.startswith("X"):
x += float(token[1:])
if token.startswith("Y"):
y += float(token[1:])
x_positions.append(x)
y_positions.append(y)
assert min(x_positions) == 0.0
assert max(x_positions) == 2.0
assert min(y_positions) == 0.0
assert max(y_positions) == 4.0
moves = _moves_with_colors(gcode_text)
first_layer_change = next(
move for move in moves if move["end"][2] > move["start"][2]
)
assert first_layer_change["start"][:2] == first_layer_change["end"][:2]
def test_diagonal_woodpile_rotates_45_degrees_per_layer(tmp_path) -> None:
from vector_toolpath import RASTER_PATTERN_DIAGONAL_WOODPILE
layer = box(0.0, 0.0, 8.0, 8.0)
gcode_path = generate_vector_gcode(
_stack(layer, layer, layer, layer),
shape_name="diagonal",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
layer_height=1.0,
raster_pattern=RASTER_PATTERN_DIAGONAL_WOODPILE,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
moves = _moves_with_colors(gcode_path.read_text())
directions_by_layer: dict[float, set[float]] = {}
intercepts_45: set[float] = set()
for move in moves:
if move["color"] != 255:
continue
z = round(move["start"][2], 6)
dx = move["end"][0] - move["start"][0]
dy = move["end"][1] - move["start"][1]
angle = round(math.degrees(math.atan2(dy, dx)) % 180.0, 1)
directions_by_layer.setdefault(z, set()).add(angle)
if z == 1.0:
intercepts_45.add(
round((move["start"][1] - move["start"][0]) / math.sqrt(2), 5)
)
# The raster angle cycles 0 -> 45 -> 90 -> 135 across layers.
assert directions_by_layer == {
0.0: {0.0},
1.0: {45.0},
2.0: {90.0},
3.0: {135.0},
}
# Diagonal lines keep an exact one-fil perpendicular pitch.
ordered = sorted(intercepts_45)
assert len(ordered) > 3
assert {round(b - a, 4) for a, b in zip(ordered, ordered[1:])} == {1.0}
def test_diagonal_woodpile_shares_reference_motion(tmp_path) -> None:
from vector_toolpath import RASTER_PATTERN_DIAGONAL_WOODPILE
big = _stack(*([box(0.0, 0.0, 8.0, 8.0)] * 4), name="big")
small = _stack(*([box(2.0, 2.0, 6.0, 6.0)] * 4), name="small")
reference = build_reference_stack([big, small], grid=1.0)
totals = []
for stack, label in ((big, "dbig"), (small, "dsmall")):
gcode_path = generate_vector_gcode(
stack,
shape_name=label,
pressure=25,
valve=7,
port=3,
fil_width=1.0,
motion=reference,
raster_pattern=RASTER_PATTERN_DIAGONAL_WOODPILE,
output_dir=tmp_path / label,
)
totals.append(_total_length(_moves_with_colors(gcode_path.read_text())))
assert abs(totals[0] - totals[1]) < 1e-2
def test_raster_crosses_interior_holes_with_valve_off(tmp_path) -> None:
hollow = Polygon(
box(0.0, 0.0, 6.0, 6.0).exterior.coords,
[list(box(2.0, 2.0, 4.0, 4.0).exterior.coords)],
)
gcode_path = generate_vector_gcode(
_stack(hollow),
shape_name="hollow",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
moves = _moves_with_colors(gcode_path.read_text())
print_moves = [move for move in moves if move["color"] == 255]
travel_moves = [move for move in moves if move["color"] == 0]
# Middle sweeps must split into two print runs around the hole.
assert len(print_moves) == 4 + 4 # 4 full-width rows + 2 rows split in two
# Some interior travel (crossing the hole) exists besides the buffers.
assert any(
0.0 < move["start"][0] < 7.0 and 0.0 < move["end"][0] < 7.0
for move in travel_moves
)
def test_rectangular_spiral_polyline_reverses_center_to_edge() -> None:
inward = _rectangular_spiral_polyline((0.0, 0.0, 3.0, 3.0), 1.0)
outward = _rectangular_spiral_polyline((0.0, 0.0, 3.0, 3.0), 1.0, reverse=True)
assert inward[0] != inward[-1]
assert outward[0] == inward[-1]
assert outward[-1] == inward[0]
def test_rectangular_spiral_raster_reverses_between_layers(tmp_path) -> None:
layer = box(0.0, 0.0, 3.0, 3.0)
gcode_path = generate_vector_gcode(
_stack(layer, layer),
shape_name="rectangular_spiral",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
layer_height=1.0,
raster_pattern=RASTER_PATTERN_RECTANGULAR_SPIRAL,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
moves = _moves_with_colors(gcode_path.read_text())
first_layer_change = next(
move for move in moves if move["end"][2] > move["start"][2]
)
assert first_layer_change["start"][:2] == first_layer_change["end"][:2]
end_x, end_y, end_z = moves[-1]["end"]
assert abs(end_x) < 1e-9
assert abs(end_y) < 1e-9
assert end_z == 1.0
def test_circle_ring_radii_hug_the_wall_then_fill_from_a_global_grid() -> None:
# The outermost revolution follows the material edge (max distance minus
# half a bead); the fill rings inside it sit on the (j + 1/2) * fil grid
# shared by every layer, so interior rings stack instead of aliasing.
disc = MultiPolygon([Point(2.0, 3.0).buffer(4.2, quad_segs=64)])
radii, walls = _circle_ring_radii(disc, 2.0, 3.0, 0.8)
assert radii == sorted(radii, reverse=True)
assert walls == (radii[0],)
assert abs(radii[0] - (4.2 - 0.4)) < 1e-2 # wall hugs the material edge
for radius in radii[1:]:
ring = radius / 0.8 - 0.5
assert abs(ring - round(ring)) < 1e-9 # fill stays on the global grid
assert radius <= radii[0] - 0.4 + 1e-9 # no overlap with the wall bead
assert min(radii) == 0.4 # material at the centre keeps the innermost ring
def test_circle_ring_radii_skip_rings_outside_the_material() -> None:
# An annulus gets an outer wall, an inner wall hugging the hole, and fill
# rings only where circles can cross material.
annulus = MultiPolygon(
[
Point(0.0, 0.0)
.buffer(6.0, quad_segs=64)
.difference(Point(0.0, 0.0).buffer(3.0, quad_segs=64))
]
)
radii, walls = _circle_ring_radii(annulus, 0.0, 0.0, 0.8)
assert radii
assert len(walls) == 2
assert abs(max(walls) - (6.0 - 0.4)) < 1e-2 # outer wall at the edge
assert abs(min(walls) - (3.0 + 0.4)) < 1e-2 # inner wall at the hole
assert min(radii) >= 3.0 - 1e-2
assert max(radii) <= 6.0 + 1e-9
def test_circle_rings_polyline_steps_radius_by_whole_pitches() -> None:
# Each revolution is a true circle at a constant radius; the radius drops
# by exactly one pitch in a single radial jump between revolutions.
ring_radii = [3.6, 2.8, 2.0, 1.2, 0.4]
points = _circle_rings_polyline(2.0, 3.0, ring_radii, 0.8)
radii = [math.hypot(x - 2.0, y - 3.0) for x, y in points]
distinct = sorted({round(radius, 6) for radius in radii})
assert distinct == [0.4, 1.2, 2.0, 2.8, 3.6]
ring_transitions = sum(
1
for previous, current in zip(radii, radii[1:])
if abs(current - previous) > 1e-9
)
assert ring_transitions == 4
def test_circle_spiral_dome_has_no_travel_rings_and_monotone_radii(tmp_path) -> None:
# A dome (shrinking discs): motion must stay near each layer's material
# instead of sweeping the full frame, and the outermost printed radius
# must never grow with height.
from gcode_viewer import parse_gcode_path
center = (5.0, 5.0)
layer_radii = [5.0, 4.3, 3.4, 2.2]
layers = [Point(*center).buffer(r, quad_segs=64) for r in layer_radii]
gcode_path = generate_vector_gcode(
_stack(*layers),
shape_name="dome",
pressure=25,
valve=7,
port=3,
fil_width=0.8,
layer_height=1.0,
raster_pattern=RASTER_PATTERN_CIRCLE_SPIRAL,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
parsed = parse_gcode_path(gcode_path.read_text())
origin_x, origin_y = origin_sink["path_origin"]
def layer_of(z: float) -> int:
return max(0, min(len(layer_radii) - 1, int(round(z))))
motion_max = [0.0] * len(layer_radii)
print_max = [0.0] * len(layer_radii)
for kind in ("print_segments", "travel_segments"):
for segment in parsed[kind]:
for x, y, z in segment:
radius = math.hypot(x + origin_x - center[0], y + origin_y - center[1])
index = layer_of(z)
motion_max[index] = max(motion_max[index], radius)
if kind == "print_segments":
print_max[index] = max(print_max[index], radius)
for index, layer_radius in enumerate(layer_radii):
# No motion meaningfully beyond this layer's own material edge.
assert motion_max[index] <= layer_radius + 0.8, (index, motion_max[index])
assert print_max[index] <= layer_radius + 1e-6
# Outermost printed ring shrinks (or holds) as the dome narrows.
for lower, upper in zip(print_max, print_max[1:]):
assert upper <= lower + 1e-9
def test_circle_spiral_ring_steps_travel_with_valve_shut(tmp_path) -> None:
from gcode_viewer import parse_gcode_path
from vector_toolpath import RASTER_PATTERN_CIRCLE_SPIRAL
layer = box(0.0, 0.0, 10.0, 10.0)
gcode_path = generate_vector_gcode(
_stack(layer, layer),
shape_name="ring_steps",
pressure=25,
valve=7,
port=3,
fil_width=0.8,
layer_height=1.0,
raster_pattern=RASTER_PATTERN_CIRCLE_SPIRAL,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
parsed = parse_gcode_path(gcode_path.read_text())
origin_x, origin_y = origin_sink["path_origin"]
center_x = center_y = 5.0
# Print moves stay on a constant-radius ring (within chord flattening);
# the inward steps between rings — including pieces clipped by the
# material boundary at the edges — are always valve-off travel.
worst = 0.0
for segment in parsed["print_segments"]:
for a, b in zip(segment, segment[1:]):
radius_a = math.hypot(a[0] + origin_x - center_x, a[1] + origin_y - center_y)
radius_b = math.hypot(b[0] + origin_x - center_x, b[1] + origin_y - center_y)
worst = max(worst, abs(radius_b - radius_a))
assert worst < 0.11
def test_circle_spiral_raster_reverses_between_layers(tmp_path) -> None:
layer = box(0.0, 0.0, 5.0, 5.0)
gcode_path = generate_vector_gcode(
_stack(layer, layer),
shape_name="circle_spiral",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
layer_height=1.0,
raster_pattern=RASTER_PATTERN_CIRCLE_SPIRAL,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
moves = _moves_with_colors(gcode_path.read_text())
first_layer_change = next(
move for move in moves if move["end"][2] > move["start"][2]
)
assert first_layer_change["start"][:2] == first_layer_change["end"][:2]
end_x, end_y, end_z = moves[-1]["end"]
assert abs(end_x) < 1e-9
assert abs(end_y) < 1e-9
assert end_z == 1.0
def _total_length(moves: list[dict]) -> float:
return sum(math.dist(move["start"][:2], move["end"][:2]) for move in moves)
def _print_length(moves: list[dict]) -> float:
return sum(
math.dist(move["start"][:2], move["end"][:2])
for move in moves
if move["color"] == 255
)
def test_half_infill_skips_alternate_lines_but_keeps_the_same_path(tmp_path) -> None:
layer = box(0.0, 0.0, 4.0, 4.0)
stack = _stack(layer, layer)
def _generate(infill: float, label: str):
path = generate_vector_gcode(
stack,
shape_name=label,
pressure=25,
valve=7,
port=3,
fil_width=1.0,
layer_height=1.0,
infill=infill,
output_dir=tmp_path / label,
)
return _moves_with_colors(path.read_text())
full = _generate(1.0, "full")
half = _generate(0.5, "half")
# Identical motion: same final position and same total traversed length.
assert full[-1]["end"] == half[-1]["end"]
assert abs(_total_length(full) - _total_length(half)) < 1e-6
# Half the lines dispense: 2 of the 4 sweeps per layer print.
assert abs(_print_length(half) - _print_length(full) / 2) < 1e-6
# The printing sweeps sit on alternating scanlines (one fil apart x2).
half_print_rows = sorted({round(m["start"][1], 6) for m in half if m["color"] == 255 and m["start"][2] == 0.0})
assert len(half_print_rows) == 2
assert abs((half_print_rows[1] - half_print_rows[0]) - 2.0) < 1e-9
def test_infill_selection_is_shared_across_reference_motion(tmp_path) -> None:
small = _stack(box(0.0, 0.0, 2.0, 2.0), name="small")
big = _stack(box(0.0, 0.0, 4.0, 4.0), name="big")
reference = build_reference_stack([small, big])
def _generate(stack: LayerStack, infill: float, label: str):
path = generate_vector_gcode(
stack,
shape_name=label,
pressure=25,
valve=7,
port=3,
fil_width=1.0,
motion=reference,
infill=infill,
output_dir=tmp_path / label,
)
return _moves_with_colors(path.read_text())
sparse = _generate(small, 0.5, "sparse")
dense = _generate(big, 1.0, "dense")
# Different infill per shape, one shared motion path.
assert sparse[-1]["end"] == dense[-1]["end"]
assert abs(_total_length(sparse) - _total_length(dense)) < 1e-6
assert 0 < _print_length(sparse) < _print_length(dense)
def test_spiral_infill_skips_rings_and_keeps_the_path(tmp_path) -> None:
layer = box(0.0, 0.0, 6.0, 6.0)
stack = _stack(layer)
def _generate(pattern: str, infill: float, label: str):
path = generate_vector_gcode(
stack,
shape_name=label,
pressure=25,
valve=7,
port=3,
fil_width=1.0,
raster_pattern=pattern,
infill=infill,
output_dir=tmp_path / label,
)
return _moves_with_colors(path.read_text())
for pattern in (RASTER_PATTERN_RECTANGULAR_SPIRAL, RASTER_PATTERN_CIRCLE_SPIRAL):
full = _generate(pattern, 1.0, f"{pattern}-full".replace(" ", "_"))
half = _generate(pattern, 0.5, f"{pattern}-half".replace(" ", "_"))
# Identical path within the writer's micron-level delta rounding
# (segment split points differ, so the rounding accumulates
# differently by up to ~1 um over tens of thousands of moves).
assert math.dist(full[-1]["end"], half[-1]["end"]) < 1e-4, pattern
assert abs(_total_length(full) - _total_length(half)) < 1e-3, pattern
assert 0 < _print_length(half) < _print_length(full), pattern
def test_layer_contour_loops_follow_polygon_rings() -> None:
hollow = MultiPolygon(
[
Polygon(
box(0.0, 0.0, 4.0, 4.0).exterior.coords,
[list(box(1.0, 1.0, 2.0, 2.0).exterior.coords)],
)
]
)
loops = _layer_contour_loops(hollow)
assert len(loops) == 2
# Largest loop (the exterior) sorts first.
assert set(loops[0]) == {(0.0, 0.0), (4.0, 0.0), (4.0, 4.0), (0.0, 4.0)}
assert set(loops[1]) == {(1.0, 1.0), (2.0, 1.0), (2.0, 2.0), (1.0, 2.0)}
assert loops[0][0] == loops[0][-1]
assert loops[1][0] == loops[1][-1]
def test_contour_tracing_travels_to_nearest_border_after_infill(tmp_path) -> None:
layer = box(0.0, 0.0, 1.0, 1.0)
stack = _stack(layer)
gcode_path = generate_vector_gcode(
stack,
shape_name="nearest_border_contour",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
all_g1=True,
contour_sources=[ContourSource(owner_idx=1, stack=stack)],
active_contour_owner=1,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
moves = _moves_with_colors(gcode_path.read_text())
# Move 0 is the valve-settle approach, move 1 the single infill sweep.
assert moves[1]["color"] == 255
infill_end = moves[1]["end"]
# The contour starts printing from the point nearest the infill end,
# with no travel in between (the trailing buffer is rewound).
assert moves[2]["color"] == 255
assert moves[2]["start"] == infill_end
def test_contour_tracing_closes_loop_and_restores_raster_endpoint(tmp_path) -> None:
layer = box(0.0, 0.0, 2.0, 2.0)
stack = _stack(layer, layer)
gcode_path = generate_vector_gcode(
stack,
shape_name="contour_loop",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
layer_height=1.0,
all_g1=True,
contour_sources=[ContourSource(owner_idx=1, stack=stack)],
active_contour_owner=1,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
all_moves = _moves_with_colors(gcode_path.read_text())
for layer_z in (0.0, 1.0):
layer_moves = [
move
for move in all_moves
if move["start"][2] == layer_z and move["end"][2] == layer_z
]
layer_prints = [move for move in layer_moves if move["color"] == 255]
assert layer_prints
# The contour is a closed loop: the last print returns to where the
# contour started.
contour_prints = layer_prints[2:]
assert contour_prints
assert contour_prints[-1]["end"] == contour_prints[0]["start"]
# After the contour, a travel move restores the raster endpoint.
last_print_index = max(
idx for idx, move in enumerate(layer_moves) if move["color"] == 255
)
trailing = layer_moves[last_print_index + 1 :]
assert trailing
assert all(move["color"] == 0 for move in trailing)
def test_contour_tracing_keeps_hollow_rings_separate() -> None:
output = [{"X": 0.0, "Y": 0.0, "Color": 255}]
contour_layers = [
[
{
"owner_idx": 1,
"contours": [
[(0.0, 0.0), (4.0, 0.0), (4.0, 4.0), (0.0, 4.0), (0.0, 0.0)],
[(1.0, 1.0), (2.0, 1.0), (2.0, 2.0), (1.0, 2.0), (1.0, 1.0)],
],
}
]
]
current_x, current_y = _append_layer_contours(
output,
0.0,
0.0,
contour_layers,
layer_number=0,
active_owner_idx=1,
)
contour_print_moves = [move for move in output[1:] if move["Color"] == 255]
assert len(contour_print_moves) == 8
assert (current_x, current_y) == (1.0, 1.0)
def test_contour_tracing_skips_inactive_nozzle_outline(tmp_path) -> None:
blank_stack = _stack(None)
contour_stack = _stack(box(0.0, 0.0, 1.0, 1.0))
contour_sources = [ContourSource(owner_idx=1, stack=contour_stack)]
active_path = generate_vector_gcode(
blank_stack,
shape_name="active_contour",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
all_g1=True,
contour_sources=contour_sources,
active_contour_owner=1,
output_dir=tmp_path / "active",
)
inactive_path = generate_vector_gcode(
blank_stack,
shape_name="inactive_contour",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
all_g1=True,
contour_sources=contour_sources,
active_contour_owner=2,
output_dir=tmp_path / "inactive",
)
active_text = active_path.read_text()
inactive_text = inactive_path.read_text()
assert _move_signature(active_text)
assert _move_signature(inactive_text) == []
assert any(
line.startswith("G1") and "; Color 255" in line
for line in active_text.splitlines()
)
assert not any("; Color 255" in line for line in inactive_text.splitlines())
def test_inactive_contour_tracing_preserves_original_raster_moves(tmp_path) -> None:
layer = box(1.0, 1.0, 3.0, 2.0)
stack = _stack(layer, layer)
original_path = generate_vector_gcode(
stack,
shape_name="original_raster",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
all_g1=True,
output_dir=tmp_path / "original",
)
inactive_path = generate_vector_gcode(
stack,
shape_name="inactive_contour_raster",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
all_g1=True,
contour_sources=[ContourSource(owner_idx=2, stack=stack)],
active_contour_owner=1,
output_dir=tmp_path / "inactive",
)
assert _move_signature(inactive_path.read_text()) == _move_signature(
original_path.read_text()
)
def test_reference_motion_shares_path_and_gates_valve_per_shape(tmp_path) -> None:
small = _stack(box(0.0, 0.0, 2.0, 2.0), name="small")
big = _stack(box(0.0, 0.0, 4.0, 4.0), name="big")
reference = build_reference_stack([small, big])
assert reference is not None
def _generate(stack: LayerStack, label: str):
return generate_vector_gcode(
stack,
shape_name=label,
pressure=25,
valve=7,
port=3,
fil_width=1.0,
motion=reference,
output_dir=tmp_path / label,
)
small_moves = _moves_with_colors(_generate(small, "small").read_text())
big_moves = _moves_with_colors(_generate(big, "big").read_text())
# Both shapes follow the same shared motion path: identical final position
# and identical total path length (the moves split at different valve
# boundaries, but the traversed polyline is the same).
assert small_moves[-1]["end"] == big_moves[-1]["end"]
def _total_length(moves: list[dict]) -> float:
return sum(math.dist(move["start"][:2], move["end"][:2]) for move in moves)
assert abs(_total_length(small_moves) - _total_length(big_moves)) < 1e-6
def _print_length(moves: list[dict]) -> float:
return sum(
math.dist(move["start"][:2], move["end"][:2])
for move in moves
if move["color"] == 255
)
# The big shape dispenses over more of the shared path than the small one.
assert _print_length(small_moves) > 0
assert _print_length(big_moves) > _print_length(small_moves)
# The small shape's total print length matches its own area coverage:
# 2mm-wide rows on the shared 4-row sweep -> only rows inside the small box.
assert _print_length(small_moves) < _print_length(big_moves) / 2 + 4.0
def test_reference_motion_contours_share_path_and_gate_valve_per_shape(tmp_path) -> None:
small = _stack(box(0.0, 0.0, 2.0, 2.0), name="small")
big = _stack(box(0.0, 0.0, 4.0, 4.0), name="big")
reference = build_reference_stack([small, big])
assert reference is not None
contour_sources = [
ContourSource(owner_idx=1, stack=small),
ContourSource(owner_idx=2, stack=big),
]
def _generate(stack: LayerStack, owner: int, label: str):
path = generate_vector_gcode(
stack,
shape_name=label,
pressure=25,
valve=7,
port=3,
fil_width=1.0,
motion=reference,
contour_sources=contour_sources,
active_contour_owner=owner,
output_dir=tmp_path / label,
)
return _moves_with_colors(path.read_text())
small_moves = _generate(small, 1, "small")
big_moves = _generate(big, 2, "big")
# The motion including EVERY shape's contour tour is identical: same final
# position and same total traversed length for both heads.
assert small_moves[-1]["end"] == big_moves[-1]["end"]
def _total_length(moves: list[dict]) -> float:
return sum(math.dist(move["start"][:2], move["end"][:2]) for move in moves)
assert abs(_total_length(small_moves) - _total_length(big_moves)) < 1e-6
# In the shared frame (origin at the motion sweep start (-2, -0.5); big is
# re-centred to (-1,-1)..(3,3), small stays (0,0)..(2,2)):
small_corners = {(2.0, 0.5), (4.0, 0.5), (4.0, 2.5), (2.0, 2.5)}
big_corners = {(1.0, -0.5), (5.0, -0.5), (5.0, 3.5), (1.0, 3.5)}
def _endpoints(moves: list[dict], color: int) -> set[tuple[float, float]]:
return {
(round(move["end"][0], 6), round(move["end"][1], 6))
for move in moves
if move["color"] == color
}
# Each shape PRINTS its own outline and TRAVELS the other shape's outline.
assert small_corners <= _endpoints(small_moves, 255)
assert big_corners <= _endpoints(small_moves, 0)
assert big_corners <= _endpoints(big_moves, 255)
assert small_corners <= _endpoints(big_moves, 0)
def test_solo_contours_still_trace_only_own_shape(tmp_path) -> None:
small = _stack(box(0.0, 0.0, 2.0, 2.0), name="small")
big = _stack(box(0.0, 0.0, 4.0, 4.0), name="big")
contour_sources = [
ContourSource(owner_idx=1, stack=small),
ContourSource(owner_idx=2, stack=big),
]
gcode_path = generate_vector_gcode(
small,
shape_name="solo",
pressure=25,
valve=7,
port=3,
fil_width=1.0,
contour_sources=contour_sources,
active_contour_owner=1,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
moves = _moves_with_colors(gcode_path.read_text())
# Without reference motion the other shape's contour must NOT be traced:
# nothing ever moves outside the small shape's buffered footprint
# (origin at world (-1, 0.5), so relative x spans [0, 4], y [-0.5, 1.5];
# the big shape's contour would reach (5.0, 3.5)).
for move in moves:
assert -0.5 <= move["end"][0] <= 4.2
assert -1.0 <= move["end"][1] <= 2.0
def test_build_reference_stack_unions_center_aligned_layers() -> None:
first = _stack(box(0.0, 0.0, 2.0, 2.0), name="first")
second = _stack(box(10.0, 10.0, 14.0, 14.0), name="second")
reference = build_reference_stack([first, second])
assert reference is not None
# The second stack is re-centred onto the first stack's bbox centre (1, 1).
assert reference.bounds == ((-1.0, -1.0, 0.0), (3.0, 3.0, 1.0))
assert reference.layers[0].area == 16.0
assert len(reference.layers) == 1
assert reference.z_values == [0.5]
def test_split_layer_stack_grid_produces_row_major_cells() -> None:
layer = box(10.0, -2.0, 12.5, -1.0)
stack = _stack(layer, name="strip")
pieces = split_layer_stack_grid(stack, columns=2, rows=1)
assert [piece.name for piece in pieces] == ["strip_r01_c01", "strip_r01_c02"]
assert pieces[0].bounds[0][0] == 10.0
assert pieces[1].bounds[0][0] == 11.25
total_area = sum(piece.layers[0].area for piece in pieces)
assert abs(total_area - layer.area) < 1e-9
def test_split_layer_stack_grid_orders_rows_top_down() -> None:
layer = box(0.0, 0.0, 4.0, 4.0)
stack = _stack(layer, name="grid")
pieces = split_layer_stack_grid(stack, columns=2, rows=2)
assert [piece.name for piece in pieces] == [
"grid_r01_c01",
"grid_r01_c02",
"grid_r02_c01",
"grid_r02_c02",
]
# Row 1 is the top strip (max-Y side).
assert pieces[0].bounds == ((0.0, 2.0, 0.0), (2.0, 4.0, 1.0))
assert pieces[3].bounds == ((2.0, 0.0, 0.0), (4.0, 2.0, 1.0))
assert all(piece.layers[0].area == 4.0 for piece in pieces)
def test_grid_split_pads_equal_whole_fil_cells() -> None:
# 20.0 / 4 = 5.0 mm cells, which is 6.25 fil widths — not representable.
# With `grid`, every cell rounds UP to 7 fils (5.6 mm) and the 2.4 mm
# leftover becomes blank margin split evenly outside the outer edges.
layer = box(0.0, 0.0, 20.0, 4.0)
stack = _stack(layer, name="wide")
pieces = split_layer_stack_grid(stack, columns=4, rows=1, grid=0.8)
widths = {round(piece.bounds[1][0] - piece.bounds[0][0], 6) for piece in pieces}
assert widths == {5.6}
# Padding is centred: 1.2 mm of blank space beyond each outer edge.
assert round(pieces[0].bounds[0][0], 6) == -1.2
assert round(pieces[-1].bounds[1][0], 6) == 21.2
# No material is lost or duplicated by the padded cells.
total_area = sum(piece.layers[0].area for piece in pieces)
assert abs(total_area - layer.area) < 1e-9
def test_grid_split_reference_deltas_are_uniform() -> None:
from vector_toolpath import _centering_delta
layer = box(0.0, 0.0, 20.0, 4.0)
stack = _stack(layer, name="wide")
pieces = split_layer_stack_grid(stack, columns=4, rows=1, grid=0.8)
reference = build_reference_stack(pieces, grid=0.8)
assert reference is not None
deltas = [_centering_delta(piece, reference)[0] for piece in pieces]
diffs = {round(a - b, 6) for a, b in zip(deltas, deltas[1:])}
# Uniform spacing between every consecutive pair (one cell = 7 fils),
# so the physical nozzle offsets are the same for every connection.
assert diffs == {5.6}
def test_split_overlap_seam_raster_distance_is_equal_on_both_sides() -> None:
from vector_toolpath import _axis_raster_segments
# 7.5 mm is deliberately not a multiple of the 1 mm fil width, so raster
# quantization leaves slack. The slack must be split evenly: both pieces'
# lines sit the same distance from the (shifted) cut on every layer.
layer = MultiPolygon([box(0.0, 0.0, 7.5, 4.0)])
stack = LayerStack(
layers=[layer, layer],
z_values=[0.5, 1.5],
bounds=((0.0, 0.0, 0.0), (7.5, 4.0, 2.0)),
layer_height=1.0,
name="seam",
)
left, right = split_layer_stack_grid(
stack, columns=2, rows=1, overlapping_layers=True, overlap=0.5
)
for layer_number in range(2):
left_columns = sorted(
{seg[0] for seg in _axis_raster_segments(
left.layers[layer_number], left.layers[layer_number], 1.0, "Y"
) if seg[4] == 255}
)
right_columns = sorted(
{seg[0] for seg in _axis_raster_segments(
right.layers[layer_number], right.layers[layer_number], 1.0, "Y"
) if seg[4] == 255}
)
seam = left.layers[layer_number].bounds[2]
left_distance = seam - left_columns[-1]
right_distance = right_columns[0] - seam
assert abs(left_distance - right_distance) < 1e-9
def test_split_contour_paths_exclude_the_cut_seams() -> None:
layer = MultiPolygon([box(0.0, 0.0, 9.0, 4.0)])
stack = _stack(layer, name="bar")
left, middle, right = split_layer_stack_grid(stack, columns=3, rows=1, grid=1.0)
# Middle piece: only the parent's top and bottom edges, as open arcs —
# no vertical paths along the cuts at x=3 and x=6.
assert middle.contour_paths[0] == [
[(3.0, 0.0), (6.0, 0.0)],
[(3.0, 4.0), (6.0, 4.0)],
]
# Edge pieces get one open C-shaped path around their outer three sides.
(left_path,) = left.contour_paths[0]
assert left_path[0] != left_path[-1]
assert all(abs(x - 3.0) > 1e-9 or y in (0.0, 4.0) for x, y in left_path)
# A fully interior piece has no contour at all.
grid = split_layer_stack_grid(
_stack(MultiPolygon([box(0.0, 0.0, 9.0, 9.0)]), name="sq"),
columns=3,
rows=3,
grid=1.0,
)
assert grid[4].contour_paths[0] == []
# A hole entirely inside one piece stays a closed ring.
hollow = MultiPolygon(
[
Polygon(
box(0.0, 0.0, 9.0, 4.0).exterior.coords,
[list(box(1.0, 1.0, 2.0, 2.0).exterior.coords)],
)
]
)
hole_left, _hm, _hr = split_layer_stack_grid(
_stack(hollow, name="hollow"), columns=3, rows=1, grid=1.0
)
closed_paths = [p for p in hole_left.contour_paths[0] if p[0] == p[-1]]
assert len(closed_paths) == 1
def test_split_contour_gcode_never_traces_the_cuts(tmp_path) -> None:
layer = MultiPolygon([box(0.0, 0.0, 9.0, 4.0)])
stack = _stack(layer, layer, name="bar")
pieces = split_layer_stack_grid(stack, columns=3, rows=1, grid=1.0)
reference = build_reference_stack(pieces, grid=1.0)
sources = [
ContourSource(owner_idx=index + 1, stack=piece)
for index, piece in enumerate(pieces)
]
all_moves = []
for index, piece in enumerate(pieces):
gcode_path = generate_vector_gcode(
piece,
shape_name=f"seam{index}",
pressure=25,
valve=4 + index,
port=3,
fil_width=1.0,
motion=reference,
contour_sources=sources,
active_contour_owner=index + 1,
output_dir=tmp_path / f"seam{index}",
)
all_moves.append(_moves_with_colors(gcode_path.read_text()))
# All heads still share one motion path, contours included.
totals = {round(_total_length(moves), 4) for moves in all_moves}
assert len(totals) == 1
assert len({moves[-1]["end"] for moves in all_moves}) == 1
# The middle piece's contour arcs are horizontal: with the horizontal
# X-raster infill, it must emit NO vertical print move at all (a vertical
# print could only be a traced cut seam).
middle = all_moves[1]
vertical_prints = [
move
for move in middle
if move["color"] == 255
and abs(move["end"][0] - move["start"][0]) < 1e-9
and abs(move["end"][1] - move["start"][1]) > 1e-9
]
assert vertical_prints == []
def test_split_layer_stack_grid_overlap_alternates_between_layers() -> None:
layer = box(0.0, 0.0, 4.0, 2.0)
stack = _stack(layer, layer, name="interlock")
pieces = split_layer_stack_grid(
stack,
columns=2,
rows=1,
overlapping_layers=True,
overlap=0.5,
)
left, right = pieces
# The cut line alternates by +/- overlap between layers, so each piece's
# area differs between layer 0 and layer 1 while the totals stay constant.
assert left.layers[0].area != left.layers[1].area
assert abs(left.layers[0].area - left.layers[1].area) == 2.0 # 2*(0.5*2)
for index in range(2):
combined = left.layers[index].area + right.layers[index].area
assert abs(combined - layer.area) < 1e-9
# Nominal bounds stay the un-shifted cells.
assert left.bounds == ((0.0, 0.0, 0.0), (2.0, 2.0, 2.0))
assert right.bounds == ((2.0, 0.0, 0.0), (4.0, 2.0, 2.0))
def test_group_frame_reference_keeps_modeled_positions(tmp_path) -> None:
# Multi-material group (shapes sharing a nozzle): parts carry one shared
# align_frame, so they are NOT centered individually — each keeps its
# modeled position relative to the others, and a part that has no
# material on the lower layers just travels there (empty valve layers).
from gcode_viewer import parse_gcode_path
lower = _stack(box(0.0, 0.0, 4.0, 4.0), box(0.0, 0.0, 4.0, 4.0), name="lower")
# `upper` sits 6 mm to the right and only exists on layer 1.
upper = _stack(None, box(6.0, 0.0, 10.0, 4.0), name="upper")
group_frame = (0.0, 0.0, 10.0, 4.0)
lower.align_frame = group_frame
upper.align_frame = group_frame
# A regular shape (own nozzle, no frame) modeled far away prints in the
# same job: it gets centered onto the reference like always.
solo = _stack(box(100.0, 100.0, 104.0, 104.0), box(100.0, 100.0, 104.0, 104.0), name="solo")
reference = build_reference_stack([lower, upper, solo], grid=1.0)
# The group holding the first stack anchors the reference (no
# translation); solo lands centered on the frame centre (5, 2): x 3..7.
assert reference.layers[0].bounds == (0.0, 0.0, 7.0, 4.0)
assert reference.layers[1].bounds == (0.0, 0.0, 10.0, 4.0)
# Layer 0 = lower box (0..4) union solo centered to (3..7): 16+16-4 overlap.
assert abs(reference.layers[0].area - 28.0) < 1e-6
def _world_motion_polyline(text: str, origin: tuple[float, float]) -> list[tuple[float, float, float]]:
# Ordered nozzle path in world coordinates, simplified so points that
# only mark valve changes (collinear, same direction) drop out.
origin_x, origin_y = origin
moves = _moves_with_colors(text)
points = [moves[0]["start"]] + [move["end"] for move in moves]
world = [(x + origin_x, y + origin_y, z) for x, y, z in points]
simplified = [world[0]]
for point in world[1:]:
if len(simplified) >= 2:
ax, ay, az = simplified[-2]
bx, by, bz = simplified[-1]
d1 = (bx - ax, by - ay, bz - az)
d2 = (point[0] - bx, point[1] - by, point[2] - bz)
cross = (
d1[1] * d2[2] - d1[2] * d2[1],
d1[2] * d2[0] - d1[0] * d2[2],
d1[0] * d2[1] - d1[1] * d2[0],
)
same_dir = all(abs(c) < 1e-9 for c in cross) and (
d1[0] * d2[0] + d1[1] * d2[1] + d1[2] * d2[2] >= 0
)
if same_dir:
simplified[-1] = point
continue
simplified.append(point)
return [(round(x, 6), round(y, 6), round(z, 6)) for x, y, z in simplified]
prints: dict[str, list] = {}
motions: dict[str, list] = {}
for stack in (lower, upper):
gcode_path = generate_vector_gcode(
stack,
shape_name=stack.name,
pressure=25,
valve=7,
port=3,
fil_width=1.0,
layer_height=1.0,
motion=reference,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
text = gcode_path.read_text()
parsed = parse_gcode_path(text)
origin_x, origin_y = origin_sink["path_origin"]
prints[stack.name] = [
[(x + origin_x, y + origin_y, z) for x, y, z in segment]
for segment in parsed["print_segments"]
]
motions[stack.name] = _world_motion_polyline(text, origin_sink["path_origin"])
# Shared motion: both heads trace exactly the same world path.
assert motions["lower"] == motions["upper"]
# `upper` never dispenses on layer 0 and prints only inside x 6..10.
for segment in prints["upper"]:
for x, y, z in segment:
assert z > 0.5
assert 6.0 - 1e-6 <= x <= 10.0 + 1e-6
# `lower` prints only inside x 0..4 (its modeled position, not recentered).
for segment in prints["lower"]:
for x, y, z in segment:
assert 0.0 - 1e-6 <= x <= 4.0 + 1e-6
def test_group_contour_paths_exclude_material_interfaces() -> None:
from vector_toolpath import group_contour_paths
# Two materials abutting at x=4 assemble into one 8x4 shape: the shared
# edge is an internal interface, so each member contours only its three
# outer sides.
left = _stack(box(0.0, 0.0, 4.0, 4.0), name="left")
right = _stack(box(4.0, 0.0, 8.0, 4.0), name="right")
paths = group_contour_paths(left, [right], tolerance=0.4)
assert len(paths) == 1
total = sum(
math.dist(a, b)
for path in paths[0]
for a, b in zip(path, path[1:])
)
# 3 outer sides of the 4x4 box; boundary within tolerance (0.4) of the
# sibling also counts as interface, so the top/bottom edges stop 0.4
# short of the seam: 12 - 2*0.4. The seam edge itself is gone entirely.
assert abs(total - 11.2) < 1e-6
for path in paths[0]:
for x, _y in path:
assert x <= 3.6 + 1e-9 # nothing at or past the seam
# A fit-tolerance gap smaller than the tolerance still counts as an
# interface; a distant shape does not.
gapped = _stack(box(4.2, 0.0, 8.0, 4.0), name="gapped")
paths_gapped = group_contour_paths(left, [gapped], tolerance=0.4)
total_gapped = sum(
math.dist(a, b)
for path in paths_gapped[0]
for a, b in zip(path, path[1:])
)
# Seam edge excluded; top/bottom trimmed where within 0.4 of the sibling
# (which starts at 4.2): 12 - 2*0.2.
assert abs(total_gapped - 11.6) < 1e-6
far = _stack(box(9.0, 0.0, 12.0, 4.0), name="far")
paths_far = group_contour_paths(left, [far], tolerance=0.4)
total_far = sum(
math.dist(a, b)
for path in paths_far[0]
for a, b in zip(path, path[1:])
)
assert abs(total_far - 16.0) < 1e-6 # full ring: nothing nearby
# A material fully embedded in the assembly has no outer surface at all.
core = _stack(box(1.0, 1.0, 3.0, 3.0), name="core")
shell_layer = box(0.0, 0.0, 4.0, 4.0).difference(box(1.0, 1.0, 3.0, 3.0))
shell = _stack(shell_layer, name="shell")
assert group_contour_paths(core, [shell], tolerance=0.4) == [[]]
def test_scan_coords_keep_a_boundary_line_despite_float_noise() -> None:
from vector_toolpath import _scan_coords
# A split cut can land exactly ON a grid line; the piece above the cut
# owns that line (half-open interval), and float noise in the ratio must
# not ceil it away. These are the real flag-split numbers.
coords = _scan_coords(-15.2, 0.0, 0.8, anchor=-14.4)
assert abs(coords[0] - (-15.2)) < 1e-9 # boundary line kept
assert abs(coords[-1] - (-0.8)) < 1e-9 # cut line excluded (half-open)
# Same numbers arriving with adversarial float error.
noisy_lo = 0.0 - 19 * 0.8 # -15.200000000000001
coords2 = _scan_coords(noisy_lo, 0.0, 0.8, anchor=-14.4)
assert abs(coords2[0] - (-15.2)) < 1e-6
def test_split_seam_on_a_grid_line_reassembles_at_one_fil_pitch(tmp_path) -> None:
# Frame y[-15, 15] with 2 rows puts the cut at y=0 — exactly on a
# scanline of the shared grid. The seam line must be printed by exactly
# one piece, and the reassembled seam must keep one-fil bead pitch (a
# dropped line printed a visible one-pixel gap at every seam).
from gcode_viewer import parse_gcode_path
layer = box(-25.0, -15.0, 25.0, 15.0)
stack = _stack(layer, layer, name="flagish")
stack = LayerStack(
layers=stack.layers,
z_values=stack.z_values,
bounds=((-25.0, -15.0, 0.0), (25.0, 15.0, 2.0)),
layer_height=1.0,
name="flagish",
)
pieces = split_layer_stack_grid(stack, columns=1, rows=2, grid=0.8)
reference = build_reference_stack(list(pieces), grid=0.8)
world_lines: dict[str, list[float]] = {}
for piece in pieces:
gcode_path = generate_vector_gcode(
piece,
shape_name=piece.name,
pressure=25,
valve=7,
port=3,
fil_width=0.8,
layer_height=1.0,
motion=reference,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
parsed = parse_gcode_path(gcode_path.read_text())
_ox, oy = origin_sink["path_origin"]
world_lines[piece.name] = sorted(
{round(y + oy, 6) for seg in parsed["print_segments"] for _x, y, _z in seg}
)
top = world_lines[pieces[0].name] # row 1 = top strip
bottom = world_lines[pieces[1].name]
# The cut line at y=0 belongs to the TOP piece (its material starts there).
assert abs(top[0] - 0.0) < 1e-6
assert abs(bottom[-1] - (-0.8)) < 1e-6
# Seam pitch is exactly one fil; the line is printed exactly once.
assert abs((top[0] - bottom[-1]) - 0.8) < 1e-6
overlap = set(top) & set(bottom)
assert not overlap
def test_boundary_grid_line_grazing_from_outside_still_prints() -> None:
from vector_toolpath import _axis_raster_segments
# Real flag-split floats: the grid line computes as -15.200000000000001
# while the material's bottom edge is -15.199999999999999 — the line
# grazes the material from OUTSIDE by two ulps. The chord probe must
# still find the boundary sweep or the assembled seam gets a one-fil gap.
material = MultiPolygon([box(-25.0, -15.2, 25.0, 0.0)])
segments = _axis_raster_segments(
material, material, 0.8, axis="X", scan_anchor=-14.4
)
print_ys = sorted({y0 for _x0, y0, _x1, _y1, color in segments if color == 255})
assert abs(print_ys[0] - (-15.2)) < 1e-6 # boundary sweep printed
def test_rectangular_spiral_layers_share_one_loop_family(tmp_path) -> None:
from gcode_viewer import parse_gcode_path
# Layers with different footprints must walk the SAME frame-anchored
# rectangles — a smaller layer used to spiral at its own inset, leaving
# its walls visibly out of line with the rest of the print.
big = box(0.0, 0.0, 20.0, 20.0)
small = box(5.0, 5.0, 15.0, 15.0)
gcode_path = generate_vector_gcode(
_stack(big, small),
shape_name="loop_family",
pressure=25,
valve=7,
port=3,
fil_width=0.8,
layer_height=1.0,
raster_pattern=RASTER_PATTERN_RECTANGULAR_SPIRAL,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
parsed = parse_gcode_path(gcode_path.read_text())
origin_x, origin_y = origin_sink["path_origin"]
# Loop side lines = x positions of VERTICAL runs (valve-split points
# and the start stub sit mid-edge and are not loop lines).
per_layer_xs: dict[int, set] = {}
for kind in ("print_segments", "travel_segments"):
for segment in parsed[kind]:
for a, b in zip(segment, segment[1:]):
if abs(a[0] - b[0]) < 1e-9 and abs(a[1] - b[1]) > 1e-6:
per_layer_xs.setdefault(int(round(a[2])), set()).add(
round(a[0] + origin_x, 3)
)
layer0 = per_layer_xs[0]
stray = {x for x in per_layer_xs[1] if x not in layer0}
assert not stray, stray
def test_circle_spiral_interior_is_stepped_rings(tmp_path) -> None:
from gcode_viewer import parse_gcode_path
# The fill is concentric CONSTANT-RADIUS rings (wall at the material
# edge, interior rings on the global grid) stepping inward by one fil
# per revolution - not a continuously decreasing spiral.
disc = Point(5.0, 5.0).buffer(5.0, quad_segs=64)
gcode_path = generate_vector_gcode(
_stack(disc, disc),
shape_name="stepped",
pressure=25,
valve=7,
port=3,
fil_width=0.8,
layer_height=1.0,
raster_pattern=RASTER_PATTERN_CIRCLE_SPIRAL,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
parsed = parse_gcode_path(gcode_path.read_text())
origin_x, origin_y = origin_sink["path_origin"]
radii = sorted({
round(math.hypot(x + origin_x - 5.0, y + origin_y - 5.0), 1)
for seg in parsed["print_segments"]
for x, y, z in seg
if abs(z) < 0.5
})
# A handful of discrete radii: the wall (4.6) plus grid rings.
assert len(radii) <= 8, radii
assert abs(radii[-1] - (5.0 - 0.4)) < 0.05 # wall hugs the material edge
for radius in radii[:-1]:
ring = radius / 0.8 - 0.5
assert abs(ring - round(ring)) < 0.15 # interior rings on the grid
def test_parallel_circle_keeps_a_complete_outer_ring(tmp_path) -> None:
from gcode_viewer import parse_gcode_path
# Under shared reference motion the ring set used to come from the
# UNION only: the grid ring nearest a circle's boundary grazed it and
# printed spotty specks (dimensions on the grid) or a half circle
# (off-grid dimensions). Every shape's own wall now joins the shared
# ring set and grazing rings are suppressed per shape.
for diameter in (20.0, 20.5):
disc_layer = Point(diameter / 2.0, diameter / 2.0).buffer(diameter / 2.0, quad_segs=64)
square_layer = box(0.0, 0.0, 20.0, 20.0)
disc = _stack(disc_layer, name=f"disc{int(diameter * 10)}")
square = _stack(square_layer, name=f"square{int(diameter * 10)}")
reference = build_reference_stack([disc, square], grid=0.8)
wall_sources = [disc, square]
lengths = []
for stack in (disc, square):
gcode_path = generate_vector_gcode(
stack,
shape_name=stack.name + "_p",
pressure=25,
valve=7,
port=3,
fil_width=0.8,
layer_height=1.0,
raster_pattern=RASTER_PATTERN_CIRCLE_SPIRAL,
motion=reference,
wall_sources=wall_sources,
origin_sink=(origin_sink := {}),
output_dir=tmp_path,
)
parsed = parse_gcode_path(gcode_path.read_text())
lengths.append(
round(
sum(
math.dist(a[:2], b[:2])
for kind in ("print_segments", "travel_segments")
for seg in parsed[kind]
for a, b in zip(seg, seg[1:])
),
6,
)
)
if stack is not disc:
continue
origin_x, origin_y = origin_sink["path_origin"]
center = diameter / 2.0
per_ring: dict[float, dict[str, float]] = {}
for kind, key in (("print_segments", "p"), ("travel_segments", "t")):
for seg in parsed[kind]:
for a, b in zip(seg, seg[1:]):
radius = round(
math.hypot(
(a[0] + b[0]) / 2 + origin_x - center,
(a[1] + b[1]) / 2 + origin_y - center,
),
1,
)
per_ring.setdefault(radius, {"p": 0.0, "t": 0.0})[key] += math.dist(a[:2], b[:2])
printed = [r for r, v in per_ring.items() if v["p"] > 1.0]
outer = max(printed)
v = per_ring[outer]
# The disc's outermost ring is COMPLETE (no spotty/half arcs).
assert v["p"] / (v["p"] + v["t"]) > 0.98, (diameter, outer, v)
# It sits within one bead-and-a-bit of the radius (always the
# outermost GRID ring inside the material, so spacing stays
# uniform - no "too close" pairs, no skipped lines).
assert diameter / 2.0 - outer <= 0.8 + 1e-6, (diameter, outer)
spacings = {
round(a - b, 3)
for a, b in zip(sorted(printed, reverse=True), sorted(printed, reverse=True)[1:])
}
assert spacings <= {0.8}, (diameter, spacings)
# Parallel sync: same path length (tolerance = 6-decimal G-code
# rounding; moves split at different valve boundaries per shape).
assert abs(lengths[0] - lengths[1]) < 1e-3, lengths
def test_parallel_circle_spiral_fills_square_corners(tmp_path) -> None:
from shapely.geometry import LineString
from shapely.ops import unary_union
from gcode_viewer import parse_gcode_path
# Regression: the graze-suppression used to silence the ring just above
# a shape's inscribed radius — for squares/triangles that ring carries
# REAL corner fill, leaving crescent voids in the middle of the shape.
square_layer = box(0.0, 0.0, 20.0, 20.0)
disc_layer = Point(10.0, 10.0).buffer(10.0, quad_segs=64)
square = _stack(square_layer, name="sq_void")
disc = _stack(disc_layer, name="disc_void")
reference = build_reference_stack([square, disc], grid=0.8)
sink: dict = {}
gcode_path = generate_vector_gcode(
square,
shape_name="sq_void_p",
pressure=25,
valve=7,
port=3,
fil_width=0.8,
layer_height=1.0,
raster_pattern=RASTER_PATTERN_CIRCLE_SPIRAL,
motion=reference,
wall_sources=[square, disc],
origin_sink=sink,
output_dir=tmp_path,
)
parsed = parse_gcode_path(gcode_path.read_text())
origin_x, origin_y = sink["path_origin"]
lines = [
LineString([(x + origin_x, y + origin_y) for x, y, _z in seg])
for seg in parsed["print_segments"]
if len(seg) >= 2
]
covered = unary_union([line.buffer(0.4, cap_style=2) for line in lines])
uncovered = square_layer.difference(covered)
pockets = list(getattr(uncovered, "geoms", [uncovered]))
biggest = max((pocket.area for pocket in pockets), default=0.0)
# No crescent voids: every uncovered pocket is a sub-bead sliver.
assert biggest < 1.5, biggest
assert uncovered.area / square_layer.area < 0.05
|