@woosh/meep-engine 2.163.11 → 2.165.0

package/src/core/geom/2d/polygon/polygon2_clip_halfplane.js

@@ -0,0 +1,50 @@
+// Inside/outside slack. A vertex within POINT_EPS of the directed edge counts as on the kept side, so a
+// point geometrically on the boundary is preserved rather than dropped by floating-point noise.
+const POINT_EPS = 1e-9;
+
+/**
+ * Sutherland-Hodgman clip of a 2D polygon against one half-plane of a directed edge - the general-edge
+ * analogue of {@link polygon2_clip_axis_halfplane}. The edge passes through (ex, ey) with direction
+ * (dx, dy); `keep_left` keeps the side with `cross(dir, P - e) >= 0`, otherwise the right side.
+ *
+ * @param {Float64Array} points_in input vertices (stride 2)
+ * @param {number} point_count input vertex count
+ * @param {Float64Array} points_out output buffer (stride 2), sized for at least point_count + 1 vertices
+ * @param {number} ex
+ * @param {number} ey a point on the edge
+ * @param {number} dx
+ * @param {number} dy the edge direction
+ * @param {boolean} keep_left keep the left half-plane when true
+ * @returns {number} surviving vertex count
+ */
+export function polygon2_clip_halfplane(points_in, point_count, points_out, ex, ey, dx, dy, keep_left) {
+    let out_n = 0;
+
+    for (let i = 0; i < point_count; i++) {
+        const j = (i + 1) % point_count;
+
+        const a_u = points_in[i * 2], a_v = points_in[i * 2 + 1];
+        const b_u = points_in[j * 2], b_v = points_in[j * 2 + 1];
+
+        const sa = dx * (a_v - ey) - dy * (a_u - ex);
+        const sb = dx * (b_v - ey) - dy * (b_u - ex);
+
+        const in_a = keep_left ? (sa >= -POINT_EPS) : (sa <= POINT_EPS);
+        const in_b = keep_left ? (sb >= -POINT_EPS) : (sb <= POINT_EPS);
+
+        if (in_a) {
+            points_out[out_n * 2] = a_u;
+            points_out[out_n * 2 + 1] = a_v;
+            out_n++;
+        }
+
+        if (in_a !== in_b) {
+            const t = sa / (sa - sb);
+            points_out[out_n * 2] = a_u + t * (b_u - a_u);
+            points_out[out_n * 2 + 1] = a_v + t * (b_v - a_v);
+            out_n++;
+        }
+    }
+
+    return out_n;
+}

package/src/core/geom/2d/polygon/polygon2_signed_area.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Uses Green's Theorem to compute area of a 2d polygon
+ * @param {number[]|Float32Array|Float64Array} points
+ * @param {number} point_count
+ * @returns {number}
+ */
+export function polygon2_signed_area(points: number[] | Float32Array | Float64Array, point_count: number): number;
+//# sourceMappingURL=polygon2_signed_area.d.ts.map

package/src/core/geom/2d/polygon/polygon2_signed_area.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"polygon2_signed_area.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/polygon/polygon2_signed_area.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,6CAJW,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,eAClC,MAAM,GACJ,MAAM,CA6BlB"}

package/src/core/geom/2d/polygon/polygon2_signed_area.js

@@ -0,0 +1,34 @@
+/**
+ * Uses Green's Theorem to compute area of a 2d polygon
+ * @param {number[]|Float32Array|Float64Array} points
+ * @param {number} point_count
+ * @returns {number}
+ */
+export function polygon2_signed_area(points, point_count) {
+    let sum = 0;
+
+    for (let i = 0; i < point_count - 1; i++) {
+        const i2 = i * 2;
+
+        const x0 = points[i2];
+        const y0 = points[i2 + 1];
+
+        const x1 = points[i2 + 2];
+        const y1 = points[i2 + 3];
+
+        sum += x0 * y1 - y0 * x1;
+    }
+
+    const first_x = points[0];
+    const first_y = points[1];
+
+    const last_x = points[point_count * 2 - 2];
+    const last_y = points[point_count * 2 - 1];
+
+    if (first_x !== last_x || first_y !== last_y) {
+        // doesn't wrap around, let's close the loop ourselves
+        sum += last_x * first_y - last_y * first_x;
+    }
+
+    return sum * 0.5;
+}

package/src/core/geom/2d/quad-tree/qt_collect_by_box.js

@@ -1,5 +1,5 @@
 import { assert } from "../../../assert.js";
-import { aabb2_overlap_exists } from "../aabb/aabb2_overlap_exists.js";
+import { aabb2_intersects_aabb2 } from "../aabb/aabb2_intersects_aabb2.js";
 
 /**
  *
@@ -44,7 +44,7 @@ export function qt_collect_by_box(
 
         const node = node_stack[stack_pointer];
 
-        if (!aabb2_overlap_exists(node.x0, node.y0, node.x1, node.y1, x0, y0, x1,y1)) {
+        if (!aabb2_intersects_aabb2(node.x0, node.y0, node.x1, node.y1, x0, y0, x1,y1)) {
             // not a match
             continue;
         }
@@ -55,7 +55,7 @@ export function qt_collect_by_box(
         for (let i = 0; i < data_count; i++) {
             const datum = data[i];
 
-            if (aabb2_overlap_exists(datum.x0, datum.y0, datum.x1, datum.y1, x0, y0, x1,y1)) {
+            if (aabb2_intersects_aabb2(datum.x0, datum.y0, datum.x1, datum.y1, x0, y0, x1,y1)) {
                 result[result_cursor++] = datum;
             }
         }

package/src/core/geom/2d/quad-tree/qt_collect_by_point.js

@@ -1,5 +1,5 @@
 import { assert } from "../../../assert.js";
-import { aabb2_intersects_point } from "../aabb/aabb2_intersects_point.js";
+import { aabb2_contains_point } from "../aabb/aabb2_contains_point.js";
 
 /**
  *
@@ -39,7 +39,7 @@ export function qt_collect_by_point(
 
         const node = node_stack[stack_pointer];
 
-        if (!aabb2_intersects_point(node.x0, node.y0, node.x1, node.y1, x, y)) {
+        if (!aabb2_contains_point(node.x0, node.y0, node.x1, node.y1, x, y)) {
             // not a match
             continue;
         }
@@ -50,7 +50,7 @@ export function qt_collect_by_point(
         for (let i = 0; i < data_count; i++) {
             const datum = data[i];
 
-            if (aabb2_intersects_point(datum.x0, datum.y0, datum.x1, datum.y1, x, y)) {
+            if (aabb2_contains_point(datum.x0, datum.y0, datum.x1, datum.y1, x, y)) {
                 result[result_cursor++] = datum;
             }
         }

package/src/core/geom/2d/quad-tree/qt_query_closest_to_point.d.ts

@@ -0,0 +1,12 @@
+/**
+ * @template N
+ * @param {QuadTreeNode<N>} tree
+ * @param {number} x
+ * @param {number} y
+ * @param {number} [max_distance] linear distance cutoff. Data farther than this are ignored.
+ * NOTE: this is a LINEAR distance, not squared — it is squared internally. Callers holding a
+ * squared distance (e.g. from {@link aabb2_distance_sqr_to_point}) must pass `Math.sqrt(...)`.
+ * @returns {QuadTreeDatum<N>}
+ */
+export function qt_query_closest_to_point<N>(tree: QuadTreeNode<N>, x: number, y: number, max_distance?: number): QuadTreeDatum<N>;
+//# sourceMappingURL=qt_query_closest_to_point.d.ts.map

package/src/core/geom/2d/quad-tree/qt_query_closest_to_point.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"qt_query_closest_to_point.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/qt_query_closest_to_point.js"],"names":[],"mappings":"AAQA;;;;;;;;;GASG;AACH,uEAPW,MAAM,KACN,MAAM,iBACN,MAAM,oBAgDhB"}

package/src/core/geom/2d/quad-tree/qt_query_closest_to_point.js

@@ -0,0 +1,62 @@
+import { aabb2_distance_sqr_to_point } from "../aabb/aabb2_distance_sqr_to_point.js";
+
+/**
+ *
+ * @type {QuadTreeNode[]}
+ */
+const node_stack = [];
+
+/**
+ * @template N
+ * @param {QuadTreeNode<N>} tree
+ * @param {number} x
+ * @param {number} y
+ * @param {number} [max_distance] linear distance cutoff. Data farther than this are ignored.
+ * NOTE: this is a LINEAR distance, not squared — it is squared internally. Callers holding a
+ * squared distance (e.g. from {@link aabb2_distance_sqr_to_point}) must pass `Math.sqrt(...)`.
+ * @returns {QuadTreeDatum<N>}
+ */
+export function qt_query_closest_to_point(tree, x, y, max_distance = Infinity) {
+
+    let stack_pointer = 1;
+
+    node_stack[0] = tree;
+
+    let best_leaf_data = undefined;
+    let best_distance_sqr = max_distance * max_distance;
+
+    while (stack_pointer-- > 0) {
+
+        const node = node_stack[stack_pointer];
+
+        const distance_sqr = aabb2_distance_sqr_to_point(node.x0, node.y0, node.x1, node.y1, x, y);
+
+        if (distance_sqr >= best_distance_sqr) {
+            // too far
+            continue;
+        }
+
+        const data = node.data;
+        const data_count = data.length;
+
+        for (let i = 0; i < data_count; i++) {
+            const datum = data[i];
+
+            const distance_sqr = aabb2_distance_sqr_to_point(datum.x0, datum.y0, datum.x1, datum.y1, x, y);
+
+            if (distance_sqr < best_distance_sqr) {
+                best_leaf_data = datum;
+                best_distance_sqr = distance_sqr;
+            }
+        }
+
+        if (node.isSplit()) {
+            node_stack[stack_pointer++] = node.topLeft;
+            node_stack[stack_pointer++] = node.topRight;
+            node_stack[stack_pointer++] = node.bottomLeft;
+            node_stack[stack_pointer++] = node.bottomRight;
+        }
+    }
+
+    return best_leaf_data;
+}

package/src/core/geom/2d/quad-tree/qt_query_data_nearest_to_point.d.ts

@@ -1,12 +1,7 @@
 /**
- * @template N
- * @param {QuadTreeNode<N>} tree
- * @param {number} x
- * @param {number} y
- * @param {number} [max_distance] linear distance cutoff. Data farther than this are ignored.
- * NOTE: this is a LINEAR distance, not squared — it is squared internally. Callers holding a
- * squared distance (e.g. from {@link aabb2_distance_sqr_to_point}) must pass `Math.sqrt(...)`.
- * @returns {QuadTreeDatum<N>}
+ * @deprecated Renamed to {@link qt_query_closest_to_point}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
  */
-export function qt_query_data_nearest_to_point<N>(tree: QuadTreeNode<N>, x: number, y: number, max_distance?: number): QuadTreeDatum<N>;
+export const qt_query_data_nearest_to_point: typeof qt_query_closest_to_point;
+import { qt_query_closest_to_point } from "./qt_query_closest_to_point.js";
 //# sourceMappingURL=qt_query_data_nearest_to_point.d.ts.map

package/src/core/geom/2d/quad-tree/qt_query_data_nearest_to_point.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"qt_query_data_nearest_to_point.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/qt_query_data_nearest_to_point.js"],"names":[],"mappings":"AAQA;;;;;;;;;GASG;AACH,4EAPW,MAAM,KACN,MAAM,iBACN,MAAM,oBAgDhB"}
+{"version":3,"file":"qt_query_data_nearest_to_point.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/qt_query_data_nearest_to_point.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,8EAAwE;0CAN9B,gCAAgC"}

package/src/core/geom/2d/quad-tree/qt_query_data_nearest_to_point.js

@@ -1,62 +1,7 @@
-import { aabb2_distance_sqr_to_point } from "../aabb/aabb2_distance_sqr_to_point.js";
-
-/**
- *
- * @type {QuadTreeNode[]}
- */
-const node_stack = [];
-
-/**
- * @template N
- * @param {QuadTreeNode<N>} tree
- * @param {number} x
- * @param {number} y
- * @param {number} [max_distance] linear distance cutoff. Data farther than this are ignored.
- * NOTE: this is a LINEAR distance, not squared — it is squared internally. Callers holding a
- * squared distance (e.g. from {@link aabb2_distance_sqr_to_point}) must pass `Math.sqrt(...)`.
- * @returns {QuadTreeDatum<N>}
- */
-export function qt_query_data_nearest_to_point(tree, x, y, max_distance = Infinity) {
-
-    let stack_pointer = 1;
-
-    node_stack[0] = tree;
-
-    let best_leaf_data = undefined;
-    let best_distance_sqr = max_distance * max_distance;
-
-    while (stack_pointer-- > 0) {
-
-        const node = node_stack[stack_pointer];
-
-        const distance_sqr = aabb2_distance_sqr_to_point(node.x0, node.y0, node.x1, node.y1, x, y);
-
-        if (distance_sqr >= best_distance_sqr) {
-            // too far
-            continue;
-        }
-
-        const data = node.data;
-        const data_count = data.length;
-
-        for (let i = 0; i < data_count; i++) {
-            const datum = data[i];
-
-            const distance_sqr = aabb2_distance_sqr_to_point(datum.x0, datum.y0, datum.x1, datum.y1, x, y);
-
-            if (distance_sqr < best_distance_sqr) {
-                best_leaf_data = datum;
-                best_distance_sqr = distance_sqr;
-            }
-        }
-
-        if (node.isSplit()) {
-            node_stack[stack_pointer++] = node.topLeft;
-            node_stack[stack_pointer++] = node.topRight;
-            node_stack[stack_pointer++] = node.bottomLeft;
-            node_stack[stack_pointer++] = node.bottomRight;
-        }
-    }
-
-    return best_leaf_data;
-}
+import { qt_query_closest_to_point } from "./qt_query_closest_to_point.js";
+
+/**
+ * @deprecated Renamed to {@link qt_query_closest_to_point}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
+ */
+export const qt_query_data_nearest_to_point = qt_query_closest_to_point;

package/src/core/geom/2d/r-tree/StaticR2Tree.js

@@ -4,7 +4,7 @@ import { split_by_2 } from "../../../binary/split_by_2.js";
 import { array_copy } from "../../../collection/array/array_copy.js";
 import { array_swap } from "../../../collection/array/array_swap.js";
 import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
-import { aabb2_array_combine } from "../aabb/aabb2_array_combine.js";
+import { aabb2_union_array } from "../aabb/aabb2_union_array.js";
 
 const BINARY_NODE_SIZE = 4;
 const LEAF_NODE_SIZE = 5;
@@ -339,7 +339,7 @@ export class StaticR2Tree {
 
             if (leaf_index_1 < node_count_leaf) {
                 // both children nodes are valid
-                aabb2_array_combine(
+                aabb2_union_array(
                     float32, offset,
                     float32, leaf_offset_0,
                     float32, leaf_offset_1
@@ -372,7 +372,7 @@ export class StaticR2Tree {
                 const address_child_0 = childIndex0 * BINARY_NODE_SIZE;
                 const address_child_1 = address_child_0 + BINARY_NODE_SIZE;
 
-                aabb2_array_combine(
+                aabb2_union_array(
                     float32, address_parent,
                     float32, address_child_0,
                     float32, address_child_1

package/src/core/geom/2d/rectangle_to_aabb.d.ts

@@ -1,8 +1,7 @@
 /**
- *
- * @param {Rectangle} rect
- * @returns {AABB2}
+ * @deprecated Renamed to {@link aabb2_from_rectangle}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
  */
-export function rectangle_to_aabb(rect: Rectangle): AABB2;
-import AABB2 from "./aabb/AABB2.js";
+export const rectangle_to_aabb: typeof aabb2_from_rectangle;
+import { aabb2_from_rectangle } from "./aabb/aabb2_from_rectangle.js";
 //# sourceMappingURL=rectangle_to_aabb.d.ts.map

package/src/core/geom/2d/rectangle_to_aabb.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rectangle_to_aabb.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/2d/rectangle_to_aabb.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,oDAFa,KAAK,CAuBjB;kBA5BiB,iBAAiB"}
+{"version":3,"file":"rectangle_to_aabb.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/2d/rectangle_to_aabb.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,4DAAsD;qCANjB,gCAAgC"}

package/src/core/geom/2d/rectangle_to_aabb.js

@@ -1,29 +1,7 @@
-import AABB2 from "./aabb/AABB2.js";
-
-/**
- *
- * @param {Rectangle} rect
- * @returns {AABB2}
- */
-export function rectangle_to_aabb(rect) {
-    const position = rect.position;
-
-    const x0 = position.x;
-    const y0 = position.y;
-
-    const size = rect.size;
-
-    let x1 = x0;
-    let y1 = y0;
-
-    // sanitize bounds
-    if (size.x > 0) {
-        x1 += size.x;
-    }
-
-    if (size.y > 0) {
-        y1 += size.y;
-    }
-
-    return new AABB2(x0, y0, x1, y1);
-}
+import { aabb2_from_rectangle } from "./aabb/aabb2_from_rectangle.js";
+
+/**
+ * @deprecated Renamed to {@link aabb2_from_rectangle}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
+ */
+export const rectangle_to_aabb = aabb2_from_rectangle;

package/src/core/geom/2d/spline2_quadratic_bezier.d.ts

@@ -0,0 +1,13 @@
+/**
+ *
+ * @param {Vector2} result
+ * @param {number} p0x
+ * @param {number} p0y
+ * @param {number} p1x
+ * @param {number} p1y
+ * @param {number} p2x
+ * @param {number} p2y
+ * @param {number} t
+ */
+export function spline2_quadratic_bezier(result: Vector2, p0x: number, p0y: number, p1x: number, p1y: number, p2x: number, p2y: number, t: number): void;
+//# sourceMappingURL=spline2_quadratic_bezier.d.ts.map

package/src/core/geom/2d/spline2_quadratic_bezier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spline2_quadratic_bezier.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/2d/spline2_quadratic_bezier.js"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AACH,+DARW,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,KACN,MAAM,QAchB"}

package/src/core/geom/2d/spline2_quadratic_bezier.js

@@ -0,0 +1,26 @@
+import { spline2_bezier } from "../../math/spline/spline2_bezier.js";
+
+/**
+ *
+ * @param {Vector2} result
+ * @param {number} p0x
+ * @param {number} p0y
+ * @param {number} p1x
+ * @param {number} p1y
+ * @param {number} p2x
+ * @param {number} p2y
+ * @param {number} t
+ */
+export function spline2_quadratic_bezier(
+    result,
+    p0x, p0y,
+    p1x, p1y,
+    p2x, p2y,
+    t
+) {
+
+    const x0 = spline2_bezier(t, p0x, p1x, p2x);
+    const y0 = spline2_bezier(t, p0y, p1y, p2y);
+
+    result.set(x0, y0);
+}

package/src/core/geom/2d/spline_bezier2_2d.d.ts

@@ -1,13 +1,7 @@
 /**
- *
- * @param {Vector2} result
- * @param {number} p0x
- * @param {number} p0y
- * @param {number} p1x
- * @param {number} p1y
- * @param {number} p2x
- * @param {number} p2y
- * @param {number} t
+ * @deprecated Renamed to {@link spline2_quadratic_bezier}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
  */
-export function spline_bezier2_2d(result: Vector2, p0x: number, p0y: number, p1x: number, p1y: number, p2x: number, p2y: number, t: number): void;
+export const spline_bezier2_2d: typeof spline2_quadratic_bezier;
+import { spline2_quadratic_bezier } from "./spline2_quadratic_bezier.js";
 //# sourceMappingURL=spline_bezier2_2d.d.ts.map

package/src/core/geom/2d/spline_bezier2_2d.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"spline_bezier2_2d.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/2d/spline_bezier2_2d.js"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AACH,wDARW,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,KACN,MAAM,QAchB"}
+{"version":3,"file":"spline_bezier2_2d.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/2d/spline_bezier2_2d.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,gEAA0D;yCANjB,+BAA+B"}

package/src/core/geom/2d/spline_bezier2_2d.js

@@ -1,26 +1,7 @@
-import { spline2_bezier } from "../../math/spline/spline2_bezier.js";
-
-/**
- *
- * @param {Vector2} result
- * @param {number} p0x
- * @param {number} p0y
- * @param {number} p1x
- * @param {number} p1y
- * @param {number} p2x
- * @param {number} p2y
- * @param {number} t
- */
-export function spline_bezier2_2d(
-    result,
-    p0x, p0y,
-    p1x, p1y,
-    p2x, p2y,
-    t
-) {
-
-    const x0 = spline2_bezier(t, p0x, p1x, p2x);
-    const y0 = spline2_bezier(t, p0y, p1y, p2y);
-
-    result.set(x0, y0);
-}
+import { spline2_quadratic_bezier } from "./spline2_quadratic_bezier.js";
+
+/**
+ * @deprecated Renamed to {@link spline2_quadratic_bezier}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
+ */
+export const spline_bezier2_2d = spline2_quadratic_bezier;

package/src/core/geom/2d/triangle/tri2_compute_barycentric.d.ts

@@ -0,0 +1,15 @@
+/**
+ *
+ * @param {number[]|TypedArray|Float32Array} output
+ * @param {number} output_offset
+ * @param {number} ax
+ * @param {number} ay
+ * @param {number} bx
+ * @param {number} by
+ * @param {number} cx
+ * @param {number} cy
+ * @param {number} px reference point X
+ * @param {number} py reference point Y
+ */
+export function tri2_compute_barycentric(output: number[] | TypedArray | Float32Array, output_offset: number, ax: number, ay: number, bx: number, by: number, cx: number, cy: number, px: number, py: number): void;
+//# sourceMappingURL=tri2_compute_barycentric.d.ts.map

package/src/core/geom/2d/triangle/tri2_compute_barycentric.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tri2_compute_barycentric.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/triangle/tri2_compute_barycentric.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AACH,iDAXW,MAAM,EAAE,gBAAY,YAAY,iBAChC,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAkChB"}

package/src/core/geom/2d/triangle/tri2_compute_barycentric.js

@@ -0,0 +1,48 @@
+import { v2_dot } from "../../vec2/v2_dot.js";
+
+/**
+ *
+ * @param {number[]|TypedArray|Float32Array} output
+ * @param {number} output_offset
+ * @param {number} ax
+ * @param {number} ay
+ * @param {number} bx
+ * @param {number} by
+ * @param {number} cx
+ * @param {number} cy
+ * @param {number} px reference point X
+ * @param {number} py reference point Y
+ */
+export function tri2_compute_barycentric(
+    output, output_offset,
+    ax, ay,
+    bx, by,
+    cx, cy,
+    px, py
+) {
+
+    const v0_x = bx - ax;
+    const v0_y = by - ay;
+
+    const v1_x = cx - ax;
+    const v1_y = cy - ay;
+
+    const v2_x = px - ax;
+    const v2_y = py - ay;
+
+    const d00 = v2_dot(v0_x, v0_y, v0_x, v0_y);
+    const d01 = v2_dot(v0_x, v0_y, v1_x, v1_y);
+    const d11 = v2_dot(v1_x, v1_y, v1_x, v1_y);
+    const d20 = v2_dot(v2_x, v2_y, v0_x, v0_y);
+    const d21 = v2_dot(v2_x, v2_y, v1_x, v1_y);
+
+    const denom = d00 * d11 - d01 * d01;
+
+    const v = (d11 * d20 - d01 * d21) / denom;
+    const w = (d00 * d21 - d01 * d20) / denom;
+    const u = 1.0 - v - w;
+
+    output[output_offset] = v;
+    output[output_offset + 1] = w;
+    output[output_offset + 2] = u;
+}

package/src/core/geom/2d/triangle/tri2_contains_point.d.ts

@@ -0,0 +1,14 @@
+/**
+ *
+ * @param {number} ax
+ * @param {number} ay
+ * @param {number} bx
+ * @param {number} by
+ * @param {number} cx
+ * @param {number} cy
+ * @param {number} px reference point X
+ * @param {number} py reference point Y
+ * @returns {boolean}
+ */
+export function tri2_contains_point(ax: number, ay: number, bx: number, by: number, cx: number, cy: number, px: number, py: number): boolean;
+//# sourceMappingURL=tri2_contains_point.d.ts.map

package/src/core/geom/2d/triangle/tri2_contains_point.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tri2_contains_point.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/triangle/tri2_contains_point.js"],"names":[],"mappings":"AAIA;;;;;;;;;;;GAWG;AACH,wCAVW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,OAAO,CAwBnB"}

package/src/core/geom/2d/triangle/tri2_contains_point.js

@@ -0,0 +1,39 @@
+import { tri2_compute_barycentric } from "./tri2_compute_barycentric.js";
+
+const scratch = new Float32Array(3);
+
+/**
+ *
+ * @param {number} ax
+ * @param {number} ay
+ * @param {number} bx
+ * @param {number} by
+ * @param {number} cx
+ * @param {number} cy
+ * @param {number} px reference point X
+ * @param {number} py reference point Y
+ * @returns {boolean}
+ */
+export function tri2_contains_point(
+    ax, ay,
+    bx, by,
+    cx, cy,
+    px, py
+) {
+    tri2_compute_barycentric(
+        scratch, 0,
+        ax, ay,
+        bx, by,
+        cx, cy,
+        px, py
+    );
+
+    const u = scratch[0];
+    const v = scratch[1];
+    const w = scratch[2];
+
+    return u >= 0
+        && v >= 0
+        && w >= 0
+        && Math.abs(1 - u - v - w) < 1e-7;
+}

package/src/core/geom/2d/triangle/tri2_rasterize_conservative.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Conservative rasterization of a 2D triangle into a bit image: every cell
+ * whose unit square overlaps the triangle is set (a superset of exact coverage),
+ * so the resulting mask never under-covers — required for packing gutters.
+ * Overlap is decided by the separating-axis test between the triangle and each
+ * candidate cell square.
+ *
+ * @param {{width:number, height:number, set:(x:number,y:number)=>void}} image
+ * @param {number} x0 @param {number} y0
+ * @param {number} x1 @param {number} y1
+ * @param {number} x2 @param {number} y2
+ */
+export function tri2_rasterize_conservative(image: {
+    width: number;
+    height: number;
+    set: (x: number, y: number) => void;
+}, x0: number, y0: number, x1: number, y1: number, x2: number, y2: number): void;
+//# sourceMappingURL=tri2_rasterize_conservative.d.ts.map

package/src/core/geom/2d/triangle/tri2_rasterize_conservative.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tri2_rasterize_conservative.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/triangle/tri2_rasterize_conservative.js"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH;WALkB,MAAM;YAAS,MAAM;aAAS,MAAM,KAAG,MAAM,KAAG,IAAI;OAC3D,MAAM,MAAa,MAAM,MACzB,MAAM,MAAa,MAAM,MACzB,MAAM,MAAa,MAAM,QAoBnC"}