@tscircuit/math-utils 0.0.19 → 0.0.21

package/README.md

@@ -6,9 +6,11 @@ This repository contains a collection of TypeScript utility functions for geomet
 
 - Line intersection detection
 - Segment intersection detection
+- Segment-rectangle intersection detection
 - Point-to-segment distance calculation
 - Orientation of points
 - Distance between points
+- Bounds overlap and distance calculations
 
 ## Installation
 
@@ -39,29 +41,36 @@ console.log("Lines intersect:", intersects)
 
 ## API Reference
 
-### `doesLineIntersectLine(line1: [Point, Point], line2: [Point, Point], options?: { lineThickness?: number }): boolean`
-
-Determines if two lines intersect, optionally considering line thickness.
-
-### `doSegmentsIntersect(p1: Point, q1: Point, p2: Point, q2: Point): boolean`
-
-Checks if two line segments intersect.
-
-### `orientation(p: Point, q: Point, r: Point): number`
-
-Calculates the orientation of three points.
-
-### `onSegment(p: Point, q: Point, r: Point): boolean`
-
-Checks if point q lies on the segment p-r.
-
-### `pointToSegmentDistance(p: Point, v: Point, w: Point): number`
-
-Calculates the minimum distance between a point and a line segment.
-
-### `distance(p1: Point, p2: Point): number`
-
-Calculates the Euclidean distance between two points.
+| Function | Description |
+| -------- | ----------- |
+| [`doesLineIntersectLine(line1, line2, options?)`](./src/line-intersections.ts) | Determine if two lines intersect, optionally considering line thickness. |
+| [`doSegmentsIntersect(p1, q1, p2, q2)`](./src/line-intersections.ts) | Check if two line segments intersect. |
+| [`doesSegmentIntersectRect(a, b, rect)`](./src/line-intersections.ts) | Check if a segment intersects an axis-aligned rectangle. |
+| [`orientation(p, q, r)`](./src/line-intersections.ts) | Calculate the orientation of three points. |
+| [`onSegment(p, q, r)`](./src/line-intersections.ts) | Determine if point `q` lies on the segment `p`–`r`. |
+| [`pointToSegmentDistance(p, v, w)`](./src/line-intersections.ts) | Minimum distance between a point and a segment. |
+| [`distance(p1, p2)`](./src/line-intersections.ts) | Euclidean distance between two points. |
+| [`getSegmentIntersection(a, b, u, v)`](./src/line-intersections.ts) | Intersection point of two segments or `null` if none. |
+| [`getBoundingBox(box)`](./src/nearest-box.ts) | Compute the bounding box of a box. |
+| [`computeDistanceBetweenBoxes(boxA, boxB)`](./src/nearest-box.ts) | Minimum distance between two boxes and the nearest points. |
+| [`clamp(value, min, max)`](./src/nearest-box.ts) | Clamp a value between `min` and `max`. |
+| [`findNearestPointsBetweenBoxSets(setA, setB)`](./src/nearest-box.ts) | Find nearest points between two sets of boxes. |
+| [`getUnitVectorFromPointAToB(a, b)`](./src/get-unit-vector.ts) | Unit vector pointing from point A to B. |
+| [`getUnitVectorFromDirection(direction)`](./src/get-unit-vector.ts) | Unit vector for the given cardinal direction. |
+| [`grid(options)`](./src/grid.ts) | Generate grid cell positions with spacing and offsets. |
+| [`segmentToSegmentMinDistance(a, b, u, v)`](./src/segment-distance.ts) | Minimum distance between two line segments. |
+| [`segmentToBoundsMinDistance(a, b, bounds)`](./src/segment-distance.ts) | Minimum distance from a segment to a bounds rectangle. |
+| [`segmentToBoxMinDistance(a, b, box)`](./src/segment-distance.ts) | Minimum distance from a segment to a box. |
+| [`segmentToCircleMinDistance(a, b, circle)`](./src/segment-distance.ts) | Minimum distance from a segment to a circle. |
+| [`pointToSegmentClosestPoint(p, a, b)`](./src/segment-distance.ts) | Closest point on a segment to the given point. |
+| [`pointToBoxDistance(p, box)`](./src/point-distance.ts) | Minimum distance from a point to a box. |
+| [`pointToBoundsDistance(p, bounds)`](./src/point-distance.ts) | Minimum distance from a point to a bounds rectangle. |
+| [`midpoint(p1, p2)`](./src/point-distance.ts) | Midpoint between two points. |
+| [`distSq(p1, p2)`](./src/point-distance.ts) | Squared distance between two points. |
+| [`range(start, end?, step?)`](./src/range.ts) | Create an array of numbers progressing from start up to, but not including, end. |
+| [`doBoundsOverlap(bounds1, bounds2)`](./src/bounds-overlap.ts) | Determine if two bounding rectangles overlap. |
+| [`boundsAreaOverlap(bounds1, bounds2)`](./src/bounds-area-overlap.ts) | Area of overlap between two bounding rectangles. |
+| [`boundsDistance(bounds1, bounds2)`](./src/bounds-distance.ts) | Minimum distance between two bounding rectangles. |
 
 ## Contributing
 

package/dist/bounds-area-overlap.d.ts

@@ -0,0 +1,11 @@
+import { Bounds } from './common.js';
+
+/**
+ * Computes the overlapping area between two bounding rectangles
+ * @param bounds1 First bounding rectangle
+ * @param bounds2 Second bounding rectangle
+ * @returns The area of overlap. Returns 0 if the bounds do not overlap
+ */
+declare const boundsAreaOverlap: (bounds1: Bounds, bounds2: Bounds) => number;
+
+export { boundsAreaOverlap };

package/dist/bounds-area-overlap.js

@@ -0,0 +1,7 @@
+import {
+  boundsAreaOverlap
+} from "./chunk-YA3GC5BB.js";
+export {
+  boundsAreaOverlap
+};
+//# sourceMappingURL=bounds-area-overlap.js.map

package/dist/bounds-area-overlap.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/bounds-distance.d.ts

@@ -0,0 +1,11 @@
+import { Bounds } from './common.js';
+
+/**
+ * Computes the minimum distance between two bounding rectangles
+ * @param bounds1 First bounding rectangle
+ * @param bounds2 Second bounding rectangle
+ * @returns The minimum distance. Returns 0 if the bounds overlap or touch
+ */
+declare const boundsDistance: (bounds1: Bounds, bounds2: Bounds) => number;
+
+export { boundsDistance };

package/dist/bounds-distance.js

@@ -0,0 +1,7 @@
+import {
+  boundsDistance
+} from "./chunk-KVGAXIWH.js";
+export {
+  boundsDistance
+};
+//# sourceMappingURL=bounds-distance.js.map

package/dist/bounds-distance.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/bounds-overlap.d.ts

@@ -0,0 +1,11 @@
+import { Bounds } from './common.js';
+
+/**
+ * Determines if two bounding rectangles overlap
+ * @param bounds1 First bounding rectangle
+ * @param bounds2 Second bounding rectangle
+ * @returns true if the bounds overlap, false otherwise
+ */
+declare const doBoundsOverlap: (bounds1: Bounds, bounds2: Bounds) => boolean;
+
+export { doBoundsOverlap };

package/dist/bounds-overlap.js

@@ -0,0 +1,7 @@
+import {
+  doBoundsOverlap
+} from "./chunk-CA5ORSO4.js";
+export {
+  doBoundsOverlap
+};
+//# sourceMappingURL=bounds-overlap.js.map

package/dist/bounds-overlap.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/chunk-CA5ORSO4.js

@@ -0,0 +1,9 @@
+// src/bounds-overlap.ts
+var doBoundsOverlap = (bounds1, bounds2) => {
+  return !(bounds1.maxX < bounds2.minX || bounds2.maxX < bounds1.minX || bounds1.maxY < bounds2.minY || bounds2.maxY < bounds1.minY);
+};
+
+export {
+  doBoundsOverlap
+};
+//# sourceMappingURL=chunk-CA5ORSO4.js.map

package/dist/chunk-CA5ORSO4.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/bounds-overlap.ts"],"sourcesContent":["import type { Bounds } from \"./common\"\n\n/**\n * Determines if two bounding rectangles overlap\n * @param bounds1 First bounding rectangle\n * @param bounds2 Second bounding rectangle\n * @returns true if the bounds overlap, false otherwise\n */\nexport const doBoundsOverlap = (bounds1: Bounds, bounds2: Bounds): boolean => {\n  return !(\n    bounds1.maxX < bounds2.minX ||\n    bounds2.maxX < bounds1.minX ||\n    bounds1.maxY < bounds2.minY ||\n    bounds2.maxY < bounds1.minY\n  )\n}\n"],"mappings":";AAQO,IAAM,kBAAkB,CAAC,SAAiB,YAA6B;AAC5E,SAAO,EACL,QAAQ,OAAO,QAAQ,QACvB,QAAQ,OAAO,QAAQ,QACvB,QAAQ,OAAO,QAAQ,QACvB,QAAQ,OAAO,QAAQ;AAE3B;","names":[]}

package/dist/{chunk-3453HRP7.js → chunk-EFLPMB4J.js}

@@ -85,6 +85,17 @@ function getSegmentIntersection(a, b, u, v) {
   }
   return null;
 }
+function doesSegmentIntersectRect(a, b, rect) {
+  const pointInside = (p) => p.x >= rect.minX && p.x <= rect.maxX && p.y >= rect.minY && p.y <= rect.maxY;
+  if (pointInside(a) || pointInside(b)) {
+    return true;
+  }
+  const topLeft = { x: rect.minX, y: rect.minY };
+  const topRight = { x: rect.maxX, y: rect.minY };
+  const bottomLeft = { x: rect.minX, y: rect.maxY };
+  const bottomRight = { x: rect.maxX, y: rect.maxY };
+  return doSegmentsIntersect(a, b, topLeft, topRight) || doSegmentsIntersect(a, b, topRight, bottomRight) || doSegmentsIntersect(a, b, bottomRight, bottomLeft) || doSegmentsIntersect(a, b, bottomLeft, topLeft);
+}
 
 export {
   doesLineIntersectLine,
@@ -93,6 +104,7 @@ export {
   onSegment,
   pointToSegmentDistance,
   distance,
-  getSegmentIntersection
+  getSegmentIntersection,
+  doesSegmentIntersectRect
 };
-//# sourceMappingURL=chunk-3453HRP7.js.map
+//# sourceMappingURL=chunk-EFLPMB4J.js.map

package/dist/{chunk-3453HRP7.js.map → chunk-EFLPMB4J.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/line-intersections.ts"],"sourcesContent":["import type { Point } from \"./common\"\n\n/**\n * Returns true if the two lines intersect.\n */\nexport function doesLineIntersectLine(\n  [a1, a2]: [Point, Point],\n  [b1, b2]: [Point, Point],\n  {\n    lineThickness = 0,\n  }: {\n    lineThickness?: number\n  } = {},\n): boolean {\n  if (lineThickness === 0) {\n    return doSegmentsIntersect(a1, a2, b1, b2)\n  }\n  const minDist = segmentsDistance(a1, a2, b1, b2)\n  return minDist <= lineThickness\n}\n\n/**\n * Returns true if the two segments intersect.\n */\nexport function doSegmentsIntersect(\n  p1: Point,\n  q1: Point,\n  p2: Point,\n  q2: Point,\n): boolean {\n  const o1 = orientation(p1, q1, p2)\n  const o2 = orientation(p1, q1, q2)\n  const o3 = orientation(p2, q2, p1)\n  const o4 = orientation(p2, q2, q1)\n\n  // General case\n  if (o1 !== o2 && o3 !== o4) {\n    return true\n  }\n\n  // Special Cases\n  if (o1 === 0 && onSegment(p1, p2, q1)) return true\n  if (o2 === 0 && onSegment(p1, q2, q1)) return true\n  if (o3 === 0 && onSegment(p2, p1, q2)) return true\n  if (o4 === 0 && onSegment(p2, q1, q2)) return true\n\n  return false\n}\n\n/**\n * Returns 0 if the points are colinear, 1 if they are clockwise, and 2 if they are counterclockwise.\n */\nexport function orientation(p: Point, q: Point, r: Point): number {\n  const val = (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y)\n  if (val === 0) return 0 // colinear\n  return val > 0 ? 1 : 2 // clock or counterclock wise\n}\n\n/**\n * Returns true if q is on the segment p->r.\n */\nexport function onSegment(p: Point, q: Point, r: Point): boolean {\n  return (\n    q.x <= Math.max(p.x, r.x) &&\n    q.x >= Math.min(p.x, r.x) &&\n    q.y <= Math.max(p.y, r.y) &&\n    q.y >= Math.min(p.y, r.y)\n  )\n}\n\n/**\n * Returns the minimum distance between two segments.\n */\nfunction segmentsDistance(a1: Point, a2: Point, b1: Point, b2: Point): number {\n  // Handle degenerate cases: segments of zero length\n  if (a1.x === a2.x && a1.y === a2.y) {\n    return pointToSegmentDistance(a1, b1, b2)\n  }\n  if (b1.x === b2.x && b1.y === b2.y) {\n    return pointToSegmentDistance(b1, a1, a2)\n  }\n\n  // Check if segments intersect\n  if (doSegmentsIntersect(a1, a2, b1, b2)) {\n    return 0\n  }\n\n  // Compute the minimum distance between the segments\n  const distances = [\n    pointToSegmentDistance(a1, b1, b2),\n    pointToSegmentDistance(a2, b1, b2),\n    pointToSegmentDistance(b1, a1, a2),\n    pointToSegmentDistance(b2, a1, a2),\n  ]\n\n  return Math.min(...distances)\n}\n\n/**\n * Returns the minimum distance between a point and a segment.\n */\nexport function pointToSegmentDistance(p: Point, v: Point, w: Point): number {\n  const l2 = (w.x - v.x) ** 2 + (w.y - v.y) ** 2\n  if (l2 === 0) return distance(p, v)\n\n  let t = ((p.x - v.x) * (w.x - v.x) + (p.y - v.y) * (w.y - v.y)) / l2\n  t = Math.max(0, Math.min(1, t))\n\n  const projection = {\n    x: v.x + t * (w.x - v.x),\n    y: v.y + t * (w.y - v.y),\n  }\n\n  return distance(p, projection)\n}\n\n/**\n * Returns the distance between two points.\n */\nexport function distance(p1: Point, p2: Point): number {\n  const dx = p1.x - p2.x\n  const dy = p1.y - p2.y\n  return Math.sqrt(dx * dx + dy * dy)\n}\n\n/**\n * Calculates the intersection point of two line segments.\n * Returns the intersection point {x, y} if the segments intersect, otherwise returns null.\n */\nexport function getSegmentIntersection(\n  a: Point,\n  b: Point,\n  u: Point,\n  v: Point,\n): Point | null {\n  const dx1 = b.x - a.x\n  const dy1 = b.y - a.y\n  const dx2 = v.x - u.x\n  const dy2 = v.y - u.y\n  const dx3 = a.x - u.x\n  const dy3 = a.y - u.y\n\n  const denominator = dx1 * dy2 - dy1 * dx2\n\n  // Check if lines are parallel or collinear\n  if (Math.abs(denominator) < 1e-10) {\n    // Lines are parallel or collinear\n    // We could add checks for collinear overlapping segments if needed,\n    // but for now, we return null as a single intersection point doesn't exist.\n    // The doSegmentsIntersect function handles collinearity checks if only a boolean is needed.\n    return null\n  }\n\n  // Correct formula for t (parameter for segment ab)\n  // t = (dy3 * dx2 - dx3 * dy2) / denominator\n  // The formula previously used was -(dy3 * dx2 - dx3 * dy2) / denominator\n  const t = (dy3 * dx2 - dx3 * dy2) / denominator\n  // Correct formula for s (parameter for segment uv)\n  // s = (dx1 * dy3 - dy1 * dx3) / denominator\n  // The formula previously used was incorrect.\n  const s = (dx1 * dy3 - dy1 * dx3) / denominator\n\n  // Check if the intersection point lies within both segments\n  // Use a small epsilon for floating point comparisons near 0 and 1\n  const epsilon = 1e-9\n  if (t >= -epsilon && t <= 1 + epsilon && s >= -epsilon && s <= 1 + epsilon) {\n    const intersectionX = a.x + t * dx1\n    const intersectionY = a.y + t * dy1\n    return { x: intersectionX, y: intersectionY }\n  }\n\n  // Segments do not intersect within their bounds\n  return null\n}\n"],"mappings":";AAKO,SAAS,sBACd,CAAC,IAAI,EAAE,GACP,CAAC,IAAI,EAAE,GACP;AAAA,EACE,gBAAgB;AAClB,IAEI,CAAC,GACI;AACT,MAAI,kBAAkB,GAAG;AACvB,WAAO,oBAAoB,IAAI,IAAI,IAAI,EAAE;AAAA,EAC3C;AACA,QAAM,UAAU,iBAAiB,IAAI,IAAI,IAAI,EAAE;AAC/C,SAAO,WAAW;AACpB;AAKO,SAAS,oBACd,IACA,IACA,IACA,IACS;AACT,QAAM,KAAK,YAAY,IAAI,IAAI,EAAE;AACjC,QAAM,KAAK,YAAY,IAAI,IAAI,EAAE;AACjC,QAAM,KAAK,YAAY,IAAI,IAAI,EAAE;AACjC,QAAM,KAAK,YAAY,IAAI,IAAI,EAAE;AAGjC,MAAI,OAAO,MAAM,OAAO,IAAI;AAC1B,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,KAAK,UAAU,IAAI,IAAI,EAAE,EAAG,QAAO;AAC9C,MAAI,OAAO,KAAK,UAAU,IAAI,IAAI,EAAE,EAAG,QAAO;AAC9C,MAAI,OAAO,KAAK,UAAU,IAAI,IAAI,EAAE,EAAG,QAAO;AAC9C,MAAI,OAAO,KAAK,UAAU,IAAI,IAAI,EAAE,EAAG,QAAO;AAE9C,SAAO;AACT;AAKO,SAAS,YAAY,GAAU,GAAU,GAAkB;AAChE,QAAM,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;AAC/D,MAAI,QAAQ,EAAG,QAAO;AACtB,SAAO,MAAM,IAAI,IAAI;AACvB;AAKO,SAAS,UAAU,GAAU,GAAU,GAAmB;AAC/D,SACE,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC,KACxB,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC,KACxB,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC,KACxB,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;AAE5B;AAKA,SAAS,iBAAiB,IAAW,IAAW,IAAW,IAAmB;AAE5E,MAAI,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG;AAClC,WAAO,uBAAuB,IAAI,IAAI,EAAE;AAAA,EAC1C;AACA,MAAI,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG;AAClC,WAAO,uBAAuB,IAAI,IAAI,EAAE;AAAA,EAC1C;AAGA,MAAI,oBAAoB,IAAI,IAAI,IAAI,EAAE,GAAG;AACvC,WAAO;AAAA,EACT;AAGA,QAAM,YAAY;AAAA,IAChB,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,EACnC;AAEA,SAAO,KAAK,IAAI,GAAG,SAAS;AAC9B;AAKO,SAAS,uBAAuB,GAAU,GAAU,GAAkB;AAC3E,QAAM,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,EAAE,IAAI,EAAE,MAAM;AAC7C,MAAI,OAAO,EAAG,QAAO,SAAS,GAAG,CAAC;AAElC,MAAI,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;AAClE,MAAI,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;AAE9B,QAAM,aAAa;AAAA,IACjB,GAAG,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAAA,IACtB,GAAG,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAAA,EACxB;AAEA,SAAO,SAAS,GAAG,UAAU;AAC/B;AAKO,SAAS,SAAS,IAAW,IAAmB;AACrD,QAAM,KAAK,GAAG,IAAI,GAAG;AACrB,QAAM,KAAK,GAAG,IAAI,GAAG;AACrB,SAAO,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE;AACpC;AAMO,SAAS,uBACd,GACA,GACA,GACA,GACc;AACd,QAAM,MAAM,EAAE,IAAI,EAAE;AACpB,QAAM,MAAM,EAAE,IAAI,EAAE;AACpB,QAAM,MAAM,EAAE,IAAI,EAAE;AACpB,QAAM,MAAM,EAAE,IAAI,EAAE;AACpB,QAAM,MAAM,EAAE,IAAI,EAAE;AACpB,QAAM,MAAM,EAAE,IAAI,EAAE;AAEpB,QAAM,cAAc,MAAM,MAAM,MAAM;AAGtC,MAAI,KAAK,IAAI,WAAW,IAAI,OAAO;AAKjC,WAAO;AAAA,EACT;AAKA,QAAM,KAAK,MAAM,MAAM,MAAM,OAAO;AAIpC,QAAM,KAAK,MAAM,MAAM,MAAM,OAAO;AAIpC,QAAM,UAAU;AAChB,MAAI,KAAK,CAAC,WAAW,KAAK,IAAI,WAAW,KAAK,CAAC,WAAW,KAAK,IAAI,SAAS;AAC1E,UAAM,gBAAgB,EAAE,IAAI,IAAI;AAChC,UAAM,gBAAgB,EAAE,IAAI,IAAI;AAChC,WAAO,EAAE,GAAG,eAAe,GAAG,cAAc;AAAA,EAC9C;AAGA,SAAO;AACT;","names":[]}
+{"version":3,"sources":["../src/line-intersections.ts"],"sourcesContent":["import type { Point } from \"./common\"\n\n/**\n * Returns true if the two lines intersect.\n */\nexport function doesLineIntersectLine(\n  [a1, a2]: [Point, Point],\n  [b1, b2]: [Point, Point],\n  {\n    lineThickness = 0,\n  }: {\n    lineThickness?: number\n  } = {},\n): boolean {\n  if (lineThickness === 0) {\n    return doSegmentsIntersect(a1, a2, b1, b2)\n  }\n  const minDist = segmentsDistance(a1, a2, b1, b2)\n  return minDist <= lineThickness\n}\n\n/**\n * Returns true if the two segments intersect.\n */\nexport function doSegmentsIntersect(\n  p1: Point,\n  q1: Point,\n  p2: Point,\n  q2: Point,\n): boolean {\n  const o1 = orientation(p1, q1, p2)\n  const o2 = orientation(p1, q1, q2)\n  const o3 = orientation(p2, q2, p1)\n  const o4 = orientation(p2, q2, q1)\n\n  // General case\n  if (o1 !== o2 && o3 !== o4) {\n    return true\n  }\n\n  // Special Cases\n  if (o1 === 0 && onSegment(p1, p2, q1)) return true\n  if (o2 === 0 && onSegment(p1, q2, q1)) return true\n  if (o3 === 0 && onSegment(p2, p1, q2)) return true\n  if (o4 === 0 && onSegment(p2, q1, q2)) return true\n\n  return false\n}\n\n/**\n * Returns 0 if the points are colinear, 1 if they are clockwise, and 2 if they are counterclockwise.\n */\nexport function orientation(p: Point, q: Point, r: Point): number {\n  const val = (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y)\n  if (val === 0) return 0 // colinear\n  return val > 0 ? 1 : 2 // clock or counterclock wise\n}\n\n/**\n * Returns true if q is on the segment p->r.\n */\nexport function onSegment(p: Point, q: Point, r: Point): boolean {\n  return (\n    q.x <= Math.max(p.x, r.x) &&\n    q.x >= Math.min(p.x, r.x) &&\n    q.y <= Math.max(p.y, r.y) &&\n    q.y >= Math.min(p.y, r.y)\n  )\n}\n\n/**\n * Returns the minimum distance between two segments.\n */\nfunction segmentsDistance(a1: Point, a2: Point, b1: Point, b2: Point): number {\n  // Handle degenerate cases: segments of zero length\n  if (a1.x === a2.x && a1.y === a2.y) {\n    return pointToSegmentDistance(a1, b1, b2)\n  }\n  if (b1.x === b2.x && b1.y === b2.y) {\n    return pointToSegmentDistance(b1, a1, a2)\n  }\n\n  // Check if segments intersect\n  if (doSegmentsIntersect(a1, a2, b1, b2)) {\n    return 0\n  }\n\n  // Compute the minimum distance between the segments\n  const distances = [\n    pointToSegmentDistance(a1, b1, b2),\n    pointToSegmentDistance(a2, b1, b2),\n    pointToSegmentDistance(b1, a1, a2),\n    pointToSegmentDistance(b2, a1, a2),\n  ]\n\n  return Math.min(...distances)\n}\n\n/**\n * Returns the minimum distance between a point and a segment.\n */\nexport function pointToSegmentDistance(p: Point, v: Point, w: Point): number {\n  const l2 = (w.x - v.x) ** 2 + (w.y - v.y) ** 2\n  if (l2 === 0) return distance(p, v)\n\n  let t = ((p.x - v.x) * (w.x - v.x) + (p.y - v.y) * (w.y - v.y)) / l2\n  t = Math.max(0, Math.min(1, t))\n\n  const projection = {\n    x: v.x + t * (w.x - v.x),\n    y: v.y + t * (w.y - v.y),\n  }\n\n  return distance(p, projection)\n}\n\n/**\n * Returns the distance between two points.\n */\nexport function distance(p1: Point, p2: Point): number {\n  const dx = p1.x - p2.x\n  const dy = p1.y - p2.y\n  return Math.sqrt(dx * dx + dy * dy)\n}\n\n/**\n * Calculates the intersection point of two line segments.\n * Returns the intersection point {x, y} if the segments intersect, otherwise returns null.\n */\nexport function getSegmentIntersection(\n  a: Point,\n  b: Point,\n  u: Point,\n  v: Point,\n): Point | null {\n  const dx1 = b.x - a.x\n  const dy1 = b.y - a.y\n  const dx2 = v.x - u.x\n  const dy2 = v.y - u.y\n  const dx3 = a.x - u.x\n  const dy3 = a.y - u.y\n\n  const denominator = dx1 * dy2 - dy1 * dx2\n\n  // Check if lines are parallel or collinear\n  if (Math.abs(denominator) < 1e-10) {\n    // Lines are parallel or collinear\n    // We could add checks for collinear overlapping segments if needed,\n    // but for now, we return null as a single intersection point doesn't exist.\n    // The doSegmentsIntersect function handles collinearity checks if only a boolean is needed.\n    return null\n  }\n\n  // Correct formula for t (parameter for segment ab)\n  // t = (dy3 * dx2 - dx3 * dy2) / denominator\n  // The formula previously used was -(dy3 * dx2 - dx3 * dy2) / denominator\n  const t = (dy3 * dx2 - dx3 * dy2) / denominator\n  // Correct formula for s (parameter for segment uv)\n  // s = (dx1 * dy3 - dy1 * dx3) / denominator\n  // The formula previously used was incorrect.\n  const s = (dx1 * dy3 - dy1 * dx3) / denominator\n\n  // Check if the intersection point lies within both segments\n  // Use a small epsilon for floating point comparisons near 0 and 1\n  const epsilon = 1e-9\n  if (t >= -epsilon && t <= 1 + epsilon && s >= -epsilon && s <= 1 + epsilon) {\n    const intersectionX = a.x + t * dx1\n    const intersectionY = a.y + t * dy1\n    return { x: intersectionX, y: intersectionY }\n  }\n\n  // Segments do not intersect within their bounds\n  return null\n}\n\nexport function doesSegmentIntersectRect(\n  a: Point,\n  b: Point,\n  rect: { minX: number; minY: number; maxX: number; maxY: number },\n): boolean {\n  const pointInside = (p: Point) =>\n    p.x >= rect.minX && p.x <= rect.maxX && p.y >= rect.minY && p.y <= rect.maxY\n\n  if (pointInside(a) || pointInside(b)) {\n    return true\n  }\n\n  const topLeft = { x: rect.minX, y: rect.minY }\n  const topRight = { x: rect.maxX, y: rect.minY }\n  const bottomLeft = { x: rect.minX, y: rect.maxY }\n  const bottomRight = { x: rect.maxX, y: rect.maxY }\n\n  return (\n    doSegmentsIntersect(a, b, topLeft, topRight) ||\n    doSegmentsIntersect(a, b, topRight, bottomRight) ||\n    doSegmentsIntersect(a, b, bottomRight, bottomLeft) ||\n    doSegmentsIntersect(a, b, bottomLeft, topLeft)\n  )\n}\n"],"mappings":";AAKO,SAAS,sBACd,CAAC,IAAI,EAAE,GACP,CAAC,IAAI,EAAE,GACP;AAAA,EACE,gBAAgB;AAClB,IAEI,CAAC,GACI;AACT,MAAI,kBAAkB,GAAG;AACvB,WAAO,oBAAoB,IAAI,IAAI,IAAI,EAAE;AAAA,EAC3C;AACA,QAAM,UAAU,iBAAiB,IAAI,IAAI,IAAI,EAAE;AAC/C,SAAO,WAAW;AACpB;AAKO,SAAS,oBACd,IACA,IACA,IACA,IACS;AACT,QAAM,KAAK,YAAY,IAAI,IAAI,EAAE;AACjC,QAAM,KAAK,YAAY,IAAI,IAAI,EAAE;AACjC,QAAM,KAAK,YAAY,IAAI,IAAI,EAAE;AACjC,QAAM,KAAK,YAAY,IAAI,IAAI,EAAE;AAGjC,MAAI,OAAO,MAAM,OAAO,IAAI;AAC1B,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,KAAK,UAAU,IAAI,IAAI,EAAE,EAAG,QAAO;AAC9C,MAAI,OAAO,KAAK,UAAU,IAAI,IAAI,EAAE,EAAG,QAAO;AAC9C,MAAI,OAAO,KAAK,UAAU,IAAI,IAAI,EAAE,EAAG,QAAO;AAC9C,MAAI,OAAO,KAAK,UAAU,IAAI,IAAI,EAAE,EAAG,QAAO;AAE9C,SAAO;AACT;AAKO,SAAS,YAAY,GAAU,GAAU,GAAkB;AAChE,QAAM,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;AAC/D,MAAI,QAAQ,EAAG,QAAO;AACtB,SAAO,MAAM,IAAI,IAAI;AACvB;AAKO,SAAS,UAAU,GAAU,GAAU,GAAmB;AAC/D,SACE,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC,KACxB,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC,KACxB,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC,KACxB,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;AAE5B;AAKA,SAAS,iBAAiB,IAAW,IAAW,IAAW,IAAmB;AAE5E,MAAI,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG;AAClC,WAAO,uBAAuB,IAAI,IAAI,EAAE;AAAA,EAC1C;AACA,MAAI,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG;AAClC,WAAO,uBAAuB,IAAI,IAAI,EAAE;AAAA,EAC1C;AAGA,MAAI,oBAAoB,IAAI,IAAI,IAAI,EAAE,GAAG;AACvC,WAAO;AAAA,EACT;AAGA,QAAM,YAAY;AAAA,IAChB,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,EACnC;AAEA,SAAO,KAAK,IAAI,GAAG,SAAS;AAC9B;AAKO,SAAS,uBAAuB,GAAU,GAAU,GAAkB;AAC3E,QAAM,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,EAAE,IAAI,EAAE,MAAM;AAC7C,MAAI,OAAO,EAAG,QAAO,SAAS,GAAG,CAAC;AAElC,MAAI,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;AAClE,MAAI,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;AAE9B,QAAM,aAAa;AAAA,IACjB,GAAG,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAAA,IACtB,GAAG,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAAA,EACxB;AAEA,SAAO,SAAS,GAAG,UAAU;AAC/B;AAKO,SAAS,SAAS,IAAW,IAAmB;AACrD,QAAM,KAAK,GAAG,IAAI,GAAG;AACrB,QAAM,KAAK,GAAG,IAAI,GAAG;AACrB,SAAO,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE;AACpC;AAMO,SAAS,uBACd,GACA,GACA,GACA,GACc;AACd,QAAM,MAAM,EAAE,IAAI,EAAE;AACpB,QAAM,MAAM,EAAE,IAAI,EAAE;AACpB,QAAM,MAAM,EAAE,IAAI,EAAE;AACpB,QAAM,MAAM,EAAE,IAAI,EAAE;AACpB,QAAM,MAAM,EAAE,IAAI,EAAE;AACpB,QAAM,MAAM,EAAE,IAAI,EAAE;AAEpB,QAAM,cAAc,MAAM,MAAM,MAAM;AAGtC,MAAI,KAAK,IAAI,WAAW,IAAI,OAAO;AAKjC,WAAO;AAAA,EACT;AAKA,QAAM,KAAK,MAAM,MAAM,MAAM,OAAO;AAIpC,QAAM,KAAK,MAAM,MAAM,MAAM,OAAO;AAIpC,QAAM,UAAU;AAChB,MAAI,KAAK,CAAC,WAAW,KAAK,IAAI,WAAW,KAAK,CAAC,WAAW,KAAK,IAAI,SAAS;AAC1E,UAAM,gBAAgB,EAAE,IAAI,IAAI;AAChC,UAAM,gBAAgB,EAAE,IAAI,IAAI;AAChC,WAAO,EAAE,GAAG,eAAe,GAAG,cAAc;AAAA,EAC9C;AAGA,SAAO;AACT;AAEO,SAAS,yBACd,GACA,GACA,MACS;AACT,QAAM,cAAc,CAAC,MACnB,EAAE,KAAK,KAAK,QAAQ,EAAE,KAAK,KAAK,QAAQ,EAAE,KAAK,KAAK,QAAQ,EAAE,KAAK,KAAK;AAE1E,MAAI,YAAY,CAAC,KAAK,YAAY,CAAC,GAAG;AACpC,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,EAAE,GAAG,KAAK,MAAM,GAAG,KAAK,KAAK;AAC7C,QAAM,WAAW,EAAE,GAAG,KAAK,MAAM,GAAG,KAAK,KAAK;AAC9C,QAAM,aAAa,EAAE,GAAG,KAAK,MAAM,GAAG,KAAK,KAAK;AAChD,QAAM,cAAc,EAAE,GAAG,KAAK,MAAM,GAAG,KAAK,KAAK;AAEjD,SACE,oBAAoB,GAAG,GAAG,SAAS,QAAQ,KAC3C,oBAAoB,GAAG,GAAG,UAAU,WAAW,KAC/C,oBAAoB,GAAG,GAAG,aAAa,UAAU,KACjD,oBAAoB,GAAG,GAAG,YAAY,OAAO;AAEjD;","names":[]}

package/dist/{chunk-SLG2OU3P.js → chunk-KJEUHNRF.js}

@@ -1,9 +1,9 @@
-import {
-  distance
-} from "./chunk-3453HRP7.js";
 import {
   clamp
 } from "./chunk-MHHTZHOJ.js";
+import {
+  distance
+} from "./chunk-EFLPMB4J.js";
 
 // src/point-distance.ts
 function pointToBoxDistance(p, box) {
@@ -46,4 +46,4 @@ export {
   midpoint,
   distSq
 };
-//# sourceMappingURL=chunk-SLG2OU3P.js.map
+//# sourceMappingURL=chunk-KJEUHNRF.js.map

package/dist/chunk-KVGAXIWH.js

@@ -0,0 +1,11 @@
+// src/bounds-distance.ts
+var boundsDistance = (bounds1, bounds2) => {
+  const dx = bounds1.maxX < bounds2.minX ? bounds2.minX - bounds1.maxX : bounds2.maxX < bounds1.minX ? bounds1.minX - bounds2.maxX : 0;
+  const dy = bounds1.maxY < bounds2.minY ? bounds2.minY - bounds1.maxY : bounds2.maxY < bounds1.minY ? bounds1.minY - bounds2.maxY : 0;
+  return Math.sqrt(dx * dx + dy * dy);
+};
+
+export {
+  boundsDistance
+};
+//# sourceMappingURL=chunk-KVGAXIWH.js.map

package/dist/chunk-KVGAXIWH.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/bounds-distance.ts"],"sourcesContent":["import type { Bounds } from \"./common\"\n\n/**\n * Computes the minimum distance between two bounding rectangles\n * @param bounds1 First bounding rectangle\n * @param bounds2 Second bounding rectangle\n * @returns The minimum distance. Returns 0 if the bounds overlap or touch\n */\nexport const boundsDistance = (bounds1: Bounds, bounds2: Bounds): number => {\n  const dx =\n    bounds1.maxX < bounds2.minX\n      ? bounds2.minX - bounds1.maxX\n      : bounds2.maxX < bounds1.minX\n        ? bounds1.minX - bounds2.maxX\n        : 0\n\n  const dy =\n    bounds1.maxY < bounds2.minY\n      ? bounds2.minY - bounds1.maxY\n      : bounds2.maxY < bounds1.minY\n        ? bounds1.minY - bounds2.maxY\n        : 0\n\n  return Math.sqrt(dx * dx + dy * dy)\n}\n"],"mappings":";AAQO,IAAM,iBAAiB,CAAC,SAAiB,YAA4B;AAC1E,QAAM,KACJ,QAAQ,OAAO,QAAQ,OACnB,QAAQ,OAAO,QAAQ,OACvB,QAAQ,OAAO,QAAQ,OACrB,QAAQ,OAAO,QAAQ,OACvB;AAER,QAAM,KACJ,QAAQ,OAAO,QAAQ,OACnB,QAAQ,OAAO,QAAQ,OACvB,QAAQ,OAAO,QAAQ,OACrB,QAAQ,OAAO,QAAQ,OACvB;AAER,SAAO,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE;AACpC;","names":[]}

package/dist/chunk-KY53E6CT.js

@@ -0,0 +1,29 @@
+// src/range.ts
+function range(start, end, step = 1) {
+  if (step === 0) throw new Error("step cannot be 0");
+  let _start;
+  let _end;
+  if (end === void 0) {
+    _start = 0;
+    _end = start;
+  } else {
+    _start = start;
+    _end = end;
+  }
+  const result = [];
+  if (step > 0) {
+    for (let i = _start; i < _end; i += step) {
+      result.push(i);
+    }
+  } else {
+    for (let i = _start; i > _end; i += step) {
+      result.push(i);
+    }
+  }
+  return result;
+}
+
+export {
+  range
+};
+//# sourceMappingURL=chunk-KY53E6CT.js.map

package/dist/chunk-KY53E6CT.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/range.ts"],"sourcesContent":["export function range(start: number, end?: number, step = 1): number[] {\n  if (step === 0) throw new Error(\"step cannot be 0\")\n  let _start: number\n  let _end: number\n\n  if (end === undefined) {\n    _start = 0\n    _end = start\n  } else {\n    _start = start\n    _end = end\n  }\n\n  const result: number[] = []\n\n  if (step > 0) {\n    for (let i = _start; i < _end; i += step) {\n      result.push(i)\n    }\n  } else {\n    for (let i = _start; i > _end; i += step) {\n      result.push(i)\n    }\n  }\n  return result\n}\n"],"mappings":";AAAO,SAAS,MAAM,OAAe,KAAc,OAAO,GAAa;AACrE,MAAI,SAAS,EAAG,OAAM,IAAI,MAAM,kBAAkB;AAClD,MAAI;AACJ,MAAI;AAEJ,MAAI,QAAQ,QAAW;AACrB,aAAS;AACT,WAAO;AAAA,EACT,OAAO;AACL,aAAS;AACT,WAAO;AAAA,EACT;AAEA,QAAM,SAAmB,CAAC;AAE1B,MAAI,OAAO,GAAG;AACZ,aAAS,IAAI,QAAQ,IAAI,MAAM,KAAK,MAAM;AACxC,aAAO,KAAK,CAAC;AAAA,IACf;AAAA,EACF,OAAO;AACL,aAAS,IAAI,QAAQ,IAAI,MAAM,KAAK,MAAM;AACxC,aAAO,KAAK,CAAC;AAAA,IACf;AAAA,EACF;AACA,SAAO;AACT;","names":[]}

package/dist/{chunk-FWQGMQBW.js → chunk-OONG4FBI.js}

@@ -1,11 +1,11 @@
+import {
+  clamp
+} from "./chunk-MHHTZHOJ.js";
 import {
   distance,
   doSegmentsIntersect,
   pointToSegmentDistance
-} from "./chunk-3453HRP7.js";
-import {
-  clamp
-} from "./chunk-MHHTZHOJ.js";
+} from "./chunk-EFLPMB4J.js";
 
 // src/segment-distance.ts
 function segmentToSegmentMinDistance(a, b, u, v) {
@@ -109,4 +109,4 @@ export {
   segmentToCircleMinDistance,
   pointToSegmentClosestPoint
 };
-//# sourceMappingURL=chunk-FWQGMQBW.js.map
+//# sourceMappingURL=chunk-OONG4FBI.js.map

package/dist/chunk-YA3GC5BB.js

@@ -0,0 +1,17 @@
+// src/bounds-area-overlap.ts
+var boundsAreaOverlap = (bounds1, bounds2) => {
+  const overlapX = Math.max(
+    0,
+    Math.min(bounds1.maxX, bounds2.maxX) - Math.max(bounds1.minX, bounds2.minX)
+  );
+  const overlapY = Math.max(
+    0,
+    Math.min(bounds1.maxY, bounds2.maxY) - Math.max(bounds1.minY, bounds2.minY)
+  );
+  return overlapX * overlapY;
+};
+
+export {
+  boundsAreaOverlap
+};
+//# sourceMappingURL=chunk-YA3GC5BB.js.map

package/dist/chunk-YA3GC5BB.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/bounds-area-overlap.ts"],"sourcesContent":["import type { Bounds } from \"./common\"\n\n/**\n * Computes the overlapping area between two bounding rectangles\n * @param bounds1 First bounding rectangle\n * @param bounds2 Second bounding rectangle\n * @returns The area of overlap. Returns 0 if the bounds do not overlap\n */\nexport const boundsAreaOverlap = (bounds1: Bounds, bounds2: Bounds): number => {\n  const overlapX = Math.max(\n    0,\n    Math.min(bounds1.maxX, bounds2.maxX) - Math.max(bounds1.minX, bounds2.minX),\n  )\n  const overlapY = Math.max(\n    0,\n    Math.min(bounds1.maxY, bounds2.maxY) - Math.max(bounds1.minY, bounds2.minY),\n  )\n  return overlapX * overlapY\n}\n"],"mappings":";AAQO,IAAM,oBAAoB,CAAC,SAAiB,YAA4B;AAC7E,QAAM,WAAW,KAAK;AAAA,IACpB;AAAA,IACA,KAAK,IAAI,QAAQ,MAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,QAAQ,MAAM,QAAQ,IAAI;AAAA,EAC5E;AACA,QAAM,WAAW,KAAK;AAAA,IACpB;AAAA,IACA,KAAK,IAAI,QAAQ,MAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,QAAQ,MAAM,QAAQ,IAAI;AAAA,EAC5E;AACA,SAAO,WAAW;AACpB;","names":[]}

package/dist/index.d.ts

@@ -1,4 +1,4 @@
-export { distance, doSegmentsIntersect, doesLineIntersectLine, getSegmentIntersection, onSegment, orientation, pointToSegmentDistance } from './line-intersections.js';
+export { distance, doSegmentsIntersect, doesLineIntersectLine, doesSegmentIntersectRect, getSegmentIntersection, onSegment, orientation, pointToSegmentDistance } from './line-intersections.js';
 export { Box, BoxSet, GridCell, clamp, computeDistanceBetweenBoxes, findNearestPointsBetweenBoxSets, getBoundingBox } from './nearest-box.js';
 export { Bounds, Point } from './common.js';
 export { getUnitVectorFromDirection, getUnitVectorFromPointAToB } from './get-unit-vector.js';
@@ -6,3 +6,7 @@ export { GridCellPositions, GridOptions, grid } from './grid.js';
 export { pointToSegmentClosestPoint, segmentToBoundsMinDistance, segmentToBoxMinDistance, segmentToCircleMinDistance, segmentToSegmentMinDistance } from './segment-distance.js';
 export { distSq, midpoint, pointToBoundsDistance, pointToBoxDistance } from './point-distance.js';
 export { Point3 } from './point3.js';
+export { range } from './range.js';
+export { doBoundsOverlap } from './bounds-overlap.js';
+export { boundsAreaOverlap } from './bounds-area-overlap.js';
+export { boundsDistance } from './bounds-distance.js';

package/dist/index.js

@@ -1,10 +1,35 @@
+import {
+  distSq,
+  midpoint,
+  pointToBoundsDistance,
+  pointToBoxDistance
+} from "./chunk-KJEUHNRF.js";
+import "./chunk-MTORG67J.js";
+import {
+  range
+} from "./chunk-KY53E6CT.js";
 import {
   pointToSegmentClosestPoint,
   segmentToBoundsMinDistance,
   segmentToBoxMinDistance,
   segmentToCircleMinDistance,
   segmentToSegmentMinDistance
-} from "./chunk-FWQGMQBW.js";
+} from "./chunk-OONG4FBI.js";
+import {
+  clamp,
+  computeDistanceBetweenBoxes,
+  findNearestPointsBetweenBoxSets,
+  getBoundingBox
+} from "./chunk-MHHTZHOJ.js";
+import {
+  boundsAreaOverlap
+} from "./chunk-YA3GC5BB.js";
+import {
+  boundsDistance
+} from "./chunk-KVGAXIWH.js";
+import {
+  doBoundsOverlap
+} from "./chunk-CA5ORSO4.js";
 import "./chunk-GYQ2KZV6.js";
 import {
   getUnitVectorFromDirection,
@@ -13,35 +38,27 @@ import {
 import {
   grid
 } from "./chunk-U45EKA3R.js";
-import {
-  distSq,
-  midpoint,
-  pointToBoundsDistance,
-  pointToBoxDistance
-} from "./chunk-SLG2OU3P.js";
 import {
   distance,
   doSegmentsIntersect,
   doesLineIntersectLine,
+  doesSegmentIntersectRect,
   getSegmentIntersection,
   onSegment,
   orientation,
   pointToSegmentDistance
-} from "./chunk-3453HRP7.js";
-import {
-  clamp,
-  computeDistanceBetweenBoxes,
-  findNearestPointsBetweenBoxSets,
-  getBoundingBox
-} from "./chunk-MHHTZHOJ.js";
-import "./chunk-MTORG67J.js";
+} from "./chunk-EFLPMB4J.js";
 export {
+  boundsAreaOverlap,
+  boundsDistance,
   clamp,
   computeDistanceBetweenBoxes,
   distSq,
   distance,
+  doBoundsOverlap,
   doSegmentsIntersect,
   doesLineIntersectLine,
+  doesSegmentIntersectRect,
   findNearestPointsBetweenBoxSets,
   getBoundingBox,
   getSegmentIntersection,
@@ -55,6 +72,7 @@ export {
   pointToBoxDistance,
   pointToSegmentClosestPoint,
   pointToSegmentDistance,
+  range,
   segmentToBoundsMinDistance,
   segmentToBoxMinDistance,
   segmentToCircleMinDistance,

package/dist/line-intersections.d.ts

@@ -31,5 +31,11 @@ declare function distance(p1: Point, p2: Point): number;
  * Returns the intersection point {x, y} if the segments intersect, otherwise returns null.
  */
 declare function getSegmentIntersection(a: Point, b: Point, u: Point, v: Point): Point | null;
+declare function doesSegmentIntersectRect(a: Point, b: Point, rect: {
+    minX: number;
+    minY: number;
+    maxX: number;
+    maxY: number;
+}): boolean;
 
-export { distance, doSegmentsIntersect, doesLineIntersectLine, getSegmentIntersection, onSegment, orientation, pointToSegmentDistance };
+export { distance, doSegmentsIntersect, doesLineIntersectLine, doesSegmentIntersectRect, getSegmentIntersection, onSegment, orientation, pointToSegmentDistance };

package/dist/line-intersections.js

@@ -2,15 +2,17 @@ import {
   distance,
   doSegmentsIntersect,
   doesLineIntersectLine,
+  doesSegmentIntersectRect,
   getSegmentIntersection,
   onSegment,
   orientation,
   pointToSegmentDistance
-} from "./chunk-3453HRP7.js";
+} from "./chunk-EFLPMB4J.js";
 export {
   distance,
   doSegmentsIntersect,
   doesLineIntersectLine,
+  doesSegmentIntersectRect,
   getSegmentIntersection,
   onSegment,
   orientation,

package/dist/point-distance.js

@@ -3,9 +3,9 @@ import {
   midpoint,
   pointToBoundsDistance,
   pointToBoxDistance
-} from "./chunk-SLG2OU3P.js";
-import "./chunk-3453HRP7.js";
+} from "./chunk-KJEUHNRF.js";
 import "./chunk-MHHTZHOJ.js";
+import "./chunk-EFLPMB4J.js";
 export {
   distSq,
   midpoint,

package/dist/range.d.ts

@@ -0,0 +1,3 @@
+declare function range(start: number, end?: number, step?: number): number[];
+
+export { range };

package/dist/range.js

@@ -0,0 +1,7 @@
+import {
+  range
+} from "./chunk-KY53E6CT.js";
+export {
+  range
+};
+//# sourceMappingURL=range.js.map

package/dist/range.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/segment-distance.js

@@ -4,9 +4,9 @@ import {
   segmentToBoxMinDistance,
   segmentToCircleMinDistance,
   segmentToSegmentMinDistance
-} from "./chunk-FWQGMQBW.js";
-import "./chunk-3453HRP7.js";
+} from "./chunk-OONG4FBI.js";
 import "./chunk-MHHTZHOJ.js";
+import "./chunk-EFLPMB4J.js";
 export {
   pointToSegmentClosestPoint,
   segmentToBoundsMinDistance,

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@tscircuit/math-utils",
   "main": "dist/index.js",
-  "version": "0.0.19",
+  "version": "0.0.21",
   "type": "module",
   "module": "dist/index.js",
   "types": "dist/index.d.ts",
@@ -23,11 +23,13 @@
     "dist"
   ],
   "scripts": {
-    "build": "tsup-node src --format esm --dts --sourcemap"
+    "build": "tsup-node src --format esm --dts --sourcemap",
+    "format": "biome format . --write",
+    "format:check": "biome format . --check"
   },
   "devDependencies": {
     "@biomejs/biome": "^1.9.4",
-    "@types/bun": "latest",
+    "@types/bun": "^1.2.18",
     "tsup": "^8.2.4"
   },
   "peerDependencies": {