@woosh/meep-engine 2.163.11 → 2.165.0

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

@@ -3,13 +3,13 @@ import { Uint32Heap } from "../../../../../../collection/heap/Uint32Heap.js";
 import { Quadric3 } from "../../../simplify/quadratic/Quadric3.js";
 import { NULL_POINTER } from "../BinaryTopology.js";
 import { bt_loop_kill } from "./bt_loop_kill.js";
-import { bt_mesh_compute_vertex_quadratics } from "./bt_mesh_compute_vertex_quadratics.js";
+import { bt_mesh_compute_vertex_quadrics } from "./bt_mesh_compute_vertex_quadrics.js";
 import { bt_edge_collapse } from "./edge/bt_edge_collapse.js";
 import { bt_edge_kill } from "./edge/bt_edge_kill.js";
 import { bt_edge_kill_parallels } from "./edge/bt_edge_kill_parallels.js";
 import { bt_edge_swap_vertex_slots } from "./edge/bt_edge_swap_vertex_slots.js";
-import { bt_vert_fuse_duplicate_edges } from "./vertex/bt_vert_fuse_duplicate_edges.js";
-import { bt_vert_kill } from "./vertex/bt_vert_kill.js";
+import { bt_vertex_fuse_duplicate_edges } from "./vertex/bt_vertex_fuse_duplicate_edges.js";
+import { bt_vertex_kill } from "./vertex/bt_vertex_kill.js";
 
 // Module-level scratch buffers to keep GC pressure low across calls.
 const scratch_coord_a = new Float32Array(3);
@@ -196,7 +196,7 @@ export function bt_mesh_simplify(
         return;
     }
 
-    const quadratics = bt_mesh_compute_vertex_quadratics(mesh);
+    const quadratics = bt_mesh_compute_vertex_quadrics(mesh);
 
     const edge_pool = mesh.edges;
     const heap = new Uint32Heap(edge_pool.size);
@@ -285,7 +285,7 @@ export function bt_mesh_simplify(
         // Link-vertex parallels produced by this collapse will become direct parallels
         // at the next collapse that touches them, so fuse them now while disk cycles
         // are still intact.
-        current_face_count -= bt_vert_fuse_duplicate_edges(mesh, survivor);
+        current_face_count -= bt_vertex_fuse_duplicate_edges(mesh, survivor);
 
         update_neighbor_costs(mesh, survivor, quadratics, restricted_vertices, heap);
     }
@@ -324,7 +324,7 @@ function cleanup_faceless_preserving_restricted(mesh, restricted_vertices) {
         if (!vertex_pool.is_allocated(v)) continue;
         if (restricted_vertices.has(v)) continue;
         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_simplify_by_error.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_simplify_by_error.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_simplify_by_error.js"],"names":[],"mappings":"AA4aA;;;;;;;;;;;;;;;;GAgBG;AACH,2EAHW,MAAM,QAgHhB"}
+{"version":3,"file":"bt_mesh_simplify_by_error.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_simplify_by_error.js"],"names":[],"mappings":"AA+cA;;;;;;;;;;;;;;;;GAgBG;AACH,2EAHW,MAAM,QAgHhB"}

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

@@ -4,13 +4,13 @@ import {
     line3_compute_segment_point_distance_sqr
 } from "../../../../line/line3_compute_segment_point_distance_sqr.js";
 import { NULL_POINTER } from "../BinaryTopology.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_cleanup_faceless_references } from "./bt_mesh_cleanup_faceless_references.js";
-import { bt_mesh_compute_vertex_quadratics } from "./bt_mesh_compute_vertex_quadratics.js";
+import { bt_mesh_compute_vertex_quadrics } from "./bt_mesh_compute_vertex_quadrics.js";
 import { bt_edge_collapse } from "./edge/bt_edge_collapse.js";
 import { bt_edge_kill_parallels } from "./edge/bt_edge_kill_parallels.js";
 import { bt_edge_swap_vertex_slots } from "./edge/bt_edge_swap_vertex_slots.js";
-import { bt_vert_fuse_duplicate_edges } from "./vertex/bt_vert_fuse_duplicate_edges.js";
+import { bt_vertex_fuse_duplicate_edges } from "./vertex/bt_vertex_fuse_duplicate_edges.js";
 
 // Module-level scratch to keep the hot loop allocation-free.
 const _pos_a = new Float32Array(3);
@@ -30,6 +30,16 @@ const _n_after = new Float32Array(3);
 // navigation, where a balanced low-valence mesh also searches better than a sliver fan.
 const DEGREE_SUM_CAP = 24;
 
+// Maximum turn angle at a boundary vertex (between its two incident boundary edges) for that vertex
+// to be removable. The eps *distance* gate alone is local -- it only bounds how far one collapse
+// moves the outline -- so a run of individually-shallow collapses accumulates into a visibly bent
+// silhouette (a rounded convex corner gets cut into a chord that pulls inward, i.e. a concavity).
+// Requiring each removed boundary vertex to be near-collinear preserves the outline's SHAPE, not just
+// its position: a straight eroded run (~0 turn) still collapses, a real corner / arc vertex (degrees
+// of turn) never does. Scale-invariant, so it is independent of eps.
+const MAX_BOUNDARY_TURN_RADIANS = 1 * Math.PI / 180; // ~1 degree
+const MIN_BOUNDARY_COLLINEAR_COS = Math.cos(MAX_BOUNDARY_TURN_RADIANS);
+
 // Per-vertex degree and boundary-membership caches, kept in plain typed arrays so choose_collapse
 // reads them in O(1) instead of disk-walking on every call (BinaryTopology accessors go through a
 // DataView, which is comparatively slow, and choose_collapse runs far more often than collapses do).
@@ -66,7 +76,7 @@ function recompute_vertex_cache(mesh, v) {
     do {
         n++;
 
-        if (bnd === 0 && bt_query_edge_is_boundary(mesh, e)) {
+        if (bnd === 0 && bt_edge_is_boundary(mesh, e)) {
             bnd = 1;
         }
 
@@ -105,7 +115,7 @@ function other_boundary_neighbor(mesh, v, exclude_edge) {
     let count = 0;
 
     do {
-        if (e !== exclude_edge && bt_query_edge_is_boundary(mesh, e)) {
+        if (e !== exclude_edge && bt_edge_is_boundary(mesh, e)) {
             count++;
             const v1 = mesh.edge_read_vertex1(e);
             const v2 = mesh.edge_read_vertex2(e);
@@ -150,6 +160,29 @@ function quadric_cost_at(q_survivor, q_victim, tx, ty, tz) {
     return q_survivor.evaluate(tx, ty, tz) + q_victim.evaluate(tx, ty, tz);
 }
 
+/**
+ * Cosine of the turn angle at boundary vertex `v` between its two boundary neighbours `a` and `w` --
+ * the angle between the incoming edge a->v and the outgoing edge v->w. 1 = perfectly straight, -1 = a
+ * full reversal (a spike). Degenerate (zero-length) incident edges report 1 (treated as straight).
+ *
+ * @param {Float32Array} a kept-neighbour position
+ * @param {Float32Array} v removed (victim) position
+ * @param {Float32Array} w far-neighbour position
+ * @returns {number}
+ */
+function boundary_turn_cos(a, v, w) {
+    const ix = v[0] - a[0], iy = v[1] - a[1], iz = v[2] - a[2];
+    const ox = w[0] - v[0], oy = w[1] - v[1], oz = w[2] - v[2];
+
+    const len_sq = (ix * ix + iy * iy + iz * iz) * (ox * ox + oy * oy + oz * oz);
+
+    if (len_sq <= 0) {
+        return 1;
+    }
+
+    return (ix * ox + iy * oy + iz * oz) / Math.sqrt(len_sq);
+}
+
 /**
  * Pick the best allowed collapse for edge `e` and return its quadric error. Writes the kept
  * and removed vertices into `_choice_survivor` / `_choice_victim`. Returns POSITIVE_INFINITY
@@ -202,7 +235,7 @@ function choose_collapse(mesh, e, quadratics, eps) {
     let best_survivor = NULL_POINTER;
     let best_victim = NULL_POINTER;
 
-    if (bt_query_edge_is_boundary(mesh, e)) {
+    if (bt_edge_is_boundary(mesh, e)) {
         // Boundary edge: both endpoints are boundary vertices. Removing a vertex replaces the two
         // boundary edges meeting at it with the single segment between its two boundary neighbours,
         // so the outline shifts by the removed vertex's distance to that *segment*. Allow the
@@ -216,12 +249,14 @@ function choose_collapse(mesh, e, quadratics, eps) {
         const w2 = other_boundary_neighbor(mesh, v2, e);
         if (w2 !== NULL_POINTER) {
             mesh.vertex_read_coordinate(_pos_c, 0, w2);
+            // angular gate: only remove a near-collinear boundary vertex, so the outline keeps its
+            // shape and small collapses can't accumulate into a visible bend (see MIN_BOUNDARY_COLLINEAR_COS)
             const dev_sqr = line3_compute_segment_point_distance_sqr(
                 _pos_a[0], _pos_a[1], _pos_a[2],
                 _pos_c[0], _pos_c[1], _pos_c[2],
                 _pos_b[0], _pos_b[1], _pos_b[2]
             );
-            if (dev_sqr <= eps_sq) {
+            if (dev_sqr <= eps_sq && boundary_turn_cos(_pos_a, _pos_b, _pos_c) >= MIN_BOUNDARY_COLLINEAR_COS) {
                 const cost = quadric_cost_at(q1, q2, _pos_a[0], _pos_a[1], _pos_a[2]);
                 if (cost < best) {
                     best = cost;
@@ -240,7 +275,7 @@ function choose_collapse(mesh, e, quadratics, eps) {
                 _pos_c[0], _pos_c[1], _pos_c[2],
                 _pos_a[0], _pos_a[1], _pos_a[2]
             );
-            if (dev_sqr <= eps_sq) {
+            if (dev_sqr <= eps_sq && boundary_turn_cos(_pos_b, _pos_a, _pos_c) >= MIN_BOUNDARY_COLLINEAR_COS) {
                 const cost = quadric_cost_at(q1, q2, _pos_b[0], _pos_b[1], _pos_b[2]);
                 if (cost < best) {
                     best = cost;
@@ -463,7 +498,7 @@ export function bt_mesh_simplify_by_error(mesh, max_error) {
         return;
     }
 
-    const quadratics = bt_mesh_compute_vertex_quadratics(mesh);
+    const quadratics = bt_mesh_compute_vertex_quadrics(mesh);
 
     // O(1) degree/boundary caches for choose_collapse, seeded once and kept current per collapse.
     const vertex_count = mesh.vertices.size;
@@ -546,7 +581,7 @@ export function bt_mesh_simplify_by_error(mesh, max_error) {
 
         bt_edge_kill_parallels(mesh, e);
         const s = bt_edge_collapse(mesh, e, _pos_target, 0);
-        bt_vert_fuse_duplicate_edges(mesh, s);
+        bt_vertex_fuse_duplicate_edges(mesh, s);
 
         requeue_ring(mesh, s, quadratics, eps, eps_sq, heap);
     }

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

@@ -1,5 +1,5 @@
 import { assert } from "../../../../../../../assert.js";
-import { bt_vert_kill } from "../vertex/bt_vert_kill.js";
+import { bt_vertex_kill } from "../vertex/bt_vertex_kill.js";
 import { bt_vertex_replace } from "../vertex/bt_vertex_replace.js";
 import { bt_edge_kill } from "./bt_edge_kill.js";
 
@@ -43,7 +43,7 @@ export function bt_edge_collapse(
     bt_vertex_replace(mesh, v_victim, v_survivor);
 
     // 3. Release the now-disconnected victim vertex.
-    bt_vert_kill(mesh, v_victim);
+    bt_vertex_kill(mesh, v_victim);
 
     // 4. Move the survivor to the requested position.
     mesh.vertex_write_coordinate(v_survivor, new_position, new_position_offset);

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

@@ -1,3 +1,17 @@
+/**
+ * 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_face_poke(mesh: BinaryTopology, face_id: number, x: number, y: number, z: number): number;
 /**
  * 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.

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,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":"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"}

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

@@ -17,7 +17,7 @@ const normal = new Float32Array(3);
  * @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(
+export function bt_face_poke(
     mesh,
     face_id,
     x, y, z
@@ -149,4 +149,8 @@ function _link_loop_to_edge_local(mesh, loop_id, edge_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).
+ */
+export const bt_mesh_face_poke = bt_face_poke;

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

@@ -1,7 +1,7 @@
 /**
- *
- * @param {BinaryTopology} mesh
- * @param {number} v
+ * @deprecated Renamed to {@link bt_vertex_kill_only}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
  */
-export function bt_kill_only_vert(mesh: BinaryTopology, v: number): void;
+export const bt_kill_only_vert: typeof bt_vertex_kill_only;
+import { bt_vertex_kill_only } from "./bt_vertex_kill_only.js";
 //# sourceMappingURL=bt_kill_only_vert.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"bt_kill_only_vert.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/vertex/bt_kill_only_vert.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,2DAFW,MAAM,QAIhB"}
+{"version":3,"file":"bt_kill_only_vert.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/vertex/bt_kill_only_vert.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,2DAAqD;oCANjB,0BAA0B"}

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

@@ -1,8 +1,7 @@
-/**
- *
- * @param {BinaryTopology} mesh
- * @param {number} v
- */
-export function bt_kill_only_vert(mesh, v) {
-    mesh.vertices.release(v);
-}
+import { bt_vertex_kill_only } from "./bt_vertex_kill_only.js";
+
+/**
+ * @deprecated Renamed to {@link bt_vertex_kill_only}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
+ */
+export const bt_kill_only_vert = bt_vertex_kill_only;

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

@@ -0,0 +1,10 @@
+/**
+ * Only considers distance, no other attributes are accounted for.
+ * Performs operation in-place. Note that the duplicate vertices are not removed from the mesh itself, they are still present but are not linked to anything.
+ * You typically want to perform a cleanup phase afterward to remove such unliked vertices.
+ * @param {BinaryTopology} mesh
+ * @param {number} [max_distance] Inclusive distance between vertices within which we perform the merge.
+ * @returns {number} number of removed duplicate vertices
+ */
+export function bt_merge_vertices_by_distance(mesh: BinaryTopology, max_distance?: number): number;
+//# sourceMappingURL=bt_merge_vertices_by_distance.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_merge_vertices_by_distance.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/vertex/bt_merge_vertices_by_distance.js"],"names":[],"mappings":"AAUA;;;;;;;GAOG;AACH,mFAHW,MAAM,GACJ,MAAM,CAoJlB"}

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

@@ -0,0 +1,165 @@
+import { assert } from "../../../../../../../assert.js";
+import { ceilPowerOfTwo } from "../../../../../../../binary/operations/ceilPowerOfTwo.js";
+import {
+    generate_next_linear_congruential_index
+} from "../../../../../../../collection/map/generate_next_linear_congruential_index.js";
+import { lowbias32 } from "../../../../../../../math/hash/lowbias32.js";
+import { v3_distance_sqr } from "../../../../../../vec3/v3_distance_sqr.js";
+import { NULL_POINTER } from "../../BinaryTopology.js";
+import { bt_vertex_replace } from "./bt_vertex_replace.js";
+
+/**
+ * Only considers distance, no other attributes are accounted for.
+ * Performs operation in-place. Note that the duplicate vertices are not removed from the mesh itself, they are still present but are not linked to anything.
+ * You typically want to perform a cleanup phase afterward to remove such unliked vertices.
+ * @param {BinaryTopology} mesh
+ * @param {number} [max_distance] Inclusive distance between vertices within which we perform the merge.
+ * @returns {number} number of removed duplicate vertices
+ */
+export function bt_merge_vertices_by_distance(
+    mesh,
+    max_distance = 0.0001
+) {
+
+    assert.defined(mesh, "mesh");
+    assert.greaterThan(max_distance, 0, "max_distance must be greater than 0");
+
+    assert.defined(mesh, "mesh");
+    assert.greaterThan(max_distance, 0, "max_distance must be greater than 0");
+
+    const max_distance2 = max_distance * max_distance;
+    const grid_cell_size = max_distance + 1e-10;
+
+    /**
+     * Hashes pre-quantized integer cell coordinates
+     * @param {number} cx
+     * @param {number} cy
+     * @param {number} cz
+     * @returns {number}
+     */
+    function hash_int3(cx, cy, cz) {
+        const hx = lowbias32(cx);
+        const hy = lowbias32(cy);
+        const hz = lowbias32(cz);
+
+        return lowbias32(
+            hx
+            ^ Math.imul(hy, 73856093)
+            ^ Math.imul(hz, 19349663)
+        );
+    }
+
+    const vertices = mesh.vertices;
+    const vertex_count = vertices.size;
+
+    const grid_bin_count = ceilPowerOfTwo(Math.max(32, Math.ceil(vertex_count * 1.2)));
+    const grid_bin_mask = grid_bin_count - 1;
+
+    const vertex_grid = new Uint32Array(grid_bin_count);
+    vertex_grid.fill(NULL_POINTER);
+
+    const scratch_vertex1 = new Float32Array(3);
+
+    /**
+     * @param {number} x Original float coordinate
+     * @param {number} y Original float coordinate
+     * @param {number} z Original float coordinate
+     * @param {number} initial_bin Start index for probing
+     * @returns {number}
+     */
+    function hash_grid_get(x, y, z, initial_bin) {
+        let bin_index = initial_bin;
+
+        for (;;) {
+            const entry = vertex_grid[bin_index];
+
+            if (entry === NULL_POINTER) {
+                return NULL_POINTER;
+            }
+
+            mesh.vertex_read_coordinate(scratch_vertex1, 0, entry);
+
+            const d2 = v3_distance_sqr(
+                x, y, z,
+                scratch_vertex1[0], scratch_vertex1[1], scratch_vertex1[2],
+            );
+
+            if (d2 <= max_distance2) {
+                return entry;
+            }
+
+            bin_index = generate_next_linear_congruential_index(bin_index, grid_bin_mask);
+        }
+    }
+
+    /**
+     * @param {number} vertex
+     * @param {number} initial_bin
+     */
+    function hash_grid_set(vertex, initial_bin) {
+        let bin_index = initial_bin;
+
+        for (;;) {
+            const entry = vertex_grid[bin_index];
+
+            if (entry === NULL_POINTER) {
+                vertex_grid[bin_index] = vertex;
+                return;
+            }
+
+            bin_index = generate_next_linear_congruential_index(bin_index, grid_bin_mask);
+        }
+    }
+
+    let removed_count = 0;
+    const scratch_vertex = new Float32Array(3);
+
+    for (let vertex = 0; vertex < vertex_count; vertex++) {
+        if (vertices.is_allocated(vertex) === false) {
+            continue;
+        }
+
+        mesh.vertex_read_coordinate(scratch_vertex, 0, vertex);
+
+        const _x = scratch_vertex[0];
+        const _y = scratch_vertex[1];
+        const _z = scratch_vertex[2];
+
+        // 1. Calculate the base integer cell coordinates
+        const cx = Math.floor(_x / grid_cell_size) | 0;
+        const cy = Math.floor(_y / grid_cell_size) | 0;
+        const cz = Math.floor(_z / grid_cell_size) | 0;
+
+        const initial_bin = hash_int3(cx, cy, cz) & grid_bin_mask;
+        let master_vertex = hash_grid_get(_x, _y, _z, initial_bin);
+
+        // 2. Check NULL_POINTER instead of undefined
+        if (master_vertex === NULL_POINTER) {
+
+            // 3. Search integer neighbors
+            search_loop: for (let iz = -1; iz <= 1; iz++) {
+                for (let iy = -1; iy <= 1; iy++) {
+                    for (let ix = -1; ix <= 1; ix++) {
+                        if (iz === 0 && iy === 0 && ix === 0) continue;
+
+                        const _bin = hash_int3(cx + ix, cy + iy, cz + iz) & grid_bin_mask;
+                        master_vertex = hash_grid_get(_x, _y, _z, _bin);
+
+                        if (master_vertex !== NULL_POINTER) {
+                            break search_loop;
+                        }
+                    }
+                }
+            }
+        }
+
+        if (master_vertex === NULL_POINTER) {
+            hash_grid_set(vertex, initial_bin);
+        } else {
+            bt_vertex_replace(mesh, vertex, master_vertex);
+            removed_count++;
+        }
+    }
+
+    return removed_count;
+}

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

@@ -1,10 +1,7 @@
 /**
- * Only considers distance, no other attributes are accounted for.
- * Performs operation in-place. Note that the duplicate vertices are not removed from the mesh itself, they are still present but are not linked to anything.
- * You typically want to perform a cleanup phase afterward to remove such unliked vertices.
- * @param {BinaryTopology} mesh
- * @param {number} [max_distance] Inclusive distance between vertices within which we perform the merge.
- * @returns {number} number of removed duplicate vertices
+ * @deprecated Renamed to {@link bt_merge_vertices_by_distance}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
  */
-export function bt_merge_verts_by_distance(mesh: BinaryTopology, max_distance?: number): number;
+export const bt_merge_verts_by_distance: typeof bt_merge_vertices_by_distance;
+import { bt_merge_vertices_by_distance } from "./bt_merge_vertices_by_distance.js";
 //# sourceMappingURL=bt_merge_verts_by_distance.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"bt_merge_verts_by_distance.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/vertex/bt_merge_verts_by_distance.js"],"names":[],"mappings":"AAUA;;;;;;;GAOG;AACH,gFAHW,MAAM,GACJ,MAAM,CAoJlB"}
+{"version":3,"file":"bt_merge_verts_by_distance.d.ts","sourceRoot":"","sources":["../../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/vertex/bt_merge_verts_by_distance.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,8EAAwE;8CAN1B,oCAAoC"}

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

@@ -1,165 +1,7 @@
-import { assert } from "../../../../../../../assert.js";
-import { ceilPowerOfTwo } from "../../../../../../../binary/operations/ceilPowerOfTwo.js";
-import {
-    generate_next_linear_congruential_index
-} from "../../../../../../../collection/map/generate_next_linear_congruential_index.js";
-import { lowbias32 } from "../../../../../../../math/hash/lowbias32.js";
-import { v3_distance_sqr } from "../../../../../../vec3/v3_distance_sqr.js";
-import { NULL_POINTER } from "../../BinaryTopology.js";
-import { bt_vertex_replace } from "./bt_vertex_replace.js";
-
-/**
- * Only considers distance, no other attributes are accounted for.
- * Performs operation in-place. Note that the duplicate vertices are not removed from the mesh itself, they are still present but are not linked to anything.
- * You typically want to perform a cleanup phase afterward to remove such unliked vertices.
- * @param {BinaryTopology} mesh
- * @param {number} [max_distance] Inclusive distance between vertices within which we perform the merge.
- * @returns {number} number of removed duplicate vertices
- */
-export function bt_merge_verts_by_distance(
-    mesh,
-    max_distance = 0.0001
-) {
-
-    assert.defined(mesh, "mesh");
-    assert.greaterThan(max_distance, 0, "max_distance must be greater than 0");
-
-    assert.defined(mesh, "mesh");
-    assert.greaterThan(max_distance, 0, "max_distance must be greater than 0");
-
-    const max_distance2 = max_distance * max_distance;
-    const grid_cell_size = max_distance + 1e-10;
-
-    /**
-     * Hashes pre-quantized integer cell coordinates
-     * @param {number} cx
-     * @param {number} cy
-     * @param {number} cz
-     * @returns {number}
-     */
-    function hash_int3(cx, cy, cz) {
-        const hx = lowbias32(cx);
-        const hy = lowbias32(cy);
-        const hz = lowbias32(cz);
-
-        return lowbias32(
-            hx
-            ^ Math.imul(hy, 73856093)
-            ^ Math.imul(hz, 19349663)
-        );
-    }
-
-    const vertices = mesh.vertices;
-    const vertex_count = vertices.size;
-
-    const grid_bin_count = ceilPowerOfTwo(Math.max(32, Math.ceil(vertex_count * 1.2)));
-    const grid_bin_mask = grid_bin_count - 1;
-
-    const vertex_grid = new Uint32Array(grid_bin_count);
-    vertex_grid.fill(NULL_POINTER);
-
-    const scratch_vertex1 = new Float32Array(3);
-
-    /**
-     * @param {number} x Original float coordinate
-     * @param {number} y Original float coordinate
-     * @param {number} z Original float coordinate
-     * @param {number} initial_bin Start index for probing
-     * @returns {number}
-     */
-    function hash_grid_get(x, y, z, initial_bin) {
-        let bin_index = initial_bin;
-
-        for (;;) {
-            const entry = vertex_grid[bin_index];
-
-            if (entry === NULL_POINTER) {
-                return NULL_POINTER;
-            }
-
-            mesh.vertex_read_coordinate(scratch_vertex1, 0, entry);
-
-            const d2 = v3_distance_sqr(
-                x, y, z,
-                scratch_vertex1[0], scratch_vertex1[1], scratch_vertex1[2],
-            );
-
-            if (d2 <= max_distance2) {
-                return entry;
-            }
-
-            bin_index = generate_next_linear_congruential_index(bin_index, grid_bin_mask);
-        }
-    }
-
-    /**
-     * @param {number} vertex
-     * @param {number} initial_bin
-     */
-    function hash_grid_set(vertex, initial_bin) {
-        let bin_index = initial_bin;
-
-        for (;;) {
-            const entry = vertex_grid[bin_index];
-
-            if (entry === NULL_POINTER) {
-                vertex_grid[bin_index] = vertex;
-                return;
-            }
-
-            bin_index = generate_next_linear_congruential_index(bin_index, grid_bin_mask);
-        }
-    }
-
-    let removed_count = 0;
-    const scratch_vertex = new Float32Array(3);
-
-    for (let vertex = 0; vertex < vertex_count; vertex++) {
-        if (vertices.is_allocated(vertex) === false) {
-            continue;
-        }
-
-        mesh.vertex_read_coordinate(scratch_vertex, 0, vertex);
-
-        const _x = scratch_vertex[0];
-        const _y = scratch_vertex[1];
-        const _z = scratch_vertex[2];
-
-        // 1. Calculate the base integer cell coordinates
-        const cx = Math.floor(_x / grid_cell_size) | 0;
-        const cy = Math.floor(_y / grid_cell_size) | 0;
-        const cz = Math.floor(_z / grid_cell_size) | 0;
-
-        const initial_bin = hash_int3(cx, cy, cz) & grid_bin_mask;
-        let master_vertex = hash_grid_get(_x, _y, _z, initial_bin);
-
-        // 2. Check NULL_POINTER instead of undefined
-        if (master_vertex === NULL_POINTER) {
-
-            // 3. Search integer neighbors
-            search_loop: for (let iz = -1; iz <= 1; iz++) {
-                for (let iy = -1; iy <= 1; iy++) {
-                    for (let ix = -1; ix <= 1; ix++) {
-                        if (iz === 0 && iy === 0 && ix === 0) continue;
-
-                        const _bin = hash_int3(cx + ix, cy + iy, cz + iz) & grid_bin_mask;
-                        master_vertex = hash_grid_get(_x, _y, _z, _bin);
-
-                        if (master_vertex !== NULL_POINTER) {
-                            break search_loop;
-                        }
-                    }
-                }
-            }
-        }
-
-        if (master_vertex === NULL_POINTER) {
-            hash_grid_set(vertex, initial_bin);
-        } else {
-            bt_vertex_replace(mesh, vertex, master_vertex);
-            removed_count++;
-        }
-    }
-
-    return removed_count;
-}
+import { bt_merge_vertices_by_distance } from "./bt_merge_vertices_by_distance.js";
+
+/**
+ * @deprecated Renamed to {@link bt_merge_vertices_by_distance}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
+ */
+export const bt_merge_verts_by_distance = bt_merge_vertices_by_distance;