@woosh/meep-engine 3.55.0 → 3.57.0

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

@@ -1,171 +1,156 @@
-import { IndexedFloatMinHeap } from "../../../../../../collection/heap/IndexedFloatMinHeap.js";
-import { NULL_POINTER } from "../BinaryTopology.js";
-import { bt_mesh_compute_edge_distance_eikonal } from "./bt_mesh_compute_edge_distance_eikonal.js";
-
-/**
- * Relax `vertex` to `distance`, admitting it to the frontier if it is not already on it.
- *
- * One call on a queue that answers `contains` by scanning; two on one that keeps an index,
- * because the index is what makes the question cheap enough to ask separately.
- *
- * @param {IndexedFloatMinHeap} heap
- * @param {number} vertex
- * @param {number} distance
- */
-function relax(heap, vertex, distance) {
-    if (heap.contains(vertex)) {
-        heap.update(vertex, distance);
-    } else {
-        heap.insert(vertex, distance);
-    }
-}
-
-/**
- * Build distance field for a given island (group of faces).
- * Distances are calculated as shortest from the boundary.
- *
- * Distances are the shortest distances from the boundary along the mesh.
- * Only the island vertices are considered.
- *
- * Unreachable vertices are marked with Infinity distance.
- * @param {Map<number, number>} vertex_boundary_distances Mapping from vertex ID to distance from boundary. The result is stored here.
- * @param {BinaryTopology} mesh
- * @param {Set<number>} island_vertices
- * @param {Set<number>} boundary_vertices Subset of island_vertices that are on the boundary.
- */
-export function bt_mesh_build_boundary_distance_field(
-    vertex_boundary_distances,
-    mesh,
-    island_vertices,
-    boundary_vertices
-) {
-
-    // Keyed by vertex id, so the index spans the vertex pool — `island_vertices.size` is a
-    // cardinality, and only ever sized the allocation, which is what it still does here.
-    const heap = new IndexedFloatMinHeap(mesh.vertices.size, island_vertices.size);
-
-    // initialize distances
-    for (const v of island_vertices) {
-        if (boundary_vertices.has(v)) {
-            vertex_boundary_distances.set(v, 0);
-            heap.insert(v, 0);
-        } else {
-            vertex_boundary_distances.set(v, Infinity);
-        }
-    }
-
-    const scratch_vertex = new Float32Array(3);
-
-    while (heap.size !== 0) {
-        const current_vertex = heap.pop_min();
-        const current_distance = vertex_boundary_distances.get(current_vertex);
-
-        // Traverse disk cycle to get neighboring edges
-        const e_first = mesh.vertex_read_edge(current_vertex);
-        if (e_first === NULL_POINTER) {
-            continue;
-        }
-
-        let e_curr = e_first;
-        do {
-            const v1 = mesh.edge_read_vertex1(e_curr);
-            const v2 = mesh.edge_read_vertex2(e_curr);
-
-            const is_v1 = v1 === current_vertex;
-            const v_other = is_v1 ? v2 : v1;
-
-            // ---------------------------------------------------------
-            // STEP A: Vertex Update (Dijkstra Fallback)
-            // ---------------------------------------------------------
-            // We must attempt to update the neighbor (v_other) directly from current_vertex.
-            // This ensures that 'v_other' gets a valid distance (if it was Infinity),
-            // allowing the subsequent Eikonal step to have a valid edge to propagate from.
-
-            // 1. Read coordinates to compute edge length
-            mesh.vertex_read_coordinate(scratch_vertex, 0, current_vertex);
-            const cx = scratch_vertex[0];
-            const cy = scratch_vertex[1];
-            const cz = scratch_vertex[2];
-
-            mesh.vertex_read_coordinate(scratch_vertex, 0, v_other);
-            const ox = scratch_vertex[0];
-            const oy = scratch_vertex[1];
-            const oz = scratch_vertex[2];
-
-            const edge_len = Math.hypot(cx - ox, cy - oy, cz - oz);
-            const new_neighbor_dist = current_distance + edge_len;
-
-            let other_distance = vertex_boundary_distances.get(v_other);
-
-            // Update v_other if the direct edge path is shorter than what it currently has
-            if (new_neighbor_dist < other_distance) {
-                vertex_boundary_distances.set(v_other, new_neighbor_dist);
-                relax(heap, v_other, new_neighbor_dist);
-                // Update local variable so STEP B uses the tighter bound immediately
-                other_distance = new_neighbor_dist;
-            }
-
-            // ---------------------------------------------------------
-            // STEP B: Edge Update (Eikonal)
-            // ---------------------------------------------------------
-            // Now that we've ensured v_other is as up-to-date as possible,
-            // we check if we can form a valid front (edge) to update the triangle's 3rd vertex.
-
-            if (other_distance !== undefined && other_distance !== Infinity) {
-
-                // Find the faces (triangles) sharing this edge using the radial cycle
-                const l_first = mesh.edge_read_loop(e_curr);
-
-                if (l_first !== NULL_POINTER) {
-                    let l_curr = l_first;
-                    do {
-                        const face = mesh.loop_read_face(l_curr);
-
-                        // Find the 3rd "target" vertex of this triangular face
-                        let fl = mesh.face_read_loop(face);
-                        let v_target = -1;
-
-
-                        // TODO assert the 3-vertex assumption
-
-                        // Iterate max 3 times (explicitly assuming faces are triangles)
-                        for (let i = 0; i < 3; i++) {
-                            const fv = mesh.loop_read_vertex(fl);
-                            if (fv !== v1 && fv !== v2) {
-                                v_target = fv;
-                                break;
-                            }
-                            fl = mesh.loop_read_next(fl);
-                        }
-
-                        // If we found a valid 3rd vertex inside our island, attempt to relax its distance
-                        if (v_target !== -1 && island_vertices.has(v_target)) {
-
-                            const new_distance = bt_mesh_compute_edge_distance_eikonal(
-                                mesh,
-                                current_vertex,
-                                v_other,
-                                current_distance,
-                                other_distance,
-                                v_target
-                            );
-
-                            const existing_distance = vertex_boundary_distances.get(v_target);
-
-                            if (new_distance < existing_distance) {
-                                vertex_boundary_distances.set(v_target, new_distance);
-                                relax(heap, v_target, new_distance);
-                            }
-                        }
-
-                        // Move to the next face sharing this edge
-                        l_curr = mesh.loop_read_radial_next(l_curr);
-                    } while (l_curr !== l_first && l_curr !== NULL_POINTER);
-                }
-            }
-
-            // Move to the next edge in the vertex's disk cycle
-            e_curr = is_v1 ? mesh.edge_read_v1_disk_next(e_curr) : mesh.edge_read_v2_disk_next(e_curr);
-        } while (e_curr !== e_first && e_curr !== NULL_POINTER);
-    }
-}
+import { IndexedFloatMinHeap } from "../../../../../../collection/heap/IndexedFloatMinHeap.js";
+import { NULL_POINTER } from "../BinaryTopology.js";
+import { bt_face_third_vertex } from "./bt_face_third_vertex.js";
+import { bt_mesh_compute_edge_distance_eikonal } from "./bt_mesh_compute_edge_distance_eikonal.js";
+
+/**
+ * Relax `vertex` to `distance`, admitting it to the frontier if it is not already on it.
+ *
+ * One call on a queue that answers `contains` by scanning; two on one that keeps an index,
+ * because the index is what makes the question cheap enough to ask separately.
+ *
+ * @param {IndexedFloatMinHeap} heap
+ * @param {number} vertex
+ * @param {number} distance
+ */
+function relax(heap, vertex, distance) {
+    if (heap.contains(vertex)) {
+        heap.update(vertex, distance);
+    } else {
+        heap.insert(vertex, distance);
+    }
+}
+
+/**
+ * Build distance field for a given island (group of faces).
+ * Distances are calculated as shortest from the boundary.
+ *
+ * Distances are the shortest distances from the boundary along the mesh.
+ * Only the island vertices are considered.
+ *
+ * Unreachable vertices are marked with Infinity distance.
+ * @param {Map<number, number>} vertex_boundary_distances Mapping from vertex ID to distance from boundary. The result is stored here.
+ * @param {BinaryTopology} mesh
+ * @param {Set<number>} island_vertices
+ * @param {Set<number>} boundary_vertices Subset of island_vertices that are on the boundary.
+ */
+export function bt_mesh_build_boundary_distance_field(
+    vertex_boundary_distances,
+    mesh,
+    island_vertices,
+    boundary_vertices
+) {
+
+    // Keyed by vertex id, so the index spans the vertex pool — `island_vertices.size` is a
+    // cardinality, and only ever sized the allocation, which is what it still does here.
+    const heap = new IndexedFloatMinHeap(mesh.vertices.size, island_vertices.size);
+
+    // initialize distances
+    for (const v of island_vertices) {
+        if (boundary_vertices.has(v)) {
+            vertex_boundary_distances.set(v, 0);
+            heap.insert(v, 0);
+        } else {
+            vertex_boundary_distances.set(v, Infinity);
+        }
+    }
+
+    const scratch_vertex = new Float32Array(3);
+
+    while (heap.size !== 0) {
+        const current_vertex = heap.pop_min();
+        const current_distance = vertex_boundary_distances.get(current_vertex);
+
+        // Traverse disk cycle to get neighboring edges
+        const e_first = mesh.vertex_read_edge(current_vertex);
+        if (e_first === NULL_POINTER) {
+            continue;
+        }
+
+        let e_curr = e_first;
+        do {
+            const v1 = mesh.edge_read_vertex1(e_curr);
+            const v2 = mesh.edge_read_vertex2(e_curr);
+
+            const is_v1 = v1 === current_vertex;
+            const v_other = is_v1 ? v2 : v1;
+
+            // ---------------------------------------------------------
+            // STEP A: Vertex Update (Dijkstra Fallback)
+            // ---------------------------------------------------------
+            // We must attempt to update the neighbor (v_other) directly from current_vertex.
+            // This ensures that 'v_other' gets a valid distance (if it was Infinity),
+            // allowing the subsequent Eikonal step to have a valid edge to propagate from.
+
+            // 1. Read coordinates to compute edge length
+            mesh.vertex_read_coordinate(scratch_vertex, 0, current_vertex);
+            const cx = scratch_vertex[0];
+            const cy = scratch_vertex[1];
+            const cz = scratch_vertex[2];
+
+            mesh.vertex_read_coordinate(scratch_vertex, 0, v_other);
+            const ox = scratch_vertex[0];
+            const oy = scratch_vertex[1];
+            const oz = scratch_vertex[2];
+
+            const edge_len = Math.hypot(cx - ox, cy - oy, cz - oz);
+            const new_neighbor_dist = current_distance + edge_len;
+
+            let other_distance = vertex_boundary_distances.get(v_other);
+
+            // Update v_other if the direct edge path is shorter than what it currently has
+            if (new_neighbor_dist < other_distance) {
+                vertex_boundary_distances.set(v_other, new_neighbor_dist);
+                relax(heap, v_other, new_neighbor_dist);
+                // Update local variable so STEP B uses the tighter bound immediately
+                other_distance = new_neighbor_dist;
+            }
+
+            // ---------------------------------------------------------
+            // STEP B: Edge Update (Eikonal)
+            // ---------------------------------------------------------
+            // Now that we've ensured v_other is as up-to-date as possible,
+            // we check if we can form a valid front (edge) to update the triangle's 3rd vertex.
+
+            if (other_distance !== undefined && other_distance !== Infinity) {
+
+                // Find the faces (triangles) sharing this edge using the radial cycle
+                const l_first = mesh.edge_read_loop(e_curr);
+
+                if (l_first !== NULL_POINTER) {
+                    let l_curr = l_first;
+                    do {
+                        const face = mesh.loop_read_face(l_curr);
+                        const v_target = bt_face_third_vertex(mesh, face, e_curr);
+
+                        // If we found a valid 3rd vertex inside our island, attempt to relax its distance
+                        if (v_target !== NULL_POINTER && island_vertices.has(v_target)) {
+
+                            const new_distance = bt_mesh_compute_edge_distance_eikonal(
+                                mesh,
+                                current_vertex,
+                                v_other,
+                                current_distance,
+                                other_distance,
+                                v_target
+                            );
+
+                            const existing_distance = vertex_boundary_distances.get(v_target);
+
+                            if (new_distance < existing_distance) {
+                                vertex_boundary_distances.set(v_target, new_distance);
+                                relax(heap, v_target, new_distance);
+                            }
+                        }
+
+                        // Move to the next face sharing this edge
+                        l_curr = mesh.loop_read_radial_next(l_curr);
+                    } while (l_curr !== l_first && l_curr !== NULL_POINTER);
+                }
+            }
+
+            // Move to the next edge in the vertex's disk cycle
+            e_curr = is_v1 ? mesh.edge_read_v1_disk_next(e_curr) : mesh.edge_read_v2_disk_next(e_curr);
+        } while (e_curr !== e_first && e_curr !== NULL_POINTER);
+    }
+}

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":"AA+mBA;;;;;;;;;;;;;;;;;;;;;;;;;;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":"AA2kBA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,+CAVW,MAAM,EAAE,GAAC,WAAW,iBACpB,MAAM,gBACN,MAAM,8CAEN,MAAM,GAGJ,MAAM,CAuDlB"}

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

@@ -1,4 +1,6 @@
-import { bt_face_read_triangle_vertices } from "./bt_face_read_triangle.js";
+import { bt_edge_other_face } from "./bt_edge_other_face.js";
+import { bt_face_read_triangle_vertices } from "./bt_face_read_triangle.js";
+import { bt_face_third_vertex } from "./bt_face_third_vertex.js";
 import { v3_distance } from "../../../../../vec3/v3_distance.js";
 import { bt_vertex_distance_to_vertex } from "./bt_vertex_distance_to_vertex.js";
 import { assert } from "../../../../../../assert.js";
@@ -92,25 +94,6 @@ function vertex_distance_to_point(topology, vertex, px, py, pz) {
     return v3_distance(scratch_vertex_pos[0], scratch_vertex_pos[1], scratch_vertex_pos[2], px, py, pz);
 }
 
-/**
- * The vertex of `face` that is neither `a` nor `b`, or -1 if the face does not have one.
- */
-function third_vertex(topology, face, a, b) {
-    let loop = topology.face_read_loop(face);
-
-    for (let i = 0; i < 3; i++) {
-        const v = topology.loop_read_vertex(loop);
-
-        if (v !== a && v !== b) {
-            return v;
-        }
-
-        loop = topology.loop_read_next(loop);
-    }
-
-    return -1;
-}
-
 /**
  * Solve the geodesic distance field outward from the goal face using Fast Marching (the exact Eikonal
  * triangle update). The field is goal-directed: the heap is ordered by `distance + h`, where `h` is the
@@ -199,9 +182,9 @@ function solve_geodesic_field(topology, goal_face, start_face, early_terminate)
                     let loop = loop_first;
                     do {
                         const face = topology.loop_read_face(loop);
-                        const t = third_vertex(topology, face, ev1, ev2);
+                        const t = bt_face_third_vertex(topology, face, edge);
 
-                        if (t !== -1 && !frozen_vertices.has(t)) {
+                        if (t !== NULL_POINTER && !frozen_vertices.has(t)) {
                             const d = bt_mesh_compute_edge_distance_eikonal(topology, v, w, g_v, g_w, t);
                             const existing = geodesic_distance.get(t);
 
@@ -235,25 +218,6 @@ function solve_geodesic_field(topology, goal_face, start_face, early_terminate)
     return frozen_vertices.has(start_v0) && frozen_vertices.has(start_v1) && frozen_vertices.has(start_v2);
 }
 
-/**
- * The face on the far side of `loop`'s edge, or {@link NULL_POINTER} if the edge is a boundary.
- */
-function loop_opposite_face(topology, loop, face) {
-    let radial = topology.loop_read_radial_next(loop);
-
-    while (radial !== loop) {
-        const f = topology.loop_read_face(radial);
-
-        if (f !== face) {
-            return f;
-        }
-
-        radial = topology.loop_read_radial_next(radial);
-    }
-
-    return NULL_POINTER;
-}
-
 /**
  * Average of a face's three vertices' distances to the goal. The average (rather than the minimum)
  * keeps a single near-goal vertex of an oversized triangle from making the whole face look close.
@@ -363,13 +327,13 @@ function pick_exit_edge(
     let best_face = NULL_POINTER;
 
     let t = ray_segment_t(ox, oy, dx, dy, 0, 0, bx, 0); // edge AB
-    if (t < best_t) { best_t = t; best_face = loop_opposite_face(topology, loop_ab, face); }
+    if (t < best_t) { best_t = t; best_face = bt_edge_other_face(topology, topology.loop_read_edge(loop_ab), face); }
 
     t = ray_segment_t(ox, oy, dx, dy, bx, 0, cx, cy); // edge BC
-    if (t < best_t) { best_t = t; best_face = loop_opposite_face(topology, loop_bc, face); }
+    if (t < best_t) { best_t = t; best_face = bt_edge_other_face(topology, topology.loop_read_edge(loop_bc), face); }
 
     t = ray_segment_t(ox, oy, dx, dy, cx, cy, 0, 0); // edge CA
-    if (t < best_t) { best_t = t; best_face = loop_opposite_face(topology, loop_ca, face); }
+    if (t < best_t) { best_t = t; best_face = bt_edge_other_face(topology, topology.loop_read_edge(loop_ca), face); }
 
     last_exit_t = best_t;
     return best_face;

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

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_face_find_path_polyanya.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_mesh_face_find_path_polyanya.js"],"names":[],"mappings":"AA4TA;;;;;;;;;;;;;;GAcG;AACH,wDAZW,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,gCAElC,MAAM,MACN,MAAM,MACN,MAAM,cACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,aACN,MAAM,GACJ,MAAM,CAyIlB"}
+{"version":3,"file":"bt_mesh_face_find_path_polyanya.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_mesh_face_find_path_polyanya.js"],"names":[],"mappings":"AAuTA;;;;;;;;;;;;;;GAcG;AACH,wDAZW,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,gCAElC,MAAM,MACN,MAAM,MACN,MAAM,cACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,aACN,MAAM,GACJ,MAAM,CAyIlB"}

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

@@ -1,3 +1,4 @@
+import { bt_edge_other_face } from "./bt_edge_other_face.js";
 import { bt_face_read_triangle_vertices } from "./bt_face_read_triangle.js";
 import { bt_vertex_distance_to_vertex } from "./bt_vertex_distance_to_vertex.js";
 import { Uint32Heap4 } from "../../../../../../collection/heap/Uint32Heap4.js";
@@ -133,13 +134,7 @@ function neighbour_across(topology, face, va, vb) {
         const a = topology.loop_read_vertex(loop);
         const b = topology.loop_read_vertex(topology.loop_read_next(loop));
         if ((a === va && b === vb) || (a === vb && b === va)) {
-            let radial = topology.loop_read_radial_next(loop);
-            while (radial !== loop) {
-                const f = topology.loop_read_face(radial);
-                if (f !== face) return f;
-                radial = topology.loop_read_radial_next(radial);
-            }
-            return NULL_POINTER;
+            return bt_edge_other_face(topology, topology.loop_read_edge(loop), face);
         }
         loop = topology.loop_read_next(loop);
     }

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

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_sample_interior_grid_points.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_mesh_sample_interior_grid_points.js"],"names":[],"mappings":"AA8EA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,yFAJW,MAAM,SACN,MAAM,GACJ,YAAY,CA8ExB"}
+{"version":3,"file":"bt_mesh_sample_interior_grid_points.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_mesh_sample_interior_grid_points.js"],"names":[],"mappings":"AA+EA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,yFAJW,MAAM,SACN,MAAM,GACJ,YAAY,CA8ExB"}

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

@@ -1,4 +1,5 @@
-import { bt_mesh_build_surface_triangle_bvh, SURFACE_PARITY_RAY_COUNT, SURFACE_PARITY_RAY_DIRECTIONS } from "./bt_mesh_surface_ray_parity.js";
+import { bt_mesh_build_face_bvh } from "./bt_mesh_build_face_bvh.js";
+import { SURFACE_PARITY_RAY_COUNT, SURFACE_PARITY_RAY_DIRECTIONS } from "./bt_mesh_surface_ray_parity.js";
 import { assert } from "../../../../../../assert.js";
 import { BVH, NULL_NODE } from "../../../../../../bvh2/bvh3/BVH.js";
 import { bvh_query_user_data_ray } from "../../../../../../bvh2/bvh3/query/bvh_query_user_data_ray.js";
@@ -149,7 +150,7 @@ export function bt_mesh_sample_interior_grid_points(mesh, cells_per_dim, seed =
 
     // Build BVH over surface triangles for the inside-test.
     const bvh = new BVH();
-    bt_mesh_build_surface_triangle_bvh(bvh, mesh);
+    bt_mesh_build_face_bvh(bvh, mesh);
 
     const rng = seededRandom(seed);
     const out = []; // grow dynamically; copy to Float32Array at the end

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

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_segment_penetrates_surface.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_mesh_segment_penetrates_surface.js"],"names":[],"mappings":"AAgEA;;;;;;;;;;;;;;;;;;GAkBG;AACH,uFARW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,OAAO,CAmDnB"}
+{"version":3,"file":"bt_mesh_segment_penetrates_surface.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_mesh_segment_penetrates_surface.js"],"names":[],"mappings":"AAgEA;;;;;;;;;;;;;;;;;;GAkBG;AACH,uFARW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,OAAO,CA8CnB"}