@tscircuit/schematic-trace-solver 0.0.48 → 0.0.49

package/dist/index.js

@@ -271,19 +271,19 @@ var doesPairCrossRestrictedCenterLines = (params) => {
     chipMap
   });
   if (restrictedCenterLines.size === 0) return false;
-  const EPS5 = 1e-9;
+  const EPS6 = 1e-9;
   const crossesSegment = (a, b) => {
     for (const [, rcl] of restrictedCenterLines) {
       if (rcl.axes.has("x") && typeof rcl.x === "number") {
-        if ((a.x - rcl.x) * (b.x - rcl.x) < -EPS5) return true;
+        if ((a.x - rcl.x) * (b.x - rcl.x) < -EPS6) return true;
       }
       if (rcl.axes.has("y") && typeof rcl.y === "number") {
-        if ((a.y - rcl.y) * (b.y - rcl.y) < -EPS5) return true;
+        if ((a.y - rcl.y) * (b.y - rcl.y) < -EPS6) return true;
       }
     }
     return false;
   };
-  if (Math.abs(p1.x - p2.x) < EPS5 || Math.abs(p1.y - p2.y) < EPS5) {
+  if (Math.abs(p1.x - p2.x) < EPS6 || Math.abs(p1.y - p2.y) < EPS6) {
     return crossesSegment({ x: p1.x, y: p1.y }, { x: p2.x, y: p2.y });
   }
   const elbowHV = { x: p2.x, y: p1.y };
@@ -810,8 +810,8 @@ var SchematicTraceSingleLineSolver2 = class extends BaseSolver {
     if (!collision) {
       const first = path[0];
       const last = path[path.length - 1];
-      const EPS5 = 1e-9;
-      const samePoint = (p, q) => Math.abs(p.x - q.x) < EPS5 && Math.abs(p.y - q.y) < EPS5;
+      const EPS6 = 1e-9;
+      const samePoint = (p, q) => Math.abs(p.x - q.x) < EPS6 && Math.abs(p.y - q.y) < EPS6;
       if (samePoint(first, { x: PA.x, y: PA.y }) && samePoint(last, { x: PB.x, y: PB.y })) {
         this.solvedTracePath = path;
         this.solved = true;
@@ -1010,13 +1010,13 @@ var applyJogToTerminalSegment = ({
   segmentIndex: si,
   offset,
   JOG_SIZE,
-  EPS: EPS5 = 1e-6
+  EPS: EPS6 = 1e-6
 }) => {
   if (si !== 0 && si !== pts.length - 2) return;
   const start = pts[si];
   const end = pts[si + 1];
-  const isVertical3 = Math.abs(start.x - end.x) < EPS5;
-  const isHorizontal2 = Math.abs(start.y - end.y) < EPS5;
+  const isVertical3 = Math.abs(start.x - end.x) < EPS6;
+  const isHorizontal2 = Math.abs(start.y - end.y) < EPS6;
   if (!isVertical3 && !isHorizontal2) return;
   const segDir = isVertical3 ? end.y > start.y ? 1 : -1 : end.x > start.x ? 1 : -1;
   if (si === 0) {
@@ -1083,13 +1083,13 @@ var TraceOverlapIssueSolver = class extends BaseSolver {
     }
   }
   _step() {
-    const EPS5 = 1e-6;
+    const EPS6 = 1e-6;
     const offsets = this.overlappingTraceSegments.map((_, idx) => {
       const n = Math.floor(idx / 2) + 1;
       const signed = idx % 2 === 0 ? -n : n;
       return signed * this.SHIFT_DISTANCE;
     });
-    const eq = (a, b) => Math.abs(a - b) < EPS5;
+    const eq = (a, b) => Math.abs(a - b) < EPS6;
     const samePoint = (p, q) => !!p && !!q && eq(p.x, q.x) && eq(p.y, q.y);
     this.overlappingTraceSegments.forEach((group, gidx) => {
       const offset = offsets[gidx];
@@ -1115,13 +1115,13 @@ var TraceOverlapIssueSolver = class extends BaseSolver {
               segmentIndex: si,
               offset,
               JOG_SIZE,
-              EPS: EPS5
+              EPS: EPS6
             });
           } else {
             const start = pts[si];
             const end = pts[si + 1];
-            const isVertical3 = Math.abs(start.x - end.x) < EPS5;
-            const isHorizontal2 = Math.abs(start.y - end.y) < EPS5;
+            const isVertical3 = Math.abs(start.x - end.x) < EPS6;
+            const isHorizontal2 = Math.abs(start.y - end.y) < EPS6;
             if (!isVertical3 && !isHorizontal2) continue;
             if (isVertical3) {
               start.x += offset;
@@ -1218,7 +1218,7 @@ var TraceOverlapShiftSolver = class extends BaseSolver {
     return islands;
   }
   findNextOverlapIssue() {
-    const EPS5 = 2e-3;
+    const EPS6 = 2e-3;
     const netIds = Object.keys(this.traceNetIslands);
     for (let i = 0; i < netIds.length; i++) {
       for (let j = i + 1; j < netIds.length; j++) {
@@ -1236,7 +1236,7 @@ var TraceOverlapShiftSolver = class extends BaseSolver {
           const minB = Math.min(b1, b2);
           const maxB = Math.max(b1, b2);
           const overlap = Math.min(maxA, maxB) - Math.max(minA, minB);
-          return overlap > EPS5;
+          return overlap > EPS6;
         };
         for (let pa = 0; pa < pathsA.length; pa++) {
           const pathA = pathsA[pa];
@@ -1244,8 +1244,8 @@ var TraceOverlapShiftSolver = class extends BaseSolver {
           for (let sa = 0; sa < ptsA.length - 1; sa++) {
             const a1 = ptsA[sa];
             const a2 = ptsA[sa + 1];
-            const aVert = Math.abs(a1.x - a2.x) < EPS5;
-            const aHorz = Math.abs(a1.y - a2.y) < EPS5;
+            const aVert = Math.abs(a1.x - a2.x) < EPS6;
+            const aHorz = Math.abs(a1.y - a2.y) < EPS6;
             if (!aVert && !aHorz) continue;
             for (let pb = 0; pb < pathsB.length; pb++) {
               const pathB = pathsB[pb];
@@ -1253,11 +1253,11 @@ var TraceOverlapShiftSolver = class extends BaseSolver {
               for (let sb = 0; sb < ptsB.length - 1; sb++) {
                 const b1 = ptsB[sb];
                 const b2 = ptsB[sb + 1];
-                const bVert = Math.abs(b1.x - b2.x) < EPS5;
-                const bHorz = Math.abs(b1.y - b2.y) < EPS5;
+                const bVert = Math.abs(b1.x - b2.x) < EPS6;
+                const bHorz = Math.abs(b1.y - b2.y) < EPS6;
                 if (!bVert && !bHorz) continue;
                 if (aVert && bVert) {
-                  if (Math.abs(a1.x - b1.x) < EPS5) {
+                  if (Math.abs(a1.x - b1.x) < EPS6) {
                     if (overlaps1D(a1.y, a2.y, b1.y, b2.y)) {
                       const keyA = `${pa}:${sa}`;
                       const keyB = `${pb}:${sb}`;
@@ -1278,7 +1278,7 @@ var TraceOverlapShiftSolver = class extends BaseSolver {
                     }
                   }
                 } else if (aHorz && bHorz) {
-                  if (Math.abs(a1.y - b1.y) < EPS5) {
+                  if (Math.abs(a1.y - b1.y) < EPS6) {
                     if (overlaps1D(a1.x, a2.x, b1.x, b2.x)) {
                       const keyA = `${pa}:${sa}`;
                       const keyB = `${pb}:${sb}`;
@@ -1316,14 +1316,14 @@ var TraceOverlapShiftSolver = class extends BaseSolver {
     return null;
   }
   findNextDiagonalSegment() {
-    const EPS5 = 2e-3;
+    const EPS6 = 2e-3;
     for (const mspPairId in this.correctedTraceMap) {
       const tracePath = this.correctedTraceMap[mspPairId].tracePath;
       for (let i = 0; i < tracePath.length - 1; i++) {
         const p1 = tracePath[i];
         const p2 = tracePath[i + 1];
-        const isHorizontal2 = Math.abs(p1.y - p2.y) < EPS5;
-        const isVertical3 = Math.abs(p1.x - p2.x) < EPS5;
+        const isHorizontal2 = Math.abs(p1.y - p2.y) < EPS6;
+        const isVertical3 = Math.abs(p1.x - p2.x) < EPS6;
         if (!isHorizontal2 && !isVertical3) {
           return { mspPairId, tracePath, i, p1, p2 };
         }
@@ -1337,13 +1337,13 @@ var TraceOverlapShiftSolver = class extends BaseSolver {
       return false;
     }
     const { mspPairId, tracePath, i, p1, p2 } = diagonalInfo;
-    const EPS5 = 2e-3;
+    const EPS6 = 2e-3;
     const p0 = i > 0 ? tracePath[i - 1] : null;
     const p3 = i + 2 < tracePath.length ? tracePath[i + 2] : null;
-    const prevIsVertical = p0 ? Math.abs(p0.x - p1.x) < EPS5 : false;
-    const prevIsHorizontal = p0 ? Math.abs(p0.y - p1.y) < EPS5 : false;
-    const nextIsVertical = p3 ? Math.abs(p2.x - p3.x) < EPS5 : false;
-    const nextIsHorizontal = p3 ? Math.abs(p2.y - p3.y) < EPS5 : false;
+    const prevIsVertical = p0 ? Math.abs(p0.x - p1.x) < EPS6 : false;
+    const prevIsHorizontal = p0 ? Math.abs(p0.y - p1.y) < EPS6 : false;
+    const nextIsVertical = p3 ? Math.abs(p2.x - p3.x) < EPS6 : false;
+    const nextIsHorizontal = p3 ? Math.abs(p2.y - p3.y) < EPS6 : false;
     const elbow1 = { x: p1.x, y: p2.y };
     const elbow2 = { x: p2.x, y: p1.y };
     let score1 = 0;
@@ -1507,24 +1507,24 @@ function getRectBounds(center, w, h) {
 }
 
 // lib/solvers/NetLabelPlacementSolver/SingleNetLabelPlacementSolver/collisions.ts
-function segmentIntersectsRect2(p1, p2, rect, EPS5 = 1e-9) {
-  const isVert = Math.abs(p1.x - p2.x) < EPS5;
-  const isHorz = Math.abs(p1.y - p2.y) < EPS5;
+function segmentIntersectsRect2(p1, p2, rect, EPS6 = 1e-9) {
+  const isVert = Math.abs(p1.x - p2.x) < EPS6;
+  const isHorz = Math.abs(p1.y - p2.y) < EPS6;
   if (!isVert && !isHorz) return false;
   if (isVert) {
     const x = p1.x;
-    if (x < rect.minX - EPS5 || x > rect.maxX + EPS5) return false;
+    if (x < rect.minX - EPS6 || x > rect.maxX + EPS6) return false;
     const segMinY = Math.min(p1.y, p2.y);
     const segMaxY = Math.max(p1.y, p2.y);
     const overlap = Math.min(segMaxY, rect.maxY) - Math.max(segMinY, rect.minY);
-    return overlap > EPS5;
+    return overlap > EPS6;
   } else {
     const y = p1.y;
-    if (y < rect.minY - EPS5 || y > rect.maxY + EPS5) return false;
+    if (y < rect.minY - EPS6 || y > rect.maxY + EPS6) return false;
     const segMinX = Math.min(p1.x, p2.x);
     const segMaxX = Math.max(p1.x, p2.x);
     const overlap = Math.min(segMaxX, rect.maxX) - Math.max(segMinX, rect.minX);
-    return overlap > EPS5;
+    return overlap > EPS6;
   }
 }
 function rectIntersectsAnyTrace(bounds, inputTraceMap, hostPathId, hostSegIndex) {
@@ -1902,14 +1902,14 @@ var SingleNetLabelPlacementSolver = class extends BaseSolver {
     };
     let bestCandidate = null;
     let bestScore = -Infinity;
-    const EPS5 = 1e-6;
+    const EPS6 = 1e-6;
     for (const curr of tracesToScan) {
       const pts = curr.tracePath.slice();
       for (let si = 0; si < pts.length - 1; si++) {
         const a = pts[si];
         const b = pts[si + 1];
-        const isH = Math.abs(a.y - b.y) < EPS5;
-        const isV = Math.abs(a.x - b.x) < EPS5;
+        const isH = Math.abs(a.y - b.y) < EPS6;
+        const isV = Math.abs(a.x - b.x) < EPS6;
         if (!isH && !isV) continue;
         const segmentAllowed = isH ? ["y+", "y-"] : ["x+", "x-"];
         const candidateOrients = orientations.filter(
@@ -2856,7 +2856,7 @@ var SingleOverlapSolver = class extends BaseSolver {
       paddingBuffer: effectivePadding
       // Use the calculated, larger padding
     });
-    const getPathLength = (pts) => {
+    const getPathLength2 = (pts) => {
       let len = 0;
       for (let i = 0; i < pts.length - 1; i++) {
         const dx = pts[i + 1].x - pts[i].x;
@@ -2866,7 +2866,7 @@ var SingleOverlapSolver = class extends BaseSolver {
       return len;
     };
     this.queuedCandidatePaths = candidates.sort(
-      (a, b) => getPathLength(a) - getPathLength(b)
+      (a, b) => getPathLength2(a) - getPathLength2(b)
     );
     this.obstacles = getObstacleRects(this.problem);
   }
@@ -4669,6 +4669,682 @@ var TraceCleanupSolver = class extends BaseSolver {
   }
 };
 
+// lib/solvers/Example28Solver/types.ts
+var EPS5 = 1e-9;
+
+// lib/solvers/Example28Solver/geometry.ts
+var getPathKey = (path) => path.map((point) => `${point.x},${point.y}`).join(";");
+var getPathLength = (path) => {
+  let length = 0;
+  for (let i = 0; i < path.length - 1; i++) {
+    length += Math.abs(path[i + 1].x - path[i].x) + Math.abs(path[i + 1].y - path[i].y);
+  }
+  return length;
+};
+var getDistance = (a, b) => Math.abs(a.x - b.x) + Math.abs(a.y - b.y);
+var isAxisAlignedSegment = (start, end) => Math.abs(start.x - end.x) < EPS5 || Math.abs(start.y - end.y) < EPS5;
+var getSegmentOrientation = (start, end) => Math.abs(start.y - end.y) < EPS5 ? "horizontal" : "vertical";
+var projectPointToSegment = (point, start, end) => {
+  if (Math.abs(start.x - end.x) < EPS5) {
+    return {
+      x: start.x,
+      y: Math.min(
+        Math.max(point.y, Math.min(start.y, end.y)),
+        Math.max(start.y, end.y)
+      )
+    };
+  }
+  if (Math.abs(start.y - end.y) < EPS5) {
+    return {
+      x: Math.min(
+        Math.max(point.x, Math.min(start.x, end.x)),
+        Math.max(start.x, end.x)
+      ),
+      y: start.y
+    };
+  }
+  return start;
+};
+var getPointToSegmentDistance = (point, start, end) => getDistance(point, projectPointToSegment(point, start, end));
+var getSegments = (path) => {
+  const segments = [];
+  for (let i = 0; i < path.length - 1; i++) {
+    const start = path[i];
+    const end = path[i + 1];
+    if (!isAxisAlignedSegment(start, end)) continue;
+    segments.push({
+      start,
+      end,
+      orientation: getSegmentOrientation(start, end)
+    });
+  }
+  return segments;
+};
+var findSegmentContainingPoint = (path, point) => {
+  for (let i = 0; i < path.length - 1; i++) {
+    const start = path[i];
+    const end = path[i + 1];
+    if (!isAxisAlignedSegment(start, end)) continue;
+    if (getPointToSegmentDistance(point, start, end) > 1e-6) continue;
+    return {
+      index: i,
+      start,
+      end,
+      orientation: getSegmentOrientation(start, end)
+    };
+  }
+  return null;
+};
+var isPointWithinSegmentPrimaryRange = (point, segment) => {
+  if (segment.orientation === "horizontal") {
+    return point.x >= Math.min(segment.start.x, segment.end.x) - EPS5 && point.x <= Math.max(segment.start.x, segment.end.x) + EPS5;
+  }
+  return point.y >= Math.min(segment.start.y, segment.end.y) - EPS5 && point.y <= Math.max(segment.start.y, segment.end.y) + EPS5;
+};
+var findPreferredReroutedSegment = (path, originalSegmentIndex, originalSegmentCount, orientation, anchorPoint) => {
+  const matchingSegments = getSegments(path).filter(
+    (segment) => segment.orientation === orientation
+  );
+  if (matchingSegments.length === 0) return null;
+  const containingSegments = matchingSegments.filter(
+    (segment) => isPointWithinSegmentPrimaryRange(anchorPoint, segment)
+  );
+  const candidateSegments = containingSegments.length > 0 ? containingSegments : matchingSegments;
+  const isNearStart = originalSegmentIndex < originalSegmentCount / 2;
+  return isNearStart ? candidateSegments[0] : candidateSegments[candidateSegments.length - 1];
+};
+var projectPointToPath = (point, path) => {
+  let bestPoint = null;
+  let bestDistance = Number.POSITIVE_INFINITY;
+  for (let i = 0; i < path.length - 1; i++) {
+    const projectedPoint = projectPointToSegment(point, path[i], path[i + 1]);
+    const distance3 = getDistance(point, projectedPoint);
+    if (distance3 < bestDistance) {
+      bestPoint = projectedPoint;
+      bestDistance = distance3;
+    }
+  }
+  return bestPoint;
+};
+var segmentsIntersect = (a1, a2, b1, b2) => {
+  const aVertical = Math.abs(a1.x - a2.x) < EPS5;
+  const bVertical = Math.abs(b1.x - b2.x) < EPS5;
+  const between = (value, p1, p2) => value >= Math.min(p1, p2) - EPS5 && value <= Math.max(p1, p2) + EPS5;
+  if (aVertical && bVertical) {
+    if (Math.abs(a1.x - b1.x) > EPS5) return false;
+    const overlap = Math.min(Math.max(a1.y, a2.y), Math.max(b1.y, b2.y)) - Math.max(Math.min(a1.y, a2.y), Math.min(b1.y, b2.y));
+    return overlap > EPS5;
+  }
+  if (!aVertical && !bVertical) {
+    if (Math.abs(a1.y - b1.y) > EPS5) return false;
+    const overlap = Math.min(Math.max(a1.x, a2.x), Math.max(b1.x, b2.x)) - Math.max(Math.min(a1.x, a2.x), Math.min(b1.x, b2.x));
+    return overlap > EPS5;
+  }
+  const verticalA = aVertical ? a1 : b1;
+  const verticalB = aVertical ? a2 : b2;
+  const horizontalA = aVertical ? b1 : a1;
+  const horizontalB = aVertical ? b2 : a2;
+  return between(verticalA.x, horizontalA.x, horizontalB.x) && between(horizontalA.y, verticalA.y, verticalB.y);
+};
+var countPathIntersections = (pathA, pathB) => {
+  let count = 0;
+  for (let i = 0; i < pathA.length - 1; i++) {
+    for (let j = 0; j < pathB.length - 1; j++) {
+      if (segmentsIntersect(pathA[i], pathA[i + 1], pathB[j], pathB[j + 1])) {
+        count++;
+      }
+    }
+  }
+  return count;
+};
+var isPathCollidingWithChipInterior = (path, chipObstacles) => {
+  for (let i = 0; i < path.length - 1; i++) {
+    const start = path[i];
+    const end = path[i + 1];
+    for (const obstacle of chipObstacles) {
+      if (!segmentIntersectsRect(start, end, obstacle)) continue;
+      if (segmentRunsAlongRectBoundary(start, end, obstacle)) continue;
+      return true;
+    }
+  }
+  return false;
+};
+var segmentRunsAlongRectBoundary = (start, end, rect) => {
+  const isVertical3 = Math.abs(start.x - end.x) < EPS5;
+  const isHorizontal2 = Math.abs(start.y - end.y) < EPS5;
+  if (isVertical3) {
+    return Math.abs(start.x - rect.minX) < EPS5 || Math.abs(start.x - rect.maxX) < EPS5;
+  }
+  if (isHorizontal2) {
+    return Math.abs(start.y - rect.minY) < EPS5 || Math.abs(start.y - rect.maxY) < EPS5;
+  }
+  return false;
+};
+
+// lib/solvers/Example28Solver/labelMovement.ts
+var moveAttachedLabelsToReroutedTrace = ({
+  trace,
+  originalTracePath,
+  reroutedTracePath,
+  netLabelPlacements
+}) => netLabelPlacements.map((label) => {
+  if (!isLabelAttachedToTrace(label, trace)) return label;
+  const movedAnchorPoint = getMovedAnchorPointForReroute(
+    label.anchorPoint,
+    originalTracePath,
+    reroutedTracePath
+  );
+  if (!movedAnchorPoint) return label;
+  const delta = {
+    x: movedAnchorPoint.x - label.anchorPoint.x,
+    y: movedAnchorPoint.y - label.anchorPoint.y
+  };
+  return {
+    ...label,
+    anchorPoint: movedAnchorPoint,
+    center: {
+      x: label.center.x + delta.x,
+      y: label.center.y + delta.y
+    }
+  };
+});
+var isLabelAttachedToTrace = (label, trace) => label.globalConnNetId === trace.globalConnNetId || label.mspConnectionPairIds.includes(trace.mspPairId);
+var getMovedAnchorPointForReroute = (anchorPoint, originalTracePath, reroutedTracePath) => {
+  const originalSegment = findSegmentContainingPoint(
+    originalTracePath,
+    anchorPoint
+  );
+  if (!originalSegment) return null;
+  const preferredSegment = findPreferredReroutedSegment(
+    reroutedTracePath,
+    originalSegment.index,
+    originalTracePath.length - 1,
+    originalSegment.orientation,
+    anchorPoint
+  );
+  if (!preferredSegment) {
+    return projectPointToPath(anchorPoint, reroutedTracePath);
+  }
+  return projectPointToSegment(
+    anchorPoint,
+    preferredSegment.start,
+    preferredSegment.end
+  );
+};
+
+// lib/utils/dir.ts
+var dir = (facingDirection) => {
+  switch (facingDirection) {
+    case "x+":
+      return { x: 1, y: 0 };
+    case "x-":
+      return { x: -1, y: 0 };
+    case "y+":
+      return { x: 0, y: 1 };
+    case "y-":
+      return { x: 0, y: -1 };
+  }
+  throw new Error(`Invalid facing direction: ${facingDirection}`);
+};
+
+// lib/solvers/Example28Solver/reroute.ts
+var LABEL_SIDE_CLEARANCE = 0.1;
+var LABEL_HUG_CLEARANCE = 1e-3;
+var findBestReroutePath = ({
+  trace,
+  obstacleLabel,
+  inputProblem,
+  outputTraces,
+  outputNetLabelPlacements,
+  chipObstacles
+}) => {
+  const candidateResults = generateRerouteCandidateResults({
+    trace,
+    label: obstacleLabel,
+    inputProblem,
+    outputTraces,
+    outputNetLabelPlacements,
+    chipObstacles
+  });
+  const bestPath = selectBestReroutePath({
+    trace,
+    obstacleLabel,
+    outputTraces,
+    outputNetLabelPlacements,
+    candidateResults
+  });
+  markSelectedCandidate(candidateResults, bestPath);
+  return { bestPath, candidateResults };
+};
+var generateRerouteCandidateResults = ({
+  trace,
+  label,
+  inputProblem,
+  outputTraces,
+  outputNetLabelPlacements,
+  chipObstacles
+}) => {
+  const rawCandidates = generateCandidatePaths(trace, label, inputProblem);
+  const seen = /* @__PURE__ */ new Set();
+  const candidateResults = [];
+  for (const rawCandidate of rawCandidates) {
+    candidateResults.push(
+      createCandidateResult({
+        trace,
+        obstacleLabel: label,
+        path: simplifyPath(rawCandidate),
+        seen,
+        outputTraces,
+        outputNetLabelPlacements,
+        chipObstacles
+      })
+    );
+  }
+  return candidateResults;
+};
+var generateCandidatePaths = (trace, label, inputProblem) => [
+  ...generateLabelHugCandidates(trace, label),
+  ...generateRerouteCandidates({
+    trace,
+    label,
+    problem: inputProblem,
+    paddingBuffer: LABEL_SIDE_CLEARANCE,
+    detourCount: 0
+  }),
+  ...generateEndpointDetourCandidates(trace, label)
+];
+var createCandidateResult = ({
+  trace,
+  obstacleLabel,
+  path,
+  seen,
+  outputTraces,
+  outputNetLabelPlacements,
+  chipObstacles
+}) => {
+  const key = getPathKey(path);
+  if (seen.has(key)) {
+    return {
+      path,
+      status: "duplicate",
+      selected: false
+    };
+  }
+  seen.add(key);
+  if (isPathCollidingWithChipInterior(path, chipObstacles)) {
+    return {
+      path,
+      status: "chip-collision",
+      selected: false
+    };
+  }
+  return {
+    path,
+    score: scoreTracePath({
+      trace,
+      tracePath: path,
+      obstacleLabel,
+      outputTraces,
+      outputNetLabelPlacements
+    }),
+    status: "valid",
+    selected: false
+  };
+};
+var generateEndpointDetourCandidates = (trace, label) => {
+  const start = trace.tracePath[0];
+  const end = trace.tracePath[trace.tracePath.length - 1];
+  if (!start || !end) return [];
+  const bounds = getRectBounds(label.center, label.width, label.height);
+  const padding = LABEL_SIDE_CLEARANCE;
+  const labelDirection = dir(label.orientation);
+  const labelSideX = labelDirection.x < 0 ? bounds.minX - padding : bounds.maxX + padding;
+  const oppositeSideX = labelDirection.x < 0 ? bounds.maxX + padding : bounds.minX - padding;
+  const topY = bounds.maxY + padding;
+  const bottomY = bounds.minY - padding;
+  const candidates = [];
+  for (const sideX of [labelSideX, oppositeSideX]) {
+    candidates.push(
+      [
+        start,
+        { x: start.x, y: topY },
+        { x: sideX, y: topY },
+        { x: sideX, y: bottomY },
+        { x: end.x, y: bottomY },
+        end
+      ],
+      [
+        start,
+        { x: start.x, y: bottomY },
+        { x: sideX, y: bottomY },
+        { x: sideX, y: topY },
+        { x: end.x, y: topY },
+        end
+      ]
+    );
+  }
+  return candidates;
+};
+var generateLabelHugCandidates = (trace, label) => {
+  const start = trace.tracePath[0];
+  const end = trace.tracePath[trace.tracePath.length - 1];
+  if (!start || !end) return [];
+  const labelDirection = dir(label.orientation);
+  if (labelDirection.x === 0) return [];
+  const bounds = getRectBounds(label.center, label.width, label.height);
+  const sideX = labelDirection.x < 0 ? bounds.minX - LABEL_SIDE_CLEARANCE : bounds.maxX + LABEL_SIDE_CLEARANCE;
+  const topY = bounds.maxY + LABEL_HUG_CLEARANCE;
+  const bottomY = bounds.minY - LABEL_HUG_CLEARANCE;
+  const startsAboveEnd = start.y >= end.y;
+  const firstY = startsAboveEnd ? topY : bottomY;
+  const secondY = startsAboveEnd ? bottomY : topY;
+  return [
+    [
+      start,
+      { x: start.x, y: firstY },
+      { x: sideX, y: firstY },
+      { x: sideX, y: secondY },
+      { x: end.x, y: secondY },
+      end
+    ],
+    [
+      start,
+      { x: start.x, y: secondY },
+      { x: sideX, y: secondY },
+      { x: sideX, y: firstY },
+      { x: end.x, y: firstY },
+      end
+    ]
+  ];
+};
+var selectBestReroutePath = ({
+  trace,
+  obstacleLabel,
+  outputTraces,
+  outputNetLabelPlacements,
+  candidateResults
+}) => {
+  let bestPath = null;
+  let bestScore = scoreTracePath({
+    trace,
+    tracePath: trace.tracePath,
+    obstacleLabel,
+    outputTraces,
+    outputNetLabelPlacements
+  });
+  for (const candidate of candidateResults) {
+    if (candidate.status !== "valid" || !candidate.score) continue;
+    if (!isBetterScore(candidate.score, bestScore)) continue;
+    bestScore = candidate.score;
+    bestPath = candidate.path;
+  }
+  return bestPath;
+};
+var markSelectedCandidate = (candidateResults, bestPath) => {
+  if (!bestPath) return;
+  for (const candidate of candidateResults) {
+    candidate.selected = candidate.path === bestPath;
+  }
+};
+var scoreTracePath = ({
+  trace,
+  tracePath,
+  obstacleLabel,
+  outputTraces,
+  outputNetLabelPlacements
+}) => {
+  const candidateTrace = { ...trace, tracePath };
+  return {
+    labelIntersections: detectTraceLabelOverlap({
+      traces: [candidateTrace],
+      netLabels: outputNetLabelPlacements
+    }).length,
+    labelHugDistance: getLabelHugDistance(tracePath, obstacleLabel),
+    traceIntersections: countTraceIntersections(candidateTrace, outputTraces),
+    pathLength: getPathLength(tracePath)
+  };
+};
+var countTraceIntersections = (trace, outputTraces) => {
+  let count = 0;
+  for (const otherTrace of outputTraces) {
+    if (otherTrace.mspPairId === trace.mspPairId) continue;
+    count += countPathIntersections(trace.tracePath, otherTrace.tracePath);
+  }
+  return count;
+};
+var isBetterScore = (score, bestScore) => {
+  if (score.labelIntersections !== bestScore.labelIntersections) {
+    return score.labelIntersections < bestScore.labelIntersections;
+  }
+  if (score.labelHugDistance !== bestScore.labelHugDistance) {
+    return score.labelHugDistance < bestScore.labelHugDistance;
+  }
+  if (score.traceIntersections !== bestScore.traceIntersections) {
+    return score.traceIntersections < bestScore.traceIntersections;
+  }
+  return score.pathLength < bestScore.pathLength;
+};
+var getLabelHugDistance = (tracePath, obstacleLabel) => {
+  const bounds = getRectBounds(
+    obstacleLabel.center,
+    obstacleLabel.width,
+    obstacleLabel.height
+  );
+  let distance3 = 0;
+  for (const point of tracePath) {
+    distance3 += getPointDistanceFromRect(point, bounds);
+  }
+  return distance3;
+};
+var getPointDistanceFromRect = (point, rect) => {
+  const dx = Math.max(rect.minX - point.x, 0, point.x - rect.maxX);
+  const dy = Math.max(rect.minY - point.y, 0, point.y - rect.maxY);
+  return dx + dy;
+};
+
+// lib/solvers/Example28Solver/visualize.ts
+var CANDIDATE_SELECTED_COLOR = "blue";
+var CANDIDATE_REJECTED_COLOR = "red";
+var visualizeExample28Solver = (state) => {
+  const graphics = visualizeInputProblem(state.inputProblem);
+  drawTraces(graphics, state);
+  drawNetLabels(graphics, state);
+  if (!state.solved) {
+    drawCurrentCandidates(graphics, state.currentCandidateResults);
+    drawCurrentOverlap(graphics, state);
+  }
+  return graphics;
+};
+var drawTraces = (graphics, state) => {
+  for (const trace of state.outputTraces) {
+    graphics.lines.push({
+      points: trace.tracePath,
+      strokeColor: "purple"
+    });
+  }
+};
+var drawNetLabels = (graphics, state) => {
+  for (const label of state.outputNetLabelPlacements) {
+    const color = getColorFromString(label.globalConnNetId, 0.35);
+    graphics.rects.push({
+      center: label.center,
+      width: label.width,
+      height: label.height,
+      fill: color,
+      strokeColor: getColorFromString(label.globalConnNetId, 0.9),
+      label: `netId: ${label.netId}
+globalConnNetId: ${label.globalConnNetId}`
+    });
+    graphics.points.push({
+      ...label.anchorPoint,
+      color: getColorFromString(label.globalConnNetId, 0.9),
+      label: `anchorPoint
+orientation: ${label.orientation}`
+    });
+  }
+};
+var drawCurrentCandidates = (graphics, candidateResults) => {
+  for (const candidate of candidateResults) {
+    const scoreLabel = candidate.score ? `
+label intersections: ${candidate.score.labelIntersections}
+trace intersections: ${candidate.score.traceIntersections}` : "";
+    graphics.lines.push({
+      points: candidate.path,
+      strokeColor: candidate.selected ? CANDIDATE_SELECTED_COLOR : CANDIDATE_REJECTED_COLOR,
+      strokeDash: candidate.selected ? void 0 : "4 2",
+      label: `${candidate.selected ? "selected" : candidate.status} reroute${scoreLabel}`
+    });
+  }
+};
+var drawCurrentOverlap = (graphics, state) => {
+  if (!state.currentOverlap) return;
+  const label = state.currentOverlap.label;
+  graphics.rects.push({
+    center: label.center,
+    width: label.width,
+    height: label.height,
+    fill: "rgba(255, 0, 0, 0.2)",
+    strokeColor: CANDIDATE_REJECTED_COLOR,
+    label: `overlap target
+${label.netId ?? label.globalConnNetId}`
+  });
+};
+
+// lib/solvers/Example28Solver/Example28Solver.ts
+var Example28Solver = class extends BaseSolver {
+  inputProblem;
+  traces;
+  netLabelPlacements;
+  outputTraces;
+  outputNetLabelPlacements;
+  queuedOverlaps = [];
+  currentOverlap = null;
+  currentCandidateResults = [];
+  chipObstacles;
+  constructor(params) {
+    super();
+    this.inputProblem = params.inputProblem;
+    this.traces = params.traces;
+    this.netLabelPlacements = params.netLabelPlacements;
+    this.outputTraces = [...params.traces];
+    this.outputNetLabelPlacements = [...params.netLabelPlacements];
+    this.chipObstacles = getObstacleRects(params.inputProblem);
+    this.initializeQueuedOverlaps();
+    this.currentOverlap = this.queuedOverlaps[0] ?? null;
+  }
+  getConstructorParams() {
+    return {
+      inputProblem: this.inputProblem,
+      traces: this.traces,
+      netLabelPlacements: this.netLabelPlacements
+    };
+  }
+  _step() {
+    const overlap = this.queuedOverlaps.shift();
+    if (!overlap) {
+      this.finish();
+      return;
+    }
+    if (!this.isOverlapStillPresent(overlap)) {
+      this.currentOverlap = overlap;
+      this.currentCandidateResults = [];
+      return;
+    }
+    this.rerouteOverlappingTrace(overlap);
+  }
+  finish() {
+    this.currentOverlap = null;
+    this.currentCandidateResults = [];
+    this.solved = true;
+  }
+  initializeQueuedOverlaps() {
+    const queuedOverlaps = [];
+    const seenPairs = /* @__PURE__ */ new Set();
+    for (const overlap of this.getTraceLabelOverlaps()) {
+      if (!this.shouldRerouteOverlap(overlap)) continue;
+      const key = this.getOverlapKey(overlap);
+      if (seenPairs.has(key)) continue;
+      seenPairs.add(key);
+      queuedOverlaps.push(overlap);
+    }
+    this.queuedOverlaps = queuedOverlaps;
+  }
+  getTraceLabelOverlaps() {
+    return detectTraceLabelOverlap({
+      traces: this.outputTraces,
+      netLabels: this.outputNetLabelPlacements
+    });
+  }
+  shouldRerouteOverlap(overlap) {
+    return this.isXFacingLabel(overlap.label) && !this.hasExplicitOrientationConstraint(overlap.label);
+  }
+  isXFacingLabel(label) {
+    return label.orientation === "x+" || label.orientation === "x-";
+  }
+  hasExplicitOrientationConstraint(label) {
+    const effectiveNetId = label.netId ?? label.globalConnNetId;
+    return Object.hasOwn(
+      this.inputProblem.availableNetLabelOrientations,
+      effectiveNetId
+    );
+  }
+  getOverlapKey(overlap) {
+    const labelNetId = overlap.label.netId ?? overlap.label.globalConnNetId;
+    return `${overlap.trace.mspPairId}:${labelNetId}:${overlap.label.anchorPoint.x}:${overlap.label.anchorPoint.y}`;
+  }
+  isOverlapStillPresent(overlap) {
+    const currentTrace = this.getCurrentTrace(overlap.trace);
+    if (!currentTrace) return false;
+    return detectTraceLabelOverlap({
+      traces: [currentTrace],
+      netLabels: [overlap.label]
+    }).length > 0;
+  }
+  getCurrentTrace(trace) {
+    return this.outputTraces.find((t) => t.mspPairId === trace.mspPairId);
+  }
+  rerouteOverlappingTrace(overlap) {
+    this.currentOverlap = overlap;
+    this.currentCandidateResults = [];
+    const traceIndex = this.outputTraces.findIndex(
+      (trace) => trace.mspPairId === overlap.trace.mspPairId
+    );
+    if (traceIndex === -1) return;
+    const currentTrace = this.outputTraces[traceIndex];
+    const rerouteResult = findBestReroutePath({
+      trace: currentTrace,
+      obstacleLabel: overlap.label,
+      inputProblem: this.inputProblem,
+      outputTraces: this.outputTraces,
+      outputNetLabelPlacements: this.outputNetLabelPlacements,
+      chipObstacles: this.chipObstacles
+    });
+    this.currentCandidateResults = rerouteResult.candidateResults;
+    if (!rerouteResult.bestPath) return;
+    const originalTracePath = currentTrace.tracePath;
+    this.outputTraces[traceIndex] = {
+      ...currentTrace,
+      tracePath: rerouteResult.bestPath
+    };
+    this.outputNetLabelPlacements = moveAttachedLabelsToReroutedTrace({
+      trace: currentTrace,
+      originalTracePath,
+      reroutedTracePath: rerouteResult.bestPath,
+      netLabelPlacements: this.outputNetLabelPlacements
+    });
+  }
+  visualize() {
+    return visualizeExample28Solver({
+      inputProblem: this.inputProblem,
+      outputTraces: this.outputTraces,
+      outputNetLabelPlacements: this.outputNetLabelPlacements,
+      solved: this.solved,
+      currentOverlap: this.currentOverlap,
+      currentCandidateResults: this.currentCandidateResults
+    });
+  }
+};
+
 // lib/solvers/SchematicTracePipelineSolver/SchematicTracePipelineSolver.ts
 function definePipelineStep(solverName, solverClass, getConstructorParams, opts = {}) {
   return {
@@ -4689,6 +5365,7 @@ var SchematicTracePipelineSolver = class extends BaseSolver {
   labelMergingSolver;
   traceLabelOverlapAvoidanceSolver;
   traceCleanupSolver;
+  example28Solver;
   startTimeOfPhase;
   endTimeOfPhase;
   timeSpentOnPhase;
@@ -4824,7 +5501,17 @@ var SchematicTracePipelineSolver = class extends BaseSolver {
           }
         ];
       }
-    )
+    ),
+    definePipelineStep("example28Solver", Example28Solver, (instance) => {
+      const traces = instance.traceCleanupSolver?.getOutput().traces ?? instance.traceLabelOverlapAvoidanceSolver.getOutput().traces;
+      return [
+        {
+          inputProblem: instance.inputProblem,
+          traces,
+          netLabelPlacements: instance.netLabelPlacementSolver.netLabelPlacements
+        }
+      ];
+    })
   ];
   constructor(inputProblem) {
     super();