@ifc-lite/clash 1.1.4 → 1.3.0

package/dist/analysis.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Pure helpers for reading and ordering a clash result the way a reviewer
+ * thinks about it: how deep the overlap is, whether a "clash" is really just a
+ * face/edge contact, and which conflicts to look at first.
+ *
+ * Severity itself is a property of the *element-type pair* (see
+ * {@link inferClashSeverity}), NOT of the overlap geometry — so a deep pipe-vs-
+ * beam interpenetration and a shallow one share a severity. These helpers add
+ * the geometric dimension (depth) so the two can be combined when prioritising.
+ */
+import type { Clash, ClashSeverity } from './types.js';
+/** Severity ordering, most-severe first (lower rank = more severe). */
+export declare const SEVERITY_RANK: Record<ClashSeverity, number>;
+/**
+ * Overlap (penetration) depth of a clash in metres, always `>= 0`.
+ *
+ * A `hard` clash carries a *signed* `distance` (`< 0` = interpenetration), so
+ * its depth is `-distance`. `clearance`/`touch` clashes are separated (no
+ * penetration) and report depth `0`. This is the right key for "sort by how
+ * badly things overlap" (#1274).
+ */
+export declare function penetrationDepth(c: Clash): number;
+/** Default band (m) under which a `hard` clash is really a face/edge *contact*
+ *  rather than a genuine interpenetration — see {@link isTouching}. */
+export declare const TOUCHING_EPSILON = 0.0001;
+/**
+ * Whether a clash is effectively a zero-distance *contact* rather than a real
+ * overlap (#1273). True for `touch`-status clashes and for `hard` clashes whose
+ * penetration is within `eps` — typically coincident faces (a wall meeting a
+ * slab, a column sitting on a footing) reported with a ~0 m depth, which users
+ * reasonably distrust when they appear in the clash list.
+ */
+export declare function isTouching(c: Clash, eps?: number): boolean;
+export type ClashSortBy = 'severity' | 'depth' | 'distance';
+/**
+ * Return a NEW array of clashes ordered by the chosen key. Ties fall back to the
+ * stable clash id so the order is deterministic across runs.
+ * - `severity`: most severe first, then deepest overlap (the panel default).
+ * - `depth`:    deepest interpenetration first (#1274 — prioritise real problems).
+ * - `distance`: smallest signed distance first (deepest penetration → widest gap).
+ */
+export declare function sortClashes(clashes: readonly Clash[], by: ClashSortBy): Clash[];
+//# sourceMappingURL=analysis.d.ts.map

package/dist/analysis.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysis.d.ts","sourceRoot":"","sources":["../src/analysis.ts"],"names":[],"mappings":"AAIA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEvD,uEAAuE;AACvE,eAAO,MAAM,aAAa,EAAE,MAAM,CAAC,aAAa,EAAE,MAAM,CAKvD,CAAC;AAEF;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAEjD;AAED;uEACuE;AACvE,eAAO,MAAM,gBAAgB,SAAO,CAAC;AAErC;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,GAAE,MAAyB,GAAG,OAAO,CAE5E;AAED,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,OAAO,GAAG,UAAU,CAAC;AAM5D;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,SAAS,KAAK,EAAE,EAAE,EAAE,EAAE,WAAW,GAAG,KAAK,EAAE,CAmB/E"}

package/dist/analysis.js

@@ -0,0 +1,62 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+/** Severity ordering, most-severe first (lower rank = more severe). */
+export const SEVERITY_RANK = {
+    critical: 0,
+    major: 1,
+    minor: 2,
+    info: 3,
+};
+/**
+ * Overlap (penetration) depth of a clash in metres, always `>= 0`.
+ *
+ * A `hard` clash carries a *signed* `distance` (`< 0` = interpenetration), so
+ * its depth is `-distance`. `clearance`/`touch` clashes are separated (no
+ * penetration) and report depth `0`. This is the right key for "sort by how
+ * badly things overlap" (#1274).
+ */
+export function penetrationDepth(c) {
+    return c.distance < 0 ? -c.distance : 0;
+}
+/** Default band (m) under which a `hard` clash is really a face/edge *contact*
+ *  rather than a genuine interpenetration — see {@link isTouching}. */
+export const TOUCHING_EPSILON = 1e-4;
+/**
+ * Whether a clash is effectively a zero-distance *contact* rather than a real
+ * overlap (#1273). True for `touch`-status clashes and for `hard` clashes whose
+ * penetration is within `eps` — typically coincident faces (a wall meeting a
+ * slab, a column sitting on a footing) reported with a ~0 m depth, which users
+ * reasonably distrust when they appear in the clash list.
+ */
+export function isTouching(c, eps = TOUCHING_EPSILON) {
+    return c.status === 'touch' || (c.status === 'hard' && penetrationDepth(c) <= eps);
+}
+function cmpId(a, b) {
+    return a.id < b.id ? -1 : a.id > b.id ? 1 : 0;
+}
+/**
+ * Return a NEW array of clashes ordered by the chosen key. Ties fall back to the
+ * stable clash id so the order is deterministic across runs.
+ * - `severity`: most severe first, then deepest overlap (the panel default).
+ * - `depth`:    deepest interpenetration first (#1274 — prioritise real problems).
+ * - `distance`: smallest signed distance first (deepest penetration → widest gap).
+ */
+export function sortClashes(clashes, by) {
+    const out = clashes.slice();
+    switch (by) {
+        case 'severity':
+            out.sort((a, b) => SEVERITY_RANK[a.severity] - SEVERITY_RANK[b.severity] ||
+                penetrationDepth(b) - penetrationDepth(a) ||
+                cmpId(a, b));
+            break;
+        case 'depth':
+            out.sort((a, b) => penetrationDepth(b) - penetrationDepth(a) || cmpId(a, b));
+            break;
+        case 'distance':
+            out.sort((a, b) => a.distance - b.distance || cmpId(a, b));
+            break;
+    }
+    return out;
+}
+//# sourceMappingURL=analysis.js.map

package/dist/analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysis.js","sourceRoot":"","sources":["../src/analysis.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAe/D,uEAAuE;AACvE,MAAM,CAAC,MAAM,aAAa,GAAkC;IAC1D,QAAQ,EAAE,CAAC;IACX,KAAK,EAAE,CAAC;IACR,KAAK,EAAE,CAAC;IACR,IAAI,EAAE,CAAC;CACR,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAQ;IACvC,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED;uEACuE;AACvE,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,CAAC;AAErC;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,CAAQ,EAAE,MAAc,gBAAgB;IACjE,OAAO,CAAC,CAAC,MAAM,KAAK,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;AACrF,CAAC;AAID,SAAS,KAAK,CAAC,CAAQ,EAAE,CAAQ;IAC/B,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,OAAyB,EAAE,EAAe;IACpE,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAC5B,QAAQ,EAAE,EAAE,CAAC;QACX,KAAK,UAAU;YACb,GAAG,CAAC,IAAI,CACN,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC;gBACrD,gBAAgB,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC;gBACzC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CACd,CAAC;YACF,MAAM;QACR,KAAK,OAAO;YACV,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7E,MAAM;QACR,KAAK,UAAU;YACb,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM;IACV,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/contact/aabb.d.ts

@@ -0,0 +1,20 @@
+import type { AABB, Vec3 } from "./types.js";
+/** An empty AABB (inverted bounds); union with any AABB yields that AABB. */
+export declare const EMPTY_AABB: AABB;
+/** True when two AABBs overlap (closed intervals). */
+export declare function intersects(a: AABB, b: AABB): boolean;
+/** Smallest AABB containing both inputs. */
+export declare function unionAabb(a: AABB, b: AABB): AABB;
+/** Geometric centre of an AABB. */
+export declare function center(a: AABB): Vec3;
+/** Size (extent) of an AABB along each axis. */
+export declare function size(a: AABB): Vec3;
+/** True when the AABB contains the point (closed intervals). */
+export declare function contains(a: AABB, p: Vec3): boolean;
+/** Inflate the AABB by `eps` on every face. Negative values deflate. */
+export declare function inflate(a: AABB, eps: number): AABB;
+/** Build an AABB from a flat positions buffer (xyz, xyz, …). */
+export declare function aabbFromPositions(positions: ArrayLike<number>): AABB;
+/** Longest axis of the AABB: 0=x, 1=y, 2=z. */
+export declare function longestAxis(a: AABB): 0 | 1 | 2;
+//# sourceMappingURL=aabb.d.ts.map

package/dist/contact/aabb.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb.d.ts","sourceRoot":"","sources":["../../src/contact/aabb.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAE7C,6EAA6E;AAC7E,eAAO,MAAM,UAAU,EAAE,IAGxB,CAAC;AAEF,sDAAsD;AACtD,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CASpD;AAED,4CAA4C;AAC5C,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAKhD;AAED,mCAAmC;AACnC,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAEpC;AAED,gDAAgD;AAChD,wBAAgB,IAAI,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAElC;AAED,gEAAgE;AAChE,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CASlD;AAED,wEAAwE;AACxE,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAKlD;AAED,gEAAgE;AAChE,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,IAAI,CAsBpE;AAED,+CAA+C;AAC/C,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAK9C"}

package/dist/contact/aabb.js

@@ -0,0 +1,88 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+/** An empty AABB (inverted bounds); union with any AABB yields that AABB. */
+export const EMPTY_AABB = {
+    min: [Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY],
+    max: [Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY],
+};
+/** True when two AABBs overlap (closed intervals). */
+export function intersects(a, b) {
+    return (a.min[0] <= b.max[0] &&
+        a.max[0] >= b.min[0] &&
+        a.min[1] <= b.max[1] &&
+        a.max[1] >= b.min[1] &&
+        a.min[2] <= b.max[2] &&
+        a.max[2] >= b.min[2]);
+}
+/** Smallest AABB containing both inputs. */
+export function unionAabb(a, b) {
+    return {
+        min: [Math.min(a.min[0], b.min[0]), Math.min(a.min[1], b.min[1]), Math.min(a.min[2], b.min[2])],
+        max: [Math.max(a.max[0], b.max[0]), Math.max(a.max[1], b.max[1]), Math.max(a.max[2], b.max[2])],
+    };
+}
+/** Geometric centre of an AABB. */
+export function center(a) {
+    return [(a.min[0] + a.max[0]) / 2, (a.min[1] + a.max[1]) / 2, (a.min[2] + a.max[2]) / 2];
+}
+/** Size (extent) of an AABB along each axis. */
+export function size(a) {
+    return [a.max[0] - a.min[0], a.max[1] - a.min[1], a.max[2] - a.min[2]];
+}
+/** True when the AABB contains the point (closed intervals). */
+export function contains(a, p) {
+    return (p[0] >= a.min[0] &&
+        p[0] <= a.max[0] &&
+        p[1] >= a.min[1] &&
+        p[1] <= a.max[1] &&
+        p[2] >= a.min[2] &&
+        p[2] <= a.max[2]);
+}
+/** Inflate the AABB by `eps` on every face. Negative values deflate. */
+export function inflate(a, eps) {
+    return {
+        min: [a.min[0] - eps, a.min[1] - eps, a.min[2] - eps],
+        max: [a.max[0] + eps, a.max[1] + eps, a.max[2] + eps],
+    };
+}
+/** Build an AABB from a flat positions buffer (xyz, xyz, …). */
+export function aabbFromPositions(positions) {
+    if (positions.length === 0 || positions.length % 3 !== 0) {
+        return EMPTY_AABB;
+    }
+    let minX = Number.POSITIVE_INFINITY;
+    let minY = Number.POSITIVE_INFINITY;
+    let minZ = Number.POSITIVE_INFINITY;
+    let maxX = Number.NEGATIVE_INFINITY;
+    let maxY = Number.NEGATIVE_INFINITY;
+    let maxZ = Number.NEGATIVE_INFINITY;
+    for (let i = 0; i < positions.length; i += 3) {
+        const x = positions[i];
+        const y = positions[i + 1];
+        const z = positions[i + 2];
+        if (x < minX)
+            minX = x;
+        if (y < minY)
+            minY = y;
+        if (z < minZ)
+            minZ = z;
+        if (x > maxX)
+            maxX = x;
+        if (y > maxY)
+            maxY = y;
+        if (z > maxZ)
+            maxZ = z;
+    }
+    return { min: [minX, minY, minZ], max: [maxX, maxY, maxZ] };
+}
+/** Longest axis of the AABB: 0=x, 1=y, 2=z. */
+export function longestAxis(a) {
+    const [dx, dy, dz] = size(a);
+    if (dx >= dy && dx >= dz)
+        return 0;
+    if (dy >= dz)
+        return 1;
+    return 2;
+}
+//# sourceMappingURL=aabb.js.map

package/dist/contact/aabb.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb.js","sourceRoot":"","sources":["../../src/contact/aabb.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAI/D,6EAA6E;AAC7E,MAAM,CAAC,MAAM,UAAU,GAAS;IAC9B,GAAG,EAAE,CAAC,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,CAAC;IACnF,GAAG,EAAE,CAAC,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,CAAC;CACpF,CAAC;AAEF,sDAAsD;AACtD,MAAM,UAAU,UAAU,CAAC,CAAO,EAAE,CAAO;IACzC,OAAO,CACL,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CACrB,CAAC;AACJ,CAAC;AAED,4CAA4C;AAC5C,MAAM,UAAU,SAAS,CAAC,CAAO,EAAE,CAAO;IACxC,OAAO;QACL,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/F,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;KAChG,CAAC;AACJ,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,MAAM,CAAC,CAAO;IAC5B,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC3F,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,IAAI,CAAC,CAAO;IAC1B,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACzE,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,QAAQ,CAAC,CAAO,EAAE,CAAO;IACvC,OAAO,CACL,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CACjB,CAAC;AACJ,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,OAAO,CAAC,CAAO,EAAE,GAAW;IAC1C,OAAO;QACL,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACrD,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;KACtD,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,iBAAiB,CAAC,SAA4B;IAC5D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACzD,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAW,CAAC;QACjC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;QACrC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;QACrC,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;AAC9D,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,WAAW,CAAC,CAAO;IACjC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC;IACnC,IAAI,EAAE,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC;IACvB,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/contact/bvh.d.ts

@@ -0,0 +1,39 @@
+import type { AABB, MeshBounds } from "./types.js";
+/**
+ * Median-split BVH with two query primitives:
+ *   - queryAABB(q): items overlapping `q`
+ *   - queryPairs(eps?): all unordered pairs whose (optionally inflated) AABBs overlap
+ *
+ * Build cost: O(n log n). queryPairs descends both subtrees simultaneously,
+ * pruning on AABB intersection — true O(n log n) self-pair enumeration rather
+ * than O(n^2) per-element queries.
+ */
+export interface BvhNode {
+    readonly bounds: AABB;
+    readonly left?: BvhNode;
+    readonly right?: BvhNode;
+    /** Indices into the original `items` array; present only on leaves. */
+    readonly items?: readonly number[];
+}
+export interface BvhOptions {
+    /** Maximum items per leaf; lower = deeper tree, higher = faster build. */
+    readonly leafSize?: number;
+}
+export declare class Bvh {
+    readonly root: BvhNode | null;
+    readonly items: readonly MeshBounds[];
+    private constructor();
+    /** Build a BVH from a list of bounded items. Median-split along the longest axis. */
+    static build(items: readonly MeshBounds[], opts?: BvhOptions): Bvh;
+    /** Return ids of items whose AABB intersects `q`. Order is depth-first, stable. */
+    queryAABB(q: AABB): string[];
+    /**
+     * Return all unordered pairs `(idA, idB)` with idA < idB (lex) whose AABBs
+     * (optionally inflated by `epsilon` on all sides) overlap. Pair order is
+     * deterministic given input order.
+     */
+    queryPairs(epsilon?: number): IdPair[];
+}
+type IdPair = readonly [string, string];
+export {};
+//# sourceMappingURL=bvh.d.ts.map

package/dist/contact/bvh.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvh.d.ts","sourceRoot":"","sources":["../../src/contact/bvh.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAEnD;;;;;;;;GAQG;AAEH,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;IACtB,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;IACzB,uEAAuE;IACvE,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACpC;AAED,MAAM,WAAW,UAAU;IACzB,0EAA0E;IAC1E,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,qBAAa,GAAG;IACd,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,CAAC;IAC9B,QAAQ,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,CAAC;IAEtC,OAAO;IAKP,qFAAqF;IACrF,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,EAAE,IAAI,GAAE,UAAe,GAAG,GAAG;IAQtE,mFAAmF;IACnF,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,EAAE;IAO5B;;;;OAIG;IACH,UAAU,CAAC,OAAO,SAAI,GAAG,MAAM,EAAE;CAgBlC;AAED,KAAK,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC"}

package/dist/contact/bvh.js

@@ -0,0 +1,173 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+import { EMPTY_AABB, center, intersects, longestAxis, unionAabb } from "./aabb.js";
+export class Bvh {
+    root;
+    items;
+    constructor(root, items) {
+        this.root = root;
+        this.items = items;
+    }
+    /** Build a BVH from a list of bounded items. Median-split along the longest axis. */
+    static build(items, opts = {}) {
+        if (items.length === 0)
+            return new Bvh(null, items);
+        const leafSize = Math.max(1, opts.leafSize ?? 4);
+        const indices = items.map((_, i) => i);
+        const root = buildNode(items, indices, leafSize);
+        return new Bvh(root, items);
+    }
+    /** Return ids of items whose AABB intersects `q`. Order is depth-first, stable. */
+    queryAABB(q) {
+        if (!this.root)
+            return [];
+        const out = [];
+        queryAabbNode(this.root, q, this.items, out);
+        return out;
+    }
+    /**
+     * Return all unordered pairs `(idA, idB)` with idA < idB (lex) whose AABBs
+     * (optionally inflated by `epsilon` on all sides) overlap. Pair order is
+     * deterministic given input order.
+     */
+    queryPairs(epsilon = 0) {
+        if (!this.root)
+            return [];
+        const out = [];
+        selfPair(this.root, this.items, epsilon, out);
+        // Stable canonicalisation — the emission loops already guarantee no dupes,
+        // but we sort both within each pair and across the pair array so the
+        // output is insensitive to tree construction order (just input order).
+        for (let i = 0; i < out.length; i++) {
+            const p = out[i];
+            if (p[0] > p[1])
+                out[i] = [p[1], p[0]];
+        }
+        out.sort((a, b) => a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : a[1] < b[1] ? -1 : a[1] > b[1] ? 1 : 0);
+        return out;
+    }
+}
+function buildNode(items, indices, leafSize) {
+    if (indices.length === 0) {
+        return { bounds: EMPTY_AABB, items: [] };
+    }
+    const bounds = indices.reduce((acc, idx) => unionAabb(acc, items[idx].aabb), EMPTY_AABB);
+    if (indices.length <= leafSize) {
+        return { bounds, items: indices.slice() };
+    }
+    const axis = longestAxis(bounds);
+    // Sort indices by centre along longest axis, then split at median.
+    indices.sort((ia, ib) => {
+        const ca = center(items[ia].aabb)[axis];
+        const cb = center(items[ib].aabb)[axis];
+        return ca - cb;
+    });
+    const mid = indices.length >> 1;
+    const leftIdx = indices.slice(0, mid);
+    const rightIdx = indices.slice(mid);
+    return {
+        bounds,
+        left: buildNode(items, leftIdx, leafSize),
+        right: buildNode(items, rightIdx, leafSize),
+    };
+}
+function queryAabbNode(node, q, items, out) {
+    if (!intersects(node.bounds, q))
+        return;
+    if (node.items) {
+        for (const i of node.items) {
+            const it = items[i];
+            if (intersects(it.aabb, q))
+                out.push(it.id);
+        }
+        return;
+    }
+    if (node.left)
+        queryAabbNode(node.left, q, items, out);
+    if (node.right)
+        queryAabbNode(node.right, q, items, out);
+}
+/** Dual-traversal self-pair emission. */
+function selfPair(node, items, eps, out) {
+    if (node.items) {
+        emitLeafPairs(node.items, items, eps, out);
+        return;
+    }
+    if (node.left)
+        selfPair(node.left, items, eps, out);
+    if (node.right)
+        selfPair(node.right, items, eps, out);
+    if (node.left && node.right)
+        crossPair(node.left, node.right, items, eps, out);
+}
+function crossPair(a, b, items, eps, out) {
+    if (!boundsOverlapInflated(a.bounds, b.bounds, eps))
+        return;
+    if (a.items && b.items) {
+        emitLeafCross(a.items, b.items, items, eps, out);
+        return;
+    }
+    // Descend the larger side first to keep recursion depth bounded.
+    if (a.items) {
+        if (b.left)
+            crossPair(a, b.left, items, eps, out);
+        if (b.right)
+            crossPair(a, b.right, items, eps, out);
+        return;
+    }
+    if (b.items) {
+        if (a.left)
+            crossPair(a.left, b, items, eps, out);
+        if (a.right)
+            crossPair(a.right, b, items, eps, out);
+        return;
+    }
+    if (a.left) {
+        if (b.left)
+            crossPair(a.left, b.left, items, eps, out);
+        if (b.right)
+            crossPair(a.left, b.right, items, eps, out);
+    }
+    if (a.right) {
+        if (b.left)
+            crossPair(a.right, b.left, items, eps, out);
+        if (b.right)
+            crossPair(a.right, b.right, items, eps, out);
+    }
+}
+function emitLeafPairs(leaf, items, eps, out) {
+    for (let i = 0; i < leaf.length; i++) {
+        const ia = leaf[i];
+        const a = items[ia];
+        for (let j = i + 1; j < leaf.length; j++) {
+            const ib = leaf[j];
+            const b = items[ib];
+            if (boundsOverlapInflated(a.aabb, b.aabb, eps))
+                out.push([a.id, b.id]);
+        }
+    }
+}
+function emitLeafCross(aLeaf, bLeaf, items, eps, out) {
+    for (const ia of aLeaf) {
+        const a = items[ia];
+        for (const ib of bLeaf) {
+            const b = items[ib];
+            if (a.id === b.id)
+                continue;
+            if (boundsOverlapInflated(a.aabb, b.aabb, eps))
+                out.push([a.id, b.id]);
+        }
+    }
+}
+function boundsOverlapInflated(a, b, eps) {
+    if (eps === 0)
+        return intersects(a, b);
+    return (a.min[0] - eps <= b.max[0] + eps &&
+        a.max[0] + eps >= b.min[0] - eps &&
+        a.min[1] - eps <= b.max[1] + eps &&
+        a.max[1] + eps >= b.min[1] - eps &&
+        a.min[2] - eps <= b.max[2] + eps &&
+        a.max[2] + eps >= b.min[2] - eps);
+}
+//# sourceMappingURL=bvh.js.map

package/dist/contact/bvh.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvh.js","sourceRoot":"","sources":["../../src/contact/bvh.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AA0BnF,MAAM,OAAO,GAAG;IACL,IAAI,CAAiB;IACrB,KAAK,CAAwB;IAEtC,YAAoB,IAAoB,EAAE,KAA4B;QACpE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,qFAAqF;IACrF,MAAM,CAAC,KAAK,CAAC,KAA4B,EAAE,OAAmB,EAAE;QAC9D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QACjD,OAAO,IAAI,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,mFAAmF;IACnF,SAAS,CAAC,CAAO;QACf,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC7C,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,OAAO,GAAG,CAAC;QACpB,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;QAC9C,2EAA2E;QAC3E,qEAAqE;QACrE,uEAAuE;QACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAqB,CAAC;YACrC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAChB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC5E,CAAC;QACF,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAID,SAAS,SAAS,CAAC,KAA4B,EAAE,OAAiB,EAAE,QAAgB;IAClF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAC3C,CAAC;IACD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAC3B,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAG,KAAK,CAAC,GAAG,CAAgB,CAAC,IAAI,CAAC,EAC7D,UAAU,CACX,CAAC;IACF,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC/B,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;IAC5C,CAAC;IACD,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IACjC,mEAAmE;IACnE,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;QACtB,MAAM,EAAE,GAAG,MAAM,CAAE,KAAK,CAAC,EAAE,CAAgB,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;QACxD,MAAM,EAAE,GAAG,MAAM,CAAE,KAAK,CAAC,EAAE,CAAgB,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;QACxD,OAAO,EAAE,GAAG,EAAE,CAAC;IACjB,CAAC,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;IAChC,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACpC,OAAO;QACL,MAAM;QACN,IAAI,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC;QACzC,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC;KAC5C,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,IAAa,EAAE,CAAO,EAAE,KAA4B,EAAE,GAAa;IACxF,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QAAE,OAAO;IACxC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAe,CAAC;YAClC,IAAI,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO;IACT,CAAC;IACD,IAAI,IAAI,CAAC,IAAI;QAAE,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IACvD,IAAI,IAAI,CAAC,KAAK;QAAE,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;AAC3D,CAAC;AAED,yCAAyC;AACzC,SAAS,QAAQ,CAAC,IAAa,EAAE,KAA4B,EAAE,GAAW,EAAE,GAAa;IACvF,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC3C,OAAO;IACT,CAAC;IACD,IAAI,IAAI,CAAC,IAAI;QAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACpD,IAAI,IAAI,CAAC,KAAK;QAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACtD,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK;QAAE,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACjF,CAAC;AAED,SAAS,SAAS,CAChB,CAAU,EACV,CAAU,EACV,KAA4B,EAC5B,GAAW,EACX,GAAa;IAEb,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC;QAAE,OAAO;IAC5D,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACvB,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACjD,OAAO;IACT,CAAC;IACD,iEAAiE;IACjE,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACZ,IAAI,CAAC,CAAC,IAAI;YAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAClD,IAAI,CAAC,CAAC,KAAK;YAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACpD,OAAO;IACT,CAAC;IACD,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACZ,IAAI,CAAC,CAAC,IAAI;YAAE,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAClD,IAAI,CAAC,CAAC,KAAK;YAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACpD,OAAO;IACT,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACX,IAAI,CAAC,CAAC,IAAI;YAAE,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACvD,IAAI,CAAC,CAAC,KAAK;YAAE,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3D,CAAC;IACD,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACZ,IAAI,CAAC,CAAC,IAAI;YAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACxD,IAAI,CAAC,CAAC,KAAK;YAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CACpB,IAAuB,EACvB,KAA4B,EAC5B,GAAW,EACX,GAAa;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;QAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAe,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;YAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAe,CAAC;YAClC,IAAI,qBAAqB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CACpB,KAAwB,EACxB,KAAwB,EACxB,KAA4B,EAC5B,GAAW,EACX,GAAa;IAEb,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAe,CAAC;QAClC,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAe,CAAC;YAClC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE;gBAAE,SAAS;YAC5B,IAAI,qBAAqB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAAC,CAAO,EAAE,CAAO,EAAE,GAAW;IAC1D,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,OAAO,CACL,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG;QAChC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG;QAChC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG;QAChC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG;QAChC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG;QAChC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CACjC,CAAC;AACJ,CAAC"}

package/dist/contact/index.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Contact-interface geometry for a single pair of meshes.
+ *
+ * Where the AABB clash box is a crude proxy, this returns the REAL contact
+ * patch: the shared-face polygon for coplanar/flush overlaps (surface), the
+ * intersection line for crossings (line), or a point — classified by area and
+ * length. It is built from a Moller triangle-triangle test (which reports the
+ * intersection segment for crossings and the coplanar case) followed by
+ * shared-face clustering: coplanar triangle pairs are Sutherland-Hodgman clipped
+ * on their common plane and unioned into a boundary polygon; cross pairs union
+ * their segments along the intersection line.
+ *
+ * Intended for on-demand use on the FOCUSED clash (one pair), not the bulk
+ * detection sweep — clustering every clash would be far too expensive.
+ */
+import { narrowPhase, type NarrowPhaseOptions } from './narrow-phase.js';
+import { clusterSharedFaces, type SharedFaceCluster, type SharedFaceOptions } from './shared-faces.js';
+import type { Mesh } from './types.js';
+export type { Mesh, Vec3, AABB } from './types.js';
+export type { SharedFaceCluster, SharedFaceOptions } from './shared-faces.js';
+export type { TrianglePair, NarrowPhaseOptions } from './narrow-phase.js';
+export { narrowPhase, clusterSharedFaces };
+export interface ContactOptions extends NarrowPhaseOptions, SharedFaceOptions {
+}
+/**
+ * Compute the contact interface(s) between two world-space meshes: the real
+ * shared-face polygon (surface), intersection line, or point — not an AABB.
+ * Returns an empty array when the triangles neither cross nor share a plane.
+ */
+export declare function contactClusters(a: Mesh, b: Mesh, opts?: ContactOptions): SharedFaceCluster[];
+//# sourceMappingURL=index.d.ts.map

package/dist/contact/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/contact/index.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,WAAW,EAAE,KAAK,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACzE,OAAO,EACL,kBAAkB,EAClB,KAAK,iBAAiB,EACtB,KAAK,iBAAiB,EACvB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAE,IAAI,EAAQ,MAAM,YAAY,CAAC;AAE7C,YAAY,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AACnD,YAAY,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAC9E,YAAY,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAC1E,OAAO,EAAE,WAAW,EAAE,kBAAkB,EAAE,CAAC;AAE3C,MAAM,WAAW,cAAe,SAAQ,kBAAkB,EAAE,iBAAiB;CAAG;AAEhF;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,GAAE,cAAmB,GAAG,iBAAiB,EAAE,CAIhG"}

package/dist/contact/index.js

@@ -0,0 +1,33 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+/**
+ * Contact-interface geometry for a single pair of meshes.
+ *
+ * Where the AABB clash box is a crude proxy, this returns the REAL contact
+ * patch: the shared-face polygon for coplanar/flush overlaps (surface), the
+ * intersection line for crossings (line), or a point — classified by area and
+ * length. It is built from a Moller triangle-triangle test (which reports the
+ * intersection segment for crossings and the coplanar case) followed by
+ * shared-face clustering: coplanar triangle pairs are Sutherland-Hodgman clipped
+ * on their common plane and unioned into a boundary polygon; cross pairs union
+ * their segments along the intersection line.
+ *
+ * Intended for on-demand use on the FOCUSED clash (one pair), not the bulk
+ * detection sweep — clustering every clash would be far too expensive.
+ */
+import { narrowPhase } from './narrow-phase.js';
+import { clusterSharedFaces, } from './shared-faces.js';
+export { narrowPhase, clusterSharedFaces };
+/**
+ * Compute the contact interface(s) between two world-space meshes: the real
+ * shared-face polygon (surface), intersection line, or point — not an AABB.
+ * Returns an empty array when the triangles neither cross nor share a plane.
+ */
+export function contactClusters(a, b, opts = {}) {
+    const pairs = narrowPhase(a, b, opts);
+    if (pairs.length === 0)
+        return [];
+    return clusterSharedFaces(pairs, opts);
+}
+//# sourceMappingURL=index.js.map

package/dist/contact/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/contact/index.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,WAAW,EAA2B,MAAM,mBAAmB,CAAC;AACzE,OAAO,EACL,kBAAkB,GAGnB,MAAM,mBAAmB,CAAC;AAM3B,OAAO,EAAE,WAAW,EAAE,kBAAkB,EAAE,CAAC;AAI3C;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,CAAO,EAAE,CAAO,EAAE,OAAuB,EAAE;IACzE,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,OAAO,kBAAkB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACzC,CAAC"}

package/dist/contact/mesh-bvh.d.ts

@@ -0,0 +1,21 @@
+import { Bvh } from "./bvh.js";
+import type { Mesh } from "./types.js";
+/**
+ * A BVH over a mesh's triangles. Item ids are stringified triangle indices.
+ * Cross-traversal between two MeshBvh yields candidate triangle-pair indices.
+ */
+export interface MeshBvh {
+    readonly mesh: Mesh;
+    readonly bvh: Bvh;
+}
+export declare function buildMeshBvh(mesh: Mesh, leafSize?: number): MeshBvh;
+/**
+ * Cross-query two MeshBvh instances. Returns candidate triangle-index pairs
+ * `(iA, iB)` where iA is in `a.mesh` and iB is in `b.mesh`, whose AABBs
+ * (inflated by `epsilon`) overlap.
+ *
+ * Pairs are not canonicalised — both meshes are distinct inputs, so order
+ * is preserved (A first, B second).
+ */
+export declare function queryMeshCross(a: MeshBvh, b: MeshBvh, epsilon?: number): Array<readonly [number, number]>;
+//# sourceMappingURL=mesh-bvh.d.ts.map

package/dist/contact/mesh-bvh.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mesh-bvh.d.ts","sourceRoot":"","sources":["../../src/contact/mesh-bvh.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AAE/B,OAAO,KAAK,EAAE,IAAI,EAAc,MAAM,YAAY,CAAC;AAEnD;;;GAGG;AACH,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC;CACnB;AAED,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,SAAI,GAAG,OAAO,CAO9D;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAC5B,CAAC,EAAE,OAAO,EACV,CAAC,EAAE,OAAO,EACV,OAAO,SAAI,GACV,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAelC"}