@tscircuit/math-utils 0.0.2 → 0.0.3

package/dist/chunk-EJDR5MHT.js

@@ -0,0 +1,111 @@
+// 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) {
+  const allBoxes = [...boxSetA, ...boxSetB];
+  let minX = Number.POSITIVE_INFINITY;
+  let minY = Number.POSITIVE_INFINITY;
+  let maxX = Number.NEGATIVE_INFINITY;
+  let maxY = Number.NEGATIVE_INFINITY;
+  let avgWidth = 0;
+  let avgHeight = 0;
+  for (const box of allBoxes) {
+    const bbox = getBoundingBox(box);
+    minX = Math.min(minX, bbox.minX);
+    minY = Math.min(minY, bbox.minY);
+    maxX = Math.max(maxX, bbox.maxX);
+    maxY = Math.max(maxY, bbox.maxY);
+    avgWidth += box.width;
+    avgHeight += box.height;
+  }
+  avgWidth /= allBoxes.length;
+  avgHeight /= allBoxes.length;
+  const cellSize = Math.max(avgWidth, avgHeight);
+  const gridWidth = Math.ceil((maxX - minX) / cellSize);
+  const gridHeight = Math.ceil((maxY - minY) / cellSize);
+  const grid = Array.from(
+    { length: gridWidth },
+    () => Array.from({ length: gridHeight }, () => ({ boxes: [] }))
+  );
+  for (const box of boxSetB) {
+    const bbox = getBoundingBox(box);
+    const startX = Math.floor((bbox.minX - minX) / cellSize);
+    const endX = Math.floor((bbox.maxX - minX) / cellSize);
+    const startY = Math.floor((bbox.minY - minY) / cellSize);
+    const endY = Math.floor((bbox.maxY - minY) / cellSize);
+    for (let x = startX; x <= endX; x++) {
+      for (let y = startY; y <= endY; y++) {
+        grid[x][y].boxes.push(box);
+      }
+    }
+  }
+  let minDistance = Number.POSITIVE_INFINITY;
+  let nearestPointA = { x: 0, y: 0 };
+  let nearestPointB = { x: 0, y: 0 };
+  for (const boxA of boxSetA) {
+    const bboxA = getBoundingBox(boxA);
+    const startX = Math.floor((bboxA.minX - minX) / cellSize);
+    const endX = Math.floor((bboxA.maxX - minX) / cellSize);
+    const startY = Math.floor((bboxA.minY - minY) / cellSize);
+    const endY = Math.floor((bboxA.maxY - minY) / cellSize);
+    for (let x = startX - 1; x <= endX + 1; x++) {
+      if (x < 0 || x >= gridWidth) continue;
+      for (let y = startY - 1; y <= endY + 1; y++) {
+        if (y < 0 || y >= gridHeight) continue;
+        const cell = grid[x][y];
+        for (const boxB of cell.boxes) {
+          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-EJDR5MHT.js.map

package/dist/chunk-EJDR5MHT.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\tconst halfWidth = box.width / 2;\n\tconst halfHeight = box.height / 2;\n\treturn {\n\t\tminX: box.center.x - halfWidth,\n\t\tmaxX: box.center.x + halfWidth,\n\t\tminY: box.center.y - halfHeight,\n\t\tmaxY: box.center.y + halfHeight,\n\t};\n}\n\nexport function computeDistanceBetweenBoxes(\n\tboxA: Box,\n\tboxB: Box,\n): { distance: number; pointA: Point; pointB: Point } {\n\tconst a = getBoundingBox(boxA);\n\tconst b = getBoundingBox(boxB);\n\n\tconst dx = Math.max(a.minX - b.maxX, b.minX - a.maxX, 0);\n\tconst dy = Math.max(a.minY - b.maxY, b.minY - a.maxY, 0);\n\n\tconst pointA: Point = { x: 0, y: 0 };\n\tconst pointB: Point = { x: 0, y: 0 };\n\n\tif (dx === 0 && dy === 0) {\n\t\t// Boxes overlap\n\t\treturn { distance: 0, pointA: boxA.center, pointB: boxB.center };\n\t}\n\n\t// Compute the closest points on the edges\n\tpointA.x = clamp(boxA.center.x, b.minX, b.maxX);\n\tpointA.y = clamp(boxA.center.y, b.minY, b.maxY);\n\n\tpointB.x = clamp(boxB.center.x, a.minX, a.maxX);\n\tpointB.y = clamp(boxB.center.y, a.minY, a.maxY);\n\n\tconst distance = Math.hypot(pointA.x - pointB.x, pointA.y - pointB.y);\n\treturn { distance, pointA, pointB };\n}\n\nexport function clamp(value: number, min: number, max: number): number {\n\treturn Math.max(min, Math.min(max, value));\n}\n\nexport function findNearestPointsBetweenBoxSets(\n\tboxSetA: BoxSet,\n\tboxSetB: BoxSet,\n): { pointA: Point; pointB: Point; distance: number } {\n\t// Determine grid parameters\n\tconst allBoxes = [...boxSetA, ...boxSetB];\n\tlet minX = Number.POSITIVE_INFINITY;\n\tlet minY = Number.POSITIVE_INFINITY;\n\tlet maxX = Number.NEGATIVE_INFINITY;\n\tlet maxY = Number.NEGATIVE_INFINITY;\n\tlet avgWidth = 0;\n\tlet avgHeight = 0;\n\n\tfor (const box of allBoxes) {\n\t\tconst bbox = getBoundingBox(box);\n\t\tminX = Math.min(minX, bbox.minX);\n\t\tminY = Math.min(minY, bbox.minY);\n\t\tmaxX = Math.max(maxX, bbox.maxX);\n\t\tmaxY = Math.max(maxY, bbox.maxY);\n\t\tavgWidth += box.width;\n\t\tavgHeight += box.height;\n\t}\n\n\tavgWidth /= allBoxes.length;\n\tavgHeight /= allBoxes.length;\n\n\t// Define grid cell size\n\tconst cellSize = Math.max(avgWidth, avgHeight);\n\n\tconst gridWidth = Math.ceil((maxX - minX) / cellSize);\n\tconst gridHeight = Math.ceil((maxY - minY) / cellSize);\n\n\t// Initialize grid\n\tconst grid: GridCell[][] = Array.from({ length: gridWidth }, () =>\n\t\tArray.from({ length: gridHeight }, () => ({ boxes: [] })),\n\t);\n\t// Assign boxes from Set B to grid cells\n\tfor (const box of boxSetB) {\n\t\tconst bbox = getBoundingBox(box);\n\t\tconst startX = Math.floor((bbox.minX - minX) / cellSize);\n\t\tconst endX = Math.floor((bbox.maxX - minX) / cellSize);\n\t\tconst startY = Math.floor((bbox.minY - minY) / cellSize);\n\t\tconst endY = Math.floor((bbox.maxY - minY) / cellSize);\n\n\t\tfor (let x = startX; x <= endX; x++) {\n\t\t\tfor (let y = startY; y <= endY; y++) {\n\t\t\t\tgrid[x][y].boxes.push(box);\n\t\t\t}\n\t\t}\n\t}\n\n\tlet minDistance = Number.POSITIVE_INFINITY;\n\tlet nearestPointA: Point = { x: 0, y: 0 };\n\tlet nearestPointB: Point = { x: 0, y: 0 };\n\n\t// Process boxes in Set A\n\tfor (const boxA of boxSetA) {\n\t\tconst bboxA = getBoundingBox(boxA);\n\t\tconst startX = Math.floor((bboxA.minX - minX) / cellSize);\n\t\tconst endX = Math.floor((bboxA.maxX - minX) / cellSize);\n\t\tconst startY = Math.floor((bboxA.minY - minY) / cellSize);\n\t\tconst endY = Math.floor((bboxA.maxY - minY) / cellSize);\n\n\t\t// Consider neighboring cells as well\n\t\tfor (let x = startX - 1; x <= endX + 1; x++) {\n\t\t\tif (x < 0 || x >= gridWidth) continue;\n\t\t\tfor (let y = startY - 1; y <= endY + 1; y++) {\n\t\t\t\tif (y < 0 || y >= gridHeight) continue;\n\n\t\t\t\tconst cell = grid[x][y];\n\t\t\t\tfor (const boxB of cell.boxes) {\n\t\t\t\t\tconst { distance, pointA, pointB } = computeDistanceBetweenBoxes(\n\t\t\t\t\t\tboxA,\n\t\t\t\t\t\tboxB,\n\t\t\t\t\t);\n\t\t\t\t\tif (distance < minDistance) {\n\t\t\t\t\t\tminDistance = distance;\n\t\t\t\t\t\tnearestPointA = pointA;\n\t\t\t\t\t\tnearestPointB = pointB;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn {\n\t\tpointA: nearestPointA,\n\t\tpointB: nearestPointB,\n\t\tdistance: minDistance,\n\t};\n}\n"],"mappings":";AAOO,SAAS,eAAe,KAAU;AACxC,QAAM,YAAY,IAAI,QAAQ;AAC9B,QAAM,aAAa,IAAI,SAAS;AAChC,SAAO;AAAA,IACN,MAAM,IAAI,OAAO,IAAI;AAAA,IACrB,MAAM,IAAI,OAAO,IAAI;AAAA,IACrB,MAAM,IAAI,OAAO,IAAI;AAAA,IACrB,MAAM,IAAI,OAAO,IAAI;AAAA,EACtB;AACD;AAEO,SAAS,4BACf,MACA,MACqD;AACrD,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;AAEzB,WAAO,EAAE,UAAU,GAAG,QAAQ,KAAK,QAAQ,QAAQ,KAAK,OAAO;AAAA,EAChE;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;AACnC;AAEO,SAAS,MAAM,OAAe,KAAa,KAAqB;AACtE,SAAO,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC;AAC1C;AAEO,SAAS,gCACf,SACA,SACqD;AAErD,QAAM,WAAW,CAAC,GAAG,SAAS,GAAG,OAAO;AACxC,MAAI,OAAO,OAAO;AAClB,MAAI,OAAO,OAAO;AAClB,MAAI,OAAO,OAAO;AAClB,MAAI,OAAO,OAAO;AAClB,MAAI,WAAW;AACf,MAAI,YAAY;AAEhB,aAAW,OAAO,UAAU;AAC3B,UAAM,OAAO,eAAe,GAAG;AAC/B,WAAO,KAAK,IAAI,MAAM,KAAK,IAAI;AAC/B,WAAO,KAAK,IAAI,MAAM,KAAK,IAAI;AAC/B,WAAO,KAAK,IAAI,MAAM,KAAK,IAAI;AAC/B,WAAO,KAAK,IAAI,MAAM,KAAK,IAAI;AAC/B,gBAAY,IAAI;AAChB,iBAAa,IAAI;AAAA,EAClB;AAEA,cAAY,SAAS;AACrB,eAAa,SAAS;AAGtB,QAAM,WAAW,KAAK,IAAI,UAAU,SAAS;AAE7C,QAAM,YAAY,KAAK,MAAM,OAAO,QAAQ,QAAQ;AACpD,QAAM,aAAa,KAAK,MAAM,OAAO,QAAQ,QAAQ;AAGrD,QAAM,OAAqB,MAAM;AAAA,IAAK,EAAE,QAAQ,UAAU;AAAA,IAAG,MAC5D,MAAM,KAAK,EAAE,QAAQ,WAAW,GAAG,OAAO,EAAE,OAAO,CAAC,EAAE,EAAE;AAAA,EACzD;AAEA,aAAW,OAAO,SAAS;AAC1B,UAAM,OAAO,eAAe,GAAG;AAC/B,UAAM,SAAS,KAAK,OAAO,KAAK,OAAO,QAAQ,QAAQ;AACvD,UAAM,OAAO,KAAK,OAAO,KAAK,OAAO,QAAQ,QAAQ;AACrD,UAAM,SAAS,KAAK,OAAO,KAAK,OAAO,QAAQ,QAAQ;AACvD,UAAM,OAAO,KAAK,OAAO,KAAK,OAAO,QAAQ,QAAQ;AAErD,aAAS,IAAI,QAAQ,KAAK,MAAM,KAAK;AACpC,eAAS,IAAI,QAAQ,KAAK,MAAM,KAAK;AACpC,aAAK,CAAC,EAAE,CAAC,EAAE,MAAM,KAAK,GAAG;AAAA,MAC1B;AAAA,IACD;AAAA,EACD;AAEA,MAAI,cAAc,OAAO;AACzB,MAAI,gBAAuB,EAAE,GAAG,GAAG,GAAG,EAAE;AACxC,MAAI,gBAAuB,EAAE,GAAG,GAAG,GAAG,EAAE;AAGxC,aAAW,QAAQ,SAAS;AAC3B,UAAM,QAAQ,eAAe,IAAI;AACjC,UAAM,SAAS,KAAK,OAAO,MAAM,OAAO,QAAQ,QAAQ;AACxD,UAAM,OAAO,KAAK,OAAO,MAAM,OAAO,QAAQ,QAAQ;AACtD,UAAM,SAAS,KAAK,OAAO,MAAM,OAAO,QAAQ,QAAQ;AACxD,UAAM,OAAO,KAAK,OAAO,MAAM,OAAO,QAAQ,QAAQ;AAGtD,aAAS,IAAI,SAAS,GAAG,KAAK,OAAO,GAAG,KAAK;AAC5C,UAAI,IAAI,KAAK,KAAK,UAAW;AAC7B,eAAS,IAAI,SAAS,GAAG,KAAK,OAAO,GAAG,KAAK;AAC5C,YAAI,IAAI,KAAK,KAAK,WAAY;AAE9B,cAAM,OAAO,KAAK,CAAC,EAAE,CAAC;AACtB,mBAAW,QAAQ,KAAK,OAAO;AAC9B,gBAAM,EAAE,UAAU,QAAQ,OAAO,IAAI;AAAA,YACpC;AAAA,YACA;AAAA,UACD;AACA,cAAI,WAAW,aAAa;AAC3B,0BAAc;AACd,4BAAgB;AAChB,4BAAgB;AAAA,UACjB;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAEA,SAAO;AAAA,IACN,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,UAAU;AAAA,EACX;AACD;","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-KHV6IODO.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-KHV6IODO.js.map

package/dist/chunk-KHV6IODO.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\t[a1, a2]: [Point, Point],\n\t[b1, b2]: [Point, Point],\n\t{\n\t\tlineThickness = 0,\n\t}: {\n\t\tlineThickness?: number;\n\t} = {},\n): boolean {\n\tif (lineThickness === 0) {\n\t\treturn doSegmentsIntersect(a1, a2, b1, b2);\n\t}\n\tconst minDist = segmentsDistance(a1, a2, b1, b2);\n\treturn minDist <= lineThickness;\n}\n\n/**\n * Returns true if the two segments intersect.\n */\nexport function doSegmentsIntersect(\n\tp1: Point,\n\tq1: Point,\n\tp2: Point,\n\tq2: Point,\n): boolean {\n\tconst o1 = orientation(p1, q1, p2);\n\tconst o2 = orientation(p1, q1, q2);\n\tconst o3 = orientation(p2, q2, p1);\n\tconst o4 = orientation(p2, q2, q1);\n\n\t// General case\n\tif (o1 !== o2 && o3 !== o4) {\n\t\treturn true;\n\t}\n\n\t// Special Cases\n\tif (o1 === 0 && onSegment(p1, p2, q1)) return true;\n\tif (o2 === 0 && onSegment(p1, q2, q1)) return true;\n\tif (o3 === 0 && onSegment(p2, p1, q2)) return true;\n\tif (o4 === 0 && onSegment(p2, q1, q2)) return true;\n\n\treturn 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\tconst val = (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);\n\tif (val === 0) return 0; // colinear\n\treturn 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\treturn (\n\t\tq.x <= Math.max(p.x, r.x) &&\n\t\tq.x >= Math.min(p.x, r.x) &&\n\t\tq.y <= Math.max(p.y, r.y) &&\n\t\tq.y >= Math.min(p.y, r.y)\n\t);\n}\n\n/**\n * Returns the minimum distance between two segments.\n */\nfunction segmentsDistance(a1: Point, a2: Point, b1: Point, b2: Point): number {\n\t// Handle degenerate cases: segments of zero length\n\tif (a1.x === a2.x && a1.y === a2.y) {\n\t\treturn pointToSegmentDistance(a1, b1, b2);\n\t}\n\tif (b1.x === b2.x && b1.y === b2.y) {\n\t\treturn pointToSegmentDistance(b1, a1, a2);\n\t}\n\n\t// Check if segments intersect\n\tif (doSegmentsIntersect(a1, a2, b1, b2)) {\n\t\treturn 0;\n\t}\n\n\t// Compute the minimum distance between the segments\n\tconst distances = [\n\t\tpointToSegmentDistance(a1, b1, b2),\n\t\tpointToSegmentDistance(a2, b1, b2),\n\t\tpointToSegmentDistance(b1, a1, a2),\n\t\tpointToSegmentDistance(b2, a1, a2),\n\t];\n\n\treturn 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\tconst l2 = (w.x - v.x) ** 2 + (w.y - v.y) ** 2;\n\tif (l2 === 0) return distance(p, v);\n\n\tlet t = ((p.x - v.x) * (w.x - v.x) + (p.y - v.y) * (w.y - v.y)) / l2;\n\tt = Math.max(0, Math.min(1, t));\n\n\tconst projection = {\n\t\tx: v.x + t * (w.x - v.x),\n\t\ty: v.y + t * (w.y - v.y),\n\t};\n\n\treturn distance(p, projection);\n}\n\n/**\n * Returns the distance between two points.\n */\nexport function distance(p1: Point, p2: Point): number {\n\tconst dx = p1.x - p2.x;\n\tconst dy = p1.y - p2.y;\n\treturn Math.sqrt(dx * dx + dy * dy);\n}\n"],"mappings":";AAKO,SAAS,sBACf,CAAC,IAAI,EAAE,GACP,CAAC,IAAI,EAAE,GACP;AAAA,EACC,gBAAgB;AACjB,IAEI,CAAC,GACK;AACV,MAAI,kBAAkB,GAAG;AACxB,WAAO,oBAAoB,IAAI,IAAI,IAAI,EAAE;AAAA,EAC1C;AACA,QAAM,UAAU,iBAAiB,IAAI,IAAI,IAAI,EAAE;AAC/C,SAAO,WAAW;AACnB;AAKO,SAAS,oBACf,IACA,IACA,IACA,IACU;AACV,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;AAC3B,WAAO;AAAA,EACR;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;AACR;AAKO,SAAS,YAAY,GAAU,GAAU,GAAkB;AACjE,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;AACtB;AAKO,SAAS,UAAU,GAAU,GAAU,GAAmB;AAChE,SACC,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;AAE1B;AAKA,SAAS,iBAAiB,IAAW,IAAW,IAAW,IAAmB;AAE7E,MAAI,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG;AACnC,WAAO,uBAAuB,IAAI,IAAI,EAAE;AAAA,EACzC;AACA,MAAI,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG;AACnC,WAAO,uBAAuB,IAAI,IAAI,EAAE;AAAA,EACzC;AAGA,MAAI,oBAAoB,IAAI,IAAI,IAAI,EAAE,GAAG;AACxC,WAAO;AAAA,EACR;AAGA,QAAM,YAAY;AAAA,IACjB,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,EAClC;AAEA,SAAO,KAAK,IAAI,GAAG,SAAS;AAC7B;AAKO,SAAS,uBAAuB,GAAU,GAAU,GAAkB;AAC5E,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,IAClB,GAAG,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAAA,IACtB,GAAG,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAAA,EACvB;AAEA,SAAO,SAAS,GAAG,UAAU;AAC9B;AAKO,SAAS,SAAS,IAAW,IAAmB;AACtD,QAAM,KAAK,GAAG,IAAI,GAAG;AACrB,QAAM,KAAK,GAAG,IAAI,GAAG;AACrB,SAAO,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE;AACnC;","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/index.d.ts

@@ -1,32 +1,3 @@
-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;
-
-export { type Point, distance, doSegmentsIntersect, doesLineIntersectLine, 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';

package/dist/index.js

@@ -1,73 +1,26 @@
-// src/index.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);
-}
+import "./chunk-GYQ2KZV6.js";
+import {
+  distance,
+  doSegmentsIntersect,
+  doesLineIntersectLine,
+  onSegment,
+  orientation,
+  pointToSegmentDistance
+} from "./chunk-KHV6IODO.js";
+import {
+  clamp,
+  computeDistanceBetweenBoxes,
+  findNearestPointsBetweenBoxSets,
+  getBoundingBox
+} from "./chunk-EJDR5MHT.js";
 export {
+  clamp,
+  computeDistanceBetweenBoxes,
   distance,
   doSegmentsIntersect,
   doesLineIntersectLine,
+  findNearestPointsBetweenBoxSets,
+  getBoundingBox,
   onSegment,
   orientation,
   pointToSegmentDistance

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts"],"sourcesContent":["export type Point = {\n\tx: number;\n\ty: number;\n};\n\n/**\n * Returns true if the two lines intersect.\n */\nexport function doesLineIntersectLine(\n\t[a1, a2]: [Point, Point],\n\t[b1, b2]: [Point, Point],\n\t{\n\t\tlineThickness = 0,\n\t}: {\n\t\tlineThickness?: number;\n\t} = {},\n): boolean {\n\tif (lineThickness === 0) {\n\t\treturn doSegmentsIntersect(a1, a2, b1, b2);\n\t}\n\tconst minDist = segmentsDistance(a1, a2, b1, b2);\n\treturn minDist <= lineThickness;\n}\n\n/**\n * Returns true if the two segments intersect.\n */\nexport function doSegmentsIntersect(\n\tp1: Point,\n\tq1: Point,\n\tp2: Point,\n\tq2: Point,\n): boolean {\n\tconst o1 = orientation(p1, q1, p2);\n\tconst o2 = orientation(p1, q1, q2);\n\tconst o3 = orientation(p2, q2, p1);\n\tconst o4 = orientation(p2, q2, q1);\n\n\t// General case\n\tif (o1 !== o2 && o3 !== o4) {\n\t\treturn true;\n\t}\n\n\t// Special Cases\n\tif (o1 === 0 && onSegment(p1, p2, q1)) return true;\n\tif (o2 === 0 && onSegment(p1, q2, q1)) return true;\n\tif (o3 === 0 && onSegment(p2, p1, q2)) return true;\n\tif (o4 === 0 && onSegment(p2, q1, q2)) return true;\n\n\treturn 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\tconst val = (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);\n\tif (val === 0) return 0; // colinear\n\treturn 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\treturn (\n\t\tq.x <= Math.max(p.x, r.x) &&\n\t\tq.x >= Math.min(p.x, r.x) &&\n\t\tq.y <= Math.max(p.y, r.y) &&\n\t\tq.y >= Math.min(p.y, r.y)\n\t);\n}\n\n/**\n * Returns the minimum distance between two segments.\n */\nfunction segmentsDistance(a1: Point, a2: Point, b1: Point, b2: Point): number {\n\t// Handle degenerate cases: segments of zero length\n\tif (a1.x === a2.x && a1.y === a2.y) {\n\t\treturn pointToSegmentDistance(a1, b1, b2);\n\t}\n\tif (b1.x === b2.x && b1.y === b2.y) {\n\t\treturn pointToSegmentDistance(b1, a1, a2);\n\t}\n\n\t// Check if segments intersect\n\tif (doSegmentsIntersect(a1, a2, b1, b2)) {\n\t\treturn 0;\n\t}\n\n\t// Compute the minimum distance between the segments\n\tconst distances = [\n\t\tpointToSegmentDistance(a1, b1, b2),\n\t\tpointToSegmentDistance(a2, b1, b2),\n\t\tpointToSegmentDistance(b1, a1, a2),\n\t\tpointToSegmentDistance(b2, a1, a2),\n\t];\n\n\treturn 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\tconst l2 = (w.x - v.x) ** 2 + (w.y - v.y) ** 2;\n\tif (l2 === 0) return distance(p, v);\n\n\tlet t = ((p.x - v.x) * (w.x - v.x) + (p.y - v.y) * (w.y - v.y)) / l2;\n\tt = Math.max(0, Math.min(1, t));\n\n\tconst projection = {\n\t\tx: v.x + t * (w.x - v.x),\n\t\ty: v.y + t * (w.y - v.y),\n\t};\n\n\treturn distance(p, projection);\n}\n\n/**\n * Returns the distance between two points.\n */\nexport function distance(p1: Point, p2: Point): number {\n\tconst dx = p1.x - p2.x;\n\tconst dy = p1.y - p2.y;\n\treturn Math.sqrt(dx * dx + dy * dy);\n}\n"],"mappings":";AAQO,SAAS,sBACf,CAAC,IAAI,EAAE,GACP,CAAC,IAAI,EAAE,GACP;AAAA,EACC,gBAAgB;AACjB,IAEI,CAAC,GACK;AACV,MAAI,kBAAkB,GAAG;AACxB,WAAO,oBAAoB,IAAI,IAAI,IAAI,EAAE;AAAA,EAC1C;AACA,QAAM,UAAU,iBAAiB,IAAI,IAAI,IAAI,EAAE;AAC/C,SAAO,WAAW;AACnB;AAKO,SAAS,oBACf,IACA,IACA,IACA,IACU;AACV,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;AAC3B,WAAO;AAAA,EACR;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;AACR;AAKO,SAAS,YAAY,GAAU,GAAU,GAAkB;AACjE,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;AACtB;AAKO,SAAS,UAAU,GAAU,GAAU,GAAmB;AAChE,SACC,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;AAE1B;AAKA,SAAS,iBAAiB,IAAW,IAAW,IAAW,IAAmB;AAE7E,MAAI,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG;AACnC,WAAO,uBAAuB,IAAI,IAAI,EAAE;AAAA,EACzC;AACA,MAAI,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG;AACnC,WAAO,uBAAuB,IAAI,IAAI,EAAE;AAAA,EACzC;AAGA,MAAI,oBAAoB,IAAI,IAAI,IAAI,EAAE,GAAG;AACxC,WAAO;AAAA,EACR;AAGA,QAAM,YAAY;AAAA,IACjB,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,IACjC,uBAAuB,IAAI,IAAI,EAAE;AAAA,EAClC;AAEA,SAAO,KAAK,IAAI,GAAG,SAAS;AAC7B;AAKO,SAAS,uBAAuB,GAAU,GAAU,GAAkB;AAC5E,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,IAClB,GAAG,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAAA,IACtB,GAAG,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAAA,EACvB;AAEA,SAAO,SAAS,GAAG,UAAU;AAC9B;AAKO,SAAS,SAAS,IAAW,IAAmB;AACtD,QAAM,KAAK,GAAG,IAAI,GAAG;AACrB,QAAM,KAAK,GAAG,IAAI,GAAG;AACrB,SAAO,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE;AACnC;","names":[]}
+{"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-KHV6IODO.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-EJDR5MHT.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,13 +1,29 @@
 {
   "name": "@tscircuit/math-utils",
   "main": "dist/index.js",
-  "version": "0.0.2",
+  "version": "0.0.3",
   "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": {
     "@types/bun": "latest",