@theerapat-s28/ts-structural-eng-tools 1.5.0 → 2.1.0

package/dist/esm/utils/matrix.js

@@ -0,0 +1,145 @@
+/** Returns an m×n zero matrix. */
+export const zeros = (m, n) => Array.from({ length: m }, () => new Array(n).fill(0));
+/** Returns the n×n identity matrix. */
+export const identity = (n) => {
+    const I = zeros(n, n);
+    for (let i = 0; i < n; i++)
+        I[i][i] = 1;
+    return I;
+};
+/** Returns the transpose of a matrix. */
+export const transpose = (A) => {
+    const m = A.length;
+    const n = A[0].length;
+    const T = zeros(n, m);
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++)
+            T[j][i] = A[i][j];
+    }
+    return T;
+};
+/** Returns the product A·B of an m×n and an n×p matrix. */
+export const matMul = (A, B) => {
+    const m = A.length;
+    const n = B.length;
+    const p = B[0].length;
+    const C = zeros(m, p);
+    for (let i = 0; i < m; i++) {
+        for (let k = 0; k < n; k++) {
+            const aik = A[i][k];
+            if (aik === 0)
+                continue;
+            for (let j = 0; j < p; j++)
+                C[i][j] += aik * B[k][j];
+        }
+    }
+    return C;
+};
+/** Returns the product A·x of an m×n matrix and an n-vector. */
+export const matVec = (A, x) => A.map((row) => row.reduce((sum, a, j) => sum + a * x[j], 0));
+/**
+ * Cholesky factorisation A = L·Lᵀ of a symmetric positive-definite matrix.
+ *
+ * @param A - Symmetric matrix (only the lower triangle is read)
+ * @param tolerance - A pivot at or below `tolerance` times its own diagonal term is treated as zero
+ * @returns The lower-triangular factor L, or `null` when A is not positive definite (singular or a mechanism)
+ */
+export const choleskyFactor = (A, tolerance = 1e-12) => {
+    const n = A.length;
+    const L = zeros(n, n);
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j <= i; j++) {
+            let sum = A[i][j];
+            for (let k = 0; k < j; k++)
+                sum -= L[i][k] * L[j][k];
+            if (i === j) {
+                if (!(sum > tolerance * A[i][i]))
+                    return null;
+                L[i][i] = Math.sqrt(sum);
+            }
+            else {
+                L[i][j] = sum / L[j][j];
+            }
+        }
+    }
+    return L;
+};
+/**
+ * Solves A·x = b from the Cholesky factor L of A (forward then back substitution), so one
+ * factorisation serves any number of right-hand sides.
+ *
+ * @param L - Lower-triangular factor from `choleskyFactor`
+ * @param b - Right-hand side
+ */
+export const choleskySolveFactored = (L, b) => {
+    const n = L.length;
+    const y = new Array(n).fill(0);
+    for (let i = 0; i < n; i++) {
+        let sum = b[i];
+        for (let k = 0; k < i; k++)
+            sum -= L[i][k] * y[k];
+        y[i] = sum / L[i][i];
+    }
+    const x = new Array(n).fill(0);
+    for (let i = n - 1; i >= 0; i--) {
+        let sum = y[i];
+        for (let k = i + 1; k < n; k++)
+            sum -= L[k][i] * x[k];
+        x[i] = sum / L[i][i];
+    }
+    return x;
+};
+/**
+ * Solves A·x = b for a symmetric positive-definite A by Cholesky factorisation.
+ *
+ * @param A - Symmetric matrix (only the lower triangle is read)
+ * @param b - Right-hand side
+ * @param tolerance - A pivot at or below `tolerance` times its own diagonal term is treated as zero
+ * @returns The solution, or `null` when A is not positive definite (singular or a mechanism)
+ */
+export const choleskySolve = (A, b, tolerance = 1e-12) => {
+    const L = choleskyFactor(A, tolerance);
+    return L ? choleskySolveFactored(L, b) : null;
+};
+/**
+ * Solves A·X = B for a general square A by Gaussian elimination with partial pivoting.
+ *
+ * @param A - n×n matrix
+ * @param B - n×p right-hand-side matrix
+ * @param tolerance - A pivot at or below `tolerance` times the largest entry of A is treated as zero
+ * @returns The n×p solution, or `null` when A is singular
+ */
+export const solveLinearSystem = (A, B, tolerance = 1e-12) => {
+    const n = A.length;
+    const p = B[0].length;
+    const M = A.map((row, i) => [...row, ...B[i]]);
+    const scale = Math.max(...A.map((row) => Math.max(...row.map(Math.abs))));
+    for (let col = 0; col < n; col++) {
+        let pivot = col;
+        for (let r = col + 1; r < n; r++) {
+            if (Math.abs(M[r][col]) > Math.abs(M[pivot][col]))
+                pivot = r;
+        }
+        if (!(Math.abs(M[pivot][col]) > tolerance * scale))
+            return null;
+        [M[col], M[pivot]] = [M[pivot], M[col]];
+        for (let r = col + 1; r < n; r++) {
+            const factor = M[r][col] / M[col][col];
+            if (factor === 0)
+                continue;
+            for (let c = col; c < n + p; c++)
+                M[r][c] -= factor * M[col][c];
+        }
+    }
+    const X = zeros(n, p);
+    for (let c = 0; c < p; c++) {
+        for (let i = n - 1; i >= 0; i--) {
+            let sum = M[i][n + c];
+            for (let k = i + 1; k < n; k++)
+                sum -= M[i][k] * X[k][c];
+            X[i][c] = sum / M[i][i];
+        }
+    }
+    return X;
+};
+//# sourceMappingURL=matrix.js.map

package/dist/esm/utils/matrix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../../../src/utils/matrix.ts"],"names":[],"mappings":"AAEA,kCAAkC;AAClC,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CACpD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAEhE,uCAAuC;AACvC,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAU,EAAE;IAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACxC,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF,yCAAyC;AACzC,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAS,EAAU,EAAE;IAC7C,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF,2DAA2D;AAC3D,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IACrD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,GAAG,KAAK,CAAC;gBAAE,SAAS;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF,gEAAgE;AAChE,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAW,EAAY,EAAE,CACzD,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAE/D;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,SAAS,GAAG,KAAK,EAAiB,EAAE;IAC5E,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,IAAI,CAAC,CAAC,GAAG,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAE,OAAO,IAAI,CAAC;gBAC9C,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3B,CAAC;iBAAM,CAAC;gBACN,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAS,EAAE,CAAW,EAAY,EAAE;IACxE,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,CAAW,EAAE,SAAS,GAAG,KAAK,EAAmB,EAAE;IAC1F,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACvC,OAAO,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAChD,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,SAAS,GAAG,KAAK,EAAiB,EAAE;IAC1F,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QACjC,IAAI,KAAK,GAAG,GAAG,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;gBAAE,KAAK,GAAG,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,GAAG,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAChE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACvC,IAAI,MAAM,KAAK,CAAC;gBAAE,SAAS;YAC3B,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IACD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC"}

package/dist/esm/utils/merge-warning.js

@@ -0,0 +1,11 @@
+/**
+ * Merges two warning arrays into a single combined array.
+ *
+ * @param existingWarnings - Warnings already accumulated
+ * @param newWarnings - Additional warnings to append
+ * @returns Combined warning array
+ */
+export const mergeWarnings = (existingWarnings, newWarnings) => {
+    return [...existingWarnings, ...newWarnings];
+};
+//# sourceMappingURL=merge-warning.js.map

package/dist/esm/utils/merge-warning.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge-warning.js","sourceRoot":"","sources":["../../../src/utils/merge-warning.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,gBAA0B,EAAE,WAAqB,EAAY,EAAE;IAC3F,OAAO,CAAC,GAAG,gBAAgB,EAAE,GAAG,WAAW,CAAC,CAAC;AAC/C,CAAC,CAAC"}

package/dist/esm/utils/skyline.js

@@ -0,0 +1,151 @@
+/** Creates a zero skyline matrix with the given first row of each column (`first[j] ≤ j`). */
+export const createSkyline = (first) => {
+    const n = first.length;
+    const firstRows = Int32Array.from(first);
+    const columns = Array.from({ length: n }, (_, j) => new Float64Array(j - firstRows[j] + 1));
+    return { n, first: firstRows, columns };
+};
+/** Adds `value` to A[i][j] (and so to A[j][i]); the entry must lie inside the profile. */
+export const skylineAdd = (S, i, j, value) => {
+    const row = Math.min(i, j);
+    const col = Math.max(i, j);
+    const offset = row - S.first[col];
+    if (offset < 0)
+        throw new Error(`Skyline entry (${row}, ${col}) is outside the profile.`);
+    S.columns[col][offset] += value;
+};
+/** Reads A[i][j] (0 outside the profile). */
+export const skylineGet = (S, i, j) => {
+    const row = Math.min(i, j);
+    const col = Math.max(i, j);
+    const offset = row - S.first[col];
+    return offset < 0 ? 0 : S.columns[col][offset];
+};
+/** Number of stored entries, a measure of memory and of factorisation work. */
+export const skylineSize = (S) => S.columns.reduce((sum, column) => sum + column.length, 0);
+/**
+ * Factorises a symmetric positive-definite skyline matrix in place as A = Uᵀ·U (U upper
+ * triangular, same profile).
+ *
+ * @param S - Matrix, overwritten by U
+ * @param tolerance - A pivot at or below `tolerance` times its own diagonal term is treated as zero
+ * @returns `{ ok: true }`, or `{ ok: false, failedPivot }` with the index of the first pivot that
+ *   failed (A is singular or indefinite there — for a structure, a mechanism involving that DOF)
+ */
+export const skylineFactor = (S, tolerance = 1e-12) => {
+    const { n, first, columns } = S;
+    for (let j = 0; j < n; j++) {
+        const colJ = columns[j];
+        const fj = first[j];
+        for (let i = fj; i < j; i++) {
+            const colI = columns[i];
+            const fi = first[i];
+            const k0 = Math.max(fi, fj);
+            let sum = colJ[i - fj];
+            for (let k = k0; k < i; k++)
+                sum -= colI[k - fi] * colJ[k - fj];
+            colJ[i - fj] = sum / colI[i - fi];
+        }
+        const diagonal = colJ[j - fj];
+        let sum = diagonal;
+        for (let k = fj; k < j; k++)
+            sum -= colJ[k - fj] * colJ[k - fj];
+        if (!(sum > tolerance * diagonal))
+            return { ok: false, failedPivot: j };
+        colJ[j - fj] = Math.sqrt(sum);
+    }
+    return { ok: true };
+};
+/**
+ * Solves A·x = b from the factor produced by `skylineFactor` (forward then back substitution).
+ * One factorisation serves any number of right-hand sides.
+ */
+export const skylineSolve = (U, b) => {
+    const { n, first, columns } = U;
+    const y = Array.from(b);
+    // Uᵀ·y = b
+    for (let j = 0; j < n; j++) {
+        const col = columns[j];
+        const fj = first[j];
+        let sum = y[j];
+        for (let k = fj; k < j; k++)
+            sum -= col[k - fj] * y[k];
+        y[j] = sum / col[j - fj];
+    }
+    // U·x = y
+    for (let j = n - 1; j >= 0; j--) {
+        const col = columns[j];
+        const fj = first[j];
+        y[j] /= col[j - fj];
+        const xj = y[j];
+        for (let k = fj; k < j; k++)
+            y[k] -= col[k - fj] * xj;
+    }
+    return y;
+};
+/**
+ * Reverse Cuthill–McKee ordering of a graph, which keeps connected vertices close together and
+ * so narrows the band of the matrix built on it. Each connected component starts from a
+ * pseudo-peripheral vertex.
+ *
+ * @param adjacency - Neighbours of each vertex (undirected)
+ * @returns The vertices in their new order (`order[k]` = original index of the k-th vertex)
+ */
+export const reverseCuthillMcKee = (adjacency) => {
+    const n = adjacency.length;
+    const degree = adjacency.map((neighbours) => neighbours.length);
+    const visited = new Uint8Array(n);
+    const order = [];
+    /** Breadth-first levels from `start`, within unvisited vertices. */
+    const levels = (start) => {
+        const level = new Int32Array(n).fill(-1);
+        level[start] = 0;
+        const queue = [start];
+        let last = start;
+        for (let q = 0; q < queue.length; q++) {
+            const v = queue[q];
+            for (const w of adjacency[v]) {
+                if (!visited[w] && level[w] < 0) {
+                    level[w] = level[v] + 1;
+                    queue.push(w);
+                    if (level[w] > level[last] || (level[w] === level[last] && degree[w] < degree[last])) {
+                        last = w;
+                    }
+                }
+            }
+        }
+        return { depth: level[last], last };
+    };
+    const byDegree = Array.from({ length: n }, (_, i) => i).sort((a, b) => degree[a] - degree[b]);
+    for (const seed of byDegree) {
+        if (visited[seed])
+            continue;
+        // pseudo-peripheral start: move to the far end of the BFS until the depth stops growing
+        let start = seed;
+        let { depth, last } = levels(start);
+        for (let iteration = 0; iteration < 8; iteration++) {
+            const next = levels(last);
+            if (next.depth <= depth)
+                break;
+            start = last;
+            depth = next.depth;
+            last = next.last;
+        }
+        const component = [start];
+        visited[start] = 1;
+        for (let q = 0; q < component.length; q++) {
+            const neighbours = adjacency[component[q]]
+                .filter((w) => !visited[w])
+                .sort((a, b) => degree[a] - degree[b]);
+            for (const w of neighbours) {
+                if (!visited[w]) {
+                    visited[w] = 1;
+                    component.push(w);
+                }
+            }
+        }
+        order.push(...component);
+    }
+    return order.reverse();
+};
+//# sourceMappingURL=skyline.js.map

package/dist/esm/utils/skyline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"skyline.js","sourceRoot":"","sources":["../../../src/utils/skyline.ts"],"names":[],"mappings":"AAaA,8FAA8F;AAC9F,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAwB,EAAiB,EAAE;IACvE,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5F,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AAC1C,CAAC,CAAC;AAEF,0FAA0F;AAC1F,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAgB,EAAE,CAAS,EAAE,CAAS,EAAE,KAAa,EAAQ,EAAE;IACxF,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,GAAG,KAAK,GAAG,2BAA2B,CAAC,CAAC;IAC1F,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC;AAClC,CAAC,CAAC;AAEF,6CAA6C;AAC7C,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAgB,EAAE,CAAS,EAAE,CAAS,EAAU,EAAE;IAC3E,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClC,OAAO,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;AACjD,CAAC,CAAC;AAEF,+EAA+E;AAC/E,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAgB,EAAU,EAAE,CACtD,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAE5D;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,CAAgB,EAChB,SAAS,GAAG,KAAK,EACkC,EAAE;IACrD,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC5B,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YAChE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACpC,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC9B,IAAI,GAAG,GAAG,QAAQ,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAChE,IAAI,CAAC,CAAC,GAAG,GAAG,SAAS,GAAG,QAAQ,CAAC;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;QACxE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAgB,EAAE,CAAoB,EAAY,EAAE;IAC/E,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,WAAW;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC3B,CAAC;IACD,UAAU;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IACxD,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,SAAqB,EAAY,EAAE;IACrE,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;IAC3B,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAChE,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,oEAAoE;IACpE,MAAM,MAAM,GAAG,CAAC,KAAa,EAAE,EAAE;QAC/B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACjB,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;QACtB,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBAChC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACd,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;wBACrF,IAAI,GAAG,CAAC,CAAC;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;IACtC,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9F,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,OAAO,CAAC,IAAI,CAAC;YAAE,SAAS;QAC5B,wFAAwF;QACxF,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QACpC,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK;gBAAE,MAAM;YAC/B,KAAK,GAAG,IAAI,CAAC;YACb,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACnB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,MAAM,SAAS,GAAa,CAAC,KAAK,CAAC,CAAC;QACpC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;iBACvC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;iBAC1B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;gBAC3B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACf,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AACzB,CAAC,CAAC"}

package/dist/fea/frame/area/area-geometry.d.ts

@@ -0,0 +1,56 @@
+import type { AreaDistribution } from "../types/model.type";
+export type Vec3 = [number, number, number];
+export type Vec2 = [number, number];
+/**
+ * The plane of a valid null area. `u` runs along edge 0 and `v = normal × u`, so the corners
+ * in (u, v) coordinates go counter-clockwise.
+ */
+export interface AreaPlane {
+    points: Vec3[];
+    normal: Vec3;
+    u: Vec3;
+    v: Vec3;
+    corners: Vec2[];
+    area: number;
+    size: number;
+}
+/** What makes a set of corners unusable as a null area. */
+export type AreaGeometryProblem = "nodeCount" | "repeatedNode" | "degenerate" | "nonPlanar" | "nonConvex";
+/** The 2D edge vector i → i + 1 of a polygon. */
+export declare const edgeVector: (corners: Vec2[], i: number) => Vec2;
+/**
+ * Builds the plane of an area from its corners, or names the problem: not 3 or 4 corners,
+ * two consecutive corners coinciding, no area, corners off one plane, or a polygon that is
+ * not strictly convex (a reflex corner, three corners in line or a crossed quad).
+ *
+ * @param points - Corner coordinates in mm, in order around the area
+ */
+export declare const areaPlane: (points: Vec3[]) => AreaPlane | {
+    problem: AreaGeometryProblem;
+};
+/** Whether edges i and j are parallel (either way round) within the tolerance. */
+export declare const edgesParallel: (plane: AreaPlane, i: number, j: number) => boolean;
+/** Whether a 4-corner area is a rectangle (every corner square within the tolerance). */
+export declare const isRectangle: (plane: AreaPlane) => boolean;
+/** Unit vector of edge i in global coordinates. */
+export declare const edgeDirection: (plane: AreaPlane, i: number) => Vec3;
+/** The edges that receive load, and for one-way the span direction in (u, v). */
+export interface AreaSupports {
+    loadedEdges: number[];
+    span?: Vec2;
+}
+/**
+ * Resolves which edges of an area receive load from its distribution and `supportEdges`.
+ * Two-way loads every edge and takes no `supportEdges`. One-way spans parallel to the edges
+ * not listed, which must exist and all be parallel; cantilever takes exactly one edge.
+ *
+ * @returns The loaded edges, or `null` if `supportEdges` does not fit the distribution
+ */
+export declare const resolveAreaSupports: (plane: AreaPlane, distribution: AreaDistribution, supportEdges: unknown) => AreaSupports | null;
+/**
+ * Clips a convex polygon to the half-plane `a · p ≤ c` (Sutherland–Hodgman, one plane).
+ *
+ * @param polygon - Corners in order, mm
+ * @returns The clipped polygon, in the same order; empty if nothing remains
+ */
+export declare const clipPolygon: (polygon: Vec2[], a: Vec2, c: number) => Vec2[];

package/dist/fea/frame/area/area-geometry.js

@@ -0,0 +1,142 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.clipPolygon = exports.resolveAreaSupports = exports.edgeDirection = exports.isRectangle = exports.edgesParallel = exports.areaPlane = exports.edgeVector = void 0;
+const frame_constant_1 = require("../../../core/constants/frame.constant");
+const sub = (a, b) => [a[0] - b[0], a[1] - b[1], a[2] - b[2]];
+const dot = (a, b) => a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
+const cross = (a, b) => [
+    a[1] * b[2] - a[2] * b[1],
+    a[2] * b[0] - a[0] * b[2],
+    a[0] * b[1] - a[1] * b[0],
+];
+const norm = (a) => Math.hypot(a[0], a[1], a[2]);
+const scale = (a, s) => [a[0] * s, a[1] * s, a[2] * s];
+const cross2 = (a, b) => a[0] * b[1] - a[1] * b[0];
+const dot2 = (a, b) => a[0] * b[0] + a[1] * b[1];
+/** The 2D edge vector i → i + 1 of a polygon. */
+const edgeVector = (corners, i) => {
+    const a = corners[i];
+    const b = corners[(i + 1) % corners.length];
+    return [b[0] - a[0], b[1] - a[1]];
+};
+exports.edgeVector = edgeVector;
+/**
+ * Builds the plane of an area from its corners, or names the problem: not 3 or 4 corners,
+ * two consecutive corners coinciding, no area, corners off one plane, or a polygon that is
+ * not strictly convex (a reflex corner, three corners in line or a crossed quad).
+ *
+ * @param points - Corner coordinates in mm, in order around the area
+ */
+const areaPlane = (points) => {
+    const n = points.length;
+    if (n !== 3 && n !== 4)
+        return { problem: "nodeCount" };
+    const edges = points.map((p, i) => sub(points[(i + 1) % n], p));
+    const size = Math.max(...edges.map(norm));
+    const tolerance = frame_constant_1.AREA_GEOMETRY_TOLERANCE * size;
+    if (!(size > 0) || edges.some((e) => norm(e) <= tolerance))
+        return { problem: "repeatedNode" };
+    // Newell's method: the vector area, exact for a planar polygon
+    const vectorArea = points.reduce((sum, p, i) => {
+        const c = cross(p, points[(i + 1) % n]);
+        return [sum[0] + c[0] / 2, sum[1] + c[1] / 2, sum[2] + c[2] / 2];
+    }, [0, 0, 0]);
+    const area = norm(vectorArea);
+    if (!(area > tolerance * size))
+        return { problem: "degenerate" };
+    const normal = scale(vectorArea, 1 / area);
+    const centroid = scale(points.reduce((s, p) => [s[0] + p[0], s[1] + p[1], s[2] + p[2]], [0, 0, 0]), 1 / n);
+    if (points.some((p) => Math.abs(dot(sub(p, centroid), normal)) > tolerance)) {
+        return { problem: "nonPlanar" };
+    }
+    const along = sub(edges[0], scale(normal, dot(edges[0], normal)));
+    const u = scale(along, 1 / norm(along));
+    const v = cross(normal, u);
+    const corners = points.map((p) => [dot(sub(p, points[0]), u), dot(sub(p, points[0]), v)]);
+    // Strictly convex: every turn is to the left by more than the tolerance (sine of the turn)
+    for (let i = 0; i < n; i++) {
+        const a = (0, exports.edgeVector)(corners, i);
+        const b = (0, exports.edgeVector)(corners, (i + 1) % n);
+        if (!(cross2(a, b) > frame_constant_1.AREA_GEOMETRY_TOLERANCE * Math.hypot(...a) * Math.hypot(...b))) {
+            return { problem: "nonConvex" };
+        }
+    }
+    return { points, normal, u, v, corners, area, size };
+};
+exports.areaPlane = areaPlane;
+/** Whether edges i and j are parallel (either way round) within the tolerance. */
+const edgesParallel = (plane, i, j) => {
+    const a = (0, exports.edgeVector)(plane.corners, i);
+    const b = (0, exports.edgeVector)(plane.corners, j);
+    return Math.abs(cross2(a, b)) <= frame_constant_1.AREA_GEOMETRY_TOLERANCE * Math.hypot(...a) * Math.hypot(...b);
+};
+exports.edgesParallel = edgesParallel;
+/** Whether a 4-corner area is a rectangle (every corner square within the tolerance). */
+const isRectangle = (plane) => plane.corners.length === 4 &&
+    plane.corners.every((_, i) => {
+        const a = (0, exports.edgeVector)(plane.corners, i);
+        const b = (0, exports.edgeVector)(plane.corners, (i + 1) % 4);
+        return Math.abs(dot2(a, b)) <= frame_constant_1.AREA_GEOMETRY_TOLERANCE * Math.hypot(...a) * Math.hypot(...b);
+    });
+exports.isRectangle = isRectangle;
+/** Unit vector of edge i in global coordinates. */
+const edgeDirection = (plane, i) => {
+    const n = plane.points.length;
+    const d = sub(plane.points[(i + 1) % n], plane.points[i]);
+    return scale(d, 1 / norm(d));
+};
+exports.edgeDirection = edgeDirection;
+/**
+ * Resolves which edges of an area receive load from its distribution and `supportEdges`.
+ * Two-way loads every edge and takes no `supportEdges`. One-way spans parallel to the edges
+ * not listed, which must exist and all be parallel; cantilever takes exactly one edge.
+ *
+ * @returns The loaded edges, or `null` if `supportEdges` does not fit the distribution
+ */
+const resolveAreaSupports = (plane, distribution, supportEdges) => {
+    const n = plane.corners.length;
+    if (distribution === "twoWay") {
+        return supportEdges === undefined ? { loadedEdges: [...Array(n).keys()] } : null;
+    }
+    if (!Array.isArray(supportEdges) ||
+        supportEdges.length === 0 ||
+        supportEdges.some((e) => !Number.isInteger(e) || e < 0 || e >= n) ||
+        new Set(supportEdges).size !== supportEdges.length) {
+        return null;
+    }
+    const loadedEdges = [...supportEdges].sort((a, b) => a - b);
+    if (distribution === "cantilever")
+        return loadedEdges.length === 1 ? { loadedEdges } : null;
+    const free = [...Array(n).keys()].filter((e) => !loadedEdges.includes(e));
+    if (free.length === 0 || free.some((e) => !(0, exports.edgesParallel)(plane, free[0], e)))
+        return null;
+    const d = (0, exports.edgeVector)(plane.corners, free[0]);
+    const length = Math.hypot(...d);
+    return { loadedEdges, span: [d[0] / length, d[1] / length] };
+};
+exports.resolveAreaSupports = resolveAreaSupports;
+/**
+ * Clips a convex polygon to the half-plane `a · p ≤ c` (Sutherland–Hodgman, one plane).
+ *
+ * @param polygon - Corners in order, mm
+ * @returns The clipped polygon, in the same order; empty if nothing remains
+ */
+const clipPolygon = (polygon, a, c) => {
+    const out = [];
+    const side = (p) => dot2(a, p) - c;
+    for (let i = 0; i < polygon.length; i++) {
+        const p = polygon[i];
+        const q = polygon[(i + 1) % polygon.length];
+        const sp = side(p);
+        const sq = side(q);
+        if (sp <= 0)
+            out.push(p);
+        if ((sp < 0 && sq > 0) || (sp > 0 && sq < 0)) {
+            const t = sp / (sp - sq);
+            out.push([p[0] + t * (q[0] - p[0]), p[1] + t * (q[1] - p[1])]);
+        }
+    }
+    return out;
+};
+exports.clipPolygon = clipPolygon;
+//# sourceMappingURL=area-geometry.js.map

package/dist/fea/frame/area/area-geometry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"area-geometry.js","sourceRoot":"","sources":["../../../../src/fea/frame/area/area-geometry.ts"],"names":[],"mappings":";;;AAAA,uEAA6E;AAO7E,MAAM,GAAG,GAAG,CAAC,CAAO,EAAE,CAAO,EAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChF,MAAM,GAAG,GAAG,CAAC,CAAO,EAAE,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1E,MAAM,KAAK,GAAG,CAAC,CAAO,EAAE,CAAO,EAAQ,EAAE,CAAC;IACxC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAC1B,CAAC;AACF,MAAM,IAAI,GAAG,CAAC,CAAO,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,MAAM,KAAK,GAAG,CAAC,CAAO,EAAE,CAAS,EAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC3E,MAAM,MAAM,GAAG,CAAC,CAAO,EAAE,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/D,MAAM,IAAI,GAAG,CAAC,CAAO,EAAE,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAwB7D,iDAAiD;AAC1C,MAAM,UAAU,GAAG,CAAC,OAAe,EAAE,CAAS,EAAQ,EAAE;IAC7D,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5C,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC,CAAC;AAJW,QAAA,UAAU,cAIrB;AAEF;;;;;;GAMG;AACI,MAAM,SAAS,GAAG,CAAC,MAAc,EAAgD,EAAE;IACxF,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;IACxD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAG,wCAAuB,GAAG,IAAI,CAAC;IACjD,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC;IAE/F,+DAA+D;IAC/D,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAC9B,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE;QACZ,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnE,CAAC,EACD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CACV,CAAC;IACF,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9B,IAAI,CAAC,CAAC,IAAI,GAAG,SAAS,GAAG,IAAI,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC;IACjE,MAAM,MAAM,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IAE3C,MAAM,QAAQ,GAAG,KAAK,CACpB,MAAM,CAAC,MAAM,CAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EACjF,CAAC,GAAG,CAAC,CACN,CAAC;IACF,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;QAC5E,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;IAClC,CAAC;IAED,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACxC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhG,2FAA2F;IAC3F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAA,kBAAU,EAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,IAAA,kBAAU,EAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,wCAAuB,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACpF,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACvD,CAAC,CAAC;AA3CW,QAAA,SAAS,aA2CpB;AAEF,kFAAkF;AAC3E,MAAM,aAAa,GAAG,CAAC,KAAgB,EAAE,CAAS,EAAE,CAAS,EAAW,EAAE;IAC/E,MAAM,CAAC,GAAG,IAAA,kBAAU,EAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,IAAA,kBAAU,EAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACvC,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,wCAAuB,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACjG,CAAC,CAAC;AAJW,QAAA,aAAa,iBAIxB;AAEF,yFAAyF;AAClF,MAAM,WAAW,GAAG,CAAC,KAAgB,EAAW,EAAE,CACvD,KAAK,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;IAC1B,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,MAAM,CAAC,GAAG,IAAA,kBAAU,EAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,IAAA,kBAAU,EAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,wCAAuB,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/F,CAAC,CAAC,CAAC;AANQ,QAAA,WAAW,eAMnB;AAEL,mDAAmD;AAC5C,MAAM,aAAa,GAAG,CAAC,KAAgB,EAAE,CAAS,EAAQ,EAAE;IACjE,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAC9B,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/B,CAAC,CAAC;AAJW,QAAA,aAAa,iBAIxB;AAQF;;;;;;GAMG;AACI,MAAM,mBAAmB,GAAG,CACjC,KAAgB,EAChB,YAA8B,EAC9B,YAAqB,EACA,EAAE;IACvB,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;IAC/B,IAAI,YAAY,KAAK,QAAQ,EAAE,CAAC;QAC9B,OAAO,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACnF,CAAC;IACD,IACE,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC;QAC5B,YAAY,CAAC,MAAM,KAAK,CAAC;QACzB,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjE,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,MAAM,EAClD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,WAAW,GAAG,CAAC,GAAI,YAAyB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1E,IAAI,YAAY,KAAK,YAAY;QAAE,OAAO,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAE5F,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAA,qBAAa,EAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1F,MAAM,CAAC,GAAG,IAAA,kBAAU,EAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAChC,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC;AAC/D,CAAC,CAAC;AAzBW,QAAA,mBAAmB,uBAyB9B;AAEF;;;;;GAKG;AACI,MAAM,WAAW,GAAG,CAAC,OAAe,EAAE,CAAO,EAAE,CAAS,EAAU,EAAE;IACzE,MAAM,GAAG,GAAW,EAAE,CAAC;IACvB,MAAM,IAAI,GAAG,CAAC,CAAO,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,IAAI,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;YAC7C,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACzB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAfW,QAAA,WAAW,eAetB"}

package/dist/fea/frame/area/distribute-area-loads.d.ts

@@ -0,0 +1,30 @@
+import type { Warnings } from "../../../core/types/output-message.type";
+import type { FrameModel, MemberLoad } from "../types/model.type";
+/**
+ * Turns the area loads of a model into member loads, assuming the model is valid (as
+ * `validateFrameModel` checks): each area's edge profiles are built once, then scaled for each
+ * of its loads and split into global X, Y and Z trapezoidal loads (plus torques for a cantilever).
+ * Everything is linear in `q`, so load-case superposition still holds.
+ */
+export declare const areaMemberLoads: (model: FrameModel) => {
+    memberLoads: MemberLoad[];
+    warnings: Warnings;
+};
+/**
+ * The member loads that a model's null areas send to the members along their edges — what
+ * `analyzeFrame` adds to `memberLoads` — so they can be checked or previewed.
+ *
+ * Two-way areas send each point to the nearest edge (corner-bisector split); one-way areas
+ * split strips parallel to their unsupported edges half to each end; cantilever areas send
+ * `q · c` and a torque `q · c² / 2` per unit length to their support edge (c = depth). Edges
+ * split by intermediate nodes are cut at those nodes. Loads are per unit true area and come
+ * out as trapezoidal loads in global X, Y and Z (and torques), each tagged with its load case.
+ *
+ * @param model - The frame model, validated first
+ * @returns `memberLoads` and `warnings` (a one-way support edge parallel to the span)
+ * @throws {FrameAnalysisError} 301–317 for an invalid model, with every problem in `issues`
+ */
+export declare const distributeAreaLoads: (model: FrameModel) => {
+    memberLoads: MemberLoad[];
+    warnings: Warnings;
+};