build-dxf 0.0.31 → 0.0.32

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "build-dxf",
-  "version": "0.0.31",
+  "version": "0.0.32",
   "description": "线段构建双线墙壁的dxf版本",
   "main": "./src/index.js",
   "types": "./src/index.d.ts",

package/src/build.js

@@ -1,5 +1,5 @@
 import * as G from "three";
-import { EventDispatcher as Ie, Color as Re, Matrix4 as Se, Vector3 as Z, Quaternion as Pe, BufferAttribute as k, REVISION as Ne, CompressedTexture as ne, Source as ve, NoColorSpace as Ce, MathUtils as oe, RGBAFormat as Be, ImageUtils as Oe, DoubleSide as Ge, PropertyBinding as Q, InterpolateDiscrete as Ue, Scene as ue, SRGBColorSpace as Fe, NearestFilter as _e, NearestMipmapNearestFilter as ze, NearestMipmapLinearFilter as qe, LinearFilter as je, LinearMipmapNearestFilter as Ye, LinearMipmapLinearFilter as Ve, ClampToEdgeWrapping as ke, RepeatWrapping as Xe, MirroredRepeatWrapping as We, InterpolateLinear as He } from "three";
+import { EventDispatcher as Ie, Color as Re, Matrix4 as Se, Vector3 as Z, Quaternion as Pe, BufferAttribute as k, REVISION as Ne, CompressedTexture as ne, Source as ve, NoColorSpace as Ce, MathUtils as oe, RGBAFormat as Be, ImageUtils as Oe, DoubleSide as Ge, PropertyBinding as Q, InterpolateDiscrete as Fe, Scene as ue, SRGBColorSpace as Ue, NearestFilter as _e, NearestMipmapNearestFilter as ze, NearestMipmapLinearFilter as qe, LinearFilter as je, LinearMipmapNearestFilter as Ye, LinearMipmapLinearFilter as Ve, ClampToEdgeWrapping as ke, RepeatWrapping as Xe, MirroredRepeatWrapping as We, InterpolateLinear as He } from "three";
 import de from "clipper-lib";
 import $ from "dxf-writer";
 import { OBJExporter as Je } from "three/examples/jsm/exporters/OBJExporter.js";
@@ -411,8 +411,8 @@ class _ {
     for (let l = 0; l < 4; l++) {
       const c = o[l], h = o[(l + 1) % 4];
       for (let f = 0; f < 4; f++) {
-        const u = t[f], p = t[(f + 1) % 4], y = (h.x - c.x) * (u.y - c.y) - (h.y - c.y) * (u.x - c.x), x = (h.x - c.x) * (p.y - c.y) - (h.y - c.y) * (p.x - c.x), S = (p.x - u.x) * (c.y - u.y) - (p.y - u.y) * (c.x - u.x), D = (p.x - u.x) * (h.y - u.y) - (p.y - u.y) * (h.x - u.x);
-        if (y * x < 0 && S * D < 0 || y === 0 && Math.min(c.x, h.x) <= u.x && u.x <= Math.max(c.x, h.x) && Math.min(c.y, h.y) <= u.y && u.y <= Math.max(c.y, h.y) || x === 0 && Math.min(c.x, h.x) <= p.x && p.x <= Math.max(c.x, h.x) && Math.min(c.y, h.y) <= p.y && p.y <= Math.max(c.y, h.y) || S === 0 && Math.min(u.x, p.x) <= c.x && c.x <= Math.max(u.x, p.x) && Math.min(u.y, p.y) <= c.y && c.y <= Math.max(u.y, p.y) || D === 0 && Math.min(u.x, p.x) <= h.x && h.x <= Math.max(u.x, p.x) && Math.min(u.y, p.y) <= h.y && h.y <= Math.max(u.y, p.y))
+        const u = t[f], p = t[(f + 1) % 4], y = (h.x - c.x) * (u.y - c.y) - (h.y - c.y) * (u.x - c.x), x = (h.x - c.x) * (p.y - c.y) - (h.y - c.y) * (p.x - c.x), S = (p.x - u.x) * (c.y - u.y) - (p.y - u.y) * (c.x - u.x), b = (p.x - u.x) * (h.y - u.y) - (p.y - u.y) * (h.x - u.x);
+        if (y * x < 0 && S * b < 0 || y === 0 && Math.min(c.x, h.x) <= u.x && u.x <= Math.max(c.x, h.x) && Math.min(c.y, h.y) <= u.y && u.y <= Math.max(c.y, h.y) || x === 0 && Math.min(c.x, h.x) <= p.x && p.x <= Math.max(c.x, h.x) && Math.min(c.y, h.y) <= p.y && p.y <= Math.max(c.y, h.y) || S === 0 && Math.min(u.x, p.x) <= c.x && c.x <= Math.max(u.x, p.x) && Math.min(u.y, p.y) <= c.y && c.y <= Math.max(u.y, p.y) || b === 0 && Math.min(u.x, p.x) <= h.x && h.x <= Math.max(u.x, p.x) && Math.min(u.y, p.y) <= h.y && h.y <= Math.max(u.y, p.y))
           return !0;
       }
     }
@@ -1151,7 +1151,7 @@ class B {
     if (r.x === 0 && r.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
     const o = (p) => {
-      const y = new w(p.x - s.x, p.y - s.y), x = r.x * r.x + r.y * r.y, D = (y.x * r.x + y.y * r.y) / x, C = s.x + D * r.x, m = s.y + D * r.y;
+      const y = new w(p.x - s.x, p.y - s.y), x = r.x * r.x + r.y * r.y, b = (y.x * r.x + y.y * r.y) / x, C = s.x + b * r.x, m = s.y + b * r.y;
       return new w(C, m);
     };
     let a = o(t), l = o(n);
@@ -1749,15 +1749,15 @@ class X extends W {
             break;
           }
         f.expansion(-o * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((m, E) => i(m, E));
-        const p = c.length(), y = f.length(), x = (p ** 2 + y ** 2) / (2 * y), S = f.end.clone().add(f.direction().multiplyScalar(-x)), [D, C] = this.getArcAngleRange(S, c.end, f.end);
-        r(S, x, Math.min(D, C), Math.max(D, C)), a.push(u);
+        const p = c.length(), y = f.length(), x = (p ** 2 + y ** 2) / (2 * y), S = f.end.clone().add(f.direction().multiplyScalar(-x)), [b, C] = this.getArcAngleRange(S, c.end, f.end);
+        r(S, x, Math.min(b, C), Math.max(b, C)), a.push(u);
       } else
         c.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((h, f) => i(h, f)), c.clone().directionMove(c.normal(), o * 0.5).directionMove(c.direction(), o * 0.5).expansion(-c.length() * 0.45, "end").forward(o * 0.5).expandToRectangle(o).path2D((h, f) => i(h, f)), c.clone().directionMove(c.normal(), -o * 0.5).directionMove(c.direction(), -o * 0.5).expansion(-c.length() * 0.45, "start").forward(-o * 0.5).expandToRectangle(o).path2D((h, f) => i(h, f));
     }), s = "yellow", this.lineSegments.forEach((l) => {
       if (!l.userData.isWindow) return !1;
       Array.isArray(l.userData.drawWindow) && l.userData.drawWindow.forEach((c) => {
         const { p: h, width: f } = c, u = w.from(h), p = u.clone().add(l.direction().multiplyScalar(f * 0.5)), y = u.clone().add(l.direction().multiplyScalar(-f * 0.5)), x = new B(p, y);
-        i(x.start, x.end), x.expandToRectangle(this.width, "bothSides").path2D((S, D) => i(S, D));
+        i(x.start, x.end), x.expandToRectangle(this.width, "bothSides").path2D((S, b) => i(S, b));
       });
     }), n;
   }
@@ -1896,20 +1896,20 @@ class X extends W {
       m.forEach((M) => M.userData.isDoor || M.points.forEach((g) => E.insert(g, M)));
       const L = [];
       for (let M = 0; M < m.length; M++) {
-        const g = m[M], b = /* @__PURE__ */ new Map();
+        const g = m[M], D = /* @__PURE__ */ new Map();
         g.userData.isDoor || g.points.forEach((T) => {
           if (E.queryPoint(T).length > 1) return;
           const A = E.queryCircle(T, 0.4).filter((R) => {
             const I = R.userData;
             if (I === g || !g.parallel(I, 25)) return !1;
             if (E.queryPoint(R.point).length > 1) return;
-            const N = new B(T, R.point), U = new B(g.start === T ? g.end : g.start, I.start === R.point ? I.end : I.start);
-            if (!N.intersectLineSegment(U)) return !1;
+            const N = new B(T, R.point), F = new B(g.start === T ? g.end : g.start, I.start === R.point ? I.end : I.start);
+            if (!N.intersectLineSegment(F)) return !1;
             const O = T.distance(R.point);
-            return O < 1e-3 ? !1 : (b.set(R.point, O), !0);
+            return O < 1e-3 ? !1 : (D.set(R.point, O), !0);
           }).sort((R, I) => {
-            const N = b.get(R.point), U = b.get(I.point);
-            return N - U;
+            const N = D.get(R.point), F = D.get(I.point);
+            return N - F;
           });
           if (A.length === 0) return;
           const P = A[0].userData;
@@ -1919,7 +1919,7 @@ class X extends W {
       return [...m, ...L];
     }
     function s(m, E) {
-      const L = [m], M = [], g = [], b = [];
+      const L = [m], M = [], g = [], D = [];
       for (let T = 0; T < E.length; T++) {
         const A = E[T];
         if (m !== A) {
@@ -1927,7 +1927,7 @@ class X extends W {
             g.push(A);
             continue;
           }
-          if (A.userData.isWindow && b.push(A), A.parallel(m, 45)) {
+          if (A.userData.isWindow && D.push(A), A.parallel(m, 45)) {
             const P = Math.atan2(A.end.y - A.start.y, A.end.x - A.start.x);
             let I = Math.atan2(m.end.y - m.start.y, m.end.x - m.start.x) - P;
             for (; I > Math.PI; ) I -= 2 * Math.PI;
@@ -1941,43 +1941,43 @@ class X extends W {
             for (; I < -Math.PI; ) I += 2 * Math.PI;
             for (; N > Math.PI; ) N -= 2 * Math.PI;
             for (; N < -Math.PI; ) N += 2 * Math.PI;
-            const U = Math.abs(I) < Math.abs(N) ? I : N, O = A.center;
-            A.start.rotate(O, U), A.end.rotate(O, U), M.push(A);
+            const F = Math.abs(I) < Math.abs(N) ? I : N, O = A.center;
+            A.start.rotate(O, F), A.end.rotate(O, F), M.push(A);
           }
         }
       }
-      return { parallelLines: L, verticalLines: M, doorLines: g, windowLines: b };
+      return { parallelLines: L, verticalLines: M, doorLines: g, windowLines: D };
     }
     function i(m, E, L, M = 0.3, g = 0.06) {
-      const b = [];
+      const D = [];
       m.forEach((P) => {
         const R = L.projectPoint(P.start, !1);
-        R && (R.userData = P, b.push(R));
-      }), b.sort((P, R) => R.distance(L.start) - P.distance(L.start));
+        R && (R.userData = P, D.push(R));
+      }), D.sort((P, R) => R.distance(L.start) - P.distance(L.start));
       const T = [], A = [];
-      for (let P = 0; P < b.length; P++) {
-        const R = b[P];
+      for (let P = 0; P < D.length; P++) {
+        const R = D[P];
         if (P === 0) {
           A.push(R);
           continue;
         }
-        b[P - 1].distance(R) < g || (T.push([...A]), A.length = 0), A.push(R), P === b.length - 1 && T.push(A);
+        D[P - 1].distance(R) < g || (T.push([...A]), A.length = 0), A.push(R), P === D.length - 1 && T.push(A);
       }
       return T.flatMap((P) => {
         const R = P.flatMap((O) => {
           const z = O.userData;
           return z.points.map((j) => {
-            const F = E.projectPoint(j, !1);
-            return F.userData = z, F;
+            const U = E.projectPoint(j, !1);
+            return U.userData = z, U;
           });
         });
         R.sort((O, z) => O.distance(E.start) - z.distance(E.start));
-        const I = /* @__PURE__ */ new Map(), N = [], U = [];
+        const I = /* @__PURE__ */ new Map(), N = [], F = [];
         return R.forEach((O, z) => {
-          I.size === 0 && z > 0 && R[z - 1].distance(O) > M && (N.push([...U]), U.length = 0), I.set(O.userData, (I.get(O.userData) ?? 0) + 1);
+          I.size === 0 && z > 0 && R[z - 1].distance(O) > M && (N.push([...F]), F.length = 0), I.set(O.userData, (I.get(O.userData) ?? 0) + 1);
           for (const j of I.values()) if (j !== 2) return;
-          U.push(...I.keys()), I.clear();
-        }), N.push([...U]), N;
+          F.push(...I.keys()), I.clear();
+        }), N.push([...F]), N;
       });
     }
     function r(m, E = 0.1) {
@@ -1985,43 +1985,43 @@ class X extends W {
         if (L.length === 0) return;
         if (L.length === 1) return L[0];
         const M = [];
-        L.forEach((F) => {
-          M.push(F.start.clone(), F.end.clone());
+        L.forEach((U) => {
+          M.push(U.start.clone(), U.end.clone());
         });
         const g = L[0].direction().normalize();
-        let b = 1 / 0, T = -1 / 0, A = 0, P = 0;
-        M.forEach((F) => {
-          const J = F.x * g.x + F.y * g.y;
-          b = Math.min(b, J), T = Math.max(T, J), A += F.x, P += F.y;
+        let D = 1 / 0, T = -1 / 0, A = 0, P = 0;
+        M.forEach((U) => {
+          const J = U.x * g.x + U.y * g.y;
+          D = Math.min(D, J), T = Math.max(T, J), A += U.x, P += U.y;
         });
-        const R = new w(A / M.length, P / M.length), I = R.x * g.x + R.y * g.y, N = new w(R.x + (b - I) * g.x, R.y + (b - I) * g.y), U = new w(R.x + (T - I) * g.x, R.y + (T - I) * g.y), O = new B(N, U), z = L[0].normal().normalize();
-        b = 1 / 0, T = -1 / 0, M.forEach((F) => {
-          const J = F.x * z.x + F.y * z.y;
-          b = Math.min(b, J), T = Math.max(T, J);
+        const R = new w(A / M.length, P / M.length), I = R.x * g.x + R.y * g.y, N = new w(R.x + (D - I) * g.x, R.y + (D - I) * g.y), F = new w(R.x + (T - I) * g.x, R.y + (T - I) * g.y), O = new B(N, F), z = L[0].normal().normalize();
+        D = 1 / 0, T = -1 / 0, M.forEach((U) => {
+          const J = U.x * z.x + U.y * z.y;
+          D = Math.min(D, J), T = Math.max(T, J);
         });
-        const j = T - b;
-        return j >= E && (O.userData.wallWidth = j), L.forEach((F) => F.userData.fittedLine = O), O;
+        const j = T - D;
+        return j >= E && (O.userData.wallWidth = j), L.forEach((U) => U.userData.fittedLine = O), O;
       }).filter((L) => !!L);
     }
     function o(m, E = 0.2) {
       const L = new Y(_.fromByLineSegment(...m)), M = /* @__PURE__ */ new Map();
-      m.forEach((b) => {
-        M.set(b, { line: b, userData: void 0 }), L.insert(M.get(b));
+      m.forEach((D) => {
+        M.set(D, { line: D, userData: void 0 }), L.insert(M.get(D));
       });
       const g = new B();
-      for (let b = 0; b < m.length; b++) {
-        const T = m[b];
+      for (let D = 0; D < m.length; D++) {
+        const T = m[D];
         if (T.userData.isAdsorbed) continue;
         const A = T.direction().multiplyScalar(E), [P, R] = T.points.map((I) => {
           g.set(I, I), g.start.add(A), g.end.add(A.multiplyScalar(-1));
-          const N = /* @__PURE__ */ new Map(), U = L.queryRect(g.expandToRectangle(0.1, "bothSides")).filter((O) => O.line !== T).map((O) => {
+          const N = /* @__PURE__ */ new Map(), F = L.queryRect(g.expandToRectangle(0.1, "bothSides")).filter((O) => O.line !== T).map((O) => {
             const z = O.line.getIntersection(g);
             return N.set(O.line, z), O.line;
           }).sort((O, z) => {
-            const j = N.get(O), F = N.get(z);
-            return j && F ? j.distance(I) - F.distance(I) : 0;
+            const j = N.get(O), U = N.get(z);
+            return j && U ? j.distance(I) - U.distance(I) : 0;
           });
-          return U.length ? N.get(U[0]) : void 0;
+          return F.length ? N.get(F[0]) : void 0;
         });
         if (P && R) {
           if (P.equal(R)) {
@@ -2033,23 +2033,23 @@ class X extends W {
         } else P ? T.start.copy(P) : R && T.end.copy(R);
         L.remove(M.get(T)), L.insert(M.get(T));
       }
-      return m.filter((b) => b.length() > 1e-3);
+      return m.filter((D) => D.length() > 1e-3);
     }
     function a(m) {
       for (let E = 0; E < m.length; E++) {
         const L = m[E], M = L.userData.fittedLine;
         if (M) {
           const g = L.direction();
-          M.userData.isWindow = !0, M.userData.drawWindow = M.userData.drawWindow ?? [], L.userData.drawWindow?.forEach((b) => {
-            const T = w.from(b.p), A = M.projectPoint(
-              T.clone().add(g.clone().multiplyScalar(b.width * 0.5))
+          M.userData.isWindow = !0, M.userData.drawWindow = M.userData.drawWindow ?? [], L.userData.drawWindow?.forEach((D) => {
+            const T = w.from(D.p), A = M.projectPoint(
+              T.clone().add(g.clone().multiplyScalar(D.width * 0.5))
             ), P = M.projectPoint(
-              T.clone().add(g.clone().multiplyScalar(b.width * -0.5))
+              T.clone().add(g.clone().multiplyScalar(D.width * -0.5))
             ), R = new B(A, P), I = R.center;
             M.userData.drawWindow?.push({
-              p: new G.Vector3(I?.x ?? 0, I?.y ?? 0, b.p.z),
+              p: new G.Vector3(I?.x ?? 0, I?.y ?? 0, D.p.z),
               width: R.length(),
-              full: b.full
+              full: D.full
             });
           });
         }
@@ -2060,18 +2060,18 @@ class X extends W {
       return m.forEach((L) => E.insert({ line: L, userData: void 0 })), m.flatMap((L) => {
         const M = E.queryLineSegment(L, !0).map((g) => {
           if (g.line === L) return;
-          const b = g.line.getIntersection(L);
-          if (!(!b || L.start.equal(b) || L.end.equal(b)))
-            return b;
+          const D = g.line.getIntersection(L);
+          if (!(!D || L.start.equal(D) || L.end.equal(D)))
+            return D;
         }).filter((g) => !!g);
         if (M.length) {
           const g = L.clone();
           M.sort((T, A) => g.start.distance(T) - g.start.distance(A));
-          const b = M.map((T) => {
+          const D = M.map((T) => {
             const A = g.clone();
             return A.set(g.start.clone(), T), g.start.copy(T), g.userData.isWindow && (A.userData.isWindow = !0, A.userData.drawWindow = g.userData.drawWindow?.filter((P) => A.isPointOnSegment(w.from(P.p))) ?? []), A;
           });
-          return g.userData.drawWindow = g.userData.drawWindow?.filter((T) => g.isPointOnSegment(w.from(T.p))) ?? [], [...b, g];
+          return g.userData.drawWindow = g.userData.drawWindow?.filter((T) => g.isPointOnSegment(w.from(T.p))) ?? [], [...D, g];
         }
         return L;
       }).filter((L) => L.length() > 0.05);
@@ -2080,13 +2080,13 @@ class X extends W {
     const { parallelLines: c, verticalLines: h, doorLines: f, windowLines: u } = s(t, e.map((m) => m.clone())), p = t.normal(), y = t.center, x = t.direction(), S = new B(
       y.clone().add(p.clone().multiplyScalar(-1e3)),
       y.clone().add(p.clone().multiplyScalar(1e3))
-    ), D = new B(
+    ), b = new B(
       y.clone().add(x.clone().multiplyScalar(-1e3)),
       y.clone().add(x.clone().multiplyScalar(1e3))
     );
     let C = r([
-      ...i.call(this, c, D, S),
-      ...i.call(this, h, S, D)
+      ...i.call(this, c, b, S),
+      ...i.call(this, h, S, b)
     ]);
     return C = o.call(this, C), C = o.call(this, C), a(u), C = l.call(this, C), [...C, ...f];
   }
@@ -2306,14 +2306,14 @@ class Qe {
    */
   searchNearby(e, t = [], n = this.doorSearchDistance, s = this.doorSearchNearAngle) {
     const i = this.findPointVirtualGrid, r = this.quadtree;
-    function o({ point: x, line: S }, D, C) {
+    function o({ point: x, line: S }, b, C) {
       const m = S.direction();
       S.start === x && m.multiplyScalar(-1);
       const E = i.queryCircle(x, n).filter((M) => M.userData !== S).sort((M, g) => M.point.distance(x) - g.point.distance(x)), L = [];
       for (let M = 0; M < E.length; M++) {
-        const g = t.findIndex((I) => I.point === E[M].point), b = e[D].uuid, T = t[g].uuid;
-        if (C.has(`${b}.${T}`)) continue;
-        C.add(`${b}.${T}`), C.add(`${T}.${b}`);
+        const g = t.findIndex((I) => I.point === E[M].point), D = e[b].uuid, T = t[g].uuid;
+        if (C.has(`${D}.${T}`)) continue;
+        C.add(`${D}.${T}`), C.add(`${T}.${D}`);
         const A = E[M].point, P = new B(x.clone(), A.clone());
         if (P.direction().angleBetween(m, "angle") < s) {
           const I = e[g].line.direction();
@@ -2321,41 +2321,41 @@ class Qe {
             findData: E[M],
             findUuid: T,
             doorLine: P,
-            doorUuid: b
+            doorUuid: D
           }));
         }
       }
       return L;
     }
-    function a(x, S, D, C, m) {
+    function a(x, S, b, C, m) {
       C.add(x);
       const E = [];
       m && E.push(m);
-      for (let L = 0; L < D.length; L++) {
-        const M = D[L];
+      for (let L = 0; L < b.length; L++) {
+        const M = b[L];
         if (S.has(M.findUuid)) {
           const g = S.get(M.findUuid);
           a(M.findUuid, S, g, C, M) && E.push(M);
         } else E.push(M);
       }
-      return E.sort((L, M) => L.doorLine.length() - M.doorLine.length()), m && E[0] === m ? (D.splice(0), !0) : (D.splice(1), !1);
+      return E.sort((L, M) => L.doorLine.length() - M.doorLine.length()), m && E[0] === m ? (b.splice(0), !0) : (b.splice(1), !1);
     }
     const l = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Map();
     e.map((x, S) => {
-      const D = o(x, S, l);
-      D.length && c.set(x.uuid, D);
+      const b = o(x, S, l);
+      b.length && c.set(x.uuid, b);
     }), l.clear();
     const h = /* @__PURE__ */ new Map();
     c.forEach((x, S) => {
       if (!l.has(S) && x.length && a(S, c, x, l), x.length) {
-        const D = x[0];
-        h.has(D.doorUuid) || h.set(D.doorUuid, []), h.get(D.doorUuid)?.push(D), h.has(D.findUuid) || h.set(D.findUuid, []), h.get(D.findUuid)?.push(D);
+        const b = x[0];
+        h.has(b.doorUuid) || h.set(b.doorUuid, []), h.get(b.doorUuid)?.push(b), h.has(b.findUuid) || h.set(b.findUuid, []), h.get(b.findUuid)?.push(b);
       }
     });
     const f = /* @__PURE__ */ new Set();
     h.forEach((x) => {
       if (x.length > 1) {
-        x.sort((S, D) => S.doorLine.length() - D.doorLine.length());
+        x.sort((S, b) => S.doorLine.length() - b.doorLine.length());
         for (let S = 1; S < x.length; S++) f.add(x[S]);
       }
     });
@@ -2368,18 +2368,18 @@ class Qe {
     });
     const y = [];
     return u.forEach((x) => {
-      const S = e.findIndex((g) => g.uuid === x.doorUuid), D = t.findIndex((g) => g.uuid === x.findUuid), C = e[S].point.clone(), m = t[D].point.clone(), E = this.findLongLineSegment(e[S].line), L = this.findLongLineSegment(t[D].line), M = E.projectPoint(m);
+      const S = e.findIndex((g) => g.uuid === x.doorUuid), b = t.findIndex((g) => g.uuid === x.findUuid), C = e[S].point.clone(), m = t[b].point.clone(), E = this.findLongLineSegment(e[S].line), L = this.findLongLineSegment(t[b].line), M = E.projectPoint(m);
       if (M) {
         C.copy(M);
-        const g = new B(C, m), b = L.includedAngle(g);
-        (b < 10 || b > 170 || Math.abs(90 - b) < 10) && y.push({
+        const g = new B(C, m), D = L.includedAngle(g);
+        (D < 10 || D > 170 || Math.abs(90 - D) < 10) && y.push({
           start: C,
           end: m
         });
       } else {
         const g = L.projectPoint(C);
         g && m.copy(g);
-        const b = new B(C, m), T = E.includedAngle(b);
+        const D = new B(C, m), T = E.includedAngle(D);
         (T < 10 || T > 170 || Math.abs(90 - T) < 10) && y.push({
           start: C,
           end: m
@@ -2520,8 +2520,8 @@ class et extends W {
     n.includedAngle(s) > 135 && (s.points = [s.points[1], s.points[0]]), this.addData(n.points[0], s.points[0]), this.addData(n.points[1], s.points[1]);
     const i = n.points[0].distance(s.points[0]), r = n.points[1].distance(s.points[1]), o = Math.ceil(Math.max(i, r) / t.width), a = i / o, l = r / o, c = s.points[0].direction(n.points[0]), h = s.points[1].direction(n.points[1]), f = n.points[0].clone(), u = n.points[1].clone(), p = u.direction(f);
     p.multiplyScalar(t.width * 0.5);
-    const y = f.clone().add(p), x = u.clone().add(p.multiplyScalar(-1)), S = f.direction(u), D = y.direction(x);
-    if (!(S.x > 0 && D.x < 0 || S.x < 0 && D.x > 0 || S.y > 0 && D.y < 0 || S.y < 0 && D.y > 0)) {
+    const y = f.clone().add(p), x = u.clone().add(p.multiplyScalar(-1)), S = f.direction(u), b = y.direction(x);
+    if (!(S.x > 0 && b.x < 0 || S.x < 0 && b.x > 0 || S.y > 0 && b.y < 0 || S.y < 0 && b.y > 0)) {
       f.set(y.x, y.y), u.set(x.x, x.y);
       for (let C = 1; C < o; C++) {
         const m = c.clone().multiplyScalar(a * C), E = h.clone().multiplyScalar(l * C), L = f.clone().add(m), M = u.clone().add(E);
@@ -2807,7 +2807,7 @@ class ee {
     }), this.register(function(e) {
       return new At(e);
     }), this.register(function(e) {
-      return new bt(e);
+      return new Dt(e);
     });
   }
   register(e) {
@@ -2969,10 +2969,10 @@ class dt {
       p.setUint32(0, u.byteLength, !0), p.setUint32(4, at, !0);
       const y = ie(ct(JSON.stringify(r)), 32), x = new DataView(new ArrayBuffer(ge));
       x.setUint32(0, y.byteLength, !0), x.setUint32(4, ot, !0);
-      const S = new ArrayBuffer(me), D = new DataView(S);
-      D.setUint32(0, it, !0), D.setUint32(4, rt, !0);
+      const S = new ArrayBuffer(me), b = new DataView(S);
+      b.setUint32(0, it, !0), b.setUint32(4, rt, !0);
       const C = me + x.byteLength + y.byteLength + p.byteLength + u.byteLength;
-      D.setUint32(8, C, !0);
+      b.setUint32(8, C, !0);
       const m = new Blob([
         S,
         x,
@@ -2983,7 +2983,7 @@ class dt {
       re(m).then((E) => {
         t(E);
       });
-    }) : r.buffers && r.buffers.length > 0 ? Dt(l).then((f) => {
+    }) : r.buffers && r.buffers.length > 0 ? bt(l).then((f) => {
       r.buffers[0].uri = f, t(r);
     }) : t(r);
   }
@@ -3066,7 +3066,7 @@ class dt {
   async buildMetalRoughTextureAsync(e, t) {
     if (e === t) return e;
     function n(u) {
-      return u.colorSpace === Fe ? function(y) {
+      return u.colorSpace === Ue ? function(y) {
         return y < 0.04045 ? y * 0.0773993808 : Math.pow(y * 0.9478672986 + 0.0521327014, 2.4);
       } : function(y) {
         return y;
@@ -3407,10 +3407,10 @@ class dt {
           L[e.morphTargetDictionary[M]] = M;
       for (let M = 0; M < e.morphTargetInfluences.length; ++M) {
         const g = {};
-        let b = !1;
+        let D = !1;
         for (const T in r.morphAttributes) {
           if (T !== "position" && T !== "normal") {
-            b || (console.warn("GLTFExporter: Only POSITION and NORMAL morph are supported."), b = !0);
+            D || (console.warn("GLTFExporter: Only POSITION and NORMAL morph are supported."), D = !0);
             continue;
           }
           const A = r.morphAttributes[T][M], P = T.toUpperCase(), R = r.attributes[T];
@@ -3420,7 +3420,7 @@ class dt {
           }
           const I = A.clone();
           if (!r.morphTargetsRelative)
-            for (let N = 0, U = A.count; N < U; N++)
+            for (let N = 0, F = A.count; N < F; N++)
               for (let O = 0; O < A.itemSize; O++)
                 O === 0 && I.setX(N, A.getX(N) - R.getX(N)), O === 1 && I.setY(N, A.getY(N) - R.getY(N)), O === 2 && I.setZ(N, A.getZ(N) - R.getZ(N)), O === 3 && I.setW(N, A.getW(N) - R.getW(N));
           g[P] = this.processAccessor(I, r), t.attributes.set(this.getUID(R, !0), g[P]);
@@ -3438,17 +3438,17 @@ class dt {
         m[E] = E;
       r.setIndex(m), x = !0;
     }
-    const S = y ? e.material : [e.material], D = y ? r.groups : [{ materialIndex: 0, start: void 0, count: void 0 }];
-    for (let m = 0, E = D.length; m < E; m++) {
+    const S = y ? e.material : [e.material], b = y ? r.groups : [{ materialIndex: 0, start: void 0, count: void 0 }];
+    for (let m = 0, E = b.length; m < E; m++) {
       const L = {
         mode: o,
         attributes: l
       };
       if (this.serializeUserData(r, L), h.length > 0 && (L.targets = h), r.index !== null) {
         let g = this.getUID(r.index);
-        (D[m].start !== void 0 || D[m].count !== void 0) && (g += ":" + D[m].start + ":" + D[m].count), t.attributes.has(g) ? L.indices = t.attributes.get(g) : (L.indices = this.processAccessor(r.index, r, D[m].start, D[m].count), t.attributes.set(g, L.indices)), L.indices === null && delete L.indices;
+        (b[m].start !== void 0 || b[m].count !== void 0) && (g += ":" + b[m].start + ":" + b[m].count), t.attributes.has(g) ? L.indices = t.attributes.get(g) : (L.indices = this.processAccessor(r.index, r, b[m].start, b[m].count), t.attributes.set(g, L.indices)), L.indices === null && delete L.indices;
       }
-      const M = await this.processMaterialAsync(S[D[m].materialIndex]);
+      const M = await this.processMaterialAsync(S[b[m].materialIndex]);
       M !== null && (L.material = M), c.push(L);
     }
     x === !0 && r.setIndex(null), a.primitives = c, n.meshes || (n.meshes = []), await this._invokeAllAsync(function(m) {
@@ -3540,7 +3540,7 @@ class dt {
       let y = c.values.length / c.times.length;
       u === ye.morphTargetInfluences && (y /= f.morphTargetInfluences.length);
       let x;
-      c.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline === !0 ? (x = "CUBICSPLINE", y /= 3) : c.getInterpolation() === Ue ? x = "STEP" : x = "LINEAR", o.push({
+      c.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline === !0 ? (x = "CUBICSPLINE", y /= 3) : c.getInterpolation() === Fe ? x = "STEP" : x = "LINEAR", o.push({
         input: this.processAccessor(new k(c.times, p)),
         output: this.processAccessor(new k(c.values, y)),
         interpolation: x
@@ -3891,7 +3891,7 @@ class At {
     i.bumpFactor = e.bumpScale, t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class bt {
+class Dt {
   constructor(e) {
     this.writer = e, this.name = "EXT_mesh_gpu_instancing";
   }
@@ -3981,9 +3981,15 @@ ee.Utils = {
     return e;
   }
 };
-async function Dt(d) {
-  const e = await d.arrayBuffer(), n = Buffer.from(e).toString("base64");
-  return `data:${d.type};base64,${n}`;
+async function bt(d) {
+  if (typeof FileReader > "u") {
+    const e = await d.arrayBuffer(), n = Buffer.from(e).toString("base64");
+    return `data:${d.type};base64,${n}`;
+  } else
+    return new Promise((e, t) => {
+      const n = new FileReader();
+      n.onload = () => e(n.result), n.onerror = () => t(new Error("Failed to read Blob as Data URL")), n.readAsDataURL(d);
+    });
 }
 async function re(d) {
   if (typeof d.arrayBuffer == "function")
@@ -4115,7 +4121,7 @@ class Ae extends W {
   async toGltfBlob(e = !0) {
     const t = await this.toGltf(e);
     if (t)
-      return new Blob([t], { type: "application/octet-stream" });
+      return e ? new Blob([t], { type: "application/octet-stream" }) : new Blob([JSON.stringify(t)], { type: "application/json" });
   }
   /**
    * 下载 OBJ
@@ -4150,7 +4156,7 @@ class Ae extends W {
     }
   }
 }
-class be extends W {
+class De extends W {
   static name = "DetailsPoint";
   Dxf = null;
   WhiteModel = null;
@@ -4227,7 +4233,7 @@ class be extends W {
     }, 50);
   }
 }
-class De extends W {
+class be extends W {
   static name = "DxfLineModel";
   dxfLineModel = new G.LineSegments();
   dxfDoorsLineModel = new G.LineSegments();
@@ -4252,8 +4258,8 @@ class De extends W {
 }
 const Nt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  DetailsPoint: be,
-  DxfLineModel: De,
+  DetailsPoint: De,
+  DxfLineModel: be,
   WhiteModel: Ae
 }, Symbol.toStringTag, { value: "Module" }));
 function Me(d, e = {}) {
@@ -4262,7 +4268,7 @@ function Me(d, e = {}) {
     whiteModel: n = !0,
     dxfLineModel: s = !0
   } = e;
-  s && d.addComponent(new De()), n && d.addComponent(new Ae()), t && d.addComponent(new be());
+  s && d.addComponent(new be()), n && d.addComponent(new Ae()), t && d.addComponent(new De());
 }
 const vt = Object.assign(Me, {
   create(d = {}) {
@@ -4323,7 +4329,7 @@ export {
   tt as T,
   Ee as V,
   Ae as W,
-  be as a,
+  De as a,
   ce as b,
   X as c,
   qt as d,