@faicad/faijs 0.13.0

package/dist/mesh/knurl/subdivision.js

@@ -0,0 +1,517 @@
+/**
+ * subdivision.ts — 自适应边细分，从 stlTexturizer/js/subdivision.js 移植为 TS。
+ *
+ * 细分直到每条边 ≤ maxEdgeLength。
+ *
+ * 关键特性：
+ *   - toIndexed (export path): 锐边分裂 — 同位置但法线夹角 > 30° 的顶点分开存储
+ *   - 确保水密性
+ *
+ * 管线：
+ *   toIndexed(geometry) → 索引化 + 顶点去重 + 锐边分裂
+ *   循环细分：标记长边 → 按标记数量分裂三角形
+ *   toNonIndexed(verts, indices) → 输出 non-indexed BufferGeometry
+ *
+ * Bug 修复记录 (2026-07-22):
+ *   问题： 检测到 knurl 后的 mesh 出现 NaN 值和错误 bounds
+ *         (bounds 从 [-0.5, 0.5] 变成 [-17, 17]，且 hasNaN: true)
+ *
+ *   根因分析：
+ *     1. box_boss.3mf 是 indexed geometry (530 vertices, 1548 indices)
+ *     2. toIndexed() 函数假设输入是 non-indexed (flat triangles)
+ *     3. 当传入 indexed geometry 时，toIndexed() 错误处理顶点数据：
+ *        - n = posAttr.count = 530 (顶点数)
+ *        - 但代码按 triangle count = n/3 = 176 处理
+ *        - 导致顶点索引越界，读取错误位置的数据
+ *     4. 细分后顶点位置完全错误，进而导致 displacement 计算产生 NaN
+ *
+ *   修复方案：
+ *     在 subdivide() 入口添加 indexed → non-indexed 转换：
+ *       if (geometry.index) { workingGeo = geometry.toNonIndexed() }
+ *
+ *   验证：
+ *     - E2E 测试通过：hasNaN: false, bounds 正确
+ *     - 原始 bounds [0,0,0]~[150,120,90] → knurl 后 [-0.5,-0.5,0]~[150.5,120.5,90.5]
+ */
+import * as THREE from 'three';
+import { QuantizedPointMap } from './meshIndex.js';
+// 10μm 顶点去重网格
+const QUANTISE = 1e5;
+// 安全上限
+const SAFETY_CAP = typeof navigator !== 'undefined' &&
+    navigator.deviceMemory !== undefined &&
+    navigator.deviceMemory >= 8
+    ? 32_000_000
+    : 16_000_000;
+// 锐边角度阈值（度）— 法线夹角超过此值的顶点在索引化时分裂
+const SHARP_ANGLE_DEG = 30;
+const SHARP_COS = Math.cos(SHARP_ANGLE_DEG * Math.PI / 180);
+function makeVertStore(initialCap, hasWeights, hasCanon) {
+    return {
+        cap: initialCap,
+        count: 0,
+        pos: new Float64Array(initialCap * 3),
+        nrm: new Float64Array(initialCap * 3),
+        wgt: hasWeights ? new Float64Array(initialCap) : null,
+        canon: hasCanon ? new Int32Array(initialCap) : null,
+        grow() {
+            this.cap *= 2;
+            const np = new Float64Array(this.cap * 3);
+            np.set(this.pos);
+            this.pos = np;
+            const nn = new Float64Array(this.cap * 3);
+            nn.set(this.nrm);
+            this.nrm = nn;
+            if (this.wgt) {
+                const nw = new Float64Array(this.cap);
+                nw.set(this.wgt);
+                this.wgt = nw;
+            }
+            if (this.canon) {
+                const nc = new Int32Array(this.cap);
+                nc.set(this.canon);
+                this.canon = nc;
+            }
+        },
+    };
+}
+// ── 公共入口 ──
+/**
+ * Adaptively subdivide a geometry until every edge is ≤ maxEdgeLength.
+ * Indexed inputs are expanded to non-indexed form first; sharp edges are
+ * split at vertices whose face-normal angle exceeds the threshold so each
+ * surface keeps its own normal direction and the result stays watertight.
+ * Faces marked by `faceWeights` are excluded from refinement.
+ *
+ * @param geometry - the source geometry (position attribute; may be indexed).
+ * @param maxEdgeLength - maximum allowed edge length in millimeters.
+ * @param onProgress - optional callback receiving progress, triangle count, and longest edge.
+ * @param faceWeights - optional per-face exclusion weights (non-indexed triangle soup layout).
+ * @returns the subdivided non-indexed geometry and whether the safety cap was reached.
+ */
+export async function subdivide(geometry, maxEdgeLength, onProgress, faceWeights = null) {
+    // 确保 geometry 是 non-indexed（toIndexed 假设输入是 flat 的）
+    let workingGeo = geometry;
+    if (geometry.index) {
+        workingGeo = geometry.toNonIndexed();
+    }
+    // 在 toIndexed 之前推导每面排除标记
+    let initialFaceExcluded = null;
+    if (faceWeights) {
+        const triCount = faceWeights.length / 3;
+        initialFaceExcluded = new Uint8Array(triCount);
+        for (let i = 0; i < triCount; i++) {
+            if (faceWeights[i * 3] > 0.99)
+                initialFaceExcluded[i] = 1;
+        }
+    }
+    // 使用准确模式（带锐边分裂的 toIndexed）
+    const { verts, indices, posCanonMap } = toIndexed(workingGeo, faceWeights);
+    const maxIterations = 12;
+    let currentIndices = indices;
+    let currentFaceExcluded = initialFaceExcluded;
+    let safetyCapHit = false;
+    for (let iter = 0; iter < maxIterations; iter++) {
+        const triCount = currentIndices.length / 3;
+        if (triCount >= SAFETY_CAP) {
+            safetyCapHit = true;
+            break;
+        }
+        const { newIndices, newFaceExcluded, changed, capped } = subdividePass(verts, currentIndices, maxEdgeLength, SAFETY_CAP, currentFaceExcluded, posCanonMap);
+        currentIndices = newIndices;
+        if (newFaceExcluded)
+            currentFaceExcluded = newFaceExcluded;
+        if (capped || newIndices.length / 3 >= SAFETY_CAP)
+            safetyCapHit = true;
+        const positions = verts.pos;
+        let maxEdgeLenSq = 0;
+        for (let t = 0; t < currentIndices.length; t += 3) {
+            const a = currentIndices[t], b = currentIndices[t + 1], c = currentIndices[t + 2];
+            const ab = edgeLenSq(positions, a, b);
+            const bc = edgeLenSq(positions, b, c);
+            const ca = edgeLenSq(positions, c, a);
+            if (ab > maxEdgeLenSq)
+                maxEdgeLenSq = ab;
+            if (bc > maxEdgeLenSq)
+                maxEdgeLenSq = bc;
+            if (ca > maxEdgeLenSq)
+                maxEdgeLenSq = ca;
+        }
+        const longestEdge = Math.sqrt(maxEdgeLenSq);
+        const newTriCount = newIndices.length / 3;
+        if (onProgress)
+            onProgress(Math.min(0.95, (iter + 1) / maxIterations), newTriCount, longestEdge);
+        await new Promise((r) => setTimeout(r, 0));
+        if (!changed || safetyCapHit)
+            break;
+    }
+    return {
+        geometry: toNonIndexed(verts, currentIndices, currentFaceExcluded),
+        safetyCapHit,
+    };
+}
+// ── 一次细分 pass ──
+function subdividePass(verts, indices, maxEdgeLength, safetyCap, faceExcluded = null, posCanonMap = null) {
+    const maxSq = maxEdgeLength * maxEdgeLength;
+    const midCache = new QuantizedPointMap(1, 1 << 16);
+    const positions = verts.pos;
+    const canonIdx = verts.canon;
+    const splitEdges = new QuantizedPointMap(1, 1 << 16);
+    const markEdge = (a, b) => {
+        const u = canonIdx ? canonIdx[a] : a, v = canonIdx ? canonIdx[b] : b;
+        if (u < v)
+            splitEdges.getOrSet(u, v, 0, 1);
+        else
+            splitEdges.getOrSet(v, u, 0, 1);
+    };
+    const isMarked = (a, b) => {
+        const u = canonIdx ? canonIdx[a] : a, v = canonIdx ? canonIdx[b] : b;
+        return (u < v ? splitEdges.get(u, v, 0) : splitEdges.get(v, u, 0)) !== -1;
+    };
+    // Step 1: 标记需要分裂的边
+    for (let t = 0; t < indices.length; t += 3) {
+        if (faceExcluded && faceExcluded[t / 3])
+            continue;
+        const a = indices[t], b = indices[t + 1], c = indices[t + 2];
+        if (edgeLenSq(positions, a, b) > maxSq)
+            markEdge(a, b);
+        if (edgeLenSq(positions, b, c) > maxSq)
+            markEdge(b, c);
+        if (edgeLenSq(positions, c, a) > maxSq)
+            markEdge(c, a);
+    }
+    if (splitEdges.size === 0)
+        return { newIndices: indices, newFaceExcluded: faceExcluded, changed: false };
+    // Step 1.5: 预测分裂后三角形数量
+    let predictedTris = 0;
+    for (let t = 0; t < indices.length; t += 3) {
+        const a = indices[t], b = indices[t + 1], c = indices[t + 2];
+        const sAB = isMarked(a, b);
+        const sBC = isMarked(b, c);
+        const sCA = isMarked(c, a);
+        const n = (sAB ? 1 : 0) + (sBC ? 1 : 0) + (sCA ? 1 : 0);
+        predictedTris += n === 0 ? 1 : n + 1;
+    }
+    if (predictedTris > safetyCap) {
+        return { newIndices: indices, newFaceExcluded: faceExcluded, changed: false, capped: true };
+    }
+    // Step 2: 重建索引列表
+    const nextIndices = new Uint32Array(predictedTris * 3);
+    const nextFaceExcluded = faceExcluded ? new Uint8Array(predictedTris) : null;
+    let wi = 0;
+    let fi = 0;
+    for (let t = 0; t < indices.length; t += 3) {
+        const a = indices[t], b = indices[t + 1], c = indices[t + 2];
+        const fIdx = t / 3;
+        const excl = faceExcluded ? faceExcluded[fIdx] : 0;
+        const sAB = isMarked(a, b);
+        const sBC = isMarked(b, c);
+        const sCA = isMarked(c, a);
+        const n = (sAB ? 1 : 0) + (sBC ? 1 : 0) + (sCA ? 1 : 0);
+        if (n === 0) {
+            nextIndices[wi++] = a;
+            nextIndices[wi++] = b;
+            nextIndices[wi++] = c;
+            if (nextFaceExcluded)
+                nextFaceExcluded[fi] = excl;
+            fi++;
+        }
+        else if (n === 3) {
+            const mAB = getMidpoint(verts, midCache, a, b, posCanonMap);
+            const mBC = getMidpoint(verts, midCache, b, c, posCanonMap);
+            const mCA = getMidpoint(verts, midCache, c, a, posCanonMap);
+            nextIndices[wi++] = a;
+            nextIndices[wi++] = mAB;
+            nextIndices[wi++] = mCA;
+            nextIndices[wi++] = mAB;
+            nextIndices[wi++] = b;
+            nextIndices[wi++] = mBC;
+            nextIndices[wi++] = mCA;
+            nextIndices[wi++] = mBC;
+            nextIndices[wi++] = c;
+            nextIndices[wi++] = mAB;
+            nextIndices[wi++] = mBC;
+            nextIndices[wi++] = mCA;
+            for (let k = 0; k < 4; k++) {
+                if (nextFaceExcluded)
+                    nextFaceExcluded[fi] = excl;
+                fi++;
+            }
+        }
+        else if (n === 1) {
+            if (sAB) {
+                const m = getMidpoint(verts, midCache, a, b, posCanonMap);
+                nextIndices[wi++] = a;
+                nextIndices[wi++] = m;
+                nextIndices[wi++] = c;
+                nextIndices[wi++] = m;
+                nextIndices[wi++] = b;
+                nextIndices[wi++] = c;
+            }
+            else if (sBC) {
+                const m = getMidpoint(verts, midCache, b, c, posCanonMap);
+                nextIndices[wi++] = a;
+                nextIndices[wi++] = b;
+                nextIndices[wi++] = m;
+                nextIndices[wi++] = a;
+                nextIndices[wi++] = m;
+                nextIndices[wi++] = c;
+            }
+            else {
+                const m = getMidpoint(verts, midCache, c, a, posCanonMap);
+                nextIndices[wi++] = a;
+                nextIndices[wi++] = b;
+                nextIndices[wi++] = m;
+                nextIndices[wi++] = m;
+                nextIndices[wi++] = b;
+                nextIndices[wi++] = c;
+            }
+            for (let k = 0; k < 2; k++) {
+                if (nextFaceExcluded)
+                    nextFaceExcluded[fi] = excl;
+                fi++;
+            }
+        }
+        else {
+            // n === 2: 3 sub-triangles, fan from the untouched-edge vertex
+            if (!sAB) {
+                // sBC + sCA: fan from C
+                const mBC = getMidpoint(verts, midCache, b, c, posCanonMap);
+                const mCA = getMidpoint(verts, midCache, c, a, posCanonMap);
+                nextIndices[wi++] = a;
+                nextIndices[wi++] = b;
+                nextIndices[wi++] = mBC;
+                nextIndices[wi++] = a;
+                nextIndices[wi++] = mBC;
+                nextIndices[wi++] = mCA;
+                nextIndices[wi++] = c;
+                nextIndices[wi++] = mCA;
+                nextIndices[wi++] = mBC;
+            }
+            else if (!sBC) {
+                // sAB + sCA: fan from A
+                const mAB = getMidpoint(verts, midCache, a, b, posCanonMap);
+                const mCA = getMidpoint(verts, midCache, c, a, posCanonMap);
+                nextIndices[wi++] = a;
+                nextIndices[wi++] = mAB;
+                nextIndices[wi++] = mCA;
+                nextIndices[wi++] = mAB;
+                nextIndices[wi++] = b;
+                nextIndices[wi++] = c;
+                nextIndices[wi++] = mAB;
+                nextIndices[wi++] = c;
+                nextIndices[wi++] = mCA;
+            }
+            else {
+                // sAB + sBC: fan from B
+                const mAB = getMidpoint(verts, midCache, a, b, posCanonMap);
+                const mBC = getMidpoint(verts, midCache, b, c, posCanonMap);
+                nextIndices[wi++] = b;
+                nextIndices[wi++] = mBC;
+                nextIndices[wi++] = mAB;
+                nextIndices[wi++] = a;
+                nextIndices[wi++] = mAB;
+                nextIndices[wi++] = mBC;
+                nextIndices[wi++] = a;
+                nextIndices[wi++] = mBC;
+                nextIndices[wi++] = c;
+            }
+            for (let k = 0; k < 3; k++) {
+                if (nextFaceExcluded)
+                    nextFaceExcluded[fi] = excl;
+                fi++;
+            }
+        }
+    }
+    return { newIndices: nextIndices, newFaceExcluded: nextFaceExcluded, changed: true };
+}
+// ── 辅助函数 ──
+function edgeLenSq(pos, a, b) {
+    const dx = pos[a * 3] - pos[b * 3];
+    const dy = pos[a * 3 + 1] - pos[b * 3 + 1];
+    const dz = pos[a * 3 + 2] - pos[b * 3 + 2];
+    return dx * dx + dy * dy + dz * dz;
+}
+function getMidpoint(verts, cache, a, b, posCanonMap) {
+    const lo = a < b ? a : b, hi = a < b ? b : a;
+    const cached = cache.get(lo, hi, 0);
+    if (cached !== -1)
+        return cached;
+    const pos = verts.pos, nrm = verts.nrm;
+    const mx = (pos[a * 3] + pos[b * 3]) / 2;
+    const my = (pos[a * 3 + 1] + pos[b * 3 + 1]) / 2;
+    const mz = (pos[a * 3 + 2] + pos[b * 3 + 2]) / 2;
+    const nx = nrm[a * 3] + nrm[b * 3];
+    const ny = nrm[a * 3 + 1] + nrm[b * 3 + 1];
+    const nz = nrm[a * 3 + 2] + nrm[b * 3 + 2];
+    const nl = Math.sqrt(nx * nx + ny * ny + nz * nz) || 1;
+    const idx = verts.count;
+    if (idx === verts.cap)
+        verts.grow();
+    verts.pos[idx * 3] = mx;
+    verts.pos[idx * 3 + 1] = my;
+    verts.pos[idx * 3 + 2] = mz;
+    verts.nrm[idx * 3] = nx / nl;
+    verts.nrm[idx * 3 + 1] = ny / nl;
+    verts.nrm[idx * 3 + 2] = nz / nl;
+    if (verts.wgt)
+        verts.wgt[idx] = (verts.wgt[a] + verts.wgt[b]) / 2;
+    // 维护规范位置 ID
+    if (verts.canon && posCanonMap) {
+        verts.canon[idx] = posCanonMap.getOrSet(mx, my, mz, idx);
+    }
+    verts.count = idx + 1;
+    cache.getOrSet(lo, hi, 0, idx);
+    return idx;
+}
+function toIndexed(geometry, nonIndexedWeights = null) {
+    const posAttr = geometry.attributes.position;
+    const n = posAttr.count;
+    // 预计算每个面的法线（单位 + 原始叉积）
+    const faceNrmUnit = new Float32Array(n * 3);
+    const faceNrmRaw = new Float32Array(n * 3);
+    for (let t = 0; t < n; t += 3) {
+        const ax = posAttr.getX(t), ay = posAttr.getY(t), az = posAttr.getZ(t);
+        const bx = posAttr.getX(t + 1), by = posAttr.getY(t + 1), bz = posAttr.getZ(t + 1);
+        const cx = posAttr.getX(t + 2), cy = posAttr.getY(t + 2), cz = posAttr.getZ(t + 2);
+        const e1x = bx - ax, e1y = by - ay, e1z = bz - az;
+        const e2x = cx - ax, e2y = cy - ay, e2z = cz - az;
+        const rx = e1y * e2z - e1z * e2y;
+        const ry = e1z * e2x - e1x * e2z;
+        const rz = e1x * e2y - e1y * e2x;
+        const len = Math.sqrt(rx * rx + ry * ry + rz * rz) || 1;
+        const ux = rx / len, uy = ry / len, uz = rz / len;
+        for (let v = 0; v < 3; v++) {
+            faceNrmUnit[(t + v) * 3] = ux;
+            faceNrmUnit[(t + v) * 3 + 1] = uy;
+            faceNrmUnit[(t + v) * 3 + 2] = uz;
+            faceNrmRaw[(t + v) * 3] = rx;
+            faceNrmRaw[(t + v) * 3 + 1] = ry;
+            faceNrmRaw[(t + v) * 3 + 2] = rz;
+        }
+    }
+    const indices = new Uint32Array(n);
+    const verts = makeVertStore(Math.max(16, Math.min(1 << 16, n)), !!nonIndexedWeights, true);
+    // position → first vertex idx at that position (canonical ID)
+    const posCanonMap = new QuantizedPointMap(QUANTISE, Math.min(n, 1 << 22));
+    // canonical ID → cluster list at that position
+    const clustersByCanon = new Map();
+    for (let i = 0; i < n; i++) {
+        const px = posAttr.getX(i);
+        const py = posAttr.getY(i);
+        const pz = posAttr.getZ(i);
+        const fnUx = faceNrmUnit[i * 3], fnUy = faceNrmUnit[i * 3 + 1], fnUz = faceNrmUnit[i * 3 + 2];
+        const fnRx = faceNrmRaw[i * 3], fnRy = faceNrmRaw[i * 3 + 1], fnRz = faceNrmRaw[i * 3 + 2];
+        // 第一个到达此位置的顶点成为 canonical ID
+        const canonId = posCanonMap.getOrSet(px, py, pz, verts.count);
+        const clusters = posCanonMap.inserted ? undefined : clustersByCanon.get(canonId);
+        if (clusters) {
+            let matched = false;
+            for (const cl of clusters) {
+                const dot = cl.fnU[0] * fnUx + cl.fnU[1] * fnUy + cl.fnU[2] * fnUz;
+                if (dot >= SHARP_COS) {
+                    // 同一 smooth group — 累加面积加权法线
+                    const idx = cl.idx;
+                    verts.nrm[idx * 3] += fnRx;
+                    verts.nrm[idx * 3 + 1] += fnRy;
+                    verts.nrm[idx * 3 + 2] += fnRz;
+                    if (verts.wgt && nonIndexedWeights && nonIndexedWeights[i] > verts.wgt[idx]) {
+                        verts.wgt[idx] = nonIndexedWeights[i];
+                    }
+                    // 更新 cluster 代表法线为运行平均值
+                    cl.fnU[0] += fnUx;
+                    cl.fnU[1] += fnUy;
+                    cl.fnU[2] += fnUz;
+                    const rl = Math.sqrt(cl.fnU[0] * cl.fnU[0] + cl.fnU[1] * cl.fnU[1] + cl.fnU[2] * cl.fnU[2]) || 1;
+                    cl.fnU[0] /= rl;
+                    cl.fnU[1] /= rl;
+                    cl.fnU[2] /= rl;
+                    indices[i] = idx;
+                    matched = true;
+                    break;
+                }
+            }
+            if (!matched) {
+                // 此位置的新 cluster（锐边分裂）
+                const idx = verts.count;
+                if (idx === verts.cap)
+                    verts.grow();
+                verts.pos[idx * 3] = px;
+                verts.pos[idx * 3 + 1] = py;
+                verts.pos[idx * 3 + 2] = pz;
+                verts.nrm[idx * 3] = fnRx;
+                verts.nrm[idx * 3 + 1] = fnRy;
+                verts.nrm[idx * 3 + 2] = fnRz;
+                if (verts.wgt && nonIndexedWeights)
+                    verts.wgt[idx] = nonIndexedWeights[i];
+                if (verts.canon)
+                    verts.canon[idx] = canonId;
+                verts.count++;
+                clusters.push({ idx, fnU: [fnUx, fnUy, fnUz] });
+                indices[i] = idx;
+            }
+        }
+        else {
+            // 此位置的第一个顶点
+            const idx = verts.count; // === canonId
+            if (idx === verts.cap)
+                verts.grow();
+            verts.pos[idx * 3] = px;
+            verts.pos[idx * 3 + 1] = py;
+            verts.pos[idx * 3 + 2] = pz;
+            verts.nrm[idx * 3] = fnRx;
+            verts.nrm[idx * 3 + 1] = fnRy;
+            verts.nrm[idx * 3 + 2] = fnRz;
+            if (verts.wgt && nonIndexedWeights)
+                verts.wgt[idx] = nonIndexedWeights[i];
+            if (verts.canon)
+                verts.canon[idx] = canonId;
+            verts.count++;
+            clustersByCanon.set(canonId, [{ idx, fnU: [fnUx, fnUy, fnUz] }]);
+            indices[i] = idx;
+        }
+    }
+    normalizeStoreNormals(verts);
+    return { verts, indices, posCanonMap };
+}
+function normalizeStoreNormals(verts) {
+    const nrm = verts.nrm;
+    for (let i = 0; i < verts.count; i++) {
+        const nx = nrm[i * 3];
+        const ny = nrm[i * 3 + 1];
+        const nz = nrm[i * 3 + 2];
+        const len = Math.sqrt(nx * nx + ny * ny + nz * nz) || 1;
+        nrm[i * 3] = nx / len;
+        nrm[i * 3 + 1] = ny / len;
+        nrm[i * 3 + 2] = nz / len;
+    }
+}
+// ── Indexed → non-indexed ──
+function toNonIndexed(verts, indices, faceExcluded = null) {
+    const positions = verts.pos, normals = verts.nrm, weights = verts.wgt;
+    const triCount = indices.length / 3;
+    const posArray = new Float32Array(triCount * 9);
+    const nrmArray = new Float32Array(triCount * 9);
+    const wgtArray = faceExcluded || weights ? new Float32Array(triCount * 3) : null;
+    for (let t = 0; t < triCount; t++) {
+        const faceW = faceExcluded ? (faceExcluded[t] ? 1.0 : 0.0) : null;
+        for (let v = 0; v < 3; v++) {
+            const vidx = indices[t * 3 + v];
+            posArray[t * 9 + v * 3] = positions[vidx * 3];
+            posArray[t * 9 + v * 3 + 1] = positions[vidx * 3 + 1];
+            posArray[t * 9 + v * 3 + 2] = positions[vidx * 3 + 2];
+            nrmArray[t * 9 + v * 3] = normals[vidx * 3];
+            nrmArray[t * 9 + v * 3 + 1] = normals[vidx * 3 + 1];
+            nrmArray[t * 9 + v * 3 + 2] = normals[vidx * 3 + 2];
+            if (wgtArray)
+                wgtArray[t * 3 + v] = faceW !== null ? faceW : weights[vidx];
+        }
+    }
+    const geo = new THREE.BufferGeometry();
+    geo.setAttribute('position', new THREE.BufferAttribute(posArray, 3));
+    geo.setAttribute('normal', new THREE.BufferAttribute(nrmArray, 3));
+    if (wgtArray)
+        geo.setAttribute('excludeWeight', new THREE.BufferAttribute(wgtArray, 1));
+    return geo;
+}
+//# sourceMappingURL=subdivision.js.map

package/dist/mesh/knurl/subdivision.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subdivision.js","sourceRoot":"","sources":["../../../src/mesh/knurl/subdivision.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,KAAK,KAAK,MAAM,OAAO,CAAA;AAC9B,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAA;AAE/C,cAAc;AACd,MAAM,QAAQ,GAAG,GAAG,CAAA;AACpB,OAAO;AACP,MAAM,UAAU,GACd,OAAO,SAAS,KAAK,WAAW;IAC/B,SAAmD,CAAC,YAAY,KAAK,SAAS;IAC9E,SAAmD,CAAC,YAAa,IAAI,CAAC;IACrE,CAAC,CAAC,UAAU;IACZ,CAAC,CAAC,UAAU,CAAA;AAEhB,gCAAgC;AAChC,MAAM,eAAe,GAAG,EAAE,CAAA;AAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAA;AAc3D,SAAS,aAAa,CAAC,UAAkB,EAAE,UAAmB,EAAE,QAAiB;IAC/E,OAAO;QACL,GAAG,EAAE,UAAU;QACf,KAAK,EAAE,CAAC;QACR,GAAG,EAAE,IAAI,YAAY,CAAC,UAAU,GAAG,CAAC,CAAC;QACrC,GAAG,EAAE,IAAI,YAAY,CAAC,UAAU,GAAG,CAAC,CAAC;QACrC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI;QACrD,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI;QACnD,IAAI;YACF,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;YACb,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;YACzC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAChB,IAAI,CAAC,GAAG,GAAG,EAAE,CAAA;YACb,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;YACzC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAChB,IAAI,CAAC,GAAG,GAAG,EAAE,CAAA;YACb,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;gBACb,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACrC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBAChB,IAAI,CAAC,GAAG,GAAG,EAAE,CAAA;YACf,CAAC;YACD,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACnC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAClB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAA;YACjB,CAAC;QACH,CAAC;KACF,CAAA;AACH,CAAC;AAED,aAAa;AAEb;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,QAA8B,EAC9B,aAAqB,EACrB,UAAuE,EACvE,cAAmC,IAAI;IAKvC,oDAAoD;IACpD,IAAI,UAAU,GAAG,QAAQ,CAAA;IACzB,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QACnB,UAAU,GAAG,QAAQ,CAAC,YAAY,EAAE,CAAA;IACtC,CAAC;IAED,yBAAyB;IACzB,IAAI,mBAAmB,GAAsB,IAAI,CAAA;IACjD,IAAI,WAAW,EAAE,CAAC;QAChB,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAA;QACvC,mBAAmB,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAA;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI;gBAAE,mBAAmB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAC3D,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,SAAS,CAAC,UAAU,EAAE,WAAW,CAAC,CAAA;IAE1E,MAAM,aAAa,GAAG,EAAE,CAAA;IACxB,IAAI,cAAc,GAAG,OAAO,CAAA;IAC5B,IAAI,mBAAmB,GAAG,mBAAmB,CAAA;IAC7C,IAAI,YAAY,GAAG,KAAK,CAAA;IAExB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,CAAA;QAC1C,IAAI,QAAQ,IAAI,UAAU,EAAE,CAAC;YAC3B,YAAY,GAAG,IAAI,CAAA;YACnB,MAAK;QACP,CAAC;QAED,MAAM,EAAE,UAAU,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,aAAa,CACpE,KAAK,EACL,cAAc,EACd,aAAa,EACb,UAAU,EACV,mBAAmB,EACnB,WAAW,CACZ,CAAA;QACD,cAAc,GAAG,UAAU,CAAA;QAC3B,IAAI,eAAe;YAAE,mBAAmB,GAAG,eAAe,CAAA;QAE1D,IAAI,MAAM,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU;YAAE,YAAY,GAAG,IAAI,CAAA;QAEtE,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAA;QAC3B,IAAI,YAAY,GAAG,CAAC,CAAA;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,EACzB,CAAC,GAAG,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,EACzB,CAAC,GAAG,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAC3B,MAAM,EAAE,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YACrC,MAAM,EAAE,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YACrC,MAAM,EAAE,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YACrC,IAAI,EAAE,GAAG,YAAY;gBAAE,YAAY,GAAG,EAAE,CAAA;YACxC,IAAI,EAAE,GAAG,YAAY;gBAAE,YAAY,GAAG,EAAE,CAAA;YACxC,IAAI,EAAE,GAAG,YAAY;gBAAE,YAAY,GAAG,EAAE,CAAA;QAC1C,CAAC;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;QAE3C,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAA;QACzC,IAAI,UAAU;YAAE,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,EAAE,WAAW,EAAE,WAAW,CAAC,CAAA;QAChG,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAC1C,IAAI,CAAC,OAAO,IAAI,YAAY;YAAE,MAAK;IACrC,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,YAAY,CAAC,KAAK,EAAE,cAAc,EAAE,mBAAmB,CAAC;QAClE,YAAY;KACb,CAAA;AACH,CAAC;AAED,kBAAkB;AAElB,SAAS,aAAa,CACpB,KAAgB,EAChB,OAAoB,EACpB,aAAqB,EACrB,SAAiB,EACjB,eAAkC,IAAI,EACtC,cAAwC,IAAI;IAO5C,MAAM,KAAK,GAAG,aAAa,GAAG,aAAa,CAAA;IAC3C,MAAM,QAAQ,GAAG,IAAI,iBAAiB,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;IAClD,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAA;IAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAA;IAE5B,MAAM,UAAU,GAAG,IAAI,iBAAiB,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;IACpD,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACxC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAClC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAChC,IAAI,CAAC,GAAG,CAAC;YAAE,UAAU,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;;YACrC,UAAU,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACtC,CAAC,CAAA;IACD,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACxC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAClC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAChC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;IAC3E,CAAC,CAAA;IAED,mBAAmB;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,YAAY,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;YAAE,SAAQ;QACjD,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EAClB,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAClB,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACpB,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK;YAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACtD,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK;YAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACtD,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK;YAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACxD,CAAC;IAED,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;QACvB,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,CAAA;IAE/E,uBAAuB;IACvB,IAAI,aAAa,GAAG,CAAC,CAAA;IACrB,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,EAClB,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAClB,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACpB,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC1B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACvD,aAAa,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACtC,CAAC;IACD,IAAI,aAAa,GAAG,SAAS,EAAE,CAAC;QAC9B,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAA;IAC7F,CAAC;IAED,iBAAiB;IACjB,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,aAAa,GAAG,CAAC,CAAC,CAAA;IACtD,MAAM,gBAAgB,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;IAC5E,IAAI,EAAE,GAAG,CAAC,CAAA;IACV,IAAI,EAAE,GAAG,CAAC,CAAA;IAEV,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,EAClB,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAClB,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACpB,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAA;QAClB,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAClD,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC1B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAEvD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;YACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;YACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;YACrB,IAAI,gBAAgB;gBAAE,gBAAgB,CAAC,EAAE,CAAC,GAAG,IAAI,CAAA;YACjD,EAAE,EAAE,CAAA;QACN,CAAC;aAAM,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACnB,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;YAC3D,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;YAC3D,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;YAC3D,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;YACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;YACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;YACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;YACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;YACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;YACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;YACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;YACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;YACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;YACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;YACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,gBAAgB;oBAAE,gBAAgB,CAAC,EAAE,CAAC,GAAG,IAAI,CAAA;gBACjD,EAAE,EAAE,CAAA;YACN,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACnB,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;gBACzD,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;YACvB,CAAC;iBAAM,IAAI,GAAG,EAAE,CAAC;gBACf,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;gBACzD,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;YACvB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;gBACzD,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;YACvB,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,gBAAgB;oBAAE,gBAAgB,CAAC,EAAE,CAAC,GAAG,IAAI,CAAA;gBACjD,EAAE,EAAE,CAAA;YACN,CAAC;QACH,CAAC;aAAM,CAAC;YACN,+DAA+D;YAC/D,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,wBAAwB;gBACxB,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;gBAC3D,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;gBAC3D,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;YACzB,CAAC;iBAAM,IAAI,CAAC,GAAG,EAAE,CAAC;gBAChB,wBAAwB;gBACxB,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;gBAC3D,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;gBAC3D,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;YACzB,CAAC;iBAAM,CAAC;gBACN,wBAAwB;gBACxB,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;gBAC3D,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;gBAC3D,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;gBACrB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;YACvB,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,gBAAgB;oBAAE,gBAAgB,CAAC,EAAE,CAAC,GAAG,IAAI,CAAA;gBACjD,EAAE,EAAE,CAAA;YACN,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,gBAAgB,EAAE,OAAO,EAAE,IAAI,EAAE,CAAA;AACtF,CAAC;AAED,aAAa;AAEb,SAAS,SAAS,CAAC,GAAiB,EAAE,CAAS,EAAE,CAAS;IACxD,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAClC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IAC1C,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IAC1C,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;AACpC,CAAC;AAED,SAAS,WAAW,CAClB,KAAgB,EAChB,KAAwB,EACxB,CAAS,EACT,CAAS,EACT,WAAqC;IAErC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACtB,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACpB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;IACnC,IAAI,MAAM,KAAK,CAAC,CAAC;QAAE,OAAO,MAAM,CAAA;IAEhC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EACnB,GAAG,GAAG,KAAK,CAAC,GAAG,CAAA;IAEjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACxC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IAChD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IAEhD,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAClC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IAC1C,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IAC1C,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;IAEtD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAA;IACvB,IAAI,GAAG,KAAK,KAAK,CAAC,GAAG;QAAE,KAAK,CAAC,IAAI,EAAE,CAAA;IACnC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;IACvB,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;IAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;IAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAA;IAC5B,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAA;IAChC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAA;IAChC,IAAI,KAAK,CAAC,GAAG;QAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACjE,YAAY;IACZ,IAAI,KAAK,CAAC,KAAK,IAAI,WAAW,EAAE,CAAC;QAC/B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAA;IAC1D,CAAC;IACD,KAAK,CAAC,KAAK,GAAG,GAAG,GAAG,CAAC,CAAA;IAErB,KAAK,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;IAC9B,OAAO,GAAG,CAAA;AACZ,CAAC;AAYD,SAAS,SAAS,CAChB,QAA8B,EAC9B,oBAAyC,IAAI;IAE7C,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAA;IAC5C,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAA;IAEvB,uBAAuB;IACvB,MAAM,WAAW,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC3C,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EACxB,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EACpB,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACtB,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAC5B,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EACxB,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAC5B,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EACxB,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,EACjB,GAAG,GAAG,EAAE,GAAG,EAAE,EACb,GAAG,GAAG,EAAE,GAAG,EAAE,CAAA;QACf,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,EACjB,GAAG,GAAG,EAAE,GAAG,EAAE,EACb,GAAG,GAAG,EAAE,GAAG,EAAE,CAAA;QACf,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;QAChC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;QAChC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;QACvD,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,EACjB,EAAE,GAAG,EAAE,GAAG,GAAG,EACb,EAAE,GAAG,EAAE,GAAG,GAAG,CAAA;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YAC7B,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YACjC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YACjC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YAC5B,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YAChC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;QAClC,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAA;IAClC,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAA;IAC1F,8DAA8D;IAC9D,MAAM,WAAW,GAAG,IAAI,iBAAiB,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IACzE,+CAA+C;IAC/C,MAAM,eAAe,GAAG,IAAI,GAAG,EAAyB,CAAA;IAExD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1B,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1B,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1B,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,EAC7B,IAAI,GAAG,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAC7B,IAAI,GAAG,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/B,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,EAC5B,IAAI,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAC5B,IAAI,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAE9B,6BAA6B;QAC7B,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;QAC7D,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAEhF,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,OAAO,GAAG,KAAK,CAAA;YACnB,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,MAAM,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;gBAClE,IAAI,GAAG,IAAI,SAAS,EAAE,CAAC;oBACrB,6BAA6B;oBAC7B,MAAM,GAAG,GAAG,EAAE,CAAC,GAAG,CAAA;oBAClB,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,CAAA;oBAC1B,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAA;oBAC9B,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAA;oBAC9B,IAAI,KAAK,CAAC,GAAG,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBAC5E,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAA;oBACvC,CAAC;oBACD,wBAAwB;oBACxB,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAA;oBACjB,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAA;oBACjB,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAA;oBACjB,MAAM,EAAE,GACN,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;oBACvF,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;oBACf,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;oBACf,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;oBACf,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;oBAChB,OAAO,GAAG,IAAI,CAAA;oBACd,MAAK;gBACP,CAAC;YACH,CAAC;YACD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,sBAAsB;gBACtB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAA;gBACvB,IAAI,GAAG,KAAK,KAAK,CAAC,GAAG;oBAAE,KAAK,CAAC,IAAI,EAAE,CAAA;gBACnC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;gBACvB,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;gBAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;gBAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;gBACzB,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;gBAC7B,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;gBAC7B,IAAI,KAAK,CAAC,GAAG,IAAI,iBAAiB;oBAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAA;gBACzE,IAAI,KAAK,CAAC,KAAK;oBAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,OAAO,CAAA;gBAC3C,KAAK,CAAC,KAAK,EAAE,CAAA;gBACb,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;gBAC/C,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;YAClB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,YAAY;YACZ,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAA,CAAC,cAAc;YACtC,IAAI,GAAG,KAAK,KAAK,CAAC,GAAG;gBAAE,KAAK,CAAC,IAAI,EAAE,CAAA;YACnC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YACvB,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;YACzB,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;YAC7B,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;YAC7B,IAAI,KAAK,CAAC,GAAG,IAAI,iBAAiB;gBAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAA;YACzE,IAAI,KAAK,CAAC,KAAK;gBAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,OAAO,CAAA;YAC3C,KAAK,CAAC,KAAK,EAAE,CAAA;YACb,eAAe,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;YAChE,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;QAClB,CAAC;IACH,CAAC;IAED,qBAAqB,CAAC,KAAK,CAAC,CAAA;IAC5B,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,CAAA;AACxC,CAAC;AAED,SAAS,qBAAqB,CAAC,KAAgB;IAC7C,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAA;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACrB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACzB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;QACvD,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAA;QACrB,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAA;QACzB,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAA;IAC3B,CAAC;AACH,CAAC;AAED,8BAA8B;AAE9B,SAAS,YAAY,CACnB,KAAgB,EAChB,OAAoB,EACpB,eAAkC,IAAI;IAEtC,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,EACzB,OAAO,GAAG,KAAK,CAAC,GAAG,EACnB,OAAO,GAAG,KAAK,CAAC,GAAG,CAAA;IACrB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;IACnC,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAA;IAC/C,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAA;IAC/C,MAAM,QAAQ,GAAG,YAAY,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;IAEhF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YAC/B,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;YAC7C,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YACrD,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YAErD,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;YAC3C,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YACnD,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YAEnD,IAAI,QAAQ;gBAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAQ,CAAC,IAAI,CAAC,CAAA;QAC7E,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,cAAc,EAAE,CAAA;IACtC,GAAG,CAAC,YAAY,CAAC,UAAU,EAAE,IAAI,KAAK,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAA;IACpE,GAAG,CAAC,YAAY,CAAC,QAAQ,EAAE,IAAI,KAAK,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAA;IAClE,IAAI,QAAQ;QAAE,GAAG,CAAC,YAAY,CAAC,eAAe,EAAE,IAAI,KAAK,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAA;IACvF,OAAO,GAAG,CAAA;AACZ,CAAC","sourcesContent":["/**\n * subdivision.ts — 自适应边细分，从 stlTexturizer/js/subdivision.js 移植为 TS。\n *\n * 细分直到每条边 ≤ maxEdgeLength。\n *\n * 关键特性：\n *   - toIndexed (export path): 锐边分裂 — 同位置但法线夹角 > 30° 的顶点分开存储\n *   - 确保水密性\n *\n * 管线：\n *   toIndexed(geometry) → 索引化 + 顶点去重 + 锐边分裂\n *   循环细分：标记长边 → 按标记数量分裂三角形\n *   toNonIndexed(verts, indices) → 输出 non-indexed BufferGeometry\n *\n * Bug 修复记录 (2026-07-22):\n *   问题： 检测到 knurl 后的 mesh 出现 NaN 值和错误 bounds\n *         (bounds 从 [-0.5, 0.5] 变成 [-17, 17]，且 hasNaN: true)\n *\n *   根因分析：\n *     1. box_boss.3mf 是 indexed geometry (530 vertices, 1548 indices)\n *     2. toIndexed() 函数假设输入是 non-indexed (flat triangles)\n *     3. 当传入 indexed geometry 时，toIndexed() 错误处理顶点数据：\n *        - n = posAttr.count = 530 (顶点数)\n *        - 但代码按 triangle count = n/3 = 176 处理\n *        - 导致顶点索引越界，读取错误位置的数据\n *     4. 细分后顶点位置完全错误，进而导致 displacement 计算产生 NaN\n *\n *   修复方案：\n *     在 subdivide() 入口添加 indexed → non-indexed 转换：\n *       if (geometry.index) { workingGeo = geometry.toNonIndexed() }\n *\n *   验证：\n *     - E2E 测试通过：hasNaN: false, bounds 正确\n *     - 原始 bounds [0,0,0]~[150,120,90] → knurl 后 [-0.5,-0.5,0]~[150.5,120.5,90.5]\n */\n\nimport * as THREE from 'three'\nimport { QuantizedPointMap } from './meshIndex'\n\n// 10μm 顶点去重网格\nconst QUANTISE = 1e5\n// 安全上限\nconst SAFETY_CAP =\n  typeof navigator !== 'undefined' &&\n  (navigator as Navigator & { deviceMemory?: number }).deviceMemory !== undefined &&\n  (navigator as Navigator & { deviceMemory?: number }).deviceMemory! >= 8\n    ? 32_000_000\n    : 16_000_000\n\n// 锐边角度阈值（度）— 法线夹角超过此值的顶点在索引化时分裂\nconst SHARP_ANGLE_DEG = 30\nconst SHARP_COS = Math.cos(SHARP_ANGLE_DEG * Math.PI / 180)\n\n// ── 可增长类型化顶点存储 ──\n\ninterface VertStore {\n  cap: number\n  count: number\n  pos: Float64Array\n  nrm: Float64Array\n  wgt: Float64Array | null\n  canon: Int32Array | null // 规范位置 ID（准确模式）\n  grow(): void\n}\n\nfunction makeVertStore(initialCap: number, hasWeights: boolean, hasCanon: boolean): VertStore {\n  return {\n    cap: initialCap,\n    count: 0,\n    pos: new Float64Array(initialCap * 3),\n    nrm: new Float64Array(initialCap * 3),\n    wgt: hasWeights ? new Float64Array(initialCap) : null,\n    canon: hasCanon ? new Int32Array(initialCap) : null,\n    grow() {\n      this.cap *= 2\n      const np = new Float64Array(this.cap * 3)\n      np.set(this.pos)\n      this.pos = np\n      const nn = new Float64Array(this.cap * 3)\n      nn.set(this.nrm)\n      this.nrm = nn\n      if (this.wgt) {\n        const nw = new Float64Array(this.cap)\n        nw.set(this.wgt)\n        this.wgt = nw\n      }\n      if (this.canon) {\n        const nc = new Int32Array(this.cap)\n        nc.set(this.canon)\n        this.canon = nc\n      }\n    },\n  }\n}\n\n// ── 公共入口 ──\n\n/**\n * Adaptively subdivide a geometry until every edge is ≤ maxEdgeLength.\n * Indexed inputs are expanded to non-indexed form first; sharp edges are\n * split at vertices whose face-normal angle exceeds the threshold so each\n * surface keeps its own normal direction and the result stays watertight.\n * Faces marked by `faceWeights` are excluded from refinement.\n *\n * @param geometry - the source geometry (position attribute; may be indexed).\n * @param maxEdgeLength - maximum allowed edge length in millimeters.\n * @param onProgress - optional callback receiving progress, triangle count, and longest edge.\n * @param faceWeights - optional per-face exclusion weights (non-indexed triangle soup layout).\n * @returns the subdivided non-indexed geometry and whether the safety cap was reached.\n */\nexport async function subdivide(\n  geometry: THREE.BufferGeometry,\n  maxEdgeLength: number,\n  onProgress?: (p: number, triCount: number, longestEdge: number) => void,\n  faceWeights: Float32Array | null = null,\n): Promise<{\n  geometry: THREE.BufferGeometry\n  safetyCapHit: boolean\n}> {\n  // 确保 geometry 是 non-indexed（toIndexed 假设输入是 flat 的）\n  let workingGeo = geometry\n  if (geometry.index) {\n    workingGeo = geometry.toNonIndexed()\n  }\n\n  // 在 toIndexed 之前推导每面排除标记\n  let initialFaceExcluded: Uint8Array | null = null\n  if (faceWeights) {\n    const triCount = faceWeights.length / 3\n    initialFaceExcluded = new Uint8Array(triCount)\n    for (let i = 0; i < triCount; i++) {\n      if (faceWeights[i * 3] > 0.99) initialFaceExcluded[i] = 1\n    }\n  }\n\n  // 使用准确模式（带锐边分裂的 toIndexed）\n  const { verts, indices, posCanonMap } = toIndexed(workingGeo, faceWeights)\n\n  const maxIterations = 12\n  let currentIndices = indices\n  let currentFaceExcluded = initialFaceExcluded\n  let safetyCapHit = false\n\n  for (let iter = 0; iter < maxIterations; iter++) {\n    const triCount = currentIndices.length / 3\n    if (triCount >= SAFETY_CAP) {\n      safetyCapHit = true\n      break\n    }\n\n    const { newIndices, newFaceExcluded, changed, capped } = subdividePass(\n      verts,\n      currentIndices,\n      maxEdgeLength,\n      SAFETY_CAP,\n      currentFaceExcluded,\n      posCanonMap,\n    )\n    currentIndices = newIndices\n    if (newFaceExcluded) currentFaceExcluded = newFaceExcluded\n\n    if (capped || newIndices.length / 3 >= SAFETY_CAP) safetyCapHit = true\n\n    const positions = verts.pos\n    let maxEdgeLenSq = 0\n    for (let t = 0; t < currentIndices.length; t += 3) {\n      const a = currentIndices[t],\n        b = currentIndices[t + 1],\n        c = currentIndices[t + 2]\n      const ab = edgeLenSq(positions, a, b)\n      const bc = edgeLenSq(positions, b, c)\n      const ca = edgeLenSq(positions, c, a)\n      if (ab > maxEdgeLenSq) maxEdgeLenSq = ab\n      if (bc > maxEdgeLenSq) maxEdgeLenSq = bc\n      if (ca > maxEdgeLenSq) maxEdgeLenSq = ca\n    }\n    const longestEdge = Math.sqrt(maxEdgeLenSq)\n\n    const newTriCount = newIndices.length / 3\n    if (onProgress) onProgress(Math.min(0.95, (iter + 1) / maxIterations), newTriCount, longestEdge)\n    await new Promise((r) => setTimeout(r, 0))\n    if (!changed || safetyCapHit) break\n  }\n\n  return {\n    geometry: toNonIndexed(verts, currentIndices, currentFaceExcluded),\n    safetyCapHit,\n  }\n}\n\n// ── 一次细分 pass ──\n\nfunction subdividePass(\n  verts: VertStore,\n  indices: Uint32Array,\n  maxEdgeLength: number,\n  safetyCap: number,\n  faceExcluded: Uint8Array | null = null,\n  posCanonMap: QuantizedPointMap | null = null,\n): {\n  newIndices: Uint32Array\n  newFaceExcluded: Uint8Array | null\n  changed: boolean\n  capped?: boolean\n} {\n  const maxSq = maxEdgeLength * maxEdgeLength\n  const midCache = new QuantizedPointMap(1, 1 << 16)\n  const positions = verts.pos\n  const canonIdx = verts.canon\n\n  const splitEdges = new QuantizedPointMap(1, 1 << 16)\n  const markEdge = (a: number, b: number) => {\n    const u = canonIdx ? canonIdx[a] : a,\n      v = canonIdx ? canonIdx[b] : b\n    if (u < v) splitEdges.getOrSet(u, v, 0, 1)\n    else splitEdges.getOrSet(v, u, 0, 1)\n  }\n  const isMarked = (a: number, b: number) => {\n    const u = canonIdx ? canonIdx[a] : a,\n      v = canonIdx ? canonIdx[b] : b\n    return (u < v ? splitEdges.get(u, v, 0) : splitEdges.get(v, u, 0)) !== -1\n  }\n\n  // Step 1: 标记需要分裂的边\n  for (let t = 0; t < indices.length; t += 3) {\n    if (faceExcluded && faceExcluded[t / 3]) continue\n    const a = indices[t],\n      b = indices[t + 1],\n      c = indices[t + 2]\n    if (edgeLenSq(positions, a, b) > maxSq) markEdge(a, b)\n    if (edgeLenSq(positions, b, c) > maxSq) markEdge(b, c)\n    if (edgeLenSq(positions, c, a) > maxSq) markEdge(c, a)\n  }\n\n  if (splitEdges.size === 0)\n    return { newIndices: indices, newFaceExcluded: faceExcluded, changed: false }\n\n  // Step 1.5: 预测分裂后三角形数量\n  let predictedTris = 0\n  for (let t = 0; t < indices.length; t += 3) {\n    const a = indices[t],\n      b = indices[t + 1],\n      c = indices[t + 2]\n    const sAB = isMarked(a, b)\n    const sBC = isMarked(b, c)\n    const sCA = isMarked(c, a)\n    const n = (sAB ? 1 : 0) + (sBC ? 1 : 0) + (sCA ? 1 : 0)\n    predictedTris += n === 0 ? 1 : n + 1\n  }\n  if (predictedTris > safetyCap) {\n    return { newIndices: indices, newFaceExcluded: faceExcluded, changed: false, capped: true }\n  }\n\n  // Step 2: 重建索引列表\n  const nextIndices = new Uint32Array(predictedTris * 3)\n  const nextFaceExcluded = faceExcluded ? new Uint8Array(predictedTris) : null\n  let wi = 0\n  let fi = 0\n\n  for (let t = 0; t < indices.length; t += 3) {\n    const a = indices[t],\n      b = indices[t + 1],\n      c = indices[t + 2]\n    const fIdx = t / 3\n    const excl = faceExcluded ? faceExcluded[fIdx] : 0\n    const sAB = isMarked(a, b)\n    const sBC = isMarked(b, c)\n    const sCA = isMarked(c, a)\n    const n = (sAB ? 1 : 0) + (sBC ? 1 : 0) + (sCA ? 1 : 0)\n\n    if (n === 0) {\n      nextIndices[wi++] = a\n      nextIndices[wi++] = b\n      nextIndices[wi++] = c\n      if (nextFaceExcluded) nextFaceExcluded[fi] = excl\n      fi++\n    } else if (n === 3) {\n      const mAB = getMidpoint(verts, midCache, a, b, posCanonMap)\n      const mBC = getMidpoint(verts, midCache, b, c, posCanonMap)\n      const mCA = getMidpoint(verts, midCache, c, a, posCanonMap)\n      nextIndices[wi++] = a\n      nextIndices[wi++] = mAB\n      nextIndices[wi++] = mCA\n      nextIndices[wi++] = mAB\n      nextIndices[wi++] = b\n      nextIndices[wi++] = mBC\n      nextIndices[wi++] = mCA\n      nextIndices[wi++] = mBC\n      nextIndices[wi++] = c\n      nextIndices[wi++] = mAB\n      nextIndices[wi++] = mBC\n      nextIndices[wi++] = mCA\n      for (let k = 0; k < 4; k++) {\n        if (nextFaceExcluded) nextFaceExcluded[fi] = excl\n        fi++\n      }\n    } else if (n === 1) {\n      if (sAB) {\n        const m = getMidpoint(verts, midCache, a, b, posCanonMap)\n        nextIndices[wi++] = a\n        nextIndices[wi++] = m\n        nextIndices[wi++] = c\n        nextIndices[wi++] = m\n        nextIndices[wi++] = b\n        nextIndices[wi++] = c\n      } else if (sBC) {\n        const m = getMidpoint(verts, midCache, b, c, posCanonMap)\n        nextIndices[wi++] = a\n        nextIndices[wi++] = b\n        nextIndices[wi++] = m\n        nextIndices[wi++] = a\n        nextIndices[wi++] = m\n        nextIndices[wi++] = c\n      } else {\n        const m = getMidpoint(verts, midCache, c, a, posCanonMap)\n        nextIndices[wi++] = a\n        nextIndices[wi++] = b\n        nextIndices[wi++] = m\n        nextIndices[wi++] = m\n        nextIndices[wi++] = b\n        nextIndices[wi++] = c\n      }\n      for (let k = 0; k < 2; k++) {\n        if (nextFaceExcluded) nextFaceExcluded[fi] = excl\n        fi++\n      }\n    } else {\n      // n === 2: 3 sub-triangles, fan from the untouched-edge vertex\n      if (!sAB) {\n        // sBC + sCA: fan from C\n        const mBC = getMidpoint(verts, midCache, b, c, posCanonMap)\n        const mCA = getMidpoint(verts, midCache, c, a, posCanonMap)\n        nextIndices[wi++] = a\n        nextIndices[wi++] = b\n        nextIndices[wi++] = mBC\n        nextIndices[wi++] = a\n        nextIndices[wi++] = mBC\n        nextIndices[wi++] = mCA\n        nextIndices[wi++] = c\n        nextIndices[wi++] = mCA\n        nextIndices[wi++] = mBC\n      } else if (!sBC) {\n        // sAB + sCA: fan from A\n        const mAB = getMidpoint(verts, midCache, a, b, posCanonMap)\n        const mCA = getMidpoint(verts, midCache, c, a, posCanonMap)\n        nextIndices[wi++] = a\n        nextIndices[wi++] = mAB\n        nextIndices[wi++] = mCA\n        nextIndices[wi++] = mAB\n        nextIndices[wi++] = b\n        nextIndices[wi++] = c\n        nextIndices[wi++] = mAB\n        nextIndices[wi++] = c\n        nextIndices[wi++] = mCA\n      } else {\n        // sAB + sBC: fan from B\n        const mAB = getMidpoint(verts, midCache, a, b, posCanonMap)\n        const mBC = getMidpoint(verts, midCache, b, c, posCanonMap)\n        nextIndices[wi++] = b\n        nextIndices[wi++] = mBC\n        nextIndices[wi++] = mAB\n        nextIndices[wi++] = a\n        nextIndices[wi++] = mAB\n        nextIndices[wi++] = mBC\n        nextIndices[wi++] = a\n        nextIndices[wi++] = mBC\n        nextIndices[wi++] = c\n      }\n      for (let k = 0; k < 3; k++) {\n        if (nextFaceExcluded) nextFaceExcluded[fi] = excl\n        fi++\n      }\n    }\n  }\n\n  return { newIndices: nextIndices, newFaceExcluded: nextFaceExcluded, changed: true }\n}\n\n// ── 辅助函数 ──\n\nfunction edgeLenSq(pos: Float64Array, a: number, b: number): number {\n  const dx = pos[a * 3] - pos[b * 3]\n  const dy = pos[a * 3 + 1] - pos[b * 3 + 1]\n  const dz = pos[a * 3 + 2] - pos[b * 3 + 2]\n  return dx * dx + dy * dy + dz * dz\n}\n\nfunction getMidpoint(\n  verts: VertStore,\n  cache: QuantizedPointMap,\n  a: number,\n  b: number,\n  posCanonMap: QuantizedPointMap | null,\n): number {\n  const lo = a < b ? a : b,\n    hi = a < b ? b : a\n  const cached = cache.get(lo, hi, 0)\n  if (cached !== -1) return cached\n\n  const pos = verts.pos,\n    nrm = verts.nrm\n\n  const mx = (pos[a * 3] + pos[b * 3]) / 2\n  const my = (pos[a * 3 + 1] + pos[b * 3 + 1]) / 2\n  const mz = (pos[a * 3 + 2] + pos[b * 3 + 2]) / 2\n\n  const nx = nrm[a * 3] + nrm[b * 3]\n  const ny = nrm[a * 3 + 1] + nrm[b * 3 + 1]\n  const nz = nrm[a * 3 + 2] + nrm[b * 3 + 2]\n  const nl = Math.sqrt(nx * nx + ny * ny + nz * nz) || 1\n\n  const idx = verts.count\n  if (idx === verts.cap) verts.grow()\n  verts.pos[idx * 3] = mx\n  verts.pos[idx * 3 + 1] = my\n  verts.pos[idx * 3 + 2] = mz\n  verts.nrm[idx * 3] = nx / nl\n  verts.nrm[idx * 3 + 1] = ny / nl\n  verts.nrm[idx * 3 + 2] = nz / nl\n  if (verts.wgt) verts.wgt[idx] = (verts.wgt[a] + verts.wgt[b]) / 2\n  // 维护规范位置 ID\n  if (verts.canon && posCanonMap) {\n    verts.canon[idx] = posCanonMap.getOrSet(mx, my, mz, idx)\n  }\n  verts.count = idx + 1\n\n  cache.getOrSet(lo, hi, 0, idx)\n  return idx\n}\n\n// ── 准确模式：非 indexed → indexed（带锐边分裂） ──\n//\n// 关键：同一位置但法线夹角 > SHARP_ANGLE_DEG 的顶点会被分裂成不同的 indexed vertex。\n// 这确保立方体的每个面保持独立的法线方向，位移后不会产生破面。\n\ninterface ClusterInfo {\n  idx: number\n  fnU: [number, number, number] // 面法线单位向量（运行平均值）\n}\n\nfunction toIndexed(\n  geometry: THREE.BufferGeometry,\n  nonIndexedWeights: Float32Array | null = null,\n): { verts: VertStore; indices: Uint32Array; posCanonMap: QuantizedPointMap } {\n  const posAttr = geometry.attributes.position\n  const n = posAttr.count\n\n  // 预计算每个面的法线（单位 + 原始叉积）\n  const faceNrmUnit = new Float32Array(n * 3)\n  const faceNrmRaw = new Float32Array(n * 3)\n  for (let t = 0; t < n; t += 3) {\n    const ax = posAttr.getX(t),\n      ay = posAttr.getY(t),\n      az = posAttr.getZ(t)\n    const bx = posAttr.getX(t + 1),\n      by = posAttr.getY(t + 1),\n      bz = posAttr.getZ(t + 1)\n    const cx = posAttr.getX(t + 2),\n      cy = posAttr.getY(t + 2),\n      cz = posAttr.getZ(t + 2)\n    const e1x = bx - ax,\n      e1y = by - ay,\n      e1z = bz - az\n    const e2x = cx - ax,\n      e2y = cy - ay,\n      e2z = cz - az\n    const rx = e1y * e2z - e1z * e2y\n    const ry = e1z * e2x - e1x * e2z\n    const rz = e1x * e2y - e1y * e2x\n    const len = Math.sqrt(rx * rx + ry * ry + rz * rz) || 1\n    const ux = rx / len,\n      uy = ry / len,\n      uz = rz / len\n    for (let v = 0; v < 3; v++) {\n      faceNrmUnit[(t + v) * 3] = ux\n      faceNrmUnit[(t + v) * 3 + 1] = uy\n      faceNrmUnit[(t + v) * 3 + 2] = uz\n      faceNrmRaw[(t + v) * 3] = rx\n      faceNrmRaw[(t + v) * 3 + 1] = ry\n      faceNrmRaw[(t + v) * 3 + 2] = rz\n    }\n  }\n\n  const indices = new Uint32Array(n)\n  const verts = makeVertStore(Math.max(16, Math.min(1 << 16, n)), !!nonIndexedWeights, true)\n  // position → first vertex idx at that position (canonical ID)\n  const posCanonMap = new QuantizedPointMap(QUANTISE, Math.min(n, 1 << 22))\n  // canonical ID → cluster list at that position\n  const clustersByCanon = new Map<number, ClusterInfo[]>()\n\n  for (let i = 0; i < n; i++) {\n    const px = posAttr.getX(i)\n    const py = posAttr.getY(i)\n    const pz = posAttr.getZ(i)\n    const fnUx = faceNrmUnit[i * 3],\n      fnUy = faceNrmUnit[i * 3 + 1],\n      fnUz = faceNrmUnit[i * 3 + 2]\n    const fnRx = faceNrmRaw[i * 3],\n      fnRy = faceNrmRaw[i * 3 + 1],\n      fnRz = faceNrmRaw[i * 3 + 2]\n\n    // 第一个到达此位置的顶点成为 canonical ID\n    const canonId = posCanonMap.getOrSet(px, py, pz, verts.count)\n    const clusters = posCanonMap.inserted ? undefined : clustersByCanon.get(canonId)\n\n    if (clusters) {\n      let matched = false\n      for (const cl of clusters) {\n        const dot = cl.fnU[0] * fnUx + cl.fnU[1] * fnUy + cl.fnU[2] * fnUz\n        if (dot >= SHARP_COS) {\n          // 同一 smooth group — 累加面积加权法线\n          const idx = cl.idx\n          verts.nrm[idx * 3] += fnRx\n          verts.nrm[idx * 3 + 1] += fnRy\n          verts.nrm[idx * 3 + 2] += fnRz\n          if (verts.wgt && nonIndexedWeights && nonIndexedWeights[i] > verts.wgt[idx]) {\n            verts.wgt[idx] = nonIndexedWeights[i]\n          }\n          // 更新 cluster 代表法线为运行平均值\n          cl.fnU[0] += fnUx\n          cl.fnU[1] += fnUy\n          cl.fnU[2] += fnUz\n          const rl =\n            Math.sqrt(cl.fnU[0] * cl.fnU[0] + cl.fnU[1] * cl.fnU[1] + cl.fnU[2] * cl.fnU[2]) || 1\n          cl.fnU[0] /= rl\n          cl.fnU[1] /= rl\n          cl.fnU[2] /= rl\n          indices[i] = idx\n          matched = true\n          break\n        }\n      }\n      if (!matched) {\n        // 此位置的新 cluster（锐边分裂）\n        const idx = verts.count\n        if (idx === verts.cap) verts.grow()\n        verts.pos[idx * 3] = px\n        verts.pos[idx * 3 + 1] = py\n        verts.pos[idx * 3 + 2] = pz\n        verts.nrm[idx * 3] = fnRx\n        verts.nrm[idx * 3 + 1] = fnRy\n        verts.nrm[idx * 3 + 2] = fnRz\n        if (verts.wgt && nonIndexedWeights) verts.wgt[idx] = nonIndexedWeights[i]\n        if (verts.canon) verts.canon[idx] = canonId\n        verts.count++\n        clusters.push({ idx, fnU: [fnUx, fnUy, fnUz] })\n        indices[i] = idx\n      }\n    } else {\n      // 此位置的第一个顶点\n      const idx = verts.count // === canonId\n      if (idx === verts.cap) verts.grow()\n      verts.pos[idx * 3] = px\n      verts.pos[idx * 3 + 1] = py\n      verts.pos[idx * 3 + 2] = pz\n      verts.nrm[idx * 3] = fnRx\n      verts.nrm[idx * 3 + 1] = fnRy\n      verts.nrm[idx * 3 + 2] = fnRz\n      if (verts.wgt && nonIndexedWeights) verts.wgt[idx] = nonIndexedWeights[i]\n      if (verts.canon) verts.canon[idx] = canonId\n      verts.count++\n      clustersByCanon.set(canonId, [{ idx, fnU: [fnUx, fnUy, fnUz] }])\n      indices[i] = idx\n    }\n  }\n\n  normalizeStoreNormals(verts)\n  return { verts, indices, posCanonMap }\n}\n\nfunction normalizeStoreNormals(verts: VertStore): void {\n  const nrm = verts.nrm\n  for (let i = 0; i < verts.count; i++) {\n    const nx = nrm[i * 3]\n    const ny = nrm[i * 3 + 1]\n    const nz = nrm[i * 3 + 2]\n    const len = Math.sqrt(nx * nx + ny * ny + nz * nz) || 1\n    nrm[i * 3] = nx / len\n    nrm[i * 3 + 1] = ny / len\n    nrm[i * 3 + 2] = nz / len\n  }\n}\n\n// ── Indexed → non-indexed ──\n\nfunction toNonIndexed(\n  verts: VertStore,\n  indices: Uint32Array,\n  faceExcluded: Uint8Array | null = null,\n): THREE.BufferGeometry {\n  const positions = verts.pos,\n    normals = verts.nrm,\n    weights = verts.wgt\n  const triCount = indices.length / 3\n  const posArray = new Float32Array(triCount * 9)\n  const nrmArray = new Float32Array(triCount * 9)\n  const wgtArray = faceExcluded || weights ? new Float32Array(triCount * 3) : null\n\n  for (let t = 0; t < triCount; t++) {\n    const faceW = faceExcluded ? (faceExcluded[t] ? 1.0 : 0.0) : null\n    for (let v = 0; v < 3; v++) {\n      const vidx = indices[t * 3 + v]\n      posArray[t * 9 + v * 3] = positions[vidx * 3]\n      posArray[t * 9 + v * 3 + 1] = positions[vidx * 3 + 1]\n      posArray[t * 9 + v * 3 + 2] = positions[vidx * 3 + 2]\n\n      nrmArray[t * 9 + v * 3] = normals[vidx * 3]\n      nrmArray[t * 9 + v * 3 + 1] = normals[vidx * 3 + 1]\n      nrmArray[t * 9 + v * 3 + 2] = normals[vidx * 3 + 2]\n\n      if (wgtArray) wgtArray[t * 3 + v] = faceW !== null ? faceW : weights![vidx]\n    }\n  }\n\n  const geo = new THREE.BufferGeometry()\n  geo.setAttribute('position', new THREE.BufferAttribute(posArray, 3))\n  geo.setAttribute('normal', new THREE.BufferAttribute(nrmArray, 3))\n  if (wgtArray) geo.setAttribute('excludeWeight', new THREE.BufferAttribute(wgtArray, 1))\n  return geo\n}\n"]}

package/dist/mesh/knurl/textureLoader.d.ts

@@ -0,0 +1,38 @@
+/**
+ * textureLoader — 滚花纹理加载器
+ *
+ * 浏览器环境：由 host 通过 setKnurlTextureLoader() 注入纹理加载器。
+ * Node 环境：返回 null（由 TextureSampler port 提供纹理）。
+ *
+ * F5 设计意图说明：
+ * _textureLoaderOverride 是环境级单例，不是实例级。
+ * 在整个浏览器页面中，滚花纹理只应加载一次。
+ * 多个 CadRuntime 实例共享同一个纹理加载器是正确的行为。
+ */
+import * as THREE from 'three';
+/**
+ * Raw RGBA pixel data plus the pixel dimensions of a loaded texture.
+ */
+export interface TextureData {
+    data: Uint8ClampedArray;
+    width: number;
+    height: number;
+}
+/**
+ * Set the knurling texture loader (injected by the browser host at startup).
+ *
+ * @param loader - the loader to use, or null to clear the override.
+ */
+export declare function setKnurlTextureLoader(loader: (() => Promise<TextureData | null>) | null): void;
+/**
+ * Load the knurling texture. Uses the injected host loader when present;
+ * otherwise returns null (the texture is supplied through the port).
+ *
+ * @returns the texture data, or null when no loader is available.
+ */
+export declare function loadKnurlingTexture(): Promise<TextureData | null>;
+/** Dispose the knurl preview material; a no-op in the headless engine. */
+export declare function disposeKnurlPreviewMaterial(): void;
+/** Bounds type shared with the knurl preview path (a THREE.Box3). */
+export type KnurlPreviewBounds = THREE.Box3;
+//# sourceMappingURL=textureLoader.d.ts.map

package/dist/mesh/knurl/textureLoader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"textureLoader.d.ts","sourceRoot":"","sources":["../../../src/mesh/knurl/textureLoader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,KAAK,MAAM,OAAO,CAAA;AAE9B;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,iBAAiB,CAAA;IACvB,KAAK,EAAE,MAAM,CAAA;IACb,MAAM,EAAE,MAAM,CAAA;CACf;AAKD;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,CAAC,MAAM,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAE9F;AAED;;;;;GAKG;AACH,wBAAsB,mBAAmB,IAAI,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,CAOvE;AAED,0EAA0E;AAC1E,wBAAgB,2BAA2B,IAAI,IAAI,CAElD;AAED,qEAAqE;AACrE,MAAM,MAAM,kBAAkB,GAAG,KAAK,CAAC,IAAI,CAAA"}