@woosh/meep-engine 2.163.10 → 2.164.0

package/src/core/geom/3d/topology/simplify/simplifyTopoMesh.js

@@ -5,7 +5,7 @@ import { build_edge_collapse_candidates } from "./build_edge_collapse_candidates
 import { collapse_all_degenerate_edges } from "./collapse_all_degenerate_edges.js";
 import { collapse_degenerate_edge } from "./collapse_degenerate_edge.js";
 import { EdgeCollapseCandidate } from "./EdgeCollapseCandidate.js";
-import { build_vertex_quadratics } from "./quadratic/build_vertex_quadratics.js";
+import { build_vertex_quadrics } from "./quadratic/build_vertex_quadrics.js";
 
 
 const scratch_array_1 = [];
@@ -235,7 +235,7 @@ export function simplifyTopoMesh(mesh, num_faces_to_remove, restricted_vertices
      */
     const vertex_quadratics = new Map();
 
-    build_vertex_quadratics({ mesh: mesh, quadratics: vertex_quadratics });
+    build_vertex_quadrics({ mesh: mesh, quadrics: vertex_quadratics });
 
     // compute collapse cost of each vertex/edge pair
     build_edge_collapse_candidates(

package/src/core/geom/3d/topology/simplify/simplifyTopoMesh2.js

@@ -5,7 +5,7 @@ import {
     decimate_edge_collapse_snap,
     edge_collapse_pick_target_vertex
 } from "./decimate_edge_collapse_snap.js";
-import { build_vertex_quadratics } from "./quadratic/build_vertex_quadratics.js";
+import { build_vertex_quadrics } from "./quadratic/build_vertex_quadrics.js";
 
 /**
  *
@@ -103,7 +103,7 @@ export function simplifyTopoMesh2(mesh, num_faces_to_remove, restricted_vertices
      */
     const vertex_quadratics = new Map();
 
-    build_vertex_quadratics({ mesh: mesh, quadratics: vertex_quadratics });
+    build_vertex_quadrics({ mesh: mesh, quadrics: vertex_quadratics });
 
     const edge_lookup = new Map();
     edge_collapse_populate_heap(mesh.getEdges(), restricted_vertices, heap, vertex_quadratics, edge_lookup);

package/src/core/geom/3d/topology/struct/TopoMesh.d.ts

@@ -88,7 +88,7 @@ export class TopoMesh {
      */
     addUniqueVertex(v: TopoVertex): void;
     /**
-     * @deprecated use {@link tm_kill_only_vert}
+     * @deprecated use {@link tm_vertex_kill_only}
      * @param {TopoVertex} v
      */
     removeVertex(v: TopoVertex): void;
@@ -109,7 +109,7 @@ export class TopoMesh {
      */
     addUniqueEdge(e: TopoEdge): void;
     /**
-     * @deprecated use {@link tm_kill_only_edge}
+     * @deprecated use {@link tm_edge_kill_only}
      * @param {TopoEdge} e
      */
     removeEdge(e: TopoEdge): void;
@@ -135,7 +135,7 @@ export class TopoMesh {
      */
     injectFace(f: TopoTriangle): void;
     /**
-     * @deprecated use {@link tm_kill_only_face} instead
+     * @deprecated use {@link tm_face_kill_only} instead
      * @param {TopoTriangle} f
      */
     removeFace(f: TopoTriangle): void;

package/src/core/geom/3d/topology/struct/TopoMesh.js

@@ -5,9 +5,9 @@ import { noop } from "../../../../function/noop.js";
 
 import { number_format_by_thousands } from "../../../../primitives/numbers/number_format_by_thousands.js";
 import { query_edge_other_vertex } from "../query/query_edge_other_vertex.js";
-import { tm_kill_only_edge } from "../tm_kill_only_edge.js";
-import { tm_kill_only_face } from "../tm_kill_only_face.js";
-import { tm_kill_only_vert } from "../tm_kill_only_vert.js";
+import { tm_edge_kill_only } from "../tm_edge_kill_only.js";
+import { tm_face_kill_only } from "../tm_face_kill_only.js";
+import { tm_vertex_kill_only } from "../tm_vertex_kill_only.js";
 import { TopoEdge } from "./TopoEdge.js";
 import { TopoTriangle } from "./TopoTriangle.js";
 import { TopoVertex } from "./TopoVertex.js";
@@ -364,11 +364,11 @@ export class TopoMesh {
     }
 
     /**
-     * @deprecated use {@link tm_kill_only_vert}
+     * @deprecated use {@link tm_vertex_kill_only}
      * @param {TopoVertex} v
      */
     removeVertex(v) {
-        throw new Error(`deprecated, use tm_kill_only_vert instead`)
+        throw new Error(`deprecated, use tm_vertex_kill_only instead`)
     }
 
     /**
@@ -402,11 +402,11 @@ export class TopoMesh {
     }
 
     /**
-     * @deprecated use {@link tm_kill_only_edge}
+     * @deprecated use {@link tm_edge_kill_only}
      * @param {TopoEdge} e
      */
     removeEdge(e) {
-        throw new Error(`deprecated, use tm_kill_only_edge instead`)
+        throw new Error(`deprecated, use tm_edge_kill_only instead`)
     }
 
     /**
@@ -472,11 +472,11 @@ export class TopoMesh {
     }
 
     /**
-     * @deprecated use {@link tm_kill_only_face} instead
+     * @deprecated use {@link tm_face_kill_only} instead
      * @param {TopoTriangle} f
      */
     removeFace(f) {
-        throw new Error(`deprecated, use tm_kill_only_face instead`)
+        throw new Error(`deprecated, use tm_face_kill_only instead`)
     }
 
     /**
@@ -564,7 +564,7 @@ export class TopoMesh {
                 }
 
                 //cut the second edge
-                tm_kill_only_edge(this, e1);
+                tm_edge_kill_only(this, e1);
 
                 //absorb edge
                 e0.merge(e1);

package/src/core/geom/3d/topology/struct/TopoTriangle.js

@@ -3,7 +3,7 @@ import { assert } from "../../../../assert.js";
 import { array_push_if_unique } from "../../../../collection/array/array_push_if_unique.js";
 import { array_remove_first } from "../../../../collection/array/array_remove_first.js";
 import { array_replace_all } from "../../../../collection/array/array_replace_all.js";
-import { compute_triangle_normal } from "../../triangle/compute_triangle_normal.js";
+import { tri3_compute_normal_v3_objects } from "../../triangle/tri3_compute_normal_v3_objects.js";
 import { TopoEdge } from "./TopoEdge.js";
 import { TopoVertex } from "./TopoVertex.js";
 
@@ -218,7 +218,7 @@ export class TopoTriangle {
         const vB = vertices[1];
         const vC = vertices[2];
 
-        compute_triangle_normal(this.normal, vA, vB, vC);
+        tri3_compute_normal_v3_objects(this.normal, vA, vB, vC);
 
 
         // if (this.normal.z === -1) {

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

@@ -1 +1 @@
-{"version":3,"file":"BinaryTopology.d.ts","sourceRoot":"","sources":["../../../../../../../../src/core/geom/3d/topology/struct/binary/BinaryTopology.js"],"names":[],"mappings":"AAkBA;;;GAGG;AACH,2BAFU,MAAM,CAEuB;AAQvC;;;GAGG;AACH;IACI;;;;;;;;OAQG;IACH,sBAA4F;IAE5F;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,oBAAsD;IAEtD;;;;;;;;;;;;OAYG;IACH,oBAAsD;IAEtD;;;;;;OAMG;IACH,oBAAsE;IAEtE;;;;;OAKG;IACH,2BAA0B;IAE1B;;;;OAIG;IACH,yBAAwB;IAExB;;;;OAIG;IACH,yBAAwB;IAExB;;;;OAIG;IACH,yBAAwB;IAGxB;;;OAGG;IACH,uBAYC;IAED;;;OAGG;IACH,aAUC;IAED;;;OAGG;IACH,kCAEC;IAED;;;OAGG;IACH,+BAEC;IAED;;;OAGG;IACH,+BAEC;IAED;;;OAGG;IACH,+BAEC;IAED;;;;;;OAMG;IACH,qCAEC;IAED;;;OAGG;IACH,mCAEC;IAED;;;OAGG;IACH,mCAEC;IAED;;;OAGG;IACH,mCAEC;IAED;;;;;;;;;;OAUG;IACH,oCAFW,MAAM,QAKhB;IAED;;;OAGG;IACH,kCAFW,MAAM,QAKhB;IAED;;;OAGG;IACH,kCAFW,MAAM,QAKhB;IAED;;;OAGG;IACH,kCAFW,MAAM,QAKhB;IAED;;OAEG;IACH,sBAFa,OAAO,CAQnB;IAED;;OAEG;IACH,oBAFa,OAAO,CAQnB;IAED;;OAEG;IACH,oBAFa,OAAO,CAQnB;IAED;;OAEG;IACH,oBAFa,OAAO,CAQnB;IAED;;;;;OAKG;IACH,2BAWC;IAGD;;OAEG;IACH,cAUC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,iBACvC,MAAM,MACN,MAAM,QAQhB;IAED;;;;;OAKG;IACH,4BAJW,MAAM,SACN,MAAM,EAAE,GAAC,YAAY,gBACrB,MAAM,QAQhB;IAED;;;;;OAKG;IACH,2BAJW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,iBACvC,MAAM,MACN,MAAM,QAQhB;IAED;;;;;OAKG;IACH,wBAJW,MAAM,SACN,MAAM,EAAE,GAAC,YAAY,gBACrB,MAAM,QAQhB;IAED;;;OAGG;IACH,qBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,sBAFW,MAAM,WADN,MAAM,QAQhB;IAED;;;OAGG;IACH,sBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,uBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;OAGG;IACH,sBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,uBAFW,MAAM,SADN,MAAM,QAQhB;IAGD;;;OAGG;IACH,mBAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,WADN,MAAM,QAQhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;;;OAKG;IACH,iBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;;OAIG;IACH,eAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAOhB;IAED;;;OAGG;IACH,qBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,sBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,2BAFW,MAAM,SADN,MAAM,QAShB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,2BAFW,MAAM,SADN,MAAM,QAShB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,yBAJW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,iBACvC,MAAM,MACN,MAAM,QAQhB;IAED;;;;OAIG;IACH,sBAJW,MAAM,SACN,MAAM,EAAE,GAAC,YAAY,gBACrB,MAAM,QAOhB;IAED;;;OAGG;IACH,YAFW,cAAc,QA4CxB;IAED;;;OAGG;IACH,SAFa,cAAc,CAM1B;IAIL;;;;OAIG;IACH,2BAFU,OAAO,CAEwB;CAPxC;kCAp8BiC,wBAAwB"}
+{"version":3,"file":"BinaryTopology.d.ts","sourceRoot":"","sources":["../../../../../../../../src/core/geom/3d/topology/struct/binary/BinaryTopology.js"],"names":[],"mappings":"AAiBA;;;GAGG;AACH,2BAFU,MAAM,CAEuB;AAQvC;;;GAGG;AACH;IACI;;;;;;;;OAQG;IACH,sBAA4F;IAE5F;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,oBAAsD;IAEtD;;;;;;;;;;;;OAYG;IACH,oBAAsD;IAEtD;;;;;;OAMG;IACH,oBAAsE;IAEtE;;;;;OAKG;IACH,2BAA0B;IAE1B;;;;OAIG;IACH,yBAAwB;IAExB;;;;OAIG;IACH,yBAAwB;IAExB;;;;OAIG;IACH,yBAAwB;IAGxB;;;OAGG;IACH,uBAYC;IAED;;;OAGG;IACH,aAUC;IAED;;;OAGG;IACH,kCAEC;IAED;;;OAGG;IACH,+BAEC;IAED;;;OAGG;IACH,+BAEC;IAED;;;OAGG;IACH,+BAEC;IAED;;;;;;OAMG;IACH,qCAEC;IAED;;;OAGG;IACH,mCAEC;IAED;;;OAGG;IACH,mCAEC;IAED;;;OAGG;IACH,mCAEC;IAED;;;;;;;;;;OAUG;IACH,oCAFW,MAAM,QAKhB;IAED;;;OAGG;IACH,kCAFW,MAAM,QAKhB;IAED;;;OAGG;IACH,kCAFW,MAAM,QAKhB;IAED;;;OAGG;IACH,kCAFW,MAAM,QAKhB;IAED;;OAEG;IACH,sBAFa,OAAO,CAQnB;IAED;;OAEG;IACH,oBAFa,OAAO,CAQnB;IAED;;OAEG;IACH,oBAFa,OAAO,CAQnB;IAED;;OAEG;IACH,oBAFa,OAAO,CAQnB;IAED;;;;;OAKG;IACH,2BAWC;IAGD;;OAEG;IACH,cAUC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,iBACvC,MAAM,MACN,MAAM,QAUhB;IAED;;;;;OAKG;IACH,4BAJW,MAAM,SACN,MAAM,EAAE,GAAC,YAAY,gBACrB,MAAM,QAUhB;IAED;;;;;OAKG;IACH,2BAJW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,iBACvC,MAAM,MACN,MAAM,QAUhB;IAED;;;;;OAKG;IACH,wBAJW,MAAM,SACN,MAAM,EAAE,GAAC,YAAY,gBACrB,MAAM,QAUhB;IAED;;;OAGG;IACH,qBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,sBAFW,MAAM,WADN,MAAM,QAQhB;IAED;;;OAGG;IACH,sBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,uBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;OAGG;IACH,sBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,uBAFW,MAAM,SADN,MAAM,QAQhB;IAGD;;;OAGG;IACH,mBAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,WADN,MAAM,QAQhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;;;OAKG;IACH,iBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;;OAIG;IACH,eAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAOhB;IAED;;;OAGG;IACH,qBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,sBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,2BAFW,MAAM,SADN,MAAM,QAShB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,2BAFW,MAAM,SADN,MAAM,QAShB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,yBAJW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,iBACvC,MAAM,MACN,MAAM,QAUhB;IAED;;;;OAIG;IACH,sBAJW,MAAM,SACN,MAAM,EAAE,GAAC,YAAY,gBACrB,MAAM,QAShB;IAED;;;OAGG;IACH,YAFW,cAAc,QA4CxB;IAED;;;OAGG;IACH,SAFa,cAAc,CAM1B;IAIL;;;;OAIG;IACH,2BAFU,OAAO,CAEwB;CAPxC;kCAh9BiC,wBAAwB"}

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

@@ -1,5 +1,4 @@
 import { assert } from "../../../../../assert.js";
-import { array_copy } from "../../../../../collection/array/array_copy.js";
 import { BinaryElementPool } from "./BinaryElementPool.js";
 
 /**
@@ -358,7 +357,9 @@ export class BinaryTopology {
 
         const v_address = pool.element_address(id);
         const v_offset = v_address >> 2; // get 4-byte boundary
-        array_copy(pool.data_float32, v_offset, result, result_offset, 3);
+        result[result_offset] = pool.data_float32[v_offset];
+        result[result_offset + 1] = pool.data_float32[v_offset + 1];
+        result[result_offset + 2] = pool.data_float32[v_offset + 2];
     }
 
     /**
@@ -372,7 +373,9 @@ export class BinaryTopology {
 
         const v_address = pool.element_address(id);
         const v_offset = v_address >> 2; // get 4-byte boundary
-        array_copy(value, value_offset, pool.data_float32, v_offset, 3);
+        pool.data_float32[v_offset] = value[value_offset];
+        pool.data_float32[v_offset + 1] = value[value_offset + 1];
+        pool.data_float32[v_offset + 2] = value[value_offset + 2];
     }
 
     /**
@@ -386,7 +389,9 @@ export class BinaryTopology {
 
         const v_address = pool.element_address(id) + 3 * FLOAT_32_SIZE;
         const v_offset = v_address >> 2; // get 4-byte boundary
-        array_copy(pool.data_float32, v_offset, result, result_offset, 3);
+        result[result_offset] = pool.data_float32[v_offset];
+        result[result_offset + 1] = pool.data_float32[v_offset + 1];
+        result[result_offset + 2] = pool.data_float32[v_offset + 2];
     }
 
     /**
@@ -400,7 +405,9 @@ export class BinaryTopology {
 
         const v_address = pool.element_address(id) + 3 * FLOAT_32_SIZE;
         const v_offset = v_address >> 2; // get 4-byte boundary
-        array_copy(value, value_offset, pool.data_float32, v_offset, 3);
+        pool.data_float32[v_offset] = value[value_offset];
+        pool.data_float32[v_offset + 1] = value[value_offset + 1];
+        pool.data_float32[v_offset + 2] = value[value_offset + 2];
     }
 
     /**
@@ -891,7 +898,9 @@ export class BinaryTopology {
         // Offset by the first loop pointer (UINT_32_SIZE)
         const f_address = pool.element_address(id) + UINT_32_SIZE;
         const f_offset = f_address >> 2;
-        array_copy(pool.data_float32, f_offset, result, result_offset, 3);
+        result[result_offset] = pool.data_float32[f_offset];
+        result[result_offset + 1] = pool.data_float32[f_offset + 1];
+        result[result_offset + 2] = pool.data_float32[f_offset + 2];
     }
 
     /**
@@ -903,7 +912,9 @@ export class BinaryTopology {
         const pool = this.__face_pool;
         const f_address = pool.element_address(id) + UINT_32_SIZE;
         const f_offset = f_address >> 2;
-        array_copy(value, value_offset, pool.data_float32, f_offset, 3);
+        pool.data_float32[f_offset] = value[value_offset];
+        pool.data_float32[f_offset + 1] = value[value_offset + 1];
+        pool.data_float32[f_offset + 2] = value[value_offset + 2];
     }
 
     /**

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

@@ -1,9 +1,9 @@
 import { BinaryTopology } from "../BinaryTopology.js";
 import { bt_mesh_compute_face_islands } from "../query/bt_mesh_compute_face_islands.js";
-import { bt_query_edge_is_boundary } from "../query/bt_query_edge_is_boundary.js";
+import { bt_edge_is_boundary } from "../query/bt_edge_is_boundary.js";
 import { bt_mesh_from_unindexed_geometry } from "./bt_mesh_from_unindexed_geometry.js";
 import { bt_mesh_fuse_duplicate_edges } from "./edge/bt_mesh_fuse_duplicate_edges.js";
-import { bt_merge_verts_by_distance } from "./vertex/bt_merge_verts_by_distance.js";
+import { bt_merge_vertices_by_distance } from "./vertex/bt_merge_vertices_by_distance.js";
 
 /**
  * Distance under which rebuilt vertices are fused, matching the navmesh build pipeline. Bridge corner
@@ -168,7 +168,7 @@ export function bt_mesh_bridge_islands(mesh, { max_step_height, max_step_distanc
             continue;
         }
 
-        if (!bt_query_edge_is_boundary(mesh, e)) {
+        if (!bt_edge_is_boundary(mesh, e)) {
             continue;
         }
 
@@ -286,7 +286,7 @@ export function bt_mesh_bridge_islands(mesh, { max_step_height, max_step_distanc
     // connectivity, joining the bridge triangles onto the island boundaries whose vertices they share
     const rebuilt = new BinaryTopology();
     bt_mesh_from_unindexed_geometry(rebuilt, soup);
-    bt_merge_verts_by_distance(rebuilt, VERTEX_MERGE_DISTANCE);
+    bt_merge_vertices_by_distance(rebuilt, VERTEX_MERGE_DISTANCE);
     bt_mesh_fuse_duplicate_edges(rebuilt);
 
     mesh.copy(rebuilt);

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

@@ -1,7 +1,7 @@
 import { NULL_POINTER } from "../BinaryTopology.js";
 import { bt_loop_kill } from "./bt_loop_kill.js";
 import { bt_edge_kill } from "./edge/bt_edge_kill.js";
-import { bt_vert_kill } from "./vertex/bt_vert_kill.js";
+import { bt_vertex_kill } from "./vertex/bt_vertex_kill.js";
 
 /**
  * Remove vertices/edges/loops/disks etc. that are not referenced by any faces.
@@ -56,7 +56,7 @@ export function bt_mesh_cleanup_faceless_references(mesh) {
         }
 
         if (mesh.vertex_read_edge(v) === NULL_POINTER) {
-            bt_vert_kill(mesh, v);
+            bt_vertex_kill(mesh, v);
         }
     }
 }

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

@@ -1,5 +1,5 @@
 import { bt_mesh_walk_boundary_loops } from "../query/bt_mesh_walk_boundary_loops.js";
-import { bt_mesh_face_poke } from "./face/bt_face_poke.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];
@@ -128,7 +128,7 @@ export function bt_mesh_close_boundary_holes(mesh) {
 
         // Fan from centroid — adds the Steiner vertex and replaces the n-gon
         // face with n triangles.
-        bt_mesh_face_poke(mesh, new_face, cx, cy, cz);
+        bt_face_poke(mesh, new_face, cx, cy, cz);
     }
 
     return cycles.length;

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

@@ -1,5 +1,5 @@
 import { assert } from "../../../../../../assert.js";
-import { v3_compute_triangle_normal } from "../../../../triangle/v3_compute_triangle_normal.js";
+import { tri3_compute_normal } from "../../../../triangle/tri3_compute_normal.js";
 import { NULL_POINTER } from "../BinaryTopology.js";
 
 const scratch_normal = new Float32Array(3);
@@ -44,7 +44,7 @@ export function bt_mesh_compute_face_normals(mesh) {
         mesh.vertex_read_coordinate(scratch_coord_b, 0, mesh.loop_read_vertex(loop_b));
         mesh.vertex_read_coordinate(scratch_coord_c, 0, mesh.loop_read_vertex(loop_c));
 
-        v3_compute_triangle_normal(
+        tri3_compute_normal(
             scratch_normal, 0,
             scratch_coord_a[0], scratch_coord_a[1], scratch_coord_a[2],
             scratch_coord_b[0], scratch_coord_b[1], scratch_coord_b[2],

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

@@ -1,14 +1,7 @@
 /**
- * Compute a per-vertex quadric error metric from every allocated triangular face.
- *
- * For each triangular face the supporting plane (n, d) is derived from its loop
- * vertices; the corresponding quadric is then accumulated onto each of those
- * three vertices' Quadric3. Non-triangular faces are skipped.
- *
- * @param {BinaryTopology} mesh
- * @returns {Quadric3[]} Array indexed by vertex ID. Entries for unallocated
- *     vertex slots are `undefined`.
+ * @deprecated Renamed to {@link bt_mesh_compute_vertex_quadrics}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
  */
-export function bt_mesh_compute_vertex_quadratics(mesh: BinaryTopology): Quadric3[];
-import { Quadric3 } from "../../../simplify/quadratic/Quadric3.js";
+export const bt_mesh_compute_vertex_quadratics: typeof bt_mesh_compute_vertex_quadrics;
+import { bt_mesh_compute_vertex_quadrics } from "./bt_mesh_compute_vertex_quadrics.js";
 //# sourceMappingURL=bt_mesh_compute_vertex_quadratics.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_compute_vertex_quadratics.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_compute_vertex_quadratics.js"],"names":[],"mappings":"AAWA;;;;;;;;;;GAUG;AACH,yEAHa,QAAQ,EAAE,CA2EtB;yBA3FwB,yCAAyC"}
+{"version":3,"file":"bt_mesh_compute_vertex_quadratics.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_compute_vertex_quadratics.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,uFAAiF;gDANjC,sCAAsC"}

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

@@ -1,95 +1,7 @@
-import { assert } from "../../../../../../assert.js";
-import { v3_dot } from "../../../../../vec3/v3_dot.js";
-import { v3_compute_triangle_normal } from "../../../../triangle/v3_compute_triangle_normal.js";
-import { Quadric3 } from "../../../simplify/quadratic/Quadric3.js";
-import { NULL_POINTER } from "../BinaryTopology.js";
-
-const scratch_coord_a = new Float32Array(3);
-const scratch_coord_b = new Float32Array(3);
-const scratch_coord_c = new Float32Array(3);
-const scratch_normal = new Float32Array(3);
+import { bt_mesh_compute_vertex_quadrics } from "./bt_mesh_compute_vertex_quadrics.js";
 
 /**
- * Compute a per-vertex quadric error metric from every allocated triangular face.
- *
- * For each triangular face the supporting plane (n, d) is derived from its loop
- * vertices; the corresponding quadric is then accumulated onto each of those
- * three vertices' Quadric3. Non-triangular faces are skipped.
- *
- * @param {BinaryTopology} mesh
- * @returns {Quadric3[]} Array indexed by vertex ID. Entries for unallocated
- *     vertex slots are `undefined`.
+ * @deprecated Renamed to {@link bt_mesh_compute_vertex_quadrics}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
  */
-export function bt_mesh_compute_vertex_quadratics(mesh) {
-    assert.defined(mesh, 'mesh');
-    assert.notNull(mesh, 'mesh');
-
-    const vertex_pool = mesh.vertices;
-    const vertex_count = vertex_pool.size;
-
-    const quadratics = new Array(vertex_count);
-
-    for (let v = 0; v < vertex_count; v++) {
-        if (vertex_pool.is_allocated(v)) {
-            quadratics[v] = new Quadric3();
-        }
-    }
-
-    const face_pool = mesh.faces;
-    const face_count = face_pool.size;
-
-    const q = new Quadric3();
-
-    for (let f = 0; f < face_count; f++) {
-        if (!face_pool.is_allocated(f)) {
-            continue;
-        }
-
-        const la = mesh.face_read_loop(f);
-
-        if (la === NULL_POINTER) {
-            continue;
-        }
-
-        const lb = mesh.loop_read_next(la);
-        const lc = mesh.loop_read_next(lb);
-
-        // Skip non-triangles
-        if (mesh.loop_read_next(lc) !== la) {
-            continue;
-        }
-
-        const va = mesh.loop_read_vertex(la);
-        const vb = mesh.loop_read_vertex(lb);
-        const vc = mesh.loop_read_vertex(lc);
-
-        mesh.vertex_read_coordinate(scratch_coord_a, 0, va);
-        mesh.vertex_read_coordinate(scratch_coord_b, 0, vb);
-        mesh.vertex_read_coordinate(scratch_coord_c, 0, vc);
-
-        v3_compute_triangle_normal(
-            scratch_normal, 0,
-            scratch_coord_a[0], scratch_coord_a[1], scratch_coord_a[2],
-            scratch_coord_b[0], scratch_coord_b[1], scratch_coord_b[2],
-            scratch_coord_c[0], scratch_coord_c[1], scratch_coord_c[2]
-        );
-
-        const nx = scratch_normal[0];
-        const ny = scratch_normal[1];
-        const nz = scratch_normal[2];
-
-        // Plane offset: d = -(n . v_a)
-        const d = -v3_dot(
-            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);
-    }
-
-    return quadratics;
-}
+export const bt_mesh_compute_vertex_quadratics = bt_mesh_compute_vertex_quadrics;

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

@@ -0,0 +1,14 @@
+/**
+ * Compute a per-vertex quadric error metric from every allocated triangular face.
+ *
+ * For each triangular face the supporting plane (n, d) is derived from its loop
+ * vertices; the corresponding quadric is then accumulated onto each of those
+ * three vertices' Quadric3. Non-triangular faces are skipped.
+ *
+ * @param {BinaryTopology} mesh
+ * @returns {Quadric3[]} Array indexed by vertex ID. Entries for unallocated
+ *     vertex slots are `undefined`.
+ */
+export function bt_mesh_compute_vertex_quadrics(mesh: BinaryTopology): Quadric3[];
+import { Quadric3 } from "../../../simplify/quadratic/Quadric3.js";
+//# sourceMappingURL=bt_mesh_compute_vertex_quadrics.d.ts.map

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

@@ -0,0 +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"}

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

@@ -0,0 +1,95 @@
+import { assert } from "../../../../../../assert.js";
+import { v3_dot } from "../../../../../vec3/v3_dot.js";
+import { tri3_compute_normal } from "../../../../triangle/tri3_compute_normal.js";
+import { Quadric3 } from "../../../simplify/quadratic/Quadric3.js";
+import { NULL_POINTER } from "../BinaryTopology.js";
+
+const scratch_coord_a = new Float32Array(3);
+const scratch_coord_b = new Float32Array(3);
+const scratch_coord_c = new Float32Array(3);
+const scratch_normal = new Float32Array(3);
+
+/**
+ * Compute a per-vertex quadric error metric from every allocated triangular face.
+ *
+ * For each triangular face the supporting plane (n, d) is derived from its loop
+ * vertices; the corresponding quadric is then accumulated onto each of those
+ * three vertices' Quadric3. Non-triangular faces are skipped.
+ *
+ * @param {BinaryTopology} mesh
+ * @returns {Quadric3[]} Array indexed by vertex ID. Entries for unallocated
+ *     vertex slots are `undefined`.
+ */
+export function bt_mesh_compute_vertex_quadrics(mesh) {
+    assert.defined(mesh, 'mesh');
+    assert.notNull(mesh, 'mesh');
+
+    const vertex_pool = mesh.vertices;
+    const vertex_count = vertex_pool.size;
+
+    const quadratics = new Array(vertex_count);
+
+    for (let v = 0; v < vertex_count; v++) {
+        if (vertex_pool.is_allocated(v)) {
+            quadratics[v] = new Quadric3();
+        }
+    }
+
+    const face_pool = mesh.faces;
+    const face_count = face_pool.size;
+
+    const q = new Quadric3();
+
+    for (let f = 0; f < face_count; f++) {
+        if (!face_pool.is_allocated(f)) {
+            continue;
+        }
+
+        const la = mesh.face_read_loop(f);
+
+        if (la === NULL_POINTER) {
+            continue;
+        }
+
+        const lb = mesh.loop_read_next(la);
+        const lc = mesh.loop_read_next(lb);
+
+        // Skip non-triangles
+        if (mesh.loop_read_next(lc) !== la) {
+            continue;
+        }
+
+        const va = mesh.loop_read_vertex(la);
+        const vb = mesh.loop_read_vertex(lb);
+        const vc = mesh.loop_read_vertex(lc);
+
+        mesh.vertex_read_coordinate(scratch_coord_a, 0, va);
+        mesh.vertex_read_coordinate(scratch_coord_b, 0, vb);
+        mesh.vertex_read_coordinate(scratch_coord_c, 0, vc);
+
+        tri3_compute_normal(
+            scratch_normal, 0,
+            scratch_coord_a[0], scratch_coord_a[1], scratch_coord_a[2],
+            scratch_coord_b[0], scratch_coord_b[1], scratch_coord_b[2],
+            scratch_coord_c[0], scratch_coord_c[1], scratch_coord_c[2]
+        );
+
+        const nx = scratch_normal[0];
+        const ny = scratch_normal[1];
+        const nz = scratch_normal[2];
+
+        // Plane offset: d = -(n . v_a)
+        const d = -v3_dot(
+            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);
+    }
+
+    return quadratics;
+}

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

@@ -1,4 +1,4 @@
-import { bt_face_get_attached_faces } from "../query/bt_face_get_attached_faces.js";
+import { bt_face_get_vertex_adjacent_faces } from "../query/bt_face_get_vertex_adjacent_faces.js";
 import { bt_mesh_face_decouple } from "./bt_mesh_face_decouple.js";
 
 /**
@@ -83,7 +83,7 @@ export function bt_mesh_face_decouple_islands(mesh, islands) {
 
         const island_id = face_to_islands.get(face);
 
-        const attached_count = bt_face_get_attached_faces(other_faces, 0, mesh, face);
+        const attached_count = bt_face_get_vertex_adjacent_faces(other_faces, 0, mesh, face);
 
         for (let j = 0; j < attached_count; j++) {
             const attached_face = other_faces[j];

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

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_face_island_erode.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_face_island_erode.js"],"names":[],"mappings":"AAoBA;;;;;;;;;;;;GAYG;AACH,uEAHW,MAAM,EAAE,kBACR,MAAM,QAqbhB"}
+{"version":3,"file":"bt_mesh_face_island_erode.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_face_island_erode.js"],"names":[],"mappings":"AAkBA;;;;;;;;;;;;GAYG;AACH,uEAHW,MAAM,EAAE,kBACR,MAAM,QAqbhB"}

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

@@ -8,15 +8,13 @@ import { NULL_POINTER } from "../BinaryTopology.js";
 import { BitSet } from "../../../../../../binary/BitSet.js";
 import { bt_face_get_incenter } from "../query/bt_face_get_incenter.js";
 import { bt_face_island_flood_fill } from "../query/bt_face_island_flood_fill.js";
-import {
-    bt_collect_boundary_segments,
-    bt_point_distance_to_segments,
-    bt_mesh_build_boundary_euclidean_distance_field
-} from "../query/bt_mesh_build_boundary_euclidean_distance_field.js";
+import { bt_collect_boundary_segments } from "../query/bt_collect_boundary_segments.js";
+import { segment3_point_distance_to_segments } from "../../../../line/segment3_point_distance_to_segments.js";
+import { bt_mesh_build_boundary_euclidean_distance_field } from "../query/bt_mesh_build_boundary_euclidean_distance_field.js";
 import { bt_mesh_cleanup_faceless_references } from "./bt_mesh_cleanup_faceless_references.js";
 import { bt_edge_split } from "./edge/bt_edge_split.js";
 import { bt_face_kill } from "./face/bt_face_kill.js";
-import { bt_mesh_face_poke } from "./face/bt_face_poke.js";
+import { bt_face_poke } from "./face/bt_face_poke.js";
 
 /**
  * Shrinks an island of faces by a given distance.
@@ -259,7 +257,7 @@ export function bt_mesh_face_island_erode(
 
                 if (crossings === 2) {
                     mx *= 0.5; my *= 0.5; mz *= 0.5;
-                    const true_d = bt_point_distance_to_segments(boundary_segments, mx, my, mz);
+                    const true_d = segment3_point_distance_to_segments(boundary_segments, mx, my, mz);
                     if (Math.abs(true_d - erode_distance) <= tol) {
                         // the straight cut here is already accurate - leave this face coarse
                         continue;
@@ -358,7 +356,7 @@ export function bt_mesh_face_island_erode(
             // the interpolated field. We only rescue faces touching the boundary that collapsed.
             if (min_dist !== Infinity && min_dist > erode_distance) {
                 // RESCUE: the center is safe - poke the face to create a vertex at the incenter.
-                const new_vert = bt_mesh_face_poke(mesh, f, centroid[0], centroid[1], centroid[2]);
+                const new_vert = bt_face_poke(mesh, f, centroid[0], centroid[1], centroid[2]);
 
                 island_vertices.add(new_vert);
                 vertex_boundary_distances.set(new_vert, min_dist);

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

@@ -1,5 +1,5 @@
 import { bt_mesh_walk_boundary_loops } from "../query/bt_mesh_walk_boundary_loops.js";
-import { bt_mesh_face_poke } from "./face/bt_face_poke.js";
+import { bt_face_poke } from "./face/bt_face_poke.js";
 import { bt_radial_loop_add } from "./bt_radial_loop_add.js";
 
 const _c = [0, 0, 0];
@@ -90,7 +90,7 @@ function fill_loop(mesh, cycle) {
         mesh.loop_write_prev(loops[i], loops[(i - 1 + n) % n]);
     }
     mesh.face_write_loop(new_face, loops[0]);
-    bt_mesh_face_poke(mesh, new_face, cx, cy, cz);
+    bt_face_poke(mesh, new_face, cx, cy, cz);
 }
 
 /**

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

@@ -11,6 +11,12 @@
  * Call AFTER an initial vertex-merge/edge-fuse, then merge + fuse again so the new split vertices weld
  * onto the T-junction vertices and the resulting duplicate edges fuse.
  *
+ * A BVH over the vertices replaces the naive all-vertices-per-edge scan: for each boundary edge we
+ * query only the vertices within the tolerance of the edge segment (a capsule), which IS the on-edge
+ * region, so no separate per-candidate distance test is needed. The BVH is built ONCE -- every split
+ * adds a vertex snapped exactly onto an existing one's position, so no candidate position is ever
+ * missing from the original leaf set, and the tree never needs rebuilding as edges split.
+ *
  * @param {BinaryTopology} mesh
  * @param {number} [tolerance] max distance from a vertex to an edge for it to count as "on" the edge
  * @returns {number} number of splits performed