@ifc-lite/clash 1.2.0 → 1.3.0

package/dist/contact/narrow-phase.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"narrow-phase.js","sourceRoot":"","sources":["../../src/contact/narrow-phase.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAC7D,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAE/C,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AA+B1D;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,CAAO,EAAE,CAAO,EAAE,OAA2B,EAAE;IACzE,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC;IACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;IAEpC,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEhE,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACvC,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAEvD,MAAM,GAAG,GAAmB,EAAE,CAAC;IAC/B,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/B,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QAClD,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QAClC,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC5B,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;QACvE,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,IAAI,CAAC;gBACP,IAAI,EAAE,EAAE;gBACR,IAAI,EAAE,EAAE;gBACR,CAAC,EAAE,IAAI;gBACP,CAAC,EAAE,IAAI;gBACP,IAAI,EAAE,OAAO;gBACb,EAAE,EAAE,GAAG,CAAC,EAAE;gBACV,EAAE,EAAE,GAAG,CAAC,EAAE;aACX,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/contact/plane.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Plane utilities. A plane is stored as a unit normal + signed offset:
+ *   normal · x = offset
+ * `canonicalPlane` produces a direction-independent key so that the pair
+ * (normal, -normal, offset, -offset) hashes identically.
+ */
+import type { Vec3 } from "./types.js";
+export interface Plane {
+    readonly normal: Vec3;
+    readonly offset: number;
+}
+export interface PlaneBasis {
+    readonly origin: Vec3;
+    readonly u: Vec3;
+    readonly v: Vec3;
+    readonly normal: Vec3;
+}
+/** Build a plane from a normal (not required to be unit) and a point on it. */
+export declare function planeFromNormalPoint(normal: Vec3, point: Vec3): Plane;
+/**
+ * Direction-independent quantised plane key.
+ *
+ * The normal is reflected so its first nonzero component is positive,
+ * then rounded to `angleSnap` radians in spherical form. The offset is
+ * signed accordingly and rounded to `distSnap` world units.
+ */
+export declare function planeKey(plane: Plane, angleSnap?: number, distSnap?: number): string;
+/**
+ * Build an orthonormal basis `{u, v}` in the plane so 3D plane points can
+ * be projected to 2D and back. `origin` is chosen as the foot of the normal
+ * from the world origin.
+ */
+export declare function planeBasis(plane: Plane): PlaneBasis;
+/** Project a 3D point onto the plane's 2D basis. */
+export declare function projectTo2D(basis: PlaneBasis, p: Vec3): readonly [number, number];
+/** Lift a 2D basis point back to 3D. */
+export declare function liftTo3D(basis: PlaneBasis, p: readonly [number, number]): Vec3;
+//# sourceMappingURL=plane.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"plane.d.ts","sourceRoot":"","sources":["../../src/contact/plane.ts"],"names":[],"mappings":"AAIA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAGvC,MAAM,WAAW,KAAK;IACpB,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;IACtB,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC;IACjB,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC;IACjB,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;CACvB;AAED,+EAA+E;AAC/E,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,KAAK,CAKrE;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,SAAO,EAAE,QAAQ,SAAO,GAAG,MAAM,CAmBhF;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,UAAU,CAenD;AAED,oDAAoD;AACpD,wBAAgB,WAAW,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAQjF;AAED,wCAAwC;AACxC,wBAAgB,QAAQ,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAM9E"}

package/dist/contact/plane.js

@@ -0,0 +1,83 @@
+/* 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 { dot3, length3 } from "./vec3.js";
+/** Build a plane from a normal (not required to be unit) and a point on it. */
+export function planeFromNormalPoint(normal, point) {
+    const ln = length3(normal);
+    if (ln === 0)
+        return { normal: [0, 0, 1], offset: 0 };
+    const n = [normal[0] / ln, normal[1] / ln, normal[2] / ln];
+    return { normal: n, offset: dot3(n, point) };
+}
+/**
+ * Direction-independent quantised plane key.
+ *
+ * The normal is reflected so its first nonzero component is positive,
+ * then rounded to `angleSnap` radians in spherical form. The offset is
+ * signed accordingly and rounded to `distSnap` world units.
+ */
+export function planeKey(plane, angleSnap = 1e-3, distSnap = 1e-3) {
+    const n = plane.normal;
+    const ln = length3(n);
+    if (ln === 0)
+        return "0|0|0|0";
+    // Canonicalise direction: first nonzero coordinate must be positive.
+    let sign = 1;
+    if (Math.abs(n[0]) > 1e-9)
+        sign = n[0] > 0 ? 1 : -1;
+    else if (Math.abs(n[1]) > 1e-9)
+        sign = n[1] > 0 ? 1 : -1;
+    else
+        sign = n[2] > 0 ? 1 : -1;
+    const cx = (n[0] / ln) * sign;
+    const cy = (n[1] / ln) * sign;
+    const cz = (n[2] / ln) * sign;
+    const off = plane.offset * sign;
+    return [
+        Math.round(cx / angleSnap),
+        Math.round(cy / angleSnap),
+        Math.round(cz / angleSnap),
+        Math.round(off / distSnap),
+    ].join("|");
+}
+/**
+ * Build an orthonormal basis `{u, v}` in the plane so 3D plane points can
+ * be projected to 2D and back. `origin` is chosen as the foot of the normal
+ * from the world origin.
+ */
+export function planeBasis(plane) {
+    const n = plane.normal;
+    // origin = offset * n (foot of normal from world origin if |n|=1)
+    const origin = [n[0] * plane.offset, n[1] * plane.offset, n[2] * plane.offset];
+    // pick a helper not parallel to n
+    const helper = Math.abs(n[0]) < 0.9 ? [1, 0, 0] : [0, 1, 0];
+    const u0 = [
+        helper[1] * n[2] - helper[2] * n[1],
+        helper[2] * n[0] - helper[0] * n[2],
+        helper[0] * n[1] - helper[1] * n[0],
+    ];
+    const uLen = length3(u0);
+    const u = uLen === 0 ? [1, 0, 0] : [u0[0] / uLen, u0[1] / uLen, u0[2] / uLen];
+    const v = [n[1] * u[2] - n[2] * u[1], n[2] * u[0] - n[0] * u[2], n[0] * u[1] - n[1] * u[0]];
+    return { origin, u, v, normal: n };
+}
+/** Project a 3D point onto the plane's 2D basis. */
+export function projectTo2D(basis, p) {
+    const dx = p[0] - basis.origin[0];
+    const dy = p[1] - basis.origin[1];
+    const dz = p[2] - basis.origin[2];
+    return [
+        dx * basis.u[0] + dy * basis.u[1] + dz * basis.u[2],
+        dx * basis.v[0] + dy * basis.v[1] + dz * basis.v[2],
+    ];
+}
+/** Lift a 2D basis point back to 3D. */
+export function liftTo3D(basis, p) {
+    return [
+        basis.origin[0] + basis.u[0] * p[0] + basis.v[0] * p[1],
+        basis.origin[1] + basis.u[1] * p[0] + basis.v[1] * p[1],
+        basis.origin[2] + basis.u[2] * p[0] + basis.v[2] * p[1],
+    ];
+}
+//# sourceMappingURL=plane.js.map

package/dist/contact/plane.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"plane.js","sourceRoot":"","sources":["../../src/contact/plane.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAU/D,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAc1C,+EAA+E;AAC/E,MAAM,UAAU,oBAAoB,CAAC,MAAY,EAAE,KAAW;IAC5D,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC3B,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACtD,MAAM,CAAC,GAAS,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACjE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;AAC/C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAY,EAAE,SAAS,GAAG,IAAI,EAAE,QAAQ,GAAG,IAAI;IACtE,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACtB,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC/B,qEAAqE;IACrE,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;QAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC/C,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;QAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;QACpD,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;IAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;IAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;IAC9B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;IAChC,OAAO;QACL,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,SAAS,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,SAAS,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,SAAS,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,QAAQ,CAAC;KAC3B,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,KAAY;IACrC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,kEAAkE;IAClE,MAAM,MAAM,GAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IACrF,kCAAkC;IAClC,MAAM,MAAM,GAAS,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClE,MAAM,EAAE,GAAS;QACf,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;KACpC,CAAC;IACF,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IACzB,MAAM,CAAC,GAAS,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACpF,MAAM,CAAC,GAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClG,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;AACrC,CAAC;AAED,oDAAoD;AACpD,MAAM,UAAU,WAAW,CAAC,KAAiB,EAAE,CAAO;IACpD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,OAAO;QACL,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;KACpD,CAAC;AACJ,CAAC;AAED,wCAAwC;AACxC,MAAM,UAAU,QAAQ,CAAC,KAAiB,EAAE,CAA4B;IACtE,OAAO;QACL,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;KACxD,CAAC;AACJ,CAAC"}

package/dist/contact/polygon-clip.d.ts

@@ -0,0 +1,27 @@
+/**
+ * 2D polygon utilities: Sutherland–Hodgman clip of a subject polygon by
+ * a convex clip polygon, shoelace area, perimeter, centroid.
+ *
+ * Both polygons are arrays of `[x, y]` pairs. CCW winding gives positive
+ * area (standard convention).
+ */
+export type Point2 = readonly [number, number];
+export type Polygon2 = readonly Point2[];
+/** Shoelace-formula signed area (positive when CCW). */
+export declare function polygonSignedArea(poly: Polygon2): number;
+export declare const polygonArea: (poly: Polygon2) => number;
+export declare function polygonPerimeter(poly: Polygon2): number;
+/** Area-weighted centroid. Falls back to vertex mean for degenerate input. */
+export declare function polygonCentroid(poly: Polygon2): Point2;
+/**
+ * Sutherland–Hodgman polygon clip. `subject` may be any simple polygon;
+ * `clip` must be **convex** (CCW). Returns the intersection polygon, which
+ * can be empty (no overlap) or degenerate (collinear/point contact).
+ */
+export declare function sutherlandHodgman(subject: Polygon2, clip: Polygon2): Polygon2;
+/**
+ * Convex polygon from (unordered) points: sort by angle around centroid
+ * and return CCW. For use as a Sutherland-Hodgman clip.
+ */
+export declare function convexHull2(points: Polygon2): Polygon2;
+//# sourceMappingURL=polygon-clip.d.ts.map

package/dist/contact/polygon-clip.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"polygon-clip.d.ts","sourceRoot":"","sources":["../../src/contact/polygon-clip.ts"],"names":[],"mappings":"AAIA;;;;;;GAMG;AAEH,MAAM,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAC/C,MAAM,MAAM,QAAQ,GAAG,SAAS,MAAM,EAAE,CAAC;AAEzC,wDAAwD;AACxD,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAUxD;AAED,eAAO,MAAM,WAAW,GAAI,MAAM,QAAQ,KAAG,MAA2C,CAAC;AAEzF,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAYvD;AAED,8EAA8E;AAC9E,wBAAgB,eAAe,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CA2BtD;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,GAAG,QAAQ,CA8B7E;AAsBD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,QAAQ,GAAG,QAAQ,CA4BtD"}

package/dist/contact/polygon-clip.js

@@ -0,0 +1,162 @@
+/* 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/. */
+/** Shoelace-formula signed area (positive when CCW). */
+export function polygonSignedArea(poly) {
+    const n = poly.length;
+    if (n < 3)
+        return 0;
+    let sum = 0;
+    for (let i = 0; i < n; i++) {
+        const a = poly[i];
+        const b = poly[(i + 1) % n];
+        sum += a[0] * b[1] - b[0] * a[1];
+    }
+    return sum / 2;
+}
+export const polygonArea = (poly) => Math.abs(polygonSignedArea(poly));
+export function polygonPerimeter(poly) {
+    const n = poly.length;
+    if (n < 2)
+        return 0;
+    let sum = 0;
+    for (let i = 0; i < n; i++) {
+        const a = poly[i];
+        const b = poly[(i + 1) % n];
+        const dx = b[0] - a[0];
+        const dy = b[1] - a[1];
+        sum += Math.sqrt(dx * dx + dy * dy);
+    }
+    return sum;
+}
+/** Area-weighted centroid. Falls back to vertex mean for degenerate input. */
+export function polygonCentroid(poly) {
+    const n = poly.length;
+    if (n === 0)
+        return [0, 0];
+    if (n === 1) {
+        const p0 = poly[0];
+        return [p0[0], p0[1]];
+    }
+    const a2 = polygonSignedArea(poly) * 2;
+    if (Math.abs(a2) < 1e-18) {
+        let mx = 0;
+        let my = 0;
+        for (const p of poly) {
+            mx += p[0];
+            my += p[1];
+        }
+        return [mx / n, my / n];
+    }
+    let cx = 0;
+    let cy = 0;
+    for (let i = 0; i < n; i++) {
+        const a = poly[i];
+        const b = poly[(i + 1) % n];
+        const cross = a[0] * b[1] - b[0] * a[1];
+        cx += (a[0] + b[0]) * cross;
+        cy += (a[1] + b[1]) * cross;
+    }
+    return [cx / (3 * a2), cy / (3 * a2)];
+}
+/**
+ * Sutherland–Hodgman polygon clip. `subject` may be any simple polygon;
+ * `clip` must be **convex** (CCW). Returns the intersection polygon, which
+ * can be empty (no overlap) or degenerate (collinear/point contact).
+ */
+export function sutherlandHodgman(subject, clip) {
+    if (subject.length === 0 || clip.length < 3)
+        return [];
+    // Enforce CCW clip — if the clip is CW we flip it.
+    const clipCCW = polygonSignedArea(clip) >= 0 ? clip : [...clip].reverse();
+    let output = subject.map((p) => [p[0], p[1]]);
+    for (let i = 0; i < clipCCW.length; i++) {
+        if (output.length === 0)
+            break;
+        const a = clipCCW[i];
+        const b = clipCCW[(i + 1) % clipCCW.length];
+        const input = output;
+        output = [];
+        for (let j = 0; j < input.length; j++) {
+            const current = input[j];
+            const prev = input[(j - 1 + input.length) % input.length];
+            const curIn = isLeftOrOn(a, b, current);
+            const prevIn = isLeftOrOn(a, b, prev);
+            if (curIn) {
+                if (!prevIn) {
+                    const ip = segmentIntersection(prev, current, a, b);
+                    if (ip)
+                        output.push(ip);
+                }
+                output.push(current);
+            }
+            else if (prevIn) {
+                const ip = segmentIntersection(prev, current, a, b);
+                if (ip)
+                    output.push(ip);
+            }
+        }
+    }
+    return output;
+}
+/** True when point `p` is to the left of, or on, directed edge `a → b`. */
+function isLeftOrOn(a, b, p) {
+    const cross = (b[0] - a[0]) * (p[1] - a[1]) - (b[1] - a[1]) * (p[0] - a[0]);
+    return cross >= 0;
+}
+/** Intersection of segment `p1→p2` with infinite line through `a→b`. */
+function segmentIntersection(p1, p2, a, b) {
+    const r0 = p2[0] - p1[0];
+    const r1 = p2[1] - p1[1];
+    const s0 = b[0] - a[0];
+    const s1 = b[1] - a[1];
+    const denom = r0 * s1 - r1 * s0;
+    if (Math.abs(denom) < 1e-15)
+        return null; // parallel
+    const qp0 = a[0] - p1[0];
+    const qp1 = a[1] - p1[1];
+    const t = (qp0 * s1 - qp1 * s0) / denom;
+    return [p1[0] + t * r0, p1[1] + t * r1];
+}
+/**
+ * Convex polygon from (unordered) points: sort by angle around centroid
+ * and return CCW. For use as a Sutherland-Hodgman clip.
+ */
+export function convexHull2(points) {
+    if (points.length < 3)
+        return points.map((p) => [p[0], p[1]]);
+    // Andrew's monotone chain
+    const pts = [...points].sort((a, b) => (a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]));
+    const lower = [];
+    for (const p of pts) {
+        while (lower.length >= 2) {
+            const a = lower[lower.length - 2];
+            const b = lower[lower.length - 1];
+            if (cross2(a, b, p) <= 0)
+                lower.pop();
+            else
+                break;
+        }
+        lower.push(p);
+    }
+    const upper = [];
+    for (let i = pts.length - 1; i >= 0; i--) {
+        const p = pts[i];
+        while (upper.length >= 2) {
+            const a = upper[upper.length - 2];
+            const b = upper[upper.length - 1];
+            if (cross2(a, b, p) <= 0)
+                upper.pop();
+            else
+                break;
+        }
+        upper.push(p);
+    }
+    lower.pop();
+    upper.pop();
+    return [...lower, ...upper];
+}
+function cross2(o, a, b) {
+    return (a[0] - o[0]) * (b[1] - o[1]) - (a[1] - o[1]) * (b[0] - o[0]);
+}
+//# sourceMappingURL=polygon-clip.js.map

package/dist/contact/polygon-clip.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"polygon-clip.js","sourceRoot":"","sources":["../../src/contact/polygon-clip.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAa/D,wDAAwD;AACxD,MAAM,UAAU,iBAAiB,CAAC,IAAc;IAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;QACtC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,GAAG,GAAG,CAAC,CAAC;AACjB,CAAC;AAED,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,IAAc,EAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC;AAEzF,MAAM,UAAU,gBAAgB,CAAC,IAAc;IAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;QACtC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,eAAe,CAAC,IAAc;IAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;QAC7B,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC;QACzB,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACX,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACb,CAAC;QACD,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;QACtC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QAC5B,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IAC9B,CAAC;IACD,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAiB,EAAE,IAAc;IACjE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IACvD,mDAAmD;IACnD,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;IAC1E,IAAI,MAAM,GAAa,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAW,CAAC,CAAC;IAElE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAW,CAAC;QAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAW,CAAC;QACtD,MAAM,KAAK,GAAG,MAAM,CAAC;QACrB,MAAM,GAAG,EAAE,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;YACnC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAW,CAAC;YACpE,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YACtC,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,CAAC,MAAM,EAAE,CAAC;oBACZ,MAAM,EAAE,GAAG,mBAAmB,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpD,IAAI,EAAE;wBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC1B,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,CAAC;iBAAM,IAAI,MAAM,EAAE,CAAC;gBAClB,MAAM,EAAE,GAAG,mBAAmB,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBACpD,IAAI,EAAE;oBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,2EAA2E;AAC3E,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IACjD,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,OAAO,KAAK,IAAI,CAAC,CAAC;AACpB,CAAC;AAED,wEAAwE;AACxE,SAAS,mBAAmB,CAAC,EAAU,EAAE,EAAU,EAAE,CAAS,EAAE,CAAS;IACvE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAChC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK;QAAE,OAAO,IAAI,CAAC,CAAC,WAAW;IACrD,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;IACxC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;AAC1C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,MAAgB;IAC1C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAW,CAAC,CAAC;IACxE,0BAA0B;IAC1B,MAAM,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,OAAO,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAW,CAAC;YAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAW,CAAC;YAC5C,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;gBAAE,KAAK,CAAC,GAAG,EAAE,CAAC;;gBACjC,MAAM;QACb,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,CAAW,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAW,CAAC;QAC3B,OAAO,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAW,CAAC;YAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAW,CAAC;YAC5C,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;gBAAE,KAAK,CAAC,GAAG,EAAE,CAAC;;gBACjC,MAAM;QACb,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,KAAK,CAAC,GAAG,EAAE,CAAC;IACZ,KAAK,CAAC,GAAG,EAAE,CAAC;IACZ,OAAO,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IAC7C,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACvE,CAAC"}

package/dist/contact/shared-faces.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Shared-face clustering.
+ *
+ * Inputs: TrianglePair[] emitted by narrowPhase() for a single pair of
+ * elements. Output: one or more SharedFaceCluster objects, each representing
+ * a distinct contact between the two elements, classified as
+ * surface / line / point.
+ *
+ * Coplanar pairs cluster by plane key. For each cluster we Sutherland-Hodgman
+ * every (A,B) triangle pair on the shared plane, sum polygon areas, build a
+ * 3D boundary polygon as the convex hull of the union of clip vertices.
+ *
+ * Cross pairs cluster by intersection-line key (direction + point on line).
+ * Length is the union length of the per-pair 3D segments projected onto
+ * the line direction.
+ *
+ * Remaining incidental contacts fall into either classification by
+ * magnitude against the thresholds.
+ */
+import type { TrianglePair } from "./narrow-phase.js";
+import type { Plane } from "./plane.js";
+import type { Vec3 } from "./types.js";
+export interface SharedFaceCluster {
+    readonly kind: "surface" | "line" | "point";
+    /** Anchoring plane (for surface) or line (for line/point, where direction is the line dir). */
+    readonly plane?: Plane;
+    /** World-space centroid of the contact. */
+    readonly centroid: Vec3;
+    /** Outward normal (surface) or line direction (line/point). */
+    readonly normal: Vec3;
+    /** Shared-face area in m² (surface only — 0 otherwise). */
+    readonly area_m2: number;
+    /** Shared-line length in m (line only — 0 otherwise). */
+    readonly length_m: number;
+    /** Narrowest dimension of the contact patch in m. Distinguishes a broad
+     *  face (layered wall) from a thin bearing strip / cap. Length for a line
+     *  cluster is carried by `length_m`, so its `spanMin` is 0. */
+    readonly spanMin: number;
+    /** Widest dimension (diameter) of the contact patch in m. */
+    readonly spanMax: number;
+    /** Boundary polygon (3D) for surface contacts. Segment endpoints for line contacts. Empty for point. */
+    readonly boundary: readonly Vec3[];
+    /** Contributing triangle pairs. */
+    readonly pairs: readonly TrianglePair[];
+}
+export interface SharedFaceOptions {
+    /** Absolute tolerance for plane coincidence (unit: model-native length). Default 1e-3. */
+    readonly planeDistSnap?: number;
+    /** Angular snap for plane normal hashing (unitless, ~1 − cos). Default 1e-3. */
+    readonly planeAngleSnap?: number;
+    /** Area (m²) threshold: ≥ surface. Default 0.01. */
+    readonly surfaceAreaM2?: number;
+    /** Area (m²) below which a contact may still be line or point. Default 0.001. */
+    readonly pointAreaM2?: number;
+    /** Length (m) threshold: ≥ line. Default 0.05. */
+    readonly lineLengthM?: number;
+    /** Snap used when hashing intersection-line direction + base point. Default 1e-3. */
+    readonly lineSnap?: number;
+}
+export declare function clusterSharedFaces(pairs: readonly TrianglePair[], opts?: SharedFaceOptions): SharedFaceCluster[];
+//# sourceMappingURL=shared-faces.d.ts.map

package/dist/contact/shared-faces.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared-faces.d.ts","sourceRoot":"","sources":["../../src/contact/shared-faces.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAKxC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAGvC,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,GAAG,OAAO,CAAC;IAC5C,+FAA+F;IAC/F,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;IACvB,2CAA2C;IAC3C,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC;IACxB,+DAA+D;IAC/D,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;IACtB,2DAA2D;IAC3D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,yDAAyD;IACzD,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;;mEAE+D;IAC/D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,wGAAwG;IACxG,QAAQ,CAAC,QAAQ,EAAE,SAAS,IAAI,EAAE,CAAC;IACnC,mCAAmC;IACnC,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAC;CACzC;AAED,MAAM,WAAW,iBAAiB;IAChC,0FAA0F;IAC1F,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,gFAAgF;IAChF,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,oDAAoD;IACpD,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,iFAAiF;IACjF,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,kDAAkD;IAClD,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,qFAAqF;IACrF,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,SAAS,YAAY,EAAE,EAC9B,IAAI,GAAE,iBAAsB,GAC3B,iBAAiB,EAAE,CAiDrB"}

package/dist/contact/shared-faces.js

@@ -0,0 +1,251 @@
+/* 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 { liftTo3D, planeBasis, planeFromNormalPoint, planeKey, projectTo2D } from "./plane.js";
+import { convexHull2, polygonArea, polygonCentroid, sutherlandHodgman } from "./polygon-clip.js";
+import { triangleNormalRaw } from "./triangle.js";
+import { cross3, dot3, length3, normalize3 } from "./vec3.js";
+export function clusterSharedFaces(pairs, opts = {}) {
+    const planeDistSnap = opts.planeDistSnap ?? 1e-3;
+    const planeAngleSnap = opts.planeAngleSnap ?? 1e-3;
+    const lineSnap = opts.lineSnap ?? 1e-3;
+    const surfaceAreaM2 = opts.surfaceAreaM2 ?? 0.01;
+    const pointAreaM2 = opts.pointAreaM2 ?? 0.001;
+    const lineLengthM = opts.lineLengthM ?? 0.05;
+    if (pairs.length === 0)
+        return [];
+    // 1. Split into coplanar clusters and cross clusters.
+    const coplanarBuckets = new Map();
+    const crossBuckets = new Map();
+    for (const p of pairs) {
+        if (p.kind === "coplanar") {
+            const n = triangleNormalRaw(p.a);
+            const ln = length3(n);
+            if (ln === 0)
+                continue;
+            const plane = planeFromNormalPoint(n, p.a.v0);
+            const key = planeKey(plane, planeAngleSnap, planeDistSnap);
+            const entry = coplanarBuckets.get(key) ?? { plane, pairs: [] };
+            entry.pairs.push(p);
+            coplanarBuckets.set(key, entry);
+        }
+        else if (p.kind === "cross") {
+            const seg = [p.p1[0] - p.p0[0], p.p1[1] - p.p0[1], p.p1[2] - p.p0[2]];
+            const len = length3(seg);
+            if (len < 1e-12)
+                continue;
+            const dir = normalize3(seg);
+            // Canonicalise direction so parallel + anti-parallel hash identically.
+            const canon = canonicaliseDir(dir);
+            const base = closestPointOnLineFromOrigin(p.p0, canon);
+            const key = `${quant(canon[0], lineSnap)}|${quant(canon[1], lineSnap)}|${quant(canon[2], lineSnap)}|${quant(base[0], lineSnap)}|${quant(base[1], lineSnap)}|${quant(base[2], lineSnap)}`;
+            const entry = crossBuckets.get(key) ?? { dir: canon, point: base, pairs: [] };
+            entry.pairs.push(p);
+            crossBuckets.set(key, entry);
+        }
+    }
+    const out = [];
+    for (const { plane, pairs: bucketPairs } of coplanarBuckets.values()) {
+        out.push(classify(buildSurfaceCluster(plane, bucketPairs), surfaceAreaM2, pointAreaM2, lineLengthM));
+    }
+    for (const { dir, pairs: bucketPairs } of crossBuckets.values()) {
+        out.push(classify(buildLineCluster(dir, bucketPairs), surfaceAreaM2, pointAreaM2, lineLengthM));
+    }
+    return out;
+}
+// -------- surface / coplanar clusters --------
+function buildSurfaceCluster(plane, bucketPairs) {
+    const basis = planeBasis(plane);
+    let totalArea = 0;
+    const boundaryPts = [];
+    for (const p of bucketPairs) {
+        const pa = [projectTo2D(basis, p.a.v0), projectTo2D(basis, p.a.v1), projectTo2D(basis, p.a.v2)];
+        const pb = [projectTo2D(basis, p.b.v0), projectTo2D(basis, p.b.v1), projectTo2D(basis, p.b.v2)];
+        // Clip A against B; union of these clip polygons approximates the
+        // true shared face. For typical IFC meshes (tiled, non-overlapping)
+        // summed clip area ≤ true contact area ≤ the total area of A-triangles
+        // whose pair is in the bucket. We take the clipped sum.
+        const clipped = sutherlandHodgman(pa, pb);
+        if (clipped.length >= 3) {
+            totalArea += polygonArea(clipped);
+            boundaryPts.push(...clipped);
+        }
+    }
+    const boundary2d = boundaryPts.length >= 3 ? convexHull2(boundaryPts) : boundaryPts;
+    const centroid2d = boundary2d.length >= 3
+        ? polygonCentroid(boundary2d)
+        : boundary2d.length === 0
+            ? [0, 0]
+            : averagePoint2(boundary2d);
+    const centroid = liftTo3D(basis, centroid2d);
+    const boundary = boundary2d.map((p) => liftTo3D(basis, p));
+    const spans = polygonSpans(boundary2d);
+    return {
+        plane,
+        centroid,
+        normal: plane.normal,
+        area_m2: totalArea,
+        length_m: 0,
+        spanMin: spans.min,
+        spanMax: spans.max,
+        boundary,
+        pairs: bucketPairs,
+    };
+}
+/**
+ * Narrowest and widest dimensions of a convex 2D polygon (metres). `max` is
+ * the diameter (largest vertex-pair distance); `min` is the rotating-calipers
+ * width — the smallest gap between two parallel supporting lines. Degenerate
+ * (< 3 pts) polygons have width 0.
+ */
+function polygonSpans(pts) {
+    const n = pts.length;
+    if (n === 0)
+        return { min: 0, max: 0 };
+    let max = 0;
+    for (let i = 0; i < n; i++) {
+        for (let j = i + 1; j < n; j++) {
+            const a = pts[i];
+            const b = pts[j];
+            const d = Math.hypot(a[0] - b[0], a[1] - b[1]);
+            if (d > max)
+                max = d;
+        }
+    }
+    if (n < 3)
+        return { min: 0, max };
+    let min = Number.POSITIVE_INFINITY;
+    for (let i = 0; i < n; i++) {
+        const a = pts[i];
+        const b = pts[(i + 1) % n];
+        const ex = b[0] - a[0];
+        const ey = b[1] - a[1];
+        const elen = Math.hypot(ex, ey);
+        if (elen < 1e-12)
+            continue;
+        const nx = -ey / elen;
+        const ny = ex / elen;
+        let lo = Number.POSITIVE_INFINITY;
+        let hi = Number.NEGATIVE_INFINITY;
+        for (const p of pts) {
+            const d = (p[0] - a[0]) * nx + (p[1] - a[1]) * ny;
+            if (d < lo)
+                lo = d;
+            if (d > hi)
+                hi = d;
+        }
+        const width = hi - lo;
+        if (width < min)
+            min = width;
+    }
+    return { min: Number.isFinite(min) ? min : 0, max };
+}
+// -------- line / cross clusters --------
+function buildLineCluster(dir, bucketPairs) {
+    // Project every segment onto the line direction to get 1D intervals,
+    // union them, sum to get length.
+    const intervals = [];
+    let refPoint = null;
+    for (const p of bucketPairs) {
+        if (p.kind !== "cross")
+            continue;
+        if (!refPoint)
+            refPoint = p.p0;
+        const t0 = projectOnto(p.p0, refPoint, dir);
+        const t1 = projectOnto(p.p1, refPoint, dir);
+        intervals.push([Math.min(t0, t1), Math.max(t0, t1)]);
+    }
+    if (!refPoint || intervals.length === 0) {
+        return {
+            centroid: [0, 0, 0],
+            normal: dir,
+            area_m2: 0,
+            length_m: 0,
+            spanMin: 0,
+            spanMax: 0,
+            boundary: [],
+            pairs: bucketPairs,
+        };
+    }
+    intervals.sort((a, b) => a[0] - b[0]);
+    const merged = [];
+    for (const iv of intervals) {
+        if (merged.length === 0) {
+            merged.push([iv[0], iv[1]]);
+            continue;
+        }
+        const last = merged[merged.length - 1];
+        if (iv[0] <= last[1])
+            last[1] = Math.max(last[1], iv[1]);
+        else
+            merged.push([iv[0], iv[1]]);
+    }
+    const length = merged.reduce((s, iv) => s + (iv[1] - iv[0]), 0);
+    // Pick the union's overall min/max as the line's centroid basis.
+    const tMin = merged[0][0];
+    const tMax = merged[merged.length - 1][1];
+    const centroidT = (tMin + tMax) / 2;
+    const centroid = [
+        refPoint[0] + dir[0] * centroidT,
+        refPoint[1] + dir[1] * centroidT,
+        refPoint[2] + dir[2] * centroidT,
+    ];
+    const boundary = [
+        [refPoint[0] + dir[0] * tMin, refPoint[1] + dir[1] * tMin, refPoint[2] + dir[2] * tMin],
+        [refPoint[0] + dir[0] * tMax, refPoint[1] + dir[1] * tMax, refPoint[2] + dir[2] * tMax],
+    ];
+    return {
+        centroid,
+        normal: dir,
+        area_m2: 0,
+        length_m: length,
+        spanMin: 0,
+        spanMax: length,
+        boundary,
+        pairs: bucketPairs,
+    };
+}
+// -------- helpers --------
+function classify(base, surfaceAreaM2, pointAreaM2, lineLengthM) {
+    if (base.area_m2 >= surfaceAreaM2)
+        return { ...base, kind: "surface" };
+    if (base.length_m >= lineLengthM)
+        return { ...base, kind: "line" };
+    if (base.area_m2 >= pointAreaM2)
+        return { ...base, kind: "line" };
+    return { ...base, kind: "point" };
+}
+function canonicaliseDir(v) {
+    // Flip so the first significant component is positive.
+    if (Math.abs(v[0]) > 1e-9)
+        return v[0] > 0 ? v : [-v[0], -v[1], -v[2]];
+    if (Math.abs(v[1]) > 1e-9)
+        return v[1] > 0 ? v : [-v[0], -v[1], -v[2]];
+    return v[2] > 0 ? v : [-v[0], -v[1], -v[2]];
+}
+function closestPointOnLineFromOrigin(point, dir) {
+    const t = dot3(point, dir);
+    return [point[0] - dir[0] * t, point[1] - dir[1] * t, point[2] - dir[2] * t];
+}
+function projectOnto(point, refPoint, dir) {
+    return ((point[0] - refPoint[0]) * dir[0] +
+        (point[1] - refPoint[1]) * dir[1] +
+        (point[2] - refPoint[2]) * dir[2]);
+}
+function quant(x, snap) {
+    return Math.round(x / snap);
+}
+function averagePoint2(pts) {
+    if (pts.length === 0)
+        return [0, 0];
+    let x = 0;
+    let y = 0;
+    for (const p of pts) {
+        x += p[0];
+        y += p[1];
+    }
+    return [x / pts.length, y / pts.length];
+}
+// keep symbol imports that downstream modules may re-export
+void cross3;
+//# sourceMappingURL=shared-faces.js.map