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

package/cjs/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/cjs/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/cjs/geometry/collision.js

@@ -0,0 +1,81 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lineSegmentCrossesRect = lineSegmentCrossesRect;
+exports.lineSegmentIntersectsRect = lineSegmentIntersectsRect;
+exports.lineSegmentsIntersect = lineSegmentsIntersect;
+var _Point = require("./Point");
+/**
+ * Check if a line segment intersects with a rectangle
+ */
+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
+  const rectPoints = [new _Point.Point(rect.x, rect.y), new _Point.Point(rect.x + rect.width, rect.y), new _Point.Point(rect.x + rect.width, rect.y + rect.height), new _Point.Point(rect.x, rect.y + rect.height)];
+  for (let i = 0; i < 4; i++) {
+    const r1 = rectPoints[i];
+    const 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)
+ */
+function lineSegmentCrossesRect(p1, p2, rect) {
+  const 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
+  const steps = 10;
+  for (let i = 1; i < steps; i++) {
+    const t = i / steps;
+    const x = p1.x + (p2.x - p1.x) * t;
+    const 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
+ */
+function lineSegmentsIntersect(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)) {
+    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/cjs/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/cjs/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/cjs/geometry/index.js

@@ -21,6 +21,25 @@ Object.defineProperty(exports, "Rectangle", {
     return _Rectangle.Rectangle;
   }
 });
+Object.defineProperty(exports, "lineSegmentCrossesRect", {
+  enumerable: true,
+  get: function () {
+    return _collision.lineSegmentCrossesRect;
+  }
+});
+Object.defineProperty(exports, "lineSegmentIntersectsRect", {
+  enumerable: true,
+  get: function () {
+    return _collision.lineSegmentIntersectsRect;
+  }
+});
+Object.defineProperty(exports, "lineSegmentsIntersect", {
+  enumerable: true,
+  get: function () {
+    return _collision.lineSegmentsIntersect;
+  }
+});
 var _Point = require("./Point");
 var _Rectangle = require("./Rectangle");
-var _Line = require("./Line");
+var _Line = require("./Line");
+var _collision = require("./collision");

package/cjs/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/cjs/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/cjs/getManHattanPath.js

@@ -4,9 +4,10 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.getManHattanPath = getManHattanPath;
+var _react = require("@xyflow/react");
 var _geometry = require("./geometry");
-var _options = require("./options");
 var _obstacle = require("./obstacle");
+var _options = require("./options");
 var _pathfinder = require("./pathfinder");
 var _svg = require("./svg");
 var _utils = require("./utils");
@@ -16,10 +17,10 @@ var _utils = require("./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 +44,10 @@ function getManHattanPath(params) {
     sourcePosition,
     targetPosition,
     nodeLookup,
+    sourceX,
+    sourceY,
+    targetX,
+    targetY,
     options: userOptions = {}
   } = params;
 
@@ -55,8 +60,8 @@ 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');
-    const start = new _geometry.Point(sourcePosition.x, sourcePosition.y);
-    const end = new _geometry.Point(targetPosition.x, targetPosition.y);
+    const start = new _geometry.Point(sourceX, sourceY);
+    const end = new _geometry.Point(targetX, targetY);
     return (0, _svg.pointsToPath)([start, end], options.precision);
   }
 
@@ -73,8 +78,29 @@ function getManHattanPath(params) {
   const targetBBox = new _geometry.Rectangle(targetPos.x, targetPos.y, targetDimensions.width, targetDimensions.height);
 
   // Create anchor points
-  const sourceAnchor = new _geometry.Point(sourcePosition.x, sourcePosition.y);
-  const targetAnchor = new _geometry.Point(targetPosition.x, targetPosition.y);
+  const sourceAnchor = new _geometry.Point(sourceX, sourceY);
+  const targetAnchor = new _geometry.Point(targetX, targetY);
+
+  // Try ReactFlow's getSmoothStepPath first
+  const [smoothStepPath] = (0, _react.getSmoothStepPath)({
+    sourceX,
+    sourceY,
+    targetX,
+    targetY,
+    sourcePosition,
+    targetPosition,
+    borderRadius: options.borderRadius
+  });
+
+  // Parse the smooth step path to extract points
+  const smoothStepPoints = (0, _svg.parseSVGPath)(smoothStepPath);
+
+  // Check if smooth step path intersects with any obstacles
+  if (smoothStepPoints.length > 0 && !(0, _utils.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
   const obstacleMap = new _obstacle.ObstacleMap(options).build(nodeLookup, sourceNodeId, targetNodeId, sourceAnchor, targetAnchor);
@@ -135,7 +161,9 @@ 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) {
+    const extensionDistance = step + options.borderRadius;
     const firstPoint = route[0];
 
     // Determine which edge the source anchor is on
@@ -146,8 +174,8 @@ function getManHattanPath(params) {
 
     // Insert extension point and corner point to ensure orthogonal path
     if (onRight) {
-      // Anchor on right edge - extend right by fixed step
-      const extendX = sourceAnchor.x + step;
+      // Anchor on right edge - extend right by step + borderRadius
+      const extendX = sourceAnchor.x + extensionDistance;
       const extensionPoint = new _geometry.Point(extendX, sourceAnchor.y);
       // Check if we need a corner point
       if (Math.abs(extensionPoint.y - firstPoint.y) > tolerance) {
@@ -156,8 +184,8 @@ function getManHattanPath(params) {
       route.unshift(extensionPoint); // Extension point (fixed distance)
       console.log('[getManHattanPath] Inserted source extension (right):', `(${extendX}, ${sourceAnchor.y})`);
     } else if (onLeft) {
-      // Anchor on left edge - extend left by fixed step
-      const extendX = sourceAnchor.x - step;
+      // Anchor on left edge - extend left by step + borderRadius
+      const extendX = sourceAnchor.x - extensionDistance;
       const extensionPoint = new _geometry.Point(extendX, sourceAnchor.y);
       if (Math.abs(extensionPoint.y - firstPoint.y) > tolerance) {
         route.unshift(new _geometry.Point(extendX, firstPoint.y));
@@ -165,8 +193,8 @@ function getManHattanPath(params) {
       route.unshift(extensionPoint);
       console.log('[getManHattanPath] Inserted source extension (left):', `(${extendX}, ${sourceAnchor.y})`);
     } else if (onBottom) {
-      // Anchor on bottom edge - extend down by fixed step
-      const extendY = sourceAnchor.y + step;
+      // Anchor on bottom edge - extend down by step + borderRadius
+      const extendY = sourceAnchor.y + extensionDistance;
       const extensionPoint = new _geometry.Point(sourceAnchor.x, extendY);
       if (Math.abs(extensionPoint.x - firstPoint.x) > tolerance) {
         route.unshift(new _geometry.Point(firstPoint.x, extendY));
@@ -174,8 +202,8 @@ function getManHattanPath(params) {
       route.unshift(extensionPoint);
       console.log('[getManHattanPath] Inserted source extension (down):', `(${sourceAnchor.x}, ${extendY})`);
     } else if (onTop) {
-      // Anchor on top edge - extend up by fixed step
-      const extendY = sourceAnchor.y - step;
+      // Anchor on top edge - extend up by step + borderRadius
+      const extendY = sourceAnchor.y - extensionDistance;
       const extensionPoint = new _geometry.Point(sourceAnchor.x, extendY);
       if (Math.abs(extensionPoint.x - firstPoint.x) > tolerance) {
         route.unshift(new _geometry.Point(firstPoint.x, extendY));
@@ -186,9 +214,9 @@ 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) {
-    const step = options.step;
-    const tolerance = 1;
+    const extensionDistance = step + options.borderRadius;
     const lastPoint = route[route.length - 1];
 
     // Determine which edge the target anchor is on
@@ -199,8 +227,8 @@ function getManHattanPath(params) {
 
     // Insert extension point and corner point to ensure orthogonal path
     if (onLeft) {
-      // Anchor on left edge - extend left by fixed step
-      const extendX = targetAnchor.x - step;
+      // Anchor on left edge - extend left by step + borderRadius
+      const extendX = targetAnchor.x - extensionDistance;
       const extensionPoint = new _geometry.Point(extendX, targetAnchor.y);
       if (Math.abs(extensionPoint.y - lastPoint.y) > tolerance) {
         route.push(new _geometry.Point(extendX, lastPoint.y)); // Corner point
@@ -208,8 +236,8 @@ function getManHattanPath(params) {
       route.push(extensionPoint); // Extension point (fixed distance)
       console.log('[getManHattanPath] Inserted target extension (left):', `(${extendX}, ${targetAnchor.y})`);
     } else if (onRight) {
-      // Anchor on right edge - extend right by fixed step
-      const extendX = targetAnchor.x + step;
+      // Anchor on right edge - extend right by step + borderRadius
+      const extendX = targetAnchor.x + extensionDistance;
       const extensionPoint = new _geometry.Point(extendX, targetAnchor.y);
       if (Math.abs(extensionPoint.y - lastPoint.y) > tolerance) {
         route.push(new _geometry.Point(extendX, lastPoint.y));
@@ -217,8 +245,8 @@ function getManHattanPath(params) {
       route.push(extensionPoint);
       console.log('[getManHattanPath] Inserted target extension (right):', `(${extendX}, ${targetAnchor.y})`);
     } else if (onTop) {
-      // Anchor on top edge - extend up by fixed step
-      const extendY = targetAnchor.y - step;
+      // Anchor on top edge - extend up by step + borderRadius
+      const extendY = targetAnchor.y - extensionDistance;
       const extensionPoint = new _geometry.Point(targetAnchor.x, extendY);
       if (Math.abs(extensionPoint.x - lastPoint.x) > tolerance) {
         route.push(new _geometry.Point(lastPoint.x, extendY));
@@ -226,8 +254,8 @@ function getManHattanPath(params) {
       route.push(extensionPoint);
       console.log('[getManHattanPath] Inserted target extension (up):', `(${targetAnchor.x}, ${extendY})`);
     } else if (onBottom) {
-      // Anchor on bottom edge - extend down by fixed step
-      const extendY = targetAnchor.y + step;
+      // Anchor on bottom edge - extend down by step + borderRadius
+      const extendY = targetAnchor.y + extensionDistance;
       const extensionPoint = new _geometry.Point(targetAnchor.x, extendY);
       if (Math.abs(extensionPoint.x - lastPoint.x) > tolerance) {
         route.push(new _geometry.Point(lastPoint.x, extendY));
@@ -249,37 +277,9 @@ function getManHattanPath(params) {
   }
 
   // Simplify path by removing collinear points
-  finalRoute = simplifyPath(finalRoute);
+  finalRoute = (0, _svg.simplifyPath)(finalRoute);
   console.log('[getManHattanPath] Simplified route:', finalRoute.map(p => `(${p.x}, ${p.y})`));
 
   // Convert to SVG path string
   return (0, _svg.pointsToPath)(finalRoute, options.precision, options.borderRadius);
-}
-
-/**
- * Simplify path by removing collinear intermediate points
- */
-function simplifyPath(points) {
-  if (points.length <= 2) {
-    return points;
-  }
-  const simplified = [points[0]];
-  for (let i = 1; i < points.length - 1; i++) {
-    const prev = simplified[simplified.length - 1];
-    const current = points[i];
-    const next = points[i + 1];
-
-    // Check if current point is collinear with prev and next
-    const isHorizontalLine = prev.y === current.y && current.y === next.y;
-    const 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/cjs/options/defaults.js

@@ -18,7 +18,7 @@ const defaults = exports.defaults = {
   excludeNodes: [],
   excludeShapes: [],
   excludeTerminals: [],
-  padding: 0,
+  padding: 15,
   snapToGrid: true,
   borderRadius: 5,
   penalties: {

package/cjs/svg/index.d.ts

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

package/cjs/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/cjs/svg/index.js

@@ -3,16 +3,29 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
+Object.defineProperty(exports, "parseSVGPath", {
+  enumerable: true,
+  get: function () {
+    return _pathParser.parseSVGPath;
+  }
+});
 Object.defineProperty(exports, "pointsToPath", {
   enumerable: true,
   get: function () {
     return _pathConverter.pointsToPath;
   }
 });
+Object.defineProperty(exports, "simplifyPath", {
+  enumerable: true,
+  get: function () {
+    return _pathParser.simplifyPath;
+  }
+});
 Object.defineProperty(exports, "snapPathToGrid", {
   enumerable: true,
   get: function () {
     return _pathConverter.snapPathToGrid;
   }
 });
-var _pathConverter = require("./pathConverter");
+var _pathConverter = require("./pathConverter");
+var _pathParser = require("./pathParser");

package/cjs/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/cjs/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/cjs/svg/pathParser.js

@@ -0,0 +1,76 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parseSVGPath = parseSVGPath;
+exports.simplifyPath = simplifyPath;
+var _geometry = require("../geometry");
+/**
+ * Parse SVG path string to extract points
+ * Simplified parser that handles M, L, Q commands
+ */
+function parseSVGPath(pathString) {
+  const points = [];
+  const commands = pathString.match(/[MLQ][^MLQ]*/g);
+  if (!commands) return points;
+  for (const command of commands) {
+    const type = command[0];
+    const 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 _geometry.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) {
+        const prevPoint = points[points.length - 1];
+        if (prevPoint) {
+          const cx = coords[0];
+          const cy = coords[1];
+          const x = coords[2];
+          const y = coords[3];
+
+          // Sample 10 points along the bezier curve for better accuracy
+          // This ensures we don't miss intersections with obstacles
+          for (let t = 0.1; t <= 1; t += 0.1) {
+            const bx = (1 - t) * (1 - t) * prevPoint.x + 2 * (1 - t) * t * cx + t * t * x;
+            const by = (1 - t) * (1 - t) * prevPoint.y + 2 * (1 - t) * t * cy + t * t * y;
+            points.push(new _geometry.Point(bx, by));
+          }
+        }
+      }
+    }
+  }
+  return points;
+}
+
+/**
+ * Simplify path by removing collinear intermediate points
+ */
+function simplifyPath(points) {
+  if (points.length <= 2) {
+    return points;
+  }
+  const simplified = [points[0]];
+  for (let i = 1; i < points.length - 1; i++) {
+    const prev = simplified[simplified.length - 1];
+    const current = points[i];
+    const next = points[i + 1];
+
+    // Check if current point is collinear with prev and next
+    const isHorizontalLine = prev.y === current.y && current.y === next.y;
+    const 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/cjs/utils/grid.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"grid.d.ts","sourceRoot":"","sources":["../../src/utils/grid.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAEnC;;GAEG;AACH,MAAM,WAAW,IAAI;IACnB,MAAM,EAAE,KAAK,CAAA;IACb,CAAC,EAAE,MAAM,CAAA;IACT,CAAC,EAAE,MAAM,CAAA;CACV;AA2BD;;GAEG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,GAAG,IAAI,CAMxE;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAElE;AAYD;;GAEG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,GAAG,KAAK,CAExE;AAED;;GAEG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,GAAG,KAAK,CAE5D"}
+{"version":3,"file":"grid.d.ts","sourceRoot":"","sources":["../../src/utils/grid.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAEnC;;GAEG;AACH,MAAM,WAAW,IAAI;IACnB,MAAM,EAAE,KAAK,CAAA;IACb,CAAC,EAAE,MAAM,CAAA;IACT,CAAC,EAAE,MAAM,CAAA;CACV;AAWD;;GAEG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,GAAG,IAAI,CAMxE;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAElE;AAYD;;GAEG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,GAAG,KAAK,CAExE;AAED;;GAEG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,GAAG,KAAK,CAE5D"}

package/cjs/utils/grid.js

@@ -16,23 +16,9 @@ var _geometry = require("../geometry");
  * Get grid dimension for a single axis
  */
 function getGridDimension(diff, step) {
-  // Return step if diff = 0
-  if (!diff) {
-    return step;
-  }
-  const abs = Math.abs(diff);
-  const count = Math.round(abs / step);
-
-  // Return abs if less than one step apart
-  if (!count) {
-    return abs;
-  }
-
-  // Otherwise, return corrected step
-  const roundedDiff = count * step;
-  const remainder = abs - roundedDiff;
-  const correction = remainder / count;
-  return step + correction;
+  // Always return fixed step size to maintain consistent padding
+  // This ensures paths stay at least 'padding' distance from obstacles
+  return step;
 }
 
 /**

package/cjs/utils/index.d.ts

@@ -3,4 +3,5 @@ export * from './direction';
 export * from './rect';
 export * from './route';
 export * from './node';
+export * from './pathValidation';
 //# sourceMappingURL=index.d.ts.map

package/cjs/utils/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAA;AACtB,cAAc,aAAa,CAAA;AAC3B,cAAc,QAAQ,CAAA;AACtB,cAAc,SAAS,CAAA;AACvB,cAAc,QAAQ,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAA;AACtB,cAAc,aAAa,CAAA;AAC3B,cAAc,QAAQ,CAAA;AACtB,cAAc,SAAS,CAAA;AACvB,cAAc,QAAQ,CAAA;AACtB,cAAc,kBAAkB,CAAA"}

package/cjs/utils/index.js

@@ -57,4 +57,15 @@ Object.keys(_node).forEach(function (key) {
       return _node[key];
     }
   });
+});
+var _pathValidation = require("./pathValidation");
+Object.keys(_pathValidation).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _pathValidation[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _pathValidation[key];
+    }
+  });
 });

package/cjs/utils/pathValidation.d.ts

@@ -0,0 +1,11 @@
+import { Point } from '../geometry';
+import type { NodeLookup } from '../options';
+/**
+ * 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
+ */
+export declare function pathIntersectsObstacles(pathPoints: Point[], nodeLookup: NodeLookup): boolean;
+//# sourceMappingURL=pathValidation.d.ts.map

package/cjs/utils/pathValidation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathValidation.d.ts","sourceRoot":"","sources":["../../src/utils/pathValidation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAa,MAAM,aAAa,CAAA;AAC9C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAA;AAyF5C;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CAAC,UAAU,EAAE,KAAK,EAAE,EAAE,UAAU,EAAE,UAAU,GAAG,OAAO,CAoC5F"}