@rxflow/manhattan 0.0.1-alpha.0 → 0.0.1-alpha.10

package/cjs/utils/pathValidation.js

@@ -0,0 +1,130 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.pathIntersectsObstacles = pathIntersectsObstacles;
+var _geometry = require("../geometry");
+var _node = require("./node");
+/**
+ * Get node bounding box
+ */
+function getNodeBBox(nodeId, nodeLookup) {
+  const node = nodeLookup.get(nodeId);
+  if (!node) return null;
+  const dimensions = (0, _node.getNodeDimensions)(node);
+  const position = (0, _node.getNodePosition)(node);
+  return new _geometry.Rectangle(position.x, position.y, dimensions.width, dimensions.height);
+}
+
+/**
+ * Find unique intersection points between a line segment and a rectangle
+ * Returns array of intersection points (deduplicated)
+ */
+function findSegmentRectIntersections(p1, p2, rect) {
+  const intersections = [];
+  const tolerance = 0.01;
+
+  // Define rectangle edges
+  const edges = [{
+    start: new _geometry.Point(rect.x, rect.y),
+    end: new _geometry.Point(rect.x + rect.width, rect.y)
+  },
+  // Top
+  {
+    start: new _geometry.Point(rect.x + rect.width, rect.y),
+    end: new _geometry.Point(rect.x + rect.width, rect.y + rect.height)
+  },
+  // Right
+  {
+    start: new _geometry.Point(rect.x + rect.width, rect.y + rect.height),
+    end: new _geometry.Point(rect.x, rect.y + rect.height)
+  },
+  // Bottom
+  {
+    start: new _geometry.Point(rect.x, rect.y + rect.height),
+    end: new _geometry.Point(rect.x, rect.y)
+  } // Left
+  ];
+
+  // Find intersection point with each edge
+  for (const edge of edges) {
+    const intersection = getLineSegmentIntersection(p1, p2, edge.start, edge.end);
+    if (intersection) {
+      // Check if this point is already in the list (avoid duplicates at corners)
+      const isDuplicate = intersections.some(existing => Math.abs(existing.x - intersection.x) < tolerance && Math.abs(existing.y - intersection.y) < tolerance);
+      if (!isDuplicate) {
+        intersections.push(intersection);
+      }
+    }
+  }
+  return intersections;
+}
+
+/**
+ * Get intersection point between two line segments (if exists)
+ */
+function getLineSegmentIntersection(p1, p2, p3, p4) {
+  const d1 = direction(p3, p4, p1);
+  const d2 = direction(p3, p4, p2);
+  const d3 = direction(p1, p2, p3);
+  const d4 = direction(p1, p2, p4);
+  if ((d1 > 0 && d2 < 0 || d1 < 0 && d2 > 0) && (d3 > 0 && d4 < 0 || d3 < 0 && d4 > 0)) {
+    // Lines intersect, calculate intersection point
+    const t = ((p3.x - p1.x) * (p3.y - p4.y) - (p3.y - p1.y) * (p3.x - p4.x)) / ((p1.x - p2.x) * (p3.y - p4.y) - (p1.y - p2.y) * (p3.x - p4.x));
+    return new _geometry.Point(p1.x + t * (p2.x - p1.x), p1.y + t * (p2.y - p1.y));
+  }
+
+  // Check collinear cases
+  if (d1 === 0 && onSegment(p3, p1, p4)) return p1.clone();
+  if (d2 === 0 && onSegment(p3, p2, p4)) return p2.clone();
+  if (d3 === 0 && onSegment(p1, p3, p2)) return p3.clone();
+  if (d4 === 0 && onSegment(p1, p4, p2)) return p4.clone();
+  return null;
+}
+function direction(p1, p2, p3) {
+  return (p3.x - p1.x) * (p2.y - p1.y) - (p2.x - p1.x) * (p3.y - p1.y);
+}
+function onSegment(p1, p2, p3) {
+  return p2.x >= Math.min(p1.x, p3.x) && p2.x <= Math.max(p1.x, p3.x) && p2.y >= Math.min(p1.y, p3.y) && p2.y <= Math.max(p1.y, p3.y);
+}
+
+/**
+ * Check if a path intersects with any obstacles (nodes)
+ * A path is considered to intersect if it has >= 2 unique intersection points with a node
+ *
+ * Note: pathPoints should be pre-processed by parseSVGPath which samples bezier curves
+ * into line segments, so this function works correctly with curved paths
+ */
+function pathIntersectsObstacles(pathPoints, nodeLookup) {
+  const tolerance = 0.01;
+
+  // Iterate through all nodes (including source and target)
+  for (const [nodeId] of nodeLookup) {
+    const nodeBBox = getNodeBBox(nodeId, nodeLookup);
+    if (!nodeBBox) continue;
+    const allIntersections = [];
+
+    // Collect all unique intersection points for this node
+    for (let i = 0; i < pathPoints.length - 1; i++) {
+      const p1 = pathPoints[i];
+      const p2 = pathPoints[i + 1];
+      const segmentIntersections = findSegmentRectIntersections(p1, p2, nodeBBox);
+
+      // Add to global list, avoiding duplicates
+      for (const intersection of segmentIntersections) {
+        const isDuplicate = allIntersections.some(existing => Math.abs(existing.x - intersection.x) < tolerance && Math.abs(existing.y - intersection.y) < tolerance);
+        if (!isDuplicate) {
+          allIntersections.push(intersection);
+        }
+      }
+    }
+
+    // If path has 2 or more unique intersections with this node, it crosses through it
+    if (allIntersections.length >= 2) {
+      console.log(`[pathIntersectsObstacles] Path crosses node ${nodeId} with ${allIntersections.length} intersections`);
+      return true;
+    }
+  }
+  return false;
+}

package/esm/geometry/collision.d.ts

@@ -0,0 +1,15 @@
+import { Point } from './Point';
+import { Rectangle } from './Rectangle';
+/**
+ * Check if a line segment intersects with a rectangle
+ */
+export declare function lineSegmentIntersectsRect(p1: Point, p2: Point, rect: Rectangle): boolean;
+/**
+ * Check if a line segment crosses through a rectangle (not just touching edges)
+ */
+export declare function lineSegmentCrossesRect(p1: Point, p2: Point, rect: Rectangle): boolean;
+/**
+ * Check if two line segments intersect
+ */
+export declare function lineSegmentsIntersect(p1: Point, p2: Point, p3: Point, p4: Point): boolean;
+//# sourceMappingURL=collision.d.ts.map

package/esm/geometry/collision.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collision.d.ts","sourceRoot":"","sources":["../../src/geometry/collision.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAA;AAC/B,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AAEvC;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,GAAG,OAAO,CAwBxF;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,GAAG,OAAO,CAsBrF;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,GAAG,OAAO,CAgBzF"}

package/esm/geometry/collision.js

@@ -0,0 +1,73 @@
+import { Point } from "./Point";
+/**
+ * Check if a line segment intersects with a rectangle
+ */
+export function lineSegmentIntersectsRect(p1, p2, rect) {
+  // Check if either endpoint is inside the rectangle
+  if (rect.containsPoint(p1) || rect.containsPoint(p2)) {
+    return true;
+  }
+
+  // Check if line segment intersects any of the rectangle's edges
+  var rectPoints = [new Point(rect.x, rect.y), new Point(rect.x + rect.width, rect.y), new Point(rect.x + rect.width, rect.y + rect.height), new Point(rect.x, rect.y + rect.height)];
+  for (var i = 0; i < 4; i++) {
+    var r1 = rectPoints[i];
+    var r2 = rectPoints[(i + 1) % 4];
+    if (lineSegmentsIntersect(p1, p2, r1, r2)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+/**
+ * Check if a line segment crosses through a rectangle (not just touching edges)
+ */
+export function lineSegmentCrossesRect(p1, p2, rect) {
+  var tolerance = 1;
+
+  // Check if segment passes through the interior of the rectangle
+  // We sample points along the segment and check if any are strictly inside
+  var steps = 10;
+  for (var i = 1; i < steps; i++) {
+    var t = i / steps;
+    var x = p1.x + (p2.x - p1.x) * t;
+    var y = p1.y + (p2.y - p1.y) * t;
+    if (x > rect.x + tolerance && x < rect.x + rect.width - tolerance && y > rect.y + tolerance && y < rect.y + rect.height - tolerance) {
+      return true;
+    }
+  }
+  return false;
+}
+
+/**
+ * Check if two line segments intersect
+ */
+export function lineSegmentsIntersect(p1, p2, p3, p4) {
+  var d1 = direction(p3, p4, p1);
+  var d2 = direction(p3, p4, p2);
+  var d3 = direction(p1, p2, p3);
+  var d4 = direction(p1, p2, p4);
+  if ((d1 > 0 && d2 < 0 || d1 < 0 && d2 > 0) && (d3 > 0 && d4 < 0 || d3 < 0 && d4 > 0)) {
+    return true;
+  }
+  if (d1 === 0 && onSegment(p3, p1, p4)) return true;
+  if (d2 === 0 && onSegment(p3, p2, p4)) return true;
+  if (d3 === 0 && onSegment(p1, p3, p2)) return true;
+  if (d4 === 0 && onSegment(p1, p4, p2)) return true;
+  return false;
+}
+
+/**
+ * Calculate direction of point p3 relative to line p1-p2
+ */
+function direction(p1, p2, p3) {
+  return (p3.x - p1.x) * (p2.y - p1.y) - (p2.x - p1.x) * (p3.y - p1.y);
+}
+
+/**
+ * Check if point p2 is on line segment p1-p3
+ */
+function onSegment(p1, p2, p3) {
+  return p2.x >= Math.min(p1.x, p3.x) && p2.x <= Math.max(p1.x, p3.x) && p2.y >= Math.min(p1.y, p3.y) && p2.y <= Math.max(p1.y, p3.y);
+}

package/esm/geometry/index.d.ts

@@ -1,4 +1,5 @@
 export { Point } from './Point';
 export { Rectangle } from './Rectangle';
 export { Line } from './Line';
+export { lineSegmentIntersectsRect, lineSegmentCrossesRect, lineSegmentsIntersect } from './collision';
 //# sourceMappingURL=index.d.ts.map

package/esm/geometry/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/geometry/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAA;AAC/B,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AACvC,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/geometry/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAA;AAC/B,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AACvC,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAA;AAC7B,OAAO,EAAE,yBAAyB,EAAE,sBAAsB,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAA"}

package/esm/geometry/index.js

@@ -1,3 +1,4 @@
 export { Point } from "./Point";
 export { Rectangle } from "./Rectangle";
-export { Line } from "./Line";
+export { Line } from "./Line";
+export { lineSegmentIntersectsRect, lineSegmentCrossesRect, lineSegmentsIntersect } from "./collision";

package/esm/getManHattanPath.d.ts

@@ -1,3 +1,4 @@
+import { Position } from '@xyflow/react';
 import type { ManhattanRouterOptions, NodeLookup } from './options';
 /**
  * Parameters for getManHattanPath function
@@ -11,20 +12,12 @@ export interface GetManHattanPathParams {
      * Target node ID
      */
     targetNodeId: string;
-    /**
-     * Source anchor position (where the edge starts)
-     */
-    sourcePosition: {
-        x: number;
-        y: number;
-    };
-    /**
-     * Target anchor position (where the edge ends)
-     */
-    targetPosition: {
-        x: number;
-        y: number;
-    };
+    sourceX: number;
+    sourceY: number;
+    targetX: number;
+    targetY: number;
+    sourcePosition: Position;
+    targetPosition: Position;
     /**
      * ReactFlow node lookup map
      */

package/esm/getManHattanPath.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"getManHattanPath.d.ts","sourceRoot":"","sources":["../src/getManHattanPath.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,sBAAsB,EAAE,UAAU,EAAE,MAAM,WAAW,CAAA;AAOnE;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC;;OAEG;IACH,YAAY,EAAE,MAAM,CAAA;IAEpB;;OAEG;IACH,YAAY,EAAE,MAAM,CAAA;IAEpB;;OAEG;IACH,cAAc,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;IAExC;;OAEG;IACH,cAAc,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;IAExC;;OAEG;IACH,UAAU,EAAE,UAAU,CAAA;IAEtB;;OAEG;IACH,OAAO,CAAC,EAAE,sBAAsB,CAAA;CACjC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,sBAAsB,GAAG,MAAM,CA4PvE"}
+{"version":3,"file":"getManHattanPath.d.ts","sourceRoot":"","sources":["../src/getManHattanPath.ts"],"names":[],"mappings":"AAAA,OAAO,EAAqB,QAAQ,EAAE,MAAM,eAAe,CAAA;AAG3D,OAAO,KAAK,EAAE,sBAAsB,EAAE,UAAU,EAAE,MAAM,WAAW,CAAA;AAMnE;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC;;OAEG;IACH,YAAY,EAAE,MAAM,CAAA;IAEpB;;OAEG;IACH,YAAY,EAAE,MAAM,CAAC;IAErB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAEhB,cAAc,EAAE,QAAQ,CAAC;IACzB,cAAc,EAAE,QAAQ,CAAC;IACzB;;OAEG;IACH,UAAU,EAAE,UAAU,CAAA;IAEtB;;OAEG;IACH,OAAO,CAAC,EAAE,sBAAsB,CAAA;CACjC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,sBAAsB,GAAG,MAAM,CAwRvE"}

package/esm/getManHattanPath.js

@@ -1,15 +1,20 @@
 function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
 function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
 function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
 function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
+function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
 function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
+import { getSmoothStepPath } from '@xyflow/react';
 import { Point, Rectangle } from "./geometry";
-import { resolveOptions } from "./options";
 import { ObstacleMap } from "./obstacle";
+import { resolveOptions } from "./options";
 import { findRoute } from "./pathfinder";
-import { pointsToPath, snapPathToGrid } from "./svg";
-import { getNodeDimensions, getNodePosition } from "./utils";
+import { pointsToPath, snapPathToGrid, parseSVGPath, simplifyPath } from "./svg";
+import { getNodeDimensions, getNodePosition, pathIntersectsObstacles } from "./utils";
 
 /**
  * Parameters for getManHattanPath function
@@ -17,10 +22,10 @@ import { getNodeDimensions, getNodePosition } from "./utils";
 
 /**
  * Generate Manhattan-routed path for ReactFlow edges
- * 
+ *
  * @param params - Path generation parameters
  * @returns SVG path string that can be used with ReactFlow's BaseEdge
- * 
+ *
  * @example
  * ```typescript
  * const path = getManHattanPath({
@@ -43,6 +48,10 @@ export function getManHattanPath(params) {
     sourcePosition = params.sourcePosition,
     targetPosition = params.targetPosition,
     nodeLookup = params.nodeLookup,
+    sourceX = params.sourceX,
+    sourceY = params.sourceY,
+    targetX = params.targetX,
+    targetY = params.targetY,
     _params$options = params.options,
     userOptions = _params$options === void 0 ? {} : _params$options;
 
@@ -55,8 +64,8 @@ export function getManHattanPath(params) {
   if (!sourceNode || !targetNode) {
     // Fallback to simple straight line if nodes not found
     console.warn('Source or target node not found in nodeLookup');
-    var start = new Point(sourcePosition.x, sourcePosition.y);
-    var end = new Point(targetPosition.x, targetPosition.y);
+    var start = new Point(sourceX, sourceY);
+    var end = new Point(targetX, targetY);
     return pointsToPath([start, end], options.precision);
   }
 
@@ -73,8 +82,31 @@ export function getManHattanPath(params) {
   var targetBBox = new Rectangle(targetPos.x, targetPos.y, targetDimensions.width, targetDimensions.height);
 
   // Create anchor points
-  var sourceAnchor = new Point(sourcePosition.x, sourcePosition.y);
-  var targetAnchor = new Point(targetPosition.x, targetPosition.y);
+  var sourceAnchor = new Point(sourceX, sourceY);
+  var targetAnchor = new Point(targetX, targetY);
+
+  // Try ReactFlow's getSmoothStepPath first
+  var _getSmoothStepPath = getSmoothStepPath({
+      sourceX: sourceX,
+      sourceY: sourceY,
+      targetX: targetX,
+      targetY: targetY,
+      sourcePosition: sourcePosition,
+      targetPosition: targetPosition,
+      borderRadius: options.borderRadius
+    }),
+    _getSmoothStepPath2 = _slicedToArray(_getSmoothStepPath, 1),
+    smoothStepPath = _getSmoothStepPath2[0];
+
+  // Parse the smooth step path to extract points
+  var smoothStepPoints = parseSVGPath(smoothStepPath);
+
+  // Check if smooth step path intersects with any obstacles
+  if (smoothStepPoints.length > 0 && !pathIntersectsObstacles(smoothStepPoints, nodeLookup)) {
+    console.log('[getManHattanPath] Using ReactFlow getSmoothStepPath (no obstacles)');
+    return smoothStepPath;
+  }
+  console.log('[getManHattanPath] SmoothStepPath intersects obstacles, using Manhattan routing');
 
   // Build obstacle map with anchor information
   var obstacleMap = new ObstacleMap(options).build(nodeLookup, sourceNodeId, targetNodeId, sourceAnchor, targetAnchor);
@@ -137,7 +169,9 @@ export function getManHattanPath(params) {
   }
 
   // Insert extension point at source - always extend away from node edge by fixed step distance
+  // Add borderRadius to extension distance to account for rounded corners
   if (route.length > 0) {
+    var extensionDistance = step + options.borderRadius;
     var _firstPoint = route[0];
 
     // Determine which edge the source anchor is on
@@ -148,8 +182,8 @@ export function getManHattanPath(params) {
 
     // Insert extension point and corner point to ensure orthogonal path
     if (_onRight2) {
-      // Anchor on right edge - extend right by fixed step
-      var extendX = sourceAnchor.x + step;
+      // Anchor on right edge - extend right by step + borderRadius
+      var extendX = sourceAnchor.x + extensionDistance;
       var extensionPoint = new Point(extendX, sourceAnchor.y);
       // Check if we need a corner point
       if (Math.abs(extensionPoint.y - _firstPoint.y) > tolerance) {
@@ -158,8 +192,8 @@ export function getManHattanPath(params) {
       route.unshift(extensionPoint); // Extension point (fixed distance)
       console.log('[getManHattanPath] Inserted source extension (right):', "(".concat(extendX, ", ").concat(sourceAnchor.y, ")"));
     } else if (_onLeft2) {
-      // Anchor on left edge - extend left by fixed step
-      var _extendX = sourceAnchor.x - step;
+      // Anchor on left edge - extend left by step + borderRadius
+      var _extendX = sourceAnchor.x - extensionDistance;
       var _extensionPoint = new Point(_extendX, sourceAnchor.y);
       if (Math.abs(_extensionPoint.y - _firstPoint.y) > tolerance) {
         route.unshift(new Point(_extendX, _firstPoint.y));
@@ -167,8 +201,8 @@ export function getManHattanPath(params) {
       route.unshift(_extensionPoint);
       console.log('[getManHattanPath] Inserted source extension (left):', "(".concat(_extendX, ", ").concat(sourceAnchor.y, ")"));
     } else if (_onBottom2) {
-      // Anchor on bottom edge - extend down by fixed step
-      var extendY = sourceAnchor.y + step;
+      // Anchor on bottom edge - extend down by step + borderRadius
+      var extendY = sourceAnchor.y + extensionDistance;
       var _extensionPoint2 = new Point(sourceAnchor.x, extendY);
       if (Math.abs(_extensionPoint2.x - _firstPoint.x) > tolerance) {
         route.unshift(new Point(_firstPoint.x, extendY));
@@ -176,8 +210,8 @@ export function getManHattanPath(params) {
       route.unshift(_extensionPoint2);
       console.log('[getManHattanPath] Inserted source extension (down):', "(".concat(sourceAnchor.x, ", ").concat(extendY, ")"));
     } else if (_onTop2) {
-      // Anchor on top edge - extend up by fixed step
-      var _extendY = sourceAnchor.y - step;
+      // Anchor on top edge - extend up by step + borderRadius
+      var _extendY = sourceAnchor.y - extensionDistance;
       var _extensionPoint3 = new Point(sourceAnchor.x, _extendY);
       if (Math.abs(_extensionPoint3.x - _firstPoint.x) > tolerance) {
         route.unshift(new Point(_firstPoint.x, _extendY));
@@ -188,50 +222,50 @@ export function getManHattanPath(params) {
   }
 
   // Insert extension point at target - always extend away from node edge by fixed step distance
+  // Add borderRadius to extension distance to account for rounded corners
   if (route.length > 0) {
-    var _step = options.step;
-    var _tolerance = 1;
+    var _extensionDistance = step + options.borderRadius;
     var _lastPoint = route[route.length - 1];
 
     // Determine which edge the target anchor is on
-    var _onLeft3 = Math.abs(targetAnchor.x - targetBBox.x) < _tolerance;
-    var _onRight3 = Math.abs(targetAnchor.x - (targetBBox.x + targetBBox.width)) < _tolerance;
-    var _onTop3 = Math.abs(targetAnchor.y - targetBBox.y) < _tolerance;
-    var _onBottom3 = Math.abs(targetAnchor.y - (targetBBox.y + targetBBox.height)) < _tolerance;
+    var _onLeft3 = Math.abs(targetAnchor.x - targetBBox.x) < tolerance;
+    var _onRight3 = Math.abs(targetAnchor.x - (targetBBox.x + targetBBox.width)) < tolerance;
+    var _onTop3 = Math.abs(targetAnchor.y - targetBBox.y) < tolerance;
+    var _onBottom3 = Math.abs(targetAnchor.y - (targetBBox.y + targetBBox.height)) < tolerance;
 
     // Insert extension point and corner point to ensure orthogonal path
     if (_onLeft3) {
-      // Anchor on left edge - extend left by fixed step
-      var _extendX2 = targetAnchor.x - _step;
+      // Anchor on left edge - extend left by step + borderRadius
+      var _extendX2 = targetAnchor.x - _extensionDistance;
       var _extensionPoint4 = new Point(_extendX2, targetAnchor.y);
-      if (Math.abs(_extensionPoint4.y - _lastPoint.y) > _tolerance) {
+      if (Math.abs(_extensionPoint4.y - _lastPoint.y) > tolerance) {
         route.push(new Point(_extendX2, _lastPoint.y)); // Corner point
       }
       route.push(_extensionPoint4); // Extension point (fixed distance)
       console.log('[getManHattanPath] Inserted target extension (left):', "(".concat(_extendX2, ", ").concat(targetAnchor.y, ")"));
     } else if (_onRight3) {
-      // Anchor on right edge - extend right by fixed step
-      var _extendX3 = targetAnchor.x + _step;
+      // Anchor on right edge - extend right by step + borderRadius
+      var _extendX3 = targetAnchor.x + _extensionDistance;
       var _extensionPoint5 = new Point(_extendX3, targetAnchor.y);
-      if (Math.abs(_extensionPoint5.y - _lastPoint.y) > _tolerance) {
+      if (Math.abs(_extensionPoint5.y - _lastPoint.y) > tolerance) {
         route.push(new Point(_extendX3, _lastPoint.y));
       }
       route.push(_extensionPoint5);
       console.log('[getManHattanPath] Inserted target extension (right):', "(".concat(_extendX3, ", ").concat(targetAnchor.y, ")"));
     } else if (_onTop3) {
-      // Anchor on top edge - extend up by fixed step
-      var _extendY2 = targetAnchor.y - _step;
+      // Anchor on top edge - extend up by step + borderRadius
+      var _extendY2 = targetAnchor.y - _extensionDistance;
       var _extensionPoint6 = new Point(targetAnchor.x, _extendY2);
-      if (Math.abs(_extensionPoint6.x - _lastPoint.x) > _tolerance) {
+      if (Math.abs(_extensionPoint6.x - _lastPoint.x) > tolerance) {
         route.push(new Point(_lastPoint.x, _extendY2));
       }
       route.push(_extensionPoint6);
       console.log('[getManHattanPath] Inserted target extension (up):', "(".concat(targetAnchor.x, ", ").concat(_extendY2, ")"));
     } else if (_onBottom3) {
-      // Anchor on bottom edge - extend down by fixed step
-      var _extendY3 = targetAnchor.y + _step;
+      // Anchor on bottom edge - extend down by step + borderRadius
+      var _extendY3 = targetAnchor.y + _extensionDistance;
       var _extensionPoint7 = new Point(targetAnchor.x, _extendY3);
-      if (Math.abs(_extensionPoint7.x - _lastPoint.x) > _tolerance) {
+      if (Math.abs(_extensionPoint7.x - _lastPoint.x) > tolerance) {
         route.push(new Point(_lastPoint.x, _extendY3));
       }
       route.push(_extensionPoint7);
@@ -260,32 +294,4 @@ export function getManHattanPath(params) {
 
   // Convert to SVG path string
   return pointsToPath(finalRoute, options.precision, options.borderRadius);
-}
-
-/**
- * Simplify path by removing collinear intermediate points
- */
-function simplifyPath(points) {
-  if (points.length <= 2) {
-    return points;
-  }
-  var simplified = [points[0]];
-  for (var i = 1; i < points.length - 1; i++) {
-    var prev = simplified[simplified.length - 1];
-    var current = points[i];
-    var next = points[i + 1];
-
-    // Check if current point is collinear with prev and next
-    var isHorizontalLine = prev.y === current.y && current.y === next.y;
-    var isVerticalLine = prev.x === current.x && current.x === next.x;
-
-    // Only keep the point if it's not collinear (i.e., it's a corner)
-    if (!isHorizontalLine && !isVerticalLine) {
-      simplified.push(current);
-    }
-  }
-
-  // Always add the last point
-  simplified.push(points[points.length - 1]);
-  return simplified;
 }

package/esm/options/defaults.js

@@ -12,7 +12,7 @@ export var defaults = {
   excludeNodes: [],
   excludeShapes: [],
   excludeTerminals: [],
-  padding: 0,
+  padding: 15,
   snapToGrid: true,
   borderRadius: 5,
   penalties: {

package/esm/svg/index.d.ts

@@ -1,2 +1,3 @@
 export { pointsToPath, snapPathToGrid } from './pathConverter';
+export { parseSVGPath, simplifyPath } from './pathParser';
 //# sourceMappingURL=index.d.ts.map

package/esm/svg/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/svg/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/svg/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAA;AAC9D,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,cAAc,CAAA"}

package/esm/svg/index.js

@@ -1 +1,2 @@
-export { pointsToPath, snapPathToGrid } from "./pathConverter";
+export { pointsToPath, snapPathToGrid } from "./pathConverter";
+export { parseSVGPath, simplifyPath } from "./pathParser";

package/esm/svg/pathParser.d.ts

@@ -0,0 +1,11 @@
+import { Point } from '../geometry';
+/**
+ * Parse SVG path string to extract points
+ * Simplified parser that handles M, L, Q commands
+ */
+export declare function parseSVGPath(pathString: string): Point[];
+/**
+ * Simplify path by removing collinear intermediate points
+ */
+export declare function simplifyPath(points: Point[]): Point[];
+//# sourceMappingURL=pathParser.d.ts.map

package/esm/svg/pathParser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathParser.d.ts","sourceRoot":"","sources":["../../src/svg/pathParser.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAEnC;;;GAGG;AACH,wBAAgB,YAAY,CAAC,UAAU,EAAE,MAAM,GAAG,KAAK,EAAE,CA2CxD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CA0BrD"}

package/esm/svg/pathParser.js

@@ -0,0 +1,82 @@
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
+import { Point } from "../geometry";
+
+/**
+ * Parse SVG path string to extract points
+ * Simplified parser that handles M, L, Q commands
+ */
+export function parseSVGPath(pathString) {
+  var points = [];
+  var commands = pathString.match(/[MLQ][^MLQ]*/g);
+  if (!commands) return points;
+  var _iterator = _createForOfIteratorHelper(commands),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var command = _step.value;
+      var type = command[0];
+      var coords = command.slice(1).trim().split(/[\s,]+/).map(Number);
+      if (type === 'M' || type === 'L') {
+        // MoveTo or LineTo: x, y
+        if (coords.length >= 2) {
+          points.push(new Point(coords[0], coords[1]));
+        }
+      } else if (type === 'Q') {
+        // Quadratic Bezier: cx, cy, x, y
+        // We sample points along the curve for collision detection
+        if (coords.length >= 4) {
+          var prevPoint = points[points.length - 1];
+          if (prevPoint) {
+            var cx = coords[0];
+            var cy = coords[1];
+            var x = coords[2];
+            var y = coords[3];
+
+            // Sample 10 points along the bezier curve for better accuracy
+            // This ensures we don't miss intersections with obstacles
+            for (var t = 0.1; t <= 1; t += 0.1) {
+              var bx = (1 - t) * (1 - t) * prevPoint.x + 2 * (1 - t) * t * cx + t * t * x;
+              var by = (1 - t) * (1 - t) * prevPoint.y + 2 * (1 - t) * t * cy + t * t * y;
+              points.push(new Point(bx, by));
+            }
+          }
+        }
+      }
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  return points;
+}
+
+/**
+ * Simplify path by removing collinear intermediate points
+ */
+export function simplifyPath(points) {
+  if (points.length <= 2) {
+    return points;
+  }
+  var simplified = [points[0]];
+  for (var i = 1; i < points.length - 1; i++) {
+    var prev = simplified[simplified.length - 1];
+    var current = points[i];
+    var next = points[i + 1];
+
+    // Check if current point is collinear with prev and next
+    var isHorizontalLine = prev.y === current.y && current.y === next.y;
+    var isVerticalLine = prev.x === current.x && current.x === next.x;
+
+    // Only keep the point if it's not collinear (i.e., it's a corner)
+    if (!isHorizontalLine && !isVerticalLine) {
+      simplified.push(current);
+    }
+  }
+
+  // Always add the last point
+  simplified.push(points[points.length - 1]);
+  return simplified;
+}