@tscircuit/math-utils 0.0.24 → 0.0.26

package/README.md

@@ -71,6 +71,13 @@ console.log("Lines intersect:", intersects)
 | [`doBoundsOverlap(bounds1, bounds2)`](./src/bounds-overlap.ts) | Determine if two bounding rectangles overlap. |
 | [`boundsAreaOverlap(bounds1, bounds2)`](./src/bounds-area-overlap.ts) | Area of overlap between two bounding rectangles. |
 | [`boundsDistance(bounds1, bounds2)`](./src/bounds-distance.ts) | Minimum distance between two bounding rectangles. |
+| [`isPointInsidePolygon(point, polygon)`](./src/polygon.ts) | Determine if a point lies inside a polygon. |
+| [`areBoundsOverlappingPolygon(bounds, polygon)`](./src/polygon.ts) | Check whether bounds intersect or are contained by a polygon. |
+| [`areBoundsCompletelyInsidePolygon(bounds, polygon)`](./src/polygon.ts) | Determine if bounds are fully contained within a polygon. |
+| [`isRectOverlappingPolygon(rect, polygon)`](./src/polygon.ts) | Check whether a rectangle defined by `x`, `y`, `width`, and `height` overlaps a polygon. |
+| [`isRectCompletelyInsidePolygon(rect, polygon)`](./src/polygon.ts) | Determine if a rectangle is fully contained within a polygon. |
+
+`rect` objects are expected to use the `{ x, y, width, height }` convention with `x` and `y` denoting the minimum corner.
 
 ## Contributing
 

package/dist/bounds-intersection.d.ts

@@ -0,0 +1,11 @@
+import { Bounds } from './common.js';
+
+/**
+ * Calculates the overlapping bounds of two rectangles
+ * @param bounds1 First bounding rectangle
+ * @param bounds2 Second bounding rectangle
+ * @returns The overlapping bounds or null if there is no overlap
+ */
+declare const boundsIntersection: (bounds1: Bounds, bounds2: Bounds) => Bounds | null;
+
+export { boundsIntersection };

package/dist/bounds-intersection.js

@@ -0,0 +1,7 @@
+import {
+  boundsIntersection
+} from "./chunk-S7H7MIDL.js";
+export {
+  boundsIntersection
+};
+//# sourceMappingURL=bounds-intersection.js.map

package/dist/bounds-intersection.js.map

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

package/dist/chunk-S7H7MIDL.js

@@ -0,0 +1,16 @@
+// src/bounds-intersection.ts
+var boundsIntersection = (bounds1, bounds2) => {
+  const minX = Math.max(bounds1.minX, bounds2.minX);
+  const minY = Math.max(bounds1.minY, bounds2.minY);
+  const maxX = Math.min(bounds1.maxX, bounds2.maxX);
+  const maxY = Math.min(bounds1.maxY, bounds2.maxY);
+  if (minX > maxX || minY > maxY) {
+    return null;
+  }
+  return { minX, minY, maxX, maxY };
+};
+
+export {
+  boundsIntersection
+};
+//# sourceMappingURL=chunk-S7H7MIDL.js.map

package/dist/chunk-S7H7MIDL.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/bounds-intersection.ts"],"sourcesContent":["import type { Bounds } from \"./common\"\n\n/**\n * Calculates the overlapping bounds of two rectangles\n * @param bounds1 First bounding rectangle\n * @param bounds2 Second bounding rectangle\n * @returns The overlapping bounds or null if there is no overlap\n */\nexport const boundsIntersection = (\n  bounds1: Bounds,\n  bounds2: Bounds,\n): Bounds | null => {\n  const minX = Math.max(bounds1.minX, bounds2.minX)\n  const minY = Math.max(bounds1.minY, bounds2.minY)\n  const maxX = Math.min(bounds1.maxX, bounds2.maxX)\n  const maxY = Math.min(bounds1.maxY, bounds2.maxY)\n\n  if (minX > maxX || minY > maxY) {\n    return null\n  }\n\n  return { minX, minY, maxX, maxY }\n}\n"],"mappings":";AAQO,IAAM,qBAAqB,CAChC,SACA,YACkB;AAClB,QAAM,OAAO,KAAK,IAAI,QAAQ,MAAM,QAAQ,IAAI;AAChD,QAAM,OAAO,KAAK,IAAI,QAAQ,MAAM,QAAQ,IAAI;AAChD,QAAM,OAAO,KAAK,IAAI,QAAQ,MAAM,QAAQ,IAAI;AAChD,QAAM,OAAO,KAAK,IAAI,QAAQ,MAAM,QAAQ,IAAI;AAEhD,MAAI,OAAO,QAAQ,OAAO,MAAM;AAC9B,WAAO;AAAA,EACT;AAEA,SAAO,EAAE,MAAM,MAAM,MAAM,KAAK;AAClC;","names":[]}

package/dist/chunk-ZBLDFL2R.js

@@ -0,0 +1,111 @@
+import {
+  doSegmentsIntersect
+} from "./chunk-EFLPMB4J.js";
+
+// src/polygon.ts
+var rectToBounds = (rect) => ({
+  minX: rect.x,
+  minY: rect.y,
+  maxX: rect.x + rect.width,
+  maxY: rect.y + rect.height
+});
+var getBoundsCorners = (bounds) => [
+  { x: bounds.minX, y: bounds.minY },
+  { x: bounds.maxX, y: bounds.minY },
+  { x: bounds.maxX, y: bounds.maxY },
+  { x: bounds.minX, y: bounds.maxY }
+];
+var getPolygonEdges = (polygon) => {
+  const edges = [];
+  for (let i = 0; i < polygon.length; i++) {
+    const start = polygon[i];
+    const end = polygon[(i + 1) % polygon.length];
+    edges.push([start, end]);
+  }
+  return edges;
+};
+var isPointOnSegment = (point, start, end) => {
+  const cross = (point.y - start.y) * (end.x - start.x) - (point.x - start.x) * (end.y - start.y);
+  if (Math.abs(cross) > 1e-9) {
+    return false;
+  }
+  const dot = (point.x - start.x) * (end.x - start.x) + (point.y - start.y) * (end.y - start.y);
+  if (dot < 0) {
+    return false;
+  }
+  const squaredLength = (end.x - start.x) ** 2 + (end.y - start.y) ** 2;
+  if (dot > squaredLength) {
+    return false;
+  }
+  return true;
+};
+var isPointInsideBounds = (point, bounds) => point.x >= bounds.minX && point.x <= bounds.maxX && point.y >= bounds.minY && point.y <= bounds.maxY;
+var isPointInsidePolygon = (point, polygon) => {
+  if (polygon.length < 3) return false;
+  const edges = getPolygonEdges(polygon);
+  for (const [start, end] of edges) {
+    if (isPointOnSegment(point, start, end)) {
+      return true;
+    }
+  }
+  let inside = false;
+  for (let i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {
+    const xi = polygon[i].x;
+    const yi = polygon[i].y;
+    const xj = polygon[j].x;
+    const yj = polygon[j].y;
+    const intersects = yi > point.y !== yj > point.y && point.x < (xj - xi) * (point.y - yi) / (yj - yi) + xi;
+    if (intersects) {
+      inside = !inside;
+    }
+  }
+  return inside;
+};
+var doesPolygonIntersectBounds = (bounds, polygon) => {
+  const boundsCorners = getBoundsCorners(bounds);
+  const boundsEdges = [
+    [boundsCorners[0], boundsCorners[1]],
+    [boundsCorners[1], boundsCorners[2]],
+    [boundsCorners[2], boundsCorners[3]],
+    [boundsCorners[3], boundsCorners[0]]
+  ];
+  const polygonEdges = getPolygonEdges(polygon);
+  for (const [start, end] of polygonEdges) {
+    for (const [rectStart, rectEnd] of boundsEdges) {
+      if (doSegmentsIntersect(start, end, rectStart, rectEnd)) {
+        return true;
+      }
+    }
+  }
+  return false;
+};
+var areBoundsOverlappingPolygon = (bounds, polygon) => {
+  if (polygon.length < 3) return false;
+  if (polygon.some((point) => isPointInsideBounds(point, bounds))) {
+    return true;
+  }
+  const corners = getBoundsCorners(bounds);
+  if (corners.some((corner) => isPointInsidePolygon(corner, polygon))) {
+    return true;
+  }
+  return doesPolygonIntersectBounds(bounds, polygon);
+};
+var areBoundsCompletelyInsidePolygon = (bounds, polygon) => {
+  if (polygon.length < 3) return false;
+  const corners = getBoundsCorners(bounds);
+  if (!corners.every((corner) => isPointInsidePolygon(corner, polygon))) {
+    return false;
+  }
+  return !doesPolygonIntersectBounds(bounds, polygon);
+};
+var isRectOverlappingPolygon = (rect, polygon) => areBoundsOverlappingPolygon(rectToBounds(rect), polygon);
+var isRectCompletelyInsidePolygon = (rect, polygon) => areBoundsCompletelyInsidePolygon(rectToBounds(rect), polygon);
+
+export {
+  isPointInsidePolygon,
+  areBoundsOverlappingPolygon,
+  areBoundsCompletelyInsidePolygon,
+  isRectOverlappingPolygon,
+  isRectCompletelyInsidePolygon
+};
+//# sourceMappingURL=chunk-ZBLDFL2R.js.map

package/dist/chunk-ZBLDFL2R.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/polygon.ts"],"sourcesContent":["import type { Bounds, Point, Rect } from \"./common\"\nimport { doSegmentsIntersect } from \"./line-intersections\"\n\nexport type Polygon = readonly Point[]\n\nconst rectToBounds = (rect: Rect): Bounds => ({\n  minX: rect.x,\n  minY: rect.y,\n  maxX: rect.x + rect.width,\n  maxY: rect.y + rect.height,\n})\n\nconst getBoundsCorners = (bounds: Bounds): Point[] => [\n  { x: bounds.minX, y: bounds.minY },\n  { x: bounds.maxX, y: bounds.minY },\n  { x: bounds.maxX, y: bounds.maxY },\n  { x: bounds.minX, y: bounds.maxY },\n]\n\nconst getPolygonEdges = (polygon: Polygon): Array<[Point, Point]> => {\n  const edges: Array<[Point, Point]> = []\n  for (let i = 0; i < polygon.length; i++) {\n    const start = polygon[i]\n    const end = polygon[(i + 1) % polygon.length]\n    edges.push([start, end])\n  }\n  return edges\n}\n\nconst isPointOnSegment = (point: Point, start: Point, end: Point): boolean => {\n  const cross =\n    (point.y - start.y) * (end.x - start.x) -\n    (point.x - start.x) * (end.y - start.y)\n  if (Math.abs(cross) > 1e-9) {\n    return false\n  }\n\n  const dot =\n    (point.x - start.x) * (end.x - start.x) +\n    (point.y - start.y) * (end.y - start.y)\n  if (dot < 0) {\n    return false\n  }\n\n  const squaredLength = (end.x - start.x) ** 2 + (end.y - start.y) ** 2\n  if (dot > squaredLength) {\n    return false\n  }\n\n  return true\n}\n\nconst isPointInsideBounds = (point: Point, bounds: Bounds): boolean =>\n  point.x >= bounds.minX &&\n  point.x <= bounds.maxX &&\n  point.y >= bounds.minY &&\n  point.y <= bounds.maxY\n\nexport const isPointInsidePolygon = (\n  point: Point,\n  polygon: Polygon,\n): boolean => {\n  if (polygon.length < 3) return false\n\n  const edges = getPolygonEdges(polygon)\n  for (const [start, end] of edges) {\n    if (isPointOnSegment(point, start, end)) {\n      return true\n    }\n  }\n\n  let inside = false\n  for (let i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {\n    const xi = polygon[i].x\n    const yi = polygon[i].y\n    const xj = polygon[j].x\n    const yj = polygon[j].y\n\n    const intersects =\n      yi > point.y !== yj > point.y &&\n      point.x < ((xj - xi) * (point.y - yi)) / (yj - yi) + xi\n\n    if (intersects) {\n      inside = !inside\n    }\n  }\n\n  return inside\n}\n\nconst doesPolygonIntersectBounds = (\n  bounds: Bounds,\n  polygon: Polygon,\n): boolean => {\n  const boundsCorners = getBoundsCorners(bounds)\n  const boundsEdges: Array<[Point, Point]> = [\n    [boundsCorners[0], boundsCorners[1]],\n    [boundsCorners[1], boundsCorners[2]],\n    [boundsCorners[2], boundsCorners[3]],\n    [boundsCorners[3], boundsCorners[0]],\n  ]\n\n  const polygonEdges = getPolygonEdges(polygon)\n\n  for (const [start, end] of polygonEdges) {\n    for (const [rectStart, rectEnd] of boundsEdges) {\n      if (doSegmentsIntersect(start, end, rectStart, rectEnd)) {\n        return true\n      }\n    }\n  }\n\n  return false\n}\n\nexport const areBoundsOverlappingPolygon = (\n  bounds: Bounds,\n  polygon: Polygon,\n): boolean => {\n  if (polygon.length < 3) return false\n\n  if (polygon.some((point) => isPointInsideBounds(point, bounds))) {\n    return true\n  }\n\n  const corners = getBoundsCorners(bounds)\n  if (corners.some((corner) => isPointInsidePolygon(corner, polygon))) {\n    return true\n  }\n\n  return doesPolygonIntersectBounds(bounds, polygon)\n}\n\nexport const areBoundsCompletelyInsidePolygon = (\n  bounds: Bounds,\n  polygon: Polygon,\n): boolean => {\n  if (polygon.length < 3) return false\n\n  const corners = getBoundsCorners(bounds)\n  if (!corners.every((corner) => isPointInsidePolygon(corner, polygon))) {\n    return false\n  }\n\n  return !doesPolygonIntersectBounds(bounds, polygon)\n}\n\nexport const isRectOverlappingPolygon = (\n  rect: Rect,\n  polygon: Polygon,\n): boolean => areBoundsOverlappingPolygon(rectToBounds(rect), polygon)\n\nexport const isRectCompletelyInsidePolygon = (\n  rect: Rect,\n  polygon: Polygon,\n): boolean => areBoundsCompletelyInsidePolygon(rectToBounds(rect), polygon)\n"],"mappings":";;;;;AAKA,IAAM,eAAe,CAAC,UAAwB;AAAA,EAC5C,MAAM,KAAK;AAAA,EACX,MAAM,KAAK;AAAA,EACX,MAAM,KAAK,IAAI,KAAK;AAAA,EACpB,MAAM,KAAK,IAAI,KAAK;AACtB;AAEA,IAAM,mBAAmB,CAAC,WAA4B;AAAA,EACpD,EAAE,GAAG,OAAO,MAAM,GAAG,OAAO,KAAK;AAAA,EACjC,EAAE,GAAG,OAAO,MAAM,GAAG,OAAO,KAAK;AAAA,EACjC,EAAE,GAAG,OAAO,MAAM,GAAG,OAAO,KAAK;AAAA,EACjC,EAAE,GAAG,OAAO,MAAM,GAAG,OAAO,KAAK;AACnC;AAEA,IAAM,kBAAkB,CAAC,YAA4C;AACnE,QAAM,QAA+B,CAAC;AACtC,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,MAAM,SAAS,IAAI,KAAK,QAAQ,MAAM;AAC5C,UAAM,KAAK,CAAC,OAAO,GAAG,CAAC;AAAA,EACzB;AACA,SAAO;AACT;AAEA,IAAM,mBAAmB,CAAC,OAAc,OAAc,QAAwB;AAC5E,QAAM,SACH,MAAM,IAAI,MAAM,MAAM,IAAI,IAAI,MAAM,MACpC,MAAM,IAAI,MAAM,MAAM,IAAI,IAAI,MAAM;AACvC,MAAI,KAAK,IAAI,KAAK,IAAI,MAAM;AAC1B,WAAO;AAAA,EACT;AAEA,QAAM,OACH,MAAM,IAAI,MAAM,MAAM,IAAI,IAAI,MAAM,MACpC,MAAM,IAAI,MAAM,MAAM,IAAI,IAAI,MAAM;AACvC,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AAEA,QAAM,iBAAiB,IAAI,IAAI,MAAM,MAAM,KAAK,IAAI,IAAI,MAAM,MAAM;AACpE,MAAI,MAAM,eAAe;AACvB,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEA,IAAM,sBAAsB,CAAC,OAAc,WACzC,MAAM,KAAK,OAAO,QAClB,MAAM,KAAK,OAAO,QAClB,MAAM,KAAK,OAAO,QAClB,MAAM,KAAK,OAAO;AAEb,IAAM,uBAAuB,CAClC,OACA,YACY;AACZ,MAAI,QAAQ,SAAS,EAAG,QAAO;AAE/B,QAAM,QAAQ,gBAAgB,OAAO;AACrC,aAAW,CAAC,OAAO,GAAG,KAAK,OAAO;AAChC,QAAI,iBAAiB,OAAO,OAAO,GAAG,GAAG;AACvC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,QAAQ,SAAS,GAAG,IAAI,QAAQ,QAAQ,IAAI,KAAK;AACnE,UAAM,KAAK,QAAQ,CAAC,EAAE;AACtB,UAAM,KAAK,QAAQ,CAAC,EAAE;AACtB,UAAM,KAAK,QAAQ,CAAC,EAAE;AACtB,UAAM,KAAK,QAAQ,CAAC,EAAE;AAEtB,UAAM,aACJ,KAAK,MAAM,MAAM,KAAK,MAAM,KAC5B,MAAM,KAAM,KAAK,OAAO,MAAM,IAAI,OAAQ,KAAK,MAAM;AAEvD,QAAI,YAAY;AACd,eAAS,CAAC;AAAA,IACZ;AAAA,EACF;AAEA,SAAO;AACT;AAEA,IAAM,6BAA6B,CACjC,QACA,YACY;AACZ,QAAM,gBAAgB,iBAAiB,MAAM;AAC7C,QAAM,cAAqC;AAAA,IACzC,CAAC,cAAc,CAAC,GAAG,cAAc,CAAC,CAAC;AAAA,IACnC,CAAC,cAAc,CAAC,GAAG,cAAc,CAAC,CAAC;AAAA,IACnC,CAAC,cAAc,CAAC,GAAG,cAAc,CAAC,CAAC;AAAA,IACnC,CAAC,cAAc,CAAC,GAAG,cAAc,CAAC,CAAC;AAAA,EACrC;AAEA,QAAM,eAAe,gBAAgB,OAAO;AAE5C,aAAW,CAAC,OAAO,GAAG,KAAK,cAAc;AACvC,eAAW,CAAC,WAAW,OAAO,KAAK,aAAa;AAC9C,UAAI,oBAAoB,OAAO,KAAK,WAAW,OAAO,GAAG;AACvD,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEO,IAAM,8BAA8B,CACzC,QACA,YACY;AACZ,MAAI,QAAQ,SAAS,EAAG,QAAO;AAE/B,MAAI,QAAQ,KAAK,CAAC,UAAU,oBAAoB,OAAO,MAAM,CAAC,GAAG;AAC/D,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,iBAAiB,MAAM;AACvC,MAAI,QAAQ,KAAK,CAAC,WAAW,qBAAqB,QAAQ,OAAO,CAAC,GAAG;AACnE,WAAO;AAAA,EACT;AAEA,SAAO,2BAA2B,QAAQ,OAAO;AACnD;AAEO,IAAM,mCAAmC,CAC9C,QACA,YACY;AACZ,MAAI,QAAQ,SAAS,EAAG,QAAO;AAE/B,QAAM,UAAU,iBAAiB,MAAM;AACvC,MAAI,CAAC,QAAQ,MAAM,CAAC,WAAW,qBAAqB,QAAQ,OAAO,CAAC,GAAG;AACrE,WAAO;AAAA,EACT;AAEA,SAAO,CAAC,2BAA2B,QAAQ,OAAO;AACpD;AAEO,IAAM,2BAA2B,CACtC,MACA,YACY,4BAA4B,aAAa,IAAI,GAAG,OAAO;AAE9D,IAAM,gCAAgC,CAC3C,MACA,YACY,iCAAiC,aAAa,IAAI,GAAG,OAAO;","names":[]}

package/dist/common.d.ts

@@ -8,5 +8,11 @@ type Bounds = {
     maxX: number;
     maxY: number;
 };
+type Rect = {
+    x: number;
+    y: number;
+    width: number;
+    height: number;
+};
 
-export type { Bounds, Point };
+export type { Bounds, Point, Rect };

package/dist/index.d.ts

@@ -1,6 +1,6 @@
 export { distance, doSegmentsIntersect, doesLineIntersectLine, doesSegmentIntersectRect, getSegmentIntersection, onSegment, orientation, pointToSegmentDistance } from './line-intersections.js';
 export { Box, BoxSet, GridCell, clamp, computeDistanceBetweenBoxes, computeGapBetweenBoxes, computeManhattanDistanceBetweenBoxes, findNearestPointsBetweenBoxSets, getBoundingBox } from './nearest-box.js';
-export { Bounds, Point } from './common.js';
+export { Bounds, Point, Rect } from './common.js';
 export { getUnitVectorFromDirection, getUnitVectorFromPointAToB } from './get-unit-vector.js';
 export { GridCellPositions, GridOptions, grid } from './grid.js';
 export { pointToSegmentClosestPoint, segmentToBoundsMinDistance, segmentToBoxMinDistance, segmentToCircleMinDistance, segmentToSegmentMinDistance } from './segment-distance.js';
@@ -10,3 +10,5 @@ export { range } from './range.js';
 export { doBoundsOverlap } from './bounds-overlap.js';
 export { boundsAreaOverlap } from './bounds-area-overlap.js';
 export { boundsDistance } from './bounds-distance.js';
+export { boundsIntersection } from './bounds-intersection.js';
+export { Polygon, areBoundsCompletelyInsidePolygon, areBoundsOverlappingPolygon, isPointInsidePolygon, isRectCompletelyInsidePolygon, isRectOverlappingPolygon } from './polygon.js';

package/dist/index.js

@@ -5,6 +5,13 @@ import {
   pointToBoxDistance
 } from "./chunk-BLY7FZPX.js";
 import "./chunk-MTORG67J.js";
+import {
+  areBoundsCompletelyInsidePolygon,
+  areBoundsOverlappingPolygon,
+  isPointInsidePolygon,
+  isRectCompletelyInsidePolygon,
+  isRectOverlappingPolygon
+} from "./chunk-ZBLDFL2R.js";
 import {
   range
 } from "./chunk-KY53E6CT.js";
@@ -23,12 +30,25 @@ import {
   findNearestPointsBetweenBoxSets,
   getBoundingBox
 } from "./chunk-DRDDWFOS.js";
+import {
+  distance,
+  doSegmentsIntersect,
+  doesLineIntersectLine,
+  doesSegmentIntersectRect,
+  getSegmentIntersection,
+  onSegment,
+  orientation,
+  pointToSegmentDistance
+} from "./chunk-EFLPMB4J.js";
 import {
   boundsAreaOverlap
 } from "./chunk-YA3GC5BB.js";
 import {
   boundsDistance
 } from "./chunk-KVGAXIWH.js";
+import {
+  boundsIntersection
+} from "./chunk-S7H7MIDL.js";
 import {
   doBoundsOverlap
 } from "./chunk-CA5ORSO4.js";
@@ -40,19 +60,12 @@ import {
 import {
   grid
 } from "./chunk-U45EKA3R.js";
-import {
-  distance,
-  doSegmentsIntersect,
-  doesLineIntersectLine,
-  doesSegmentIntersectRect,
-  getSegmentIntersection,
-  onSegment,
-  orientation,
-  pointToSegmentDistance
-} from "./chunk-EFLPMB4J.js";
 export {
+  areBoundsCompletelyInsidePolygon,
+  areBoundsOverlappingPolygon,
   boundsAreaOverlap,
   boundsDistance,
+  boundsIntersection,
   clamp,
   computeDistanceBetweenBoxes,
   computeGapBetweenBoxes,
@@ -69,6 +82,9 @@ export {
   getUnitVectorFromDirection,
   getUnitVectorFromPointAToB,
   grid,
+  isPointInsidePolygon,
+  isRectCompletelyInsidePolygon,
+  isRectOverlappingPolygon,
   midpoint,
   onSegment,
   orientation,

package/dist/polygon.d.ts

@@ -0,0 +1,10 @@
+import { Point, Bounds, Rect } from './common.js';
+
+type Polygon = readonly Point[];
+declare const isPointInsidePolygon: (point: Point, polygon: Polygon) => boolean;
+declare const areBoundsOverlappingPolygon: (bounds: Bounds, polygon: Polygon) => boolean;
+declare const areBoundsCompletelyInsidePolygon: (bounds: Bounds, polygon: Polygon) => boolean;
+declare const isRectOverlappingPolygon: (rect: Rect, polygon: Polygon) => boolean;
+declare const isRectCompletelyInsidePolygon: (rect: Rect, polygon: Polygon) => boolean;
+
+export { type Polygon, areBoundsCompletelyInsidePolygon, areBoundsOverlappingPolygon, isPointInsidePolygon, isRectCompletelyInsidePolygon, isRectOverlappingPolygon };

package/dist/polygon.js

@@ -0,0 +1,16 @@
+import {
+  areBoundsCompletelyInsidePolygon,
+  areBoundsOverlappingPolygon,
+  isPointInsidePolygon,
+  isRectCompletelyInsidePolygon,
+  isRectOverlappingPolygon
+} from "./chunk-ZBLDFL2R.js";
+import "./chunk-EFLPMB4J.js";
+export {
+  areBoundsCompletelyInsidePolygon,
+  areBoundsOverlappingPolygon,
+  isPointInsidePolygon,
+  isRectCompletelyInsidePolygon,
+  isRectOverlappingPolygon
+};
+//# sourceMappingURL=polygon.js.map

package/dist/polygon.js.map

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

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@tscircuit/math-utils",
   "main": "dist/index.js",
-  "version": "0.0.24",
+  "version": "0.0.26",
   "type": "module",
   "module": "dist/index.js",
   "types": "dist/index.d.ts",