@faicad/faijs 0.13.0

package/dist/boolean/csg-core.js

@@ -0,0 +1,576 @@
+/**
+ * csg-core — CSG 纯计算函数（从 csg-worker.ts 提取）
+ *
+ *
+ * 这些函数不依赖 Worker 环境（无 self.onmessage / postMessage），
+ * 可被 WorkerCsgBackend（经 csg-worker.ts）和 InlineCsgBackend（主线程直跑）共用。
+ *
+ * 依赖：manifold-3d 核心模块（Manifold / Mesh 构造器）、dovetail-math、joinery-shapes
+ */
+import { vec3Cross, vec3Normalize, } from './dovetail-math.js';
+import { buildWedgeGeometry, buildDowelGeometry, buildStraightTenonGeometry, } from './joinery-shapes.js';
+// ── Manifold → MeshData 转换 ──
+/**
+ * Extract {positions, indices} from a Manifold mesh.
+ * Handles the numProp > 3 case (manifold may carry extra property channels).
+ * @param manifold The manifold from which to read mesh data.
+ * @returns The extracted positions and indices buffers.
+ */
+export function manifoldToMeshData(manifold) {
+    const resultMesh = manifold.getMesh();
+    const numProp = resultMesh.numProp || 3;
+    const vertPropsLen = resultMesh.vertProperties ? resultMesh.vertProperties.length : 0;
+    const vertCount = numProp > 0 ? Math.floor(vertPropsLen / numProp) : 0;
+    const positions = new Float32Array(vertCount * 3);
+    for (let i = 0; i < vertCount; i++) {
+        const base = i * numProp;
+        positions[i * 3] = resultMesh.vertProperties[base];
+        positions[i * 3 + 1] = resultMesh.vertProperties[base + 1];
+        positions[i * 3 + 2] = resultMesh.vertProperties[base + 2];
+    }
+    const triVerts = resultMesh.triVerts;
+    const indices = triVerts ? new Uint32Array(triVerts) : new Uint32Array(0);
+    return { positions, indices };
+}
+// ── MeshData → Manifold ──
+/**
+ * Build a Manifold from mesh data, welding duplicate vertices when the density
+ * is too high (close to one independent vertex per triangle) before Manifold.ofMesh.
+ * Shared by the Inline and Worker backends so both produce identical input conversion.
+ * @param Manifold The Manifold constructor from the manifold module.
+ * @param Mesh     The Mesh constructor from the manifold module.
+ * @param mesh     The mesh data (positions and indices).
+ * @returns The constructed Manifold instance.
+ */
+export function meshToManifold(Manifold, Mesh, mesh) {
+    const triCount = mesh.indices.length / 3;
+    const vertCount = mesh.positions.length / 3;
+    let positions = mesh.positions;
+    let indices = mesh.indices;
+    if (vertCount >= triCount * 3 * 0.9) {
+        const welded = weldPositionsWorker(mesh.positions, mesh.indices, mesh.indices.length);
+        positions = welded.positions;
+        indices = welded.indices;
+    }
+    return Manifold.ofMesh(new Mesh({
+        numProp: 3,
+        vertProperties: positions,
+        triVerts: indices,
+    }));
+}
+/**
+ * Sequentially apply a boolean operation across an array of Manifolds.
+ * The caller is responsible for deleting the input manifolds and the result.
+ * @param op         The boolean operation to apply (union/subtract/intersect).
+ * @param manifolds  The manifolds to combine in order.
+ * @returns The resulting Manifold of the chain.
+ */
+export function chainBoolean(op, manifolds) {
+    let result = manifolds[0];
+    for (let i = 1; i < manifolds.length; i++) {
+        switch (op) {
+            case 'union':
+                result = result.add(manifolds[i]);
+                break;
+            case 'subtract':
+                result = result.subtract(manifolds[i]);
+                break;
+            case 'intersect':
+                result = result.intersect(manifolds[i]);
+                break;
+        }
+    }
+    return result;
+}
+// ── 顶点焊接 ──
+/**
+ * Weld duplicate vertices using a quantized 1 µm grid.
+ * Uses three nested numeric Maps (no string allocation).
+ * @param positions The input vertex positions.
+ * @param indices   The input triangle indices.
+ * @param count     The number of indices to process.
+ * @returns The welded positions and remapped indices buffers.
+ */
+export function weldPositionsWorker(positions, indices, count) {
+    const mapX = new Map();
+    const weldedPosArr = [];
+    const weldedIdxArr = [];
+    for (let i = 0; i < count; i++) {
+        const vi = indices[i];
+        const x = positions[vi * 3];
+        const y = positions[vi * 3 + 1];
+        const z = positions[vi * 3 + 2];
+        const qx = Math.round(x * 1e6);
+        const qy = Math.round(y * 1e6);
+        const qz = Math.round(z * 1e6);
+        let mapY = mapX.get(qx);
+        if (mapY === undefined) {
+            mapY = new Map();
+            mapX.set(qx, mapY);
+        }
+        let mapZ = mapY.get(qy);
+        if (mapZ === undefined) {
+            mapZ = new Map();
+            mapY.set(qy, mapZ);
+        }
+        let ni = mapZ.get(qz);
+        if (ni === undefined) {
+            ni = weldedPosArr.length / 3;
+            mapZ.set(qz, ni);
+            weldedPosArr.push(x, y, z);
+        }
+        weldedIdxArr.push(ni);
+    }
+    return {
+        positions: new Float32Array(weldedPosArr),
+        indices: new Uint32Array(weldedIdxArr),
+    };
+}
+// ── Union-Find ──
+/** Simple union-find for clustering cap triangles by shared edges. */
+export class SimpleUnionFind {
+    parent;
+    rank;
+    /**
+     * Create a union-find structure with n initial singletons.
+     * @param n The number of elements.
+     */
+    constructor(n) {
+        this.parent = Array.from({ length: n }, (_, i) => i);
+        this.rank = new Array(n).fill(0);
+    }
+    /**
+     * Find the root representative of the element x (with path compression).
+     * @param x The element to look up.
+     * @returns The root index of the set containing x.
+     */
+    find(x) {
+        if (this.parent[x] !== x) {
+            this.parent[x] = this.find(this.parent[x]);
+        }
+        return this.parent[x];
+    }
+    /**
+     * Union the sets containing x and y.
+     * @param x The first element.
+     * @param y The second element.
+     */
+    union(x, y) {
+        const px = this.find(x);
+        const py = this.find(y);
+        if (px === py)
+            return;
+        if (this.rank[px] < this.rank[py]) {
+            this.parent[px] = py;
+        }
+        else if (this.rank[px] > this.rank[py]) {
+            this.parent[py] = px;
+        }
+        else {
+            this.parent[py] = px;
+            this.rank[px]++;
+        }
+    }
+}
+// ── Wedge (trapezoidal prism) creation ──
+/**
+ * Create a wedge (trapezoidal prism) Manifold from cutting-plane parameters.
+ * @param Manifold       The Manifold constructor from the manifold module.
+ * @param Mesh           The Mesh constructor from the manifold module.
+ * @param planeCenter    Center of the cutting plane.
+ * @param normal         Cutting plane normal (unit vector).
+ * @param widthDir       Extrusion direction (unit vector).
+ * @param depth          Wedge depth (mm).
+ * @param width          Wedge width (mm).
+ * @param angleDeg       Slant angle of the wedge sides (degrees).
+ * @param extrudeLength  Total extrusion length along widthDir (mm).
+ * @returns The constructed wedge Manifold.
+ */
+export function createWedge(Manifold, Mesh, planeCenter, normal, widthDir, depth, width, angleDeg, extrudeLength) {
+    const { positions, indices } = buildWedgeGeometry(planeCenter, normal, widthDir, depth, width, angleDeg, extrudeLength);
+    const mesh = new Mesh({
+        numProp: 3,
+        vertProperties: positions,
+        triVerts: indices,
+    });
+    return Manifold.ofMesh(mesh);
+}
+// ── Cap component detection ──
+/**
+ * Detect connected components of cap faces on the cutting plane.
+ * Returns an array of components, each being a Set of vertex indices.
+ * @param upper         The upper mesh to scan for cap faces.
+ * @param normal        The cutting plane normal.
+ * @param originOffset  The cutting plane offset along the normal.
+ * @returns An array of components, each a Set of vertex indices on the cap.
+ */
+export function detectCapComponents(upper, normal, originOffset) {
+    const mesh = upper.getMesh();
+    const eps = 0.001;
+    const numProp = mesh.numProp || 3;
+    const vertCount = Math.floor(mesh.vertProperties.length / numProp);
+    const triVerts = mesh.triVerts;
+    if (!triVerts || triVerts.length === 0)
+        return [];
+    const capVertSet = new Set();
+    const capTris = [];
+    const triCount = triVerts.length / 3;
+    for (let t = 0; t < triCount; t++) {
+        const i0 = triVerts[t * 3];
+        const i1 = triVerts[t * 3 + 1];
+        const i2 = triVerts[t * 3 + 2];
+        const d0 = Math.abs(mesh.vertProperties[i0 * numProp] * normal[0] +
+            mesh.vertProperties[i0 * numProp + 1] * normal[1] +
+            mesh.vertProperties[i0 * numProp + 2] * normal[2] - originOffset);
+        const d1 = Math.abs(mesh.vertProperties[i1 * numProp] * normal[0] +
+            mesh.vertProperties[i1 * numProp + 1] * normal[1] +
+            mesh.vertProperties[i1 * numProp + 2] * normal[2] - originOffset);
+        const d2 = Math.abs(mesh.vertProperties[i2 * numProp] * normal[0] +
+            mesh.vertProperties[i2 * numProp + 1] * normal[1] +
+            mesh.vertProperties[i2 * numProp + 2] * normal[2] - originOffset);
+        if (d0 < eps && d1 < eps && d2 < eps) {
+            capTris.push({ v0: i0, v1: i1, v2: i2 });
+            capVertSet.add(i0);
+            capVertSet.add(i1);
+            capVertSet.add(i2);
+        }
+    }
+    if (capTris.length === 0)
+        return [];
+    const uf = new SimpleUnionFind(vertCount);
+    for (const tri of capTris) {
+        uf.union(tri.v0, tri.v1);
+        uf.union(tri.v1, tri.v2);
+        uf.union(tri.v0, tri.v2);
+    }
+    const compMap = new Map();
+    for (const vi of capVertSet) {
+        const root = uf.find(vi);
+        if (!compMap.has(root))
+            compMap.set(root, new Set());
+        compMap.get(root).add(vi);
+    }
+    return Array.from(compMap.values());
+}
+// ── Cross-section width computation ──
+/**
+ * Compute the actual extent of the model's cross-section at the cutting plane
+ * along the width direction.
+ * @param upper         The upper mesh to measure.
+ * @param normal        The cutting plane normal.
+ * @param originOffset  The cutting plane offset along the normal.
+ * @param widthDir      The width direction along which to measure.
+ * @param comp          Optional connected component to restrict the measurement to.
+ * @returns The cross-section extent along the width direction (0 when none found).
+ */
+export function computeCrossSectionWidth(upper, normal, originOffset, widthDir, comp) {
+    const mesh = upper.getMesh();
+    const eps = 0.001;
+    let minProj = Infinity;
+    let maxProj = -Infinity;
+    let found = false;
+    const numProp = mesh.numProp || 3;
+    const vertCount = Math.floor(mesh.vertProperties.length / numProp);
+    for (let i = 0; i < vertCount; i++) {
+        if (comp && !comp.has(i))
+            continue;
+        const base = i * numProp;
+        const x = mesh.vertProperties[base];
+        const y = mesh.vertProperties[base + 1];
+        const z = mesh.vertProperties[base + 2];
+        const dist = x * normal[0] + y * normal[1] + z * normal[2] - originOffset;
+        if (Math.abs(dist) < eps) {
+            const proj = x * widthDir[0] + y * widthDir[1] + z * widthDir[2];
+            if (proj < minProj)
+                minProj = proj;
+            if (proj > maxProj)
+                maxProj = proj;
+            found = true;
+        }
+    }
+    if (!found)
+        return 0;
+    return maxProj - minProj;
+}
+// ── Cross-section centroid computation ──
+/**
+ * Compute the centroid of vertices lying on the cutting plane.
+ * @param upper         The upper mesh to scan.
+ * @param normal        The cutting plane normal.
+ * @param originOffset  The cutting plane offset along the normal.
+ * @param fallback      The centroid fallback when no vertex lies on the plane.
+ * @param comp          Optional connected component to restrict the measurement to.
+ * @returns The computed centroid, or the fallback when none is found.
+ */
+export function computeCrossSectionCentroid(upper, normal, originOffset, fallback, comp) {
+    const mesh = upper.getMesh();
+    const eps = 0.001;
+    let cx = 0, cy = 0, cz = 0;
+    let count = 0;
+    const numProp = mesh.numProp || 3;
+    const vertCount = Math.floor(mesh.vertProperties.length / numProp);
+    for (let i = 0; i < vertCount; i++) {
+        if (comp && !comp.has(i))
+            continue;
+        const base = i * numProp;
+        const x = mesh.vertProperties[base];
+        const y = mesh.vertProperties[base + 1];
+        const z = mesh.vertProperties[base + 2];
+        const dist = x * normal[0] + y * normal[1] + z * normal[2] - originOffset;
+        if (Math.abs(dist) < eps) {
+            cx += x;
+            cy += y;
+            cz += z;
+            count++;
+        }
+    }
+    if (count === 0)
+        return fallback;
+    return [cx / count, cy / count, cz / count];
+}
+// ── Dovetail boolean split ──
+/**
+ * Perform the dovetail split using boolean operations.
+ * @param Manifold - the Manifold constructor from the manifold module.
+ * @param Mesh - the Mesh constructor from the manifold module.
+ * @param original - the original manifold to split.
+ * @param normal - the cutting plane normal (unit vector).
+ * @param originOffset - the plane equation origin offset along the normal.
+ * @param planeCenter - a point on the cutting plane used to center the wedge.
+ * @param widthDirInput - the width direction in the cutting plane (will be normalized).
+ * @param bboxWidthOnWidthDir - the model's bounding-box width along widthDir, used as a fallback cross-section width.
+ * @param groove - the dovetail groove design parameters (depth, tolerances, width, flaps angle).
+ * @param keepOriginal - when true, the original manifold is not deleted after splitting (default false).
+ * @returns a tuple of the split upper manifold, lower manifold, and the trimmed wedge mesh data (or null when empty).
+ */
+export function dovetailBooleanSplit(Manifold, Mesh, original, normal, originOffset, planeCenter, widthDirInput, bboxWidthOnWidthDir, groove, keepOriginal = false) {
+    const widthDir = vec3Normalize(widthDirInput);
+    // Step 1: Split by plane → upper + lower
+    const [upper, lower] = original.splitByPlane(normal, originOffset);
+    if (!keepOriginal)
+        original.delete();
+    // Step 2: Compute actual cross-section width at the cutting plane
+    let crossSectionWidth = computeCrossSectionWidth(upper, normal, originOffset, widthDir);
+    if (crossSectionWidth <= 0) {
+        crossSectionWidth = bboxWidthOnWidthDir;
+    }
+    const extrudeLength = crossSectionWidth + 0.2;
+    // Step 3: Create wedge W with generous overhang along widthDir
+    const overhang = 20;
+    const wedgeW = createWedge(Manifold, Mesh, planeCenter, normal, widthDir, groove.depth, groove.width, groove.flapsAngle, extrudeLength + overhang);
+    // Trim the wedge to the model by intersecting with lower.
+    let wedgeForUnion;
+    let wedgeMeshData;
+    let lowerForSubtract;
+    if (!wedgeW.isEmpty() && !lower.isEmpty()) {
+        const lowerMeshData = manifoldToMeshData(lower);
+        const trimmedWedge = wedgeW.intersect(lower);
+        wedgeW.delete();
+        lower.delete();
+        wedgeMeshData = trimmedWedge.isEmpty() ? null : manifoldToMeshData(trimmedWedge);
+        wedgeForUnion = trimmedWedge;
+        lowerForSubtract = Manifold.ofMesh(new Mesh({
+            numProp: 3,
+            vertProperties: lowerMeshData.positions,
+            triVerts: lowerMeshData.indices,
+        }));
+    }
+    else {
+        wedgeMeshData = null;
+        wedgeForUnion = wedgeW;
+        lowerForSubtract = lower;
+    }
+    // Step 5: union(upper, wedgeForUnion) → upper'
+    let upperResult;
+    if (upper.isEmpty()) {
+        upper.delete();
+        upperResult = wedgeForUnion;
+    }
+    else if (wedgeForUnion.isEmpty()) {
+        wedgeForUnion.delete();
+        upperResult = upper;
+    }
+    else {
+        upperResult = upper.add(wedgeForUnion);
+        upper.delete();
+        wedgeForUnion.delete();
+    }
+    // Step 6: Create tolerance wedge W_tol
+    const wedgeTol = createWedge(Manifold, Mesh, planeCenter, normal, widthDir, groove.depth + groove.depthTolerance, groove.width + groove.widthTolerance, groove.flapsAngle, extrudeLength + overhang);
+    // Step 7: lower.subtract(wedgeTol) → lower'
+    let lowerResult;
+    if (lowerForSubtract.isEmpty()) {
+        wedgeTol.delete();
+        lowerResult = lowerForSubtract;
+    }
+    else if (wedgeTol.isEmpty()) {
+        wedgeTol.delete();
+        lowerResult = lowerForSubtract;
+    }
+    else {
+        lowerResult = lowerForSubtract.subtract(wedgeTol);
+        lowerForSubtract.delete();
+        wedgeTol.delete();
+    }
+    return [upperResult, lowerResult, wedgeMeshData];
+}
+// ── Dowel (cylinder) creation ──
+/**
+ * Create a cylindrical Manifold for the dowel tenon.
+ * @param Manifold - the Manifold constructor from the manifold module.
+ * @param Mesh - the Mesh constructor from the manifold module.
+ * @param centroid - the center of the cylinder in the cutting plane.
+ * @param normal - the cutting plane normal (unit vector, points "up").
+ * @param widthDir - the width direction in the cutting plane (unit vector).
+ * @param depthDir - the depth direction in the cutting plane (unit vector).
+ * @param diameter - the cylinder diameter (mm).
+ * @param height - the cylinder height (mm), extends along -normal.
+ * @param segments - the number of circular segments (default 32).
+ * @returns the resulting cylindrical Manifold instance.
+ */
+export function createDowel(Manifold, Mesh, centroid, normal, widthDir, depthDir, diameter, height, segments = 32) {
+    const { positions, indices } = buildDowelGeometry(centroid, normal, widthDir, depthDir, diameter, height, segments);
+    const mesh = new Mesh({
+        numProp: 3,
+        vertProperties: positions,
+        triVerts: indices,
+    });
+    return Manifold.ofMesh(mesh);
+}
+// ── Straight tenon (box) creation ──
+/**
+ * Create a box-shaped Manifold for the straight tenon.
+ * @param Manifold - the Manifold constructor from the manifold module.
+ * @param Mesh - the Mesh constructor from the manifold module.
+ * @param centroid - the center of the box in the cutting plane.
+ * @param normal - the cutting plane normal (unit vector, points "up").
+ * @param widthDir - the width direction in the cutting plane (unit vector).
+ * @param depthDir - the depth direction in the cutting plane (unit vector).
+ * @param sideLength - the square cross-section side length (mm).
+ * @param height - the box height (mm), extends along -normal.
+ * @returns the resulting box-shaped Manifold instance.
+ */
+export function createStraightTenon(Manifold, Mesh, centroid, normal, widthDir, depthDir, sideLength, height) {
+    const { positions, indices } = buildStraightTenonGeometry(centroid, normal, widthDir, depthDir, sideLength, height);
+    const mesh = new Mesh({
+        numProp: 3,
+        vertProperties: positions,
+        triVerts: indices,
+    });
+    return Manifold.ofMesh(mesh);
+}
+// ── Dowel / Straight-tenon boolean split ──
+/**
+ * Perform the dowel (or straight-tenon) split using boolean operations.
+ * @param Manifold - the Manifold constructor from the manifold module.
+ * @param Mesh - the Mesh constructor from the manifold module.
+ * @param original - the original manifold to split.
+ * @param normal - the cutting plane normal (unit vector).
+ * @param originOffset - the plane equation origin offset along the normal.
+ * @param planeCenter - a point on the cutting plane used to center the joinery.
+ * @param widthDirInput - the width direction in the cutting plane (will be normalized).
+ * @param shape - the joinery shape: 'dowel' or 'tenon'.
+ * @param params - the joinery sizing parameters (size, tolerances, height).
+ * @param keepOriginal - when true, the original manifold is not deleted after splitting (default false).
+ * @param selectedSections - optional list of indices selecting which cap sections receive joinery placement; null or empty means a single placement at the overall cross-section centroid.
+ * @returns a tuple of the split upper manifold, lower manifold, and the generated joinery mesh data (or null).
+ */
+export function dowelOrTenonBooleanSplit(Manifold, Mesh, original, normal, originOffset, planeCenter, widthDirInput, shape, params, keepOriginal = false, selectedSections) {
+    const widthDir = vec3Normalize(widthDirInput);
+    const depthDir = vec3Normalize(vec3Cross(normal, widthDir));
+    // Step 1: Split by plane → upper + lower
+    const [upper, lower] = original.splitByPlane(normal, originOffset);
+    if (!keepOriginal)
+        original.delete();
+    // Step 2: Detect cap components (multi-section support)
+    const components = detectCapComponents(upper, normal, originOffset);
+    let placements;
+    if (components.length <= 1 || !selectedSections || selectedSections.length === 0) {
+        const centroid = computeCrossSectionCentroid(upper, normal, originOffset, planeCenter);
+        placements = [{ centroid }];
+    }
+    else {
+        const compInfo = components.map((comp, idx) => {
+            const compWidth = computeCrossSectionWidth(upper, normal, originOffset, widthDir, comp);
+            const compCentroid = computeCrossSectionCentroid(upper, normal, originOffset, planeCenter, comp);
+            const compDepth = computeCrossSectionWidth(upper, normal, originOffset, depthDir, comp);
+            const area = compWidth * compDepth;
+            return { idx, comp, area, centroid: compCentroid };
+        });
+        compInfo.sort((a, b) => b.area - a.area);
+        placements = [];
+        for (const selId of selectedSections) {
+            if (selId < compInfo.length) {
+                placements.push({ centroid: compInfo[selId].centroid });
+            }
+        }
+        if (placements.length === 0) {
+            const centroid = computeCrossSectionCentroid(upper, normal, originOffset, planeCenter);
+            placements = [{ centroid }];
+        }
+    }
+    // Step 3: For each placement, create shape C (no tolerance) and union into upper
+    let shapeMeshData = null;
+    let upperResult = upper;
+    let upperOwned = true;
+    for (let pIdx = 0; pIdx < placements.length; pIdx++) {
+        const { centroid } = placements[pIdx];
+        let shapeC;
+        if (shape === 'dowel') {
+            shapeC = createDowel(Manifold, Mesh, centroid, normal, widthDir, depthDir, params.size, params.height, 32);
+        }
+        else {
+            shapeC = createStraightTenon(Manifold, Mesh, centroid, normal, widthDir, depthDir, params.size, params.height);
+        }
+        if (pIdx === 0) {
+            shapeMeshData = shapeC.isEmpty() ? null : manifoldToMeshData(shapeC);
+        }
+        if (upperResult.isEmpty()) {
+            if (upperOwned)
+                upperResult.delete();
+            upperResult = shapeC;
+            upperOwned = true;
+        }
+        else if (shapeC.isEmpty()) {
+            shapeC.delete();
+        }
+        else {
+            const newUpper = upperResult.add(shapeC);
+            if (upperOwned)
+                upperResult.delete();
+            upperResult = newUpper;
+            shapeC.delete();
+            upperOwned = true;
+        }
+    }
+    // Step 4: For each placement, create shape C_tol (with tolerance) and subtract from lower
+    const tolSize = params.size + params.sizeTolerance;
+    const tolHeight = params.height + params.heightTolerance;
+    let lowerResult = lower;
+    let lowerOwned = true;
+    for (const { centroid } of placements) {
+        let shapeCTol;
+        if (shape === 'dowel') {
+            shapeCTol = createDowel(Manifold, Mesh, centroid, normal, widthDir, depthDir, tolSize, tolHeight, 32);
+        }
+        else {
+            shapeCTol = createStraightTenon(Manifold, Mesh, centroid, normal, widthDir, depthDir, tolSize, tolHeight);
+        }
+        if (lowerResult.isEmpty()) {
+            shapeCTol.delete();
+        }
+        else if (shapeCTol.isEmpty()) {
+            shapeCTol.delete();
+        }
+        else {
+            const newLower = lowerResult.subtract(shapeCTol);
+            if (lowerOwned)
+                lowerResult.delete();
+            lowerResult = newLower;
+            shapeCTol.delete();
+            lowerOwned = true;
+        }
+    }
+    return [upperResult, lowerResult, shapeMeshData];
+}
+//# sourceMappingURL=csg-core.js.map

package/dist/boolean/csg-core.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"csg-core.js","sourceRoot":"","sources":["../../src/boolean/csg-core.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EACL,SAAS,EAAE,aAAa,GAEzB,MAAM,iBAAiB,CAAA;AACxB,OAAO,EACL,kBAAkB,EAClB,kBAAkB,EAClB,0BAA0B,GAC3B,MAAM,kBAAkB,CAAA;AAOzB,+BAA+B;AAE/B;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,QAA0B;IAG3D,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAA;IACrC,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,IAAI,CAAC,CAAA;IACvC,MAAM,YAAY,GAAG,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IACrF,MAAM,SAAS,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACtE,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,CAAC,GAAG,OAAO,CAAA;QACxB,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;QAClD,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;QAC1D,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;IAC5D,CAAC;IACD,MAAM,QAAQ,GAAG,UAAU,CAAC,QAAQ,CAAA;IACpC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAA;IACzE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAA;AAC/B,CAAC;AAED,4BAA4B;AAE5B;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAC5B,QAAsB,EACtB,IAAc,EACd,IAAuD;IAEvD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;IACxC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;IAC3C,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAA;IAC9B,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAA;IAE1B,IAAI,SAAS,IAAI,QAAQ,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;QACrF,SAAS,GAAG,MAAM,CAAC,SAAS,CAAA;QAC5B,OAAO,GAAG,MAAM,CAAC,OAAO,CAAA;IAC1B,CAAC;IAED,OAAO,QAAQ,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;QAC9B,OAAO,EAAE,CAAC;QACV,cAAc,EAAE,SAAS;QACzB,QAAQ,EAAE,OAAO;KAClB,CAAC,CAAC,CAAA;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,EAAsC,EACtC,SAA6B;IAE7B,IAAI,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,QAAQ,EAAE,EAAE,CAAC;YACX,KAAK,OAAO;gBACV,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;gBACjC,MAAK;YACP,KAAK,UAAU;gBACb,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;gBACtC,MAAK;YACP,KAAK,WAAW;gBACd,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;gBACvC,MAAK;QACT,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,aAAa;AAEb;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,SAAuB,EACvB,OAAoB,EACpB,KAAa;IAEb,MAAM,IAAI,GAAG,IAAI,GAAG,EAA4C,CAAA;IAChE,MAAM,YAAY,GAAa,EAAE,CAAA;IACjC,MAAM,YAAY,GAAa,EAAE,CAAA;IAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QACrB,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QAC3B,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/B,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;QAC9B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;QAC9B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;QAE9B,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACvB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,GAAG,IAAI,GAAG,EAA+B,CAAA;YAC7C,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QACpB,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACvB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;YAChC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QACpB,CAAC;QACD,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACrB,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,EAAE,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAA;YAC5B,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;YAChB,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QAC5B,CAAC;QACD,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACvB,CAAC;IAED,OAAO;QACL,SAAS,EAAE,IAAI,YAAY,CAAC,YAAY,CAAC;QACzC,OAAO,EAAE,IAAI,WAAW,CAAC,YAAY,CAAC;KACvC,CAAA;AACH,CAAC;AAED,mBAAmB;AAEnB,sEAAsE;AACtE,MAAM,OAAO,eAAe;IAClB,MAAM,CAAU;IAChB,IAAI,CAAU;IAEtB;;;OAGG;IACH,YAAY,CAAS;QACnB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;QACpD,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAClC,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,CAAS;QACZ,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QAC5C,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IACvB,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,CAAS,EAAE,CAAS;QACxB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACvB,IAAI,EAAE,KAAK,EAAE;YAAE,OAAM;QACrB,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAA;QACtB,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAA;QACtB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAA;YACpB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAA;QACjB,CAAC;IACH,CAAC;CACF;AAED,2CAA2C;AAE3C;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CACzB,QAAsB,EACtB,IAAc,EACd,WAAiB,EACjB,MAAY,EACZ,QAAc,EACd,KAAa,EACb,KAAa,EACb,QAAgB,EAChB,aAAqB;IAErB,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,kBAAkB,CAC/C,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,CACrE,CAAA;IACD,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC;QACpB,OAAO,EAAE,CAAC;QACV,cAAc,EAAE,SAAS;QACzB,QAAQ,EAAE,OAAO;KAClB,CAAC,CAAA;IACF,OAAO,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;AAC9B,CAAC;AAED,gCAAgC;AAEhC;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAuB,EACvB,MAAY,EACZ,YAAoB;IAEpB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAA;IAC5B,MAAM,GAAG,GAAG,KAAK,CAAA;IACjB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;IACjC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,OAAO,CAAC,CAAA;IAClE,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;IAC9B,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IAEjD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAA;IAEpC,MAAM,OAAO,GAAa,EAAE,CAAA;IAC5B,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAA;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC9B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC9B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CACjB,IAAI,CAAC,cAAc,CAAC,EAAE,GAAG,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,cAAc,CAAC,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YACjD,IAAI,CAAC,cAAc,CAAC,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAA;QACnE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CACjB,IAAI,CAAC,cAAc,CAAC,EAAE,GAAG,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,cAAc,CAAC,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YACjD,IAAI,CAAC,cAAc,CAAC,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAA;QACnE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CACjB,IAAI,CAAC,cAAc,CAAC,EAAE,GAAG,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,cAAc,CAAC,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YACjD,IAAI,CAAC,cAAc,CAAC,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAA;QACnE,IAAI,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;YACrC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;YACxC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC5D,CAAC;IACH,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IAEnC,MAAM,EAAE,GAAG,IAAI,eAAe,CAAC,SAAS,CAAC,CAAA;IACzC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;QACxB,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;QACxB,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;IAC1B,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC9C,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAU,CAAC,CAAA;QAC5D,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IAC5B,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;AACrC,CAAC;AAED,wCAAwC;AAExC;;;;;;;;;GASG;AACH,MAAM,UAAU,wBAAwB,CACtC,KAAuB,EACvB,MAAY,EACZ,YAAoB,EACpB,QAAc,EACd,IAAkB;IAElB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAA;IAC5B,MAAM,GAAG,GAAG,KAAK,CAAA;IACjB,IAAI,OAAO,GAAG,QAAQ,CAAA;IACtB,IAAI,OAAO,GAAG,CAAC,QAAQ,CAAA;IACvB,IAAI,KAAK,GAAG,KAAK,CAAA;IAEjB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;IACjC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,OAAO,CAAC,CAAA;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAQ;QAElC,MAAM,IAAI,GAAG,CAAC,GAAG,OAAO,CAAA;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;QAEvC,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,YAAY,CAAA;QACzE,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;YAChE,IAAI,IAAI,GAAG,OAAO;gBAAE,OAAO,GAAG,IAAI,CAAA;YAClC,IAAI,IAAI,GAAG,OAAO;gBAAE,OAAO,GAAG,IAAI,CAAA;YAClC,KAAK,GAAG,IAAI,CAAA;QACd,CAAC;IACH,CAAC;IAED,IAAI,CAAC,KAAK;QAAE,OAAO,CAAC,CAAA;IACpB,OAAO,OAAO,GAAG,OAAO,CAAA;AAC1B,CAAC;AAED,2CAA2C;AAE3C;;;;;;;;GAQG;AACH,MAAM,UAAU,2BAA2B,CACzC,KAAuB,EACvB,MAAY,EACZ,YAAoB,EACpB,QAAc,EACd,IAAkB;IAElB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAA;IAC5B,MAAM,GAAG,GAAG,KAAK,CAAA;IACjB,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;IAC1B,IAAI,KAAK,GAAG,CAAC,CAAA;IAEb,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;IACjC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,OAAO,CAAC,CAAA;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAQ;QAElC,MAAM,IAAI,GAAG,CAAC,GAAG,OAAO,CAAA;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;QAEvC,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,YAAY,CAAA;QACzE,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;YACzB,EAAE,IAAI,CAAC,CAAA;YACP,EAAE,IAAI,CAAC,CAAA;YACP,EAAE,IAAI,CAAC,CAAA;YACP,KAAK,EAAE,CAAA;QACT,CAAC;IACH,CAAC;IAED,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAA;IAChC,OAAO,CAAC,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,CAAC,CAAA;AAC7C,CAAC;AAED,+BAA+B;AAE/B;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAAsB,EACtB,IAAc,EACd,QAA0B,EAC1B,MAAY,EACZ,YAAoB,EACpB,WAAiB,EACjB,aAAmB,EACnB,mBAA2B,EAC3B,MAMC,EACD,eAAwB,KAAK;IAG7B,MAAM,QAAQ,GAAG,aAAa,CAAC,aAAa,CAAC,CAAA;IAE7C,yCAAyC;IACzC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,QAAQ,CAAC,YAAY,CAAC,MAAM,EAAE,YAAY,CAAC,CAAA;IAClE,IAAI,CAAC,YAAY;QAAE,QAAQ,CAAC,MAAM,EAAE,CAAA;IAEpC,kEAAkE;IAClE,IAAI,iBAAiB,GAAG,wBAAwB,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAA;IACvF,IAAI,iBAAiB,IAAI,CAAC,EAAE,CAAC;QAC3B,iBAAiB,GAAG,mBAAmB,CAAA;IACzC,CAAC;IACD,MAAM,aAAa,GAAG,iBAAiB,GAAG,GAAG,CAAA;IAE7C,+DAA+D;IAC/D,MAAM,QAAQ,GAAG,EAAE,CAAA;IAEnB,MAAM,MAAM,GAAG,WAAW,CACxB,QAAQ,EAAE,IAAI,EACd,WAAW,EAAE,MAAM,EAAE,QAAQ,EAC7B,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,UAAU,EAC7C,aAAa,GAAG,QAAQ,CACzB,CAAA;IAED,0DAA0D;IAC1D,IAAI,aAA+B,CAAA;IACnC,IAAI,aAAuE,CAAA;IAC3E,IAAI,gBAAkC,CAAA;IAEtC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC1C,MAAM,aAAa,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAA;QAE/C,MAAM,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QAC5C,MAAM,CAAC,MAAM,EAAE,CAAA;QACf,KAAK,CAAC,MAAM,EAAE,CAAA;QAEd,aAAa,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAA;QAChF,aAAa,GAAG,YAAY,CAAA;QAE5B,gBAAgB,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;YAC1C,OAAO,EAAE,CAAC;YACV,cAAc,EAAE,aAAa,CAAC,SAAS;YACvC,QAAQ,EAAE,aAAa,CAAC,OAAO;SAChC,CAAC,CAAC,CAAA;IACL,CAAC;SAAM,CAAC;QACN,aAAa,GAAG,IAAI,CAAA;QACpB,aAAa,GAAG,MAAM,CAAA;QACtB,gBAAgB,GAAG,KAAK,CAAA;IAC1B,CAAC;IAED,+CAA+C;IAC/C,IAAI,WAA6B,CAAA;IACjC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QACpB,KAAK,CAAC,MAAM,EAAE,CAAA;QACd,WAAW,GAAG,aAAa,CAAA;IAC7B,CAAC;SAAM,IAAI,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;QACnC,aAAa,CAAC,MAAM,EAAE,CAAA;QACtB,WAAW,GAAG,KAAK,CAAA;IACrB,CAAC;SAAM,CAAC;QACN,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAA;QACtC,KAAK,CAAC,MAAM,EAAE,CAAA;QACd,aAAa,CAAC,MAAM,EAAE,CAAA;IACxB,CAAC;IAED,uCAAuC;IACvC,MAAM,QAAQ,GAAG,WAAW,CAC1B,QAAQ,EAAE,IAAI,EACd,WAAW,EAAE,MAAM,EAAE,QAAQ,EAC7B,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,cAAc,EACpC,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,cAAc,EACpC,MAAM,CAAC,UAAU,EACjB,aAAa,GAAG,QAAQ,CACzB,CAAA;IAED,4CAA4C;IAC5C,IAAI,WAA6B,CAAA;IACjC,IAAI,gBAAgB,CAAC,OAAO,EAAE,EAAE,CAAC;QAC/B,QAAQ,CAAC,MAAM,EAAE,CAAA;QACjB,WAAW,GAAG,gBAAgB,CAAA;IAChC,CAAC;SAAM,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;QAC9B,QAAQ,CAAC,MAAM,EAAE,CAAA;QACjB,WAAW,GAAG,gBAAgB,CAAA;IAChC,CAAC;SAAM,CAAC;QACN,WAAW,GAAG,gBAAgB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;QACjD,gBAAgB,CAAC,MAAM,EAAE,CAAA;QACzB,QAAQ,CAAC,MAAM,EAAE,CAAA;IACnB,CAAC;IAED,OAAO,CAAC,WAAW,EAAE,WAAW,EAAE,aAAa,CAAC,CAAA;AAClD,CAAC;AAED,kCAAkC;AAElC;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CACzB,QAAsB,EACtB,IAAc,EACd,QAAc,EACd,MAAY,EACZ,QAAc,EACd,QAAc,EACd,QAAgB,EAChB,MAAc,EACd,WAAmB,EAAE;IAErB,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,kBAAkB,CAC/C,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,CACjE,CAAA;IACD,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC;QACpB,OAAO,EAAE,CAAC;QACV,cAAc,EAAE,SAAS;QACzB,QAAQ,EAAE,OAAO;KAClB,CAAC,CAAA;IACF,OAAO,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;AAC9B,CAAC;AAED,sCAAsC;AAEtC;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,mBAAmB,CACjC,QAAsB,EACtB,IAAc,EACd,QAAc,EACd,MAAY,EACZ,QAAc,EACd,QAAc,EACd,UAAkB,EAClB,MAAc;IAEd,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,0BAA0B,CACvD,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,CACzD,CAAA;IACD,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC;QACpB,OAAO,EAAE,CAAC;QACV,cAAc,EAAE,SAAS;QACzB,QAAQ,EAAE,OAAO;KAClB,CAAC,CAAA;IACF,OAAO,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;AAC9B,CAAC;AAED,6CAA6C;AAE7C;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,wBAAwB,CACtC,QAAsB,EACtB,IAAc,EACd,QAA0B,EAC1B,MAAY,EACZ,YAAoB,EACpB,WAAiB,EACjB,aAAmB,EACnB,KAAwB,EACxB,MAKC,EACD,eAAwB,KAAK,EAC7B,gBAAkC;IAGlC,MAAM,QAAQ,GAAG,aAAa,CAAC,aAAa,CAAC,CAAA;IAC7C,MAAM,QAAQ,GAAG,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAA;IAE3D,yCAAyC;IACzC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,QAAQ,CAAC,YAAY,CAAC,MAAM,EAAE,YAAY,CAAC,CAAA;IAClE,IAAI,CAAC,YAAY;QAAE,QAAQ,CAAC,MAAM,EAAE,CAAA;IAEpC,wDAAwD;IACxD,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,CAAC,CAAA;IAInE,IAAI,UAA8B,CAAA;IAElC,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,gBAAgB,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjF,MAAM,QAAQ,GAAG,2BAA2B,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,WAAW,CAAC,CAAA;QACtF,UAAU,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAA;IAC7B,CAAC;SAAM,CAAC;QACN,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YAC5C,MAAM,SAAS,GAAG,wBAAwB,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;YACvF,MAAM,YAAY,GAAG,2BAA2B,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAA;YAChG,MAAM,SAAS,GAAG,wBAAwB,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;YACvF,MAAM,IAAI,GAAG,SAAS,GAAG,SAAS,CAAA;YAClC,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAA;QACpD,CAAC,CAAC,CAAA;QACF,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAA;QAExC,UAAU,GAAG,EAAE,CAAA;QACf,KAAK,MAAM,KAAK,IAAI,gBAAgB,EAAE,CAAC;YACrC,IAAI,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;gBAC5B,UAAU,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAA;YACzD,CAAC;QACH,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,2BAA2B,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,WAAW,CAAC,CAAA;YACtF,UAAU,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IAED,iFAAiF;IACjF,IAAI,aAAa,GAA6D,IAAI,CAAA;IAElF,IAAI,WAAW,GAAG,KAAK,CAAA;IACvB,IAAI,UAAU,GAAG,IAAI,CAAA;IAErB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QACpD,MAAM,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,CAAA;QACrC,IAAI,MAAwB,CAAA;QAC5B,IAAI,KAAK,KAAK,OAAO,EAAE,CAAC;YACtB,MAAM,GAAG,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EACvE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;QACnC,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,mBAAmB,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAC/E,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAA;QAC/B,CAAC;QAED,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,aAAa,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAA;QACtE,CAAC;QAED,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1B,IAAI,UAAU;gBAAE,WAAW,CAAC,MAAM,EAAE,CAAA;YACpC,WAAW,GAAG,MAAM,CAAA;YACpB,UAAU,GAAG,IAAI,CAAA;QACnB,CAAC;aAAM,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAC5B,MAAM,CAAC,MAAM,EAAE,CAAA;QACjB,CAAC;aAAM,CAAC;YACN,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YACxC,IAAI,UAAU;gBAAE,WAAW,CAAC,MAAM,EAAE,CAAA;YACpC,WAAW,GAAG,QAAQ,CAAA;YACtB,MAAM,CAAC,MAAM,EAAE,CAAA;YACf,UAAU,GAAG,IAAI,CAAA;QACnB,CAAC;IACH,CAAC;IAED,0FAA0F;IAC1F,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,aAAa,CAAA;IAClD,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,eAAe,CAAA;IAExD,IAAI,WAAW,GAAG,KAAK,CAAA;IACvB,IAAI,UAAU,GAAG,IAAI,CAAA;IAErB,KAAK,MAAM,EAAE,QAAQ,EAAE,IAAI,UAAU,EAAE,CAAC;QACtC,IAAI,SAA2B,CAAA;QAC/B,IAAI,KAAK,KAAK,OAAO,EAAE,CAAC;YACtB,SAAS,GAAG,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAC1E,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC,CAAA;QAC3B,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,mBAAmB,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAClF,OAAO,EAAE,SAAS,CAAC,CAAA;QACvB,CAAC;QAED,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1B,SAAS,CAAC,MAAM,EAAE,CAAA;QACpB,CAAC;aAAM,IAAI,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YAC/B,SAAS,CAAC,MAAM,EAAE,CAAA;QACpB,CAAC;aAAM,CAAC;YACN,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;YAChD,IAAI,UAAU;gBAAE,WAAW,CAAC,MAAM,EAAE,CAAA;YACpC,WAAW,GAAG,QAAQ,CAAA;YACtB,SAAS,CAAC,MAAM,EAAE,CAAA;YAClB,UAAU,GAAG,IAAI,CAAA;QACnB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,WAAW,EAAE,WAAW,EAAE,aAAa,CAAC,CAAA;AAClD,CAAC","sourcesContent":["/**\n * csg-core — CSG 纯计算函数（从 csg-worker.ts 提取）\n *\n *\n * 这些函数不依赖 Worker 环境（无 self.onmessage / postMessage），\n * 可被 WorkerCsgBackend（经 csg-worker.ts）和 InlineCsgBackend（主线程直跑）共用。\n *\n * 依赖：manifold-3d 核心模块（Manifold / Mesh 构造器）、dovetail-math、joinery-shapes\n */\n\nimport type { Manifold as ManifoldInstance } from 'manifold-3d/manifold'\nimport {\n  vec3Cross, vec3Normalize,\n  type Vec3,\n} from './dovetail-math'\nimport {\n  buildWedgeGeometry,\n  buildDowelGeometry,\n  buildStraightTenonGeometry,\n} from './joinery-shapes'\n\n// ── 类型别名 ──\n\ntype ManifoldCtor = typeof import('manifold-3d/manifold').Manifold\ntype MeshCtor = typeof import('manifold-3d/manifold').Mesh\n\n// ── Manifold → MeshData 转换 ──\n\n/**\n * Extract {positions, indices} from a Manifold mesh.\n * Handles the numProp > 3 case (manifold may carry extra property channels).\n * @param manifold The manifold from which to read mesh data.\n * @returns The extracted positions and indices buffers.\n */\nexport function manifoldToMeshData(manifold: ManifoldInstance): {\n  positions: Float32Array; indices: Uint32Array\n} {\n  const resultMesh = manifold.getMesh()\n  const numProp = resultMesh.numProp || 3\n  const vertPropsLen = resultMesh.vertProperties ? resultMesh.vertProperties.length : 0\n  const vertCount = numProp > 0 ? Math.floor(vertPropsLen / numProp) : 0\n  const positions = new Float32Array(vertCount * 3)\n  for (let i = 0; i < vertCount; i++) {\n    const base = i * numProp\n    positions[i * 3] = resultMesh.vertProperties[base]\n    positions[i * 3 + 1] = resultMesh.vertProperties[base + 1]\n    positions[i * 3 + 2] = resultMesh.vertProperties[base + 2]\n  }\n  const triVerts = resultMesh.triVerts\n  const indices = triVerts ? new Uint32Array(triVerts) : new Uint32Array(0)\n  return { positions, indices }\n}\n\n// ── MeshData → Manifold ──\n\n/**\n * Build a Manifold from mesh data, welding duplicate vertices when the density\n * is too high (close to one independent vertex per triangle) before Manifold.ofMesh.\n * Shared by the Inline and Worker backends so both produce identical input conversion.\n * @param Manifold The Manifold constructor from the manifold module.\n * @param Mesh     The Mesh constructor from the manifold module.\n * @param mesh     The mesh data (positions and indices).\n * @returns The constructed Manifold instance.\n */\nexport function meshToManifold(\n  Manifold: ManifoldCtor,\n  Mesh: MeshCtor,\n  mesh: { positions: Float32Array; indices: Uint32Array },\n): ManifoldInstance {\n  const triCount = mesh.indices.length / 3\n  const vertCount = mesh.positions.length / 3\n  let positions = mesh.positions\n  let indices = mesh.indices\n\n  if (vertCount >= triCount * 3 * 0.9) {\n    const welded = weldPositionsWorker(mesh.positions, mesh.indices, mesh.indices.length)\n    positions = welded.positions\n    indices = welded.indices\n  }\n\n  return Manifold.ofMesh(new Mesh({\n    numProp: 3,\n    vertProperties: positions,\n    triVerts: indices,\n  }))\n}\n\n/**\n * Sequentially apply a boolean operation across an array of Manifolds.\n * The caller is responsible for deleting the input manifolds and the result.\n * @param op         The boolean operation to apply (union/subtract/intersect).\n * @param manifolds  The manifolds to combine in order.\n * @returns The resulting Manifold of the chain.\n */\nexport function chainBoolean(\n  op: 'union' | 'subtract' | 'intersect',\n  manifolds: ManifoldInstance[],\n): ManifoldInstance {\n  let result = manifolds[0]\n  for (let i = 1; i < manifolds.length; i++) {\n    switch (op) {\n      case 'union':\n        result = result.add(manifolds[i])\n        break\n      case 'subtract':\n        result = result.subtract(manifolds[i])\n        break\n      case 'intersect':\n        result = result.intersect(manifolds[i])\n        break\n    }\n  }\n  return result\n}\n\n// ── 顶点焊接 ──\n\n/**\n * Weld duplicate vertices using a quantized 1 µm grid.\n * Uses three nested numeric Maps (no string allocation).\n * @param positions The input vertex positions.\n * @param indices   The input triangle indices.\n * @param count     The number of indices to process.\n * @returns The welded positions and remapped indices buffers.\n */\nexport function weldPositionsWorker(\n  positions: Float32Array,\n  indices: Uint32Array,\n  count: number,\n): { positions: Float32Array; indices: Uint32Array } {\n  const mapX = new Map<number, Map<number, Map<number, number>>>()\n  const weldedPosArr: number[] = []\n  const weldedIdxArr: number[] = []\n\n  for (let i = 0; i < count; i++) {\n    const vi = indices[i]\n    const x = positions[vi * 3]\n    const y = positions[vi * 3 + 1]\n    const z = positions[vi * 3 + 2]\n    const qx = Math.round(x * 1e6)\n    const qy = Math.round(y * 1e6)\n    const qz = Math.round(z * 1e6)\n\n    let mapY = mapX.get(qx)\n    if (mapY === undefined) {\n      mapY = new Map<number, Map<number, number>>()\n      mapX.set(qx, mapY)\n    }\n    let mapZ = mapY.get(qy)\n    if (mapZ === undefined) {\n      mapZ = new Map<number, number>()\n      mapY.set(qy, mapZ)\n    }\n    let ni = mapZ.get(qz)\n    if (ni === undefined) {\n      ni = weldedPosArr.length / 3\n      mapZ.set(qz, ni)\n      weldedPosArr.push(x, y, z)\n    }\n    weldedIdxArr.push(ni)\n  }\n\n  return {\n    positions: new Float32Array(weldedPosArr),\n    indices: new Uint32Array(weldedIdxArr),\n  }\n}\n\n// ── Union-Find ──\n\n/** Simple union-find for clustering cap triangles by shared edges. */\nexport class SimpleUnionFind {\n  private parent: number[]\n  private rank: number[]\n\n  /**\n   * Create a union-find structure with n initial singletons.\n   * @param n The number of elements.\n   */\n  constructor(n: number) {\n    this.parent = Array.from({ length: n }, (_, i) => i)\n    this.rank = new Array(n).fill(0)\n  }\n\n  /**\n   * Find the root representative of the element x (with path compression).\n   * @param x The element to look up.\n   * @returns The root index of the set containing x.\n   */\n  find(x: number): number {\n    if (this.parent[x] !== x) {\n      this.parent[x] = this.find(this.parent[x])\n    }\n    return this.parent[x]\n  }\n\n  /**\n   * Union the sets containing x and y.\n   * @param x The first element.\n   * @param y The second element.\n   */\n  union(x: number, y: number): void {\n    const px = this.find(x)\n    const py = this.find(y)\n    if (px === py) return\n    if (this.rank[px] < this.rank[py]) {\n      this.parent[px] = py\n    } else if (this.rank[px] > this.rank[py]) {\n      this.parent[py] = px\n    } else {\n      this.parent[py] = px\n      this.rank[px]++\n    }\n  }\n}\n\n// ── Wedge (trapezoidal prism) creation ──\n\n/**\n * Create a wedge (trapezoidal prism) Manifold from cutting-plane parameters.\n * @param Manifold       The Manifold constructor from the manifold module.\n * @param Mesh           The Mesh constructor from the manifold module.\n * @param planeCenter    Center of the cutting plane.\n * @param normal         Cutting plane normal (unit vector).\n * @param widthDir       Extrusion direction (unit vector).\n * @param depth          Wedge depth (mm).\n * @param width          Wedge width (mm).\n * @param angleDeg       Slant angle of the wedge sides (degrees).\n * @param extrudeLength  Total extrusion length along widthDir (mm).\n * @returns The constructed wedge Manifold.\n */\nexport function createWedge(\n  Manifold: ManifoldCtor,\n  Mesh: MeshCtor,\n  planeCenter: Vec3,\n  normal: Vec3,\n  widthDir: Vec3,\n  depth: number,\n  width: number,\n  angleDeg: number,\n  extrudeLength: number,\n): ManifoldInstance {\n  const { positions, indices } = buildWedgeGeometry(\n    planeCenter, normal, widthDir, depth, width, angleDeg, extrudeLength,\n  )\n  const mesh = new Mesh({\n    numProp: 3,\n    vertProperties: positions,\n    triVerts: indices,\n  })\n  return Manifold.ofMesh(mesh)\n}\n\n// ── Cap component detection ──\n\n/**\n * Detect connected components of cap faces on the cutting plane.\n * Returns an array of components, each being a Set of vertex indices.\n * @param upper         The upper mesh to scan for cap faces.\n * @param normal        The cutting plane normal.\n * @param originOffset  The cutting plane offset along the normal.\n * @returns An array of components, each a Set of vertex indices on the cap.\n */\nexport function detectCapComponents(\n  upper: ManifoldInstance,\n  normal: Vec3,\n  originOffset: number,\n): Set<number>[] {\n  const mesh = upper.getMesh()\n  const eps = 0.001\n  const numProp = mesh.numProp || 3\n  const vertCount = Math.floor(mesh.vertProperties.length / numProp)\n  const triVerts = mesh.triVerts\n  if (!triVerts || triVerts.length === 0) return []\n\n  const capVertSet = new Set<number>()\n  interface CapTri { v0: number; v1: number; v2: number }\n  const capTris: CapTri[] = []\n  const triCount = triVerts.length / 3\n  for (let t = 0; t < triCount; t++) {\n    const i0 = triVerts[t * 3]\n    const i1 = triVerts[t * 3 + 1]\n    const i2 = triVerts[t * 3 + 2]\n    const d0 = Math.abs(\n      mesh.vertProperties[i0 * numProp] * normal[0] +\n      mesh.vertProperties[i0 * numProp + 1] * normal[1] +\n      mesh.vertProperties[i0 * numProp + 2] * normal[2] - originOffset)\n    const d1 = Math.abs(\n      mesh.vertProperties[i1 * numProp] * normal[0] +\n      mesh.vertProperties[i1 * numProp + 1] * normal[1] +\n      mesh.vertProperties[i1 * numProp + 2] * normal[2] - originOffset)\n    const d2 = Math.abs(\n      mesh.vertProperties[i2 * numProp] * normal[0] +\n      mesh.vertProperties[i2 * numProp + 1] * normal[1] +\n      mesh.vertProperties[i2 * numProp + 2] * normal[2] - originOffset)\n    if (d0 < eps && d1 < eps && d2 < eps) {\n      capTris.push({ v0: i0, v1: i1, v2: i2 })\n      capVertSet.add(i0); capVertSet.add(i1); capVertSet.add(i2)\n    }\n  }\n  if (capTris.length === 0) return []\n\n  const uf = new SimpleUnionFind(vertCount)\n  for (const tri of capTris) {\n    uf.union(tri.v0, tri.v1)\n    uf.union(tri.v1, tri.v2)\n    uf.union(tri.v0, tri.v2)\n  }\n\n  const compMap = new Map<number, Set<number>>()\n  for (const vi of capVertSet) {\n    const root = uf.find(vi)\n    if (!compMap.has(root)) compMap.set(root, new Set<number>())\n    compMap.get(root)!.add(vi)\n  }\n\n  return Array.from(compMap.values())\n}\n\n// ── Cross-section width computation ──\n\n/**\n * Compute the actual extent of the model's cross-section at the cutting plane\n * along the width direction.\n * @param upper         The upper mesh to measure.\n * @param normal        The cutting plane normal.\n * @param originOffset  The cutting plane offset along the normal.\n * @param widthDir      The width direction along which to measure.\n * @param comp          Optional connected component to restrict the measurement to.\n * @returns The cross-section extent along the width direction (0 when none found).\n */\nexport function computeCrossSectionWidth(\n  upper: ManifoldInstance,\n  normal: Vec3,\n  originOffset: number,\n  widthDir: Vec3,\n  comp?: Set<number>,\n): number {\n  const mesh = upper.getMesh()\n  const eps = 0.001\n  let minProj = Infinity\n  let maxProj = -Infinity\n  let found = false\n\n  const numProp = mesh.numProp || 3\n  const vertCount = Math.floor(mesh.vertProperties.length / numProp)\n  for (let i = 0; i < vertCount; i++) {\n    if (comp && !comp.has(i)) continue\n\n    const base = i * numProp\n    const x = mesh.vertProperties[base]\n    const y = mesh.vertProperties[base + 1]\n    const z = mesh.vertProperties[base + 2]\n\n    const dist = x * normal[0] + y * normal[1] + z * normal[2] - originOffset\n    if (Math.abs(dist) < eps) {\n      const proj = x * widthDir[0] + y * widthDir[1] + z * widthDir[2]\n      if (proj < minProj) minProj = proj\n      if (proj > maxProj) maxProj = proj\n      found = true\n    }\n  }\n\n  if (!found) return 0\n  return maxProj - minProj\n}\n\n// ── Cross-section centroid computation ──\n\n/**\n * Compute the centroid of vertices lying on the cutting plane.\n * @param upper         The upper mesh to scan.\n * @param normal        The cutting plane normal.\n * @param originOffset  The cutting plane offset along the normal.\n * @param fallback      The centroid fallback when no vertex lies on the plane.\n * @param comp          Optional connected component to restrict the measurement to.\n * @returns The computed centroid, or the fallback when none is found.\n */\nexport function computeCrossSectionCentroid(\n  upper: ManifoldInstance,\n  normal: Vec3,\n  originOffset: number,\n  fallback: Vec3,\n  comp?: Set<number>,\n): Vec3 {\n  const mesh = upper.getMesh()\n  const eps = 0.001\n  let cx = 0, cy = 0, cz = 0\n  let count = 0\n\n  const numProp = mesh.numProp || 3\n  const vertCount = Math.floor(mesh.vertProperties.length / numProp)\n  for (let i = 0; i < vertCount; i++) {\n    if (comp && !comp.has(i)) continue\n\n    const base = i * numProp\n    const x = mesh.vertProperties[base]\n    const y = mesh.vertProperties[base + 1]\n    const z = mesh.vertProperties[base + 2]\n\n    const dist = x * normal[0] + y * normal[1] + z * normal[2] - originOffset\n    if (Math.abs(dist) < eps) {\n      cx += x\n      cy += y\n      cz += z\n      count++\n    }\n  }\n\n  if (count === 0) return fallback\n  return [cx / count, cy / count, cz / count]\n}\n\n// ── Dovetail boolean split ──\n\n/**\n * Perform the dovetail split using boolean operations.\n * @param Manifold - the Manifold constructor from the manifold module.\n * @param Mesh - the Mesh constructor from the manifold module.\n * @param original - the original manifold to split.\n * @param normal - the cutting plane normal (unit vector).\n * @param originOffset - the plane equation origin offset along the normal.\n * @param planeCenter - a point on the cutting plane used to center the wedge.\n * @param widthDirInput - the width direction in the cutting plane (will be normalized).\n * @param bboxWidthOnWidthDir - the model's bounding-box width along widthDir, used as a fallback cross-section width.\n * @param groove - the dovetail groove design parameters (depth, tolerances, width, flaps angle).\n * @param keepOriginal - when true, the original manifold is not deleted after splitting (default false).\n * @returns a tuple of the split upper manifold, lower manifold, and the trimmed wedge mesh data (or null when empty).\n */\nexport function dovetailBooleanSplit(\n  Manifold: ManifoldCtor,\n  Mesh: MeshCtor,\n  original: ManifoldInstance,\n  normal: Vec3,\n  originOffset: number,\n  planeCenter: Vec3,\n  widthDirInput: Vec3,\n  bboxWidthOnWidthDir: number,\n  groove: {\n    depth: number\n    depthTolerance: number\n    width: number\n    widthTolerance: number\n    flapsAngle: number\n  },\n  keepOriginal: boolean = false,\n): [ManifoldInstance, ManifoldInstance,\n  { positions: Float32Array; indices: Uint32Array } | null] {\n  const widthDir = vec3Normalize(widthDirInput)\n\n  // Step 1: Split by plane → upper + lower\n  const [upper, lower] = original.splitByPlane(normal, originOffset)\n  if (!keepOriginal) original.delete()\n\n  // Step 2: Compute actual cross-section width at the cutting plane\n  let crossSectionWidth = computeCrossSectionWidth(upper, normal, originOffset, widthDir)\n  if (crossSectionWidth <= 0) {\n    crossSectionWidth = bboxWidthOnWidthDir\n  }\n  const extrudeLength = crossSectionWidth + 0.2\n\n  // Step 3: Create wedge W with generous overhang along widthDir\n  const overhang = 20\n\n  const wedgeW = createWedge(\n    Manifold, Mesh,\n    planeCenter, normal, widthDir,\n    groove.depth, groove.width, groove.flapsAngle,\n    extrudeLength + overhang,\n  )\n\n  // Trim the wedge to the model by intersecting with lower.\n  let wedgeForUnion: ManifoldInstance\n  let wedgeMeshData: { positions: Float32Array; indices: Uint32Array } | null\n  let lowerForSubtract: ManifoldInstance\n\n  if (!wedgeW.isEmpty() && !lower.isEmpty()) {\n    const lowerMeshData = manifoldToMeshData(lower)\n\n    const trimmedWedge = wedgeW.intersect(lower)\n    wedgeW.delete()\n    lower.delete()\n\n    wedgeMeshData = trimmedWedge.isEmpty() ? null : manifoldToMeshData(trimmedWedge)\n    wedgeForUnion = trimmedWedge\n\n    lowerForSubtract = Manifold.ofMesh(new Mesh({\n      numProp: 3,\n      vertProperties: lowerMeshData.positions,\n      triVerts: lowerMeshData.indices,\n    }))\n  } else {\n    wedgeMeshData = null\n    wedgeForUnion = wedgeW\n    lowerForSubtract = lower\n  }\n\n  // Step 5: union(upper, wedgeForUnion) → upper'\n  let upperResult: ManifoldInstance\n  if (upper.isEmpty()) {\n    upper.delete()\n    upperResult = wedgeForUnion\n  } else if (wedgeForUnion.isEmpty()) {\n    wedgeForUnion.delete()\n    upperResult = upper\n  } else {\n    upperResult = upper.add(wedgeForUnion)\n    upper.delete()\n    wedgeForUnion.delete()\n  }\n\n  // Step 6: Create tolerance wedge W_tol\n  const wedgeTol = createWedge(\n    Manifold, Mesh,\n    planeCenter, normal, widthDir,\n    groove.depth + groove.depthTolerance,\n    groove.width + groove.widthTolerance,\n    groove.flapsAngle,\n    extrudeLength + overhang,\n  )\n\n  // Step 7: lower.subtract(wedgeTol) → lower'\n  let lowerResult: ManifoldInstance\n  if (lowerForSubtract.isEmpty()) {\n    wedgeTol.delete()\n    lowerResult = lowerForSubtract\n  } else if (wedgeTol.isEmpty()) {\n    wedgeTol.delete()\n    lowerResult = lowerForSubtract\n  } else {\n    lowerResult = lowerForSubtract.subtract(wedgeTol)\n    lowerForSubtract.delete()\n    wedgeTol.delete()\n  }\n\n  return [upperResult, lowerResult, wedgeMeshData]\n}\n\n// ── Dowel (cylinder) creation ──\n\n/**\n * Create a cylindrical Manifold for the dowel tenon.\n * @param Manifold - the Manifold constructor from the manifold module.\n * @param Mesh - the Mesh constructor from the manifold module.\n * @param centroid - the center of the cylinder in the cutting plane.\n * @param normal - the cutting plane normal (unit vector, points \"up\").\n * @param widthDir - the width direction in the cutting plane (unit vector).\n * @param depthDir - the depth direction in the cutting plane (unit vector).\n * @param diameter - the cylinder diameter (mm).\n * @param height - the cylinder height (mm), extends along -normal.\n * @param segments - the number of circular segments (default 32).\n * @returns the resulting cylindrical Manifold instance.\n */\nexport function createDowel(\n  Manifold: ManifoldCtor,\n  Mesh: MeshCtor,\n  centroid: Vec3,\n  normal: Vec3,\n  widthDir: Vec3,\n  depthDir: Vec3,\n  diameter: number,\n  height: number,\n  segments: number = 32,\n): ManifoldInstance {\n  const { positions, indices } = buildDowelGeometry(\n    centroid, normal, widthDir, depthDir, diameter, height, segments,\n  )\n  const mesh = new Mesh({\n    numProp: 3,\n    vertProperties: positions,\n    triVerts: indices,\n  })\n  return Manifold.ofMesh(mesh)\n}\n\n// ── Straight tenon (box) creation ──\n\n/**\n * Create a box-shaped Manifold for the straight tenon.\n * @param Manifold - the Manifold constructor from the manifold module.\n * @param Mesh - the Mesh constructor from the manifold module.\n * @param centroid - the center of the box in the cutting plane.\n * @param normal - the cutting plane normal (unit vector, points \"up\").\n * @param widthDir - the width direction in the cutting plane (unit vector).\n * @param depthDir - the depth direction in the cutting plane (unit vector).\n * @param sideLength - the square cross-section side length (mm).\n * @param height - the box height (mm), extends along -normal.\n * @returns the resulting box-shaped Manifold instance.\n */\nexport function createStraightTenon(\n  Manifold: ManifoldCtor,\n  Mesh: MeshCtor,\n  centroid: Vec3,\n  normal: Vec3,\n  widthDir: Vec3,\n  depthDir: Vec3,\n  sideLength: number,\n  height: number,\n): ManifoldInstance {\n  const { positions, indices } = buildStraightTenonGeometry(\n    centroid, normal, widthDir, depthDir, sideLength, height,\n  )\n  const mesh = new Mesh({\n    numProp: 3,\n    vertProperties: positions,\n    triVerts: indices,\n  })\n  return Manifold.ofMesh(mesh)\n}\n\n// ── Dowel / Straight-tenon boolean split ──\n\n/**\n * Perform the dowel (or straight-tenon) split using boolean operations.\n * @param Manifold - the Manifold constructor from the manifold module.\n * @param Mesh - the Mesh constructor from the manifold module.\n * @param original - the original manifold to split.\n * @param normal - the cutting plane normal (unit vector).\n * @param originOffset - the plane equation origin offset along the normal.\n * @param planeCenter - a point on the cutting plane used to center the joinery.\n * @param widthDirInput - the width direction in the cutting plane (will be normalized).\n * @param shape - the joinery shape: 'dowel' or 'tenon'.\n * @param params - the joinery sizing parameters (size, tolerances, height).\n * @param keepOriginal - when true, the original manifold is not deleted after splitting (default false).\n * @param selectedSections - optional list of indices selecting which cap sections receive joinery placement; null or empty means a single placement at the overall cross-section centroid.\n * @returns a tuple of the split upper manifold, lower manifold, and the generated joinery mesh data (or null).\n */\nexport function dowelOrTenonBooleanSplit(\n  Manifold: ManifoldCtor,\n  Mesh: MeshCtor,\n  original: ManifoldInstance,\n  normal: Vec3,\n  originOffset: number,\n  planeCenter: Vec3,\n  widthDirInput: Vec3,\n  shape: 'dowel' | 'tenon',\n  params: {\n    size: number\n    sizeTolerance: number\n    height: number\n    heightTolerance: number\n  },\n  keepOriginal: boolean = false,\n  selectedSections?: number[] | null,\n): [ManifoldInstance, ManifoldInstance,\n    { positions: Float32Array; indices: Uint32Array } | null] {\n  const widthDir = vec3Normalize(widthDirInput)\n  const depthDir = vec3Normalize(vec3Cross(normal, widthDir))\n\n  // Step 1: Split by plane → upper + lower\n  const [upper, lower] = original.splitByPlane(normal, originOffset)\n  if (!keepOriginal) original.delete()\n\n  // Step 2: Detect cap components (multi-section support)\n  const components = detectCapComponents(upper, normal, originOffset)\n\n  // Build the list of joinery placements: one per selected section\n  interface JoineryPlacement { centroid: Vec3 }\n  let placements: JoineryPlacement[]\n\n  if (components.length <= 1 || !selectedSections || selectedSections.length === 0) {\n    const centroid = computeCrossSectionCentroid(upper, normal, originOffset, planeCenter)\n    placements = [{ centroid }]\n  } else {\n    const compInfo = components.map((comp, idx) => {\n      const compWidth = computeCrossSectionWidth(upper, normal, originOffset, widthDir, comp)\n      const compCentroid = computeCrossSectionCentroid(upper, normal, originOffset, planeCenter, comp)\n      const compDepth = computeCrossSectionWidth(upper, normal, originOffset, depthDir, comp)\n      const area = compWidth * compDepth\n      return { idx, comp, area, centroid: compCentroid }\n    })\n    compInfo.sort((a, b) => b.area - a.area)\n\n    placements = []\n    for (const selId of selectedSections) {\n      if (selId < compInfo.length) {\n        placements.push({ centroid: compInfo[selId].centroid })\n      }\n    }\n    if (placements.length === 0) {\n      const centroid = computeCrossSectionCentroid(upper, normal, originOffset, planeCenter)\n      placements = [{ centroid }]\n    }\n  }\n\n  // Step 3: For each placement, create shape C (no tolerance) and union into upper\n  let shapeMeshData: { positions: Float32Array; indices: Uint32Array } | null = null\n\n  let upperResult = upper\n  let upperOwned = true\n\n  for (let pIdx = 0; pIdx < placements.length; pIdx++) {\n    const { centroid } = placements[pIdx]\n    let shapeC: ManifoldInstance\n    if (shape === 'dowel') {\n      shapeC = createDowel(Manifold, Mesh, centroid, normal, widthDir, depthDir,\n        params.size, params.height, 32)\n    } else {\n      shapeC = createStraightTenon(Manifold, Mesh, centroid, normal, widthDir, depthDir,\n        params.size, params.height)\n    }\n\n    if (pIdx === 0) {\n      shapeMeshData = shapeC.isEmpty() ? null : manifoldToMeshData(shapeC)\n    }\n\n    if (upperResult.isEmpty()) {\n      if (upperOwned) upperResult.delete()\n      upperResult = shapeC\n      upperOwned = true\n    } else if (shapeC.isEmpty()) {\n      shapeC.delete()\n    } else {\n      const newUpper = upperResult.add(shapeC)\n      if (upperOwned) upperResult.delete()\n      upperResult = newUpper\n      shapeC.delete()\n      upperOwned = true\n    }\n  }\n\n  // Step 4: For each placement, create shape C_tol (with tolerance) and subtract from lower\n  const tolSize = params.size + params.sizeTolerance\n  const tolHeight = params.height + params.heightTolerance\n\n  let lowerResult = lower\n  let lowerOwned = true\n\n  for (const { centroid } of placements) {\n    let shapeCTol: ManifoldInstance\n    if (shape === 'dowel') {\n      shapeCTol = createDowel(Manifold, Mesh, centroid, normal, widthDir, depthDir,\n        tolSize, tolHeight, 32)\n    } else {\n      shapeCTol = createStraightTenon(Manifold, Mesh, centroid, normal, widthDir, depthDir,\n        tolSize, tolHeight)\n    }\n\n    if (lowerResult.isEmpty()) {\n      shapeCTol.delete()\n    } else if (shapeCTol.isEmpty()) {\n      shapeCTol.delete()\n    } else {\n      const newLower = lowerResult.subtract(shapeCTol)\n      if (lowerOwned) lowerResult.delete()\n      lowerResult = newLower\n      shapeCTol.delete()\n      lowerOwned = true\n    }\n  }\n\n  return [upperResult, lowerResult, shapeMeshData]\n}\n"]}