@faicad/faijs 0.13.0

package/dist/mesh/query.js

@@ -0,0 +1,124 @@
+/**
+ * mesh 查询 API
+ *
+ * 提取来源：transform-store 的 compute*BoundingBox
+ * 这些函数不产生几何，供 GeomRef 求值与面板显示使用。
+ */
+import * as THREE from 'three';
+/**
+ * Compute the axis-aligned bounding box of a shape.
+ *
+ * @param shape - the shape to measure.
+ * @returns the min/max bounding box.
+ */
+export function boundingBox(shape) {
+    const min = [Infinity, Infinity, Infinity];
+    const max = [-Infinity, -Infinity, -Infinity];
+    for (let i = 0; i < shape.positions.length; i += 3) {
+        const x = shape.positions[i];
+        const y = shape.positions[i + 1];
+        const z = shape.positions[i + 2];
+        if (x < min[0])
+            min[0] = x;
+        if (y < min[1])
+            min[1] = y;
+        if (z < min[2])
+            min[2] = z;
+        if (x > max[0])
+            max[0] = x;
+        if (y > max[1])
+            max[1] = y;
+        if (z > max[2])
+            max[2] = z;
+    }
+    return { min, max };
+}
+/**
+ * Compute the center of a shape's bounding box.
+ *
+ * @param shape - the shape to measure.
+ * @returns the bounding-box center as a Vec3.
+ */
+export function bboxCenter(shape) {
+    const bb = boundingBox(shape);
+    return [
+        (bb.min[0] + bb.max[0]) / 2,
+        (bb.min[1] + bb.max[1]) / 2,
+        (bb.min[2] + bb.max[2]) / 2,
+    ];
+}
+/**
+ * Compute the enclosed volume of a closed triangle mesh using the divergence
+ * theorem.
+ *
+ * @param shape - the shape to measure.
+ * @returns the volume in mm³.
+ */
+export function volume(shape) {
+    let vol = 0;
+    const indices = shape.indices;
+    const positions = shape.positions;
+    for (let i = 0; i < indices.length; i += 3) {
+        const a = indices[i] * 3;
+        const b = indices[i + 1] * 3;
+        const c = indices[i + 2] * 3;
+        const ax = positions[a], ay = positions[a + 1], az = positions[a + 2];
+        const bx = positions[b], by = positions[b + 1], bz = positions[b + 2];
+        const cx = positions[c], cy = positions[c + 1], cz = positions[c + 2];
+        vol += (ax * (by * cz - bz * cy) - ay * (bx * cz - bz * cx) + az * (bx * cy - by * cx)) / 6;
+    }
+    return Math.abs(vol);
+}
+/**
+ * Find the face nearest to an anchor (a pick point plus an optional reference
+ * normal). Used for GeomRef faceNormal evaluation: faces whose
+ * normal is closer to the target normal are weighted more favorably.
+ *
+ * @param shape - the shape to search.
+ * @param anchor - the target point with an optional reference normal.
+ * @returns the closest face descriptor, or null when the mesh has no faces.
+ */
+export function faceAt(shape, anchor) {
+    const targetPoint = new THREE.Vector3(...anchor.point);
+    const targetNormal = anchor.normal ? new THREE.Vector3(...anchor.normal) : null;
+    let bestDist = Infinity;
+    let bestFace = null;
+    const indices = shape.indices;
+    const positions = shape.positions;
+    for (let i = 0; i < indices.length; i += 3) {
+        const a = indices[i] * 3;
+        const b = indices[i + 1] * 3;
+        const c = indices[i + 2] * 3;
+        const va = new THREE.Vector3(positions[a], positions[a + 1], positions[a + 2]);
+        const vb = new THREE.Vector3(positions[b], positions[b + 1], positions[b + 2]);
+        const vc = new THREE.Vector3(positions[c], positions[c + 1], positions[c + 2]);
+        // 面中心
+        const center = new THREE.Vector3().addVectors(va, vb).add(vc).divideScalar(3);
+        const dist = center.distanceTo(targetPoint);
+        // 面法向
+        const normal = new THREE.Vector3()
+            .subVectors(vb, va)
+            .cross(new THREE.Vector3().subVectors(vc, va))
+            .normalize();
+        // 如果有目标法向，加权距离（法向不匹配的面惩罚更大）
+        let weightedDist = dist;
+        if (targetNormal) {
+            const dot = Math.abs(normal.dot(targetNormal));
+            weightedDist = dist / (dot + 0.01); // 法向越匹配，权重越小
+        }
+        if (weightedDist < bestDist) {
+            bestDist = weightedDist;
+            const area = new THREE.Vector3()
+                .subVectors(vb, va)
+                .cross(new THREE.Vector3().subVectors(vc, va))
+                .length() / 2;
+            bestFace = {
+                center: [center.x, center.y, center.z],
+                normal: [normal.x, normal.y, normal.z],
+                area,
+            };
+        }
+    }
+    return bestFace;
+}
+//# sourceMappingURL=query.js.map

package/dist/mesh/query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.js","sourceRoot":"","sources":["../../src/mesh/query.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,KAAK,MAAM,OAAO,CAAA;AAG9B;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,KAAY;IACtC,MAAM,GAAG,GAAS,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAA;IAChD,MAAM,GAAG,GAAS,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAA;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACnD,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAChC,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAChC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAC1B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAC1B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAC1B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAC1B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAC1B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IAC5B,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,KAAY;IACrC,MAAM,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,CAAA;IAC7B,OAAO;QACL,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC3B,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC3B,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;KAC5B,CAAA;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,MAAM,CAAC,KAAY;IACjC,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAA;IAC7B,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAA;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACxB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QAC5B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACrE,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACrE,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACrE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAA;IAC7F,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AACtB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,MAAM,CAAC,KAAY,EAAE,MAAsC;IACzE,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;IACtD,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;IAE/E,IAAI,QAAQ,GAAG,QAAQ,CAAA;IACvB,IAAI,QAAQ,GAA0B,IAAI,CAAA;IAE1C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAA;IAC7B,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAA;IAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACxB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QAC5B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QAE5B,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC9E,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC9E,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAE9E,MAAM;QACN,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC7E,MAAM,IAAI,GAAG,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,CAAA;QAE3C,MAAM;QACN,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE;aAC/B,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;aAClB,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;aAC7C,SAAS,EAAE,CAAA;QAEd,4BAA4B;QAC5B,IAAI,YAAY,GAAG,IAAI,CAAA;QACvB,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAA;YAC9C,YAAY,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,CAAA,CAAC,aAAa;QAClD,CAAC;QAED,IAAI,YAAY,GAAG,QAAQ,EAAE,CAAC;YAC5B,QAAQ,GAAG,YAAY,CAAA;YACvB,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE;iBAC7B,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;iBAClB,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;iBAC7C,MAAM,EAAE,GAAG,CAAC,CAAA;YACf,QAAQ,GAAG;gBACT,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;gBACtC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;gBACtC,IAAI;aACL,CAAA;QACH,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAA;AACjB,CAAC","sourcesContent":["/**\n * mesh 查询 API\n *\n * 提取来源：transform-store 的 compute*BoundingBox\n * 这些函数不产生几何，供 GeomRef 求值与面板显示使用。\n */\n\nimport * as THREE from 'three'\nimport type { Shape, Vec3, BoundingBox, FaceDescriptor } from './types'\n\n/**\n * Compute the axis-aligned bounding box of a shape.\n *\n * @param shape - the shape to measure.\n * @returns the min/max bounding box.\n */\nexport function boundingBox(shape: Shape): BoundingBox {\n  const min: Vec3 = [Infinity, Infinity, Infinity]\n  const max: Vec3 = [-Infinity, -Infinity, -Infinity]\n  for (let i = 0; i < shape.positions.length; i += 3) {\n    const x = shape.positions[i]\n    const y = shape.positions[i + 1]\n    const z = shape.positions[i + 2]\n    if (x < min[0]) min[0] = x\n    if (y < min[1]) min[1] = y\n    if (z < min[2]) min[2] = z\n    if (x > max[0]) max[0] = x\n    if (y > max[1]) max[1] = y\n    if (z > max[2]) max[2] = z\n  }\n  return { min, max }\n}\n\n/**\n * Compute the center of a shape's bounding box.\n *\n * @param shape - the shape to measure.\n * @returns the bounding-box center as a Vec3.\n */\nexport function bboxCenter(shape: Shape): Vec3 {\n  const bb = boundingBox(shape)\n  return [\n    (bb.min[0] + bb.max[0]) / 2,\n    (bb.min[1] + bb.max[1]) / 2,\n    (bb.min[2] + bb.max[2]) / 2,\n  ]\n}\n\n/**\n * Compute the enclosed volume of a closed triangle mesh using the divergence\n * theorem.\n *\n * @param shape - the shape to measure.\n * @returns the volume in mm³.\n */\nexport function volume(shape: Shape): number {\n  let vol = 0\n  const indices = shape.indices\n  const positions = shape.positions\n  for (let i = 0; i < indices.length; i += 3) {\n    const a = indices[i] * 3\n    const b = indices[i + 1] * 3\n    const c = indices[i + 2] * 3\n    const ax = positions[a], ay = positions[a + 1], az = positions[a + 2]\n    const bx = positions[b], by = positions[b + 1], bz = positions[b + 2]\n    const cx = positions[c], cy = positions[c + 1], cz = positions[c + 2]\n    vol += (ax * (by * cz - bz * cy) - ay * (bx * cz - bz * cx) + az * (bx * cy - by * cx)) / 6\n  }\n  return Math.abs(vol)\n}\n\n/**\n * Find the face nearest to an anchor (a pick point plus an optional reference\n * normal). Used for GeomRef faceNormal evaluation: faces whose\n * normal is closer to the target normal are weighted more favorably.\n *\n * @param shape - the shape to search.\n * @param anchor - the target point with an optional reference normal.\n * @returns the closest face descriptor, or null when the mesh has no faces.\n */\nexport function faceAt(shape: Shape, anchor: { point: Vec3; normal?: Vec3 }): FaceDescriptor | null {\n  const targetPoint = new THREE.Vector3(...anchor.point)\n  const targetNormal = anchor.normal ? new THREE.Vector3(...anchor.normal) : null\n\n  let bestDist = Infinity\n  let bestFace: FaceDescriptor | null = null\n\n  const indices = shape.indices\n  const positions = shape.positions\n\n  for (let i = 0; i < indices.length; i += 3) {\n    const a = indices[i] * 3\n    const b = indices[i + 1] * 3\n    const c = indices[i + 2] * 3\n\n    const va = new THREE.Vector3(positions[a], positions[a + 1], positions[a + 2])\n    const vb = new THREE.Vector3(positions[b], positions[b + 1], positions[b + 2])\n    const vc = new THREE.Vector3(positions[c], positions[c + 1], positions[c + 2])\n\n    // 面中心\n    const center = new THREE.Vector3().addVectors(va, vb).add(vc).divideScalar(3)\n    const dist = center.distanceTo(targetPoint)\n\n    // 面法向\n    const normal = new THREE.Vector3()\n      .subVectors(vb, va)\n      .cross(new THREE.Vector3().subVectors(vc, va))\n      .normalize()\n\n    // 如果有目标法向，加权距离（法向不匹配的面惩罚更大）\n    let weightedDist = dist\n    if (targetNormal) {\n      const dot = Math.abs(normal.dot(targetNormal))\n      weightedDist = dist / (dot + 0.01) // 法向越匹配，权重越小\n    }\n\n    if (weightedDist < bestDist) {\n      bestDist = weightedDist\n      const area = new THREE.Vector3()\n        .subVectors(vb, va)\n        .cross(new THREE.Vector3().subVectors(vc, va))\n        .length() / 2\n      bestFace = {\n        center: [center.x, center.y, center.z],\n        normal: [normal.x, normal.y, normal.z],\n        area,\n      }\n    }\n  }\n\n  return bestFace\n}\n"]}

package/dist/mesh/reconcile.d.ts

@@ -0,0 +1,84 @@
+/**
+ * reconcile — BREP 三角汤归约为合法 2-manifold 网格（P0-1c）
+ *
+ *
+ * 职责：把 OCCT 逐面三角化（`kernel.meshShape` 产物：共享边顶点重复、
+ * 可能带朝向/退化问题）归约为 manifold-3d 可接受的合法 2-manifold 网格。
+ * weld（顶点焊接）只是其中一步，故文件名为 reconcile 而非 weld。
+ *
+ * 纯数据、无 wasm 依赖、可单测。四步按顺序执行，每步可独立断言：
+ *   1. 顶点焊接（复用 csg-core 的 weldPositionsWorker，1e-6 mm 量化，推原始坐标无精度损失）
+ *   2. 退化剔除（零面积三角形）
+ *   3. 朝向统一（连通分量内面法向传播，翻转不一致者）
+ *   4. 2-manifold 断言（每条边恰好被 2 个三角形共享；不满足即显式报错，不静默、不 try-catch 回退）
+ *
+ * 红线（AGENTS.md）：这是输入数据规整，不是运行时回退——调用方（stdlib 各 op 的
+ * mesh 路径）在 dispatchPath 静态判定为 'mesh' 之后、进入 manifold 之前调用。
+ */
+/**
+ * Result of one reconciliation step: the reduced vertex buffer and the index
+ * buffer of triangles referencing it.
+ */
+export interface ReconcileResult {
+    positions: Float32Array;
+    indices: Uint32Array;
+}
+/**
+ * Weld duplicated vertices shared across triangle edges (reuses the single
+ * csg-core weld implementation). Input coordinates are preserved — the 1e-6
+ * quantization is only used as a map key and is never written back — so there
+ * is no precision loss.
+ * @param positions - flat XYZ vertex buffer, length 3 * vertexCount.
+ * @param indices - triangle index buffer, length 3 * triangleCount.
+ * @returns the welded mesh as a new ReconcileResult.
+ */
+export declare function weldVertices(positions: Float32Array, indices: Uint32Array): ReconcileResult;
+/**
+ * Drop zero-area triangles and compact the surviving indices, also squeezing
+ * out vertices that are no longer referenced. A triangle is degenerate when
+ * its area is below the relative threshold (diagonal * 1e-9)².
+ * @param positions - flat XYZ vertex buffer, length 3 * vertexCount.
+ * @param indices - triangle index buffer, length 3 * triangleCount.
+ * @returns the cleaned mesh as a new ReconcileResult.
+ */
+export declare function removeDegenerate(positions: Float32Array, indices: Uint32Array): ReconcileResult;
+/**
+ * Propagate face winding across each connected component: adjacent triangles
+ * sharing an edge must traverse it in opposite directions (manifold winding
+ * consistency). Triangles that violate this are flipped (v1/v2 swapped).
+ *
+ * BFS propagates a flip state f ∈ {+1, -1} per connected component:
+ *   f(neighbor) = -f(cur) * baseDir(cur, e) * baseDir(neighbor, e)
+ * A conflict (one triangle demanded to flip by two different paths) means the
+ * mesh is not orientable — the first assignment is kept and step 4's
+ * 2-manifold assertion reports the error explicitly.
+ * @param positions - flat XYZ vertex buffer.
+ * @param indices - triangle index buffer.
+ * @returns the orientation-unified mesh as a new ReconcileResult.
+ */
+export declare function unifyOrientation(positions: Float32Array, indices: Uint32Array): ReconcileResult;
+/**
+ * Assert the mesh is 2-manifold: every undirected edge is shared by exactly
+ * two triangles. A violation throws immediately (no silent handling, no
+ * try-catch fallback).
+ * @param positions - flat XYZ vertex buffer.
+ * @param indices - triangle index buffer.
+ */
+export declare function assertManifold(positions: Float32Array, indices: Uint32Array): void;
+/**
+ * Tuning knobs for the full reconciliation pass.
+ */
+export interface ReconcileOptions {
+    /** Whether to run the 2-manifold assertion (default true). */
+    assertManifold?: boolean;
+}
+/**
+ * Full reconciliation: weld → degenerate removal → orientation unification →
+ * 2-manifold assertion. An empty mesh is returned untouched.
+ * @param positions - flat XYZ vertex buffer.
+ * @param indices - triangle index buffer.
+ * @param opts - optional tuning knobs, e.g. to skip the manifold assertion.
+ * @returns the reconciled mesh as a new ReconcileResult.
+ */
+export declare function reconcileMesh(positions: Float32Array, indices: Uint32Array, opts?: ReconcileOptions): ReconcileResult;
+//# sourceMappingURL=reconcile.d.ts.map

package/dist/mesh/reconcile.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reconcile.d.ts","sourceRoot":"","sources":["../../src/mesh/reconcile.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,YAAY,CAAA;IACvB,OAAO,EAAE,WAAW,CAAA;CACrB;AAID;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAC1B,SAAS,EAAE,YAAY,EACvB,OAAO,EAAE,WAAW,GACnB,eAAe,CAGjB;AAqBD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,SAAS,EAAE,YAAY,EACvB,OAAO,EAAE,WAAW,GACnB,eAAe,CAsDjB;AAWD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,gBAAgB,CAC9B,SAAS,EAAE,YAAY,EACvB,OAAO,EAAE,WAAW,GACnB,eAAe,CA6EjB;AAID;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,WAAW,GAAG,IAAI,CAiClF;AAID;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,8DAA8D;IAC9D,cAAc,CAAC,EAAE,OAAO,CAAA;CACzB;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,YAAY,EACvB,OAAO,EAAE,WAAW,EACpB,IAAI,CAAC,EAAE,gBAAgB,GACtB,eAAe,CAcjB"}

package/dist/mesh/reconcile.js

@@ -0,0 +1,261 @@
+/**
+ * reconcile — BREP 三角汤归约为合法 2-manifold 网格（P0-1c）
+ *
+ *
+ * 职责：把 OCCT 逐面三角化（`kernel.meshShape` 产物：共享边顶点重复、
+ * 可能带朝向/退化问题）归约为 manifold-3d 可接受的合法 2-manifold 网格。
+ * weld（顶点焊接）只是其中一步，故文件名为 reconcile 而非 weld。
+ *
+ * 纯数据、无 wasm 依赖、可单测。四步按顺序执行，每步可独立断言：
+ *   1. 顶点焊接（复用 csg-core 的 weldPositionsWorker，1e-6 mm 量化，推原始坐标无精度损失）
+ *   2. 退化剔除（零面积三角形）
+ *   3. 朝向统一（连通分量内面法向传播，翻转不一致者）
+ *   4. 2-manifold 断言（每条边恰好被 2 个三角形共享；不满足即显式报错，不静默、不 try-catch 回退）
+ *
+ * 红线（AGENTS.md）：这是输入数据规整，不是运行时回退——调用方（stdlib 各 op 的
+ * mesh 路径）在 dispatchPath 静态判定为 'mesh' 之后、进入 manifold 之前调用。
+ */
+import { weldPositionsWorker } from '../boolean/csg-core.js';
+// ── 步骤 1：顶点焊接 ──
+/**
+ * Weld duplicated vertices shared across triangle edges (reuses the single
+ * csg-core weld implementation). Input coordinates are preserved — the 1e-6
+ * quantization is only used as a map key and is never written back — so there
+ * is no precision loss.
+ * @param positions - flat XYZ vertex buffer, length 3 * vertexCount.
+ * @param indices - triangle index buffer, length 3 * triangleCount.
+ * @returns the welded mesh as a new ReconcileResult.
+ */
+export function weldVertices(positions, indices) {
+    const welded = weldPositionsWorker(positions, indices, indices.length);
+    return { positions: welded.positions, indices: welded.indices };
+}
+// ── 步骤 2：退化剔除 ──
+/** 计算包围盒对角线长度（数值尺度参考）。 */
+function bboxDiagonal(positions) {
+    let minX = Infinity, minY = Infinity, minZ = Infinity;
+    let maxX = -Infinity, maxY = -Infinity, maxZ = -Infinity;
+    for (let i = 0; i < positions.length; i += 3) {
+        const x = positions[i], y = positions[i + 1], 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;
+    }
+    const dx = maxX - minX, dy = maxY - minY, dz = maxZ - minZ;
+    return Math.sqrt(dx * dx + dy * dy + dz * dz);
+}
+/**
+ * Drop zero-area triangles and compact the surviving indices, also squeezing
+ * out vertices that are no longer referenced. A triangle is degenerate when
+ * its area is below the relative threshold (diagonal * 1e-9)².
+ * @param positions - flat XYZ vertex buffer, length 3 * vertexCount.
+ * @param indices - triangle index buffer, length 3 * triangleCount.
+ * @returns the cleaned mesh as a new ReconcileResult.
+ */
+export function removeDegenerate(positions, indices) {
+    const triCount = indices.length / 3;
+    if (triCount === 0)
+        return { positions, indices };
+    const diag = bboxDiagonal(positions);
+    const areaEps = diag * 1e-9;
+    const areaEpsSq = areaEps * areaEps;
+    const keep = new Uint8Array(triCount);
+    let keptCount = 0;
+    for (let t = 0; t < triCount; t++) {
+        const i0 = indices[t * 3];
+        const i1 = indices[t * 3 + 1];
+        const i2 = indices[t * 3 + 2];
+        const x0 = positions[i0 * 3], y0 = positions[i0 * 3 + 1], z0 = positions[i0 * 3 + 2];
+        const x1 = positions[i1 * 3], y1 = positions[i1 * 3 + 1], z1 = positions[i1 * 3 + 2];
+        const x2 = positions[i2 * 3], y2 = positions[i2 * 3 + 1], z2 = positions[i2 * 3 + 2];
+        // cross(u, v) 长度平方：u = v1 - v0, v = v2 - v0
+        const ux = x1 - x0, uy = y1 - y0, uz = z1 - z0;
+        const vx = x2 - x0, vy = y2 - y0, vz = z2 - z0;
+        const cx = uy * vz - uz * vy;
+        const cy = uz * vx - ux * vz;
+        const cz = ux * vy - uy * vx;
+        const crossLenSq = cx * cx + cy * cy + cz * cz;
+        if (crossLenSq > areaEpsSq) {
+            keep[t] = 1;
+            keptCount++;
+        }
+    }
+    if (keptCount === triCount)
+        return { positions, indices };
+    const newIndices = new Uint32Array(keptCount * 3);
+    const remap = new Map();
+    const newPosArr = [];
+    let out = 0;
+    for (let t = 0; t < triCount; t++) {
+        if (!keep[t])
+            continue;
+        for (let k = 0; k < 3; k++) {
+            const vi = indices[t * 3 + k];
+            let ni = remap.get(vi);
+            if (ni === undefined) {
+                ni = newPosArr.length / 3;
+                remap.set(vi, ni);
+                newPosArr.push(positions[vi * 3], positions[vi * 3 + 1], positions[vi * 3 + 2]);
+            }
+            newIndices[out++] = ni;
+        }
+    }
+    return { positions: new Float32Array(newPosArr), indices: newIndices };
+}
+/**
+ * Propagate face winding across each connected component: adjacent triangles
+ * sharing an edge must traverse it in opposite directions (manifold winding
+ * consistency). Triangles that violate this are flipped (v1/v2 swapped).
+ *
+ * BFS propagates a flip state f ∈ {+1, -1} per connected component:
+ *   f(neighbor) = -f(cur) * baseDir(cur, e) * baseDir(neighbor, e)
+ * A conflict (one triangle demanded to flip by two different paths) means the
+ * mesh is not orientable — the first assignment is kept and step 4's
+ * 2-manifold assertion reports the error explicitly.
+ * @param positions - flat XYZ vertex buffer.
+ * @param indices - triangle index buffer.
+ * @returns the orientation-unified mesh as a new ReconcileResult.
+ */
+export function unifyOrientation(positions, indices) {
+    const triCount = indices.length / 3;
+    if (triCount === 0)
+        return { positions, indices };
+    // 无向边 → 共享它的 (tri, dir) 列表
+    const edgeMap = new Map();
+    for (let t = 0; t < triCount; t++) {
+        const i0 = indices[t * 3];
+        const i1 = indices[t * 3 + 1];
+        const i2 = indices[t * 3 + 2];
+        addEdgeRef(i0, i1, t);
+        addEdgeRef(i1, i2, t);
+        addEdgeRef(i2, i0, t);
+    }
+    function addEdgeRef(a, b, tri) {
+        const lo = a < b ? a : b;
+        const hi = a < b ? b : a;
+        let inner = edgeMap.get(lo);
+        if (!inner) {
+            inner = new Map();
+            edgeMap.set(lo, inner);
+        }
+        let refs = inner.get(hi);
+        if (!refs) {
+            refs = [];
+            inner.set(hi, refs);
+        }
+        refs.push({ tri, dir: a < b ? 1 : -1 });
+    }
+    // 0 = 未访问，1 = 原朝向，2 = 需翻转
+    const flip = new Uint8Array(triCount);
+    const queue = [];
+    for (let seed = 0; seed < triCount; seed++) {
+        if (flip[seed] !== 0)
+            continue;
+        flip[seed] = 1;
+        queue.length = 0;
+        queue.push(seed);
+        while (queue.length > 0) {
+            const cur = queue.pop();
+            const curFlip = flip[cur] === 2 ? -1 : 1;
+            for (let k = 0; k < 3; k++) {
+                const a = indices[cur * 3 + k];
+                const b = indices[cur * 3 + (k + 1) % 3];
+                const lo = a < b ? a : b;
+                const hi = a < b ? b : a;
+                const refs = edgeMap.get(lo)?.get(hi);
+                if (!refs)
+                    continue;
+                const baseDirCur = a < b ? 1 : -1;
+                for (const ref of refs) {
+                    if (ref.tri === cur)
+                        continue;
+                    if (flip[ref.tri] !== 0)
+                        continue;
+                    // f(n) = -f(c) × dir(c) × dir(n)
+                    const needFlip = curFlip * baseDirCur * ref.dir === 1 ? 2 : 1;
+                    flip[ref.tri] = needFlip;
+                    queue.push(ref.tri);
+                }
+            }
+        }
+    }
+    // 应用翻转：交换每个三角形 v1/v2
+    const out = new Uint32Array(indices);
+    for (let t = 0; t < triCount; t++) {
+        if (flip[t] === 2) {
+            const tmp = out[t * 3 + 1];
+            out[t * 3 + 1] = out[t * 3 + 2];
+            out[t * 3 + 2] = tmp;
+        }
+    }
+    return { positions, indices: out };
+}
+// ── 步骤 4：2-manifold 断言 ──
+/**
+ * Assert the mesh is 2-manifold: every undirected edge is shared by exactly
+ * two triangles. A violation throws immediately (no silent handling, no
+ * try-catch fallback).
+ * @param positions - flat XYZ vertex buffer.
+ * @param indices - triangle index buffer.
+ */
+export function assertManifold(positions, indices) {
+    const triCount = indices.length / 3;
+    const edgeCount = new Map();
+    for (let t = 0; t < triCount; t++) {
+        const i0 = indices[t * 3];
+        const i1 = indices[t * 3 + 1];
+        const i2 = indices[t * 3 + 2];
+        bump(i0, i1);
+        bump(i1, i2);
+        bump(i2, i0);
+    }
+    function bump(a, b) {
+        const lo = a < b ? a : b;
+        const hi = a < b ? b : a;
+        let inner = edgeCount.get(lo);
+        if (!inner) {
+            inner = new Map();
+            edgeCount.set(lo, inner);
+        }
+        inner.set(hi, (inner.get(hi) ?? 0) + 1);
+    }
+    for (const [lo, inner] of edgeCount) {
+        for (const [hi, count] of inner) {
+            if (count !== 2) {
+                throw new Error(`[reconcile] not 2-manifold: edge (${lo},${hi}) shared by ${count} triangles (expected 2)`);
+            }
+        }
+    }
+}
+/**
+ * Full reconciliation: weld → degenerate removal → orientation unification →
+ * 2-manifold assertion. An empty mesh is returned untouched.
+ * @param positions - flat XYZ vertex buffer.
+ * @param indices - triangle index buffer.
+ * @param opts - optional tuning knobs, e.g. to skip the manifold assertion.
+ * @returns the reconciled mesh as a new ReconcileResult.
+ */
+export function reconcileMesh(positions, indices, opts) {
+    if (indices.length === 0 || indices.length % 3 !== 0) {
+        if (indices.length === 0)
+            return { positions, indices };
+        throw new Error(`[reconcile] indices length must be a multiple of 3, got ${indices.length}`);
+    }
+    let result = weldVertices(positions, indices);
+    result = removeDegenerate(result.positions, result.indices);
+    result = unifyOrientation(result.positions, result.indices);
+    if (opts?.assertManifold !== false) {
+        assertManifold(result.positions, result.indices);
+    }
+    return result;
+}
+//# sourceMappingURL=reconcile.js.map

package/dist/mesh/reconcile.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reconcile.js","sourceRoot":"","sources":["../../src/mesh/reconcile.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,qBAAqB,CAAA;AAWzD,kBAAkB;AAElB;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAC1B,SAAuB,EACvB,OAAoB;IAEpB,MAAM,MAAM,GAAG,mBAAmB,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,CAAA;IACtE,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,CAAA;AACjE,CAAC;AAED,kBAAkB;AAElB,0BAA0B;AAC1B,SAAS,YAAY,CAAC,SAAuB;IAC3C,IAAI,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,QAAQ,CAAA;IACrD,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAA;IACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAClE,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAA;QACtB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAA;QACtB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAA;QACtB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAA;QACtB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAA;QACtB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAA;IACxB,CAAC;IACD,MAAM,EAAE,GAAG,IAAI,GAAG,IAAI,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI,CAAA;IAC1D,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;AAC/C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC9B,SAAuB,EACvB,OAAoB;IAEpB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;IACnC,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAA;IAEjD,MAAM,IAAI,GAAG,YAAY,CAAC,SAAS,CAAC,CAAA;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,IAAI,CAAA;IAC3B,MAAM,SAAS,GAAG,OAAO,GAAG,OAAO,CAAA;IAEnC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAA;IACrC,IAAI,SAAS,GAAG,CAAC,CAAA;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACzB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC7B,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC7B,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACpF,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACpF,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAEpF,4CAA4C;QAC5C,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;QAC9C,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;QAC9C,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;QAC5B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;QAC5B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;QAC5B,MAAM,UAAU,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;QAE9C,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YACX,SAAS,EAAE,CAAA;QACb,CAAC;IACH,CAAC;IAED,IAAI,SAAS,KAAK,QAAQ;QAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAA;IAEzD,MAAM,UAAU,GAAG,IAAI,WAAW,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA;IACjD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAA;IACvC,MAAM,SAAS,GAAa,EAAE,CAAA;IAE9B,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,SAAQ;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YAC7B,IAAI,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACtB,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,EAAE,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;gBACzB,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;gBACjB,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACjF,CAAC;YACD,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAA;QACxB,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,IAAI,YAAY,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,UAAU,EAAE,CAAA;AACxE,CAAC;AAWD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,gBAAgB,CAC9B,SAAuB,EACvB,OAAoB;IAEpB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;IACnC,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAA;IAEjD,2BAA2B;IAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkC,CAAA;IACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACzB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC7B,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC7B,UAAU,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;QACrB,UAAU,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;QACrB,UAAU,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;IACvB,CAAC;IAED,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS,EAAE,GAAW;QACnD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACxB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACxB,IAAI,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC3B,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG,IAAI,GAAG,EAAE,CAAA;YACjB,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;QACxB,CAAC;QACD,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACxB,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,EAAE,CAAA;YACT,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QACrB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;IACzC,CAAC;IAED,0BAA0B;IAC1B,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAA;IACrC,MAAM,KAAK,GAAa,EAAE,CAAA;IAE1B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC;QAC3C,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAQ;QAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACd,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;QAChB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAEhB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;YACxB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAExC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;gBAC9B,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBACxC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBACxB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBACxB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;gBACrC,IAAI,CAAC,IAAI;oBAAE,SAAQ;gBAEnB,MAAM,UAAU,GAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBACzC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;oBACvB,IAAI,GAAG,CAAC,GAAG,KAAK,GAAG;wBAAE,SAAQ;oBAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC;wBAAE,SAAQ;oBACjC,iCAAiC;oBACjC,MAAM,QAAQ,GAAG,OAAO,GAAG,UAAU,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;oBAC7D,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAA;oBACxB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAA;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAClB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YAC1B,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YAC/B,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;QACtB,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,EAAE,CAAA;AACpC,CAAC;AAED,2BAA2B;AAE3B;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,SAAuB,EAAE,OAAoB;IAC1E,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;IACnC,MAAM,SAAS,GAAG,IAAI,GAAG,EAA+B,CAAA;IAExD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACzB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC7B,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC7B,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QACZ,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QACZ,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;IACd,CAAC;IAED,SAAS,IAAI,CAAC,CAAS,EAAE,CAAS;QAChC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACxB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACxB,IAAI,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC7B,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG,IAAI,GAAG,EAAE,CAAA;YACjB,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;QAC1B,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IACzC,CAAC;IAED,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;YAChC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,MAAM,IAAI,KAAK,CACb,qCAAqC,EAAE,IAAI,EAAE,eAAe,KAAK,yBAAyB,CAC3F,CAAA;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAYD;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,SAAuB,EACvB,OAAoB,EACpB,IAAuB;IAEvB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACrD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAA;QACvD,MAAM,IAAI,KAAK,CAAC,2DAA2D,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;IAC9F,CAAC;IAED,IAAI,MAAM,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;IAC7C,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,OAAO,CAAC,CAAA;IAC3D,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,OAAO,CAAC,CAAA;IAE3D,IAAI,IAAI,EAAE,cAAc,KAAK,KAAK,EAAE,CAAC;QACnC,cAAc,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,OAAO,CAAC,CAAA;IAClD,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC","sourcesContent":["/**\n * reconcile — BREP 三角汤归约为合法 2-manifold 网格（P0-1c）\n *\n *\n * 职责：把 OCCT 逐面三角化（`kernel.meshShape` 产物：共享边顶点重复、\n * 可能带朝向/退化问题）归约为 manifold-3d 可接受的合法 2-manifold 网格。\n * weld（顶点焊接）只是其中一步，故文件名为 reconcile 而非 weld。\n *\n * 纯数据、无 wasm 依赖、可单测。四步按顺序执行，每步可独立断言：\n *   1. 顶点焊接（复用 csg-core 的 weldPositionsWorker，1e-6 mm 量化，推原始坐标无精度损失）\n *   2. 退化剔除（零面积三角形）\n *   3. 朝向统一（连通分量内面法向传播，翻转不一致者）\n *   4. 2-manifold 断言（每条边恰好被 2 个三角形共享；不满足即显式报错，不静默、不 try-catch 回退）\n *\n * 红线（AGENTS.md）：这是输入数据规整，不是运行时回退——调用方（stdlib 各 op 的\n * mesh 路径）在 dispatchPath 静态判定为 'mesh' 之后、进入 manifold 之前调用。\n */\n\nimport { weldPositionsWorker } from '../boolean/csg-core'\n\n/**\n * Result of one reconciliation step: the reduced vertex buffer and the index\n * buffer of triangles referencing it.\n */\nexport interface ReconcileResult {\n  positions: Float32Array\n  indices: Uint32Array\n}\n\n// ── 步骤 1：顶点焊接 ──\n\n/**\n * Weld duplicated vertices shared across triangle edges (reuses the single\n * csg-core weld implementation). Input coordinates are preserved — the 1e-6\n * quantization is only used as a map key and is never written back — so there\n * is no precision loss.\n * @param positions - flat XYZ vertex buffer, length 3 * vertexCount.\n * @param indices - triangle index buffer, length 3 * triangleCount.\n * @returns the welded mesh as a new ReconcileResult.\n */\nexport function weldVertices(\n  positions: Float32Array,\n  indices: Uint32Array,\n): ReconcileResult {\n  const welded = weldPositionsWorker(positions, indices, indices.length)\n  return { positions: welded.positions, indices: welded.indices }\n}\n\n// ── 步骤 2：退化剔除 ──\n\n/** 计算包围盒对角线长度（数值尺度参考）。 */\nfunction bboxDiagonal(positions: Float32Array): number {\n  let minX = Infinity, minY = Infinity, minZ = Infinity\n  let maxX = -Infinity, maxY = -Infinity, maxZ = -Infinity\n  for (let i = 0; i < positions.length; i += 3) {\n    const x = positions[i], y = positions[i + 1], z = positions[i + 2]\n    if (x < minX) minX = x\n    if (y < minY) minY = y\n    if (z < minZ) minZ = z\n    if (x > maxX) maxX = x\n    if (y > maxY) maxY = y\n    if (z > maxZ) maxZ = z\n  }\n  const dx = maxX - minX, dy = maxY - minY, dz = maxZ - minZ\n  return Math.sqrt(dx * dx + dy * dy + dz * dz)\n}\n\n/**\n * Drop zero-area triangles and compact the surviving indices, also squeezing\n * out vertices that are no longer referenced. A triangle is degenerate when\n * its area is below the relative threshold (diagonal * 1e-9)².\n * @param positions - flat XYZ vertex buffer, length 3 * vertexCount.\n * @param indices - triangle index buffer, length 3 * triangleCount.\n * @returns the cleaned mesh as a new ReconcileResult.\n */\nexport function removeDegenerate(\n  positions: Float32Array,\n  indices: Uint32Array,\n): ReconcileResult {\n  const triCount = indices.length / 3\n  if (triCount === 0) return { positions, indices }\n\n  const diag = bboxDiagonal(positions)\n  const areaEps = diag * 1e-9\n  const areaEpsSq = areaEps * areaEps\n\n  const keep = new Uint8Array(triCount)\n  let keptCount = 0\n  for (let t = 0; t < triCount; t++) {\n    const i0 = indices[t * 3]\n    const i1 = indices[t * 3 + 1]\n    const i2 = indices[t * 3 + 2]\n    const x0 = positions[i0 * 3], y0 = positions[i0 * 3 + 1], z0 = positions[i0 * 3 + 2]\n    const x1 = positions[i1 * 3], y1 = positions[i1 * 3 + 1], z1 = positions[i1 * 3 + 2]\n    const x2 = positions[i2 * 3], y2 = positions[i2 * 3 + 1], z2 = positions[i2 * 3 + 2]\n\n    // cross(u, v) 长度平方：u = v1 - v0, v = v2 - v0\n    const ux = x1 - x0, uy = y1 - y0, uz = z1 - z0\n    const vx = x2 - x0, vy = y2 - y0, vz = z2 - z0\n    const cx = uy * vz - uz * vy\n    const cy = uz * vx - ux * vz\n    const cz = ux * vy - uy * vx\n    const crossLenSq = cx * cx + cy * cy + cz * cz\n\n    if (crossLenSq > areaEpsSq) {\n      keep[t] = 1\n      keptCount++\n    }\n  }\n\n  if (keptCount === triCount) return { positions, indices }\n\n  const newIndices = new Uint32Array(keptCount * 3)\n  const remap = new Map<number, number>()\n  const newPosArr: number[] = []\n\n  let out = 0\n  for (let t = 0; t < triCount; t++) {\n    if (!keep[t]) continue\n    for (let k = 0; k < 3; k++) {\n      const vi = indices[t * 3 + k]\n      let ni = remap.get(vi)\n      if (ni === undefined) {\n        ni = newPosArr.length / 3\n        remap.set(vi, ni)\n        newPosArr.push(positions[vi * 3], positions[vi * 3 + 1], positions[vi * 3 + 2])\n      }\n      newIndices[out++] = ni\n    }\n  }\n\n  return { positions: new Float32Array(newPosArr), indices: newIndices }\n}\n\n// ── 步骤 3：朝向统一 ──\n\ninterface EdgeRef {\n  /** 三角形序号（indices / 3） */\n  tri: number\n  /** 该三角形沿排序后边的遍历方向：+1 = a→b，-1 = b→a */\n  dir: 1 | -1\n}\n\n/**\n * Propagate face winding across each connected component: adjacent triangles\n * sharing an edge must traverse it in opposite directions (manifold winding\n * consistency). Triangles that violate this are flipped (v1/v2 swapped).\n *\n * BFS propagates a flip state f ∈ {+1, -1} per connected component:\n *   f(neighbor) = -f(cur) * baseDir(cur, e) * baseDir(neighbor, e)\n * A conflict (one triangle demanded to flip by two different paths) means the\n * mesh is not orientable — the first assignment is kept and step 4's\n * 2-manifold assertion reports the error explicitly.\n * @param positions - flat XYZ vertex buffer.\n * @param indices - triangle index buffer.\n * @returns the orientation-unified mesh as a new ReconcileResult.\n */\nexport function unifyOrientation(\n  positions: Float32Array,\n  indices: Uint32Array,\n): ReconcileResult {\n  const triCount = indices.length / 3\n  if (triCount === 0) return { positions, indices }\n\n  // 无向边 → 共享它的 (tri, dir) 列表\n  const edgeMap = new Map<number, Map<number, EdgeRef[]>>()\n  for (let t = 0; t < triCount; t++) {\n    const i0 = indices[t * 3]\n    const i1 = indices[t * 3 + 1]\n    const i2 = indices[t * 3 + 2]\n    addEdgeRef(i0, i1, t)\n    addEdgeRef(i1, i2, t)\n    addEdgeRef(i2, i0, t)\n  }\n\n  function addEdgeRef(a: number, b: number, tri: number): void {\n    const lo = a < b ? a : b\n    const hi = a < b ? b : a\n    let inner = edgeMap.get(lo)\n    if (!inner) {\n      inner = new Map()\n      edgeMap.set(lo, inner)\n    }\n    let refs = inner.get(hi)\n    if (!refs) {\n      refs = []\n      inner.set(hi, refs)\n    }\n    refs.push({ tri, dir: a < b ? 1 : -1 })\n  }\n\n  // 0 = 未访问，1 = 原朝向，2 = 需翻转\n  const flip = new Uint8Array(triCount)\n  const queue: number[] = []\n\n  for (let seed = 0; seed < triCount; seed++) {\n    if (flip[seed] !== 0) continue\n    flip[seed] = 1\n    queue.length = 0\n    queue.push(seed)\n\n    while (queue.length > 0) {\n      const cur = queue.pop()!\n      const curFlip = flip[cur] === 2 ? -1 : 1\n\n      for (let k = 0; k < 3; k++) {\n        const a = indices[cur * 3 + k]\n        const b = indices[cur * 3 + (k + 1) % 3]\n        const lo = a < b ? a : b\n        const hi = a < b ? b : a\n        const refs = edgeMap.get(lo)?.get(hi)\n        if (!refs) continue\n\n        const baseDirCur: 1 | -1 = a < b ? 1 : -1\n        for (const ref of refs) {\n          if (ref.tri === cur) continue\n          if (flip[ref.tri] !== 0) continue\n          // f(n) = -f(c) × dir(c) × dir(n)\n          const needFlip = curFlip * baseDirCur * ref.dir === 1 ? 2 : 1\n          flip[ref.tri] = needFlip\n          queue.push(ref.tri)\n        }\n      }\n    }\n  }\n\n  // 应用翻转：交换每个三角形 v1/v2\n  const out = new Uint32Array(indices)\n  for (let t = 0; t < triCount; t++) {\n    if (flip[t] === 2) {\n      const tmp = out[t * 3 + 1]\n      out[t * 3 + 1] = out[t * 3 + 2]\n      out[t * 3 + 2] = tmp\n    }\n  }\n\n  return { positions, indices: out }\n}\n\n// ── 步骤 4：2-manifold 断言 ──\n\n/**\n * Assert the mesh is 2-manifold: every undirected edge is shared by exactly\n * two triangles. A violation throws immediately (no silent handling, no\n * try-catch fallback).\n * @param positions - flat XYZ vertex buffer.\n * @param indices - triangle index buffer.\n */\nexport function assertManifold(positions: Float32Array, indices: Uint32Array): void {\n  const triCount = indices.length / 3\n  const edgeCount = new Map<number, Map<number, number>>()\n\n  for (let t = 0; t < triCount; t++) {\n    const i0 = indices[t * 3]\n    const i1 = indices[t * 3 + 1]\n    const i2 = indices[t * 3 + 2]\n    bump(i0, i1)\n    bump(i1, i2)\n    bump(i2, i0)\n  }\n\n  function bump(a: number, b: number): void {\n    const lo = a < b ? a : b\n    const hi = a < b ? b : a\n    let inner = edgeCount.get(lo)\n    if (!inner) {\n      inner = new Map()\n      edgeCount.set(lo, inner)\n    }\n    inner.set(hi, (inner.get(hi) ?? 0) + 1)\n  }\n\n  for (const [lo, inner] of edgeCount) {\n    for (const [hi, count] of inner) {\n      if (count !== 2) {\n        throw new Error(\n          `[reconcile] not 2-manifold: edge (${lo},${hi}) shared by ${count} triangles (expected 2)`,\n        )\n      }\n    }\n  }\n}\n\n// ── 四步归约（默认入口） ──\n\n/**\n * Tuning knobs for the full reconciliation pass.\n */\nexport interface ReconcileOptions {\n  /** Whether to run the 2-manifold assertion (default true). */\n  assertManifold?: boolean\n}\n\n/**\n * Full reconciliation: weld → degenerate removal → orientation unification →\n * 2-manifold assertion. An empty mesh is returned untouched.\n * @param positions - flat XYZ vertex buffer.\n * @param indices - triangle index buffer.\n * @param opts - optional tuning knobs, e.g. to skip the manifold assertion.\n * @returns the reconciled mesh as a new ReconcileResult.\n */\nexport function reconcileMesh(\n  positions: Float32Array,\n  indices: Uint32Array,\n  opts?: ReconcileOptions,\n): ReconcileResult {\n  if (indices.length === 0 || indices.length % 3 !== 0) {\n    if (indices.length === 0) return { positions, indices }\n    throw new Error(`[reconcile] indices length must be a multiple of 3, got ${indices.length}`)\n  }\n\n  let result = weldVertices(positions, indices)\n  result = removeDegenerate(result.positions, result.indices)\n  result = unifyOrientation(result.positions, result.indices)\n\n  if (opts?.assertManifold !== false) {\n    assertManifold(result.positions, result.indices)\n  }\n  return result\n}\n"]}

package/dist/mesh/rigid-transform.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Rigid transform application (engine-side, P6).
+ *
+ * Applies a face_mate assembly transform to mesh vertices (bake).
+ * Math is identical to stdlib/compound.applyTransform and brep/brep-ops
+ * applyTransformBrep (p' = R·(p − pivot) + pivot + translation).
+ *
+ * Ownership (engine-library-contract.md §10.1): constraint solving lives in the
+ * library (api/assembly); applying the solved transform to member geometry is
+ * done by the engine during replay (F2: libraries must not query/mutate the DAG).
+ * This module is the engine-side vertex transform — it must not depend on any
+ * stdlib module (E-b: engine must not import stdlib/compound).
+ * Public API is unchanged: stdlib/compound still re-exports applyTransform.
+ */
+import type { Shape } from './types.js';
+/**
+ * Apply an assembly transform to a mesh shape: rotate the vertices about the
+ * pivot, then translate. The rotation is applied via the precomputed 3x3
+ * rotation matrix; the quaternion is carried along for source fidelity.
+ * @param shape - the mesh shape to transform.
+ * @param quaternion - source rotation as an (x, y, z, w) quaternion (informational).
+ * @param pivot - rotation pivot point in mm.
+ * @param translation - translation applied after rotation, in mm.
+ * @param rotationMatrix - 3x3 rotation matrix as 9 row-major entries.
+ * @returns a new shape sharing the same indices with transformed positions.
+ */
+export declare function applyTransform(shape: Shape, quaternion: [number, number, number, number], pivot: [number, number, number], translation: [number, number, number], rotationMatrix: number[]): Shape;
+//# sourceMappingURL=rigid-transform.d.ts.map

package/dist/mesh/rigid-transform.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rigid-transform.d.ts","sourceRoot":"","sources":["../../src/mesh/rigid-transform.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,SAAS,CAAA;AAWpC;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,KAAK,EACZ,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAC5C,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAC/B,WAAW,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EACrC,cAAc,EAAE,MAAM,EAAE,GACvB,KAAK,CAoBP"}

package/dist/mesh/rigid-transform.js

@@ -0,0 +1,51 @@
+/**
+ * Rigid transform application (engine-side, P6).
+ *
+ * Applies a face_mate assembly transform to mesh vertices (bake).
+ * Math is identical to stdlib/compound.applyTransform and brep/brep-ops
+ * applyTransformBrep (p' = R·(p − pivot) + pivot + translation).
+ *
+ * Ownership (engine-library-contract.md §10.1): constraint solving lives in the
+ * library (api/assembly); applying the solved transform to member geometry is
+ * done by the engine during replay (F2: libraries must not query/mutate the DAG).
+ * This module is the engine-side vertex transform — it must not depend on any
+ * stdlib module (E-b: engine must not import stdlib/compound).
+ * Public API is unchanged: stdlib/compound still re-exports applyTransform.
+ */
+/** Matrix × vector (3x3 * 3). */
+function mat3MulVec(m, v) {
+    return [
+        m[0] * v[0] + m[1] * v[1] + m[2] * v[2],
+        m[3] * v[0] + m[4] * v[1] + m[5] * v[2],
+        m[6] * v[0] + m[7] * v[1] + m[8] * v[2],
+    ];
+}
+/**
+ * Apply an assembly transform to a mesh shape: rotate the vertices about the
+ * pivot, then translate. The rotation is applied via the precomputed 3x3
+ * rotation matrix; the quaternion is carried along for source fidelity.
+ * @param shape - the mesh shape to transform.
+ * @param quaternion - source rotation as an (x, y, z, w) quaternion (informational).
+ * @param pivot - rotation pivot point in mm.
+ * @param translation - translation applied after rotation, in mm.
+ * @param rotationMatrix - 3x3 rotation matrix as 9 row-major entries.
+ * @returns a new shape sharing the same indices with transformed positions.
+ */
+export function applyTransform(shape, quaternion, pivot, translation, rotationMatrix) {
+    const positions = shape.positions;
+    const newPositions = new Float32Array(positions.length);
+    for (let i = 0; i < positions.length; i += 3) {
+        const px = positions[i] - pivot[0];
+        const py = positions[i + 1] - pivot[1];
+        const pz = positions[i + 2] - pivot[2];
+        const rotated = mat3MulVec(rotationMatrix, [px, py, pz]);
+        newPositions[i] = rotated[0] + pivot[0] + translation[0];
+        newPositions[i + 1] = rotated[1] + pivot[1] + translation[1];
+        newPositions[i + 2] = rotated[2] + pivot[2] + translation[2];
+    }
+    return {
+        positions: newPositions,
+        indices: shape.indices,
+    };
+}
+//# sourceMappingURL=rigid-transform.js.map

package/dist/mesh/rigid-transform.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rigid-transform.js","sourceRoot":"","sources":["../../src/mesh/rigid-transform.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,iCAAiC;AACjC,SAAS,UAAU,CAAC,CAAW,EAAE,CAA2B;IAC1D,OAAO;QACL,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;QACvC,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;QACvC,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;KACxC,CAAA;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAY,EACZ,UAA4C,EAC5C,KAA+B,EAC/B,WAAqC,EACrC,cAAwB;IAExB,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAA;IACjC,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;IAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7C,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QAClC,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QACtC,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QAEtC,MAAM,OAAO,GAAG,UAAU,CAAC,cAAc,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;QAExD,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;QACxD,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;QAC5D,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IAC9D,CAAC;IAED,OAAO;QACL,SAAS,EAAE,YAAY;QACvB,OAAO,EAAE,KAAK,CAAC,OAAO;KACvB,CAAA;AACH,CAAC","sourcesContent":["/**\n * Rigid transform application (engine-side, P6).\n *\n * Applies a face_mate assembly transform to mesh vertices (bake).\n * Math is identical to stdlib/compound.applyTransform and brep/brep-ops\n * applyTransformBrep (p' = R·(p − pivot) + pivot + translation).\n *\n * Ownership (engine-library-contract.md §10.1): constraint solving lives in the\n * library (api/assembly); applying the solved transform to member geometry is\n * done by the engine during replay (F2: libraries must not query/mutate the DAG).\n * This module is the engine-side vertex transform — it must not depend on any\n * stdlib module (E-b: engine must not import stdlib/compound).\n * Public API is unchanged: stdlib/compound still re-exports applyTransform.\n */\n\nimport type { Shape } from './types'\n\n/** Matrix × vector (3x3 * 3). */\nfunction mat3MulVec(m: number[], v: [number, number, number]): [number, number, number] {\n  return [\n    m[0] * v[0] + m[1] * v[1] + m[2] * v[2],\n    m[3] * v[0] + m[4] * v[1] + m[5] * v[2],\n    m[6] * v[0] + m[7] * v[1] + m[8] * v[2],\n  ]\n}\n\n/**\n * Apply an assembly transform to a mesh shape: rotate the vertices about the\n * pivot, then translate. The rotation is applied via the precomputed 3x3\n * rotation matrix; the quaternion is carried along for source fidelity.\n * @param shape - the mesh shape to transform.\n * @param quaternion - source rotation as an (x, y, z, w) quaternion (informational).\n * @param pivot - rotation pivot point in mm.\n * @param translation - translation applied after rotation, in mm.\n * @param rotationMatrix - 3x3 rotation matrix as 9 row-major entries.\n * @returns a new shape sharing the same indices with transformed positions.\n */\nexport function applyTransform(\n  shape: Shape,\n  quaternion: [number, number, number, number],\n  pivot: [number, number, number],\n  translation: [number, number, number],\n  rotationMatrix: number[],\n): Shape {\n  const positions = shape.positions\n  const newPositions = new Float32Array(positions.length)\n\n  for (let i = 0; i < positions.length; i += 3) {\n    const px = positions[i] - pivot[0]\n    const py = positions[i + 1] - pivot[1]\n    const pz = positions[i + 2] - pivot[2]\n\n    const rotated = mat3MulVec(rotationMatrix, [px, py, pz])\n\n    newPositions[i] = rotated[0] + pivot[0] + translation[0]\n    newPositions[i + 1] = rotated[1] + pivot[1] + translation[1]\n    newPositions[i + 2] = rotated[2] + pivot[2] + translation[2]\n  }\n\n  return {\n    positions: newPositions,\n    indices: shape.indices,\n  }\n}\n"]}