@tscircuit/math-utils 0.0.26 → 0.0.28

package/README.md

@@ -74,10 +74,10 @@ console.log("Lines intersect:", intersects)
 | [`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. |
+| [`isRectOverlappingPolygon(rect, polygon)`](./src/polygon.ts) | Check whether a rectangle defined by a center point with dimensions or by bounds overlaps a polygon. |
+| [`isRectCompletelyInsidePolygon(rect, polygon)`](./src/polygon.ts) | Determine if a rectangle defined by a center point with dimensions or by bounds 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.
+`rect` objects passed to these helpers can either specify a `center` along with `width` and `height` or provide `Bounds` directly.
 
 ## Contributing
 

package/dist/chunk-P6GW5PWY.js

@@ -0,0 +1,10 @@
+// src/normalize-degrees.ts
+function normalizeDegrees(angle) {
+  const normalized = (angle % 360 + 360) % 360;
+  return normalized;
+}
+
+export {
+  normalizeDegrees
+};
+//# sourceMappingURL=chunk-P6GW5PWY.js.map

package/dist/chunk-P6GW5PWY.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/normalize-degrees.ts"],"sourcesContent":["export function normalizeDegrees(angle: number): number {\n  const normalized = ((angle % 360) + 360) % 360\n  return normalized\n}\n"],"mappings":";AAAO,SAAS,iBAAiB,OAAuB;AACtD,QAAM,cAAe,QAAQ,MAAO,OAAO;AAC3C,SAAO;AACT;","names":[]}

package/dist/{chunk-ZBLDFL2R.js → chunk-RCZE5Q5V.js}

@@ -3,12 +3,19 @@ import {
 } 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 universalRectToBounds = (rect) => {
+  if ("minX" in rect) {
+    return rect;
+  }
+  const halfWidth = rect.width / 2;
+  const halfHeight = rect.height / 2;
+  return {
+    minX: rect.center.x - halfWidth,
+    minY: rect.center.y - halfHeight,
+    maxX: rect.center.x + halfWidth,
+    maxY: rect.center.y + halfHeight
+  };
+};
 var getBoundsCorners = (bounds) => [
   { x: bounds.minX, y: bounds.minY },
   { x: bounds.maxX, y: bounds.minY },
@@ -98,8 +105,8 @@ var areBoundsCompletelyInsidePolygon = (bounds, polygon) => {
   }
   return !doesPolygonIntersectBounds(bounds, polygon);
 };
-var isRectOverlappingPolygon = (rect, polygon) => areBoundsOverlappingPolygon(rectToBounds(rect), polygon);
-var isRectCompletelyInsidePolygon = (rect, polygon) => areBoundsCompletelyInsidePolygon(rectToBounds(rect), polygon);
+var isRectOverlappingPolygon = (rect, polygon) => areBoundsOverlappingPolygon(universalRectToBounds(rect), polygon);
+var isRectCompletelyInsidePolygon = (rect, polygon) => areBoundsCompletelyInsidePolygon(universalRectToBounds(rect), polygon);
 
 export {
   isPointInsidePolygon,
@@ -108,4 +115,4 @@ export {
   isRectOverlappingPolygon,
   isRectCompletelyInsidePolygon
 };
-//# sourceMappingURL=chunk-ZBLDFL2R.js.map
+//# sourceMappingURL=chunk-RCZE5Q5V.js.map

package/dist/chunk-RCZE5Q5V.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\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/common.d.ts

@@ -14,5 +14,10 @@ type Rect = {
     width: number;
     height: number;
 };
+type UniversalRect = {
+    center: Point;
+    width: number;
+    height: number;
+} | Bounds;
 
-export type { Bounds, Point, Rect };
+export type { Bounds, Point, Rect, UniversalRect };

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, Rect } from './common.js';
+export { Bounds, Point, Rect, UniversalRect } 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';
@@ -12,3 +12,4 @@ 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 { normalizeDegrees } from './normalize-degrees.js';

package/dist/index.js

@@ -1,3 +1,6 @@
+import {
+  normalizeDegrees
+} from "./chunk-P6GW5PWY.js";
 import {
   distSq,
   midpoint,
@@ -11,7 +14,7 @@ import {
   isPointInsidePolygon,
   isRectCompletelyInsidePolygon,
   isRectOverlappingPolygon
-} from "./chunk-ZBLDFL2R.js";
+} from "./chunk-RCZE5Q5V.js";
 import {
   range
 } from "./chunk-KY53E6CT.js";
@@ -86,6 +89,7 @@ export {
   isRectCompletelyInsidePolygon,
   isRectOverlappingPolygon,
   midpoint,
+  normalizeDegrees,
   onSegment,
   orientation,
   pointToBoundsDistance,

package/dist/normalize-degrees.d.ts

@@ -0,0 +1,3 @@
+declare function normalizeDegrees(angle: number): number;
+
+export { normalizeDegrees };

package/dist/normalize-degrees.js

@@ -0,0 +1,7 @@
+import {
+  normalizeDegrees
+} from "./chunk-P6GW5PWY.js";
+export {
+  normalizeDegrees
+};
+//# sourceMappingURL=normalize-degrees.js.map

package/dist/normalize-degrees.js.map

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

package/dist/polygon.d.ts

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

package/dist/polygon.js

@@ -4,7 +4,7 @@ import {
   isPointInsidePolygon,
   isRectCompletelyInsidePolygon,
   isRectOverlappingPolygon
-} from "./chunk-ZBLDFL2R.js";
+} from "./chunk-RCZE5Q5V.js";
 import "./chunk-EFLPMB4J.js";
 export {
   areBoundsCompletelyInsidePolygon,

package/package.json

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

package/dist/chunk-ZBLDFL2R.js.map

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