@tscircuit/math-utils 0.0.3 → 0.0.5

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-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/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/index.d.ts

@@ -1,3 +1,4 @@
 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';

package/dist/index.js

@@ -1,4 +1,8 @@
 import "./chunk-GYQ2KZV6.js";
+import {
+  getUnitVectorFromDirection,
+  getUnitVectorFromPointAToB
+} from "./chunk-GIGMPRPV.js";
 import {
   distance,
   doSegmentsIntersect,
@@ -12,7 +16,7 @@ import {
   computeDistanceBetweenBoxes,
   findNearestPointsBetweenBoxSets,
   getBoundingBox
-} from "./chunk-EJDR5MHT.js";
+} from "./chunk-MHHTZHOJ.js";
 export {
   clamp,
   computeDistanceBetweenBoxes,
@@ -21,6 +25,8 @@ export {
   doesLineIntersectLine,
   findNearestPointsBetweenBoxSets,
   getBoundingBox,
+  getUnitVectorFromDirection,
+  getUnitVectorFromPointAToB,
   onSegment,
   orientation,
   pointToSegmentDistance

package/dist/nearest-box.js

@@ -3,7 +3,7 @@ import {
   computeDistanceBetweenBoxes,
   findNearestPointsBetweenBoxSets,
   getBoundingBox
-} from "./chunk-EJDR5MHT.js";
+} from "./chunk-MHHTZHOJ.js";
 export {
   clamp,
   computeDistanceBetweenBoxes,

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@tscircuit/math-utils",
   "main": "dist/index.js",
-  "version": "0.0.3",
+  "version": "0.0.5",
   "type": "module",
   "module": "dist/index.js",
   "types": "dist/index.d.ts",
@@ -26,6 +26,7 @@
     "build": "tsup-node src --format esm --dts --sourcemap"
   },
   "devDependencies": {
+    "@biomejs/biome": "^1.9.1",
     "@types/bun": "latest",
     "tsup": "^8.2.4"
   },

package/dist/chunk-EJDR5MHT.js

@@ -1,111 +0,0 @@
-// 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

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