@tscircuit/math-utils 0.0.8 → 0.0.10

package/dist/chunk-CHQOCSFB.js

@@ -0,0 +1,76 @@
+// src/line-intersections.ts
+function doesLineIntersectLine([a1, a2], [b1, b2], {
+  lineThickness = 0
+} = {}) {
+  if (lineThickness === 0) {
+    return doSegmentsIntersect(a1, a2, b1, b2);
+  }
+  const minDist = segmentsDistance(a1, a2, b1, b2);
+  return minDist <= lineThickness;
+}
+function doSegmentsIntersect(p1, q1, p2, q2) {
+  const o1 = orientation(p1, q1, p2);
+  const o2 = orientation(p1, q1, q2);
+  const o3 = orientation(p2, q2, p1);
+  const o4 = orientation(p2, q2, q1);
+  if (o1 !== o2 && o3 !== o4) {
+    return true;
+  }
+  if (o1 === 0 && onSegment(p1, p2, q1)) return true;
+  if (o2 === 0 && onSegment(p1, q2, q1)) return true;
+  if (o3 === 0 && onSegment(p2, p1, q2)) return true;
+  if (o4 === 0 && onSegment(p2, q1, q2)) return true;
+  return false;
+}
+function orientation(p, q, r) {
+  const val = (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
+  if (val === 0) return 0;
+  return val > 0 ? 1 : 2;
+}
+function onSegment(p, q, r) {
+  return q.x <= Math.max(p.x, r.x) && q.x >= Math.min(p.x, r.x) && q.y <= Math.max(p.y, r.y) && q.y >= Math.min(p.y, r.y);
+}
+function segmentsDistance(a1, a2, b1, b2) {
+  if (a1.x === a2.x && a1.y === a2.y) {
+    return pointToSegmentDistance(a1, b1, b2);
+  }
+  if (b1.x === b2.x && b1.y === b2.y) {
+    return pointToSegmentDistance(b1, a1, a2);
+  }
+  if (doSegmentsIntersect(a1, a2, b1, b2)) {
+    return 0;
+  }
+  const distances = [
+    pointToSegmentDistance(a1, b1, b2),
+    pointToSegmentDistance(a2, b1, b2),
+    pointToSegmentDistance(b1, a1, a2),
+    pointToSegmentDistance(b2, a1, a2)
+  ];
+  return Math.min(...distances);
+}
+function pointToSegmentDistance(p, v, w) {
+  const l2 = (w.x - v.x) ** 2 + (w.y - v.y) ** 2;
+  if (l2 === 0) return distance(p, v);
+  let t = ((p.x - v.x) * (w.x - v.x) + (p.y - v.y) * (w.y - v.y)) / l2;
+  t = Math.max(0, Math.min(1, t));
+  const projection = {
+    x: v.x + t * (w.x - v.x),
+    y: v.y + t * (w.y - v.y)
+  };
+  return distance(p, projection);
+}
+function distance(p1, p2) {
+  const dx = p1.x - p2.x;
+  const dy = p1.y - p2.y;
+  return Math.sqrt(dx * dx + dy * dy);
+}
+
+export {
+  doesLineIntersectLine,
+  doSegmentsIntersect,
+  orientation,
+  onSegment,
+  pointToSegmentDistance,
+  distance
+};
+//# sourceMappingURL=chunk-CHQOCSFB.js.map

package/dist/chunk-CHQOCSFB.js.map

@@ -0,0 +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"],"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;","names":[]}

package/dist/chunk-GIGMPRPV.js

@@ -0,0 +1,30 @@
+// src/get-unit-vector.ts
+var getUnitVectorFromPointAToB = (a, b) => {
+  const delta = {
+    x: b.x - a.x,
+    y: b.y - a.y
+  };
+  const magnitude = Math.sqrt(delta.x ** 2 + delta.y ** 2);
+  return {
+    x: delta.x / magnitude,
+    y: delta.y / magnitude
+  };
+};
+var getUnitVectorFromDirection = (direction) => {
+  switch (direction) {
+    case "up":
+      return { x: 0, y: 1 };
+    case "down":
+      return { x: 0, y: -1 };
+    case "left":
+      return { x: -1, y: 0 };
+    case "right":
+      return { x: 1, y: 0 };
+  }
+};
+
+export {
+  getUnitVectorFromPointAToB,
+  getUnitVectorFromDirection
+};
+//# sourceMappingURL=chunk-GIGMPRPV.js.map

package/dist/chunk-GIGMPRPV.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/get-unit-vector.ts"],"sourcesContent":["import type { Point } from \"./common\"\n\nexport const getUnitVectorFromPointAToB = (a: Point, b: Point): Point => {\n  const delta = {\n    x: b.x - a.x,\n    y: b.y - a.y,\n  }\n\n  const magnitude = Math.sqrt(delta.x ** 2 + delta.y ** 2)\n\n  return {\n    x: delta.x / magnitude,\n    y: delta.y / magnitude,\n  }\n}\n\nexport const getUnitVectorFromDirection = (\n  direction: \"up\" | \"down\" | \"left\" | \"right\",\n): Point => {\n  switch (direction) {\n    case \"up\":\n      return { x: 0, y: 1 }\n    case \"down\":\n      return { x: 0, y: -1 }\n    case \"left\":\n      return { x: -1, y: 0 }\n    case \"right\":\n      return { x: 1, y: 0 }\n  }\n}\n"],"mappings":";AAEO,IAAM,6BAA6B,CAAC,GAAU,MAAoB;AACvE,QAAM,QAAQ;AAAA,IACZ,GAAG,EAAE,IAAI,EAAE;AAAA,IACX,GAAG,EAAE,IAAI,EAAE;AAAA,EACb;AAEA,QAAM,YAAY,KAAK,KAAK,MAAM,KAAK,IAAI,MAAM,KAAK,CAAC;AAEvD,SAAO;AAAA,IACL,GAAG,MAAM,IAAI;AAAA,IACb,GAAG,MAAM,IAAI;AAAA,EACf;AACF;AAEO,IAAM,6BAA6B,CACxC,cACU;AACV,UAAQ,WAAW;AAAA,IACjB,KAAK;AACH,aAAO,EAAE,GAAG,GAAG,GAAG,EAAE;AAAA,IACtB,KAAK;AACH,aAAO,EAAE,GAAG,GAAG,GAAG,GAAG;AAAA,IACvB,KAAK;AACH,aAAO,EAAE,GAAG,IAAI,GAAG,EAAE;AAAA,IACvB,KAAK;AACH,aAAO,EAAE,GAAG,GAAG,GAAG,EAAE;AAAA,EACxB;AACF;","names":[]}

package/dist/chunk-GYQ2KZV6.js

@@ -0,0 +1 @@
+//# sourceMappingURL=chunk-GYQ2KZV6.js.map

package/dist/chunk-GYQ2KZV6.js.map

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

package/dist/chunk-MHHTZHOJ.js

@@ -0,0 +1,62 @@
+// src/nearest-box.ts
+function getBoundingBox(box) {
+  const halfWidth = box.width / 2;
+  const halfHeight = box.height / 2;
+  return {
+    minX: box.center.x - halfWidth,
+    maxX: box.center.x + halfWidth,
+    minY: box.center.y - halfHeight,
+    maxY: box.center.y + halfHeight
+  };
+}
+function computeDistanceBetweenBoxes(boxA, boxB) {
+  const a = getBoundingBox(boxA);
+  const b = getBoundingBox(boxB);
+  const dx = Math.max(a.minX - b.maxX, b.minX - a.maxX, 0);
+  const dy = Math.max(a.minY - b.maxY, b.minY - a.maxY, 0);
+  const pointA = { x: 0, y: 0 };
+  const pointB = { x: 0, y: 0 };
+  if (dx === 0 && dy === 0) {
+    return { distance: 0, pointA: boxA.center, pointB: boxB.center };
+  }
+  pointA.x = clamp(boxA.center.x, b.minX, b.maxX);
+  pointA.y = clamp(boxA.center.y, b.minY, b.maxY);
+  pointB.x = clamp(boxB.center.x, a.minX, a.maxX);
+  pointB.y = clamp(boxB.center.y, a.minY, a.maxY);
+  const distance = Math.hypot(pointA.x - pointB.x, pointA.y - pointB.y);
+  return { distance, pointA, pointB };
+}
+function clamp(value, min, max) {
+  return Math.max(min, Math.min(max, value));
+}
+function findNearestPointsBetweenBoxSets(boxSetA, boxSetB) {
+  let minDistance = Number.POSITIVE_INFINITY;
+  let nearestPointA = { x: 0, y: 0 };
+  let nearestPointB = { x: 0, y: 0 };
+  for (const boxA of boxSetA) {
+    for (const boxB of boxSetB) {
+      const { distance, pointA, pointB } = computeDistanceBetweenBoxes(
+        boxA,
+        boxB
+      );
+      if (distance < minDistance) {
+        minDistance = distance;
+        nearestPointA = pointA;
+        nearestPointB = pointB;
+      }
+    }
+  }
+  return {
+    pointA: nearestPointA,
+    pointB: nearestPointB,
+    distance: minDistance
+  };
+}
+
+export {
+  getBoundingBox,
+  computeDistanceBetweenBoxes,
+  clamp,
+  findNearestPointsBetweenBoxSets
+};
+//# sourceMappingURL=chunk-MHHTZHOJ.js.map

package/dist/chunk-MHHTZHOJ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/nearest-box.ts"],"sourcesContent":["import type { Point } from \"./common\"\n\nexport type Box = { center: Point; width: number; height: number }\nexport type BoxSet = Box[]\n\nexport type GridCell = { boxes: Box[] }\n\nexport function getBoundingBox(box: Box) {\n  const halfWidth = box.width / 2\n  const halfHeight = box.height / 2\n  return {\n    minX: box.center.x - halfWidth,\n    maxX: box.center.x + halfWidth,\n    minY: box.center.y - halfHeight,\n    maxY: box.center.y + halfHeight,\n  }\n}\n\nexport function computeDistanceBetweenBoxes(\n  boxA: Box,\n  boxB: Box,\n): { distance: number; pointA: Point; pointB: Point } {\n  const a = getBoundingBox(boxA)\n  const b = getBoundingBox(boxB)\n\n  const dx = Math.max(a.minX - b.maxX, b.minX - a.maxX, 0)\n  const dy = Math.max(a.minY - b.maxY, b.minY - a.maxY, 0)\n\n  const pointA: Point = { x: 0, y: 0 }\n  const pointB: Point = { x: 0, y: 0 }\n\n  if (dx === 0 && dy === 0) {\n    // Boxes overlap\n    return { distance: 0, pointA: boxA.center, pointB: boxB.center }\n  }\n\n  // Compute the closest points on the edges\n  pointA.x = clamp(boxA.center.x, b.minX, b.maxX)\n  pointA.y = clamp(boxA.center.y, b.minY, b.maxY)\n\n  pointB.x = clamp(boxB.center.x, a.minX, a.maxX)\n  pointB.y = clamp(boxB.center.y, a.minY, a.maxY)\n\n  const distance = Math.hypot(pointA.x - pointB.x, pointA.y - pointB.y)\n  return { distance, pointA, pointB }\n}\n\nexport function clamp(value: number, min: number, max: number): number {\n  return Math.max(min, Math.min(max, value))\n}\n\nexport function findNearestPointsBetweenBoxSets(\n  boxSetA: BoxSet,\n  boxSetB: BoxSet,\n): { pointA: Point; pointB: Point; distance: number } {\n  let minDistance = Number.POSITIVE_INFINITY\n  let nearestPointA: Point = { x: 0, y: 0 }\n  let nearestPointB: Point = { x: 0, y: 0 }\n\n  for (const boxA of boxSetA) {\n    for (const boxB of boxSetB) {\n      const { distance, pointA, pointB } = computeDistanceBetweenBoxes(\n        boxA,\n        boxB,\n      )\n      if (distance < minDistance) {\n        minDistance = distance\n        nearestPointA = pointA\n        nearestPointB = pointB\n      }\n    }\n  }\n\n  return {\n    pointA: nearestPointA,\n    pointB: nearestPointB,\n    distance: minDistance,\n  }\n}\n"],"mappings":";AAOO,SAAS,eAAe,KAAU;AACvC,QAAM,YAAY,IAAI,QAAQ;AAC9B,QAAM,aAAa,IAAI,SAAS;AAChC,SAAO;AAAA,IACL,MAAM,IAAI,OAAO,IAAI;AAAA,IACrB,MAAM,IAAI,OAAO,IAAI;AAAA,IACrB,MAAM,IAAI,OAAO,IAAI;AAAA,IACrB,MAAM,IAAI,OAAO,IAAI;AAAA,EACvB;AACF;AAEO,SAAS,4BACd,MACA,MACoD;AACpD,QAAM,IAAI,eAAe,IAAI;AAC7B,QAAM,IAAI,eAAe,IAAI;AAE7B,QAAM,KAAK,KAAK,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC;AACvD,QAAM,KAAK,KAAK,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC;AAEvD,QAAM,SAAgB,EAAE,GAAG,GAAG,GAAG,EAAE;AACnC,QAAM,SAAgB,EAAE,GAAG,GAAG,GAAG,EAAE;AAEnC,MAAI,OAAO,KAAK,OAAO,GAAG;AAExB,WAAO,EAAE,UAAU,GAAG,QAAQ,KAAK,QAAQ,QAAQ,KAAK,OAAO;AAAA,EACjE;AAGA,SAAO,IAAI,MAAM,KAAK,OAAO,GAAG,EAAE,MAAM,EAAE,IAAI;AAC9C,SAAO,IAAI,MAAM,KAAK,OAAO,GAAG,EAAE,MAAM,EAAE,IAAI;AAE9C,SAAO,IAAI,MAAM,KAAK,OAAO,GAAG,EAAE,MAAM,EAAE,IAAI;AAC9C,SAAO,IAAI,MAAM,KAAK,OAAO,GAAG,EAAE,MAAM,EAAE,IAAI;AAE9C,QAAM,WAAW,KAAK,MAAM,OAAO,IAAI,OAAO,GAAG,OAAO,IAAI,OAAO,CAAC;AACpE,SAAO,EAAE,UAAU,QAAQ,OAAO;AACpC;AAEO,SAAS,MAAM,OAAe,KAAa,KAAqB;AACrE,SAAO,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC;AAC3C;AAEO,SAAS,gCACd,SACA,SACoD;AACpD,MAAI,cAAc,OAAO;AACzB,MAAI,gBAAuB,EAAE,GAAG,GAAG,GAAG,EAAE;AACxC,MAAI,gBAAuB,EAAE,GAAG,GAAG,GAAG,EAAE;AAExC,aAAW,QAAQ,SAAS;AAC1B,eAAW,QAAQ,SAAS;AAC1B,YAAM,EAAE,UAAU,QAAQ,OAAO,IAAI;AAAA,QACnC;AAAA,QACA;AAAA,MACF;AACA,UAAI,WAAW,aAAa;AAC1B,sBAAc;AACd,wBAAgB;AAChB,wBAAgB;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,UAAU;AAAA,EACZ;AACF;","names":[]}

package/dist/chunk-U45EKA3R.js

@@ -0,0 +1,51 @@
+// src/grid.ts
+function grid({
+  rows,
+  cols,
+  xSpacing,
+  ySpacing,
+  width,
+  height,
+  offsetX = 0,
+  offsetY = 0,
+  yDirection = "cartesian",
+  centered = true
+}) {
+  const effectiveXSpacing = xSpacing ?? 1;
+  const effectiveYSpacing = ySpacing ?? 1;
+  const totalWidth = width ?? cols * effectiveXSpacing;
+  const totalHeight = height ?? rows * effectiveYSpacing;
+  const centeringOffsetX = centered ? -totalWidth / 2 : 0;
+  const centeringOffsetY = centered ? -totalHeight / 2 : 0;
+  const cellWidth = width ? width / cols : effectiveXSpacing;
+  const cellHeight = height ? height / rows : effectiveYSpacing;
+  const cells = [];
+  for (let row = 0; row < rows; row++) {
+    for (let col = 0; col < cols; col++) {
+      const index = row * cols + col;
+      const centerX = offsetX + centeringOffsetX + col * cellWidth + cellWidth / 2;
+      const rawCenterY = offsetY + row * cellHeight + cellHeight / 2;
+      const centerY = yDirection === "cartesian" ? offsetY + centeringOffsetY + (rows - 1 - row) * cellHeight + cellHeight / 2 : offsetY + centeringOffsetY + row * cellHeight + cellHeight / 2;
+      cells.push({
+        index,
+        center: { x: centerX, y: centerY },
+        topLeft: {
+          x: centerX - cellWidth / 2,
+          y: centerY + cellHeight / 2
+        },
+        bottomRight: {
+          x: centerX + cellWidth / 2,
+          y: centerY - cellHeight / 2
+        },
+        row,
+        col
+      });
+    }
+  }
+  return cells;
+}
+
+export {
+  grid
+};
+//# sourceMappingURL=chunk-U45EKA3R.js.map

package/dist/chunk-U45EKA3R.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/grid.ts"],"sourcesContent":["import type { Point } from \"./common\"\n\nexport type GridCellPositions = {\n  index: number\n  row: number\n  col: number\n  center: Point\n  topLeft: Point\n  bottomRight: Point\n}\n\nexport type GridOptions = {\n  rows: number\n  cols: number\n  xSpacing?: number\n  ySpacing?: number\n  width?: number\n  height?: number\n  offsetX?: number\n  offsetY?: number\n  yDirection?: \"cartesian\" | \"up-is-negative\"\n  centered?: boolean\n}\n\nexport function grid({\n  rows,\n  cols,\n  xSpacing,\n  ySpacing,\n  width,\n  height,\n  offsetX = 0,\n  offsetY = 0,\n  yDirection = \"cartesian\",\n  centered = true,\n}: GridOptions): GridCellPositions[] {\n  // Set default spacing if neither spacing nor dimensions are specified\n  const effectiveXSpacing = xSpacing ?? 1\n  const effectiveYSpacing = ySpacing ?? 1\n\n  // Calculate cell dimensions\n  const totalWidth = width ?? cols * effectiveXSpacing\n  const totalHeight = height ?? rows * effectiveYSpacing\n\n  // Calculate centering offsets if needed\n  const centeringOffsetX = centered ? -totalWidth / 2 : 0\n  const centeringOffsetY = centered ? -totalHeight / 2 : 0\n\n  const cellWidth = width ? width / cols : effectiveXSpacing\n  const cellHeight = height ? height / rows : effectiveYSpacing\n\n  const cells: GridCellPositions[] = []\n\n  for (let row = 0; row < rows; row++) {\n    for (let col = 0; col < cols; col++) {\n      const index = row * cols + col\n\n      // Calculate center position\n      const centerX =\n        offsetX + centeringOffsetX + col * cellWidth + cellWidth / 2\n      const rawCenterY = offsetY + row * cellHeight + cellHeight / 2\n\n      // Adjust Y coordinate based on yDirection\n      const centerY =\n        yDirection === \"cartesian\"\n          ? offsetY +\n            centeringOffsetY +\n            (rows - 1 - row) * cellHeight +\n            cellHeight / 2\n          : offsetY + centeringOffsetY + row * cellHeight + cellHeight / 2\n\n      cells.push({\n        index,\n        center: { x: centerX, y: centerY },\n        topLeft: {\n          x: centerX - cellWidth / 2,\n          y: centerY + cellHeight / 2,\n        },\n        bottomRight: {\n          x: centerX + cellWidth / 2,\n          y: centerY - cellHeight / 2,\n        },\n        row,\n        col,\n      })\n    }\n  }\n\n  return cells\n}\n"],"mappings":";AAwBO,SAAS,KAAK;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,UAAU;AAAA,EACV,UAAU;AAAA,EACV,aAAa;AAAA,EACb,WAAW;AACb,GAAqC;AAEnC,QAAM,oBAAoB,YAAY;AACtC,QAAM,oBAAoB,YAAY;AAGtC,QAAM,aAAa,SAAS,OAAO;AACnC,QAAM,cAAc,UAAU,OAAO;AAGrC,QAAM,mBAAmB,WAAW,CAAC,aAAa,IAAI;AACtD,QAAM,mBAAmB,WAAW,CAAC,cAAc,IAAI;AAEvD,QAAM,YAAY,QAAQ,QAAQ,OAAO;AACzC,QAAM,aAAa,SAAS,SAAS,OAAO;AAE5C,QAAM,QAA6B,CAAC;AAEpC,WAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,YAAM,QAAQ,MAAM,OAAO;AAG3B,YAAM,UACJ,UAAU,mBAAmB,MAAM,YAAY,YAAY;AAC7D,YAAM,aAAa,UAAU,MAAM,aAAa,aAAa;AAG7D,YAAM,UACJ,eAAe,cACX,UACA,oBACC,OAAO,IAAI,OAAO,aACnB,aAAa,IACb,UAAU,mBAAmB,MAAM,aAAa,aAAa;AAEnE,YAAM,KAAK;AAAA,QACT;AAAA,QACA,QAAQ,EAAE,GAAG,SAAS,GAAG,QAAQ;AAAA,QACjC,SAAS;AAAA,UACP,GAAG,UAAU,YAAY;AAAA,UACzB,GAAG,UAAU,aAAa;AAAA,QAC5B;AAAA,QACA,aAAa;AAAA,UACX,GAAG,UAAU,YAAY;AAAA,UACzB,GAAG,UAAU,aAAa;AAAA,QAC5B;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}

package/dist/common.d.ts

@@ -0,0 +1,6 @@
+type Point = {
+    x: number;
+    y: number;
+};
+
+export type { Point };

package/dist/common.js

@@ -0,0 +1,2 @@
+import "./chunk-GYQ2KZV6.js";
+//# sourceMappingURL=common.js.map

package/dist/common.js.map

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

package/dist/get-unit-vector.d.ts

@@ -0,0 +1,6 @@
+import { Point } from './common.js';
+
+declare const getUnitVectorFromPointAToB: (a: Point, b: Point) => Point;
+declare const getUnitVectorFromDirection: (direction: "up" | "down" | "left" | "right") => Point;
+
+export { getUnitVectorFromDirection, getUnitVectorFromPointAToB };

package/dist/get-unit-vector.js

@@ -0,0 +1,9 @@
+import {
+  getUnitVectorFromDirection,
+  getUnitVectorFromPointAToB
+} from "./chunk-GIGMPRPV.js";
+export {
+  getUnitVectorFromDirection,
+  getUnitVectorFromPointAToB
+};
+//# sourceMappingURL=get-unit-vector.js.map

package/dist/get-unit-vector.js.map

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

package/dist/grid.d.ts

@@ -0,0 +1,25 @@
+import { Point } from './common.js';
+
+type GridCellPositions = {
+    index: number;
+    row: number;
+    col: number;
+    center: Point;
+    topLeft: Point;
+    bottomRight: Point;
+};
+type GridOptions = {
+    rows: number;
+    cols: number;
+    xSpacing?: number;
+    ySpacing?: number;
+    width?: number;
+    height?: number;
+    offsetX?: number;
+    offsetY?: number;
+    yDirection?: "cartesian" | "up-is-negative";
+    centered?: boolean;
+};
+declare function grid({ rows, cols, xSpacing, ySpacing, width, height, offsetX, offsetY, yDirection, centered, }: GridOptions): GridCellPositions[];
+
+export { type GridCellPositions, type GridOptions, grid };

package/dist/grid.js

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

package/dist/grid.js.map

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

package/dist/index.d.ts

@@ -1,83 +1,5 @@
-type Point = {
-    x: number;
-    y: number;
-};
-
-/**
- * Returns true if the two lines intersect.
- */
-declare function doesLineIntersectLine([a1, a2]: [Point, Point], [b1, b2]: [Point, Point], { lineThickness, }?: {
-    lineThickness?: number;
-}): boolean;
-/**
- * Returns true if the two segments intersect.
- */
-declare function doSegmentsIntersect(p1: Point, q1: Point, p2: Point, q2: Point): boolean;
-/**
- * Returns 0 if the points are colinear, 1 if they are clockwise, and 2 if they are counterclockwise.
- */
-declare function orientation(p: Point, q: Point, r: Point): number;
-/**
- * Returns true if q is on the segment p->r.
- */
-declare function onSegment(p: Point, q: Point, r: Point): boolean;
-/**
- * Returns the minimum distance between a point and a segment.
- */
-declare function pointToSegmentDistance(p: Point, v: Point, w: Point): number;
-/**
- * Returns the distance between two points.
- */
-declare function distance(p1: Point, p2: Point): number;
-
-type Box = {
-    center: Point;
-    width: number;
-    height: number;
-};
-type BoxSet = Box[];
-type GridCell = {
-    boxes: Box[];
-};
-declare function getBoundingBox(box: Box): {
-    minX: number;
-    maxX: number;
-    minY: number;
-    maxY: number;
-};
-declare function computeDistanceBetweenBoxes(boxA: Box, boxB: Box): {
-    distance: number;
-    pointA: Point;
-    pointB: Point;
-};
-declare function clamp(value: number, min: number, max: number): number;
-declare function findNearestPointsBetweenBoxSets(boxSetA: BoxSet, boxSetB: BoxSet): {
-    pointA: Point;
-    pointB: Point;
-    distance: number;
-};
-
-declare const getUnitVectorFromPointAToB: (a: Point, b: Point) => Point;
-declare const getUnitVectorFromDirection: (direction: "up" | "down" | "left" | "right") => Point;
-
-type GridCellPositions = {
-    index: number;
-    center: Point;
-    topLeft: Point;
-    bottomRight: Point;
-};
-type GridOptions = {
-    rows: number;
-    cols: number;
-    xSpacing?: number;
-    ySpacing?: number;
-    width?: number;
-    height?: number;
-    offsetX?: number;
-    offsetY?: number;
-    yDirection?: "cartesian" | "up-is-negative";
-    centered?: boolean;
-};
-declare function grid({ rows, cols, xSpacing, ySpacing, width, height, offsetX, offsetY, yDirection, centered, }: GridOptions): GridCellPositions[];
-
-export { type Box, type BoxSet, type GridCell, type GridCellPositions, type GridOptions, type Point, clamp, computeDistanceBetweenBoxes, distance, doSegmentsIntersect, doesLineIntersectLine, findNearestPointsBetweenBoxSets, getBoundingBox, getUnitVectorFromDirection, getUnitVectorFromPointAToB, grid, onSegment, orientation, pointToSegmentDistance };
+export { distance, doSegmentsIntersect, doesLineIntersectLine, onSegment, orientation, pointToSegmentDistance } from './line-intersections.js';
+export { Box, BoxSet, GridCell, clamp, computeDistanceBetweenBoxes, findNearestPointsBetweenBoxSets, getBoundingBox } from './nearest-box.js';
+export { Point } from './common.js';
+export { getUnitVectorFromDirection, getUnitVectorFromPointAToB } from './get-unit-vector.js';
+export { GridCellPositions, GridOptions, grid } from './grid.js';

package/dist/index.js

@@ -1,194 +1,25 @@
-// src/line-intersections.ts
-function doesLineIntersectLine([a1, a2], [b1, b2], {
-  lineThickness = 0
-} = {}) {
-  if (lineThickness === 0) {
-    return doSegmentsIntersect(a1, a2, b1, b2);
-  }
-  const minDist = segmentsDistance(a1, a2, b1, b2);
-  return minDist <= lineThickness;
-}
-function doSegmentsIntersect(p1, q1, p2, q2) {
-  const o1 = orientation(p1, q1, p2);
-  const o2 = orientation(p1, q1, q2);
-  const o3 = orientation(p2, q2, p1);
-  const o4 = orientation(p2, q2, q1);
-  if (o1 !== o2 && o3 !== o4) {
-    return true;
-  }
-  if (o1 === 0 && onSegment(p1, p2, q1)) return true;
-  if (o2 === 0 && onSegment(p1, q2, q1)) return true;
-  if (o3 === 0 && onSegment(p2, p1, q2)) return true;
-  if (o4 === 0 && onSegment(p2, q1, q2)) return true;
-  return false;
-}
-function orientation(p, q, r) {
-  const val = (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
-  if (val === 0) return 0;
-  return val > 0 ? 1 : 2;
-}
-function onSegment(p, q, r) {
-  return q.x <= Math.max(p.x, r.x) && q.x >= Math.min(p.x, r.x) && q.y <= Math.max(p.y, r.y) && q.y >= Math.min(p.y, r.y);
-}
-function segmentsDistance(a1, a2, b1, b2) {
-  if (a1.x === a2.x && a1.y === a2.y) {
-    return pointToSegmentDistance(a1, b1, b2);
-  }
-  if (b1.x === b2.x && b1.y === b2.y) {
-    return pointToSegmentDistance(b1, a1, a2);
-  }
-  if (doSegmentsIntersect(a1, a2, b1, b2)) {
-    return 0;
-  }
-  const distances = [
-    pointToSegmentDistance(a1, b1, b2),
-    pointToSegmentDistance(a2, b1, b2),
-    pointToSegmentDistance(b1, a1, a2),
-    pointToSegmentDistance(b2, a1, a2)
-  ];
-  return Math.min(...distances);
-}
-function pointToSegmentDistance(p, v, w) {
-  const l2 = (w.x - v.x) ** 2 + (w.y - v.y) ** 2;
-  if (l2 === 0) return distance(p, v);
-  let t = ((p.x - v.x) * (w.x - v.x) + (p.y - v.y) * (w.y - v.y)) / l2;
-  t = Math.max(0, Math.min(1, t));
-  const projection = {
-    x: v.x + t * (w.x - v.x),
-    y: v.y + t * (w.y - v.y)
-  };
-  return distance(p, projection);
-}
-function distance(p1, p2) {
-  const dx = p1.x - p2.x;
-  const dy = p1.y - p2.y;
-  return Math.sqrt(dx * dx + dy * dy);
-}
-
-// src/nearest-box.ts
-function getBoundingBox(box) {
-  const halfWidth = box.width / 2;
-  const halfHeight = box.height / 2;
-  return {
-    minX: box.center.x - halfWidth,
-    maxX: box.center.x + halfWidth,
-    minY: box.center.y - halfHeight,
-    maxY: box.center.y + halfHeight
-  };
-}
-function computeDistanceBetweenBoxes(boxA, boxB) {
-  const a = getBoundingBox(boxA);
-  const b = getBoundingBox(boxB);
-  const dx = Math.max(a.minX - b.maxX, b.minX - a.maxX, 0);
-  const dy = Math.max(a.minY - b.maxY, b.minY - a.maxY, 0);
-  const pointA = { x: 0, y: 0 };
-  const pointB = { x: 0, y: 0 };
-  if (dx === 0 && dy === 0) {
-    return { distance: 0, pointA: boxA.center, pointB: boxB.center };
-  }
-  pointA.x = clamp(boxA.center.x, b.minX, b.maxX);
-  pointA.y = clamp(boxA.center.y, b.minY, b.maxY);
-  pointB.x = clamp(boxB.center.x, a.minX, a.maxX);
-  pointB.y = clamp(boxB.center.y, a.minY, a.maxY);
-  const distance2 = Math.hypot(pointA.x - pointB.x, pointA.y - pointB.y);
-  return { distance: distance2, pointA, pointB };
-}
-function clamp(value, min, max) {
-  return Math.max(min, Math.min(max, value));
-}
-function findNearestPointsBetweenBoxSets(boxSetA, boxSetB) {
-  let minDistance = Number.POSITIVE_INFINITY;
-  let nearestPointA = { x: 0, y: 0 };
-  let nearestPointB = { x: 0, y: 0 };
-  for (const boxA of boxSetA) {
-    for (const boxB of boxSetB) {
-      const { distance: distance2, pointA, pointB } = computeDistanceBetweenBoxes(
-        boxA,
-        boxB
-      );
-      if (distance2 < minDistance) {
-        minDistance = distance2;
-        nearestPointA = pointA;
-        nearestPointB = pointB;
-      }
-    }
-  }
-  return {
-    pointA: nearestPointA,
-    pointB: nearestPointB,
-    distance: minDistance
-  };
-}
-
-// src/get-unit-vector.ts
-var getUnitVectorFromPointAToB = (a, b) => {
-  const delta = {
-    x: b.x - a.x,
-    y: b.y - a.y
-  };
-  const magnitude = Math.sqrt(delta.x ** 2 + delta.y ** 2);
-  return {
-    x: delta.x / magnitude,
-    y: delta.y / magnitude
-  };
-};
-var getUnitVectorFromDirection = (direction) => {
-  switch (direction) {
-    case "up":
-      return { x: 0, y: 1 };
-    case "down":
-      return { x: 0, y: -1 };
-    case "left":
-      return { x: -1, y: 0 };
-    case "right":
-      return { x: 1, y: 0 };
-  }
-};
-
-// src/grid.ts
-function grid({
-  rows,
-  cols,
-  xSpacing,
-  ySpacing,
-  width,
-  height,
-  offsetX = 0,
-  offsetY = 0,
-  yDirection = "cartesian",
-  centered = true
-}) {
-  const effectiveXSpacing = xSpacing ?? 1;
-  const effectiveYSpacing = ySpacing ?? 1;
-  const totalWidth = width ?? cols * effectiveXSpacing;
-  const totalHeight = height ?? rows * effectiveYSpacing;
-  const centeringOffsetX = centered ? -totalWidth / 2 : 0;
-  const centeringOffsetY = centered ? -totalHeight / 2 : 0;
-  const cellWidth = width ? width / cols : effectiveXSpacing;
-  const cellHeight = height ? height / rows : effectiveYSpacing;
-  const cells = [];
-  for (let row = 0; row < rows; row++) {
-    for (let col = 0; col < cols; col++) {
-      const index = row * cols + col;
-      const centerX = offsetX + centeringOffsetX + col * cellWidth + cellWidth / 2;
-      const rawCenterY = offsetY + row * cellHeight + cellHeight / 2;
-      const centerY = yDirection === "cartesian" ? offsetY + centeringOffsetY + (rows - 1 - row) * cellHeight + cellHeight / 2 : offsetY + centeringOffsetY + row * cellHeight + cellHeight / 2;
-      cells.push({
-        index,
-        center: { x: centerX, y: centerY },
-        topLeft: {
-          x: centerX - cellWidth / 2,
-          y: centerY + cellHeight / 2
-        },
-        bottomRight: {
-          x: centerX + cellWidth / 2,
-          y: centerY - cellHeight / 2
-        }
-      });
-    }
-  }
-  return cells;
-}
+import "./chunk-GYQ2KZV6.js";
+import {
+  getUnitVectorFromDirection,
+  getUnitVectorFromPointAToB
+} from "./chunk-GIGMPRPV.js";
+import {
+  grid
+} from "./chunk-U45EKA3R.js";
+import {
+  distance,
+  doSegmentsIntersect,
+  doesLineIntersectLine,
+  onSegment,
+  orientation,
+  pointToSegmentDistance
+} from "./chunk-CHQOCSFB.js";
+import {
+  clamp,
+  computeDistanceBetweenBoxes,
+  findNearestPointsBetweenBoxSets,
+  getBoundingBox
+} from "./chunk-MHHTZHOJ.js";
 export {
   clamp,
   computeDistanceBetweenBoxes,

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/line-intersections.ts","../src/nearest-box.ts","../src/get-unit-vector.ts","../src/grid.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","import type { Point } from \"./common\"\n\nexport type Box = { center: Point; width: number; height: number }\nexport type BoxSet = Box[]\n\nexport type GridCell = { boxes: Box[] }\n\nexport function getBoundingBox(box: Box) {\n  const halfWidth = box.width / 2\n  const halfHeight = box.height / 2\n  return {\n    minX: box.center.x - halfWidth,\n    maxX: box.center.x + halfWidth,\n    minY: box.center.y - halfHeight,\n    maxY: box.center.y + halfHeight,\n  }\n}\n\nexport function computeDistanceBetweenBoxes(\n  boxA: Box,\n  boxB: Box,\n): { distance: number; pointA: Point; pointB: Point } {\n  const a = getBoundingBox(boxA)\n  const b = getBoundingBox(boxB)\n\n  const dx = Math.max(a.minX - b.maxX, b.minX - a.maxX, 0)\n  const dy = Math.max(a.minY - b.maxY, b.minY - a.maxY, 0)\n\n  const pointA: Point = { x: 0, y: 0 }\n  const pointB: Point = { x: 0, y: 0 }\n\n  if (dx === 0 && dy === 0) {\n    // Boxes overlap\n    return { distance: 0, pointA: boxA.center, pointB: boxB.center }\n  }\n\n  // Compute the closest points on the edges\n  pointA.x = clamp(boxA.center.x, b.minX, b.maxX)\n  pointA.y = clamp(boxA.center.y, b.minY, b.maxY)\n\n  pointB.x = clamp(boxB.center.x, a.minX, a.maxX)\n  pointB.y = clamp(boxB.center.y, a.minY, a.maxY)\n\n  const distance = Math.hypot(pointA.x - pointB.x, pointA.y - pointB.y)\n  return { distance, pointA, pointB }\n}\n\nexport function clamp(value: number, min: number, max: number): number {\n  return Math.max(min, Math.min(max, value))\n}\n\nexport function findNearestPointsBetweenBoxSets(\n  boxSetA: BoxSet,\n  boxSetB: BoxSet,\n): { pointA: Point; pointB: Point; distance: number } {\n  let minDistance = Number.POSITIVE_INFINITY\n  let nearestPointA: Point = { x: 0, y: 0 }\n  let nearestPointB: Point = { x: 0, y: 0 }\n\n  for (const boxA of boxSetA) {\n    for (const boxB of boxSetB) {\n      const { distance, pointA, pointB } = computeDistanceBetweenBoxes(\n        boxA,\n        boxB,\n      )\n      if (distance < minDistance) {\n        minDistance = distance\n        nearestPointA = pointA\n        nearestPointB = pointB\n      }\n    }\n  }\n\n  return {\n    pointA: nearestPointA,\n    pointB: nearestPointB,\n    distance: minDistance,\n  }\n}\n","import type { Point } from \"./common\"\n\nexport const getUnitVectorFromPointAToB = (a: Point, b: Point): Point => {\n  const delta = {\n    x: b.x - a.x,\n    y: b.y - a.y,\n  }\n\n  const magnitude = Math.sqrt(delta.x ** 2 + delta.y ** 2)\n\n  return {\n    x: delta.x / magnitude,\n    y: delta.y / magnitude,\n  }\n}\n\nexport const getUnitVectorFromDirection = (\n  direction: \"up\" | \"down\" | \"left\" | \"right\",\n): Point => {\n  switch (direction) {\n    case \"up\":\n      return { x: 0, y: 1 }\n    case \"down\":\n      return { x: 0, y: -1 }\n    case \"left\":\n      return { x: -1, y: 0 }\n    case \"right\":\n      return { x: 1, y: 0 }\n  }\n}\n","import type { Point } from \"./common\"\n\nexport type GridCellPositions = {\n  index: number\n  center: Point\n  topLeft: Point\n  bottomRight: Point\n}\n\nexport type GridOptions = {\n  rows: number\n  cols: number\n  xSpacing?: number\n  ySpacing?: number\n  width?: number\n  height?: number\n  offsetX?: number\n  offsetY?: number\n  yDirection?: \"cartesian\" | \"up-is-negative\"\n  centered?: boolean\n}\n\nexport function grid({\n  rows,\n  cols,\n  xSpacing,\n  ySpacing,\n  width,\n  height,\n  offsetX = 0,\n  offsetY = 0,\n  yDirection = \"cartesian\",\n  centered = true,\n}: GridOptions): GridCellPositions[] {\n  // Set default spacing if neither spacing nor dimensions are specified\n  const effectiveXSpacing = xSpacing ?? 1\n  const effectiveYSpacing = ySpacing ?? 1\n\n  // Calculate cell dimensions\n  const totalWidth = width ?? cols * effectiveXSpacing\n  const totalHeight = height ?? rows * effectiveYSpacing\n\n  // Calculate centering offsets if needed\n  const centeringOffsetX = centered ? -totalWidth / 2 : 0\n  const centeringOffsetY = centered ? -totalHeight / 2 : 0\n\n  const cellWidth = width ? width / cols : effectiveXSpacing\n  const cellHeight = height ? height / rows : effectiveYSpacing\n\n  const cells: GridCellPositions[] = []\n\n  for (let row = 0; row < rows; row++) {\n    for (let col = 0; col < cols; col++) {\n      const index = row * cols + col\n\n      // Calculate center position\n      const centerX =\n        offsetX + centeringOffsetX + col * cellWidth + cellWidth / 2\n      const rawCenterY = offsetY + row * cellHeight + cellHeight / 2\n\n      // Adjust Y coordinate based on yDirection\n      const centerY =\n        yDirection === \"cartesian\"\n          ? offsetY +\n            centeringOffsetY +\n            (rows - 1 - row) * cellHeight +\n            cellHeight / 2\n          : offsetY + centeringOffsetY + row * cellHeight + cellHeight / 2\n\n      cells.push({\n        index,\n        center: { x: centerX, y: centerY },\n        topLeft: {\n          x: centerX - cellWidth / 2,\n          y: centerY + cellHeight / 2,\n        },\n        bottomRight: {\n          x: centerX + cellWidth / 2,\n          y: centerY - cellHeight / 2,\n        },\n      })\n    }\n  }\n\n  return cells\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;;;ACpHO,SAAS,eAAe,KAAU;AACvC,QAAM,YAAY,IAAI,QAAQ;AAC9B,QAAM,aAAa,IAAI,SAAS;AAChC,SAAO;AAAA,IACL,MAAM,IAAI,OAAO,IAAI;AAAA,IACrB,MAAM,IAAI,OAAO,IAAI;AAAA,IACrB,MAAM,IAAI,OAAO,IAAI;AAAA,IACrB,MAAM,IAAI,OAAO,IAAI;AAAA,EACvB;AACF;AAEO,SAAS,4BACd,MACA,MACoD;AACpD,QAAM,IAAI,eAAe,IAAI;AAC7B,QAAM,IAAI,eAAe,IAAI;AAE7B,QAAM,KAAK,KAAK,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC;AACvD,QAAM,KAAK,KAAK,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC;AAEvD,QAAM,SAAgB,EAAE,GAAG,GAAG,GAAG,EAAE;AACnC,QAAM,SAAgB,EAAE,GAAG,GAAG,GAAG,EAAE;AAEnC,MAAI,OAAO,KAAK,OAAO,GAAG;AAExB,WAAO,EAAE,UAAU,GAAG,QAAQ,KAAK,QAAQ,QAAQ,KAAK,OAAO;AAAA,EACjE;AAGA,SAAO,IAAI,MAAM,KAAK,OAAO,GAAG,EAAE,MAAM,EAAE,IAAI;AAC9C,SAAO,IAAI,MAAM,KAAK,OAAO,GAAG,EAAE,MAAM,EAAE,IAAI;AAE9C,SAAO,IAAI,MAAM,KAAK,OAAO,GAAG,EAAE,MAAM,EAAE,IAAI;AAC9C,SAAO,IAAI,MAAM,KAAK,OAAO,GAAG,EAAE,MAAM,EAAE,IAAI;AAE9C,QAAMA,YAAW,KAAK,MAAM,OAAO,IAAI,OAAO,GAAG,OAAO,IAAI,OAAO,CAAC;AACpE,SAAO,EAAE,UAAAA,WAAU,QAAQ,OAAO;AACpC;AAEO,SAAS,MAAM,OAAe,KAAa,KAAqB;AACrE,SAAO,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC;AAC3C;AAEO,SAAS,gCACd,SACA,SACoD;AACpD,MAAI,cAAc,OAAO;AACzB,MAAI,gBAAuB,EAAE,GAAG,GAAG,GAAG,EAAE;AACxC,MAAI,gBAAuB,EAAE,GAAG,GAAG,GAAG,EAAE;AAExC,aAAW,QAAQ,SAAS;AAC1B,eAAW,QAAQ,SAAS;AAC1B,YAAM,EAAE,UAAAA,WAAU,QAAQ,OAAO,IAAI;AAAA,QACnC;AAAA,QACA;AAAA,MACF;AACA,UAAIA,YAAW,aAAa;AAC1B,sBAAcA;AACd,wBAAgB;AAChB,wBAAgB;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,UAAU;AAAA,EACZ;AACF;;;AC5EO,IAAM,6BAA6B,CAAC,GAAU,MAAoB;AACvE,QAAM,QAAQ;AAAA,IACZ,GAAG,EAAE,IAAI,EAAE;AAAA,IACX,GAAG,EAAE,IAAI,EAAE;AAAA,EACb;AAEA,QAAM,YAAY,KAAK,KAAK,MAAM,KAAK,IAAI,MAAM,KAAK,CAAC;AAEvD,SAAO;AAAA,IACL,GAAG,MAAM,IAAI;AAAA,IACb,GAAG,MAAM,IAAI;AAAA,EACf;AACF;AAEO,IAAM,6BAA6B,CACxC,cACU;AACV,UAAQ,WAAW;AAAA,IACjB,KAAK;AACH,aAAO,EAAE,GAAG,GAAG,GAAG,EAAE;AAAA,IACtB,KAAK;AACH,aAAO,EAAE,GAAG,GAAG,GAAG,GAAG;AAAA,IACvB,KAAK;AACH,aAAO,EAAE,GAAG,IAAI,GAAG,EAAE;AAAA,IACvB,KAAK;AACH,aAAO,EAAE,GAAG,GAAG,GAAG,EAAE;AAAA,EACxB;AACF;;;ACPO,SAAS,KAAK;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,UAAU;AAAA,EACV,UAAU;AAAA,EACV,aAAa;AAAA,EACb,WAAW;AACb,GAAqC;AAEnC,QAAM,oBAAoB,YAAY;AACtC,QAAM,oBAAoB,YAAY;AAGtC,QAAM,aAAa,SAAS,OAAO;AACnC,QAAM,cAAc,UAAU,OAAO;AAGrC,QAAM,mBAAmB,WAAW,CAAC,aAAa,IAAI;AACtD,QAAM,mBAAmB,WAAW,CAAC,cAAc,IAAI;AAEvD,QAAM,YAAY,QAAQ,QAAQ,OAAO;AACzC,QAAM,aAAa,SAAS,SAAS,OAAO;AAE5C,QAAM,QAA6B,CAAC;AAEpC,WAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,YAAM,QAAQ,MAAM,OAAO;AAG3B,YAAM,UACJ,UAAU,mBAAmB,MAAM,YAAY,YAAY;AAC7D,YAAM,aAAa,UAAU,MAAM,aAAa,aAAa;AAG7D,YAAM,UACJ,eAAe,cACX,UACA,oBACC,OAAO,IAAI,OAAO,aACnB,aAAa,IACb,UAAU,mBAAmB,MAAM,aAAa,aAAa;AAEnE,YAAM,KAAK;AAAA,QACT;AAAA,QACA,QAAQ,EAAE,GAAG,SAAS,GAAG,QAAQ;AAAA,QACjC,SAAS;AAAA,UACP,GAAG,UAAU,YAAY;AAAA,UACzB,GAAG,UAAU,aAAa;AAAA,QAC5B;AAAA,QACA,aAAa;AAAA,UACX,GAAG,UAAU,YAAY;AAAA,UACzB,GAAG,UAAU,aAAa;AAAA,QAC5B;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;","names":["distance"]}
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/line-intersections.d.ts

@@ -0,0 +1,30 @@
+import { Point } from './common.js';
+
+/**
+ * Returns true if the two lines intersect.
+ */
+declare function doesLineIntersectLine([a1, a2]: [Point, Point], [b1, b2]: [Point, Point], { lineThickness, }?: {
+    lineThickness?: number;
+}): boolean;
+/**
+ * Returns true if the two segments intersect.
+ */
+declare function doSegmentsIntersect(p1: Point, q1: Point, p2: Point, q2: Point): boolean;
+/**
+ * Returns 0 if the points are colinear, 1 if they are clockwise, and 2 if they are counterclockwise.
+ */
+declare function orientation(p: Point, q: Point, r: Point): number;
+/**
+ * Returns true if q is on the segment p->r.
+ */
+declare function onSegment(p: Point, q: Point, r: Point): boolean;
+/**
+ * Returns the minimum distance between a point and a segment.
+ */
+declare function pointToSegmentDistance(p: Point, v: Point, w: Point): number;
+/**
+ * Returns the distance between two points.
+ */
+declare function distance(p1: Point, p2: Point): number;
+
+export { distance, doSegmentsIntersect, doesLineIntersectLine, onSegment, orientation, pointToSegmentDistance };

package/dist/line-intersections.js

@@ -0,0 +1,17 @@
+import {
+  distance,
+  doSegmentsIntersect,
+  doesLineIntersectLine,
+  onSegment,
+  orientation,
+  pointToSegmentDistance
+} from "./chunk-CHQOCSFB.js";
+export {
+  distance,
+  doSegmentsIntersect,
+  doesLineIntersectLine,
+  onSegment,
+  orientation,
+  pointToSegmentDistance
+};
+//# sourceMappingURL=line-intersections.js.map

package/dist/line-intersections.js.map

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

package/dist/nearest-box.d.ts

@@ -0,0 +1,30 @@
+import { Point } from './common.js';
+
+type Box = {
+    center: Point;
+    width: number;
+    height: number;
+};
+type BoxSet = Box[];
+type GridCell = {
+    boxes: Box[];
+};
+declare function getBoundingBox(box: Box): {
+    minX: number;
+    maxX: number;
+    minY: number;
+    maxY: number;
+};
+declare function computeDistanceBetweenBoxes(boxA: Box, boxB: Box): {
+    distance: number;
+    pointA: Point;
+    pointB: Point;
+};
+declare function clamp(value: number, min: number, max: number): number;
+declare function findNearestPointsBetweenBoxSets(boxSetA: BoxSet, boxSetB: BoxSet): {
+    pointA: Point;
+    pointB: Point;
+    distance: number;
+};
+
+export { type Box, type BoxSet, type GridCell, clamp, computeDistanceBetweenBoxes, findNearestPointsBetweenBoxSets, getBoundingBox };

package/dist/nearest-box.js

@@ -0,0 +1,13 @@
+import {
+  clamp,
+  computeDistanceBetweenBoxes,
+  findNearestPointsBetweenBoxSets,
+  getBoundingBox
+} from "./chunk-MHHTZHOJ.js";
+export {
+  clamp,
+  computeDistanceBetweenBoxes,
+  findNearestPointsBetweenBoxSets,
+  getBoundingBox
+};
+//# sourceMappingURL=nearest-box.js.map

package/dist/nearest-box.js.map

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

package/package.json

@@ -1,15 +1,29 @@
 {
   "name": "@tscircuit/math-utils",
   "main": "dist/index.js",
-  "version": "0.0.8",
+  "version": "0.0.10",
   "type": "module",
   "module": "dist/index.js",
   "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "import": "./dist/index.js",
+      "types": "./dist/index.d.ts"
+    },
+    "./line-intersections": {
+      "import": "./dist/line-intersections.js",
+      "types": "./dist/line-intersections.d.ts"
+    },
+    "./nearest-box": {
+      "import": "./dist/nearest-box.js",
+      "types": "./dist/nearest-box.d.ts"
+    }
+  },
   "files": [
     "dist"
   ],
   "scripts": {
-    "build": "tsup-node src/index.ts --format esm --dts --sourcemap"
+    "build": "tsup-node src --format esm --dts --sourcemap"
   },
   "devDependencies": {
     "@biomejs/biome": "^1.9.4",