@woosh/meep-engine 2.131.48 → 2.132.0

package/src/core/geom/3d/topology/struct/binary/io/{bt_index_geometry_to_topology.js → bt_mesh_from_indexed_geometry.js}

@@ -1,17 +1,16 @@
 import { NULL_POINTER } from "../BinaryTopology.js";
-import { bt_edge_get_or_create } from "./bt_edge_get_or_create.js";
-
+import { bt_edge_get_or_create } from "./edge/bt_edge_get_or_create.js";
 
 /**
- * Populates supplied topology with data from supplied indexed geometry
+ * Populates supplied topology with data from supplied indexed geometry (triangles)
  * @see https://github.com/blender/blender/blob/9cb061f4f0119e647173e7d354e1457e97632333/source/blender/blenkernel/intern/mesh_calc_edges.cc
  * @see https://github.com/blender/blender/blob/9cb061f4f0119e647173e7d354e1457e97632333/source/blender/io/stl/importer/stl_import_mesh.cc#L63
  * @param {BinaryTopology} out
- * @param {number[]} indices
- * @param {number[]} vertex_positions
- * @param {number[]} [vertex_normals]
+ * @param {number[]|Uint32Array|Uint16Array|Uint8Array} indices
+ * @param {number[]|Float32Array} vertex_positions
+ * @param {number[]|Float32Array} [vertex_normals] Optional vertex normals. Can be skipped.
  */
-export function bt_index_geometry_to_topology(
+export function bt_mesh_from_indexed_geometry(
     out,
     indices,
     vertex_positions,

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

@@ -0,0 +1,8 @@
+/**
+ * Populates supplied topology with data from supplied unindexed geometry (triangles)
+ * @param {BinaryTopology} out
+ * @param {number[]} vertex_positions
+ * @param {number[]} [vertex_normals] Optional vertex normals. Can be skipped.
+ */
+export function bt_mesh_from_unindexed_geometry(out: BinaryTopology, vertex_positions: number[], vertex_normals?: number[]): void;
+//# sourceMappingURL=bt_mesh_from_unindexed_geometry.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_mesh_from_unindexed_geometry.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_from_unindexed_geometry.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,uFAHW,MAAM,EAAE,mBACR,MAAM,EAAE,QAuBlB"}

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

@@ -0,0 +1,31 @@
+import { assert } from "../../../../../../assert.js";
+import { bt_mesh_from_indexed_geometry } from "./bt_mesh_from_indexed_geometry.js";
+
+/**
+ * Populates supplied topology with data from supplied unindexed geometry (triangles)
+ * @param {BinaryTopology} out
+ * @param {number[]} vertex_positions
+ * @param {number[]} [vertex_normals] Optional vertex normals. Can be skipped.
+ */
+export function bt_mesh_from_unindexed_geometry(
+    out,
+    vertex_positions,
+    vertex_normals,
+) {
+
+    const triangle_count = vertex_positions.length / 9;
+
+    assert.isNonNegativeInteger(triangle_count, 'triangle_count');
+
+    const indices = new Uint32Array(triangle_count * 3);
+    for (let i = 0; i < indices.length; i++) {
+        indices[i] = i;
+    }
+
+    return bt_mesh_from_indexed_geometry(
+        out,
+        indices,
+        vertex_positions,
+        vertex_normals
+    );
+}

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

@@ -0,0 +1,7 @@
+/**
+ * Convert all non-triangular faces into triangles.
+ *
+ * @param {BinaryTopology} mesh
+ */
+export function bt_mesh_triangulate(mesh: BinaryTopology): void;
+//# sourceMappingURL=bt_mesh_triangulate.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_mesh_triangulate.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_triangulate.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,gEAcC"}

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

@@ -0,0 +1,22 @@
+import { bt_face_triangulate } from "./face/bt_face_triangulate.js";
+
+/**
+ * Convert all non-triangular faces into triangles.
+ *
+ * @param {BinaryTopology} mesh
+ */
+export function bt_mesh_triangulate(mesh) {
+
+    const faces = mesh.faces;
+
+    const face_count = faces.size;
+
+    for (let face_id = 0; face_id < face_count; face_id++) {
+        if (!faces.is_allocated(face_id)) {
+            continue;
+        }
+
+        bt_face_triangulate(mesh, face_id);
+    }
+
+}

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

@@ -0,0 +1,8 @@
+/**
+ * Adds a loop to an edge's radial cycle.
+ * @param {BinaryTopology} mesh
+ * @param {number} loop Loop ID
+ * @param {number} edge Edge ID
+ */
+export function bt_radial_loop_add(mesh: BinaryTopology, loop: number, edge: number): void;
+//# sourceMappingURL=bt_radial_loop_add.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_radial_loop_add.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_radial_loop_add.js"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,+DAHW,MAAM,QACN,MAAM,QAyBhB"}

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

@@ -0,0 +1,32 @@
+import { NULL_POINTER } from "../BinaryTopology.js";
+
+/**
+ * Adds a loop to an edge's radial cycle.
+ * @param {BinaryTopology} mesh
+ * @param {number} loop Loop ID
+ * @param {number} edge Edge ID
+ */
+export function bt_radial_loop_add(mesh, loop, edge) {
+    // Associate the loop with the edge
+    mesh.loop_write_edge(loop, edge);
+
+    const base_loop = mesh.edge_read_loop(edge);
+
+    if (base_loop === NULL_POINTER) {
+        // First loop on this edge
+        mesh.edge_write_loop(edge, loop);
+        mesh.loop_write_radial_next(loop, loop);
+        mesh.loop_write_radial_prev(loop, loop);
+    } else {
+        // Splice into existing cycle just before the base_loop
+        const base_prev = mesh.loop_read_radial_prev(base_loop);
+
+        // Link base_prev -> loop
+        mesh.loop_write_radial_next(base_prev, loop);
+        mesh.loop_write_radial_prev(loop, base_prev);
+
+        // Link loop -> base_loop
+        mesh.loop_write_radial_next(loop, base_loop);
+        mesh.loop_write_radial_prev(base_loop, loop);
+    }
+}

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

@@ -0,0 +1,8 @@
+/**
+ * Removes a loop from an edge's radial cycle.
+ * @param {BinaryTopology} mesh
+ * @param {number} loop Loop ID
+ * @param {number} edge Edge ID
+ */
+export function bt_radial_loop_remove(mesh: BinaryTopology, loop: number, edge: number): void;
+//# sourceMappingURL=bt_radial_loop_remove.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_radial_loop_remove.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_radial_loop_remove.js"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,kEAHW,MAAM,QACN,MAAM,QAmBhB"}

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

@@ -0,0 +1,26 @@
+import { NULL_POINTER } from "../BinaryTopology.js";
+
+/**
+ * Removes a loop from an edge's radial cycle.
+ * @param {BinaryTopology} mesh
+ * @param {number} loop Loop ID
+ * @param {number} edge Edge ID
+ */
+export function bt_radial_loop_remove(mesh, loop, edge) {
+    const r_prev = mesh.loop_read_radial_prev(loop);
+    const r_next = mesh.loop_read_radial_next(loop);
+
+    // Bypass the loop in the doubly linked list
+    mesh.loop_write_radial_next(r_prev, r_next);
+    mesh.loop_write_radial_prev(r_next, r_prev);
+
+    // If the edge's base pointer is looking at the loop being removed
+    if (mesh.edge_read_loop(edge) === loop) {
+        // If it was the only loop, set to NULL. Otherwise, advance to the next loop.
+        mesh.edge_write_loop(edge, r_next === loop ? NULL_POINTER : r_next);
+    }
+
+    // Reset the removed loop's radial pointers to itself for safety
+    mesh.loop_write_radial_next(loop, loop);
+    mesh.loop_write_radial_prev(loop, loop);
+}

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

@@ -0,0 +1 @@
+{"version":3,"file":"OrderedEdge.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/edge/OrderedEdge.js"],"names":[],"mappings":"AAEA;IACI;;;;OAIG;IACH,gBAHW,MAAM,MACN,MAAM,EAUhB;IANO,cAAe;IACf,eAAgB;IAOxB;;;;OAIG;IACH,QAHW,MAAM,MACN,MAAM,QAUhB;IAED;;;OAGG;IACH,YAFW,WAAW,QAKrB;IAED,qBAEC;IAED;;;OAGG;IACH,QAFY,MAAM,CAKjB;IAED;;;;OAIG;IACH,cAHW,WAAW,GACT,OAAO,CAMnB;CACJ"}

package/src/core/geom/3d/topology/struct/binary/io/{OrderedEdge.js → edge/OrderedEdge.js}

@@ -1,4 +1,4 @@
-import { split_by_2 } from "../../../../../../binary/split_by_2.js";
+import { split_by_2 } from "../../../../../../../binary/split_by_2.js";
 
 export class OrderedEdge {
     /**

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_edge_create.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/edge/bt_edge_create.js"],"names":[],"mappings":"AA8DA;;;;;;GAMG;AACH,yDAJW,MAAM,MACN,MAAM,GACL,MAAM,CAsCjB"}

package/src/core/geom/3d/topology/struct/binary/io/{bt_edge_create.js → edge/bt_edge_create.js}

@@ -1,4 +1,4 @@
-import { NULL_POINTER } from "../BinaryTopology.js";
+import { NULL_POINTER } from "../../BinaryTopology.js";
 
 /**
  *

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_edge_get_or_create.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/edge/bt_edge_get_or_create.js"],"names":[],"mappings":"AAGA;;;;;;;GAOG;AACH,gEAJW,MAAM,MACN,MAAM,GACJ,MAAM,CAmClB"}

package/src/core/geom/3d/topology/struct/binary/io/{bt_edge_get_or_create.js → edge/bt_edge_get_or_create.js}

@@ -1,4 +1,4 @@
-import { NULL_POINTER } from "../BinaryTopology.js";
+import { NULL_POINTER } from "../../BinaryTopology.js";
 import { bt_edge_create } from "./bt_edge_create.js";
 
 /**

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_edge_kill.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/edge/bt_edge_kill.js"],"names":[],"mappings":"AAMA;;;GAGG;AACH,sDAFW,MAAM,QAoBhB"}

package/src/core/geom/3d/topology/struct/binary/io/{bt_edge_kill.js → edge/bt_edge_kill.js}

@@ -1,6 +1,7 @@
-import { NULL_POINTER } from "../BinaryTopology.js";
-import { bt_disk_edge_remove } from "./bt_disk_edge_remove.js";
-import { bt_face_kill } from "./bt_face_kill.js";
+import { assert } from "../../../../../../../assert.js";
+import { NULL_POINTER } from "../../BinaryTopology.js";
+import { bt_disk_edge_remove } from "../bt_disk_edge_remove.js";
+import { bt_face_kill } from "../face/bt_face_kill.js";
 import { bt_kill_only_edge } from "./bt_kill_only_edge.js";
 
 /**
@@ -8,6 +9,8 @@ import { bt_kill_only_edge } from "./bt_kill_only_edge.js";
  * @param {number} e
  */
 export function bt_edge_kill(mesh, e) {
+    assert.isNonNegativeInteger(e, 'e');
+
     let l = NULL_POINTER;
 
     while ((l = mesh.edge_read_loop(e)) !== NULL_POINTER) {

package/src/core/geom/3d/topology/struct/binary/io/edge/bt_edge_split.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Splits an edge at parameter t and triangulates adjacent faces.
+ *
+ * NOTE: Assumes that the input mesh is triangulated.
+ * NOTE: Does not check for created self-intersections or degenerate edges/faces. Make sure that if you pass t <= 0 or t >= 1 - you understand the implications.
+ *
+ * @param {BinaryTopology} mesh
+ * @param {number} edge_id The edge to split
+ * @param {number} t Interpolation parameter (0.0 to 1.0)
+ * @returns {number} The newly created vertex ID
+ */
+export function bt_edge_split(mesh: BinaryTopology, edge_id: number, t: number): number;
+//# sourceMappingURL=bt_edge_split.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_edge_split.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/edge/bt_edge_split.js"],"names":[],"mappings":"AAoBA;;;;;;;;;;GAUG;AACH,6DAJW,MAAM,KACN,MAAM,GACJ,MAAM,CAsJlB"}

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

@@ -0,0 +1,180 @@
+import { assert } from "../../../../../../../assert.js";
+import { NULL_POINTER } from "../../BinaryTopology.js";
+import { bt_disk_edge_add } from "../bt_disk_edge_add.js";
+import { bt_disk_edge_remove } from "../bt_disk_edge_remove.js";
+import { bt_radial_loop_add } from "../bt_radial_loop_add.js";
+import { bt_radial_loop_remove } from "../bt_radial_loop_remove.js";
+import { bt_edge_create } from "./bt_edge_create.js";
+
+
+const f_normal = new Float32Array(3);
+
+const c1 = new Float32Array(3);
+const c2 = new Float32Array(3);
+
+const n1 = new Float32Array(3);
+const n2 = new Float32Array(3);
+
+const c_new = new Float32Array(3);
+const n_new = new Float32Array(3);
+
+/**
+ * Splits an edge at parameter t and triangulates adjacent faces.
+ *
+ * NOTE: Assumes that the input mesh is triangulated.
+ * NOTE: Does not check for created self-intersections or degenerate edges/faces. Make sure that if you pass t <= 0 or t >= 1 - you understand the implications.
+ *
+ * @param {BinaryTopology} mesh
+ * @param {number} edge_id The edge to split
+ * @param {number} t Interpolation parameter (0.0 to 1.0)
+ * @returns {number} The newly created vertex ID
+ */
+export function bt_edge_split(
+    mesh,
+    edge_id,
+    t
+) {
+    assert.isNonNegativeInteger(edge_id, 'edge_id');
+    assert.isNumber(t, 't');
+    assert.greaterThanOrEqual(t, 0, 't');
+    assert.lessThanOrEqual(t, 1, 't');
+
+    assert.defined(mesh, 'mesh');
+    assert.notNull(mesh, 'mesh');
+
+    const v1 = mesh.edge_read_vertex1(edge_id);
+    const v2 = mesh.edge_read_vertex2(edge_id);
+
+    // ----------------------------------------------------------------
+    // 1. Interpolate and Create New Vertex
+    // ----------------------------------------------------------------
+
+    mesh.vertex_read_coordinate(c1, 0, v1);
+    mesh.vertex_read_coordinate(c2, 0, v2);
+
+    c_new[0] = c1[0] + (c2[0] - c1[0]) * t;
+    c_new[1] = c1[1] + (c2[1] - c1[1]) * t;
+    c_new[2] = c1[2] + (c2[2] - c1[2]) * t;
+
+    mesh.vertex_read_normal(n1, 0, v1);
+    mesh.vertex_read_normal(n2, 0, v2);
+
+    n_new[0] = n1[0] + (n2[0] - n1[0]) * t;
+    n_new[1] = n1[1] + (n2[1] - n1[1]) * t;
+    n_new[2] = n1[2] + (n2[2] - n1[2]) * t;
+
+    const len = Math.sqrt(n_new[0] ** 2 + n_new[1] ** 2 + n_new[2] ** 2);
+    if (len > 0) {
+        n_new[0] /= len;
+        n_new[1] /= len;
+        n_new[2] /= len;
+    }
+
+    const v_new = mesh.vertices.allocate();
+    mesh.vertex_write_coordinate(v_new, c_new, 0);
+    mesh.vertex_write_normal(v_new, n_new, 0);
+    mesh.vertex_write_edge(v_new, NULL_POINTER); // Initialize disk cycle
+
+    // ----------------------------------------------------------------
+    // 2. Gather Connected Faces (Radial Cycle)
+    // ----------------------------------------------------------------
+    const loops_to_split = [];
+    let curr_loop = mesh.edge_read_loop(edge_id);
+    if (curr_loop !== NULL_POINTER) {
+        let start_loop = curr_loop;
+        do {
+            loops_to_split.push(curr_loop);
+            curr_loop = mesh.loop_read_radial_next(curr_loop);
+        } while (curr_loop !== start_loop && curr_loop !== NULL_POINTER);
+    }
+
+    // ----------------------------------------------------------------
+    // 3. Split the Edge Topologically
+    // ----------------------------------------------------------------
+    // Shrink original edge to (v1, v_new)
+    bt_disk_edge_remove(mesh, edge_id, v2);
+    mesh.edge_write_vertex2(edge_id, v_new);
+    bt_disk_edge_add(mesh, edge_id, v_new);
+
+    // Create new edge for (v_new, v2)
+    // Note: bt_edge_create handles the disk cycle attachments for us!
+    const e_new = bt_edge_create(mesh, v_new, v2);
+
+    // ----------------------------------------------------------------
+    // 4. Split Adjacent Faces
+    // ----------------------------------------------------------------
+
+
+    for (let i = 0; i < loops_to_split.length; i++) {
+        const l_start = loops_to_split[i];
+        const l_end = mesh.loop_read_next(l_start);
+        const l_opp = mesh.loop_read_next(l_end);
+
+        const v_start = mesh.loop_read_vertex(l_start);
+        const v_end = mesh.loop_read_vertex(l_end);
+        const v_opp = mesh.loop_read_vertex(l_opp);
+
+        const f = mesh.loop_read_face(l_start);
+        mesh.face_read_normal(f_normal, 0, f);
+
+        const e_end_opp = mesh.loop_read_edge(l_end);
+
+        // Determine which physical edge corresponds to this loop's direction
+        const is_start_v1 = (v_start === v1);
+        const edge_start_new = is_start_v1 ? edge_id : e_new;
+        const edge_new_end = is_start_v1 ? e_new : edge_id;
+
+        // Create the cross edge dividing the triangle
+        const e_cross = bt_edge_create(mesh, v_new, v_opp);
+
+        // --- FACE 1: Re-use existing face (v_start, v_new, v_opp) ---
+
+        // Update l_start (ensure it points to the correct half of the split edge)
+        if (mesh.loop_read_edge(l_start) !== edge_start_new) {
+            bt_radial_loop_remove(mesh, l_start, mesh.loop_read_edge(l_start));
+            bt_radial_loop_add(mesh, l_start, edge_start_new);
+        }
+
+        // Update l_end (now acts as the loop for v_new -> v_opp)
+        bt_radial_loop_remove(mesh, l_end, e_end_opp);
+        mesh.loop_write_vertex(l_end, v_new);
+        bt_radial_loop_add(mesh, l_end, e_cross);
+
+        // l_opp remains unchanged (v_opp -> v_start)
+
+        // --- FACE 2: Create new face (v_new, v_end, v_opp) ---
+        const f2 = mesh.faces.allocate();
+        mesh.face_write_normal(f2, f_normal, 0);
+
+        const nl1 = mesh.loop_create();
+        const nl2 = mesh.loop_create();
+        const nl3 = mesh.loop_create();
+
+        // nl1: v_new -> v_end
+        mesh.loop_write_vertex(nl1, v_new);
+        mesh.loop_write_face(nl1, f2);
+        bt_radial_loop_add(mesh, nl1, edge_new_end);
+
+        // nl2: v_end -> v_opp
+        mesh.loop_write_vertex(nl2, v_end);
+        mesh.loop_write_face(nl2, f2);
+        bt_radial_loop_add(mesh, nl2, e_end_opp);
+
+        // nl3: v_opp -> v_new
+        mesh.loop_write_vertex(nl3, v_opp);
+        mesh.loop_write_face(nl3, f2);
+        bt_radial_loop_add(mesh, nl3, e_cross);
+
+        // Wire up loops for f2
+        mesh.loop_write_next(nl1, nl2);
+        mesh.loop_write_prev(nl1, nl3);
+        mesh.loop_write_next(nl2, nl3);
+        mesh.loop_write_prev(nl2, nl1);
+        mesh.loop_write_next(nl3, nl1);
+        mesh.loop_write_prev(nl3, nl2);
+
+        mesh.face_write_loop(f2, nl1);
+    }
+
+    return v_new;
+}

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_kill_only_edge.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/edge/bt_kill_only_edge.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,2DAFW,MAAM,QAIhB"}

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_mesh_calc_edges.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/edge/bt_mesh_calc_edges.js"],"names":[],"mappings":""}

package/src/core/geom/3d/topology/struct/binary/io/{bt_mesh_calc_edges.js → edge/bt_mesh_calc_edges.js}

@@ -1,26 +1,29 @@
+import { HashSet } from "../../../../../../../collection/set/HashSet.js";
 import { OrderedEdge } from "./OrderedEdge.js";
-import { HashMap } from "../../../../../../collection/map/HashMap.js";
 
 /**
  * @see https://github.com/blender/blender/blob/9cb061f4f0119e647173e7d354e1457e97632333/source/blender/blenkernel/intern/mesh_calc_edges.cc#L209
  * @param {BinaryTopology} mesh
+ * @returns {HashSet<OrderedEdge>}
  */
 function bt_mesh_calc_edges(mesh) {
     /**
      *
-     * @type {HashMap<OrderedEdge, unknown>}
+     * @type {HashSet<OrderedEdge>}
      */
-    const map = new HashMap();
+    const collection = new HashSet();
 
-    add_polygon_edges_to_map(mesh, map);
+    add_polygon_edges_to_map(mesh, collection);
+
+    return collection;
 }
 
 /**
  * @see https://github.com/blender/blender/blob/9cb061f4f0119e647173e7d354e1457e97632333/source/blender/blenkernel/intern/mesh_calc_edges.cc#L96
  * @param {BinaryTopology} mesh
- * @param {HashMap<OrderedEdge,*>} edge_map
+ * @param {HashSet<OrderedEdge>} edge_set
  */
-function add_polygon_edges_to_map(mesh, edge_map) {
+function add_polygon_edges_to_map(mesh, edge_set) {
 
     const faces = mesh.faces;
     const face_count = faces.size;
@@ -42,7 +45,7 @@ function add_polygon_edges_to_map(mesh, edge_map) {
 
             const edge = new OrderedEdge(prev_v, next_v);
 
-            edge_map.getOrSet(edge, null);
+            edge_set.ensure(edge);
 
             prev_loop = loop;
         }

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

@@ -0,0 +1 @@
+{"version":3,"file":"get_or_create_edge_map.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/edge/get_or_create_edge_map.js"],"names":[],"mappings":""}

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

@@ -0,0 +1,8 @@
+/**
+ * Safely removes a face from the topology.
+ * Iteratively untangles and frees all its loops, then releases the face memory.
+ * @param {BinaryTopology} mesh
+ * @param {number} f Face ID
+ */
+export function bt_face_kill(mesh: BinaryTopology, f: number): void;
+//# sourceMappingURL=bt_face_kill.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_face_kill.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/face/bt_face_kill.js"],"names":[],"mappings":"AAIA;;;;;GAKG;AACH,sDAFW,MAAM,QAiBhB"}

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

@@ -0,0 +1,26 @@
+import { assert } from "../../../../../../../assert.js";
+import { NULL_POINTER } from "../../BinaryTopology.js";
+import { bt_loop_kill } from "../bt_loop_kill.js";
+
+/**
+ * Safely removes a face from the topology.
+ * Iteratively untangles and frees all its loops, then releases the face memory.
+ * @param {BinaryTopology} mesh
+ * @param {number} f Face ID
+ */
+export function bt_face_kill(mesh, f) {
+    assert.isNonNegativeInteger(f, 'f');
+
+    let l = NULL_POINTER;
+
+    // TODO add a cycle limit to avoid infinite loops on bad topologies
+
+    // bt_loop_kill automatically updates the face's base loop pointer to the
+    // next loop, or to NULL_POINTER if it's the last loop in the cycle.
+    while ((l = mesh.face_read_loop(f)) !== NULL_POINTER) {
+        bt_loop_kill(mesh, l);
+    }
+
+    // With all loops removed, the face is completely isolated and can be freed
+    mesh.faces.release(f);
+}

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

@@ -0,0 +1,15 @@
+/**
+ * Pokes a face by adding a vertex at the specified coordinates and fan-tessellating the face.
+ * Reuses bt_edge_create to handle the complex vertex-disk linking automatically.
+ *
+ * Coordinates of the new vertex must be co-planar with the face.
+ *
+ * @param {BinaryTopology} mesh
+ * @param {number} face_id
+ * @param {number} x
+ * @param {number} y
+ * @param {number} z
+ * @returns {number} vertex ID of the new center vertex, NULL_POINTER if face is degenerate or does not exist.
+ */
+export function bt_mesh_face_poke(mesh: BinaryTopology, face_id: number, x: number, y: number, z: number): number;
+//# sourceMappingURL=bt_face_poke.d.ts.map

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

@@ -0,0 +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,iEANW,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAuGlB"}