build-dxf 0.0.41 → 0.0.42

package/src/build.js

@@ -1,16 +1,16 @@
 import * as I from "three";
-import { EventDispatcher as Ot, Color as Ft, Matrix4 as bt, Vector3 as K, Quaternion as Gt, BufferAttribute as _, REVISION as Ut, CompressedTexture as nt, Source as zt, NoColorSpace as jt, MathUtils as ot, RGBAFormat as _t, ImageUtils as qt, DoubleSide as Yt, PropertyBinding as Z, InterpolateDiscrete as kt, Scene as ft, SRGBColorSpace as Vt, NearestFilter as Xt, NearestMipmapNearestFilter as Wt, NearestMipmapLinearFilter as Ht, LinearFilter as Jt, LinearMipmapNearestFilter as $t, LinearMipmapLinearFilter as Kt, ClampToEdgeWrapping as Zt, RepeatWrapping as Qt, MirroredRepeatWrapping as te, InterpolateLinear as ee } from "three";
+import { EventDispatcher as Ot, Color as Ft, Matrix4 as bt, Vector3 as Z, Quaternion as Ut, BufferAttribute as q, REVISION as Gt, CompressedTexture as st, Source as jt, NoColorSpace as zt, MathUtils as at, RGBAFormat as qt, ImageUtils as _t, DoubleSide as Yt, PropertyBinding as Q, InterpolateDiscrete as kt, Scene as ft, SRGBColorSpace as Xt, NearestFilter as Vt, NearestMipmapNearestFilter as Wt, NearestMipmapLinearFilter as Ht, LinearFilter as Jt, LinearMipmapNearestFilter as $t, LinearMipmapLinearFilter as Kt, ClampToEdgeWrapping as Zt, RepeatWrapping as Qt, MirroredRepeatWrapping as te, InterpolateLinear as ee } from "three";
 import pt from "clipper-lib";
 import $ from "dxf-writer";
 import { OBJExporter as ne } from "three/examples/jsm/exporters/OBJExporter.js";
-function at() {
-  return "xxxx-xxxx-4xxx-yxxx-xxxx".replace(/[xy]/g, function(d) {
-    var t = Math.random() * 16 | 0, e = d == "x" ? t : t & 3 | 8;
+function K() {
+  return "xxxx-xxxx-4xxx-yxxx-xxxx".replace(/[xy]/g, function(u) {
+    var t = Math.random() * 16 | 0, e = u == "x" ? t : t & 3 | 8;
     return e.toString(16);
   });
 }
 class It extends Ot {
-  uuid = at();
+  uuid = K();
   addEventListener(t, e, n) {
     const { once: s = !1 } = n ?? {}, i = (o) => {
       e(o), s && r();
@@ -30,7 +30,7 @@ class It extends Ot {
     e && (e.forEach((n) => n()), this.eventRecordStack.delete(t));
   }
 }
-class q extends It {
+class _ extends It {
   parent;
   destroyed = !1;
   constructor(...t) {
@@ -71,7 +71,7 @@ class se extends It {
    * @param component 
    */
   removeComponent(t) {
-    if (t instanceof q) {
+    if (t instanceof _) {
       const e = this.components.indexOf(t);
       e > -1 && (this.components.splice(e, 1), this.dispatchEvent({
         type: "removeComponent",
@@ -202,9 +202,9 @@ class N {
     const o = this.points;
     for (let c = 0; c < 4; c++) {
       const l = o[c], h = o[(c + 1) % 4];
-      for (let u = 0; u < 4; u++) {
-        const f = e[u], p = e[(u + 1) % 4], y = (h.x - l.x) * (f.y - l.y) - (h.y - l.y) * (f.x - l.x), x = (h.x - l.x) * (p.y - l.y) - (h.y - l.y) * (p.x - l.x), m = (p.x - f.x) * (l.y - f.y) - (p.y - f.y) * (l.x - f.x), L = (p.x - f.x) * (h.y - f.y) - (p.y - f.y) * (h.x - f.x);
-        if (y * x < 0 && m * L < 0 || y === 0 && Math.min(l.x, h.x) <= f.x && f.x <= Math.max(l.x, h.x) && Math.min(l.y, h.y) <= f.y && f.y <= Math.max(l.y, h.y) || x === 0 && Math.min(l.x, h.x) <= p.x && p.x <= Math.max(l.x, h.x) && Math.min(l.y, h.y) <= p.y && p.y <= Math.max(l.y, h.y) || m === 0 && Math.min(f.x, p.x) <= l.x && l.x <= Math.max(f.x, p.x) && Math.min(f.y, p.y) <= l.y && l.y <= Math.max(f.y, p.y) || L === 0 && Math.min(f.x, p.x) <= h.x && h.x <= Math.max(f.x, p.x) && Math.min(f.y, p.y) <= h.y && h.y <= Math.max(f.y, p.y))
+      for (let d = 0; d < 4; d++) {
+        const f = e[d], p = e[(d + 1) % 4], y = (h.x - l.x) * (f.y - l.y) - (h.y - l.y) * (f.x - l.x), x = (h.x - l.x) * (p.y - l.y) - (h.y - l.y) * (p.x - l.x), m = (p.x - f.x) * (l.y - f.y) - (p.y - f.y) * (l.x - f.x), D = (p.x - f.x) * (h.y - f.y) - (p.y - f.y) * (h.x - f.x);
+        if (y * x < 0 && m * D < 0 || y === 0 && Math.min(l.x, h.x) <= f.x && f.x <= Math.max(l.x, h.x) && Math.min(l.y, h.y) <= f.y && f.y <= Math.max(l.y, h.y) || x === 0 && Math.min(l.x, h.x) <= p.x && p.x <= Math.max(l.x, h.x) && Math.min(l.y, h.y) <= p.y && p.y <= Math.max(l.y, h.y) || m === 0 && Math.min(f.x, p.x) <= l.x && l.x <= Math.max(f.x, p.x) && Math.min(f.y, p.y) <= l.y && l.y <= Math.max(f.y, p.y) || D === 0 && Math.min(f.x, p.x) <= h.x && h.x <= Math.max(f.x, p.x) && Math.min(f.y, p.y) <= h.y && h.y <= Math.max(f.y, p.y))
           return !0;
       }
     }
@@ -216,9 +216,9 @@ class N {
     const a = (c) => {
       let l = 0;
       for (let h = 0; h < 4; h++) {
-        const u = e[h], f = e[(h + 1) % 4], p = (f.x - u.x) * (c.y - u.y) - (f.y - u.y) * (c.x - u.x);
+        const d = e[h], f = e[(h + 1) % 4], p = (f.x - d.x) * (c.y - d.y) - (f.y - d.y) * (c.x - d.x);
         if (p === 0) {
-          const y = Math.abs(f.x - u.x) > 1e-10 ? f.x - u.x : f.y - u.y, x = y ? (c.x - u.x) / y : 0;
+          const y = Math.abs(f.x - d.x) > 1e-10 ? f.x - d.x : f.y - d.y, x = y ? (c.x - d.x) / y : 0;
           if (x >= 0 && x <= 1) return !0;
         } else {
           const y = p > 0 ? 1 : -1;
@@ -465,7 +465,7 @@ class X {
     return null;
   }
 }
-class et {
+class nt {
   points;
   get p0() {
     return this.points[0];
@@ -523,8 +523,8 @@ class et {
         if (Math.max(p, y) >= 0 && Math.min(p, y) <= 1)
           return !0;
       } else {
-        const u = ((o.x - e.x) * l - (o.y - e.y) * c) / h, f = ((o.x - e.x) * i - (o.y - e.y) * s) / h;
-        if (u >= 0 && u <= 1 && f >= 0 && f <= 1)
+        const d = ((o.x - e.x) * l - (o.y - e.y) * c) / h, f = ((o.x - e.x) * i - (o.y - e.y) * s) / h;
+        if (d >= 0 && d <= 1 && f >= 0 && f <= 1)
           return !0;
       }
     }
@@ -616,7 +616,7 @@ class et {
    */
   static fromByLineSegment(t, e = 0.1, n = !1, s = 0.5) {
     const i = t.points[0], r = t.points[1], o = r.normal(i), a = n ? r.direction(i).mutiplyScalar(e * s) : M.zero(), c = n ? i.direction(r).mutiplyScalar(e * s) : M.zero(), l = o.x * e * 0.5, h = o.y * e * 0.5;
-    return new et([
+    return new nt([
       new M(i.x + l, i.y + h).add(c),
       new M(r.x + l, r.y + h).add(a),
       new M(r.x - l, r.y - h).add(a),
@@ -737,7 +737,7 @@ class A {
       new M(n.x - a, n.y - c).add(o),
       new M(s.x - a, s.y - c).add(r)
     ];
-    return new et([0, 1, 3, 2].map((h) => l[h]));
+    return new nt([0, 1, 3, 2].map((h) => l[h]));
   }
   /**
    * 计算线段的长度
@@ -778,7 +778,7 @@ class A {
     if (r.x === 0 && r.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
     const o = (p) => {
-      const y = new M(p.x - s.x, p.y - s.y), x = r.x * r.x + r.y * r.y, L = (y.x * r.x + y.y * r.y) / x, w = s.x + L * r.x, g = s.y + L * r.y;
+      const y = new M(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, w = s.x + D * r.x, g = s.y + D * r.y;
       return new M(w, g);
     };
     let a = o(e), c = o(n);
@@ -786,12 +786,12 @@ class A {
       const y = new M(p.x - s.x, p.y - s.y), x = r.x * r.x + r.y * r.y;
       return (y.x * r.x + y.y * r.y) / x;
     };
-    let h = l(a), u = l(c);
+    let h = l(a), d = l(c);
     const f = (p) => {
       const y = Math.max(0, Math.min(1, p)), x = s.x + y * r.x, m = s.y + y * r.y;
       return new M(x, m);
     };
-    return (h < 0 || h > 1) && (a = f(h)), (u < 0 || u > 1) && (c = f(u)), a.x === c.x && a.y === c.y ? new A(a, a) : new A(a, c);
+    return (h < 0 || h > 1) && (a = f(h)), (d < 0 || d > 1) && (c = f(d)), a.x === c.x && a.y === c.y ? new A(a, a) : new A(a, c);
   }
   /**
    * 计算一条线段在另一条直线上的投影
@@ -804,13 +804,13 @@ class A {
     if (i.x === 0 && i.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
     let o = ((l) => {
-      const h = new M(l.x - n.x, l.y - n.y), u = i.x * i.x + i.y * i.y, p = (h.x * i.x + h.y * i.y) / u, y = n.x + p * i.x, x = n.y + p * i.y;
+      const h = new M(l.x - n.x, l.y - n.y), d = i.x * i.x + i.y * i.y, p = (h.x * i.x + h.y * i.y) / d, y = n.x + p * i.x, x = n.y + p * i.y;
       return new M(y, x);
     })(t);
     if (!e) return o;
     let c = ((l) => {
-      const h = new M(l.x - n.x, l.y - n.y), u = i.x * i.x + i.y * i.y;
-      return (h.x * i.x + h.y * i.y) / u;
+      const h = new M(l.x - n.x, l.y - n.y), d = i.x * i.x + i.y * i.y;
+      return (h.x * i.x + h.y * i.y) / d;
     })(o);
     return c < 0 || c > 1 ? null : o;
   }
@@ -828,8 +828,8 @@ class A {
     function a(f, p, y) {
       return Math.min(p.x, y.x) - 1e-10 <= f.x && f.x <= Math.max(p.x, y.x) + 1e-10 && Math.min(p.y, y.y) - 1e-10 <= f.y && f.y <= Math.max(p.y, y.y) + 1e-10;
     }
-    const c = o(n, s, i), l = o(n, s, r), h = o(i, r, n), u = o(i, r, s);
-    return !!(c * l < 0 && h * u < 0 || e && (Math.abs(c) < 1e-10 && a(i, n, s) || Math.abs(l) < 1e-10 && a(r, n, s) || Math.abs(h) < 1e-10 && a(n, i, r) || Math.abs(u) < 1e-10 && a(s, i, r)));
+    const c = o(n, s, i), l = o(n, s, r), h = o(i, r, n), d = o(i, r, s);
+    return !!(c * l < 0 && h * d < 0 || e && (Math.abs(c) < 1e-10 && a(i, n, s) || Math.abs(l) < 1e-10 && a(r, n, s) || Math.abs(h) < 1e-10 && a(n, i, r) || Math.abs(d) < 1e-10 && a(s, i, r)));
   }
   /**
    * 判断一个点是否在线段上（含端点）
@@ -931,8 +931,8 @@ class A {
       if (l > 1)
         return n.distance(r);
       {
-        const h = i.x + l * o, u = i.y + l * a;
-        return n.distance(new M(h, u));
+        const h = i.x + l * o, d = i.y + l * a;
+        return n.distance(new M(h, d));
       }
     };
     return Math.min(
@@ -983,8 +983,8 @@ class A {
     const n = /* @__PURE__ */ new Set();
     function s(r, o, a) {
       if (o.has(r)) return;
-      const c = e.queryPoint(r.start).filter((f) => f.userData !== r && r.parallel(f.userData, 0.1)), l = e.queryPoint(r.end).filter((f) => f.userData !== r && r.parallel(f.userData, 0.1)), h = c[0]?.userData, u = l[0]?.userData;
-      return h && !a.has(h) && (a.add(h), s(h, o, a)), u && !a.has(u) && (a.add(u), s(u, o, a)), o.add(r), a;
+      const c = e.queryPoint(r.start).filter((f) => f.userData !== r && r.parallel(f.userData, 0.1)), l = e.queryPoint(r.end).filter((f) => f.userData !== r && r.parallel(f.userData, 0.1)), h = c[0]?.userData, d = l[0]?.userData;
+      return h && !a.has(h) && (a.add(h), s(h, o, a)), d && !a.has(d) && (a.add(d), s(d, o, a)), o.add(r), a;
     }
     const i = [];
     for (let r = 0; r < t.length; r++) {
@@ -1001,14 +1001,14 @@ class A {
    */
   static mergeLinesByMaxlength(...t) {
     if (t.length === 1) return t[0];
-    const n = t.slice(0).sort((h, u) => u.length() - h.length())[0], s = n.direction().normalize();
+    const n = t.slice(0).sort((h, d) => d.length() - h.length())[0], s = n.direction().normalize();
     let i = n.start.clone(), r = n.end.clone();
     const o = (h) => h.x * s.x + h.y * s.y;
     let a = o(i), c = o(r);
     for (const h of t)
-      for (const u of h.points) {
-        const f = o(u);
-        f < a && (a = f, i = n.projectPoint(u, !1)), f > c && (c = f, r = n.projectPoint(u, !1));
+      for (const d of h.points) {
+        const f = o(d);
+        f < a && (a = f, i = n.projectPoint(d, !1)), f > c && (c = f, r = n.projectPoint(d, !1));
       }
     const l = new A(i, r);
     return t.forEach((h) => h.userData.fittedLine = l), l;
@@ -1029,7 +1029,7 @@ class A {
       const y = p.x * s.x + p.y * s.y;
       i = Math.min(i, y), r = Math.max(r, y), o += p.x, a += p.y;
     });
-    const c = new M(o / n.length, a / n.length), l = c.x * s.x + c.y * s.y, h = new M(c.x + (i - l) * s.x, c.y + (i - l) * s.y), u = new M(c.x + (r - l) * s.x, c.y + (r - l) * s.y), f = new A(h, u);
+    const c = new M(o / n.length, a / n.length), l = c.x * s.x + c.y * s.y, h = new M(c.x + (i - l) * s.x, c.y + (i - l) * s.y), d = new M(c.x + (r - l) * s.x, c.y + (r - l) * s.y), f = new A(h, d);
     return t.forEach((p) => p.userData.fittedLine = f), f;
   }
   /** 合并满足平行的线段
@@ -1236,6 +1236,16 @@ class M {
     const o = s / (i * r), a = Math.max(-1, Math.min(1, o));
     return e === "radian" ? Math.acos(a) : e === "cos" ? a : n === "180" || this.cross(t) < 0 ? Math.acos(a) / (Math.PI / 180) : 360 - Math.acos(a) / (Math.PI / 180);
   }
+  /** 
+   * @param point 
+   * @returns 
+   */
+  angleBetween2(t) {
+    const e = Math.hypot(this.x, this.y), n = Math.hypot(t.x, t.y);
+    if (e === 0 || n === 0) return 0;
+    const s = this.x * t.x + this.y * t.y, i = this.x * t.y - this.y * t.x;
+    return Math.atan2(i, s);
+  }
   /** 获取向量长度
    */
   length() {
@@ -1279,13 +1289,13 @@ class M {
     return new M(0, 0);
   }
 }
-async function Y(d, t = !0) {
+async function Y(u, t = !0) {
   if (typeof global < "u" && typeof require < "u")
-    return require(d);
+    return require(u);
   {
     let e = await import(
       /* @vite-ignore */
-      d
+      u
     );
     return t && (e = e.default), e;
   }
@@ -1432,8 +1442,8 @@ class F {
       const [r, o] = i.line.points, a = o.x - r.x, c = o.y - r.y, l = a * a + c * c;
       let h = ((t.x - r.x) * a + (t.y - r.y) * c) / l;
       h = Math.max(0, Math.min(1, h));
-      const u = r.x + h * a, f = r.y + h * c;
-      t.distance(new M(u, f)) <= e && n.push(i);
+      const d = r.x + h * a, f = r.y + h * c;
+      t.distance(new M(d, f)) <= e && n.push(i);
     }
     if (!this.isLeaf)
       for (const i of this.children)
@@ -1501,9 +1511,9 @@ class F {
     })), t;
   }
 }
-function J(d, t = 0, e) {
-  return e || (e = new F(N.fromByLineSegment(...d)), d.forEach((n) => e?.insert({ line: n, userData: void 0 }))), d.map((n) => {
-    const s = n.userData, i = s.drawWindow, r = e.queryLineSegment(n).filter((o) => o.line !== n && !o.userData?.isDoor).map((o) => ({ index: d.indexOf(o.line) }));
+function J(u, t = 0, e) {
+  return e || (e = new F(N.fromByLineSegment(...u)), u.forEach((n) => e?.insert({ line: n, userData: void 0 }))), u.map((n) => {
+    const s = n.userData, i = s.drawWindow, r = e.queryLineSegment(n).filter((o) => o.line !== n && !o.userData?.isDoor).map((o) => ({ index: u.indexOf(o.line) }));
     return {
       start: n.start.toJson(t),
       end: n.end.toJson(t),
@@ -1523,9 +1533,9 @@ function J(d, t = 0, e) {
     };
   });
 }
-function lt(d, t = 0.03) {
-  const e = new F(N.fromByLineSegment(...d));
-  return d.forEach((n) => e.insert({ line: n, userData: void 0 })), d.flatMap((n) => {
+function lt(u, t = 0.03) {
+  const e = new F(N.fromByLineSegment(...u));
+  return u.forEach((n) => e.insert({ line: n, userData: void 0 })), u.flatMap((n) => {
     const s = e.queryLineSegment(n, !0).map((i) => {
       if (i.line === n) return;
       const r = i.line.getIntersection(n);
@@ -1544,8 +1554,8 @@ function lt(d, t = 0.03) {
     return n;
   }).filter((n) => n.length() >= t);
 }
-function Q(...d) {
-  d.forEach((t) => {
+function tt(...u) {
+  u.forEach((t) => {
     const e = t.direction();
     t.userData.drawWindow?.forEach((n) => {
       try {
@@ -1562,23 +1572,54 @@ function Q(...d) {
     });
   });
 }
-function ie(d) {
-  const t = new X(), e = new F(N.fromByLineSegment(...d)), n = [];
-  return d.forEach((s) => {
+function ie(u, t = 0.1, e) {
+  e || (e = new X(), u.forEach((i) => {
+    i.userData.isDoor || i.points.forEach((r) => e?.insert(r, i));
+  }));
+  const n = [], s = /* @__PURE__ */ new Set();
+  for (let i = 0; i < u.length; i++) {
+    const r = u[i], o = /* @__PURE__ */ new Map();
+    r.userData.isDoor || r.points.forEach((a) => {
+      if (s.has(a)) return !1;
+      if (e.queryPoint(a).length > 1) return;
+      const c = e.queryCircle(a, t).filter((y) => {
+        if (s.has(y.point)) return !1;
+        const x = y.userData;
+        if (x === r || !r.parallel(x, 25) || e.queryPoint(y.point).length > 1) return !1;
+        const m = a.distance(y.point);
+        if (m < 1e-3) return !1;
+        const D = a.direction(r.getAnotherPoint(a)), w = y.point.direction(x.getAnotherPoint(y.point));
+        if (180 - D.angleBetween(w, "angle") < 25)
+          return o.set(y.point, m), !0;
+      }).sort((y, x) => {
+        const m = o.get(y.point), D = o.get(x.point);
+        return m - D;
+      });
+      if (c.length === 0) return;
+      s.add(a), s.add(c[0].point);
+      const l = c[0].userData, h = r.projectLineSegment(l), d = l.projectLineSegment(r), f = h.length(), p = d.length();
+      f === 0 && p === 0 ? n.push(new A(a.clone(), c[0].point.clone())) : n.push(new A(h.center, d.center));
+    });
+  }
+  return [...u, ...n];
+}
+function re(u) {
+  const t = new X(), e = new F(N.fromByLineSegment(...u)), n = [];
+  return u.forEach((s) => {
     s.userData.isDoor ? n.push(s) : (s.points.forEach((i) => t.insert(i, s)), e.insert({ line: s, userData: void 0 }));
   }), n.forEach((s) => {
     const i = t.queryPoint(s.start), r = t.queryPoint(s.end);
     i.length ? s.userData.startIntersection = i[0].userData : s.userData.startIntersection = e.queryPoint(s.start)[0]?.line, r.length ? s.userData.endIntersection = r[0].userData : s.userData.endIntersection = e.queryPoint(s.end)[0]?.line;
-  }), d;
+  }), u = ie(u, 0.3, t), u;
 }
-function re(d) {
-  const t = new F(N.fromByLineSegment(...d));
-  d.forEach((n) => {
+function oe(u) {
+  const t = new F(N.fromByLineSegment(...u));
+  u.forEach((n) => {
     n.userData.isDoor || t.insert({ line: n, userData: void 0 });
   });
   const e = /* @__PURE__ */ new Map();
-  for (let n = 0; n < d.length; n++) {
-    const s = d[n], i = t.queryLineSegment(s).filter((r) => r.line !== s).map((r) => {
+  for (let n = 0; n < u.length; n++) {
+    const s = u[n], i = t.queryLineSegment(s).filter((r) => r.line !== s).map((r) => {
       const o = s.getSameEndpoint(r.line) ?? [];
       return {
         line: r.line,
@@ -1591,59 +1632,59 @@ function re(d) {
   }
   return e;
 }
-function oe(d, t, e, n = 15) {
-  const s = [d], i = [], r = [], o = [];
-  function a(u) {
-    const f = Math.atan2(u.end.y - u.start.y, u.end.x - u.start.x);
-    let y = Math.atan2(d.end.y - d.start.y, d.end.x - d.start.x) - f;
+function ae(u, t, e, n = 15) {
+  const s = [u], i = [], r = [], o = [];
+  function a(d) {
+    const f = Math.atan2(d.end.y - d.start.y, d.end.x - d.start.x);
+    let y = Math.atan2(u.end.y - u.start.y, u.end.x - u.start.x) - f;
     for (; y > Math.PI; ) y -= 2 * Math.PI;
     for (; y < -Math.PI; ) y += 2 * Math.PI;
-    const x = u.center;
-    return u.start.rotate(x, y), u.end.rotate(x, y), u.userData.isDoor ? r.push(u) : s.push(u), u;
+    const x = d.center;
+    return d.start.rotate(x, y), d.end.rotate(x, y), d.userData.isDoor ? r.push(d) : s.push(d), d;
   }
-  function c(u) {
-    const f = Math.atan2(u.end.y - u.start.y, u.end.x - u.start.x), p = Math.atan2(d.end.y - d.start.y, d.end.x - d.start.x);
+  function c(d) {
+    const f = Math.atan2(d.end.y - d.start.y, d.end.x - d.start.x), p = Math.atan2(u.end.y - u.start.y, u.end.x - u.start.x);
     let y = p + Math.PI / 2 - f, x = p - Math.PI / 2 - f;
     for (; y > Math.PI; ) y -= 2 * Math.PI;
     for (; y < -Math.PI; ) y += 2 * Math.PI;
     for (; x > Math.PI; ) x -= 2 * Math.PI;
     for (; x < -Math.PI; ) x += 2 * Math.PI;
-    const m = Math.abs(y) < Math.abs(x) ? y : x, L = u.center;
-    return u.start.rotate(L, m), u.end.rotate(L, m), u.userData.isDoor ? r.push(u) : i.push(u), u;
+    const m = Math.abs(y) < Math.abs(x) ? y : x, D = d.center;
+    return d.start.rotate(D, m), d.end.rotate(D, m), d.userData.isDoor ? r.push(d) : i.push(d), d;
   }
-  function l(u, f, p = !1) {
-    if (p) return l(u === "parallel" ? "vertical" : "parallel", f);
-    u === "parallel" ? a(f) : c(f);
+  function l(d, f, p = !1) {
+    if (p) return l(d === "parallel" ? "vertical" : "parallel", f);
+    d === "parallel" ? a(f) : c(f);
   }
   const h = [];
-  for (let u = 0; u < t.length; u++) {
-    const f = t[u];
-    if (d !== f)
-      if (f.userData.isWindow && o.push(f), f.parallel(d, n)) a(f);
-      else if (f.vertical(d, n)) c(f);
+  for (let d = 0; d < t.length; d++) {
+    const f = t[d];
+    if (u !== f)
+      if (f.userData.isWindow && o.push(f), f.parallel(u, n)) a(f);
+      else if (f.vertical(u, n)) c(f);
       else {
         const y = e.get(f)?.reduce((x, m) => (m.sourcePoint && (x.has(m.sourcePoint) || x.set(m.sourcePoint, []), x.get(m.sourcePoint)?.push(m)), x), /* @__PURE__ */ new Map());
         y && y.size > 1 ? h.push(() => {
           const x = [...y.values()].map(
             (w) => w.map((g) => s.includes(g.line) ? "parallel" : i.includes(g.line) ? "vertical" : null).filter((g) => !!g)
-          ).map((w) => [...new Set(w)]), m = x[0], L = x[1];
-          if (m.length === 1 && L.length === 1) {
-            if (m[0] === L[0]) return l(m[0], f, !0);
+          ).map((w) => [...new Set(w)]), m = x[0], D = x[1];
+          if (m.length === 1 && D.length === 1) {
+            if (m[0] === D[0]) return l(m[0], f, !0);
             if (m.length === 1) {
-              if (L.includes(m[0])) return l(m[0], f, !0);
-              if (L.length === 1 && m.includes(L[0]))
-                return l(L[0], f, !0);
+              if (D.includes(m[0])) return l(m[0], f, !0);
+              if (D.length === 1 && m.includes(D[0]))
+                return l(D[0], f, !0);
             }
           }
           c(f);
         }) : c(f);
       }
   }
-  return h.forEach((u) => u()), { parallelLines: s, verticalLines: i, doorLines: r, windowLines: o };
+  return h.forEach((d) => d()), { parallelLines: s, verticalLines: i, doorLines: r, windowLines: o };
 }
-function yt(d, t, e, n, s) {
+function yt(u, t, e, n, s) {
   const i = [], r = /* @__PURE__ */ new Map();
-  d.forEach((c) => {
+  u.forEach((c) => {
     const l = e.projectPoint(c.start, !1);
     l && (l.userData = c, i.push(l), r.set(c, l));
   }), i.sort((c, l) => l.distance(e.start) - c.distance(e.start));
@@ -1665,39 +1706,39 @@ function yt(d, t, e, n, s) {
       });
     });
     l.sort((p, y) => p.distance(t.start) - y.distance(t.start));
-    const h = /* @__PURE__ */ new Map(), u = [];
+    const h = /* @__PURE__ */ new Map(), d = [];
     let f = [];
     return l.forEach((p, y) => {
-      h.size === 0 && y > 0 && l[y - 1].distance(p) > n && (f.push([...u]), u.length = 0), h.set(p.userData, (h.get(p.userData) ?? 0) + 1);
+      h.size === 0 && y > 0 && l[y - 1].distance(p) > n && (f.push([...d]), d.length = 0), h.set(p.userData, (h.get(p.userData) ?? 0) + 1);
       for (const x of h.values()) if (x !== 2) return;
-      u.push(...h.keys()), h.clear();
-    }), f.push([...u]), f;
+      d.push(...h.keys()), h.clear();
+    }), f.push([...d]), f;
   });
 }
-function xt(d, t, e, n) {
+function xt(u, t, e, n) {
   const s = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), o = [];
-  d.forEach((u) => {
-    const f = e.projectPoint(u.start, !1);
-    f && (f.userData = u, s.set(u, f), o.push(f)), u.points.forEach((p, y) => {
+  u.forEach((d) => {
+    const f = e.projectPoint(d.start, !1);
+    f && (f.userData = d, s.set(d, f), o.push(f)), d.points.forEach((p, y) => {
       const x = t.projectPoint(p, !1);
-      x && (x.userData = u, y === 0 ? i.set(u, x) : r.set(u, x));
+      x && (x.userData = d, y === 0 ? i.set(d, x) : r.set(d, x));
     });
-  }), o.sort((u, f) => f.distance(e.start) - u.distance(e.start));
-  const a = o.map((u) => {
-    const f = u.userData, p = i.get(f), y = r.get(f), x = new A(p, y), m = [];
-    for (let L = 0; L < o.length; L++) {
-      const w = o[L];
-      if (u !== w && u.distance(w) < n) {
-        const g = w.userData, S = i.get(g), D = r.get(g);
-        (x.isPointOnSegment(S) || x.isPointOnSegment(D)) && m.push(L);
+  }), o.sort((d, f) => f.distance(e.start) - d.distance(e.start));
+  const a = o.map((d) => {
+    const f = d.userData, p = i.get(f), y = r.get(f), x = new A(p, y), m = [];
+    for (let D = 0; D < o.length; D++) {
+      const w = o[D];
+      if (d !== w && d.distance(w) < n) {
+        const g = w.userData, S = i.get(g), E = r.get(g);
+        (x.isPointOnSegment(S) || x.isPointOnSegment(E)) && m.push(D);
       }
     }
     return m;
   });
-  function c(u, f, p = /* @__PURE__ */ new Set()) {
-    if (p.has(u)) return p;
-    const y = f[u];
-    p.add(u);
+  function c(d, f, p = /* @__PURE__ */ new Set()) {
+    if (p.has(d)) return p;
+    const y = f[d];
+    p.add(d);
     for (let x = 0; x < y.length; x++) {
       const m = y[x];
       c(m, f, p);
@@ -1705,9 +1746,9 @@ function xt(d, t, e, n) {
     return p;
   }
   const l = /* @__PURE__ */ new Set(), h = [];
-  for (let u = 0; u < o.length; u++) {
-    if (l.has(u)) continue;
-    const f = c(u, a), p = [];
+  for (let d = 0; d < o.length; d++) {
+    if (l.has(d)) continue;
+    const f = c(d, a), p = [];
     if (f.forEach((y) => {
       l.add(y), p.push(o[y].userData);
     }), p.length > 2) {
@@ -1715,16 +1756,16 @@ function xt(d, t, e, n) {
       y.sort((w, g) => g.distance(e.start) - w.distance(e.start));
       const x = y[0], m = y[y.length - 1];
       if (x.distance(m) > n) {
-        const w = [...p].sort((C, U) => U.length() - C.length()), g = w[0], S = w[1], D = s.get(g), E = s.get(S), b = g.length(), R = S.length(), P = g.projectLineSegment(S), B = P.length();
-        if (D.distance(E) || R / b > 0.5 && B / R < 0.5) {
-          const C = [g], U = [S];
+        const w = [...p].sort((C, G) => G.length() - C.length()), g = w[0], S = w[1], E = s.get(g), L = s.get(S), b = g.length(), R = S.length(), P = g.projectLineSegment(S), B = P.length();
+        if (E.distance(L) || R / b > 0.5 && B / R < 0.5) {
+          const C = [g], G = [S];
           for (let O = 0; O < y.length; O++) {
             const v = y[O], V = v.userData;
-            if (v === D || v === E) continue;
-            const z = S.projectLineSegment(V), W = z.length();
-            E.distance(v) <= n && W / R > 0 ? U.push(V) : C.push(V);
+            if (v === E || v === L) continue;
+            const j = S.projectLineSegment(V), W = j.length();
+            L.distance(v) <= n && W / R > 0 ? G.push(V) : C.push(V);
           }
-          h.push(C, U);
+          h.push(C, G);
         } else {
           const C = Math.floor(p.length * 0.5);
           h.push(p.slice(0, C), p.slice(C));
@@ -1736,7 +1777,7 @@ function xt(d, t, e, n) {
   }
   return h;
 }
-function gt(d, t) {
+function gt(u, t) {
   function e(i, r = /* @__PURE__ */ new Set()) {
     if (r.has(i)) return r;
     r.add(i);
@@ -1749,49 +1790,49 @@ function gt(d, t) {
     return r;
   }
   const n = /* @__PURE__ */ new Set(), s = [];
-  for (let i = 0; i < d.length; i++) {
-    const r = d[i];
+  for (let i = 0; i < u.length; i++) {
+    const r = u[i];
     if (n.has(r)) continue;
     const o = e(r);
     s.push([...o]);
   }
   return s;
 }
-function ae(d, t, e, n, s, i) {
+function ce(u, t, e, n, s, i) {
   const {
     principalAxisThreshold: r = 0.3,
     crossAxistThreshold: o = 0.06,
     groupMethod: a = "principalAndCross"
   } = i ?? {}, c = {
     cross: () => [
-      ...xt(d, n, e, o),
+      ...xt(u, n, e, o),
       ...xt(t, e, n, o)
     ],
     principalAndCross: () => [
-      ...yt(d, n, e, r, o),
+      ...yt(u, n, e, r, o),
       ...yt(t, e, n, r, o)
     ],
     originalInterPoint: () => [
-      ...gt(d, s),
+      ...gt(u, s),
       ...gt(t, s)
     ]
   };
   return c[a] ? c[a]() : c.originalInterPoint();
 }
-function ce(d, t) {
+function le(u, t) {
   const e = /* @__PURE__ */ new Set();
-  return d.forEach((n) => {
+  return u.forEach((n) => {
     for (let s = 1; s < n.length; s++) {
       const i = n[s], r = n[s - 1];
       [...t.get(i) ?? [], ...t.get(r) ?? []].forEach((a) => {
         (a.line.sameEndpointAsStart(i) && a.line.sameEndpointAsEnd(r) || a.line.sameEndpointAsStart(r) && a.line.sameEndpointAsEnd(i)) && e.add(a);
       });
     }
-  }), d.map((n) => n.filter((s) => !e.has(s)));
+  }), u.map((n) => n.filter((s) => !e.has(s)));
 }
-function le(d, t = 0.1, e) {
+function he(u, t = 0.1, e) {
   const { fittingMethod: n = "average" } = e ?? {};
-  return d.map((s) => {
+  return u.map((s) => {
     if (s.length === 0) return;
     if (s.length === 1) return s[0];
     const i = [];
@@ -1799,34 +1840,34 @@ function le(d, t = 0.1, e) {
     const r = n === "average" ? A.mergeLines(...s) : A.mergeLinesByMaxlength(...s);
     r.userData.rooftopPz = Math.min(
       ...s.map((h) => {
-        const { drawDoorData: u, drawWindow: f, rooftopPz: p, ...y } = h.userData;
+        const { drawDoorData: d, drawWindow: f, rooftopPz: p, ...y } = h.userData;
         return Object.assign(r.userData, y), p ?? 1 / 0;
       })
     ), r.userData.rooftopPz === 1 / 0 && (r.userData.rooftopPz = 0);
     let o = 1 / 0, a = -1 / 0;
     const c = s[0].normal().normalize();
     o = 1 / 0, a = -1 / 0, i.forEach((h) => {
-      const u = h.x * c.x + h.y * c.y;
-      o = Math.min(o, u), a = Math.max(a, u);
+      const d = h.x * c.x + h.y * c.y;
+      o = Math.min(o, d), a = Math.max(a, d);
     });
     const l = a - o;
     return l >= t && (r.userData.wallWidth = l), s.forEach((h) => h.userData.fittedLine = r), r;
   }).filter((s) => !!s);
 }
-function mt(d, t = 0.4) {
-  const e = new F(N.fromByLineSegment(...d));
-  d.forEach((s) => e.insert(s));
+function mt(u, t = 0.4) {
+  const e = new F(N.fromByLineSegment(...u));
+  u.forEach((s) => e.insert(s));
   const n = new A();
-  for (let s = 0; s < d.length; s++) {
-    const i = d[s];
+  for (let s = 0; s < u.length; s++) {
+    const i = u[s];
     if (i.userData.isAdsorbed) continue;
     const r = i.direction().multiplyScalar(t), [o, a] = i.points.map((c) => {
       n.set(c, c), n.start.add(r), n.end.add(r.multiplyScalar(-1));
-      const l = /* @__PURE__ */ new Map(), h = e.queryLineSegment(n).filter((u) => u.line !== i).map((u) => {
-        const f = u.line.getIntersection(n);
-        return l.set(u.line, f), u.line;
-      }).sort((u, f) => {
-        const p = l.get(u), y = l.get(f);
+      const l = /* @__PURE__ */ new Map(), h = e.queryLineSegment(n).filter((d) => d.line !== i).map((d) => {
+        const f = d.line.getIntersection(n);
+        return l.set(d.line, f), d.line;
+      }).sort((d, f) => {
+        const p = l.get(d), y = l.get(f);
         return p && y ? p.distance(c) - y.distance(c) : 0;
       });
       return h.length ? l.get(h[0]) : void 0;
@@ -1841,22 +1882,22 @@ function mt(d, t = 0.4) {
     } else o ? i.directionMove(o.direction(i.start), i.start.distance(o)) : a && i.directionMove(a.direction(i.end), i.end.distance(a));
     e.update(i);
   }
-  return d.filter((s) => s.length() > 1e-3);
+  return u.filter((s) => s.length() > 1e-3);
 }
-function he(d, t) {
+function ue(u, t) {
   const e = new X();
-  d.forEach((i) => i.points.forEach((r) => e.insert(r, i)));
+  u.forEach((i) => i.points.forEach((r) => e.insert(r, i)));
   const n = /* @__PURE__ */ new Map();
   function s(i, r) {
     n.has(i) || n.set(i, []), n.get(i)?.push(r);
   }
-  for (let i = 0; i < d.length; i++) {
-    const r = d[i];
+  for (let i = 0; i < u.length; i++) {
+    const r = u[i];
     r.points.forEach((o) => {
       if (e.queryPoint(o).filter((h) => h.userData !== r).length !== 0) return;
       const a = e.queryCircle(o, t).filter((h) => h.userData !== r && h.userData?.vertical(r));
       if (!a.length) return;
-      const c = a.sort((h, u) => h.userData.length() - u.userData.length())[0], l = c.userData?.projectPoint(o, !1);
+      const c = a.sort((h, d) => h.userData.length() - d.userData.length())[0], l = c.userData?.projectPoint(o, !1);
       if (l) {
         const h = c.userData;
         s(r, new A(o.clone(), l.clone())), s(h, new A(c.point.clone(), l.clone()));
@@ -1866,23 +1907,23 @@ function he(d, t) {
   return n.forEach((i, r) => {
     const o = A.mergeLines(r, ...i);
     r.set(o.start, o.end);
-  }), d;
+  }), u;
 }
-function ue(d, t) {
+function de(u, t) {
   const { snapThreshold: e = 0.2 } = t ?? {};
-  return d = mt(d, e), d = mt(d, e), d = he(d, e), d;
+  return u = mt(u, e), u = mt(u, e), u = ue(u, e), u;
 }
-function de(d) {
+function fe(u) {
   const t = /* @__PURE__ */ new Set();
-  for (let e = 0; e < d.length; e++) {
-    const n = d[e], s = n.userData.fittedLine;
-    s ? (t.add(s), s.userData.isWindow = !0, s.userData.drawWindow || (s.userData.drawWindow = []), s.userData.drawWindow.push(...n.userData.drawWindow ?? [])) : Q(n);
+  for (let e = 0; e < u.length; e++) {
+    const n = u[e], s = n.userData.fittedLine;
+    s ? (t.add(s), s.userData.isWindow = !0, s.userData.drawWindow || (s.userData.drawWindow = []), s.userData.drawWindow.push(...n.userData.drawWindow ?? [])) : tt(n);
   }
-  t.forEach((e) => Q(e));
+  t.forEach((e) => tt(e));
 }
-function fe(d) {
-  for (let t = 0; t < d.length; t++) {
-    const e = d[t];
+function pe(u) {
+  for (let t = 0; t < u.length; t++) {
+    const e = u[t];
     let { endIntersection: n, startIntersection: s } = e.userData;
     if (!(!n || !s)) {
       if (s.userData.fittedLine && (s = s.userData.fittedLine), n.userData.fittedLine && (n = n.userData.fittedLine), e.parallel(s))
@@ -1899,11 +1940,11 @@ function fe(d) {
       }
     }
   }
-  return d;
+  return u;
 }
-function pe(d, t = 0.01) {
+function ye(u, t = 0.01) {
   const e = new X();
-  return d.forEach((n) => n.points.forEach((s) => e.insert(s, n))), d.filter((n) => {
+  return u.forEach((n) => n.points.forEach((s) => e.insert(s, n))), u.filter((n) => {
     if (n.length() <= t) {
       const s = e.queryPoint(n.start).filter((r) => r.userData !== n).length === 0, i = e.queryPoint(n.end).filter((r) => r.userData !== n).length === 0;
       if (s || i) return !1;
@@ -1919,37 +1960,37 @@ class Pt {
    * @returns 
    */
   static correction(t, e, n) {
-    t = ie(t.map((x) => x.clone()));
-    const s = re(t), { parallelLines: i, verticalLines: r, doorLines: o, windowLines: a } = oe(e, t, s, 25), c = e.normal(), l = e.center, h = e.direction(), u = new A(
+    t = re(t.map((x) => x.clone()));
+    const s = oe(t), { parallelLines: i, verticalLines: r, doorLines: o, windowLines: a } = ae(e, t, s, 25), c = e.normal(), l = e.center, h = e.direction(), d = new A(
       l.clone().add(c.clone().multiplyScalar(-1e3)),
       l.clone().add(c.clone().multiplyScalar(1e3))
     ), f = new A(
       l.clone().add(h.clone().multiplyScalar(-1e3)),
       l.clone().add(h.clone().multiplyScalar(1e3))
     );
-    let p = ae(i, r, u, f, s, n);
-    p = ce(p, s);
-    let y = le(p, 0.1, n);
-    return y = ue(y, n), de(a), fe(o), y = lt(y, 1e-9), y.push(...o), y = pe(y, 0.08), y = y, y;
+    let p = ce(i, r, d, f, s, n);
+    p = le(p, s);
+    let y = he(p, 0.1, n);
+    return y = de(y, n), fe(a), pe(o), y = lt(y, 1e-9), y.push(...o), y = ye(y, 0.08), y = y, y;
   }
 }
-const ye = new A(
+const xe = new A(
   new M(0, 0),
   new M(0, 1)
 );
-function xe(d) {
-  const t = [...d].sort((i, r) => r.length() - i.length()).slice(0, 20), e = t.map((i) => {
-    let r = parseInt(ye.includedAngle(i) + "");
+function ge(u) {
+  const t = [...u].sort((i, r) => r.length() - i.length()).slice(0, 20), e = t.map((i) => {
+    let r = parseInt(xe.includedAngle(i) + "");
     return r > 90 && (r = 180 - r), r;
   }), n = /* @__PURE__ */ new Map();
   return e.forEach((i, r) => {
     n.has(i) || n.set(i, []), n.get(i)?.push(t[r]);
   }), [...n.values()].sort((i, r) => r.length - i.length)[0].sort((i, r) => r.length() - i.length())[0];
 }
-function ge(d) {
+function me(u) {
   let t = [], e = -1;
   const n = [];
-  return d.forEach(({ start: i, end: r, ...o }, a) => {
+  return u.forEach(({ start: i, end: r, ...o }, a) => {
     n.push(i.z ?? 0, r.z ?? 0);
     const c = new A(
       M.from(i),
@@ -1962,7 +2003,7 @@ function ge(d) {
     verticalReferenceIndex: e
   };
 }
-const me = {
+const we = {
   Unitless: 1,
   // 无单位，1米 = 1（无单位）
   Inches: 39.37007874015748,
@@ -2006,19 +2047,19 @@ const me = {
   Parsecs: 3240779289666404e-32
   // 秒差距，1米 ≈ 0.00000000000000003240779289666404秒差距
 };
-function wt(d) {
+function wt(u) {
   const t = [];
-  for (let e = 0; e < d.length; e++)
+  for (let e = 0; e < u.length; e++)
     t.push(new A(
-      d[e].clone(),
-      d[(e + 1) % d.length].clone()
+      u[e].clone(),
+      u[(e + 1) % u.length].clone()
     ));
   return t;
 }
-function Mt(d) {
-  return d.flatMap((t, e) => (e === d.length - 1 && [...t.points, d[0].points[0]], [t.points[0]]));
+function Mt(u) {
+  return u.flatMap((t, e) => (e === u.length - 1 && [...t.points, u[0].points[0]], [t.points[0]]));
 }
-class k extends q {
+class k extends _ {
   static name = "Dxf";
   shortLine = 0.04;
   width = 0.04;
@@ -2063,9 +2104,9 @@ class k extends q {
    * @param data 
    */
   preprocessing(t) {
-    let { lineSegments: e, verticalReferenceIndex: n, originalZAverage: s } = ge(t);
+    let { lineSegments: e, verticalReferenceIndex: n, originalZAverage: s } = me(t);
     if (this.originalZAverage = s, n === -1) {
-      const r = xe(e);
+      const r = ge(e);
       n = e.indexOf(r);
     }
     const i = e[n];
@@ -2098,7 +2139,7 @@ class k extends q {
         return this.set(a, e, n);
       } else
         throw new Error("非node环境不允许使用路径");
-    if (this.scale = n, this.width = e, t.length === 0)
+    if (this.scale = n, this.width = e, this.doorLineSegment.length = 0, t.length === 0)
       this.lineSegments = [], this.originalData = t;
     else {
       const i = this.preprocessing(t);
@@ -2131,8 +2172,8 @@ class k extends q {
   createGroups() {
     const t = [], e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Map(), i = (r, o, a = -1) => {
       if (!this.data[r]) return;
-      const [c, l, h, u] = this.data[r];
-      if (e.add(r), u)
+      const [c, l, h, d] = this.data[r];
+      if (e.add(r), d)
         return s.has(r) || s.set(r, []), s.get(r)?.push(a), n.add(this.data[r]);
       o.push([c, l]), h.forEach((f) => {
         e.has(f) || i(f, o, r);
@@ -2258,9 +2299,9 @@ class k extends q {
         continue;
       }
       let l = n[++r];
-      const h = s[s.length - 1], u = h.direction();
+      const h = s[s.length - 1], d = h.direction();
       for (; r < n.length; ) {
-        const p = u.angleBetween(l.direction()) / i;
+        const p = d.angleBetween(l.direction()) / i;
         if (l.length() <= e || p < 4 || p > 176)
           l = n[++r];
         else break;
@@ -2353,7 +2394,7 @@ class k extends q {
    * 转为绘制数据
    */
   toDrawDataJson(t = "Millimeters") {
-    const e = me[t], n = {
+    const e = we[t], n = {
       unit: t,
       line: [],
       arc: [],
@@ -2367,13 +2408,13 @@ class k extends q {
     function i(c, l) {
       n.line.push([c.x * e, c.y * e, l.x * e, l.y * e, s]);
     }
-    function r(c, l, h, u) {
+    function r(c, l, h, d) {
       n.arc.push([
         c.x * e,
         c.y * e,
         l * e,
         h,
-        u,
+        d,
         s
       ]);
     }
@@ -2386,7 +2427,7 @@ class k extends q {
     }
     this.wallsGroup.forEach((c) => {
       for (let l = 0; l < c.length; l++) {
-        const h = c[l], u = l === c.length - 1 ? 0 : l + 1, f = c[u];
+        const h = c[l], d = l === c.length - 1 ? 0 : l + 1, f = c[d];
         i(h, f);
       }
     });
@@ -2397,29 +2438,29 @@ class k extends q {
       if (s = "cyan", l.length() < 1.2) {
         l.expansion(-o * 0.5);
         const h = c.normal();
-        let u = new A(
+        let d = new A(
           l.start.clone(),
           l.start.clone().add(h.clone().multiplyScalar(l.length()))
         );
-        const f = u.clone().directionMove(u.normal(), l.length() * -0.5).expandToRectangle(l.length(), "bothSides");
+        const f = d.clone().directionMove(d.normal(), l.length() * -0.5).expandToRectangle(l.length(), "bothSides");
         for (let g = 0; g < a.length; g++)
           if (a[g].intersectRectangle(f)) {
-            u = new A(
+            d = new A(
               l.start.clone(),
               l.start.clone().add(h.clone().multiplyScalar(-l.length()))
             );
             break;
           }
-        u.expansion(-o * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((g, S) => i(g, S));
-        const p = l.length(), y = u.length(), x = (p ** 2 + y ** 2) / (2 * y), m = u.end.clone().add(u.direction().multiplyScalar(-x)), [L, w] = this.getArcAngleRange(m, l.end, u.end);
-        r(m, x, Math.min(L, w), Math.max(L, w)), a.push(f);
+        d.expansion(-o * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((g, S) => i(g, S));
+        const p = l.length(), y = d.length(), x = (p ** 2 + y ** 2) / (2 * y), m = d.end.clone().add(d.direction().multiplyScalar(-x)), [D, w] = this.getArcAngleRange(m, l.end, d.end);
+        r(m, x, Math.min(D, w), Math.max(D, w)), a.push(f);
       } else
-        l.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((h, u) => i(h, u)), l.clone().directionMove(l.normal(), o * 0.5).directionMove(l.direction(), o * 0.5).expansion(-l.length() * 0.45, "end").forward(o * 0.5).expandToRectangle(o).path2D((h, u) => i(h, u)), l.clone().directionMove(l.normal(), -o * 0.5).directionMove(l.direction(), -o * 0.5).expansion(-l.length() * 0.45, "start").forward(-o * 0.5).expandToRectangle(o).path2D((h, u) => i(h, u));
+        l.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((h, d) => i(h, d)), l.clone().directionMove(l.normal(), o * 0.5).directionMove(l.direction(), o * 0.5).expansion(-l.length() * 0.45, "end").forward(o * 0.5).expandToRectangle(o).path2D((h, d) => i(h, d)), l.clone().directionMove(l.normal(), -o * 0.5).directionMove(l.direction(), -o * 0.5).expansion(-l.length() * 0.45, "start").forward(-o * 0.5).expandToRectangle(o).path2D((h, d) => i(h, d));
     }), s = "yellow", this.lineSegments.forEach((c) => {
       if (!c.userData.isWindow) return !1;
       Array.isArray(c.userData.drawWindow) && c.userData.drawWindow.forEach((l) => {
-        const { p: h, width: u } = l, f = M.from(h), p = f.clone().add(c.direction().multiplyScalar(u * 0.5)), y = f.clone().add(c.direction().multiplyScalar(-u * 0.5)), x = new A(p, y);
-        i(x.start, x.end), x.expandToRectangle(this.width, "bothSides").path2D((m, L) => i(m, L));
+        const { p: h, width: d } = l, f = M.from(h), p = f.clone().add(c.direction().multiplyScalar(d * 0.5)), y = f.clone().add(c.direction().multiplyScalar(-d * 0.5)), x = new A(p, y);
+        i(x.start, x.end), x.expandToRectangle(this.width, "bothSides").path2D((m, D) => i(m, D));
       });
     }), n;
   }
@@ -2444,12 +2485,12 @@ class k extends q {
     };
     i.width = s.width + r * 2, i.height = s.height + r * 2;
     const a = i.getContext("2d");
-    return n && (a.fillStyle = n, a.fillRect(0, 0, i.width, i.height)), a.translate(s.width * 0.5 + r, s.height * 0.5 + r), a.scale(1, -1), s.line.forEach(([c, l, h, u, f]) => {
-      a.strokeStyle = o[f], a.beginPath(), a.moveTo(c, l), a.lineTo(h, u), a.closePath(), a.stroke();
-    }), s.arc.forEach(([c, l, h, u, f, p]) => {
-      a.strokeStyle = o[p], a.beginPath(), a.arc(c, l, h, u * (Math.PI / 180), f * (Math.PI / 180)), a.stroke();
+    return n && (a.fillStyle = n, a.fillRect(0, 0, i.width, i.height)), a.translate(s.width * 0.5 + r, s.height * 0.5 + r), a.scale(1, -1), s.line.forEach(([c, l, h, d, f]) => {
+      a.strokeStyle = o[f], a.beginPath(), a.moveTo(c, l), a.lineTo(h, d), a.closePath(), a.stroke();
+    }), s.arc.forEach(([c, l, h, d, f, p]) => {
+      a.strokeStyle = o[p], a.beginPath(), a.arc(c, l, h, d * (Math.PI / 180), f * (Math.PI / 180)), a.stroke();
     }), a.beginPath(), s.dimensionLine.forEach((c) => {
-      let [l, h, u, f] = c;
+      let [l, h, d, f] = c;
       const p = Math.min(h, f), y = Math.max(h, f), x = (i.width * 0.5 - 0.4 * s.scale) * (l < 0 ? -1 : 1), m = (y - p) * 0.45;
       a.fillStyle = "#fff", a.font = `${0.15 * s.scale}px Arial`, a.textAlign = "center", a.textBaseline = "middle", a.save(), a.translate(x, p + (y - p) * 0.5), a.scale(1, -1), a.fillText((y - p).toFixed(2) + "cm", 0, 0), a.restore(), a.moveTo(x - 0.1 * s.scale, p), a.lineTo(x + 0.1 * s.scale, p), a.moveTo(x, p), a.lineTo(x, m + p), a.moveTo(x, y), a.lineTo(x, y - m), a.moveTo(x - 0.1 * s.scale, y), a.lineTo(x + 0.1 * s.scale, y);
     }), a.closePath(), a.strokeStyle = "#fff", a.stroke(), "toBlob" in i ? new Promise((c) => {
@@ -2547,17 +2588,17 @@ class k extends q {
     });
   }
 }
-function ct(d) {
-  if (d === null || typeof d != "object") return d;
-  if (d instanceof Date) return new Date(d.getTime());
-  if (Array.isArray(d)) return d.map(ct);
+function ct(u) {
+  if (u === null || typeof u != "object") return u;
+  if (u instanceof Date) return new Date(u.getTime());
+  if (Array.isArray(u)) return u.map(ct);
   const t = {};
-  for (const e in d)
-    Object.prototype.hasOwnProperty.call(d, e) && (t[e] = ct(d[e]));
+  for (const e in u)
+    Object.prototype.hasOwnProperty.call(u, e) && (t[e] = ct(u[e]));
   return t;
 }
-const j = new A();
-class we extends k {
+const z = new A();
+class Me extends k {
   static name = "AngleCorrectionDxf";
   angle = 0;
   onAddFromParent(t) {
@@ -2568,12 +2609,12 @@ class we extends k {
     let s = 0, i = null;
     for (let c = 0; c < e.originalData.length; c++) {
       const l = e.originalData[c];
-      if (j.start.copy(l.start), j.end.copy(l.end), l.isVerticalReferenceLine) {
-        const [h, u] = l.start.y < l.end.y ? [j.start, j.end] : [j.end, j.start];
-        s = -new A(h, u).direction().angleBetween(new M(0, 1), "angle", "360"), i = null;
+      if (z.start.copy(l.start), z.end.copy(l.end), l.isVerticalReferenceLine) {
+        const [h, d] = l.start.y < l.end.y ? [z.start, z.end] : [z.end, z.start];
+        s = -new A(h, d).direction().angleBetween(new M(0, 1), "angle", "360"), i = null;
         break;
       }
-      (!i || j.length() > i.length()) && (i = j.clone(), i.userData.index = c);
+      (!i || z.length() > i.length()) && (i = z.clone(), i.userData.index = c);
     }
     if (i) {
       e.originalData[i.userData.index].isVerticalReferenceLine = !0;
@@ -2581,10 +2622,10 @@ class we extends k {
       s = -new A(c, l).direction().angleBetween(new M(0, 1), "angle", "360");
     }
     const r = e.originalBox.center, o = M.zero(), a = e.originalData.map((c) => {
-      const l = o.copy(c.start).division(r).rotate(M.zero(), s * (Math.PI / 180)).toJson(c.start.z), h = o.copy(c.end).division(r).rotate(M.zero(), s * (Math.PI / 180)).toJson(c.end.z), u = Object.assign(ct(c), { start: l, end: h });
-      return u.drawWindow && u.drawWindow.forEach((f) => {
+      const l = o.copy(c.start).division(r).rotate(M.zero(), s * (Math.PI / 180)).toJson(c.start.z), h = o.copy(c.end).division(r).rotate(M.zero(), s * (Math.PI / 180)).toJson(c.end.z), d = Object.assign(ct(c), { start: l, end: h });
+      return d.drawWindow && d.drawWindow.forEach((f) => {
         f.p = o.copy(f.p).division(r).rotate(M.zero(), s * (Math.PI / 180)).toJson(f.p.z);
-      }), u;
+      }), d;
     });
     n.appendLineSegmentList.forEach((c) => {
       const l = c.clone();
@@ -2602,7 +2643,7 @@ class we extends k {
     });
   }
 }
-class Rt extends q {
+class Rt extends _ {
   static name = "Variable";
   originalLineVisible = !0;
   dxfVisible = !0;
@@ -2629,10 +2670,11 @@ class Rt extends q {
     if (t in this) return this[t];
   }
 }
-class Me {
+class Se {
   // 所有可查找的点位
   possibleDoorPoints = [];
   doorPoint = [];
+  calculatedDoorPoint = [];
   dxf;
   // 包含所有点的虚拟网格
   pointVirtualGrid = new X();
@@ -2648,18 +2690,28 @@ class Me {
   lineAnalysis;
   continueFind = !0;
   constructor(t) {
-    this.lineAnalysis = t, this.dxf = t.Dxf, this.findPointVirtualGrid = new X(), this.quadtree = t.quadtree, this.resultList = t.resultList, this.lineSegments = t.lineSegmentList, this.dxf.doorLineSegment.length = 0, this.lineSegments.forEach((n) => {
-      this.pointVirtualGrid.insert(n.start, n), this.pointVirtualGrid.insert(n.end, n);
-    }), this.doorPoint = this.getDoorPoint();
-    const e = this.searchDoubleLinePoint();
-    this.addPointsExcludeRule((n, s, i) => {
-      const r = this.lineSegments.indexOf(n), o = e.get(r);
-      return typeof o == "number" ? o === -1 || o === i : !1;
-    }), this.addPointsExcludeRule((n, s) => !!this.doorPoint.find((i) => i.point.equal(s))), this.possibleDoorPoints = this.getPossiblePoints(), this.possibleDoorPoints.forEach((n) => this.findPointVirtualGrid.insert(n.point, n.line)), this.handle();
+    this.lineAnalysis = t, this.dxf = t.Dxf, this.findPointVirtualGrid = new X(), this.quadtree = t.quadtree, this.resultList = t.resultList, this.lineSegments = t.lineSegmentList, this.dxf.doorLineSegment.length = 0, this.lineSegments.forEach((i) => {
+      this.pointVirtualGrid.insert(i.start, i), this.pointVirtualGrid.insert(i.end, i);
+    });
+    const { doorPoints: e, calculatedDoorPoint: n } = this.getDoorPoint();
+    this.doorPoint = e, this.calculatedDoorPoint = n;
+    const s = this.searchDoubleLinePoint();
+    this.addPointsExcludeRule((i, r, o) => {
+      const a = this.lineSegments.indexOf(i), c = s.get(a);
+      return typeof c == "number" ? c === -1 || c === o : !1;
+    }), this.addPointsExcludeRule((i, r) => !!this.doorPoint.find((o) => o.point.equal(r))), this.addPointsExcludeRule((i, r) => !!this.calculatedDoorPoint.find((o) => o.point.equal(r))), this.possibleDoorPoints = this.getPossiblePoints(), this.possibleDoorPoints.forEach((i) => this.findPointVirtualGrid.insert(i.point, i.line)), this.handle();
   }
   handle() {
-    this.dxf.doorLineSegment.push(...this.search(this.doorPoint, this.possibleDoorPoints, 0.5)), this.dxf.doorLineSegment.length < 2 && this.dxf.doorLineSegment.push(...this.search(this.possibleDoorPoints, this.possibleDoorPoints, 0.6));
+    this.dxf.doorLineSegment.push(...this.search(this.doorPoint, this.possibleDoorPoints, 0.5)), this.dxf.doors.length < 2 && this.dxf.doorLineSegment.push(...this.search(this.possibleDoorPoints, this.possibleDoorPoints, 0.6));
   }
+  /** 查找
+   * @param doorPoints 
+   * @param possibleDoorPoints 
+   * @param minDoorWidth 
+   * @param doorSearchDistance 
+   * @param doorSearchNearAngle 
+   * @returns 
+   */
   search(t, e = [], n = 0.6, s = this.doorSearchDistance, i = this.doorSearchNearAngle) {
     const r = this.dxf, o = this.searchNearby(t, e, s, i);
     o.push(
@@ -2680,13 +2732,13 @@ class Me {
     return o.forEach((c) => {
       const l = new A(c?.start, c?.end), h = l.length();
       if (h < n) return;
-      const u = l.normal(), f = l.direction(), p = (h - r.width * 2) / 2;
+      const d = l.normal(), f = l.direction(), p = (h - r.width * 2) / 2;
       for (let y = 0; y < 3; y++) {
         const x = l.start.clone().add(f.clone().multiplyScalar(r.width + p * y)), m = new A(
           x,
-          x.clone().add(u.clone().multiplyScalar(1))
+          x.clone().add(d.clone().multiplyScalar(1))
         );
-        if (m.directionMove(u, -0.5), this.quadtree.queryLineSegment(m).length) return;
+        if (m.directionMove(d, -0.5), this.quadtree.queryLineSegment(m).length) return;
       }
       a.push(l);
     }), a;
@@ -2706,7 +2758,7 @@ class Me {
     return this.lineSegments.forEach((e) => {
       e.points.forEach((n, s) => {
         for (let r = 0; r < this._pointsExcludeRule.length; r++) if (this._pointsExcludeRule[r](e, n, s)) return;
-        this.pointVirtualGrid.queryPoint(n).filter((r) => r.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: at() });
+        this.pointVirtualGrid.queryPoint(n).filter((r) => r.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: K() });
       });
     }), t;
   }
@@ -2714,32 +2766,39 @@ class Me {
    * 查找已知为门的点位
    */
   getDoorPoint() {
-    const t = [], e = this.dxf, n = this.pointVirtualGrid;
-    return e.doors.forEach((s) => {
-      const i = e.lineSegments[s[4]], r = e.originalData[s[4]];
-      if (r.doorDirectConnection) {
+    const t = [], e = [], n = this.dxf, s = this.pointVirtualGrid;
+    return n.doors.forEach((i) => {
+      const r = n.lineSegments[i[4]], o = n.originalData[i[4]];
+      if (o.doorDirectConnection) {
         this.continueFind = !1;
-        const o = new A(M.from(r.start), M.from(r.end));
-        o.userData = {
+        const a = new A(M.from(o.start), M.from(o.end));
+        a.userData = {
           doorDirectConnection: !0,
           isDoor: !0
-        }, this.dxf.doorLineSegment.push(o);
-      } else if (r.drawDoorData) {
-        const o = M.from(r.drawDoorData.start), a = M.from(r.drawDoorData.n), c = n.queryPoint(o).filter((l) => {
-          if (l.userData === i) return !1;
-          const h = l.userData, u = h.direction();
-          h.start.equal(o) && u.multiplyScalar(-1);
-          const f = a.angleBetween(u, "angle");
-          return f > 80 || f < 10;
+        }, this.dxf.doorLineSegment.push(a), a.points.forEach((c) => {
+          const l = s.queryPoint(c);
+          l.length && e.push({
+            line: l[0].userData,
+            point: l[0].point,
+            uuid: K()
+          });
         });
-        c.length && t.push({
-          line: c[0].userData,
-          point: o,
-          uuid: at()
+      } else if (o.drawDoorData) {
+        const a = M.from(o.drawDoorData.start), c = M.from(o.drawDoorData.n), l = s.queryPoint(a).filter((h) => {
+          if (h.userData === r) return !1;
+          const d = h.userData, f = d.direction();
+          d.start.equal(a) && f.multiplyScalar(-1);
+          const p = c.angleBetween(f, "angle");
+          return p > 170 || p < 10;
+        });
+        l.length && t.push({
+          line: l[0].userData,
+          point: a,
+          uuid: K()
         });
       } else
-        console.warn(`门的线段顺序${s[4]} 没有drawDoorData属性`);
-    }), t;
+        console.warn(`门的线段顺序${i[4]} 没有drawDoorData属性`);
+    }), { doorPoints: t, calculatedDoorPoint: e };
   }
   /**
    * 查找双线墙的点位
@@ -2762,78 +2821,78 @@ class Me {
    */
   searchNearby(t, e = [], n = this.doorSearchDistance, s = this.doorSearchNearAngle) {
     const i = this.findPointVirtualGrid, r = this.quadtree;
-    function o({ point: x, line: m }, L, w) {
+    function o({ point: x, line: m }, D, w) {
       const g = m.direction();
       m.start === x && g.multiplyScalar(-1);
-      const S = i.queryCircle(x, n).filter((E) => E.userData !== m).sort((E, b) => E.point.distance(x) - b.point.distance(x)), D = [];
-      for (let E = 0; E < S.length; E++) {
-        const b = e.findIndex((O) => O.point === S[E].point), R = t[L].uuid, P = e[b].uuid;
+      const S = i.queryCircle(x, n).filter((L) => L.userData !== m).sort((L, b) => L.point.distance(x) - b.point.distance(x)), E = [];
+      for (let L = 0; L < S.length; L++) {
+        const b = e.findIndex((O) => O.point === S[L].point), R = t[D].uuid, P = e[b].uuid;
         if (w.has(`${R}.${P}`)) continue;
         w.add(`${R}.${P}`), w.add(`${P}.${R}`);
-        const B = S[E].point, C = new A(x.clone(), B.clone());
+        const B = S[L].point, C = new A(x.clone(), B.clone());
         if (C.direction().angleBetween(g, "angle") < s) {
-          const O = t[L].line.direction(), v = S[E].userData;
-          v.start.equal(S[E].point) && O.multiplyScalar(-1), C.direction().multiplyScalar(-1).angleBetween(O, "angle") < s && (r.queryLineSegment(C).filter((W) => !(W.line.start.equal(x) || W.line.end.equal(x) || W.line === v)).length || D.push({
-            findData: S[E],
+          const O = t[D].line.direction(), v = S[L].userData;
+          v.start.equal(S[L].point) && O.multiplyScalar(-1), C.direction().multiplyScalar(-1).angleBetween(O, "angle") < s && (r.queryLineSegment(C).filter((W) => !(W.line.start.equal(x) || W.line.end.equal(x) || W.line === v)).length || E.push({
+            findData: S[L],
             findUuid: P,
             doorLine: C,
             doorUuid: R
           }));
         }
       }
-      return D;
+      return E;
     }
-    function a(x, m, L, w, g) {
+    function a(x, m, D, w, g) {
       w.add(x);
       const S = [];
       g && S.push(g);
-      for (let D = 0; D < L.length; D++) {
-        const E = L[D];
-        if (m.has(E.findUuid)) {
-          const b = m.get(E.findUuid);
-          a(E.findUuid, m, b, w, E) && S.push(E);
-        } else S.push(E);
+      for (let E = 0; E < D.length; E++) {
+        const L = D[E];
+        if (m.has(L.findUuid)) {
+          const b = m.get(L.findUuid);
+          a(L.findUuid, m, b, w, L) && S.push(L);
+        } else S.push(L);
       }
-      return S.sort((D, E) => D.doorLine.length() - E.doorLine.length()), g && S[0] === g ? (L.splice(0), !0) : (L.splice(1), !1);
+      return S.sort((E, L) => E.doorLine.length() - L.doorLine.length()), g && S[0] === g ? (D.splice(0), !0) : (D.splice(1), !1);
     }
     const c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Map();
     t.map((x, m) => {
-      const L = o(x, m, c);
-      L.length && l.set(x.uuid, L);
+      const D = o(x, m, c);
+      D.length && l.set(x.uuid, D);
     }), c.clear();
     const h = /* @__PURE__ */ new Map();
     l.forEach((x, m) => {
       if (!c.has(m) && x.length && a(m, l, x, c), x.length) {
-        const L = x[0];
-        h.has(L.doorUuid) || h.set(L.doorUuid, []), h.get(L.doorUuid)?.push(L), h.has(L.findUuid) || h.set(L.findUuid, []), h.get(L.findUuid)?.push(L);
+        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 u = /* @__PURE__ */ new Set();
+    const d = /* @__PURE__ */ new Set();
     h.forEach((x) => {
       if (x.length > 1) {
-        x.sort((m, L) => m.doorLine.length() - L.doorLine.length());
-        for (let m = 1; m < x.length; m++) u.add(x[m]);
+        x.sort((m, D) => m.doorLine.length() - D.doorLine.length());
+        for (let m = 1; m < x.length; m++) d.add(x[m]);
       }
     });
     const f = [], p = [];
     l.forEach((x) => {
       if (x.length) {
         const m = x[0];
-        u.has(m) || (f.push(m), p.push(m.doorUuid, m.findUuid));
+        d.has(m) || (f.push(m), p.push(m.doorUuid, m.findUuid));
       }
     });
     const y = [];
     return f.forEach((x) => {
-      const m = t.findIndex((b) => b.uuid === x.doorUuid), L = e.findIndex((b) => b.uuid === x.findUuid), w = t[m].point.clone(), g = e[L].point.clone(), S = this.findLongLineSegment(t[m].line), D = this.findLongLineSegment(e[L].line), E = S.projectPoint(g);
-      if (E) {
-        w.copy(E);
-        const b = new A(w, g), R = D.includedAngle(b);
+      const m = t.findIndex((b) => b.uuid === x.doorUuid), D = e.findIndex((b) => b.uuid === x.findUuid), w = t[m].point.clone(), g = e[D].point.clone(), S = this.findLongLineSegment(t[m].line), E = this.findLongLineSegment(e[D].line), L = S.projectPoint(g);
+      if (L) {
+        w.copy(L);
+        const b = new A(w, g), R = E.includedAngle(b);
         (R < 10 || R > 170 || Math.abs(90 - R) < 10) && y.push({
           start: w,
           end: g
         });
       } else {
-        const b = D.projectPoint(w);
+        const b = E.projectPoint(w);
         b && g.copy(b);
         const R = new A(w, g), P = S.includedAngle(R);
         (P < 10 || P > 170 || Math.abs(90 - P) < 10) && y.push({
@@ -2878,22 +2937,22 @@ class Me {
   searchAlongNormalDirection({ point: t, line: e }, n = this.doorSearchDistance) {
     const s = this.pointVirtualGrid, i = this.quadtree, r = e.direction(), o = e.start.normal(e.end), a = e.start.clone();
     e.start === t && r.multiplyScalar(-1), e.start === t && a.copy(e.end);
-    const c = s.queryPoint(a).filter((u) => u.userData !== e);
-    for (let u = 0; u < c.length; u++) {
-      const f = c[u], p = f.userData, y = p.direction();
+    const c = s.queryPoint(a).filter((d) => d.userData !== e);
+    for (let d = 0; d < c.length; d++) {
+      const f = c[d], p = f.userData, y = p.direction();
       if (p.start === f.point && r.multiplyScalar(-1), y.angleBetween(o) / (Math.PI / 180) > 90) {
         o.multiplyScalar(-1);
         break;
       }
     }
-    const l = new A(t.clone(), t.clone().add(o.multiplyScalar(n))), h = i.queryLineSegment(l).map((u) => ({
-      point: u.line.getIntersection(l),
-      line: u.line
-    })).filter((u) => u.point).sort((u, f) => t.distance(u.point) - t.distance(f.point));
+    const l = new A(t.clone(), t.clone().add(o.multiplyScalar(n))), h = i.queryLineSegment(l).map((d) => ({
+      point: d.line.getIntersection(l),
+      line: d.line
+    })).filter((d) => d.point).sort((d, f) => t.distance(d.point) - t.distance(f.point));
     if (h.length) {
-      const u = h[0];
-      if (Math.abs(90 - u.line.direction().angleBetween(o, "angle")) < 5)
-        return u;
+      const d = h[0];
+      if (Math.abs(90 - d.line.direction().angleBetween(o, "angle")) < 5)
+        return d;
     }
   }
   /**
@@ -2920,7 +2979,7 @@ class Me {
     return e;
   }
 }
-class Se extends q {
+class De extends _ {
   static name = "LineAnalysis";
   Dxf = null;
   Variable = null;
@@ -2974,14 +3033,14 @@ class Se extends q {
   createRectangle(t) {
     const e = this.Dxf, n = t.project, s = t.project2;
     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) / e.width), a = i / o, c = r / o, l = s.points[0].direction(n.points[0]), h = s.points[1].direction(n.points[1]), u = n.points[0].clone(), f = n.points[1].clone(), p = f.direction(u);
+    const i = n.points[0].distance(s.points[0]), r = n.points[1].distance(s.points[1]), o = Math.ceil(Math.max(i, r) / e.width), a = i / o, c = r / o, l = s.points[0].direction(n.points[0]), h = s.points[1].direction(n.points[1]), d = n.points[0].clone(), f = n.points[1].clone(), p = f.direction(d);
     p.multiplyScalar(e.width * 0.5);
-    const y = u.clone().add(p), x = f.clone().add(p.multiplyScalar(-1)), m = u.direction(f), L = y.direction(x);
-    if (!(m.x > 0 && L.x < 0 || m.x < 0 && L.x > 0 || m.y > 0 && L.y < 0 || m.y < 0 && L.y > 0)) {
-      u.set(y.x, y.y), f.set(x.x, x.y);
+    const y = d.clone().add(p), x = f.clone().add(p.multiplyScalar(-1)), m = d.direction(f), D = y.direction(x);
+    if (!(m.x > 0 && D.x < 0 || m.x < 0 && D.x > 0 || m.y > 0 && D.y < 0 || m.y < 0 && D.y > 0)) {
+      d.set(y.x, y.y), f.set(x.x, x.y);
       for (let w = 1; w < o; w++) {
-        const g = l.clone().multiplyScalar(a * w), S = h.clone().multiplyScalar(c * w), D = u.clone().add(g), E = f.clone().add(S);
-        this.addData(D, E);
+        const g = l.clone().multiplyScalar(a * w), S = h.clone().multiplyScalar(c * w), E = d.clone().add(g), L = f.clone().add(S);
+        this.addData(E, L);
       }
     }
   }
@@ -3008,7 +3067,7 @@ class Se extends q {
     this.buildQuadtree();
     const t = this.quadtree, e = this.lineSegmentList, n = /* @__PURE__ */ new Set(), s = [];
     e.forEach((i, r) => {
-      const o = e[r], a = et.fromByLineSegment(o, this.width * 2, !1, -0.01);
+      const o = e[r], a = nt.fromByLineSegment(o, this.width * 2, !1, -0.01);
       t.queryRect(a).map((l) => l.userData).filter((l) => l !== r).forEach((l) => {
         try {
           if (n.has(`${r}-${l}`) || n.has(`${l}-${r}`)) return;
@@ -3051,13 +3110,12 @@ class Se extends q {
   doorSearchDistance = 2;
   doors = [];
   DoorsAnalysis;
+  skipFindDoor = !1;
   doorsAnalysis() {
-    this.DoorsAnalysis = new Me(this), this.dispatchEvent({
-      type: "analysisCompleted"
-    });
+    this.skipFindDoor || (this.DoorsAnalysis = new Se(this), this.skipFindDoor = !1), this.dispatchEvent({ type: "analysisCompleted" });
   }
 }
-class Le extends q {
+class Le extends _ {
   static name = "ThreeVJia";
   lineSegments = [];
   onAddFromParent() {
@@ -3067,8 +3125,8 @@ class Le extends q {
     const t = this.parent?.findComponentByName("LineAnalysis"), e = this.parent?.findComponentByName("Dxf"), n = this.parent?.findComponentByName("AngleCorrectionDxf"), s = /* @__PURE__ */ new Map();
     let i = [...e.lineSegments], r = [], o = [];
     t.resultList.forEach((l) => {
-      const h = s.get(l.target) ?? [], u = s.get(l.source) ?? [], f = l.project.clone(), p = l.project2.clone();
-      f.includedAngle(p) > 135 && (p.points = [p.points[1], p.points[0]]), h.push(...f.points), u.push(...p.points), s.set(l.target, h), s.set(l.source, u);
+      const h = s.get(l.target) ?? [], d = s.get(l.source) ?? [], f = l.project.clone(), p = l.project2.clone();
+      f.includedAngle(p) > 135 && (p.points = [p.points[1], p.points[0]]), h.push(...f.points), d.push(...p.points), s.set(l.target, h), s.set(l.source, d);
       const y = new A(f.start, p.start), x = new A(f.end, p.end), m = new A(y.center, x.center);
       m.userData.wallWidth = Math.max(y.length(), x.length()), r.push(m);
     });
@@ -3076,19 +3134,19 @@ class Le extends q {
     i = i.filter((l) => {
       if (o.indexOf(l) > -1) return !1;
       if (s.has(l)) {
-        const h = s.get(l), u = l.clone();
+        const h = s.get(l), d = l.clone();
         if (h) {
           for (let p = 0; p < h.length; p += 2) {
             const y = h[p], x = h[p + 1];
-            y.userData.length = y.distance(u.start), x.userData.length = x.distance(u.start), y.userData.type = "start", x.userData.type = "end", u.start.distance(y) > u.start.distance(x) && (h[p] = x, h[p + 1] = y, y.userData.type = "end", x.userData.type = "start");
+            y.userData.length = y.distance(d.start), x.userData.length = x.distance(d.start), y.userData.type = "start", x.userData.type = "end", d.start.distance(y) > d.start.distance(x) && (h[p] = x, h[p + 1] = y, y.userData.type = "end", x.userData.type = "start");
           }
           h.sort((p, y) => p.userData.length - y.userData.length);
           const f = [];
           for (let p = 0; p < h.length; p++) {
             const y = h[p];
-            y.userData.type === "start" ? (f.length === 0 && (a.push(new A(u.start.clone(), y.clone())), u.start.copy(y)), f.push("start")) : (f.pop(), f.length === 0 && u.start.copy(y));
+            y.userData.type === "start" ? (f.length === 0 && (a.push(new A(d.start.clone(), y.clone())), d.start.copy(y)), f.push("start")) : (f.pop(), f.length === 0 && d.start.copy(y));
           }
-          a.push(u);
+          a.push(d);
         }
         return !1;
       }
@@ -3192,7 +3250,7 @@ class ht extends se {
    * @param scale 原始数据缩放比例
    */
   constructor(t = 0.1, e = 1) {
-    super(), this.environment = typeof window < "u" ? "browser" : typeof global < "u" ? "node" : "unknown", this.wallWidth = t, this.Dxf = new k(this.wallWidth, e), this.AngleCorrectionDxf = new we(), this.Variable = new Rt(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(new Se()), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new Le()), ht.finalInstance = this;
+    super(), this.environment = typeof window < "u" ? "browser" : typeof global < "u" ? "node" : "unknown", this.wallWidth = t, this.Dxf = new k(this.wallWidth, e), this.AngleCorrectionDxf = new Me(), this.Variable = new Rt(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(new De()), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new Le()), ht.finalInstance = this;
   }
   usePlugin(t) {
     return typeof t == "function" && t.call(this, this), this;
@@ -3233,15 +3291,15 @@ class ut {
   static boundExtbyTraj(t, e, n = 0.12) {
     function s(w, g) {
       return g.queryLineSegment(w).filter((S) => S.line !== w).map(({ line: S }) => {
-        const D = { resultLine: S, type: "intersect", direction: "vertical", point: null, newLine: null };
-        w.sameEndpoint(S) && (D.type = "endpoint"), w.parallel(S) && (D.direction = "parallel");
-        const E = w.getSameEndpoint(S);
-        if (E) D.point = E[1];
+        const E = { resultLine: S, type: "intersect", direction: "vertical", point: null, newLine: null };
+        w.sameEndpoint(S) && (E.type = "endpoint"), w.parallel(S) && (E.direction = "parallel");
+        const L = w.getSameEndpoint(S);
+        if (L) E.point = L[1];
         else {
           const b = S.getIntersection(w);
-          b && (D.point = S.start.equal(b) ? S.start : S.end);
+          b && (E.point = S.start.equal(b) ? S.start : S.end);
         }
-        return D;
+        return E;
       });
     }
     function i(w) {
@@ -3254,18 +3312,18 @@ class ut {
         w.directionMove(S, n * 0.5);
       }
     }
-    function r({ resultLine: w, type: g, direction: S, point: D }, E, b, R) {
+    function r({ resultLine: w, type: g, direction: S, point: E }, L, b, R) {
       if (g === "intersect")
-        D && D.copy(E.projectPoint(D) ?? D);
+        E && E.copy(L.projectPoint(E) ?? E);
       else if (S === "vertical") {
-        if (D) {
-          const P = E.projectPoint(D, !1);
-          D.copy(P), E.isPointOnSegment(P) || (E.start.distance(P) < E.end.distance(P) ? R.push(new A(P.clone(), E.start.clone())) : R.push(new A(P.clone(), E.end.clone())));
+        if (E) {
+          const P = L.projectPoint(E, !1);
+          E.copy(P), L.isPointOnSegment(P) || (L.start.distance(P) < L.end.distance(P) ? R.push(new A(P.clone(), L.start.clone())) : R.push(new A(P.clone(), L.end.clone())));
         }
-      } else if (!u.includes(w) && D) {
-        let P = E.projectPoint(D, !1), B;
-        if (E.start.distance(D) < E.end.distance(D) ? B = E.start : B = E.end, P) {
-          R.push(new A(D.clone(), P.clone()));
+      } else if (!d.includes(w) && E) {
+        let P = L.projectPoint(E, !1), B;
+        if (L.start.distance(E) < L.end.distance(E) ? B = L.start : B = L.end, P) {
+          R.push(new A(E.clone(), P.clone()));
           const C = new A(P.clone(), B.clone());
           C.length() && R.push(C);
         }
@@ -3274,45 +3332,45 @@ class ut {
     }
     const o = Object.keys(e).map((w) => M.from(e[w])), a = [];
     let c = t.map(({ start: w, end: g, ...S }) => {
-      const D = new A(M.from(w), M.from(g));
-      return D.userData = S, a.push(w.z ?? 0, g.z ?? 0), D;
+      const E = new A(M.from(w), M.from(g));
+      return E.userData = S, a.push(w.z ?? 0, g.z ?? 0), E;
     });
     const l = a.reduce((w, g) => w + g, 0) / a.length;
-    let u = ut.findExtWallByTraj(c, o).filter((w) => w.userData.expandDirect);
-    c = c.filter((w) => !u.includes(w)), c.push(...u);
+    let d = ut.findExtWallByTraj(c, o).filter((w) => w.userData.expandDirect);
+    c = c.filter((w) => !d.includes(w)), c.push(...d);
     const p = this.parent?.findComponentByName("Renderer");
-    o.forEach((w) => p.createPointMesh(w, 0.05, {}).position.z = l), p.createLineSegments(u, 0, { color: 65280 }).position.z = l + 1e-3;
-    const y = A.groupBySamePointAndParallel(u), x = new F(N.fromByLineSegment(...c));
+    o.forEach((w) => p.createPointMesh(w, 0.05, {}).position.z = l), p.createLineSegments(d, 0, { color: 65280 }).position.z = l + 1e-3;
+    const y = A.groupBySamePointAndParallel(d), x = new F(N.fromByLineSegment(...c));
     c.forEach((w) => w.userData.isDoor || x.insert(w));
-    const m = y.map((w) => w.flatMap((g) => s(g, x))), L = [];
-    return y.flatMap((w, g) => (w.forEach((D) => (i(D), x.update(D))), m[g].filter((D) => {
-      if (!u.includes(D.resultLine)) {
-        let E;
-        return Object.defineProperty(D, "newLine", {
+    const m = y.map((w) => w.flatMap((g) => s(g, x))), D = [];
+    return y.flatMap((w, g) => (w.forEach((E) => (i(E), x.update(E))), m[g].filter((E) => {
+      if (!d.includes(E.resultLine)) {
+        let L;
+        return Object.defineProperty(E, "newLine", {
           get() {
-            return E || (E = A.mergeLines(...w)), E;
+            return L || (L = A.mergeLines(...w)), L;
           }
         }), !0;
       }
-      r(D, A.mergeLines(...w), x, L);
+      r(E, A.mergeLines(...w), x, D);
     }))).reduce((w, g) => (w.has(g.resultLine) || w.set(g.resultLine, []), w.get(g.resultLine)?.push(g), w), /* @__PURE__ */ new Map()).forEach((w) => {
       w.reduce((g, S) => (g.has(S.point) || g.set(S.point, []), g.get(S.point)?.push(S), g), /* @__PURE__ */ new Map()).forEach((g) => {
         const S = /* @__PURE__ */ new Set();
-        for (let D = 0; D < g.length; D++) {
-          const E = g[D];
-          S.has(E.point) || (r(E, E.newLine, x, L), S.add(E.point));
+        for (let E = 0; E < g.length; E++) {
+          const L = g[E];
+          S.has(L.point) || (r(L, L.newLine, x, D), S.add(L.point));
         }
       });
-    }), c.push(...A.deduplication(L)), c.forEach((w) => w.userData.isWindow && Q(w)), c = lt(c), c = A.deduplication(c), J(c, l);
+    }), c.push(...A.deduplication(D)), c.forEach((w) => w.userData.isWindow && tt(w)), c = lt(c), c = A.deduplication(c), J(c, l);
   }
 }
-const cn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const ln = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   AxisAlignCorr: Pt,
   BoundExt: ut,
   lineDataToOriginalData: J,
   lineSegmentClipping: lt,
-  recomputedWindow: Q
+  recomputedWindow: tt
 }, Symbol.toStringTag, { value: "Module" })), St = {
   POSITION: [
     "byte",
@@ -3341,36 +3399,36 @@ const cn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     "unsigned short"
   ]
 };
-class tt {
+class et {
   constructor() {
     this.textureUtils = null, this.pluginCallbacks = [], this.register(function(t) {
-      return new Ce(t);
-    }), this.register(function(t) {
       return new Be(t);
     }), this.register(function(t) {
-      return new Ue(t);
+      return new Oe(t);
+    }), this.register(function(t) {
+      return new je(t);
     }), this.register(function(t) {
       return new ze(t);
     }), this.register(function(t) {
-      return new je(t);
+      return new qe(t);
     }), this.register(function(t) {
       return new _e(t);
-    }), this.register(function(t) {
-      return new Oe(t);
     }), this.register(function(t) {
       return new Fe(t);
     }), this.register(function(t) {
-      return new Ge(t);
+      return new Ue(t);
     }), this.register(function(t) {
-      return new qe(t);
+      return new Ge(t);
     }), this.register(function(t) {
       return new Ye(t);
     }), this.register(function(t) {
       return new ke(t);
+    }), this.register(function(t) {
+      return new Xe(t);
     }), this.register(function(t) {
       return new Ve(t);
     }), this.register(function(t) {
-      return new Xe(t);
+      return new We(t);
     });
   }
   register(t) {
@@ -3383,7 +3441,7 @@ class tt {
     return this.textureUtils = t, this;
   }
   parse(t, e, n, s) {
-    const i = new Ne(), r = [];
+    const i = new Ce(), r = [];
     for (let o = 0, a = this.pluginCallbacks.length; o < a; o++)
       r.push(this.pluginCallbacks[o](i));
     i.setPlugins(r), i.setTextureUtils(this.textureUtils), i.writeAsync(t, e, s).catch(n);
@@ -3419,78 +3477,78 @@ const T = {
   CLAMP_TO_EDGE: 33071,
   MIRRORED_REPEAT: 33648,
   REPEAT: 10497
-}, st = "KHR_mesh_quantization", G = {};
-G[Xt] = T.NEAREST;
-G[Wt] = T.NEAREST_MIPMAP_NEAREST;
-G[Ht] = T.NEAREST_MIPMAP_LINEAR;
-G[Jt] = T.LINEAR;
-G[$t] = T.LINEAR_MIPMAP_NEAREST;
-G[Kt] = T.LINEAR_MIPMAP_LINEAR;
-G[Zt] = T.CLAMP_TO_EDGE;
-G[Qt] = T.REPEAT;
-G[te] = T.MIRRORED_REPEAT;
-const Lt = {
+}, it = "KHR_mesh_quantization", U = {};
+U[Vt] = T.NEAREST;
+U[Wt] = T.NEAREST_MIPMAP_NEAREST;
+U[Ht] = T.NEAREST_MIPMAP_LINEAR;
+U[Jt] = T.LINEAR;
+U[$t] = T.LINEAR_MIPMAP_NEAREST;
+U[Kt] = T.LINEAR_MIPMAP_LINEAR;
+U[Zt] = T.CLAMP_TO_EDGE;
+U[Qt] = T.REPEAT;
+U[te] = T.MIRRORED_REPEAT;
+const Dt = {
   scale: "scale",
   position: "translation",
   quaternion: "rotation",
   morphTargetInfluences: "weights"
-}, Ee = new Ft(), Et = 12, De = 1179937895, Ae = 2, Dt = 8, Te = 1313821514, be = 5130562;
-function H(d, t) {
-  return d.length === t.length && d.every(function(e, n) {
+}, Ee = new Ft(), Lt = 12, Ae = 1179937895, Te = 2, Et = 8, be = 1313821514, Ie = 5130562;
+function H(u, t) {
+  return u.length === t.length && u.every(function(e, n) {
     return e === t[n];
   });
 }
-function Ie(d) {
-  return new TextEncoder().encode(d).buffer;
+function Pe(u) {
+  return new TextEncoder().encode(u).buffer;
 }
-function Pe(d) {
-  return H(d.elements, [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]);
+function Re(u) {
+  return H(u.elements, [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]);
 }
-function Re(d, t, e) {
+function ve(u, t, e) {
   const n = {
-    min: new Array(d.itemSize).fill(Number.POSITIVE_INFINITY),
-    max: new Array(d.itemSize).fill(Number.NEGATIVE_INFINITY)
+    min: new Array(u.itemSize).fill(Number.POSITIVE_INFINITY),
+    max: new Array(u.itemSize).fill(Number.NEGATIVE_INFINITY)
   };
   for (let s = t; s < t + e; s++)
-    for (let i = 0; i < d.itemSize; i++) {
+    for (let i = 0; i < u.itemSize; i++) {
       let r;
-      d.itemSize > 4 ? r = d.array[s * d.itemSize + i] : (i === 0 ? r = d.getX(s) : i === 1 ? r = d.getY(s) : i === 2 ? r = d.getZ(s) : i === 3 && (r = d.getW(s)), d.normalized === !0 && (r = ot.normalize(r, d.array))), n.min[i] = Math.min(n.min[i], r), n.max[i] = Math.max(n.max[i], r);
+      u.itemSize > 4 ? r = u.array[s * u.itemSize + i] : (i === 0 ? r = u.getX(s) : i === 1 ? r = u.getY(s) : i === 2 ? r = u.getZ(s) : i === 3 && (r = u.getW(s)), u.normalized === !0 && (r = at.normalize(r, u.array))), n.min[i] = Math.min(n.min[i], r), n.max[i] = Math.max(n.max[i], r);
     }
   return n;
 }
-function vt(d) {
-  return Math.ceil(d / 4) * 4;
+function vt(u) {
+  return Math.ceil(u / 4) * 4;
 }
-function it(d, t = 0) {
-  const e = vt(d.byteLength);
-  if (e !== d.byteLength) {
+function rt(u, t = 0) {
+  const e = vt(u.byteLength);
+  if (e !== u.byteLength) {
     const n = new Uint8Array(e);
-    if (n.set(new Uint8Array(d)), t !== 0)
-      for (let s = d.byteLength; s < e; s++)
+    if (n.set(new Uint8Array(u)), t !== 0)
+      for (let s = u.byteLength; s < e; s++)
         n[s] = t;
     return n.buffer;
   }
-  return d;
+  return u;
 }
 function At() {
   return typeof document > "u" && typeof OffscreenCanvas < "u" ? new OffscreenCanvas(1, 1) : document.createElement("canvas");
 }
-function ve(d, t) {
-  if (typeof OffscreenCanvas < "u" && d instanceof OffscreenCanvas) {
+function Ne(u, t) {
+  if (typeof OffscreenCanvas < "u" && u instanceof OffscreenCanvas) {
     let e;
-    return t === "image/jpeg" ? e = 0.92 : t === "image/webp" && (e = 0.8), d.convertToBlob({
+    return t === "image/jpeg" ? e = 0.92 : t === "image/webp" && (e = 0.8), u.convertToBlob({
       type: t,
       quality: e
     });
   } else
-    return new Promise((e) => d.toBlob(e, t));
+    return new Promise((e) => u.toBlob(e, t));
 }
-class Ne {
+class Ce {
   constructor() {
     this.plugins = [], this.options = {}, this.pending = [], this.buffers = [], this.byteOffset = 0, this.buffers = [], this.nodeMap = /* @__PURE__ */ new Map(), this.skins = [], this.extensionsUsed = {}, this.extensionsRequired = {}, this.uids = /* @__PURE__ */ new Map(), this.uid = 0, this.json = {
       asset: {
         version: "2.0",
-        generator: "THREE.GLTFExporter r" + Ut
+        generator: "THREE.GLTFExporter r" + Gt
       }
     }, this.cache = {
       meshes: /* @__PURE__ */ new Map(),
@@ -3527,15 +3585,15 @@ class Ne {
     const s = this, i = s.buffers, r = s.json;
     n = s.options;
     const o = s.extensionsUsed, a = s.extensionsRequired, c = new Blob(i, { type: "application/octet-stream" }), l = Object.keys(o), h = Object.keys(a);
-    l.length > 0 && (r.extensionsUsed = l), h.length > 0 && (r.extensionsRequired = h), r.buffers && r.buffers.length > 0 && (r.buffers[0].byteLength = c.size), n.binary === !0 ? rt(c).then(function(u) {
-      const f = it(u), p = new DataView(new ArrayBuffer(Dt));
-      p.setUint32(0, f.byteLength, !0), p.setUint32(4, be, !0);
-      const y = it(Ie(JSON.stringify(r)), 32), x = new DataView(new ArrayBuffer(Dt));
-      x.setUint32(0, y.byteLength, !0), x.setUint32(4, Te, !0);
-      const m = new ArrayBuffer(Et), L = new DataView(m);
-      L.setUint32(0, De, !0), L.setUint32(4, Ae, !0);
-      const w = Et + x.byteLength + y.byteLength + p.byteLength + f.byteLength;
-      L.setUint32(8, w, !0);
+    l.length > 0 && (r.extensionsUsed = l), h.length > 0 && (r.extensionsRequired = h), r.buffers && r.buffers.length > 0 && (r.buffers[0].byteLength = c.size), n.binary === !0 ? ot(c).then(function(d) {
+      const f = rt(d), p = new DataView(new ArrayBuffer(Et));
+      p.setUint32(0, f.byteLength, !0), p.setUint32(4, Ie, !0);
+      const y = rt(Pe(JSON.stringify(r)), 32), x = new DataView(new ArrayBuffer(Et));
+      x.setUint32(0, y.byteLength, !0), x.setUint32(4, be, !0);
+      const m = new ArrayBuffer(Lt), D = new DataView(m);
+      D.setUint32(0, Ae, !0), D.setUint32(4, Te, !0);
+      const w = Lt + x.byteLength + y.byteLength + p.byteLength + f.byteLength;
+      D.setUint32(8, w, !0);
       const g = new Blob([
         m,
         x,
@@ -3543,11 +3601,11 @@ class Ne {
         p,
         f
       ], { type: "application/octet-stream" });
-      rt(g).then((S) => {
+      ot(g).then((S) => {
         e(S);
       });
-    }) : r.buffers && r.buffers.length > 0 ? We(c).then((u) => {
-      r.buffers[0].uri = u, e(r);
+    }) : r.buffers && r.buffers.length > 0 ? He(c).then((d) => {
+      r.buffers[0].uri = d, e(r);
     }) : e(r);
   }
   /**
@@ -3594,7 +3652,7 @@ class Ne {
    */
   isNormalizedNormalAttribute(t) {
     if (this.cache.attributesNormalized.has(t)) return !1;
-    const n = new K();
+    const n = new Z();
     for (let s = 0, i = t.count; s < i; s++)
       if (Math.abs(n.fromBufferAttribute(t, s).length() - 1) > 5e-4) return !1;
     return !0;
@@ -3609,7 +3667,7 @@ class Ne {
   createNormalizedNormalAttribute(t) {
     const e = this.cache;
     if (e.attributesNormalized.has(t)) return e.attributesNormalized.get(t);
-    const n = t.clone(), s = new K();
+    const n = t.clone(), s = new Z();
     for (let i = 0, r = n.count; i < r; i++)
       s.fromBufferAttribute(n, i), s.x === 0 && s.y === 0 && s.z === 0 ? s.setX(1) : s.normalize(), n.setXYZ(i, s.x, s.y, s.z);
     return e.attributesNormalized.set(t, n), n;
@@ -3629,13 +3687,13 @@ class Ne {
   async buildMetalRoughTextureAsync(t, e) {
     if (t === e) return t;
     function n(f) {
-      return f.colorSpace === Vt ? function(y) {
+      return f.colorSpace === Xt ? function(y) {
         return y < 0.04045 ? y * 0.0773993808 : Math.pow(y * 0.9478672986 + 0.0521327014, 2.4);
       } : function(y) {
         return y;
       };
     }
-    t instanceof nt && (t = await this.decompressTextureAsync(t)), e instanceof nt && (e = await this.decompressTextureAsync(e));
+    t instanceof st && (t = await this.decompressTextureAsync(t)), e instanceof st && (e = await this.decompressTextureAsync(e));
     const s = t ? t.image : null, i = e ? e.image : null, r = Math.max(s ? s.width : 0, i ? i.width : 0), o = Math.max(s ? s.height : 0, i ? i.height : 0), a = At();
     a.width = r, a.height = o;
     const c = a.getContext("2d", {
@@ -3656,8 +3714,8 @@ class Ne {
         l.data[y] = f(p[y] / 256) * 256;
     }
     c.putImageData(l, 0, 0);
-    const u = (t || e).clone();
-    return u.source = new zt(a), u.colorSpace = jt, u.channel = (t || e).channel, t && e && t.channel !== e.channel && console.warn("THREE.GLTFExporter: UV channels for metalnessMap and roughnessMap textures must match."), console.warn("THREE.GLTFExporter: Merged metalnessMap and roughnessMap textures."), u;
+    const d = (t || e).clone();
+    return d.source = new jt(a), d.colorSpace = zt, d.channel = (t || e).channel, t && e && t.channel !== e.channel && console.warn("THREE.GLTFExporter: UV channels for metalnessMap and roughnessMap textures must match."), console.warn("THREE.GLTFExporter: Merged metalnessMap and roughnessMap textures."), d;
   }
   async decompressTextureAsync(t, e = 1 / 0) {
     if (this.textureUtils === null)
@@ -3705,16 +3763,16 @@ class Ne {
     for (let p = n; p < n + s; p++) {
       for (let y = 0; y < t.itemSize; y++) {
         let x;
-        t.itemSize > 4 ? x = t.array[p * t.itemSize + y] : (y === 0 ? x = t.getX(p) : y === 1 ? x = t.getY(p) : y === 2 ? x = t.getZ(p) : y === 3 && (x = t.getW(p)), t.normalized === !0 && (x = ot.normalize(x, t.array))), e === T.FLOAT ? l.setFloat32(h, x, !0) : e === T.INT ? l.setInt32(h, x, !0) : e === T.UNSIGNED_INT ? l.setUint32(h, x, !0) : e === T.SHORT ? l.setInt16(h, x, !0) : e === T.UNSIGNED_SHORT ? l.setUint16(h, x, !0) : e === T.BYTE ? l.setInt8(h, x) : e === T.UNSIGNED_BYTE && l.setUint8(h, x), h += o;
+        t.itemSize > 4 ? x = t.array[p * t.itemSize + y] : (y === 0 ? x = t.getX(p) : y === 1 ? x = t.getY(p) : y === 2 ? x = t.getZ(p) : y === 3 && (x = t.getW(p)), t.normalized === !0 && (x = at.normalize(x, t.array))), e === T.FLOAT ? l.setFloat32(h, x, !0) : e === T.INT ? l.setInt32(h, x, !0) : e === T.UNSIGNED_INT ? l.setUint32(h, x, !0) : e === T.SHORT ? l.setInt16(h, x, !0) : e === T.UNSIGNED_SHORT ? l.setUint16(h, x, !0) : e === T.BYTE ? l.setInt8(h, x) : e === T.UNSIGNED_BYTE && l.setUint8(h, x), h += o;
       }
       h % a !== 0 && (h += a - h % a);
     }
-    const u = {
+    const d = {
       buffer: this.processBuffer(l.buffer),
       byteOffset: this.byteOffset,
       byteLength: c
     };
-    return i !== void 0 && (u.target = i), i === T.ARRAY_BUFFER && (u.byteStride = a), this.byteOffset += c, r.bufferViews.push(u), {
+    return i !== void 0 && (d.target = i), i === T.ARRAY_BUFFER && (d.byteStride = a), this.byteOffset += c, r.bufferViews.push(d), {
       id: r.bufferViews.length - 1,
       byteLength: 0
     };
@@ -3727,8 +3785,8 @@ class Ne {
   processBufferViewImage(t) {
     const e = this, n = e.json;
     return n.bufferViews || (n.bufferViews = []), new Promise(async function(s) {
-      rt(t).then((i) => {
-        const r = it(i), o = {
+      ot(t).then((i) => {
+        const r = rt(i), o = {
           buffer: e.processBuffer(r),
           byteOffset: e.byteOffset,
           byteLength: r.byteLength
@@ -3772,7 +3830,7 @@ class Ne {
     else
       throw new Error("THREE.GLTFExporter: Unsupported bufferAttribute component type: " + t.array.constructor.name);
     if (n === void 0 && (n = 0), (s === void 0 || s === 1 / 0) && (s = t.count), s === 0) return null;
-    const a = Re(t, n, s);
+    const a = ve(t, n, s);
     let c;
     e !== void 0 && (c = t === e.index ? T.ELEMENT_ARRAY_BUFFER : T.ARRAY_BUFFER);
     const l = this.processBufferView(t, o, n, s, c), h = {
@@ -3801,13 +3859,13 @@ class Ne {
       const l = r.images.get(t), h = s + ":flipY/" + n.toString();
       if (l[h] !== void 0) return l[h];
       o.images || (o.images = []);
-      const u = { mimeType: s }, f = At();
+      const d = { mimeType: s }, f = At();
       f.width = Math.min(t.width, a.maxTextureSize), f.height = Math.min(t.height, a.maxTextureSize);
       const p = f.getContext("2d", {
         willReadFrequently: !0
       });
       if (n === !0 && (p.translate(0, f.height), p.scale(1, -1)), t.data !== void 0) {
-        e !== _t && console.error("GLTFExporter: Only RGBAFormat is supported.", e), (t.width > a.maxTextureSize || t.height > a.maxTextureSize) && console.warn("GLTFExporter: Image size is bigger than maxTextureSize", t);
+        e !== qt && console.error("GLTFExporter: Only RGBAFormat is supported.", e), (t.width > a.maxTextureSize || t.height > a.maxTextureSize) && console.warn("GLTFExporter: Image size is bigger than maxTextureSize", t);
         const x = new Uint8ClampedArray(t.height * t.width * 4);
         for (let m = 0; m < x.length; m += 4)
           x[m + 0] = t.data[m + 0], x[m + 1] = t.data[m + 1], x[m + 2] = t.data[m + 2], x[m + 3] = t.data[m + 3];
@@ -3817,11 +3875,11 @@ class Ne {
       else
         throw new Error("THREE.GLTFExporter: Invalid image type. Use HTMLImageElement, HTMLCanvasElement, ImageBitmap or OffscreenCanvas.");
       a.binary === !0 ? c.push(
-        ve(f, s).then((x) => i.processBufferViewImage(x)).then((x) => {
-          u.bufferView = x;
+        Ne(f, s).then((x) => i.processBufferViewImage(x)).then((x) => {
+          d.bufferView = x;
         })
-      ) : u.uri = qt.getDataURL(f, s);
-      const y = o.images.push(u) - 1;
+      ) : d.uri = _t.getDataURL(f, s);
+      const y = o.images.push(d) - 1;
       return l[h] = y, y;
     } else
       throw new Error("THREE.GLTFExporter: No valid image data found. Unable to process texture.");
@@ -3835,10 +3893,10 @@ class Ne {
     const e = this.json;
     e.samplers || (e.samplers = []);
     const n = {
-      magFilter: G[t.magFilter],
-      minFilter: G[t.minFilter],
-      wrapS: G[t.wrapS],
-      wrapT: G[t.wrapT]
+      magFilter: U[t.magFilter],
+      minFilter: U[t.minFilter],
+      wrapS: U[t.wrapS],
+      wrapT: U[t.wrapT]
     };
     return e.samplers.push(n) - 1;
   }
@@ -3850,7 +3908,7 @@ class Ne {
   async processTextureAsync(t) {
     const n = this.options, s = this.cache, i = this.json;
     if (s.textures.has(t)) return s.textures.get(t);
-    i.textures || (i.textures = []), t instanceof nt && (t = await this.decompressTextureAsync(t, n.maxTextureSize));
+    i.textures || (i.textures = []), t instanceof st && (t = await this.decompressTextureAsync(t, n.maxTextureSize));
     let r = t.userData.mimeType;
     r === "image/webp" && (r = "image/png");
     const o = {
@@ -3938,7 +3996,7 @@ class Ne {
     const r = t.geometry;
     let o;
     t.isLineSegments ? o = T.LINES : t.isLineLoop ? o = T.LINE_LOOP : t.isLine ? o = T.LINE_STRIP : t.isPoints ? o = T.POINTS : o = t.material.wireframe ? T.LINES : T.TRIANGLES;
-    const a = {}, c = {}, l = [], h = [], u = {
+    const a = {}, c = {}, l = [], h = [], d = {
       uv: "TEXCOORD_0",
       uv1: "TEXCOORD_1",
       uv2: "TEXCOORD_2",
@@ -3952,23 +4010,23 @@ class Ne {
     for (let g in r.attributes) {
       if (g.slice(0, 5) === "morph") continue;
       const S = r.attributes[g];
-      if (g = u[g] || g.toUpperCase(), /^(POSITION|NORMAL|TANGENT|TEXCOORD_\d+|COLOR_\d+|JOINTS_\d+|WEIGHTS_\d+)$/.test(g) || (g = "_" + g), e.attributes.has(this.getUID(S))) {
+      if (g = d[g] || g.toUpperCase(), /^(POSITION|NORMAL|TANGENT|TEXCOORD_\d+|COLOR_\d+|JOINTS_\d+|WEIGHTS_\d+)$/.test(g) || (g = "_" + g), e.attributes.has(this.getUID(S))) {
         c[g] = e.attributes.get(this.getUID(S));
         continue;
       }
       p = null;
-      const E = S.array;
-      g === "JOINTS_0" && !(E instanceof Uint16Array) && !(E instanceof Uint8Array) ? (console.warn('GLTFExporter: Attribute "skinIndex" converted to type UNSIGNED_SHORT.'), p = new _(new Uint16Array(E), S.itemSize, S.normalized)) : (E instanceof Uint32Array || E instanceof Int32Array) && !g.startsWith("_") && (console.warn(`GLTFExporter: Attribute "${g}" converted to type FLOAT.`), p = tt.Utils.toFloat32BufferAttribute(S));
+      const L = S.array;
+      g === "JOINTS_0" && !(L instanceof Uint16Array) && !(L instanceof Uint8Array) ? (console.warn('GLTFExporter: Attribute "skinIndex" converted to type UNSIGNED_SHORT.'), p = new q(new Uint16Array(L), S.itemSize, S.normalized)) : (L instanceof Uint32Array || L instanceof Int32Array) && !g.startsWith("_") && (console.warn(`GLTFExporter: Attribute "${g}" converted to type FLOAT.`), p = et.Utils.toFloat32BufferAttribute(S));
       const b = this.processAccessor(p || S, r);
       b !== null && (g.startsWith("_") || this.detectMeshQuantization(g, S), c[g] = b, e.attributes.set(this.getUID(S), b));
     }
     if (f !== void 0 && r.setAttribute("normal", f), Object.keys(c).length === 0) return null;
     if (t.morphTargetInfluences !== void 0 && t.morphTargetInfluences.length > 0) {
-      const g = [], S = [], D = {};
+      const g = [], S = [], E = {};
       if (t.morphTargetDictionary !== void 0)
-        for (const E in t.morphTargetDictionary)
-          D[t.morphTargetDictionary[E]] = E;
-      for (let E = 0; E < t.morphTargetInfluences.length; ++E) {
+        for (const L in t.morphTargetDictionary)
+          E[t.morphTargetDictionary[L]] = L;
+      for (let L = 0; L < t.morphTargetInfluences.length; ++L) {
         const b = {};
         let R = !1;
         for (const P in r.morphAttributes) {
@@ -3976,7 +4034,7 @@ class Ne {
             R || (console.warn("GLTFExporter: Only POSITION and NORMAL morph are supported."), R = !0);
             continue;
           }
-          const B = r.morphAttributes[P][E], C = P.toUpperCase(), U = r.attributes[P];
+          const B = r.morphAttributes[P][L], C = P.toUpperCase(), G = r.attributes[P];
           if (e.attributes.has(this.getUID(B, !0))) {
             b[C] = e.attributes.get(this.getUID(B, !0));
             continue;
@@ -3984,11 +4042,11 @@ class Ne {
           const O = B.clone();
           if (!r.morphTargetsRelative)
             for (let v = 0, V = B.count; v < V; v++)
-              for (let z = 0; z < B.itemSize; z++)
-                z === 0 && O.setX(v, B.getX(v) - U.getX(v)), z === 1 && O.setY(v, B.getY(v) - U.getY(v)), z === 2 && O.setZ(v, B.getZ(v) - U.getZ(v)), z === 3 && O.setW(v, B.getW(v) - U.getW(v));
-          b[C] = this.processAccessor(O, r), e.attributes.set(this.getUID(U, !0), b[C]);
+              for (let j = 0; j < B.itemSize; j++)
+                j === 0 && O.setX(v, B.getX(v) - G.getX(v)), j === 1 && O.setY(v, B.getY(v) - G.getY(v)), j === 2 && O.setZ(v, B.getZ(v) - G.getZ(v)), j === 3 && O.setW(v, B.getW(v) - G.getW(v));
+          b[C] = this.processAccessor(O, r), e.attributes.set(this.getUID(G, !0), b[C]);
         }
-        h.push(b), g.push(t.morphTargetInfluences[E]), t.morphTargetDictionary !== void 0 && S.push(D[E]);
+        h.push(b), g.push(t.morphTargetInfluences[L]), t.morphTargetDictionary !== void 0 && S.push(E[L]);
       }
       a.weights = g, S.length > 0 && (a.extras = {}, a.extras.targetNames = S);
     }
@@ -3997,22 +4055,22 @@ class Ne {
     let x = !1;
     if (y && r.index === null) {
       const g = [];
-      for (let S = 0, D = r.attributes.position.count; S < D; S++)
+      for (let S = 0, E = r.attributes.position.count; S < E; S++)
         g[S] = S;
       r.setIndex(g), x = !0;
     }
-    const m = y ? t.material : [t.material], L = y ? r.groups : [{ materialIndex: 0, start: void 0, count: void 0 }];
-    for (let g = 0, S = L.length; g < S; g++) {
-      const D = {
+    const m = y ? t.material : [t.material], D = y ? r.groups : [{ materialIndex: 0, start: void 0, count: void 0 }];
+    for (let g = 0, S = D.length; g < S; g++) {
+      const E = {
         mode: o,
         attributes: c
       };
-      if (this.serializeUserData(r, D), h.length > 0 && (D.targets = h), r.index !== null) {
+      if (this.serializeUserData(r, E), h.length > 0 && (E.targets = h), r.index !== null) {
         let b = this.getUID(r.index);
-        (L[g].start !== void 0 || L[g].count !== void 0) && (b += ":" + L[g].start + ":" + L[g].count), e.attributes.has(b) ? D.indices = e.attributes.get(b) : (D.indices = this.processAccessor(r.index, r, L[g].start, L[g].count), e.attributes.set(b, D.indices)), D.indices === null && delete D.indices;
+        (D[g].start !== void 0 || D[g].count !== void 0) && (b += ":" + D[g].start + ":" + D[g].count), e.attributes.has(b) ? E.indices = e.attributes.get(b) : (E.indices = this.processAccessor(r.index, r, D[g].start, D[g].count), e.attributes.set(b, E.indices)), E.indices === null && delete E.indices;
       }
-      const E = await this.processMaterialAsync(m[L[g].materialIndex]);
-      E !== null && (D.material = E), l.push(D);
+      const L = await this.processMaterialAsync(m[D[g].materialIndex]);
+      L !== null && (E.material = L), l.push(E);
     }
     x === !0 && r.setIndex(null), a.primitives = l, n.meshes || (n.meshes = []), await this._invokeAllAsync(function(g) {
       g.writeMesh && g.writeMesh(t, a);
@@ -4032,7 +4090,7 @@ class Ne {
    * @param {THREE.BufferAttribute} attribute
    */
   detectMeshQuantization(t, e) {
-    if (this.extensionsUsed[st]) return;
+    if (this.extensionsUsed[it]) return;
     let n;
     switch (e.array.constructor) {
       case Int8Array:
@@ -4052,7 +4110,7 @@ class Ne {
     }
     e.normalized && (n += " normalized");
     const s = t.split("_", 1)[0];
-    St[s] && St[s].includes(n) && (this.extensionsUsed[st] = !0, this.extensionsRequired[st] = !0);
+    St[s] && St[s].includes(n) && (this.extensionsUsed[it] = !0, this.extensionsRequired[it] = !0);
   }
   /**
    * Process camera
@@ -4072,7 +4130,7 @@ class Ne {
       znear: t.near < 0 ? 0 : t.near
     } : s.perspective = {
       aspectRatio: t.aspect,
-      yfov: ot.degToRad(t.fov),
+      yfov: at.degToRad(t.fov),
       zfar: t.far <= 0 ? 1e-3 : t.far,
       znear: t.near < 0 ? 0 : t.near
     }, t.name !== "" && (s.name = t.type), e.cameras.push(s) - 1;
@@ -4089,28 +4147,28 @@ class Ne {
    */
   processAnimation(t, e) {
     const n = this.json, s = this.nodeMap;
-    n.animations || (n.animations = []), t = tt.Utils.mergeMorphTargetTracks(t.clone(), e);
+    n.animations || (n.animations = []), t = et.Utils.mergeMorphTargetTracks(t.clone(), e);
     const i = t.tracks, r = [], o = [];
     for (let c = 0; c < i.length; ++c) {
-      const l = i[c], h = Z.parseTrackName(l.name);
-      let u = Z.findNode(e, h.nodeName);
-      const f = Lt[h.propertyName];
-      if (h.objectName === "bones" && (u.isSkinnedMesh === !0 ? u = u.skeleton.getBoneByName(h.objectIndex) : u = void 0), !u || !f) {
+      const l = i[c], h = Q.parseTrackName(l.name);
+      let d = Q.findNode(e, h.nodeName);
+      const f = Dt[h.propertyName];
+      if (h.objectName === "bones" && (d.isSkinnedMesh === !0 ? d = d.skeleton.getBoneByName(h.objectIndex) : d = void 0), !d || !f) {
         console.warn('THREE.GLTFExporter: Could not export animation track "%s".', l.name);
         continue;
       }
       const p = 1;
       let y = l.values.length / l.times.length;
-      f === Lt.morphTargetInfluences && (y /= u.morphTargetInfluences.length);
+      f === Dt.morphTargetInfluences && (y /= d.morphTargetInfluences.length);
       let x;
       l.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline === !0 ? (x = "CUBICSPLINE", y /= 3) : l.getInterpolation() === kt ? x = "STEP" : x = "LINEAR", o.push({
-        input: this.processAccessor(new _(l.times, p)),
-        output: this.processAccessor(new _(l.values, y)),
+        input: this.processAccessor(new q(l.times, p)),
+        output: this.processAccessor(new q(l.values, y)),
         interpolation: x
       }), r.push({
         sampler: o.length - 1,
         target: {
-          node: s.get(u),
+          node: s.get(d),
           path: f
         }
       });
@@ -4135,7 +4193,7 @@ class Ne {
     for (let h = 0; h < i.bones.length; ++h)
       o.push(n.get(i.bones[h])), c.copy(i.boneInverses[h]), c.multiply(t.bindMatrix).toArray(a, h * 16);
     return e.skins === void 0 && (e.skins = []), e.skins.push({
-      inverseBindMatrices: this.processAccessor(new _(a, 16)),
+      inverseBindMatrices: this.processAccessor(new q(a, 16)),
       joints: o,
       skeleton: n.get(r)
     }), s.skin = e.skins.length - 1;
@@ -4153,7 +4211,7 @@ class Ne {
       const o = t.quaternion.toArray(), a = t.position.toArray(), c = t.scale.toArray();
       H(o, [0, 0, 0, 1]) || (i.rotation = o), H(a, [0, 0, 0]) || (i.translation = a), H(c, [1, 1, 1]) || (i.scale = c);
     } else
-      t.matrixAutoUpdate && t.updateMatrix(), Pe(t.matrix) === !1 && (i.matrix = t.matrix.elements);
+      t.matrixAutoUpdate && t.updateMatrix(), Re(t.matrix) === !1 && (i.matrix = t.matrix.elements);
     if (t.name !== "" && (i.name = String(t.name)), this.serializeUserData(t, i), t.isMesh || t.isLine || t.isPoints) {
       const o = await this.processMeshAsync(t);
       o !== null && (i.mesh = o);
@@ -4230,7 +4288,7 @@ class Ne {
       await t(this.plugins[e]);
   }
 }
-class Ce {
+class Be {
   constructor(t) {
     this.writer = t, this.name = "KHR_lights_punctual";
   }
@@ -4246,7 +4304,7 @@ class Ce {
     o.push(r), e.extensions = e.extensions || {}, e.extensions[this.name] = { light: o.length - 1 };
   }
 }
-class Be {
+class Oe {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_unlit";
   }
@@ -4256,7 +4314,7 @@ class Be {
     e.extensions = e.extensions || {}, e.extensions[this.name] = {}, s[this.name] = !0, e.pbrMetallicRoughness.metallicFactor = 0, e.pbrMetallicRoughness.roughnessFactor = 0.9;
   }
 }
-class Oe {
+class Fe {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_clearcoat";
   }
@@ -4287,7 +4345,7 @@ class Oe {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Fe {
+class Ue {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_dispersion";
   }
@@ -4321,7 +4379,7 @@ class Ge {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Ue {
+class je {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_transmission";
   }
@@ -4355,7 +4413,7 @@ class ze {
     t.attenuationDistance !== 1 / 0 && (i.attenuationDistance = t.attenuationDistance), i.attenuationColor = t.attenuationColor.toArray(), e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class je {
+class qe {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_ior";
   }
@@ -4389,7 +4447,7 @@ class _e {
     i.specularFactor = t.specularIntensity, i.specularColorFactor = t.specularColor.toArray(), e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class qe {
+class Ye {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_sheen";
   }
@@ -4413,7 +4471,7 @@ class qe {
     i.sheenRoughnessFactor = t.sheenRoughness, i.sheenColorFactor = t.sheenColor.toArray(), e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Ye {
+class ke {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_anisotropy";
   }
@@ -4427,7 +4485,7 @@ class Ye {
     i.anisotropyStrength = t.anisotropy, i.anisotropyRotation = t.anisotropyRotation, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class ke {
+class Xe {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_emissive_strength";
   }
@@ -4454,54 +4512,54 @@ class Ve {
     i.bumpFactor = t.bumpScale, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Xe {
+class We {
   constructor(t) {
     this.writer = t, this.name = "EXT_mesh_gpu_instancing";
   }
   writeNode(t, e) {
     if (!t.isInstancedMesh) return;
-    const n = this.writer, s = t, i = new Float32Array(s.count * 3), r = new Float32Array(s.count * 4), o = new Float32Array(s.count * 3), a = new bt(), c = new K(), l = new Gt(), h = new K();
+    const n = this.writer, s = t, i = new Float32Array(s.count * 3), r = new Float32Array(s.count * 4), o = new Float32Array(s.count * 3), a = new bt(), c = new Z(), l = new Ut(), h = new Z();
     for (let f = 0; f < s.count; f++)
       s.getMatrixAt(f, a), a.decompose(c, l, h), c.toArray(i, f * 3), l.toArray(r, f * 4), h.toArray(o, f * 3);
-    const u = {
-      TRANSLATION: n.processAccessor(new _(i, 3)),
-      ROTATION: n.processAccessor(new _(r, 4)),
-      SCALE: n.processAccessor(new _(o, 3))
+    const d = {
+      TRANSLATION: n.processAccessor(new q(i, 3)),
+      ROTATION: n.processAccessor(new q(r, 4)),
+      SCALE: n.processAccessor(new q(o, 3))
     };
-    s.instanceColor && (u._COLOR_0 = n.processAccessor(s.instanceColor)), e.extensions = e.extensions || {}, e.extensions[this.name] = { attributes: u }, n.extensionsUsed[this.name] = !0, n.extensionsRequired[this.name] = !0;
+    s.instanceColor && (d._COLOR_0 = n.processAccessor(s.instanceColor)), e.extensions = e.extensions || {}, e.extensions[this.name] = { attributes: d }, n.extensionsUsed[this.name] = !0, n.extensionsRequired[this.name] = !0;
   }
 }
-tt.Utils = {
-  insertKeyframe: function(d, t) {
-    const n = d.getValueSize(), s = new d.TimeBufferType(d.times.length + 1), i = new d.ValueBufferType(d.values.length + n), r = d.createInterpolant(new d.ValueBufferType(n));
+et.Utils = {
+  insertKeyframe: function(u, t) {
+    const n = u.getValueSize(), s = new u.TimeBufferType(u.times.length + 1), i = new u.ValueBufferType(u.values.length + n), r = u.createInterpolant(new u.ValueBufferType(n));
     let o;
-    if (d.times.length === 0) {
+    if (u.times.length === 0) {
       s[0] = t;
       for (let a = 0; a < n; a++)
         i[a] = 0;
       o = 0;
-    } else if (t < d.times[0]) {
-      if (Math.abs(d.times[0] - t) < 1e-3) return 0;
-      s[0] = t, s.set(d.times, 1), i.set(r.evaluate(t), 0), i.set(d.values, n), o = 0;
-    } else if (t > d.times[d.times.length - 1]) {
-      if (Math.abs(d.times[d.times.length - 1] - t) < 1e-3)
-        return d.times.length - 1;
-      s[s.length - 1] = t, s.set(d.times, 0), i.set(d.values, 0), i.set(r.evaluate(t), d.values.length), o = s.length - 1;
+    } else if (t < u.times[0]) {
+      if (Math.abs(u.times[0] - t) < 1e-3) return 0;
+      s[0] = t, s.set(u.times, 1), i.set(r.evaluate(t), 0), i.set(u.values, n), o = 0;
+    } else if (t > u.times[u.times.length - 1]) {
+      if (Math.abs(u.times[u.times.length - 1] - t) < 1e-3)
+        return u.times.length - 1;
+      s[s.length - 1] = t, s.set(u.times, 0), i.set(u.values, 0), i.set(r.evaluate(t), u.values.length), o = s.length - 1;
     } else
-      for (let a = 0; a < d.times.length; a++) {
-        if (Math.abs(d.times[a] - t) < 1e-3) return a;
-        if (d.times[a] < t && d.times[a + 1] > t) {
-          s.set(d.times.slice(0, a + 1), 0), s[a + 1] = t, s.set(d.times.slice(a + 1), a + 2), i.set(d.values.slice(0, (a + 1) * n), 0), i.set(r.evaluate(t), (a + 1) * n), i.set(d.values.slice((a + 1) * n), (a + 2) * n), o = a + 1;
+      for (let a = 0; a < u.times.length; a++) {
+        if (Math.abs(u.times[a] - t) < 1e-3) return a;
+        if (u.times[a] < t && u.times[a + 1] > t) {
+          s.set(u.times.slice(0, a + 1), 0), s[a + 1] = t, s.set(u.times.slice(a + 1), a + 2), i.set(u.values.slice(0, (a + 1) * n), 0), i.set(r.evaluate(t), (a + 1) * n), i.set(u.values.slice((a + 1) * n), (a + 2) * n), o = a + 1;
           break;
         }
       }
-    return d.times = s, d.values = i, o;
+    return u.times = s, u.values = i, o;
   },
-  mergeMorphTargetTracks: function(d, t) {
-    const e = [], n = {}, s = d.tracks;
+  mergeMorphTargetTracks: function(u, t) {
+    const e = [], n = {}, s = u.tracks;
     for (let i = 0; i < s.length; ++i) {
       let r = s[i];
-      const o = Z.parseTrackName(r.name), a = Z.findNode(t, o.nodeName);
+      const o = Q.parseTrackName(r.name), a = Q.findNode(t, o.nodeName);
       if (o.propertyName !== "morphTargetInfluences" || o.propertyIndex === void 0) {
         e.push(r);
         continue;
@@ -4523,67 +4581,67 @@ tt.Utils = {
         h.name = (o.nodeName || "") + ".morphTargetInfluences", h.values = f, n[a.uuid] = h, e.push(h);
         continue;
       }
-      const u = r.createInterpolant(new r.ValueBufferType(1));
+      const d = r.createInterpolant(new r.ValueBufferType(1));
       h = n[a.uuid];
       for (let f = 0; f < h.times.length; f++)
-        h.values[f * c + l] = u.evaluate(h.times[f]);
+        h.values[f * c + l] = d.evaluate(h.times[f]);
       for (let f = 0; f < r.times.length; f++) {
         const p = this.insertKeyframe(h, r.times[f]);
         h.values[p * c + l] = r.values[f];
       }
     }
-    return d.tracks = e, d;
+    return u.tracks = e, u;
   },
-  toFloat32BufferAttribute: function(d) {
-    const t = new _(new Float32Array(d.count * d.itemSize), d.itemSize, !1);
-    if (!d.normalized && !d.isInterleavedBufferAttribute)
-      return t.array.set(d.array), t;
-    for (let e = 0, n = d.count; e < n; e++)
-      for (let s = 0; s < d.itemSize; s++)
-        t.setComponent(e, s, d.getComponent(e, s));
+  toFloat32BufferAttribute: function(u) {
+    const t = new q(new Float32Array(u.count * u.itemSize), u.itemSize, !1);
+    if (!u.normalized && !u.isInterleavedBufferAttribute)
+      return t.array.set(u.array), t;
+    for (let e = 0, n = u.count; e < n; e++)
+      for (let s = 0; s < u.itemSize; s++)
+        t.setComponent(e, s, u.getComponent(e, s));
     return t;
   }
 };
-async function We(d) {
+async function He(u) {
   if (typeof FileReader > "u") {
-    const t = await d.arrayBuffer(), n = Buffer.from(t).toString("base64");
-    return `data:${d.type};base64,${n}`;
+    const t = await u.arrayBuffer(), n = Buffer.from(t).toString("base64");
+    return `data:${u.type};base64,${n}`;
   } else
     return new Promise((t, e) => {
       const n = new FileReader();
-      n.onload = () => t(n.result), n.onerror = () => e(new Error("Failed to read Blob as Data URL")), n.readAsDataURL(d);
+      n.onload = () => t(n.result), n.onerror = () => e(new Error("Failed to read Blob as Data URL")), n.readAsDataURL(u);
     });
 }
-async function rt(d) {
-  if (typeof d.arrayBuffer == "function")
-    return await d.arrayBuffer();
+async function ot(u) {
+  if (typeof u.arrayBuffer == "function")
+    return await u.arrayBuffer();
   if (typeof FileReader < "u")
     return new Promise((t, e) => {
       const n = new FileReader();
-      n.onload = () => t(n.result), n.onerror = () => e(n.error), n.readAsArrayBuffer(d);
+      n.onload = () => t(n.result), n.onerror = () => e(n.error), n.readAsArrayBuffer(u);
     });
   {
-    const t = Buffer.from(await d.text());
+    const t = Buffer.from(await u.text());
     return t.buffer.slice(t.byteOffset, t.byteOffset + t.byteLength);
   }
 }
-const He = new ne(), Je = new tt();
-function $e(d, t, e = 0.1) {
-  const n = t.normal(d), s = t.direction(d).mutiplyScalar(e * 0.5), i = d.direction(t).mutiplyScalar(e * 0.5), r = n.x * e * 0.5, o = n.y * e * 0.5;
+const Je = new ne(), $e = new et();
+function Ke(u, t, e = 0.1) {
+  const n = t.normal(u), s = t.direction(u).mutiplyScalar(e * 0.5), i = u.direction(t).mutiplyScalar(e * 0.5), r = n.x * e * 0.5, o = n.y * e * 0.5;
   return {
     points: [
       // 第一条线
-      new M(d.x + r, d.y + o).add(i),
+      new M(u.x + r, u.y + o).add(i),
       new M(t.x + r, t.y + o).add(s),
       // 第二条线
-      new M(d.x - r, d.y - o).add(i),
+      new M(u.x - r, u.y - o).add(i),
       new M(t.x - r, t.y - o).add(s)
     ],
     indices: [0, 1, 1, 3, 3, 2, 2, 0],
     rectIndices: [0, 1, 3, 2, 0]
   };
 }
-class Nt extends q {
+class Nt extends _ {
   static name = "WhiteModel";
   Dxf = null;
   Variable = null;
@@ -4613,7 +4671,7 @@ class Nt extends q {
         new I.LineSegments(new I.EdgesGeometry(i), new I.LineBasicMaterial({ color: 0 }))
       );
     }), t.originalData.map(({ start: n, end: s, insetionArr: i }) => {
-      const r = new M(n.x, n.y).mutiplyScalar(t.scale), o = new M(s.x, s.y).mutiplyScalar(t.scale), { points: a, indices: c, rectIndices: l } = $e(r, o, t.width);
+      const r = new M(n.x, n.y).mutiplyScalar(t.scale), o = new M(s.x, s.y).mutiplyScalar(t.scale), { points: a, indices: c, rectIndices: l } = Ke(r, o, t.width);
       return {
         points: a,
         indices: c,
@@ -4646,7 +4704,7 @@ class Nt extends q {
   toOBJ() {
     return new Promise((t) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(() => {
-        t(He.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
+        t(Je.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
       }, 20);
     });
   }
@@ -4658,7 +4716,7 @@ class Nt extends q {
   toGltf(t = !0) {
     return new Promise((e) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(async () => {
-        Je.parse(this.whiteModelGroup.children, (n) => {
+        $e.parse(this.whiteModelGroup.children, (n) => {
           e(n), this.material.opacity = 0.8, this.material.transparent = !0;
         }, () => {
           e(void 0);
@@ -4719,7 +4777,7 @@ class Nt extends q {
     }
   }
 }
-class Ct extends q {
+class Ct extends _ {
   static name = "DetailsPoint";
   Dxf = null;
   WhiteModel = null;
@@ -4796,7 +4854,7 @@ class Ct extends q {
     }, 50);
   }
 }
-class Bt extends q {
+class Bt extends _ {
   static name = "DxfLineModel";
   dxfLineModel = new I.LineSegments();
   dxfDoorsLineModel = new I.LineSegments();
@@ -4819,38 +4877,38 @@ class Bt extends q {
     });
   }
 }
-const Ke = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Ze = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   DetailsPoint: Ct,
   DxfLineModel: Bt,
   WhiteModel: Nt
 }, Symbol.toStringTag, { value: "Module" }));
-function Tt(d, t = {}) {
+function Tt(u, t = {}) {
   const {
     detailsPoint: e = !0,
     whiteModel: n = !0,
     dxfLineModel: s = !0
   } = t;
-  s && d.addComponent(new Bt()), n && d.addComponent(new Nt()), e && d.addComponent(new Ct());
+  s && u.addComponent(new Bt()), n && u.addComponent(new Nt()), e && u.addComponent(new Ct());
 }
-const Ze = Object.assign(Tt, {
-  create(d = {}) {
-    return (t) => Tt(t, d);
+const Qe = Object.assign(Tt, {
+  create(u = {}) {
+    return (t) => Tt(t, u);
   }
-}), Qe = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}), tn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  ModelDataPlugin: Ze,
-  components: Ke
+  ModelDataPlugin: Qe,
+  components: Ze
 }, Symbol.toStringTag, { value: "Module" }));
-function tn() {
+function en() {
   return import("./index2.js");
 }
-function en() {
+function nn() {
   return import("./index3.js");
 }
 let dt = null;
-async function ln(d, t, e = !1, n) {
-  const s = await Promise.resolve().then(() => Qe), i = await tn(), r = await en(), o = new ht().usePlugin(s.ModelDataPlugin.create({
+async function hn(u, t, e = !1, n) {
+  const s = await Promise.resolve().then(() => tn), i = await en(), r = await nn(), o = new ht().usePlugin(s.ModelDataPlugin.create({
     detailsPoint: !1,
     whiteModel: !0
   })).usePlugin(i.RenderPlugin.create({
@@ -4860,13 +4918,13 @@ async function ln(d, t, e = !1, n) {
     orbitControls: e,
     camera: t
   })).usePlugin(r.Editor.create({ viewPermission: n })), a = o.findComponentByType(i.components.DomContainer);
-  return a && d.appendChild(a.domElement), dt = o, {
+  return a && u.appendChild(a.domElement), dt = o, {
     dxfSystem: o,
-    getFileAll: () => nn(o)
+    getFileAll: () => sn(o)
   };
 }
-async function nn(d = dt) {
-  const t = d.findComponentByName("WhiteModel"), e = new File([await d.AngleCorrectionDxf.toDxfImageBlob()], "img.jpg", { type: "image/jpeg" }), n = new File([d.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), s = new File([d.AngleCorrectionDxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), i = new File([await t.toOBJBlob()], "model.obj", { type: "application/octet-stream" }), r = new File([await t.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), o = new File([await t.toGltfBlob(!1)], "model.gltf", { type: "application/json" }), a = new File([JSON.stringify(d.Dxf.originalData)], "json.json", { type: "application/json" });
+async function sn(u = dt) {
+  const t = u.findComponentByName("WhiteModel"), e = new File([await u.AngleCorrectionDxf.toDxfImageBlob()], "img.jpg", { type: "image/jpeg" }), n = new File([u.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), s = new File([u.AngleCorrectionDxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), i = new File([await t.toOBJBlob()], "model.obj", { type: "application/octet-stream" }), r = new File([await t.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), o = new File([await t.toGltfBlob(!1)], "model.gltf", { type: "application/json" }), a = new File([JSON.stringify(u.Dxf.originalData)], "json.json", { type: "application/json" });
   return {
     dxf: n,
     obj: i,
@@ -4877,17 +4935,17 @@ async function nn(d = dt) {
     correctionDxf: s
   };
 }
-function hn() {
+function un() {
   return dt;
 }
 export {
   Pt as A,
   N as B,
-  q as C,
+  _ as C,
   ht as D,
   It as E,
   A as L,
-  Ze as M,
+  Qe as M,
   M as P,
   F as Q,
   Le as T,
@@ -4895,12 +4953,13 @@ export {
   Nt as W,
   Ct as a,
   X as b,
-  ln as c,
+  De as c,
   hn as d,
-  k as e,
-  cn as f,
-  nn as g,
-  Ke as i,
-  Q as r,
-  at as u
+  un as e,
+  k as f,
+  sn as g,
+  ln as h,
+  Ze as i,
+  tt as r,
+  K as u
 };