@woosh/meep-engine 2.163.11 → 2.165.0

package/src/core/geom/3d/aabb/aabb3_detailed_volume_intersection.d.ts

@@ -1,22 +1,7 @@
 /**
- * Figures out intersection volume between an AABB and a frustum for much tighter bounds
- *
- * Especially beneficial when trying to intersect a large AABB against a small frustum,
- * where where traditionally only AABB corners would be considered,
- * we're instead able to compute minimum bounds of the overlap of the two
- *
- * @param {number[]} destination
- * @param {number} destination_offset
- * @param {number} x0
- * @param {number} y0
- * @param {number} z0
- * @param {number} x1
- * @param {number} y1
- * @param {number} z1
- * @param {number[]} planes
- * @param {number} plane_mask
- * @param {number} plane_count
- * @returns {number}
+ * @deprecated Renamed to {@link aabb3_compute_clipping_volume_intersection}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
  */
-export function aabb3_detailed_volume_intersection(destination: number[], destination_offset: number, x0: number, y0: number, z0: number, x1: number, y1: number, z1: number, plane_mask: number, planes: number[], plane_count: number): number;
+export const aabb3_detailed_volume_intersection: typeof aabb3_compute_clipping_volume_intersection;
+import { aabb3_compute_clipping_volume_intersection } from "./aabb3_compute_clipping_volume_intersection.js";
 //# sourceMappingURL=aabb3_detailed_volume_intersection.d.ts.map

package/src/core/geom/3d/aabb/aabb3_detailed_volume_intersection.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"aabb3_detailed_volume_intersection.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/aabb/aabb3_detailed_volume_intersection.js"],"names":[],"mappings":"AA8CA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,gEAbW,MAAM,EAAE,sBACR,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,cAEN,MAAM,UADN,MAAM,EAAE,eAER,MAAM,GACJ,MAAM,CAyOlB"}
+{"version":3,"file":"aabb3_detailed_volume_intersection.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/aabb/aabb3_detailed_volume_intersection.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,mGAA6F;2DANlC,iDAAiD"}

package/src/core/geom/3d/aabb/aabb3_detailed_volume_intersection.js

@@ -1,298 +1,7 @@
-import { aabb3_build_corners } from "./aabb3_build_corners.js";
-import { aabb_build_frustum } from "./aabb3_build_frustum.js";
-import { aabb3_corner_edge_mapping } from "./aabb3_corner_edge_mapping.js";
-import { aabb3_edge_corner_mapping } from "./aabb3_edge_corner_mapping.js";
-import { plane3_compute_convex_3_plane_intersection } from "../plane/plane3_compute_convex_3_plane_intersection.js";
-import { is_point_within_planes } from "../plane/is_point_within_planes.js";
-import { v3_distance_above_plane } from "../../vec3/v3_distance_above_plane.js";
-import { EPSILON } from "../../../math/EPSILON.js";
-import { plane3_compute_line_segment_intersection } from "../plane/plane3_compute_line_segment_intersection.js";
-
-/**
- * Common piece of continuous memory for better cache coherence
- * @type {ArrayBuffer}
- * @private
- */
-const __scratch_buffer = new ArrayBuffer(
-    24 * 4
-    + 24 * 4
-    + 8 * 4
-    + 3 * 4
-);
-
-/**
- *
- * @type {number[]}
- */
-const scratch_aabb_corners = new Float32Array(__scratch_buffer, 0, 24);
-
-/**
- *
- * @type {number[]}
- */
-const scratch_aabb_planes = new Float32Array(__scratch_buffer, 96, 24);
-
-/**
- *
- * @type {number[]}
- */
-const scratch_corner_out_bitfields = new Uint32Array(__scratch_buffer, 192, 8);
-
-/**
- *
- * @type {number[]}
- */
-const scratch_v3_array = new Float32Array(__scratch_buffer, 224, 3);
-
-/**
- * Figures out intersection volume between an AABB and a frustum for much tighter bounds
- *
- * Especially beneficial when trying to intersect a large AABB against a small frustum,
- * where where traditionally only AABB corners would be considered,
- * we're instead able to compute minimum bounds of the overlap of the two
- *
- * @param {number[]} destination
- * @param {number} destination_offset
- * @param {number} x0
- * @param {number} y0
- * @param {number} z0
- * @param {number} x1
- * @param {number} y1
- * @param {number} z1
- * @param {number[]} planes
- * @param {number} plane_mask
- * @param {number} plane_count
- * @returns {number}
- */
-export function aabb3_detailed_volume_intersection(
-    destination, destination_offset,
-    x0, y0, z0, x1, y1, z1,
-    plane_mask,
-    planes,
-    plane_count
-) {
-
-    aabb3_build_corners(scratch_aabb_corners, 0, x0, y0, z0, x1, y1, z1);
-    aabb_build_frustum(scratch_aabb_planes, x0, y0, z0, x1, y1, z1);
-
-    /**
-     * Bitfield marking which corners are outside of the frustum
-     * @type {number}
-     */
-    let outside_corner_mask = 0;
-
-    /**
-     * Bitfield marking edges that are attached to outside corners
-     * @type {number}
-     */
-    let intersecting_edge_mask = 0;
-
-    /**
-     * Bitfield to outside of which planes a particular corner lies
-     * @type {number}
-     */
-    let corner_plane_out_bitfield = 0;
-
-    let destination_cursor = destination_offset;
-
-    // find out which corners are outside the frustum
-    for (let corner_index = 0; corner_index < 8; corner_index++) {
-        const corner_offset = corner_index * 3;
-
-        const x = scratch_aabb_corners[corner_offset];
-        const y = scratch_aabb_corners[corner_offset + 1];
-        const z = scratch_aabb_corners[corner_offset + 2];
-
-        corner_plane_out_bitfield = 0;
-
-        // check which points are outside of the frustum sides. Disregard near and far planes at this stage
-        for (let plane_index = 0; plane_index < 4; plane_index++) {
-            const plane_bit_mask = 1 << plane_index;
-
-            if ((plane_mask & plane_bit_mask) === 0) {
-                // non-intersecting plane, ignore
-                continue;
-            }
-
-            const plane_address = plane_index * 4;
-
-            const nx = planes[plane_address];
-            const ny = planes[plane_address + 1];
-            const nz = planes[plane_address + 2];
-            const c = planes[plane_address + 3];
-
-            const distance_to_plane = v3_distance_above_plane(
-                x, y, z,
-                nx, ny, nz, c
-            );
-
-            if (distance_to_plane < 0) {
-                // corner is below the plane
-
-                if (corner_plane_out_bitfield === 0) {
-                    // first plane found
-                    const corner_edge_bitmask = aabb3_corner_edge_mapping[corner_index];
-
-                    intersecting_edge_mask |= corner_edge_bitmask;
-
-                    outside_corner_mask |= 1 << corner_index;
-                }
-
-                corner_plane_out_bitfield |= plane_bit_mask;
-
-            }
-
-        }
-
-        // set bitfield
-        scratch_corner_out_bitfields[corner_index] = corner_plane_out_bitfield;
-
-        if (corner_plane_out_bitfield === 0) {
-            // corner is fully inside the frustum
-            destination[destination_cursor++] = x;
-            destination[destination_cursor++] = y;
-            destination[destination_cursor++] = z;
-        }
-    }
-
-    // traverse AABB edges
-    for (let edge_index = 0; edge_index < 12; edge_index++) {
-        const edge_bit_index = 1 << edge_index;
-
-        if ((intersecting_edge_mask & edge_bit_index) === 0) {
-            // non-intersecting edge
-            continue;
-        }
-
-        const edge_corners_encoded = aabb3_edge_corner_mapping[edge_index];
-
-        const corner_index_0 = edge_corners_encoded & 0b111;
-        const corner_index_1 = (edge_corners_encoded >> 3) & 0b111;
-
-        // check to see if both corners are outside
-        const corner_0_out_planes_bitfield = scratch_corner_out_bitfields[corner_index_0];
-        const corner_1_out_planes_bitfield = scratch_corner_out_bitfields[corner_index_1];
-
-        if ((corner_0_out_planes_bitfield & corner_1_out_planes_bitfield) !== 0) {
-            // edge is fully outside one or more of the clipping planes, the edge is definitely outside of the frustum
-            continue;
-        }
-
-        const corner_0_address = corner_index_0 * 3;
-        const corner_1_address = corner_index_1 * 3;
-
-        const corner_0_x = scratch_aabb_corners[corner_0_address];
-        const corner_0_y = scratch_aabb_corners[corner_0_address + 1];
-        const corner_0_z = scratch_aabb_corners[corner_0_address + 2];
-
-        const corner_1_x = scratch_aabb_corners[corner_1_address];
-        const corner_1_y = scratch_aabb_corners[corner_1_address + 1];
-        const corner_1_z = scratch_aabb_corners[corner_1_address + 2];
-
-        // check which points are outside of the frustum
-        for (let j = 0; j < plane_count; j++) {
-            const plane_bit_mask = 1 << j;
-
-            if ((plane_mask & plane_bit_mask) === 0) {
-                // non-intersecting plane, ignore
-                continue;
-            }
-
-            const plane_address = j * 4;
-
-            const nx = planes[plane_address];
-            const ny = planes[plane_address + 1];
-            const nz = planes[plane_address + 2];
-            const c = planes[plane_address + 3];
-
-            const edge_intersects = plane3_compute_line_segment_intersection(
-                scratch_v3_array, 0,
-                corner_0_x, corner_0_y, corner_0_z,
-                corner_1_x, corner_1_y, corner_1_z,
-                nx, ny, nz, c
-            );
-
-            if (edge_intersects) {
-                // a possible candidate, let's see if this point is within rest of the planes
-                const inside_planes = is_point_within_planes(
-                    scratch_v3_array[0], scratch_v3_array[1], scratch_v3_array[2],
-                    (plane_mask ^ plane_bit_mask),
-                    planes,
-                    plane_count
-                );
-
-                if (inside_planes) {
-                    destination[destination_cursor++] = scratch_v3_array[0];
-                    destination[destination_cursor++] = scratch_v3_array[1];
-                    destination[destination_cursor++] = scratch_v3_array[2];
-                }
-            }
-
-
-        }
-    }
-
-
-    // traverse AABB planes
-    for (let aabb_plane_index = 0; aabb_plane_index < 6; aabb_plane_index++) {
-        const aabb_plane_address = aabb_plane_index * 4;
-
-        const aabb_plane_nx = scratch_aabb_planes[aabb_plane_address];
-        const aabb_plane_ny = scratch_aabb_planes[aabb_plane_address + 1];
-        const aabb_plane_nz = scratch_aabb_planes[aabb_plane_address + 2];
-        const aabb_plane_constant = scratch_aabb_planes[aabb_plane_address + 3];
-
-        // The 4 frustum side-edges are each the intersection of one +/-x plane (index 0 or 1) with one +/-y
-        // plane (index 2 or 3). The previous (i, (i+2)%4) pairing produced only 2 of those 4 edges, each twice
-        // (missing the +x/-y and -x/+y edges), so AABB-vs-edge contact points on those edges were never found.
-        // Enumerate all four non-parallel pairs explicitly.
-        for (let pa = 0; pa < 2; pa++) {
-
-            if ((plane_mask & (1 << pa)) === 0) {
-                continue;
-            }
-
-            const cp_0 = pa * 4;
-
-            for (let pb = 2; pb < 4; pb++) {
-
-                if ((plane_mask & (1 << pb)) === 0) {
-                    continue;
-                }
-
-                const cp_1 = pb * 4;
-
-                const intersection_exists = plane3_compute_convex_3_plane_intersection(
-                    scratch_v3_array, 0,
-                    aabb_plane_nx, aabb_plane_ny, aabb_plane_nz, aabb_plane_constant,
-                    planes[cp_0], planes[cp_0 + 1], planes[cp_0 + 2], planes[cp_0 + 3],
-                    planes[cp_1], planes[cp_1 + 1], planes[cp_1 + 2], planes[cp_1 + 3]
-                );
-
-                if (intersection_exists) {
-
-                    const intersection_point_x = scratch_v3_array[0];
-                    const intersection_point_y = scratch_v3_array[1];
-                    const intersection_point_z = scratch_v3_array[2];
-
-                    const point_within_box = !(
-                        (intersection_point_x + EPSILON) < x0 || (intersection_point_x - EPSILON) > x1
-                        || (intersection_point_y + EPSILON) < y0 || (intersection_point_y - EPSILON) > y1
-                        || (intersection_point_z + EPSILON) < z0 || (intersection_point_z - EPSILON) > z1
-                    );
-
-                    if (point_within_box) {
-                        // point is within the AABB bounds
-                        destination[destination_cursor++] = intersection_point_x;
-                        destination[destination_cursor++] = intersection_point_y;
-                        destination[destination_cursor++] = intersection_point_z;
-                    }
-                }
-            }
-        }
-    }
-
-    const address_change = destination_cursor - destination_offset;
-
-    return address_change / 3;
-}
+import { aabb3_compute_clipping_volume_intersection } from "./aabb3_compute_clipping_volume_intersection.js";
+
+/**
+ * @deprecated Renamed to {@link aabb3_compute_clipping_volume_intersection}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
+ */
+export const aabb3_detailed_volume_intersection = aabb3_compute_clipping_volume_intersection;

package/src/core/geom/3d/aabb/aabb3_estimate_projected_area.d.ts

@@ -0,0 +1,8 @@
+/**
+ * NOTE: tends to overestimate the area
+ * @param {number[]} aabb
+ * @param {number[]} matrix
+ * @return {number}
+ */
+export function aabb3_estimate_projected_area(aabb: number[], matrix: number[]): number;
+//# sourceMappingURL=aabb3_estimate_projected_area.d.ts.map

package/src/core/geom/3d/aabb/aabb3_estimate_projected_area.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb3_estimate_projected_area.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/aabb/aabb3_estimate_projected_area.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,oDAJW,MAAM,EAAE,UACR,MAAM,EAAE,GACP,MAAM,CAmDjB"}

package/src/core/geom/3d/aabb/aabb3_estimate_projected_area.js

@@ -0,0 +1,59 @@
+const scratch_aabb = new Float32Array(4);
+
+
+/**
+ * NOTE: tends to overestimate the area
+ * @param {number[]} aabb
+ * @param {number[]} matrix
+ * @return {number}
+ */
+export function aabb3_estimate_projected_area(aabb, matrix) {
+    // extract translation from matrix
+    scratch_aabb[0] = scratch_aabb[2] = matrix[12];
+    scratch_aabb[1] = scratch_aabb[3] = matrix[13];
+
+    // apply 3x3 matrix transform
+    for (let i = 0; i < 2; i++) {
+        for (let j = 0; j < 3; j++) {
+
+            const m_a = i  + j* 4;
+            const m_v = matrix[m_a];
+
+            const a = m_v * aabb[j];
+            const b = m_v * aabb[j + 3];
+
+            if (a < b) {
+                scratch_aabb[i] += a;
+                scratch_aabb[i + 2] += b;
+            } else {
+                scratch_aabb[i] += b;
+                scratch_aabb[i + 2] += a;
+            }
+        }
+    }
+
+
+    const x1 = scratch_aabb[2];
+    const x0 = scratch_aabb[0];
+
+    const dx = x1 - x0;
+
+    const y1 = scratch_aabb[3];
+    const y0 = scratch_aabb[1];
+
+    const dy = y1 - y0;
+    const a = dx * dy;
+
+    const cx = (aabb[0] + aabb[3]) * 0.5;
+    const cy = (aabb[1] + aabb[4]) * 0.5;
+    const cz = (aabb[2] + aabb[5]) * 0.5;
+
+    /* compute W projection value, using conservative estimate
+       @see https://twitter.com/SebAaltonen/status/1332332808979832832
+       @see https://gist.github.com/slembcke/b2b2af4dede1d5702a635dc2d0e45d54
+    */
+    const w = matrix[3] * cx + matrix[7] * cy + matrix[11] * cz + matrix[15];
+    const d = 0.5 / Math.abs(w);
+
+    return a * d * d;
+}

package/src/core/geom/3d/aabb/aabb3_estimate_projected_area2.d.ts

@@ -1,8 +1,7 @@
 /**
- * NOTE: tends to overestimate the area
- * @param {number[]} aabb
- * @param {number[]} matrix
- * @return {number}
+ * @deprecated Renamed to {@link aabb3_estimate_projected_area}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
  */
-export function aabb3_estimate_projected_area2(aabb: number[], matrix: number[]): number;
+export const aabb3_estimate_projected_area2: typeof aabb3_estimate_projected_area;
+import { aabb3_estimate_projected_area } from "./aabb3_estimate_projected_area.js";
 //# sourceMappingURL=aabb3_estimate_projected_area2.d.ts.map

package/src/core/geom/3d/aabb/aabb3_estimate_projected_area2.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"aabb3_estimate_projected_area2.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/aabb/aabb3_estimate_projected_area2.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,qDAJW,MAAM,EAAE,UACR,MAAM,EAAE,GACP,MAAM,CAmDjB"}
+{"version":3,"file":"aabb3_estimate_projected_area2.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/aabb/aabb3_estimate_projected_area2.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,kFAA4E;8CAN9B,oCAAoC"}

package/src/core/geom/3d/aabb/aabb3_estimate_projected_area2.js

@@ -1,59 +1,7 @@
-const scratch_aabb = new Float32Array(4);
-
-
-/**
- * NOTE: tends to overestimate the area
- * @param {number[]} aabb
- * @param {number[]} matrix
- * @return {number}
- */
-export function aabb3_estimate_projected_area2(aabb, matrix) {
-    // extract translation from matrix
-    scratch_aabb[0] = scratch_aabb[2] = matrix[12];
-    scratch_aabb[1] = scratch_aabb[3] = matrix[13];
-
-    // apply 3x3 matrix transform
-    for (let i = 0; i < 2; i++) {
-        for (let j = 0; j < 3; j++) {
-
-            const m_a = i  + j* 4;
-            const m_v = matrix[m_a];
-
-            const a = m_v * aabb[j];
-            const b = m_v * aabb[j + 3];
-
-            if (a < b) {
-                scratch_aabb[i] += a;
-                scratch_aabb[i + 2] += b;
-            } else {
-                scratch_aabb[i] += b;
-                scratch_aabb[i + 2] += a;
-            }
-        }
-    }
-
-
-    const x1 = scratch_aabb[2];
-    const x0 = scratch_aabb[0];
-
-    const dx = x1 - x0;
-
-    const y1 = scratch_aabb[3];
-    const y0 = scratch_aabb[1];
-
-    const dy = y1 - y0;
-    const a = dx * dy;
-
-    const cx = (aabb[0] + aabb[3]) * 0.5;
-    const cy = (aabb[1] + aabb[4]) * 0.5;
-    const cz = (aabb[2] + aabb[5]) * 0.5;
-
-    /* compute W projection value, using conservative estimate
-       @see https://twitter.com/SebAaltonen/status/1332332808979832832
-       @see https://gist.github.com/slembcke/b2b2af4dede1d5702a635dc2d0e45d54
-    */
-    const w = matrix[3] * cx + matrix[7] * cy + matrix[11] * cz + matrix[15];
-    const d = 0.5 / Math.abs(w);
-
-    return a * d * d;
-}
+import { aabb3_estimate_projected_area } from "./aabb3_estimate_projected_area.js";
+
+/**
+ * @deprecated Renamed to {@link aabb3_estimate_projected_area}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
+ */
+export const aabb3_estimate_projected_area2 = aabb3_estimate_projected_area;

package/src/core/geom/3d/aabb/aabb3_from_three_geometry.d.ts

@@ -0,0 +1,7 @@
+/**
+ *
+ * @param {number[]|ArrayLike<number>|Float32Array} result
+ * @param {BufferGeometry} geometry
+ */
+export function aabb3_from_three_geometry(result: number[] | ArrayLike<number> | Float32Array, geometry: BufferGeometry): void;
+//# sourceMappingURL=aabb3_from_three_geometry.d.ts.map

package/src/core/geom/3d/aabb/aabb3_from_three_geometry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb3_from_three_geometry.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/aabb/aabb3_from_three_geometry.js"],"names":[],"mappings":"AAGA;;;;GAIG;AACH,kDAHW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,kCAYjD"}

package/src/core/geom/3d/aabb/aabb3_from_three_geometry.js

@@ -0,0 +1,18 @@
+import { assert } from "../../../assert.js";
+import { aabb3_from_min_max } from "./aabb3_from_min_max.js";
+
+/**
+ *
+ * @param {number[]|ArrayLike<number>|Float32Array} result
+ * @param {BufferGeometry} geometry
+ */
+export function aabb3_from_three_geometry(result, geometry) {
+    const gbb = geometry.boundingBox;
+
+    assert.notNull(gbb, 'boundingBox');
+
+    const min = gbb.min;
+    const max = gbb.max;
+
+    aabb3_from_min_max(result, min, max);
+}

package/src/core/geom/3d/aabb/aabb3_from_threejs_geometry.d.ts

@@ -1,7 +1,7 @@
 /**
- *
- * @param {number[]|ArrayLike<number>|Float32Array} result
- * @param {BufferGeometry} geometry
+ * @deprecated Renamed to {@link aabb3_from_three_geometry}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
  */
-export function aabb3_from_threejs_geometry(result: number[] | ArrayLike<number> | Float32Array, geometry: BufferGeometry): void;
+export const aabb3_from_threejs_geometry: typeof aabb3_from_three_geometry;
+import { aabb3_from_three_geometry } from "./aabb3_from_three_geometry.js";
 //# sourceMappingURL=aabb3_from_threejs_geometry.d.ts.map

package/src/core/geom/3d/aabb/aabb3_from_threejs_geometry.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"aabb3_from_threejs_geometry.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/aabb/aabb3_from_threejs_geometry.js"],"names":[],"mappings":"AAGA;;;;GAIG;AACH,oDAHW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,kCAYjD"}
+{"version":3,"file":"aabb3_from_threejs_geometry.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/aabb/aabb3_from_threejs_geometry.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,2EAAqE;0CAN3B,gCAAgC"}

package/src/core/geom/3d/aabb/aabb3_from_threejs_geometry.js

@@ -1,18 +1,7 @@
-import { assert } from "../../../assert.js";
-import { aabb3_from_min_max } from "./aabb3_from_min_max.js";
-
-/**
- *
- * @param {number[]|ArrayLike<number>|Float32Array} result
- * @param {BufferGeometry} geometry
- */
-export function aabb3_from_threejs_geometry(result, geometry) {
-    const gbb = geometry.boundingBox;
-
-    assert.notNull(gbb, 'boundingBox');
-
-    const min = gbb.min;
-    const max = gbb.max;
-
-    aabb3_from_min_max(result, min, max);
-}
+import { aabb3_from_three_geometry } from "./aabb3_from_three_geometry.js";
+
+/**
+ * @deprecated Renamed to {@link aabb3_from_three_geometry}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
+ */
+export const aabb3_from_threejs_geometry = aabb3_from_three_geometry;

package/src/core/geom/3d/aabb/aabb3_from_triangle_group.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Compute AABB for a group of triangles based on index-buffer
+ * @param {number[]|Float32Array} output
+ * @param {number} output_offset
+ * @param {number[]|ArrayLike<number>} indices
+ * @param {number[]|ArrayLike<number>} positions
+ * @param {number} index_offset
+ * @param {number} index_count
+ * @param {number} dimension_count
+ */
+export function aabb3_from_triangle_group(output: number[] | Float32Array, output_offset: number, indices: number[] | ArrayLike<number>, positions: number[] | ArrayLike<number>, index_offset: number, index_count: number, dimension_count: number): void;
+//# sourceMappingURL=aabb3_from_triangle_group.d.ts.map

package/src/core/geom/3d/aabb/aabb3_from_triangle_group.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb3_from_triangle_group.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/aabb/aabb3_from_triangle_group.js"],"names":[],"mappings":"AAGA;;;;;;;;;GASG;AACH,kDARW,MAAM,EAAE,GAAC,YAAY,iBACrB,MAAM,WACN,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,aAC1B,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,gBAC1B,MAAM,eACN,MAAM,mBACN,MAAM,QAkChB"}

package/src/core/geom/3d/aabb/aabb3_from_triangle_group.js

@@ -0,0 +1,46 @@
+import { max2 } from "../../../math/max2.js";
+import { min2 } from "../../../math/min2.js";
+
+/**
+ * Compute AABB for a group of triangles based on index-buffer
+ * @param {number[]|Float32Array} output
+ * @param {number} output_offset
+ * @param {number[]|ArrayLike<number>} indices
+ * @param {number[]|ArrayLike<number>} positions
+ * @param {number} index_offset
+ * @param {number} index_count
+ * @param {number} dimension_count
+ */
+export function aabb3_from_triangle_group(
+    output,
+    output_offset,
+    indices,
+    positions,
+    index_offset,
+    index_count,
+    dimension_count
+) {
+
+    let i = 0;
+    for (; i < dimension_count; i++) {
+        // min bound
+        output[output_offset + i] = Infinity;
+        // max bound
+        output[output_offset + i + dimension_count] = -Infinity;
+    }
+
+    for (i = 0; i < index_count; i++) {
+        for (let j = 0; j < 3; j++) {
+            const index = indices[index_offset + i * 3 + j];
+
+            const i3 = index * dimension_count;
+
+            for (let k = 0; k < dimension_count; k++) {
+                const v = positions[i3 + k];
+
+                output[output_offset + k] = min2(output[output_offset + k], v);
+                output[output_offset + k + dimension_count] = max2(output[output_offset + k + dimension_count], v);
+            }
+        }
+    }
+}

package/src/core/geom/3d/aabb/aabb3_half_surface_area.d.ts

@@ -0,0 +1,7 @@
+/**
+ *
+ * @param {AABB3} node
+ * @returns {number}
+ */
+export function aabb3_half_surface_area(node: AABB3): number;
+//# sourceMappingURL=aabb3_half_surface_area.d.ts.map

package/src/core/geom/3d/aabb/aabb3_half_surface_area.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb3_half_surface_area.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/aabb/aabb3_half_surface_area.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,sDAFa,MAAM,CAIlB"}

package/src/core/geom/3d/aabb/aabb3_half_surface_area.js

@@ -0,0 +1,10 @@
+import { aabb3_half_surface_area_extents } from "./aabb3_half_surface_area_extents.js";
+
+/**
+ *
+ * @param {AABB3} node
+ * @returns {number}
+ */
+export function aabb3_half_surface_area(node) {
+    return aabb3_half_surface_area_extents(node.x0, node.y0, node.z0, node.x1, node.y1, node.z1);
+}