@tscircuit/math-utils 0.0.31 → 0.0.33

package/dist/chunk-3WCUPG5S.js

@@ -0,0 +1,10 @@
+// src/get-bounds-center.ts
+var getBoundsCenter = (bounds) => ({
+  x: (bounds.minX + bounds.maxX) / 2,
+  y: (bounds.minY + bounds.maxY) / 2
+});
+
+export {
+  getBoundsCenter
+};
+//# sourceMappingURL=chunk-3WCUPG5S.js.map

package/dist/chunk-3WCUPG5S.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/get-bounds-center.ts"],"sourcesContent":["import type { Bounds, Point } from \"./common\"\n\n/**\n * Calculates the center point of a bounds rectangle.\n * @param bounds Bounds object containing minX, minY, maxX, maxY\n * @returns Center point of the bounds\n */\nexport const getBoundsCenter = (bounds: Bounds): Point => ({\n  x: (bounds.minX + bounds.maxX) / 2,\n  y: (bounds.minY + bounds.maxY) / 2,\n})\n"],"mappings":";AAOO,IAAM,kBAAkB,CAAC,YAA2B;AAAA,EACzD,IAAI,OAAO,OAAO,OAAO,QAAQ;AAAA,EACjC,IAAI,OAAO,OAAO,OAAO,QAAQ;AACnC;","names":[]}

package/dist/{chunk-RCZE5Q5V.js → chunk-6K6N6UTQ.js}

@@ -109,10 +109,11 @@ var isRectOverlappingPolygon = (rect, polygon) => areBoundsOverlappingPolygon(un
 var isRectCompletelyInsidePolygon = (rect, polygon) => areBoundsCompletelyInsidePolygon(universalRectToBounds(rect), polygon);
 
 export {
+  isPointInsideBounds,
   isPointInsidePolygon,
   areBoundsOverlappingPolygon,
   areBoundsCompletelyInsidePolygon,
   isRectOverlappingPolygon,
   isRectCompletelyInsidePolygon
 };
-//# sourceMappingURL=chunk-RCZE5Q5V.js.map
+//# sourceMappingURL=chunk-6K6N6UTQ.js.map

package/dist/chunk-6K6N6UTQ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/polygon.ts"],"sourcesContent":["import type { Bounds, Point, UniversalRect } from \"./common\"\nimport { doSegmentsIntersect } from \"./line-intersections\"\n\nexport type Polygon = readonly Point[]\n\nconst universalRectToBounds = (rect: UniversalRect): Bounds => {\n  if (\"minX\" in rect) {\n    return rect\n  }\n\n  const halfWidth = rect.width / 2\n  const halfHeight = rect.height / 2\n\n  return {\n    minX: rect.center.x - halfWidth,\n    minY: rect.center.y - halfHeight,\n    maxX: rect.center.x + halfWidth,\n    maxY: rect.center.y + halfHeight,\n  }\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\nexport const 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: UniversalRect,\n  polygon: Polygon,\n): boolean => areBoundsOverlappingPolygon(universalRectToBounds(rect), polygon)\n\nexport const isRectCompletelyInsidePolygon = (\n  rect: UniversalRect,\n  polygon: Polygon,\n): boolean =>\n  areBoundsCompletelyInsidePolygon(universalRectToBounds(rect), polygon)\n"],"mappings":";;;;;AAKA,IAAM,wBAAwB,CAAC,SAAgC;AAC7D,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,KAAK,QAAQ;AAC/B,QAAM,aAAa,KAAK,SAAS;AAEjC,SAAO;AAAA,IACL,MAAM,KAAK,OAAO,IAAI;AAAA,IACtB,MAAM,KAAK,OAAO,IAAI;AAAA,IACtB,MAAM,KAAK,OAAO,IAAI;AAAA,IACtB,MAAM,KAAK,OAAO,IAAI;AAAA,EACxB;AACF;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;AAEO,IAAM,sBAAsB,CAAC,OAAc,WAChD,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,sBAAsB,IAAI,GAAG,OAAO;AAEvE,IAAM,gCAAgC,CAC3C,MACA,YAEA,iCAAiC,sBAAsB,IAAI,GAAG,OAAO;","names":[]}

package/dist/get-bounds-center.d.ts

@@ -0,0 +1,10 @@
+import { Bounds, Point } from './common.js';
+
+/**
+ * Calculates the center point of a bounds rectangle.
+ * @param bounds Bounds object containing minX, minY, maxX, maxY
+ * @returns Center point of the bounds
+ */
+declare const getBoundsCenter: (bounds: Bounds) => Point;
+
+export { getBoundsCenter };

package/dist/get-bounds-center.js

@@ -0,0 +1,7 @@
+import {
+  getBoundsCenter
+} from "./chunk-3WCUPG5S.js";
+export {
+  getBoundsCenter
+};
+//# sourceMappingURL=get-bounds-center.js.map

package/dist/index.d.ts

@@ -11,7 +11,7 @@ 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';
+export { Polygon, areBoundsCompletelyInsidePolygon, areBoundsOverlappingPolygon, isPointInsideBounds, isPointInsidePolygon, isRectCompletelyInsidePolygon, isRectOverlappingPolygon } from './polygon.js';
 export { normalizeDegrees } from './normalize-degrees.js';
 export { getBoundsFromPoints } from './get-bounds-from-points.js';
-export { isPointInBounds } from './is-point-in-bounds.js';
+export { getBoundsCenter } from './get-bounds-center.js';

package/dist/index.js

@@ -9,8 +9,8 @@ import {
   segmentToSegmentMinDistance
 } from "./chunk-6PD3WN3Y.js";
 import {
-  isPointInBounds
-} from "./chunk-TDJ6LMXM.js";
+  grid
+} from "./chunk-U45EKA3R.js";
 import {
   normalizeDegrees
 } from "./chunk-P6GW5PWY.js";
@@ -32,10 +32,11 @@ import "./chunk-MTORG67J.js";
 import {
   areBoundsCompletelyInsidePolygon,
   areBoundsOverlappingPolygon,
+  isPointInsideBounds,
   isPointInsidePolygon,
   isRectCompletelyInsidePolygon,
   isRectOverlappingPolygon
-} from "./chunk-RCZE5Q5V.js";
+} from "./chunk-6K6N6UTQ.js";
 import {
   distance,
   doSegmentsIntersect,
@@ -59,6 +60,9 @@ import {
   doBoundsOverlap
 } from "./chunk-CA5ORSO4.js";
 import "./chunk-GYQ2KZV6.js";
+import {
+  getBoundsCenter
+} from "./chunk-3WCUPG5S.js";
 import {
   getBoundsFromPoints
 } from "./chunk-5N7UJNVK.js";
@@ -66,9 +70,6 @@ import {
   getUnitVectorFromDirection,
   getUnitVectorFromPointAToB
 } from "./chunk-GIGMPRPV.js";
-import {
-  grid
-} from "./chunk-U45EKA3R.js";
 export {
   areBoundsCompletelyInsidePolygon,
   areBoundsOverlappingPolygon,
@@ -87,12 +88,13 @@ export {
   doesSegmentIntersectRect,
   findNearestPointsBetweenBoxSets,
   getBoundingBox,
+  getBoundsCenter,
   getBoundsFromPoints,
   getSegmentIntersection,
   getUnitVectorFromDirection,
   getUnitVectorFromPointAToB,
   grid,
-  isPointInBounds,
+  isPointInsideBounds,
   isPointInsidePolygon,
   isRectCompletelyInsidePolygon,
   isRectOverlappingPolygon,

package/dist/polygon.d.ts

@@ -1,10 +1,11 @@
 import { Point, Bounds, UniversalRect } from './common.js';
 
 type Polygon = readonly Point[];
+declare const isPointInsideBounds: (point: Point, bounds: Bounds) => boolean;
 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: UniversalRect, polygon: Polygon) => boolean;
 declare const isRectCompletelyInsidePolygon: (rect: UniversalRect, polygon: Polygon) => boolean;
 
-export { type Polygon, areBoundsCompletelyInsidePolygon, areBoundsOverlappingPolygon, isPointInsidePolygon, isRectCompletelyInsidePolygon, isRectOverlappingPolygon };
+export { type Polygon, areBoundsCompletelyInsidePolygon, areBoundsOverlappingPolygon, isPointInsideBounds, isPointInsidePolygon, isRectCompletelyInsidePolygon, isRectOverlappingPolygon };

package/dist/polygon.js

@@ -1,14 +1,16 @@
 import {
   areBoundsCompletelyInsidePolygon,
   areBoundsOverlappingPolygon,
+  isPointInsideBounds,
   isPointInsidePolygon,
   isRectCompletelyInsidePolygon,
   isRectOverlappingPolygon
-} from "./chunk-RCZE5Q5V.js";
+} from "./chunk-6K6N6UTQ.js";
 import "./chunk-EFLPMB4J.js";
 export {
   areBoundsCompletelyInsidePolygon,
   areBoundsOverlappingPolygon,
+  isPointInsideBounds,
   isPointInsidePolygon,
   isRectCompletelyInsidePolygon,
   isRectOverlappingPolygon

package/package.json

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

package/dist/chunk-RCZE5Q5V.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/polygon.ts"],"sourcesContent":["import type { Bounds, Point, UniversalRect } from \"./common\"\nimport { doSegmentsIntersect } from \"./line-intersections\"\n\nexport type Polygon = readonly Point[]\n\nconst universalRectToBounds = (rect: UniversalRect): Bounds => {\n  if (\"minX\" in rect) {\n    return rect\n  }\n\n  const halfWidth = rect.width / 2\n  const halfHeight = rect.height / 2\n\n  return {\n    minX: rect.center.x - halfWidth,\n    minY: rect.center.y - halfHeight,\n    maxX: rect.center.x + halfWidth,\n    maxY: rect.center.y + halfHeight,\n  }\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: UniversalRect,\n  polygon: Polygon,\n): boolean => areBoundsOverlappingPolygon(universalRectToBounds(rect), polygon)\n\nexport const isRectCompletelyInsidePolygon = (\n  rect: UniversalRect,\n  polygon: Polygon,\n): boolean =>\n  areBoundsCompletelyInsidePolygon(universalRectToBounds(rect), polygon)\n"],"mappings":";;;;;AAKA,IAAM,wBAAwB,CAAC,SAAgC;AAC7D,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,KAAK,QAAQ;AAC/B,QAAM,aAAa,KAAK,SAAS;AAEjC,SAAO;AAAA,IACL,MAAM,KAAK,OAAO,IAAI;AAAA,IACtB,MAAM,KAAK,OAAO,IAAI;AAAA,IACtB,MAAM,KAAK,OAAO,IAAI;AAAA,IACtB,MAAM,KAAK,OAAO,IAAI;AAAA,EACxB;AACF;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,sBAAsB,IAAI,GAAG,OAAO;AAEvE,IAAM,gCAAgC,CAC3C,MACA,YAEA,iCAAiC,sBAAsB,IAAI,GAAG,OAAO;","names":[]}

package/dist/chunk-TDJ6LMXM.js

@@ -1,9 +0,0 @@
-// src/is-point-in-bounds.ts
-var isPointInBounds = (point, bounds) => {
-  return point.x >= bounds.minX && point.x <= bounds.maxX && point.y >= bounds.minY && point.y <= bounds.maxY;
-};
-
-export {
-  isPointInBounds
-};
-//# sourceMappingURL=chunk-TDJ6LMXM.js.map

package/dist/chunk-TDJ6LMXM.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/is-point-in-bounds.ts"],"sourcesContent":["import type { Bounds, Point } from \"./common\"\n\n/**\n * Determines if a point is inside or on the boundary of a bounds rectangle\n * @param point The point to check\n * @param bounds The bounding rectangle\n * @returns true if the point is within the bounds, false otherwise\n */\nexport const isPointInBounds = (point: Point, bounds: Bounds): boolean => {\n  return (\n    point.x >= bounds.minX &&\n    point.x <= bounds.maxX &&\n    point.y >= bounds.minY &&\n    point.y <= bounds.maxY\n  )\n}\n"],"mappings":";AAQO,IAAM,kBAAkB,CAAC,OAAc,WAA4B;AACxE,SACE,MAAM,KAAK,OAAO,QAClB,MAAM,KAAK,OAAO,QAClB,MAAM,KAAK,OAAO,QAClB,MAAM,KAAK,OAAO;AAEtB;","names":[]}

package/dist/is-point-in-bounds.d.ts

@@ -1,11 +0,0 @@
-import { Point, Bounds } from './common.js';
-
-/**
- * Determines if a point is inside or on the boundary of a bounds rectangle
- * @param point The point to check
- * @param bounds The bounding rectangle
- * @returns true if the point is within the bounds, false otherwise
- */
-declare const isPointInBounds: (point: Point, bounds: Bounds) => boolean;
-
-export { isPointInBounds };

package/dist/is-point-in-bounds.js

@@ -1,7 +0,0 @@
-import {
-  isPointInBounds
-} from "./chunk-TDJ6LMXM.js";
-export {
-  isPointInBounds
-};
-//# sourceMappingURL=is-point-in-bounds.js.map