@woosh/meep-engine 2.163.8 → 2.163.10

package/package.json

@@ -6,7 +6,7 @@
   "description": "Pure JavaScript game engine. Fully featured and production ready.",
   "type": "module",
   "author": "Alexander Goldring",
-  "version": "2.163.8",
+  "version": "2.163.10",
   "main": "build/meep.module.js",
   "module": "build/meep.module.js",
   "exports": {

package/src/core/collection/heap/IndexedFloatMaxHeap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"IndexedFloatMaxHeap.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/heap/IndexedFloatMaxHeap.js"],"names":[],"mappings":"AA6BA;IACI;;;OAGG;IACH,yBAHW,MAAM,0BACN,MAAM,EAsBhB;IAbG,wBAA4C;IAC5C,eAAe;IAEf,2BAA4E;IAC5E,2BAAwD;IACxD,6BAA0D;IAE1D;;;OAGG;IACH,cAFU,WAAW,CAE2B;IAIpD,mBAEC;IAED;;;OAGG;IACH,cAQC;IAED,2BAEC;IAED;;;OAGG;IACH,qBAkBC;IAED;;;;OAIG;IACH,oBAsBC;IAED;;;;OAIG;IACH,kBAYC;IAED,wBAUC;IAED;;;OAGG;IACH,WAHW,MAAM,SACN,MAAM,QAehB;IAED;;OAEG;IACH,WAFa,MAAM,CAuBlB;IAED;;;OAGG;IACH,WAHW,MAAM,aACN,MAAM,QAehB;IAED;;;OAGG;IACH,WAHW,MAAM,GACJ,OAAO,CA+BnB;CACJ"}

package/src/core/{graph/metis/native/refine → collection/heap}/IndexedFloatMaxHeap.js

@@ -1,4 +1,4 @@
-import { assert } from "../../../../assert.js";
+import { assert } from "../../assert.js";
 
 /**
  * Max-heap of (uint32 id, float32 score) entries with an external id→slot index

package/src/core/geom/2d/line/line_segment_intersection_fraction_2d.d.ts

@@ -1,7 +1,9 @@
 /**
  * Fraction `t` in [0,1] along the segment (s0 -> s1) at which the infinite line through (l0, l1)
- * crosses it. Returns NaN when the segment lies entirely on one side of the line (no crossing within
- * the segment) or the two are parallel/collinear.
+ * crosses it. Returns -1 when the segment lies entirely on one side of the line (no crossing within
+ * the segment) or the two are parallel/collinear. -1 is a value the valid fraction can never take (a
+ * real crossing is always in [0,1]), and it is used instead of NaN so callers reject the no-crossing
+ * case with a trivial comparison (`t < 0` / `=== -1`) rather than the slower Number.isNaN.
  *
  * Unlike {@link line_segment_compute_line_segment_intersection_array_2d}, the first pair of points
  * defines an unbounded line (not a segment) and the result is the parametric position on the segment

package/src/core/geom/2d/line/line_segment_intersection_fraction_2d.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"line_segment_intersection_fraction_2d.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/line/line_segment_intersection_fraction_2d.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;GAkBG;AACH,4DAVW,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,GACJ,MAAM,CAsBlB"}
+{"version":3,"file":"line_segment_intersection_fraction_2d.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/line/line_segment_intersection_fraction_2d.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,4DAVW,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,GACJ,MAAM,CAsBlB"}

package/src/core/geom/2d/line/line_segment_intersection_fraction_2d.js

@@ -2,8 +2,10 @@ import { v2_cross_product } from "../../vec2/v2_cross_product.js";
 
 /**
  * Fraction `t` in [0,1] along the segment (s0 -> s1) at which the infinite line through (l0, l1)
- * crosses it. Returns NaN when the segment lies entirely on one side of the line (no crossing within
- * the segment) or the two are parallel/collinear.
+ * crosses it. Returns -1 when the segment lies entirely on one side of the line (no crossing within
+ * the segment) or the two are parallel/collinear. -1 is a value the valid fraction can never take (a
+ * real crossing is always in [0,1]), and it is used instead of NaN so callers reject the no-crossing
+ * case with a trivial comparison (`t < 0` / `=== -1`) rather than the slower Number.isNaN.
  *
  * Unlike {@link line_segment_compute_line_segment_intersection_array_2d}, the first pair of points
  * defines an unbounded line (not a segment) and the result is the parametric position on the segment
@@ -30,12 +32,12 @@ export function line_segment_intersection_fraction_2d(
     const side_1 = v2_cross_product(dir_x, dir_y, s1_x - l0_x, s1_y - l0_y);
 
     if ((side_0 > 0 && side_1 > 0) || (side_0 < 0 && side_1 < 0)) {
-        return NaN; // both endpoints on the same side -> no crossing within the segment
+        return -1; // both endpoints on the same side -> no crossing within the segment
     }
 
     const denom = side_0 - side_1;
     if (denom === 0) {
-        return NaN; // parallel / collinear
+        return -1; // parallel / collinear
     }
 
     return side_0 / denom;

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

@@ -1 +1 @@
-{"version":3,"file":"bt_mesh_simplify.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_simplify.js"],"names":[],"mappings":"AAqLA;;;;;;;;;;;;;;GAcG;AACH,0EAHW,MAAM,wBACN,IAAI,MAAM,CAAC,QA6HrB"}
+{"version":3,"file":"bt_mesh_simplify.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_mesh_simplify.js"],"names":[],"mappings":"AA6JA;;;;;;;;;;;;;;GAcG;AACH,0EAHW,MAAM,wBACN,IAAI,MAAM,CAAC,QA6HrB"}

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

@@ -7,6 +7,7 @@ import { bt_mesh_compute_vertex_quadratics } from "./bt_mesh_compute_vertex_quad
 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";
 
@@ -50,31 +51,6 @@ function count_edge_faces(mesh, edge_id) {
     return count;
 }
 
-/**
- * Swap the v1/v2 slots of an edge. Disk cycle pointers for the two slots are swapped
- * alongside so that the disk cycles on both attached vertices remain valid.
- *
- * @param {BinaryTopology} mesh
- * @param {number} edge_id
- */
-function swap_edge_vertex_slots(mesh, edge_id) {
-    const v1 = mesh.edge_read_vertex1(edge_id);
-    const v2 = mesh.edge_read_vertex2(edge_id);
-
-    const v1_next = mesh.edge_read_v1_disk_next(edge_id);
-    const v1_prev = mesh.edge_read_v1_disk_prev(edge_id);
-    const v2_next = mesh.edge_read_v2_disk_next(edge_id);
-    const v2_prev = mesh.edge_read_v2_disk_prev(edge_id);
-
-    mesh.edge_write_vertex1(edge_id, v2);
-    mesh.edge_write_vertex2(edge_id, v1);
-
-    mesh.edge_write_v1_disk_next(edge_id, v2_next);
-    mesh.edge_write_v1_disk_prev(edge_id, v2_prev);
-    mesh.edge_write_v2_disk_next(edge_id, v1_next);
-    mesh.edge_write_v2_disk_prev(edge_id, v1_prev);
-}
-
 /**
  * Evaluate a potential edge collapse: choose the optimal surviving vertex position
  * and return the quadric-based cost. Returns Infinity if the edge cannot be collapsed.
@@ -285,7 +261,7 @@ export function bt_mesh_simplify(
         // bt_edge_collapse keeps v1 as the survivor. If v2 is the pinned endpoint,
         // swap the edge's slots so the pinned vertex ends up in the v1 position.
         if (v2_restricted) {
-            swap_edge_vertex_slots(mesh, edge_id);
+            bt_edge_swap_vertex_slots(mesh, edge_id);
         }
 
         const pre_survivor = mesh.edge_read_vertex1(edge_id);

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

@@ -0,0 +1,19 @@
+/**
+ * Clean up a triangle mesh in place by removing only geometrically redundant vertices, so the
+ * surface and its boundary are preserved to within `max_error`. Unlike {@link bt_mesh_simplify}
+ * (quadric LoD decimation driven to a face-count target, free to relocate vertices), this is a
+ * conservative half-edge cleanup: it never moves a surviving vertex and never changes the
+ * boundary outline or hole topology by more than `max_error`. It removes the dense interior of
+ * flat/near-coplanar regions and collinear runs of boundary vertices, and stops once the
+ * cheapest remaining collapse would exceed the tolerance.
+ *
+ * Intended for navmesh post-processing, where the input is a walkable surface whose outline and
+ * holes (obstacle footprints) carry meaning and must not drift, but whose interior inherits far
+ * more triangles than navigation needs.
+ *
+ * @param {BinaryTopology} mesh Mesh to clean up in-place.
+ * @param {number} max_error Maximum world-space deviation allowed for any removed vertex and for
+ *     the boundary polyline. A no-op when <= 0.
+ */
+export function bt_mesh_simplify_by_error(mesh: BinaryTopology, max_error: number): void;
+//# sourceMappingURL=bt_mesh_simplify_by_error.d.ts.map

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

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