@woosh/meep-engine 2.152.0 → 2.154.0

package/src/engine/physics/narrowphase/box_box_manifold.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"box_box_manifold.d.ts","sourceRoot":"","sources":["../../../../../src/engine/physics/narrowphase/box_box_manifold.js"],"names":[],"mappings":"AAgHA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,sCAvBW,MAAM,EAAE,GAAC,YAAY,MACrB,MAAM,MACN,MAAM,MACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,GACJ,OAAO,CAghBnB;AArlBD;;;GAGG;AACH,iCAFU,MAAM,CAEoD"}
+{"version":3,"file":"box_box_manifold.d.ts","sourceRoot":"","sources":["../../../../../src/engine/physics/narrowphase/box_box_manifold.js"],"names":[],"mappings":"AAiHA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,sCAvBW,MAAM,EAAE,GAAC,YAAY,MACrB,MAAM,MACN,MAAM,MACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,GACJ,OAAO,CAghBnB;AArlBD;;;GAGG;AACH,iCAFU,MAAM,CAEoD"}

package/src/engine/physics/narrowphase/box_box_manifold.js

@@ -3,6 +3,7 @@ import {
 } from "../../../core/geom/3d/line/line3_closest_points_segment_segment.js";
 import { quat3_to_matrix3 } from "../../../core/geom/3d/quaternion/quat3_to_matrix3.js";
 import { clip_against_axis_uv } from "./clip_against_axis_uv.js";
+import { reduce_manifold_contacts } from "./reduce_manifold_contacts.js";
 
 /**
  * Multi-point manifold construction for two oriented bounding boxes.
@@ -614,7 +615,7 @@ export function box_box_manifold(
     }
 
     // ---- Reduce to ≤ MAX_CONTACTS by best-deepest + perimeter ----
-    const kept = reduce_contacts(cand_count);
+    const kept = reduce_manifold_contacts(candidates, cand_count, 4, MAX_CONTACTS);
 
     // ---- Emit: contact-on-incident is the candidate's world point;
     //          contact-on-reference is the same point projected onto the ref plane.
@@ -668,83 +669,5 @@ function out_empty(out) {
     return true; // overlap exists per SAT, just no clipped manifold
 }
 
-/**
- * In-place reduction of `candidates` to at most {@link MAX_CONTACTS}:
- *   1. Sort by depth descending; deepest stays at index 0.
- *   2. From the remaining, greedily pick the points that maximise the spread
- *      (sum of squared distances to already-kept points). This approximates
- *      the maximum-area heuristic without needing the actual area.
- *
- * @param {number} n input count
- * @returns {number} kept count (min(n, MAX_CONTACTS))
- */
-function reduce_contacts(n) {
-    if (n <= MAX_CONTACTS) return n;
-
-    // Find deepest, swap into slot 0.
-    let deepest_idx = 0;
-    let deepest_val = candidates[3];
-    for (let i = 1; i < n; i++) {
-
-        if (candidates[i * 4 + 3] > deepest_val) {
-            deepest_val = candidates[i * 4 + 3];
-            deepest_idx = i;
-        }
-
-    }
-
-    if (deepest_idx !== 0) {
-        swap_candidate(0, deepest_idx);
-    }
-
-    // Greedy: for slot k in 1..MAX_CONTACTS-1, pick the remaining candidate
-    // whose min-distance-sq-to-already-kept-set is largest.
-    for (let k = 1; k < MAX_CONTACTS; k++) {
-
-        let best_score = -1;
-        let best_i = -1;
-
-        for (let i = k; i < n; i++) {
-            let min_d2 = Infinity;
-
-            for (let j = 0; j < k; j++) {
-                const dx = candidates[i * 4] - candidates[j * 4];
-                const dy = candidates[i * 4 + 1] - candidates[j * 4 + 1];
-                const dz = candidates[i * 4 + 2] - candidates[j * 4 + 2];
-                const d2 = dx * dx + dy * dy + dz * dz;
-                if (d2 < min_d2) min_d2 = d2;
-            }
-
-            if (min_d2 > best_score) {
-                best_score = min_d2;
-                best_i = i;
-            }
-
-        }
-
-        if (best_i !== k) {
-            swap_candidate(k, best_i);
-        }
-    }
-    return MAX_CONTACTS;
-}
-
-function swap_candidate(a, b) {
-    const a4 = a * 4;
-    const b4 = b * 4;
-
-    const ax = candidates[a4];
-    const ay = candidates[a4 + 1];
-    const az = candidates[a4 + 2];
-    const ad = candidates[a4 + 3];
-
-    candidates[a4] = candidates[b4];
-    candidates[a4 + 1] = candidates[b4 + 1];
-    candidates[a4 + 2] = candidates[b4 + 2];
-    candidates[a4 + 3] = candidates[b4 + 3];
-
-    candidates[b4] = ax;
-    candidates[b4 + 1] = ay;
-    candidates[b4 + 2] = az;
-    candidates[b4 + 3] = ad;
-}
+// Contact reduction (deepest + farthest-point spread) is shared with
+// convex_convex_manifold via reduce_manifold_contacts (stride 4).

package/src/engine/physics/narrowphase/box_triangle_contact.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"box_triangle_contact.d.ts","sourceRoot":"","sources":["../../../../../src/engine/physics/narrowphase/box_triangle_contact.js"],"names":[],"mappings":"AAyLA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,0CAtBW,MAAM,EAAE,GAAC,YAAY,OACrB,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,OAAO,CAuJnB;AAvSD;;;GAGG;AACH,sCAFU,MAAM,CAEyD"}
+{"version":3,"file":"box_triangle_contact.d.ts","sourceRoot":"","sources":["../../../../../src/engine/physics/narrowphase/box_triangle_contact.js"],"names":[],"mappings":"AAsJA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,0CAtBW,MAAM,EAAE,GAAC,YAAY,OACrB,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,OAAO,CAuJnB;AAnQD;;;GAGG;AACH,sCAFU,MAAM,CAEyD"}

package/src/engine/physics/narrowphase/box_triangle_contact.js

@@ -3,6 +3,7 @@ import {
 } from "../../../core/geom/3d/line/line3_closest_points_segment_segment.js";
 import { quat3_to_matrix3 } from "../../../core/geom/3d/quaternion/quat3_to_matrix3.js";
 import { clip_against_axis_uv } from "./clip_against_axis_uv.js";
+import { reduce_manifold_contacts } from "./reduce_manifold_contacts.js";
 
 /**
  * Multi-point manifold construction for an oriented box vs. a triangle.
@@ -139,46 +140,10 @@ function clip_against_half_plane_uv(points_in, point_count, points_out, line_ox,
  * whose minimum distance to the already-kept set (in 3D space) is
  * largest — approximates max-perimeter / max-area selection.
  */
+// Contact reduction (deepest + farthest-point spread) is shared via
+// reduce_manifold_contacts (stride 7 here).
 function reduce_contacts(n) {
-    if (n <= MAX_CONTACTS) return n;
-
-    function swap(i, j) {
-        if (i === j) return;
-        const oi = i * 7;
-        const oj = j * 7;
-        for (let k = 0; k < 7; k++) {
-            const t = candidates[oi + k];
-            candidates[oi + k] = candidates[oj + k];
-            candidates[oj + k] = t;
-        }
-    }
-
-    // Move deepest to slot 0.
-    let deepest_idx = 0;
-    let deepest_val = candidates[6];
-    for (let i = 1; i < n; i++) {
-        const d = candidates[i * 7 + 6];
-        if (d > deepest_val) { deepest_val = d; deepest_idx = i; }
-    }
-    swap(0, deepest_idx);
-
-    for (let k = 1; k < MAX_CONTACTS; k++) {
-        let best_score = -1;
-        let best_i = -1;
-        for (let i = k; i < n; i++) {
-            let min_d2 = Infinity;
-            for (let j = 0; j < k; j++) {
-                const dx = candidates[i * 7]     - candidates[j * 7];
-                const dy = candidates[i * 7 + 1] - candidates[j * 7 + 1];
-                const dz = candidates[i * 7 + 2] - candidates[j * 7 + 2];
-                const d2 = dx * dx + dy * dy + dz * dz;
-                if (d2 < min_d2) min_d2 = d2;
-            }
-            if (min_d2 > best_score) { best_score = min_d2; best_i = i; }
-        }
-        swap(k, best_i);
-    }
-    return MAX_CONTACTS;
+    return reduce_manifold_contacts(candidates, n, CONTACT_STRIDE, MAX_CONTACTS);
 }
 
 // --- main --------------------------------------------------------------------

package/src/engine/physics/narrowphase/capsule_contacts.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"capsule_contacts.d.ts","sourceRoot":"","sources":["../../../../../src/engine/physics/narrowphase/capsule_contacts.js"],"names":[],"mappings":"AA4BA;;;;;;;;;;;;;;;GAeG;AACH,2CAVW,MAAM,EAAE,GAAC,YAAY,MACrB,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,eACN,MAAM,QAOhB;AAID;;;;;;;;;;;;;;;;;;GAkBG;AACH,4CAhBW,MAAM,EAAE,GAAC,YAAY,QACrB,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,YACN,MAAM,YACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,YACN,MAAM,GACJ,OAAO,CA6CnB;AAMD;;;;;GAKG;AACH,6CAHW,MAAM,EAAE,GAAC,YAAY,yNACnB,OAAO,CAuEnB;AAOD;;;;;;;;;;;;;GAaG;AACH,yCAHW,MAAM,EAAE,GAAC,YAAY,4NACnB,OAAO,CA8FnB;AAyCD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AACH,gDAtBW,YAAY,QACZ,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,YACN,MAAM,YACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,GACJ,MAAM,CAuElB;AApJD;;;;;;;;;;GAUG;AACH,yCAFU,MAAM,CAE6B;AAE7C;;;;;GAKG;AACH,uCAFU,MAAM,CAE0B"}
+{"version":3,"file":"capsule_contacts.d.ts","sourceRoot":"","sources":["../../../../../src/engine/physics/narrowphase/capsule_contacts.js"],"names":[],"mappings":"AA4BA;;;;;;;;;;;;;;;GAeG;AACH,2CAVW,MAAM,EAAE,GAAC,YAAY,MACrB,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,eACN,MAAM,QAOhB;AAID;;;;;;;;;;;;;;;;;;GAkBG;AACH,4CAhBW,MAAM,EAAE,GAAC,YAAY,QACrB,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,YACN,MAAM,YACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,YACN,MAAM,GACJ,OAAO,CA6CnB;AAMD;;;;;GAKG;AACH,6CAHW,MAAM,EAAE,GAAC,YAAY,yNACnB,OAAO,CAuEnB;AAOD;;;;;;;;;;;;;GAaG;AACH,yCAHW,MAAM,EAAE,GAAC,YAAY,4NACnB,OAAO,CA4FnB;AAyCD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AACH,gDAtBW,YAAY,QACZ,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,YACN,MAAM,YACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,QACN,MAAM,GACJ,MAAM,CAsElB;AAnJD;;;;;;;;;;GAUG;AACH,yCAFU,MAAM,CAE6B;AAE7C;;;;;GAKG;AACH,uCAFU,MAAM,CAE0B"}