@woosh/meep-engine 2.169.1 → 2.169.2

package/src/core/geom/3d/topology/struct/binary/io/bt_boundary_loop.js

@@ -0,0 +1,73 @@
+/**
+ * Walk an unordered set of boundary edges forming a single closed cycle into traversal order, starting at
+ * `start_vertex`.
+ *
+ * Writes the cycle's vertices into `out_vertices[0..n-1]` and, at each index, the edge LEAVING that vertex
+ * into `out_edges[0..n-1]` — so `out_edges[i]` joins `out_vertices[i]` to `out_vertices[(i + 1) % n]`.
+ *
+ * PRECONDITION: `cycle` is a single closed loop in which every vertex has exactly two incident edges. That
+ * is what the boundary-extraction pass produces; a figure-of-eight or an open chain would walk off.
+ *
+ * Shared by {@link bt_mesh_close_boundary_holes} and {@link bt_mesh_fill_small_holes}, which each carried
+ * a byte-identical copy.
+ *
+ * @param {BinaryTopology} mesh
+ * @param {number[]|Uint32Array} cycle unordered boundary edge ids
+ * @param {number} start_vertex vertex to begin the walk at; must be an endpoint of some edge in `cycle`
+ * @param {number[]|Uint32Array} out_vertices destination, at least `cycle.length` long
+ * @param {number[]|Uint32Array} out_edges destination, at least `cycle.length` long
+ *
+ * @author Alex Goldring
+ * @copyright Company Named Limited (c) 2026
+ */
+export function bt_boundary_loop_order_from(mesh, cycle, start_vertex, out_vertices, out_edges) {
+    const n = cycle.length;
+
+    // vertex -> the (exactly two) cycle edges incident to it
+    const v_to_edges = new Map();
+
+    for (let i = 0; i < n; i++) {
+        const e = cycle[i];
+
+        const v1 = mesh.edge_read_vertex1(e);
+        const v2 = mesh.edge_read_vertex2(e);
+
+        let bucket = v_to_edges.get(v1);
+
+        if (bucket === undefined) {
+            bucket = [];
+            v_to_edges.set(v1, bucket);
+        }
+
+        bucket.push(e);
+
+        bucket = v_to_edges.get(v2);
+
+        if (bucket === undefined) {
+            bucket = [];
+            v_to_edges.set(v2, bucket);
+        }
+
+        bucket.push(e);
+    }
+
+    let v_curr = start_vertex;
+    let e_prev = -1;
+
+    for (let i = 0; i < n; i++) {
+        out_vertices[i] = v_curr;
+
+        const edges_at_v = v_to_edges.get(v_curr);
+
+        // of the two edges at this vertex, take the one we did not arrive on
+        const e_next = (edges_at_v[0] === e_prev) ? edges_at_v[1] : edges_at_v[0];
+
+        out_edges[i] = e_next;
+
+        const e_v1 = mesh.edge_read_vertex1(e_next);
+        const e_v2 = mesh.edge_read_vertex2(e_next);
+
+        v_curr = (e_v1 === v_curr) ? e_v2 : e_v1;
+        e_prev = e_next;
+    }
+}

package/src/core/geom/3d/topology/struct/binary/io/bt_mesh_close_boundary_holes.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_close_boundary_holes.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_close_boundary_holes.js"],"names":[],"mappings":"AA2DA;;;;;;;;;;;;;;GAcG;AACH,oEAFa,MAAM,CA8DlB"}
+{"version":3,"file":"bt_mesh_close_boundary_holes.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_close_boundary_holes.js"],"names":[],"mappings":"AAQA;;;;;;;;;;;;;;GAcG;AACH,oEAFa,MAAM,CA8DlB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_mesh_close_boundary_holes.js

@@ -1,61 +1,10 @@
+import { bt_boundary_loop_order_from } from "./bt_boundary_loop.js";
 import { bt_mesh_walk_boundary_loops } from "../query/bt_mesh_walk_boundary_loops.js";
 import { bt_face_poke } from "./face/bt_face_poke.js";
 import { bt_radial_loop_add } from "./bt_radial_loop_add.js";
 
 const scratch_coord = [0, 0, 0];
 
-/**
- * Walk a boundary cycle (returned by {@link bt_mesh_walk_boundary_loops}) and
- * produce a vertex/edge sequence starting at `start_vertex` and going around
- * the cycle in the direction `start_vertex` dictates.
- *
- * Output arrays are filled in place; both have length equal to `cycle.length`.
- *
- * @param {BinaryTopology} mesh
- * @param {number[]} cycle
- * @param {number} start_vertex must be an endpoint of one of the cycle's edges
- * @param {number[]} out_vertices
- * @param {number[]} out_edges
- */
-function order_cycle_from(mesh, cycle, start_vertex, out_vertices, out_edges) {
-    const n = cycle.length;
-
-    const v_to_edges = new Map();
-    for (let i = 0; i < n; i++) {
-        const e = cycle[i];
-        const v1 = mesh.edge_read_vertex1(e);
-        const v2 = mesh.edge_read_vertex2(e);
-        let bucket = v_to_edges.get(v1);
-        if (bucket === undefined) {
-            bucket = [];
-            v_to_edges.set(v1, bucket);
-        }
-        bucket.push(e);
-        bucket = v_to_edges.get(v2);
-        if (bucket === undefined) {
-            bucket = [];
-            v_to_edges.set(v2, bucket);
-        }
-        bucket.push(e);
-    }
-
-    let v_curr = start_vertex;
-    let e_prev = -1;
-
-    for (let i = 0; i < n; i++) {
-        out_vertices[i] = v_curr;
-
-        const edges_at_v = v_to_edges.get(v_curr);
-        const e_next = (edges_at_v[0] === e_prev) ? edges_at_v[1] : edges_at_v[0];
-
-        out_edges[i] = e_next;
-
-        const e_v1 = mesh.edge_read_vertex1(e_next);
-        const e_v2 = mesh.edge_read_vertex2(e_next);
-        v_curr = (e_v1 === v_curr) ? e_v2 : e_v1;
-        e_prev = e_next;
-    }
-}
 
 /**
  * Close every boundary hole in `mesh` by fan-tessellating each boundary loop
@@ -92,7 +41,7 @@ export function bt_mesh_close_boundary_holes(mesh) {
 
         ordered_vertices.length = n;
         ordered_edges.length = n;
-        order_cycle_from(mesh, cycle, start_vertex, ordered_vertices, ordered_edges);
+        bt_boundary_loop_order_from(mesh, cycle, start_vertex, ordered_vertices, ordered_edges);
 
         // Compute centroid of the hole's vertices.
         let cx = 0, cy = 0, cz = 0;

package/src/core/geom/3d/topology/struct/binary/io/bt_mesh_compute_vertex_quadrics.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_compute_vertex_quadrics.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_compute_vertex_quadrics.js"],"names":[],"mappings":"AAWA;;;;;;;;;;GAUG;AACH,uEAHa,QAAQ,EAAE,CA2EtB;yBA3FwB,yCAAyC"}
+{"version":3,"file":"bt_mesh_compute_vertex_quadrics.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_compute_vertex_quadrics.js"],"names":[],"mappings":"AAYA;;;;;;;;;;GAUG;AACH,uEAHa,QAAQ,EAAE,CAyEtB;yBAzFwB,yCAAyC"}

package/src/core/geom/3d/topology/struct/binary/io/bt_mesh_compute_vertex_quadrics.js

@@ -1,3 +1,4 @@
+import { quadric3_set_from_plane_through_point } from "../../../simplify/quadratic/quadric3_set_from_plane_through_point.js";
 import { assert } from "../../../../../../assert.js";
 import { v3_dot } from "../../../../../vec3/v3_dot.js";
 import { tri3_compute_normal } from "../../../../triangle/tri3_compute_normal.js";
@@ -78,14 +79,12 @@ export function bt_mesh_compute_vertex_quadrics(mesh) {
         const ny = scratch_normal[1];
         const nz = scratch_normal[2];
 
-        // Plane offset: d = -(n . v_a)
-        const d = -v3_dot(
+        quadric3_set_from_plane_through_point(
+            q,
             nx, ny, nz,
             scratch_coord_a[0], scratch_coord_a[1], scratch_coord_a[2]
         );
 
-        q.setFromVector4(nx, ny, nz, d);
-
         quadratics[va].add(q);
         quadratics[vb].add(q);
         quadratics[vc].add(q);

package/src/core/geom/3d/topology/struct/binary/io/bt_mesh_fill_small_holes.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_fill_small_holes.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_fill_small_holes.js"],"names":[],"mappings":"AA+FA;;;;;;;;;;;;GAYG;AACH,0EAHW,MAAM,GACJ,MAAM,CA2ClB"}
+{"version":3,"file":"bt_mesh_fill_small_holes.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_fill_small_holes.js"],"names":[],"mappings":"AAiEA;;;;;;;;;;;;GAYG;AACH,0EAHW,MAAM,GACJ,MAAM,CA2ClB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_mesh_fill_small_holes.js

@@ -1,3 +1,4 @@
+import { bt_boundary_loop_order_from } from "./bt_boundary_loop.js";
 import { bt_mesh_walk_boundary_loops } from "../query/bt_mesh_walk_boundary_loops.js";
 import { bt_face_poke } from "./face/bt_face_poke.js";
 import { bt_radial_loop_add } from "./bt_radial_loop_add.js";
@@ -6,37 +7,6 @@ const _c = [0, 0, 0];
 const _p = [0, 0, 0];
 const _q = [0, 0, 0];
 
-/**
- * Order a boundary cycle's edges into a vertex/edge walk starting at `start_vertex`.
- * (Same traversal as bt_mesh_close_boundary_holes.)
- */
-function order_cycle_from(mesh, cycle, start_vertex, out_vertices, out_edges) {
-    const n = cycle.length;
-    const v_to_edges = new Map();
-    for (let i = 0; i < n; i++) {
-        const e = cycle[i];
-        const v1 = mesh.edge_read_vertex1(e);
-        const v2 = mesh.edge_read_vertex2(e);
-        let bucket = v_to_edges.get(v1);
-        if (bucket === undefined) { bucket = []; v_to_edges.set(v1, bucket); }
-        bucket.push(e);
-        bucket = v_to_edges.get(v2);
-        if (bucket === undefined) { bucket = []; v_to_edges.set(v2, bucket); }
-        bucket.push(e);
-    }
-    let v_curr = start_vertex;
-    let e_prev = -1;
-    for (let i = 0; i < n; i++) {
-        out_vertices[i] = v_curr;
-        const edges_at_v = v_to_edges.get(v_curr);
-        const e_next = (edges_at_v[0] === e_prev) ? edges_at_v[1] : edges_at_v[0];
-        out_edges[i] = e_next;
-        const e_v1 = mesh.edge_read_vertex1(e_next);
-        const e_v2 = mesh.edge_read_vertex2(e_next);
-        v_curr = (e_v1 === v_curr) ? e_v2 : e_v1;
-        e_prev = e_next;
-    }
-}
 
 /** Perimeter and (Newell) 3D area of an ordered loop of vertices. */
 function loop_perimeter_and_area(mesh, verts) {
@@ -68,7 +38,7 @@ function fill_loop(mesh, cycle) {
 
     const ordered_vertices = new Array(n);
     const ordered_edges = new Array(n);
-    order_cycle_from(mesh, cycle, start_vertex, ordered_vertices, ordered_edges);
+    bt_boundary_loop_order_from(mesh, cycle, start_vertex, ordered_vertices, ordered_edges);
 
     let cx = 0, cy = 0, cz = 0;
     for (let i = 0; i < n; i++) {
@@ -125,7 +95,7 @@ export function bt_mesh_fill_small_holes(mesh, min_width) {
         const verts = new Array(n);
         const edges = new Array(n);
         const v1 = mesh.edge_read_vertex1(c[0]);
-        order_cycle_from(mesh, c, v1, verts, edges);
+        bt_boundary_loop_order_from(mesh, c, v1, verts, edges);
         return loop_perimeter_and_area(mesh, verts);
     });
 

package/src/core/geom/3d/topology/struct/binary/io/bt_mesh_from_indexed_geometry.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_from_indexed_geometry.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_from_indexed_geometry.js"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,4EAJW,MAAM,EAAE,GAAC,WAAW,GAAC,WAAW,GAAC,UAAU,oBAC3C,MAAM,EAAE,GAAC,YAAY,mBACrB,MAAM,EAAE,GAAC,YAAY,QAwG/B"}
+{"version":3,"file":"bt_mesh_from_indexed_geometry.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_from_indexed_geometry.js"],"names":[],"mappings":"AAIA;;;;;;;;GAQG;AACH,4EAJW,MAAM,EAAE,GAAC,WAAW,GAAC,WAAW,GAAC,UAAU,oBAC3C,MAAM,EAAE,GAAC,YAAY,mBACrB,MAAM,EAAE,GAAC,YAAY,QAwG/B"}

package/src/core/geom/3d/topology/struct/binary/io/bt_mesh_from_indexed_geometry.js

@@ -1,3 +1,4 @@
+import { bt_radial_loop_add } from "./bt_radial_loop_add.js";
 import { NULL_POINTER } from "../BinaryTopology.js";
 import { bt_edge_get_or_create } from "./edge/bt_edge_get_or_create.js";
 
@@ -90,9 +91,9 @@ export function bt_mesh_from_indexed_geometry(
         out.loop_write_face(loop_c, face_id);
 
         // link loops to edges
-        link_loop_to_edge(out, loop_a, edge_ab);
-        link_loop_to_edge(out, loop_b, edge_bc);
-        link_loop_to_edge(out, loop_c, edge_ca);
+        bt_radial_loop_add(out, loop_a, edge_ab);
+        bt_radial_loop_add(out, loop_b, edge_bc);
+        bt_radial_loop_add(out, loop_c, edge_ca);
 
 
         /*
@@ -114,39 +115,5 @@ export function bt_mesh_from_indexed_geometry(
     }
 }
 
-/**
- *
- * @param {BinaryTopology} mesh
- * @param {number} loop_id
- * @param {number} edge_id
- */
-function link_loop_to_edge(mesh, loop_id, edge_id) {
-    mesh.loop_write_edge(loop_id, edge_id);
-
-    /**
-     * First loop attached to the edge
-     * @type {number}
-     */
-    const existing_loop = mesh.edge_read_loop(edge_id);
-
-    if (existing_loop === NULL_POINTER) {
-
-        // no loops connected yet
-        mesh.edge_write_loop(edge_id, loop_id);
-
-    } else {
-
-        // insert loop between existing loop and the next one
-        const next = mesh.loop_read_radial_next(existing_loop);
-
-        mesh.loop_write_radial_next(existing_loop, loop_id);
-        mesh.loop_write_radial_prev(next, loop_id);
-
-        mesh.loop_write_radial_next(loop_id, next);
-        mesh.loop_write_radial_prev(loop_id, existing_loop);
-
-    }
-
-}
 
 

package/src/core/geom/3d/topology/struct/binary/io/face/bt_face_poke.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bt_face_poke.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/face/bt_face_poke.js"],"names":[],"mappings":"AAMA;;;;;;;;;;;;GAYG;AACH,4DANW,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAuGlB;AAlHD;;;;;;;;;;;;GAYG;AACH,iEANW,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAuGlB"}
+{"version":3,"file":"bt_face_poke.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/face/bt_face_poke.js"],"names":[],"mappings":"AAOA;;;;;;;;;;;;GAYG;AACH,4DANW,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAuGlB;AAlHD;;;;;;;;;;;;GAYG;AACH,iEANW,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAuGlB"}

package/src/core/geom/3d/topology/struct/binary/io/face/bt_face_poke.js

@@ -1,3 +1,4 @@
+import { bt_radial_loop_add } from "../bt_radial_loop_add.js";
 import { assert } from "../../../../../../../assert.js";
 import { NULL_POINTER } from "../../BinaryTopology.js";
 import { bt_edge_create } from "../edge/bt_edge_create.js";
@@ -105,7 +106,7 @@ export function bt_face_poke(
         mesh.loop_write_prev(l_next_spoke, l_old);
 
         // Link to the spoke edge (Radial Cycle)
-        _link_loop_to_edge_local(mesh, l_next_spoke, spoke_edges[idx_next]);
+        bt_radial_loop_add(mesh, l_next_spoke, spoke_edges[idx_next]);
 
         // --- Configure Loop 3 (At V_center, pointing to V_curr) ---
         mesh.loop_write_vertex(l_center_spoke, v_center);
@@ -114,42 +115,12 @@ export function bt_face_poke(
         mesh.loop_write_prev(l_center_spoke, l_next_spoke);
 
         // Link to the spoke edge (Radial Cycle)
-        _link_loop_to_edge_local(mesh, l_center_spoke, spoke_edges[idx_curr]);
+        bt_radial_loop_add(mesh, l_center_spoke, spoke_edges[idx_curr]);
     }
 
     return v_center;
 }
 
-/**
- * Local helper to link a loop to an edge's radial cycle.
- * Replicates logic from 'link_loop_to_edge' since it is not exported.
- * @param {BinaryTopology} mesh
- * @param {number} loop_id
- * @param {number} edge_id
- */
-function _link_loop_to_edge_local(mesh, loop_id, edge_id) {
-    mesh.loop_write_edge(loop_id, edge_id);
-
-    const existing_loop = mesh.edge_read_loop(edge_id);
-
-    if (existing_loop === NULL_POINTER) {
-        // First loop on this edge
-        mesh.edge_write_loop(edge_id, loop_id);
-
-        // Link to self
-        mesh.loop_write_radial_next(loop_id, loop_id);
-        mesh.loop_write_radial_prev(loop_id, loop_id);
-    } else {
-        // Insert into doubly linked list
-        const next = mesh.loop_read_radial_next(existing_loop);
-
-        mesh.loop_write_radial_next(existing_loop, loop_id);
-        mesh.loop_write_radial_prev(next, loop_id);
-
-        mesh.loop_write_radial_next(loop_id, next);
-        mesh.loop_write_radial_prev(loop_id, existing_loop);
-    }
-}
 /**
  * @deprecated Renamed to {@link bt_face_poke} (operates on a single face, not the whole mesh).
  */

package/src/core/geom/3d/topology/struct/binary/query/bt_face_read_triangle.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Read the three vertex ids of a TRIANGULAR face into `out[0..2]`.
+ *
+ * Returns `false` — writing nothing — when the face is unallocated (no loop) or is not a triangle. That
+ * check is the point of this helper: the hand-written copies it replaces disagreed about it, some testing
+ * for `NULL_POINTER` and none verifying the loop actually closes after three steps, so a quad silently
+ * reported its first three vertices as though it were a triangle.
+ *
+ * @param {number[]|Uint32Array|Int32Array} out destination for the three vertex ids
+ * @param {BinaryTopology} mesh
+ * @param {number} face
+ * @returns {boolean} `true` when `face` is an allocated triangle and `out` was written
+ *
+ * @author Alex Goldring
+ * @copyright Company Named Limited (c) 2026
+ */
+export function bt_face_read_triangle_vertices(out: number[] | Uint32Array | Int32Array, mesh: BinaryTopology, face: number): boolean;
+/**
+ * Read the nine coordinates of a TRIANGULAR face's three vertices into `out[out_offset .. +8]`, laid out
+ * as `(ax, ay, az, bx, by, bz, cx, cy, cz)`.
+ *
+ * Same contract as {@link bt_face_read_triangle_vertices}: returns `false` and writes nothing for an
+ * unallocated or non-triangular face.
+ *
+ * @param {number[]|Float32Array|Float64Array} out
+ * @param {number} out_offset
+ * @param {BinaryTopology} mesh
+ * @param {number} face
+ * @returns {boolean}
+ */
+export function bt_face_read_triangle_coordinates(out: number[] | Float32Array | Float64Array, out_offset: number, mesh: BinaryTopology, face: number): boolean;
+//# sourceMappingURL=bt_face_read_triangle.d.ts.map

package/src/core/geom/3d/topology/struct/binary/query/bt_face_read_triangle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bt_face_read_triangle.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_face_read_triangle.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;GAeG;AACH,oDARW,MAAM,EAAE,GAAC,WAAW,GAAC,UAAU,8BAE/B,MAAM,GACJ,OAAO,CAyBnB;AAED;;;;;;;;;;;;GAYG;AACH,uDANW,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,cAClC,MAAM,8BAEN,MAAM,GACJ,OAAO,CAYnB"}

package/src/core/geom/3d/topology/struct/binary/query/bt_face_read_triangle.js

@@ -0,0 +1,66 @@
+import { NULL_POINTER } from "../BinaryTopology.js";
+
+/**
+ * Read the three vertex ids of a TRIANGULAR face into `out[0..2]`.
+ *
+ * Returns `false` — writing nothing — when the face is unallocated (no loop) or is not a triangle. That
+ * check is the point of this helper: the hand-written copies it replaces disagreed about it, some testing
+ * for `NULL_POINTER` and none verifying the loop actually closes after three steps, so a quad silently
+ * reported its first three vertices as though it were a triangle.
+ *
+ * @param {number[]|Uint32Array|Int32Array} out destination for the three vertex ids
+ * @param {BinaryTopology} mesh
+ * @param {number} face
+ * @returns {boolean} `true` when `face` is an allocated triangle and `out` was written
+ *
+ * @author Alex Goldring
+ * @copyright Company Named Limited (c) 2026
+ */
+export function bt_face_read_triangle_vertices(out, mesh, face) {
+    const loop_a = mesh.face_read_loop(face);
+
+    if (loop_a === NULL_POINTER) {
+        return false;
+    }
+
+    const loop_b = mesh.loop_read_next(loop_a);
+    const loop_c = mesh.loop_read_next(loop_b);
+
+    if (mesh.loop_read_next(loop_c) !== loop_a) {
+        // not a triangle
+        return false;
+    }
+
+    out[0] = mesh.loop_read_vertex(loop_a);
+    out[1] = mesh.loop_read_vertex(loop_b);
+    out[2] = mesh.loop_read_vertex(loop_c);
+
+    return true;
+}
+
+/**
+ * Read the nine coordinates of a TRIANGULAR face's three vertices into `out[out_offset .. +8]`, laid out
+ * as `(ax, ay, az, bx, by, bz, cx, cy, cz)`.
+ *
+ * Same contract as {@link bt_face_read_triangle_vertices}: returns `false` and writes nothing for an
+ * unallocated or non-triangular face.
+ *
+ * @param {number[]|Float32Array|Float64Array} out
+ * @param {number} out_offset
+ * @param {BinaryTopology} mesh
+ * @param {number} face
+ * @returns {boolean}
+ */
+export function bt_face_read_triangle_coordinates(out, out_offset, mesh, face) {
+    if (!bt_face_read_triangle_vertices(scratch_vertices, mesh, face)) {
+        return false;
+    }
+
+    mesh.vertex_read_coordinate(out, out_offset, scratch_vertices[0]);
+    mesh.vertex_read_coordinate(out, out_offset + 3, scratch_vertices[1]);
+    mesh.vertex_read_coordinate(out, out_offset + 6, scratch_vertices[2]);
+
+    return true;
+}
+
+const scratch_vertices = new Uint32Array(3);

package/src/core/geom/3d/topology/struct/binary/query/bt_mesh_face_find_path.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_face_find_path.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_mesh_face_find_path.js"],"names":[],"mappings":"AAwoBA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,+CAVW,MAAM,EAAE,GAAC,WAAW,iBACpB,MAAM,gBACN,MAAM,8CAEN,MAAM,GAGJ,MAAM,CAuDlB"}
+{"version":3,"file":"bt_mesh_face_find_path.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_mesh_face_find_path.js"],"names":[],"mappings":"AA+mBA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,+CAVW,MAAM,EAAE,GAAC,WAAW,iBACpB,MAAM,gBACN,MAAM,8CAEN,MAAM,GAGJ,MAAM,CAuDlB"}