build-dxf 0.0.39 → 0.0.41

package/src/build.js

@@ -1,16 +1,16 @@
 import * as I from "three";
-import { EventDispatcher as Bt, Color as Ot, Matrix4 as Lt, Vector3 as J, Quaternion as Ft, BufferAttribute as _, REVISION as Ut, CompressedTexture as tt, Source as Gt, NoColorSpace as jt, MathUtils as it, RGBAFormat as zt, ImageUtils as _t, DoubleSide as qt, PropertyBinding as $, InterpolateDiscrete as Yt, Scene as ut, SRGBColorSpace as kt, NearestFilter as Xt, NearestMipmapNearestFilter as Vt, NearestMipmapLinearFilter as Wt, LinearFilter as Ht, LinearMipmapNearestFilter as Jt, LinearMipmapLinearFilter as $t, ClampToEdgeWrapping as Kt, RepeatWrapping as Zt, MirroredRepeatWrapping as Qt, InterpolateLinear as te } from "three";
-import dt from "clipper-lib";
-import H from "dxf-writer";
-import { OBJExporter as ee } from "three/examples/jsm/exporters/OBJExporter.js";
-function rt() {
+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 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;
     return e.toString(16);
   });
 }
-class At extends Bt {
-  uuid = rt();
+class It extends Ot {
+  uuid = at();
   addEventListener(t, e, n) {
     const { once: s = !1 } = n ?? {}, i = (o) => {
       e(o), s && r();
@@ -30,7 +30,7 @@ class At extends Bt {
     e && (e.forEach((n) => n()), this.eventRecordStack.delete(t));
   }
 }
-class q extends At {
+class q extends It {
   parent;
   destroyed = !1;
   constructor(...t) {
@@ -48,7 +48,7 @@ class q extends At {
     this.destroyed = !0;
   }
 }
-class ne extends At {
+class se extends It {
   static EventType = {
     ADD_COMPONENT: "addComponent"
   };
@@ -116,7 +116,7 @@ class ne extends At {
     return e || null;
   }
 }
-class R {
+class N {
   minX = 0;
   maxX = 0;
   minY = 0;
@@ -203,8 +203,8 @@ class R {
     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), g = (p.x - f.x) * (l.y - f.y) - (p.y - f.y) * (l.x - f.x), w = (p.x - f.x) * (h.y - f.y) - (p.y - f.y) * (h.x - f.x);
-        if (y * x < 0 && g * w < 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) || g === 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) || w === 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))
+        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))
           return !0;
       }
     }
@@ -299,7 +299,7 @@ class R {
    * @returns 
    */
   clone() {
-    return new R(this.minX, this.maxX, this.minY, this.maxY);
+    return new N(this.minX, this.maxX, this.minY, this.maxY);
   }
   /**
    * 
@@ -310,7 +310,7 @@ class R {
     const e = [], n = [];
     return t.forEach((s) => {
       e.push(s.x), n.push(s.y);
-    }), new R(
+    }), new N(
       Math.min(...e),
       Math.max(...e),
       Math.min(...n),
@@ -328,7 +328,7 @@ class R {
       s?.points?.forEach((i) => {
         e.push(i.x), n.push(i.y);
       });
-    }), new R(
+    }), new N(
       Math.min(...e),
       Math.max(...e),
       Math.min(...n),
@@ -415,7 +415,7 @@ class X {
    * @returns 相交的节点数组
    */
   queryCircle(t, e) {
-    const n = new R(t.x - e, t.x + e, t.y - e, t.y + e), s = Math.ceil(n.minX / this.gridSize), i = Math.ceil(n.maxX / this.gridSize), r = Math.ceil(n.minY / this.gridSize), o = Math.ceil(n.maxY / this.gridSize), a = [];
+    const n = new N(t.x - e, t.x + e, t.y - e, t.y + e), s = Math.ceil(n.minX / this.gridSize), i = Math.ceil(n.maxX / this.gridSize), r = Math.ceil(n.minY / this.gridSize), o = Math.ceil(n.maxY / this.gridSize), a = [];
     for (let c = s; c <= i; c++)
       for (let l = r; l <= o; l++) {
         const h = `${c}.${l}`;
@@ -465,7 +465,7 @@ class X {
     return null;
   }
 }
-class Q {
+class et {
   points;
   get p0() {
     return this.points[0];
@@ -606,7 +606,7 @@ class Q {
     let t = 1 / 0, e = -1 / 0, n = 1 / 0, s = -1 / 0;
     return this.points.forEach((i) => {
       e = Math.max(i.x, e), t = Math.min(i.x, t), s = Math.max(i.x, s), n = Math.min(i.x, n);
-    }), new R(t, e, n, s);
+    }), new N(t, e, n, s);
   }
   /**
    * 
@@ -616,7 +616,7 @@ class Q {
    */
   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 Q([
+    return new et([
       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),
@@ -624,7 +624,7 @@ class Q {
     ]);
   }
 }
-class D {
+class A {
   points = [new M(), new M()];
   userData = {};
   // line: any
@@ -646,6 +646,9 @@ class D {
   set(t, e) {
     return this.start.copy(t), this.end.copy(e), this;
   }
+  getAnotherPoint(t) {
+    return t === this.start ? this.end : this.start;
+  }
   /**
    * 是否有相同端点
    * @param line 
@@ -734,7 +737,7 @@ class D {
       new M(n.x - a, n.y - c).add(o),
       new M(s.x - a, s.y - c).add(r)
     ];
-    return new Q([0, 1, 3, 2].map((h) => l[h]));
+    return new et([0, 1, 3, 2].map((h) => l[h]));
   }
   /**
    * 计算线段的长度
@@ -775,8 +778,8 @@ class D {
     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, w = (y.x * r.x + y.y * r.y) / x, E = s.x + w * r.x, m = s.y + w * r.y;
-      return new M(E, m);
+      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;
+      return new M(w, g);
     };
     let a = o(e), c = o(n);
     const l = (p) => {
@@ -785,10 +788,10 @@ class D {
     };
     let h = l(a), u = l(c);
     const f = (p) => {
-      const y = Math.max(0, Math.min(1, p)), x = s.x + y * r.x, g = s.y + y * r.y;
-      return new M(x, g);
+      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 D(a, a) : new D(a, c);
+    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);
   }
   /**
    * 计算一条线段在另一条直线上的投影
@@ -869,7 +872,7 @@ class D {
    * @param line 
    */
   parallel(t, e = 1) {
-    return t instanceof D ? this.parallel(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), t < e || t > 180 - e);
+    return t instanceof A ? this.parallel(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), t < e || t > 180 - e);
   }
   /** 两条线段或角度是否 垂直
    * @param line 
@@ -877,7 +880,7 @@ class D {
    * @returns 
    */
   vertical(t, e = 0.1) {
-    return t instanceof D ? this.vertical(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), Math.abs(t - 90) < e);
+    return t instanceof A ? this.vertical(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), Math.abs(t - 90) < e);
   }
   /**
    * 两条线段方向相反否一致
@@ -952,7 +955,7 @@ class D {
    * @returns 
    */
   clone() {
-    const t = new D(
+    const t = new A(
       this.points[0].clone(),
       this.points[1].clone()
     );
@@ -1007,7 +1010,7 @@ class D {
         const f = o(u);
         f < a && (a = f, i = n.projectPoint(u, !1)), f > c && (c = f, r = n.projectPoint(u, !1));
       }
-    const l = new D(i, r);
+    const l = new A(i, r);
     return t.forEach((h) => h.userData.fittedLine = l), l;
   }
   /** 合并平行线段
@@ -1026,7 +1029,7 @@ class D {
       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 D(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), u = new M(c.x + (r - l) * s.x, c.y + (r - l) * s.y), f = new A(h, u);
     return t.forEach((p) => p.userData.fittedLine = f), f;
   }
   /** 合并满足平行的线段
@@ -1191,7 +1194,7 @@ class M {
    * @param length 
    */
   expandAsLine(t, e, n) {
-    const s = new D(
+    const s = new A(
       this.clone(),
       this.clone().add(t.clone().multiplyScalar(e))
     );
@@ -1313,7 +1316,7 @@ class F {
    * @param node 线段节点
    */
   insert(t) {
-    if (t instanceof D) {
+    if (t instanceof A) {
       this.insert({ line: t, userData: {} });
       return;
     }
@@ -1338,7 +1341,7 @@ class F {
    * @param node 
    */
   remove(t) {
-    if (t instanceof D) {
+    if (t instanceof A) {
       t = this.targetMap.get(t), t && this.remove(t);
       return;
     }
@@ -1369,25 +1372,25 @@ class F {
     this.isLeaf = !1, this.children = [];
     const t = (this.bounds.minX + this.bounds.maxX) / 2, e = (this.bounds.minY + this.bounds.maxY) / 2;
     this.children[0] = new F(
-      new R(this.bounds.minX, t, this.bounds.minY, e),
+      new N(this.bounds.minX, t, this.bounds.minY, e),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
       this.targetMap
     ), this.children[1] = new F(
-      new R(t, this.bounds.maxX, this.bounds.minY, e),
+      new N(t, this.bounds.maxX, this.bounds.minY, e),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
       this.targetMap
     ), this.children[2] = new F(
-      new R(this.bounds.minX, t, e, this.bounds.maxY),
+      new N(this.bounds.minX, t, e, this.bounds.maxY),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
       this.targetMap
     ), this.children[3] = new F(
-      new R(t, this.bounds.maxX, e, this.bounds.maxY),
+      new N(t, this.bounds.maxX, e, this.bounds.maxY),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
@@ -1417,7 +1420,7 @@ class F {
    * @returns 相交的节点数组
    */
   queryCircle(t, e) {
-    const n = [], s = new R(
+    const n = [], s = new N(
       t.x - e,
       t.x + e,
       t.y - e,
@@ -1498,8 +1501,8 @@ class F {
     })), t;
   }
 }
-function K(d, t = 0, e) {
-  return e || (e = new F(R.fromByLineSegment(...d)), d.forEach((n) => e?.insert({ line: n, userData: void 0 }))), d.map((n) => {
+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) }));
     return {
       start: n.start.toJson(t),
@@ -1520,8 +1523,8 @@ function K(d, t = 0, e) {
     };
   });
 }
-function at(d, t = 0.03) {
-  const e = new F(R.fromByLineSegment(...d));
+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) => {
     const s = e.queryLineSegment(n, !0).map((i) => {
       if (i.line === n) return;
@@ -1541,45 +1544,35 @@ function at(d, t = 0.03) {
     return n;
   }).filter((n) => n.length() >= t);
 }
-function se(d, t) {
-  t || (t = new X(), d.forEach((n) => {
-    n.userData.isDoor || n.points.forEach((s) => t?.insert(s, n));
-  }));
-  const e = [];
-  for (let n = 0; n < d.length; n++) {
-    const s = d[n], i = /* @__PURE__ */ new Map();
-    s.userData.isDoor || s.points.forEach((r) => {
-      if (t.queryPoint(r).length > 1) return;
-      const o = t.queryCircle(r, 0.4).filter((c) => {
-        const l = c.userData;
-        if (l === s || !s.parallel(l, 25)) return !1;
-        if (t.queryPoint(c.point).length > 1) return;
-        const h = new D(r, c.point), u = new D(s.start === r ? s.end : s.start, l.start === c.point ? l.end : l.start);
-        if (!h.intersectLineSegment(u)) return !1;
-        const f = r.distance(c.point);
-        return f < 1e-3 ? !1 : (i.set(c.point, f), !0);
-      }).sort((c, l) => {
-        const h = i.get(c.point), u = i.get(l.point);
-        return h - u;
-      });
-      if (o.length === 0) return;
-      const a = o[0].userData;
-      e.push(new D(s.projectLineSegment(a).center, a.projectLineSegment(s).center));
+function Q(...d) {
+  d.forEach((t) => {
+    const e = t.direction();
+    t.userData.drawWindow?.forEach((n) => {
+      try {
+        const s = M.from(n.p), i = t.projectPoint(
+          s.clone().add(e.clone().multiplyScalar(n.width * 0.5)),
+          !1
+        ), r = t.projectPoint(
+          s.clone().add(e.clone().multiplyScalar(n.width * -0.5)),
+          !1
+        ), o = t.projectLineSegment(new A(i, r)), a = o.center;
+        n.p = new I.Vector3(a?.x ?? 0, a?.y ?? 0, n.p.z);
+      } catch {
+      }
     });
-  }
-  return [...d, ...e];
+  });
 }
 function ie(d) {
-  const t = new X(), e = new F(R.fromByLineSegment(...d)), n = [];
+  const t = new X(), e = new F(N.fromByLineSegment(...d)), n = [];
   return d.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 = se(d, t), d;
+  }), d;
 }
 function re(d) {
-  const t = new F(R.fromByLineSegment(...d));
+  const t = new F(N.fromByLineSegment(...d));
   d.forEach((n) => {
     n.userData.isDoor || t.insert({ line: n, userData: void 0 });
   });
@@ -1598,7 +1591,7 @@ function re(d) {
   }
   return e;
 }
-function oe(d, t, e, n = 25) {
+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);
@@ -1615,8 +1608,8 @@ function oe(d, t, e, n = 25) {
     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 g = Math.abs(y) < Math.abs(x) ? y : x, w = u.center;
-    return u.start.rotate(w, g), u.end.rotate(w, g), u.userData.isDoor ? r.push(u) : i.push(u), u;
+    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;
   }
   function l(u, f, p = !1) {
     if (p) return l(u === "parallel" ? "vertical" : "parallel", f);
@@ -1629,17 +1622,17 @@ function oe(d, t, e, n = 25) {
       if (f.userData.isWindow && o.push(f), f.parallel(d, n)) a(f);
       else if (f.vertical(d, n)) c(f);
       else {
-        const y = e.get(f)?.reduce((x, g) => (g.sourcePoint && (x.has(g.sourcePoint) || x.set(g.sourcePoint, []), x.get(g.sourcePoint)?.push(g)), x), /* @__PURE__ */ new Map());
+        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(
-            (E) => E.map((m) => s.includes(m.line) ? "parallel" : i.includes(m.line) ? "vertical" : null).filter((m) => !!m)
-          ).map((E) => [...new Set(E)]), g = x[0], w = x[1];
-          if (g.length === 1 && w.length === 1) {
-            if (g[0] === w[0]) return l(g[0], f, !0);
-            if (g.length === 1) {
-              if (w.includes(g[0])) return l(g[0], f, !0);
-              if (w.length === 1 && g.includes(w[0]))
-                return l(w[0], f, !0);
+            (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);
+            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);
             }
           }
           c(f);
@@ -1648,7 +1641,7 @@ function oe(d, t, e, n = 25) {
   }
   return h.forEach((u) => u()), { parallelLines: s, verticalLines: i, doorLines: r, windowLines: o };
 }
-function ft(d, t, e, n, s) {
+function yt(d, t, e, n, s) {
   const i = [], r = /* @__PURE__ */ new Map();
   d.forEach((c) => {
     const l = e.projectPoint(c.start, !1);
@@ -1667,8 +1660,8 @@ function ft(d, t, e, n, s) {
     const l = c.flatMap((p) => {
       const y = p.userData;
       return y.points.map((x) => {
-        const g = t.projectPoint(x, !1);
-        return g.userData = y, g;
+        const m = t.projectPoint(x, !1);
+        return m.userData = y, m;
       });
     });
     l.sort((p, y) => p.distance(t.start) - y.distance(t.start));
@@ -1681,7 +1674,7 @@ function ft(d, t, e, n, s) {
     }), f.push([...u]), f;
   });
 }
-function pt(d, t, e, n) {
+function xt(d, 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);
@@ -1691,23 +1684,23 @@ function pt(d, t, e, n) {
     });
   }), 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 D(p, y), g = [];
-    for (let w = 0; w < o.length; w++) {
-      const E = o[w];
-      if (u !== E && u.distance(E) < n) {
-        const m = E.userData, S = i.get(m), T = r.get(m);
-        (x.isPointOnSegment(S) || x.isPointOnSegment(T)) && g.push(w);
+    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);
       }
     }
-    return g;
+    return m;
   });
   function c(u, f, p = /* @__PURE__ */ new Set()) {
     if (p.has(u)) return p;
     const y = f[u];
     p.add(u);
     for (let x = 0; x < y.length; x++) {
-      const g = y[x];
-      c(g, f, p);
+      const m = y[x];
+      c(m, f, p);
     }
     return p;
   }
@@ -1718,20 +1711,20 @@ function pt(d, t, e, n) {
     if (f.forEach((y) => {
       l.add(y), p.push(o[y].userData);
     }), p.length > 2) {
-      const y = p.map((E) => s.get(E));
-      y.sort((E, m) => m.distance(e.start) - E.distance(e.start));
-      const x = y[0], g = y[y.length - 1];
-      if (x.distance(g) > n) {
-        const E = [...p].sort((C, G) => G.length() - C.length()), m = E[0], S = E[1], T = s.get(m), L = s.get(S), A = m.length(), P = S.length(), N = m.projectLineSegment(S), O = N.length();
-        if (T.distance(L) || P / A > 0.5 && O / P < 0.5) {
-          const C = [m], G = [S];
-          for (let B = 0; B < y.length; B++) {
-            const v = y[B], V = v.userData;
-            if (v === T || v === L) continue;
-            const j = S.projectLineSegment(V), Ct = j.length();
-            L.distance(v) <= n && Ct / P > 0 ? G.push(V) : C.push(V);
+      const y = p.map((w) => s.get(w));
+      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];
+          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);
           }
-          h.push(C, G);
+          h.push(C, U);
         } else {
           const C = Math.floor(p.length * 0.5);
           h.push(p.slice(0, C), p.slice(C));
@@ -1743,7 +1736,7 @@ function pt(d, t, e, n) {
   }
   return h;
 }
-function yt(d, t) {
+function gt(d, t) {
   function e(i, r = /* @__PURE__ */ new Set()) {
     if (r.has(i)) return r;
     r.add(i);
@@ -1771,16 +1764,16 @@ function ae(d, t, e, n, s, i) {
     groupMethod: a = "principalAndCross"
   } = i ?? {}, c = {
     cross: () => [
-      ...pt(d, n, e, o),
-      ...pt(t, e, n, o)
+      ...xt(d, n, e, o),
+      ...xt(t, e, n, o)
     ],
     principalAndCross: () => [
-      ...ft(d, n, e, r, o),
-      ...ft(t, e, n, r, o)
+      ...yt(d, n, e, r, o),
+      ...yt(t, e, n, r, o)
     ],
     originalInterPoint: () => [
-      ...yt(d, s),
-      ...yt(t, s)
+      ...gt(d, s),
+      ...gt(t, s)
     ]
   };
   return c[a] ? c[a]() : c.originalInterPoint();
@@ -1803,7 +1796,7 @@ function le(d, t = 0.1, e) {
     if (s.length === 1) return s[0];
     const i = [];
     s.forEach((h) => i.push(h.start.clone(), h.end.clone()));
-    const r = n === "average" ? D.mergeLines(...s) : D.mergeLinesByMaxlength(...s);
+    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;
@@ -1820,10 +1813,10 @@ function le(d, t = 0.1, e) {
     return l >= t && (r.userData.wallWidth = l), s.forEach((h) => h.userData.fittedLine = r), r;
   }).filter((s) => !!s);
 }
-function he(d, t = 0.4) {
-  const e = new F(R.fromByLineSegment(...d));
+function mt(d, t = 0.4) {
+  const e = new F(N.fromByLineSegment(...d));
   d.forEach((s) => e.insert(s));
-  const n = new D();
+  const n = new A();
   for (let s = 0; s < d.length; s++) {
     const i = d[s];
     if (i.userData.isAdsorbed) continue;
@@ -1845,12 +1838,12 @@ function he(d, t = 0.4) {
       } else
         i.start.copy(o), i.end.copy(a);
       i.userData.isAdsorbed = !0;
-    } else o ? i.start.copy(o) : a && i.end.copy(a);
+    } 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);
 }
-function ue(d, t) {
+function he(d, t) {
   const e = new X();
   d.forEach((i) => i.points.forEach((r) => e.insert(r, i)));
   const n = /* @__PURE__ */ new Map();
@@ -1866,51 +1859,39 @@ function ue(d, t) {
       const c = a.sort((h, u) => h.userData.length() - u.userData.length())[0], l = c.userData?.projectPoint(o, !1);
       if (l) {
         const h = c.userData;
-        s(r, new D(o.clone(), l.clone())), s(h, new D(c.point.clone(), l.clone()));
+        s(r, new A(o.clone(), l.clone())), s(h, new A(c.point.clone(), l.clone()));
       }
     });
   }
   return n.forEach((i, r) => {
-    const o = D.mergeLines(r, ...i);
+    const o = A.mergeLines(r, ...i);
     r.set(o.start, o.end);
   }), d;
 }
-function de(d, t) {
+function ue(d, t) {
   const { snapThreshold: e = 0.2 } = t ?? {};
-  return d = he(d, e), d = ue(d, e), d;
+  return d = mt(d, e), d = mt(d, e), d = he(d, e), d;
 }
-function fe(d) {
-  for (let t = 0; t < d.length; t++) {
-    const e = d[t], n = e.userData.fittedLine;
-    if (n) {
-      const s = e.direction();
-      n.userData.isWindow = !0, n.userData.drawWindow = n.userData.drawWindow ?? [], e.userData.drawWindow?.forEach((i) => {
-        const r = M.from(i.p), o = n.projectPoint(
-          r.clone().add(s.clone().multiplyScalar(i.width * 0.5))
-        ), a = n.projectPoint(
-          r.clone().add(s.clone().multiplyScalar(i.width * -0.5))
-        ), c = new D(o, a), l = c.center;
-        n.userData.drawWindow?.push({
-          p: new I.Vector3(l?.x ?? 0, l?.y ?? 0, i.p.z),
-          width: c.length(),
-          full: i.full
-        });
-      });
-    }
+function de(d) {
+  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);
   }
+  t.forEach((e) => Q(e));
 }
-function pe(d) {
+function fe(d) {
   for (let t = 0; t < d.length; t++) {
     const e = d[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.isParallel(s))
+      if (s.userData.fittedLine && (s = s.userData.fittedLine), n.userData.fittedLine && (n = n.userData.fittedLine), e.parallel(s))
         e.start.distance(s.start) < e.start.distance(s.end) ? e.start.copy(s.start) : e.start.copy(s.end);
       else {
         const i = s.projectPoint(e.start);
         i && e.start.copy(i);
       }
-      if (e.isParallel(n))
+      if (e.parallel(n))
         e.end.distance(n.start) < e.end.distance(n.end) ? e.end.copy(n.start) : e.end.copy(n.end);
       else {
         const i = n.projectPoint(e.end);
@@ -1920,7 +1901,7 @@ function pe(d) {
   }
   return d;
 }
-function ye(d, t = 0.01) {
+function pe(d, t = 0.01) {
   const e = new X();
   return d.forEach((n) => n.points.forEach((s) => e.insert(s, n))), d.filter((n) => {
     if (n.length() <= t) {
@@ -1930,7 +1911,7 @@ function ye(d, t = 0.01) {
     return !0;
   });
 }
-class Tt {
+class Pt {
   /**
    * 轴对齐垂直修正
    * @param lines 待调整线段组
@@ -1939,32 +1920,48 @@ class Tt {
    */
   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 D(
+    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(
       l.clone().add(c.clone().multiplyScalar(-1e3)),
       l.clone().add(c.clone().multiplyScalar(1e3))
-    ), f = new D(
+    ), 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 = de(y, n), fe(a), pe(o), y = at(y, 1e-9), y.push(...o), y = ye(y, 0.08), y;
+    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;
   }
 }
-const xe = new D(
+const ye = new A(
   new M(0, 0),
   new M(0, 1)
 );
-function ge(d) {
+function xe(d) {
   const t = [...d].sort((i, r) => r.length() - i.length()).slice(0, 20), e = t.map((i) => {
-    let r = parseInt(xe.includedAngle(i) + "");
+    let r = parseInt(ye.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) {
+  let t = [], e = -1;
+  const n = [];
+  return d.forEach(({ start: i, end: r, ...o }, a) => {
+    n.push(i.z ?? 0, r.z ?? 0);
+    const c = new A(
+      M.from(i),
+      M.from(r)
+    );
+    c.userData = o, t.push(c), o.isVerticalReferenceLine && (e = a);
+  }), {
+    originalZAverage: n.reduce((i, r) => i + r, 0) / n.length,
+    lineSegments: t,
+    verticalReferenceIndex: e
+  };
+}
 const me = {
   Unitless: 1,
   // 无单位，1米 = 1（无单位）
@@ -2009,16 +2006,16 @@ const me = {
   Parsecs: 3240779289666404e-32
   // 秒差距，1米 ≈ 0.00000000000000003240779289666404秒差距
 };
-function xt(d) {
+function wt(d) {
   const t = [];
   for (let e = 0; e < d.length; e++)
-    t.push(new D(
+    t.push(new A(
       d[e].clone(),
       d[(e + 1) % d.length].clone()
     ));
   return t;
 }
-function gt(d) {
+function Mt(d) {
   return d.flatMap((t, e) => (e === d.length - 1 && [...t.points, d[0].points[0]], [t.points[0]]));
 }
 class k extends q {
@@ -2028,12 +2025,13 @@ class k extends q {
   scale = 1;
   originalData = [];
   data = [];
-  originalBox = new R(0, 0, 0, 0);
-  box = new R(0, 0, 0, 0);
+  originalBox = new N(0, 0, 0, 0);
+  box = new N(0, 0, 0, 0);
   pointsGroups = [];
   wallsGroup = [];
   doors = [];
   doorLineSegment = [];
+  verticalReferenceLine;
   lineSegments = [];
   originalZAverage = 0;
   static EndType = {
@@ -2064,31 +2062,23 @@ class k extends q {
    * 预处理数据
    * @param data 
    */
-  preprocessing(t, e = !1, n) {
-    let s = [], i = -1;
-    const r = [];
-    if (t.forEach(({ start: a, end: c, ...l }, h) => {
-      r.push(a.z ?? 0, c.z ?? 0);
-      const u = new D(
-        M.from(a),
-        M.from(c)
-      );
-      u.userData = l, s.push(u), l.isVerticalReferenceLine && (i = h);
-    }), this.originalZAverage = r.reduce((a, c) => a + c, 0) / r.length, i === -1) {
-      const a = ge(s);
-      i = s.indexOf(a);
+  preprocessing(t) {
+    let { lineSegments: e, verticalReferenceIndex: n, originalZAverage: s } = ge(t);
+    if (this.originalZAverage = s, n === -1) {
+      const r = xe(e);
+      n = e.indexOf(r);
     }
-    const o = s[i];
-    return o.userData.isVerticalReferenceLine = !0, t[i].isVerticalReferenceLine = !0, e && (s = Tt.correction.call(this, s, o, n), t = K(s)), this.dispatchEvent({
+    const i = e[n];
+    return i.userData.isVerticalReferenceLine = !0, t[n].isVerticalReferenceLine = !0, this.verticalReferenceLine = i, this.dispatchEvent({
       type: "preprocessing",
       data: t,
-      setData(a) {
-        s = a.map(({ start: c, end: l, ...h }) => {
-          const u = new D(M.from(c), M.from(l));
-          return u.userData = h, u;
-        }), t = a;
+      setData(r) {
+        e = r.map(({ start: o, end: a, ...c }) => {
+          const l = new A(M.from(o), M.from(a));
+          return l.userData = c, l;
+        }), t = r;
       }
-    }), { lineSegments: s, data: t };
+    }), { lineSegments: e, data: t };
   }
   /** 设置
    * @param data 房屋结构数据，node环境可以为路径
@@ -2098,34 +2088,34 @@ class k extends q {
    * @param option 
    * @returns 
    */
-  async set(t, e = this.width, n = this.scale, s = !1, i) {
+  async set(t, e = this.width, n = this.scale) {
     if (typeof t == "string")
       if (typeof global < "u") {
-        const { default: a } = await import(
+        const { default: r } = await import(
           /* @vite-ignore */
           "fs"
-        ), c = a.readFileSync(t), l = JSON.parse(c.toString("utf-8"));
-        return this.set(l, e, n, s);
+        ), o = r.readFileSync(t), a = JSON.parse(o.toString("utf-8"));
+        return this.set(a, e, n);
       } else
         throw new Error("非node环境不允许使用路径");
     if (this.scale = n, this.width = e, t.length === 0)
       this.lineSegments = [], this.originalData = t;
     else {
-      const o = this.preprocessing(t, s, i);
-      t = o.data, this.lineSegments = o.lineSegments, this.originalData = t;
+      const i = this.preprocessing(t);
+      t = i.data, this.lineSegments = i.lineSegments, this.originalData = t;
     }
-    const r = [];
-    this.data = t.map(({ start: o, end: a, insetionArr: c, isDoor: l = !1 }, h) => {
-      r.push(o.z ?? 0, a.z ?? 0);
-      const u = this.lineSegments[h];
+    const s = [];
+    this.data = t.map(({ start: i, end: r, insetionArr: o, isDoor: a = !1 }, c) => {
+      s.push(i.z ?? 0, r.z ?? 0);
+      const l = this.lineSegments[c];
       return [
-        u.points[0],
-        u.points[1],
-        (c ?? []).map((f) => f.index),
-        l,
-        h
+        l.points[0],
+        l.points[1],
+        (o ?? []).map((h) => h.index),
+        a,
+        c
       ];
-    }), this.originalZAverage = r.reduce((o, a) => o + a, 0) / r.length, this.computedOriginalSize(t, this.originalBox), this.dispatchEvent({
+    }), this.originalZAverage = s.reduce((i, r) => i + r, 0) / s.length, this.computedOriginalSize(t, this.originalBox), this.dispatchEvent({
       type: "setDta",
       originalData: this.originalData,
       data: this.data
@@ -2237,7 +2227,7 @@ class k extends q {
         break;
       }
     }
-    const e = this.mergeSameDirectionLine(xt(t)), n = [e[0]];
+    const e = this.mergeSameDirectionLine(wt(t)), n = [e[0]];
     for (let s = 1; s < e.length; s++) {
       const i = e[s], r = e[(e.length + s - 1) % e.length];
       if (i.length() > this.width * 0.9) {
@@ -2252,7 +2242,7 @@ class k extends q {
       const a = e[s + 2];
       a && r.includedAngle(a) < 2 ? (s = s + 2, n.push(a)) : n.push(i);
     }
-    return n.length > 3 ? gt(this.mergeSameDirectionLine(n)) : [];
+    return n.length > 3 ? Mt(this.mergeSameDirectionLine(n)) : [];
   }
   /**
    * 移除短线段
@@ -2260,7 +2250,7 @@ class k extends q {
    * @param path 
    */
   removeShortLine(t, e = this.shortLine) {
-    const n = xt(t), s = [], i = Math.PI / 180;
+    const n = wt(t), s = [], i = Math.PI / 180;
     for (let r = 0; r < n.length; r++) {
       const o = n[r], a = o.length(), c = r;
       if (a > e || s.length === 0) {
@@ -2288,14 +2278,14 @@ class k extends q {
       } else
         r = c;
     }
-    return s.length > 3 ? gt(s) : [];
+    return s.length > 3 ? Mt(s) : [];
   }
   /** 线偏移
    * @description 使用 ClipperLib 对每个点组进行线偏移处理，生成具有指定宽度的墙体路径
    */
   lineOffset(t = k.EndType.etOpenSquare, e = k.JoinType.jtMiter, n = 1e4) {
-    let s = new dt.Paths();
-    const i = new dt.ClipperOffset(20, 0.25);
+    let s = new pt.Paths();
+    const i = new pt.ClipperOffset(20, 0.25);
     return this.pointsGroups.forEach((r) => {
       const o = this.lineTopology(r).map((a) => a.map((c) => c.clone().mutiplyScalar(n)));
       i.AddPaths(o, e, t);
@@ -2307,6 +2297,27 @@ class k extends q {
       wallsGroup: this.wallsGroup
     }), this.wallsGroup;
   }
+  /** 垂直纠正
+   * @param option 
+   */
+  axisAlignCorr(t) {
+    if (this.verticalReferenceLine) {
+      this.doorLineSegment;
+      const e = Pt.correction(this.getLineSegments(), this.verticalReferenceLine, t), n = J(e);
+      this.set(n);
+    } else
+      throw new Error("未找到一条垂直纠正基准轴线");
+  }
+  /** 完整线段数据
+   * @returns 
+   */
+  getLineSegments(t = !1) {
+    let e = this.lineSegments.filter((s) => !s.userData.isDoor), n = [...this.doorLineSegment];
+    return t && (e = e.map((s) => s.clone()), n = n.map((s) => s.clone())), n.forEach((s) => Object.assign(s.userData, {
+      isDoor: !0,
+      doorDirectConnection: !0
+    })), e.push(...n), e;
+  }
   /**
    * 将点云结构转换为Float32Array
    */
@@ -2336,7 +2347,7 @@ class k extends q {
    * 线段数据转为原始json数据
    */
   lineDataToOriginalData(t, e) {
-    return K(t, this.originalZAverage, e);
+    return J(t, this.originalZAverage, e);
   }
   /**
    * 转为绘制数据
@@ -2386,29 +2397,29 @@ class k extends q {
       if (s = "cyan", l.length() < 1.2) {
         l.expansion(-o * 0.5);
         const h = c.normal();
-        let u = new D(
+        let u = 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");
-        for (let m = 0; m < a.length; m++)
-          if (a[m].intersectRectangle(f)) {
-            u = new D(
+        for (let g = 0; g < a.length; g++)
+          if (a[g].intersectRectangle(f)) {
+            u = 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((m, S) => i(m, S));
-        const p = l.length(), y = u.length(), x = (p ** 2 + y ** 2) / (2 * y), g = u.end.clone().add(u.direction().multiplyScalar(-x)), [w, E] = this.getArcAngleRange(g, l.end, u.end);
-        r(g, x, Math.min(w, E), Math.max(w, E)), a.push(f);
+        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);
       } 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));
     }), 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 D(p, y);
-        i(x.start, x.end), x.expandToRectangle(this.width, "bothSides").path2D((g, w) => i(g, w));
+        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));
       });
     }), n;
   }
@@ -2439,8 +2450,8 @@ class k extends q {
       a.strokeStyle = o[p], a.beginPath(), a.arc(c, l, h, u * (Math.PI / 180), f * (Math.PI / 180)), a.stroke();
     }), a.beginPath(), s.dimensionLine.forEach((c) => {
       let [l, h, u, 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), g = (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, g + p), a.moveTo(x, y), a.lineTo(x, y - g), a.moveTo(x - 0.1 * s.scale, y), a.lineTo(x + 0.1 * s.scale, y);
+      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) => {
       i.toBlob((l) => {
         c(l);
@@ -2451,8 +2462,8 @@ class k extends q {
    * 将点json结构转换为Dxf string
    */
   toDxfString(t = "Millimeters") {
-    const e = new H();
-    e.setUnits(t), e.addLayer("cyan", H.ACI.CYAN, "DOTTED"), e.addLayer("yellow", H.ACI.YELLOW, "DOTTED"), e.addLayer("white", H.ACI.WHITE, "DOTTED");
+    const e = new $();
+    e.setUnits(t), e.addLayer("cyan", $.ACI.CYAN, "DOTTED"), e.addLayer("yellow", $.ACI.YELLOW, "DOTTED"), e.addLayer("white", $.ACI.WHITE, "DOTTED");
     const n = this.toDrawDataJson();
     return n.line.forEach((s) => {
       let [i, r, o, a, c] = s;
@@ -2474,7 +2485,7 @@ class k extends q {
   * @param filename 
   */
   async downloadOriginalData(t) {
-    const e = JSON.stringify(this.originalData, null, 2);
+    const e = JSON.stringify(J(this.getLineSegments()), null, 2);
     if (typeof window < "u") {
       const n = new Blob([e], { type: "application/json" }), s = document.createElement("a");
       s.href = URL.createObjectURL(n), s.download = t, s.click();
@@ -2508,7 +2519,7 @@ class k extends q {
    * @description 计算所有线段的起点和终点的最小最大值，形成一个边界框
    * @returns 
    */
-  computedOriginalSize(t, e = new R(0, 0, 0, 0)) {
+  computedOriginalSize(t, e = new N(0, 0, 0, 0)) {
     const n = t.flatMap((c) => [c.start.x, c.end.x]), s = t.flatMap((c) => [c.start.y, c.end.y]), i = Math.min(...n), r = Math.min(...s), o = Math.max(...n), a = Math.max(...s);
     return e.set(i, r, o, a), e;
   }
@@ -2536,16 +2547,16 @@ class k extends q {
     });
   }
 }
-function ot(d) {
+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(ot);
+  if (Array.isArray(d)) return d.map(ct);
   const t = {};
   for (const e in d)
-    Object.prototype.hasOwnProperty.call(d, e) && (t[e] = ot(d[e]));
+    Object.prototype.hasOwnProperty.call(d, e) && (t[e] = ct(d[e]));
   return t;
 }
-const z = new D();
+const j = new A();
 class we extends k {
   static name = "AngleCorrectionDxf";
   angle = 0;
@@ -2557,20 +2568,20 @@ class we extends k {
     let s = 0, i = null;
     for (let c = 0; c < e.originalData.length; c++) {
       const l = e.originalData[c];
-      if (z.start.copy(l.start), z.end.copy(l.end), l.isVerticalReferenceLine) {
-        const [h, u] = l.start.y < l.end.y ? [z.start, z.end] : [z.end, z.start];
-        s = -new D(h, u).direction().angleBetween(new M(0, 1), "angle", "360"), i = null;
+      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;
         break;
       }
-      (!i || z.length() > i.length()) && (i = z.clone(), i.userData.index = c);
+      (!i || j.length() > i.length()) && (i = j.clone(), i.userData.index = c);
     }
     if (i) {
       e.originalData[i.userData.index].isVerticalReferenceLine = !0;
       const [c, l] = i.start.y < i.end.y ? [i.start, i.end] : [i.end, i.start];
-      s = -new D(c, l).direction().angleBetween(new M(0, 1), "angle", "360");
+      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(ot(c), { start: l, end: h });
+      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) => {
         f.p = o.copy(f.p).division(r).rotate(M.zero(), s * (Math.PI / 180)).toJson(f.p.z);
       }), u;
@@ -2591,7 +2602,7 @@ class we extends k {
     });
   }
 }
-class bt extends q {
+class Rt extends q {
   static name = "Variable";
   originalLineVisible = !0;
   dxfVisible = !0;
@@ -2637,9 +2648,9 @@ class Me {
   lineAnalysis;
   continueFind = !0;
   constructor(t) {
-    if (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.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(), !this.continueFind) return;
+    }), this.doorPoint = this.getDoorPoint();
     const e = this.searchDoubleLinePoint();
     this.addPointsExcludeRule((n, s, i) => {
       const r = this.lineSegments.indexOf(n), o = e.get(r);
@@ -2647,7 +2658,7 @@ class Me {
     }), 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();
   }
   handle() {
-    this.dxf.doorLineSegment.push(...this.search(this.doorPoint, this.possibleDoorPoints, 0.5)), this.doorPoint.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.doorLineSegment.length < 2 && this.dxf.doorLineSegment.push(...this.search(this.possibleDoorPoints, this.possibleDoorPoints, 0.6));
   }
   search(t, e = [], n = 0.6, s = this.doorSearchDistance, i = this.doorSearchNearAngle) {
     const r = this.dxf, o = this.searchNearby(t, e, s, i);
@@ -2667,15 +2678,15 @@ class Me {
     );
     const a = [];
     return o.forEach((c) => {
-      const l = new D(c?.start, c?.end), h = l.length();
+      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;
       for (let y = 0; y < 3; y++) {
-        const x = l.start.clone().add(f.clone().multiplyScalar(r.width + p * y)), g = new D(
+        const x = l.start.clone().add(f.clone().multiplyScalar(r.width + p * y)), m = new A(
           x,
           x.clone().add(u.clone().multiplyScalar(1))
         );
-        if (g.directionMove(u, -0.5), this.quadtree.queryLineSegment(g).length) return;
+        if (m.directionMove(u, -0.5), this.quadtree.queryLineSegment(m).length) return;
       }
       a.push(l);
     }), a;
@@ -2695,7 +2706,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: rt() });
+        this.pointVirtualGrid.queryPoint(n).filter((r) => r.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: at() });
       });
     }), t;
   }
@@ -2706,7 +2717,14 @@ class Me {
     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.drawDoorData) {
+      if (r.doorDirectConnection) {
+        this.continueFind = !1;
+        const o = new A(M.from(r.start), M.from(r.end));
+        o.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();
@@ -2717,15 +2735,8 @@ class Me {
         c.length && t.push({
           line: c[0].userData,
           point: o,
-          uuid: rt()
+          uuid: at()
         });
-      } else if (r.doorDirectConnection) {
-        this.continueFind = !1;
-        const o = new D(M.from(r.start), M.from(r.end));
-        o.userData = {
-          doorDirectConnection: !0,
-          isDoor: !0
-        }, this.dxf.doorLineSegment.push(o);
       } else
         console.warn(`门的线段顺序${s[4]} 没有drawDoorData属性`);
     }), t;
@@ -2751,83 +2762,83 @@ class Me {
    */
   searchNearby(t, e = [], n = this.doorSearchDistance, s = this.doorSearchNearAngle) {
     const i = this.findPointVirtualGrid, r = this.quadtree;
-    function o({ point: x, line: g }, w, E) {
-      const m = g.direction();
-      g.start === x && m.multiplyScalar(-1);
-      const S = i.queryCircle(x, n).filter((L) => L.userData !== g).sort((L, A) => L.point.distance(x) - A.point.distance(x)), T = [];
-      for (let L = 0; L < S.length; L++) {
-        const A = e.findIndex((B) => B.point === S[L].point), P = t[w].uuid, N = e[A].uuid;
-        if (E.has(`${P}.${N}`)) continue;
-        E.add(`${P}.${N}`), E.add(`${N}.${P}`);
-        const O = S[L].point, C = new D(x.clone(), O.clone());
-        if (C.direction().angleBetween(m, "angle") < s) {
-          const B = t[A].line.direction();
-          S[L].userData.start.equal(S[L].point) && B.multiplyScalar(-1), C.direction().multiplyScalar(-1).angleBetween(B, "angle") < s && (r.queryLineSegment(C).length || T.push({
-            findData: S[L],
-            findUuid: N,
+    function o({ point: x, line: m }, L, 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;
+        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());
+        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],
+            findUuid: P,
             doorLine: C,
-            doorUuid: P
+            doorUuid: R
           }));
         }
       }
-      return T;
+      return D;
     }
-    function a(x, g, w, E, m) {
-      E.add(x);
+    function a(x, m, L, w, g) {
+      w.add(x);
       const S = [];
-      m && S.push(m);
-      for (let T = 0; T < w.length; T++) {
-        const L = w[T];
-        if (g.has(L.findUuid)) {
-          const A = g.get(L.findUuid);
-          a(L.findUuid, g, A, E, L) && S.push(L);
-        } else S.push(L);
+      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);
       }
-      return S.sort((T, L) => T.doorLine.length() - L.doorLine.length()), m && S[0] === m ? (w.splice(0), !0) : (w.splice(1), !1);
+      return S.sort((D, E) => D.doorLine.length() - E.doorLine.length()), g && S[0] === g ? (L.splice(0), !0) : (L.splice(1), !1);
     }
     const c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Map();
-    t.map((x, g) => {
-      const w = o(x, g, c);
-      w.length && l.set(x.uuid, w);
+    t.map((x, m) => {
+      const L = o(x, m, c);
+      L.length && l.set(x.uuid, L);
     }), c.clear();
     const h = /* @__PURE__ */ new Map();
-    l.forEach((x, g) => {
-      if (!c.has(g) && x.length && a(g, l, x, c), x.length) {
-        const w = x[0];
-        h.has(w.doorUuid) || h.set(w.doorUuid, []), h.get(w.doorUuid)?.push(w), h.has(w.findUuid) || h.set(w.findUuid, []), h.get(w.findUuid)?.push(w);
+    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 u = /* @__PURE__ */ new Set();
     h.forEach((x) => {
       if (x.length > 1) {
-        x.sort((g, w) => g.doorLine.length() - w.doorLine.length());
-        for (let g = 1; g < x.length; g++) u.add(x[g]);
+        x.sort((m, L) => m.doorLine.length() - L.doorLine.length());
+        for (let m = 1; m < x.length; m++) u.add(x[m]);
       }
     });
     const f = [], p = [];
     l.forEach((x) => {
       if (x.length) {
-        const g = x[0];
-        u.has(g) || (f.push(g), p.push(g.doorUuid, g.findUuid));
+        const m = x[0];
+        u.has(m) || (f.push(m), p.push(m.doorUuid, m.findUuid));
       }
     });
     const y = [];
     return f.forEach((x) => {
-      const g = t.findIndex((A) => A.uuid === x.doorUuid), w = e.findIndex((A) => A.uuid === x.findUuid), E = t[g].point.clone(), m = e[w].point.clone(), S = this.findLongLineSegment(t[g].line), T = this.findLongLineSegment(e[w].line), L = S.projectPoint(m);
-      if (L) {
-        E.copy(L);
-        const A = new D(E, m), P = T.includedAngle(A);
-        (P < 10 || P > 170 || Math.abs(90 - P) < 10) && y.push({
-          start: E,
-          end: m
+      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);
+        (R < 10 || R > 170 || Math.abs(90 - R) < 10) && y.push({
+          start: w,
+          end: g
         });
       } else {
-        const A = T.projectPoint(E);
-        A && m.copy(A);
-        const P = new D(E, m), N = S.includedAngle(P);
-        (N < 10 || N > 170 || Math.abs(90 - N) < 10) && y.push({
-          start: E,
-          end: m
+        const b = D.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({
+          start: w,
+          end: g
         });
       }
     }), e.splice(
@@ -2848,7 +2859,7 @@ class Me {
   searchAlongDirection({ point: t, line: e }, n = this.doorSearchDistance) {
     const s = this.quadtree, i = e.direction();
     e.start === t && i.multiplyScalar(-1);
-    const r = t.clone().add(i.clone().multiplyScalar(n)), o = new D(t.clone(), r), a = s.queryLineSegment(o).map((c) => ({
+    const r = t.clone().add(i.clone().multiplyScalar(n)), o = new A(t.clone(), r), a = s.queryLineSegment(o).map((c) => ({
       point: c.line.getIntersection(o),
       line: c.line
     })).filter((c) => c.point).sort((c, l) => t.distance(c.point) - t.distance(l.point));
@@ -2875,7 +2886,7 @@ class Me {
         break;
       }
     }
-    const l = new D(t.clone(), t.clone().add(o.multiplyScalar(n))), h = i.queryLineSegment(l).map((u) => ({
+    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));
@@ -2923,7 +2934,7 @@ class Se extends q {
    * @param parent 
    */
   onAddFromParent(t) {
-    this.Dxf = t.findComponentByType(k), this.Variable = this.parent?.findComponentByType(bt), this.Dxf.addEventListener("setDta", this.lineAnalysis.bind(this)), this.Dxf.addEventListener("createGroup", this.doorsAnalysis.bind(this));
+    this.Dxf = t.findComponentByType(k), this.Variable = this.parent?.findComponentByType(Rt), this.Dxf.addEventListener("setDta", this.lineAnalysis.bind(this)), this.Dxf.addEventListener("createGroup", this.doorsAnalysis.bind(this));
   }
   /**
    * 
@@ -2955,7 +2966,7 @@ class Se extends q {
    */
   addData(t, e) {
     const n = this.Dxf;
-    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new D(t.clone(), e.clone()));
+    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new A(t.clone(), e.clone()));
   }
   /** 结果分析创建矩形
    * @param result 
@@ -2965,12 +2976,12 @@ class Se extends q {
     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);
     p.multiplyScalar(e.width * 0.5);
-    const y = u.clone().add(p), x = f.clone().add(p.multiplyScalar(-1)), g = u.direction(f), w = y.direction(x);
-    if (!(g.x > 0 && w.x < 0 || g.x < 0 && w.x > 0 || g.y > 0 && w.y < 0 || g.y < 0 && w.y > 0)) {
+    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);
-      for (let E = 1; E < o; E++) {
-        const m = l.clone().multiplyScalar(a * E), S = h.clone().multiplyScalar(c * E), T = u.clone().add(m), L = f.clone().add(S);
-        this.addData(T, L);
+      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);
       }
     }
   }
@@ -2997,7 +3008,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 = Q.fromByLineSegment(o, this.width * 2, !1, -0.01);
+      const o = e[r], a = et.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;
@@ -3046,7 +3057,7 @@ class Se extends q {
     });
   }
 }
-class Ee extends q {
+class Le extends q {
   static name = "ThreeVJia";
   lineSegments = [];
   onAddFromParent() {
@@ -3058,8 +3069,8 @@ class Ee extends q {
     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 y = new D(f.start, p.start), x = new D(f.end, p.end), g = new D(y.center, x.center);
-      g.userData.wallWidth = Math.max(y.length(), x.length()), r.push(g);
+      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);
     });
     const a = [];
     i = i.filter((l) => {
@@ -3075,7 +3086,7 @@ class Ee extends q {
           const f = [];
           for (let p = 0; p < h.length; p++) {
             const y = h[p];
-            y.userData.type === "start" ? (f.length === 0 && (a.push(new D(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(u.start.clone(), y.clone())), u.start.copy(y)), f.push("start")) : (f.pop(), f.length === 0 && u.start.copy(y));
           }
           a.push(u);
         }
@@ -3169,7 +3180,7 @@ class Ee extends q {
     } else typeof global < "u" && (await Y("fs", !1)).writeFileSync(t, JSON.stringify(this.toJson()));
   }
 }
-class ct extends ne {
+class ht extends se {
   Dxf;
   AngleCorrectionDxf;
   Variable;
@@ -3181,7 +3192,7 @@ class ct extends ne {
    * @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 bt(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(new Se()), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new Ee()), ct.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 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;
   }
   usePlugin(t) {
     return typeof t == "function" && t.call(this, this), this;
@@ -3194,37 +3205,19 @@ class ct extends ne {
     });
   }
 }
-function It(...d) {
-  d.forEach((t) => {
-    const e = t.direction();
-    t.userData.drawWindow?.forEach((n) => {
-      try {
-        const s = M.from(n.p), i = t.projectPoint(
-          s.clone().add(e.clone().multiplyScalar(n.width * 0.5)),
-          !1
-        ), r = t.projectPoint(
-          s.clone().add(e.clone().multiplyScalar(n.width * -0.5)),
-          !1
-        ), o = t.projectLineSegment(new D(i, r)), a = o.center;
-        n.p = new I.Vector3(a?.x ?? 0, a?.y ?? 0, n.p.z);
-      } catch {
-      }
-    });
-  });
-}
-class lt {
+class ut {
   /** 通过轨迹点查找外墙
    * @param lines 
    * @param trajectoryPoints
    * @returns 
    */
   static findExtWallByTraj(t, e, n = 0.4) {
-    const s = new F(R.fromByLineSegment(...t));
+    const s = new F(N.fromByLineSegment(...t));
     return t.forEach((i) => s.insert({ line: i, userData: void 0 })), t = t.filter((i) => {
       const r = i.center, o = /* @__PURE__ */ new Set();
       for (const a of e) {
         if (o.size === 2) break;
-        const c = new D(r, a);
+        const c = new A(r, a);
         if (!s.queryLineSegment(c).filter((h) => !(h.line === i || h.line.parallel(i) && i.getMinLength(h.line) < n && h.line.projectLineSegment(i).length() / i.length() > 0.6)).length) {
           const h = i.pointPosition(a);
           h !== "on" && o.add(h);
@@ -3238,87 +3231,89 @@ class lt {
    * @param trajectoryPoints 
    */
   static boundExtbyTraj(t, e, n = 0.12) {
-    function s(g, w) {
-      return w.queryLineSegment(g).filter((E) => E.line !== g).map(({ line: E }) => {
-        const m = { resultLine: E, type: "intersect", direction: "vertical", point: null, newLine: null };
-        g.sameEndpoint(E) && (m.type = "endpoint"), g.parallel(E) && (m.direction = "parallel");
-        const S = g.getSameEndpoint(E);
-        if (S) m.point = S[1];
+    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];
         else {
-          const T = E.getIntersection(g);
-          T && (m.point = E.start.equal(T) ? E.start : E.end);
+          const b = S.getIntersection(w);
+          b && (D.point = S.start.equal(b) ? S.start : S.end);
         }
-        return m;
+        return D;
       });
     }
-    function i(g) {
-      const w = g.userData.expandDirect;
-      if (w === "left") {
-        const E = g.getLeftDirection();
-        g.directionMove(E, n * 0.5);
-      } else if (w === "right") {
-        const E = g.getRightDirection();
-        g.directionMove(E, n * 0.5);
+    function i(w) {
+      const g = w.userData.expandDirect;
+      if (g === "left") {
+        const S = w.getLeftDirection();
+        w.directionMove(S, n * 0.5);
+      } else if (g === "right") {
+        const S = w.getRightDirection();
+        w.directionMove(S, n * 0.5);
       }
     }
-    function r({ resultLine: g, type: w, direction: E, point: m }, S, T, L) {
-      if (w === "intersect")
-        m && m.copy(S.projectPoint(m) ?? m);
-      else if (E === "vertical") {
-        if (m) {
-          const A = S.projectPoint(m, !1);
-          m.copy(A), S.isPointOnSegment(A) || (S.start.distance(A) < S.end.distance(A) ? L.push(new D(A.clone(), S.start.clone())) : L.push(new D(A.clone(), S.end.clone())));
+    function r({ resultLine: w, type: g, direction: S, point: D }, E, b, R) {
+      if (g === "intersect")
+        D && D.copy(E.projectPoint(D) ?? D);
+      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())));
         }
-      } else if (!u.includes(g) && m) {
-        let A = S.projectPoint(m, !1), P;
-        if (S.start.distance(m) < S.end.distance(m) ? P = S.start : P = S.end, A) {
-          L.push(new D(m.clone(), A.clone()));
-          const N = new D(A.clone(), P.clone());
-          N.length() && L.push(N);
+      } 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()));
+          const C = new A(P.clone(), B.clone());
+          C.length() && R.push(C);
         }
       }
-      T.update(g);
+      b.update(w);
     }
-    const o = Object.keys(e).map((g) => M.from(e[g])), a = [];
-    let c = t.map(({ start: g, end: w, ...E }) => {
-      const m = new D(M.from(g), M.from(w));
-      return m.userData = E, a.push(g.z ?? 0, w.z ?? 0), m;
+    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 l = a.reduce((g, w) => g + w, 0) / a.length;
-    let u = lt.findExtWallByTraj(c, o).filter((g) => g.userData.expandDirect);
-    c = c.filter((g) => !u.includes(g)), c.push(...u);
-    const f = D.groupBySamePointAndParallel(u), p = new F(R.fromByLineSegment(...c));
-    c.forEach((g) => g.userData.isDoor || p.insert(g));
-    const y = f.map((g) => g.flatMap((w) => s(w, p))), x = [];
-    return f.flatMap((g, w) => (g.forEach((m) => (i(m), p.update(m))), y[w].filter((m) => {
-      if (!u.includes(m.resultLine)) {
-        let S;
-        return Object.defineProperty(m, "newLine", {
+    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);
+    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));
+    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", {
           get() {
-            return S || (S = D.mergeLines(...g)), S;
+            return E || (E = A.mergeLines(...w)), E;
           }
         }), !0;
       }
-      r(m, D.mergeLines(...g), p, x);
-    }))).reduce((g, w) => (g.has(w.resultLine) || g.set(w.resultLine, []), g.get(w.resultLine)?.push(w), g), /* @__PURE__ */ new Map()).forEach((g) => {
-      g.reduce((w, E) => (w.has(E.point) || w.set(E.point, []), w.get(E.point)?.push(E), w), /* @__PURE__ */ new Map()).forEach((w) => {
-        const E = /* @__PURE__ */ new Set();
-        for (let m = 0; m < w.length; m++) {
-          const S = w[m];
-          E.has(S.point) || (r(S, S.newLine, p, x), E.add(S.point));
+      r(D, A.mergeLines(...w), x, L);
+    }))).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));
         }
       });
-    }), c.push(...D.deduplication(x)), c.forEach((g) => g.userData.isWindow && It(g)), c = at(c), c = D.deduplication(c), K(c, l);
+    }), c.push(...A.deduplication(L)), c.forEach((w) => w.userData.isWindow && Q(w)), c = lt(c), c = A.deduplication(c), J(c, l);
   }
 }
 const cn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  AxisAlignCorr: Tt,
-  BoundExt: lt,
-  lineDataToOriginalData: K,
-  lineSegmentClipping: at,
-  recomputedWindow: It
-}, Symbol.toStringTag, { value: "Module" })), mt = {
+  AxisAlignCorr: Pt,
+  BoundExt: ut,
+  lineDataToOriginalData: J,
+  lineSegmentClipping: lt,
+  recomputedWindow: Q
+}, Symbol.toStringTag, { value: "Module" })), St = {
   POSITION: [
     "byte",
     "byte normalized",
@@ -3346,18 +3341,18 @@ const cn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     "unsigned short"
   ]
 };
-class Z {
+class tt {
   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 Ge(t);
-    }), this.register(function(t) {
-      return new je(t);
+      return new Ue(t);
     }), this.register(function(t) {
       return new ze(t);
+    }), this.register(function(t) {
+      return new je(t);
     }), this.register(function(t) {
       return new _e(t);
     }), this.register(function(t) {
@@ -3365,17 +3360,17 @@ class Z {
     }), this.register(function(t) {
       return new Fe(t);
     }), this.register(function(t) {
-      return new Ue(t);
+      return new Ge(t);
     }), this.register(function(t) {
       return new qe(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);
     });
   }
   register(t) {
@@ -3400,7 +3395,7 @@ class Z {
     });
   }
 }
-const b = {
+const T = {
   POINTS: 0,
   LINES: 1,
   LINE_LOOP: 2,
@@ -3424,23 +3419,23 @@ const b = {
   CLAMP_TO_EDGE: 33071,
   MIRRORED_REPEAT: 33648,
   REPEAT: 10497
-}, et = "KHR_mesh_quantization", U = {};
-U[Xt] = b.NEAREST;
-U[Vt] = b.NEAREST_MIPMAP_NEAREST;
-U[Wt] = b.NEAREST_MIPMAP_LINEAR;
-U[Ht] = b.LINEAR;
-U[Jt] = b.LINEAR_MIPMAP_NEAREST;
-U[$t] = b.LINEAR_MIPMAP_LINEAR;
-U[Kt] = b.CLAMP_TO_EDGE;
-U[Zt] = b.REPEAT;
-U[Qt] = b.MIRRORED_REPEAT;
-const wt = {
+}, 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 = {
   scale: "scale",
   position: "translation",
   quaternion: "rotation",
   morphTargetInfluences: "weights"
-}, De = new Ot(), Mt = 12, Le = 1179937895, Ae = 2, St = 8, Te = 1313821514, be = 5130562;
-function W(d, t) {
+}, 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) {
     return e === t[n];
   });
@@ -3449,7 +3444,7 @@ function Ie(d) {
   return new TextEncoder().encode(d).buffer;
 }
 function Pe(d) {
-  return W(d.elements, [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]);
+  return H(d.elements, [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]);
 }
 function Re(d, t, e) {
   const n = {
@@ -3459,15 +3454,15 @@ function Re(d, t, e) {
   for (let s = t; s < t + e; s++)
     for (let i = 0; i < d.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 = it.normalize(r, d.array))), n.min[i] = Math.min(n.min[i], r), n.max[i] = Math.max(n.max[i], 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);
     }
   return n;
 }
-function Pt(d) {
+function vt(d) {
   return Math.ceil(d / 4) * 4;
 }
-function nt(d, t = 0) {
-  const e = Pt(d.byteLength);
+function it(d, t = 0) {
+  const e = vt(d.byteLength);
   if (e !== d.byteLength) {
     const n = new Uint8Array(e);
     if (n.set(new Uint8Array(d)), t !== 0)
@@ -3477,7 +3472,7 @@ function nt(d, t = 0) {
   }
   return d;
 }
-function Et() {
+function At() {
   return typeof document > "u" && typeof OffscreenCanvas < "u" ? new OffscreenCanvas(1, 1) : document.createElement("canvas");
 }
 function ve(d, t) {
@@ -3532,23 +3527,23 @@ 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 ? st(c).then(function(u) {
-      const f = nt(u), p = new DataView(new ArrayBuffer(St));
+    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 = nt(Ie(JSON.stringify(r)), 32), x = new DataView(new ArrayBuffer(St));
+      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 g = new ArrayBuffer(Mt), w = new DataView(g);
-      w.setUint32(0, Le, !0), w.setUint32(4, Ae, !0);
-      const E = Mt + x.byteLength + y.byteLength + p.byteLength + f.byteLength;
-      w.setUint32(8, E, !0);
-      const m = new Blob([
-        g,
+      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);
+      const g = new Blob([
+        m,
         x,
         y,
         p,
         f
       ], { type: "application/octet-stream" });
-      st(m).then((S) => {
+      rt(g).then((S) => {
         e(S);
       });
     }) : r.buffers && r.buffers.length > 0 ? We(c).then((u) => {
@@ -3599,7 +3594,7 @@ class Ne {
    */
   isNormalizedNormalAttribute(t) {
     if (this.cache.attributesNormalized.has(t)) return !1;
-    const n = new J();
+    const n = new K();
     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;
@@ -3614,7 +3609,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 J();
+    const n = t.clone(), s = new K();
     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;
@@ -3634,14 +3629,14 @@ class Ne {
   async buildMetalRoughTextureAsync(t, e) {
     if (t === e) return t;
     function n(f) {
-      return f.colorSpace === kt ? function(y) {
+      return f.colorSpace === Vt ? function(y) {
         return y < 0.04045 ? y * 0.0773993808 : Math.pow(y * 0.9478672986 + 0.0521327014, 2.4);
       } : function(y) {
         return y;
       };
     }
-    t instanceof tt && (t = await this.decompressTextureAsync(t)), e instanceof tt && (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 = Et();
+    t instanceof nt && (t = await this.decompressTextureAsync(t)), e instanceof nt && (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", {
       willReadFrequently: !0
@@ -3662,7 +3657,7 @@ class Ne {
     }
     c.putImageData(l, 0, 0);
     const u = (t || e).clone();
-    return u.source = new Gt(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;
+    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;
   }
   async decompressTextureAsync(t, e = 1 / 0) {
     if (this.textureUtils === null)
@@ -3692,25 +3687,25 @@ class Ne {
     r.bufferViews || (r.bufferViews = []);
     let o;
     switch (e) {
-      case b.BYTE:
-      case b.UNSIGNED_BYTE:
+      case T.BYTE:
+      case T.UNSIGNED_BYTE:
         o = 1;
         break;
-      case b.SHORT:
-      case b.UNSIGNED_SHORT:
+      case T.SHORT:
+      case T.UNSIGNED_SHORT:
         o = 2;
         break;
       default:
         o = 4;
     }
     let a = t.itemSize * o;
-    i === b.ARRAY_BUFFER && (a = Math.ceil(a / 4) * 4);
-    const c = Pt(s * a), l = new DataView(new ArrayBuffer(c));
+    i === T.ARRAY_BUFFER && (a = Math.ceil(a / 4) * 4);
+    const c = vt(s * a), l = new DataView(new ArrayBuffer(c));
     let h = 0;
     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 = it.normalize(x, t.array))), e === b.FLOAT ? l.setFloat32(h, x, !0) : e === b.INT ? l.setInt32(h, x, !0) : e === b.UNSIGNED_INT ? l.setUint32(h, x, !0) : e === b.SHORT ? l.setInt16(h, x, !0) : e === b.UNSIGNED_SHORT ? l.setUint16(h, x, !0) : e === b.BYTE ? l.setInt8(h, x) : e === b.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 = 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;
       }
       h % a !== 0 && (h += a - h % a);
     }
@@ -3719,7 +3714,7 @@ class Ne {
       byteOffset: this.byteOffset,
       byteLength: c
     };
-    return i !== void 0 && (u.target = i), i === b.ARRAY_BUFFER && (u.byteStride = a), this.byteOffset += c, r.bufferViews.push(u), {
+    return i !== void 0 && (u.target = i), i === T.ARRAY_BUFFER && (u.byteStride = a), this.byteOffset += c, r.bufferViews.push(u), {
       id: r.bufferViews.length - 1,
       byteLength: 0
     };
@@ -3732,8 +3727,8 @@ class Ne {
   processBufferViewImage(t) {
     const e = this, n = e.json;
     return n.bufferViews || (n.bufferViews = []), new Promise(async function(s) {
-      st(t).then((i) => {
-        const r = nt(i), o = {
+      rt(t).then((i) => {
+        const r = it(i), o = {
           buffer: e.processBuffer(r),
           byteOffset: e.byteOffset,
           byteLength: r.byteLength
@@ -3761,25 +3756,25 @@ class Ne {
     };
     let o;
     if (t.array.constructor === Float32Array)
-      o = b.FLOAT;
+      o = T.FLOAT;
     else if (t.array.constructor === Int32Array)
-      o = b.INT;
+      o = T.INT;
     else if (t.array.constructor === Uint32Array)
-      o = b.UNSIGNED_INT;
+      o = T.UNSIGNED_INT;
     else if (t.array.constructor === Int16Array)
-      o = b.SHORT;
+      o = T.SHORT;
     else if (t.array.constructor === Uint16Array)
-      o = b.UNSIGNED_SHORT;
+      o = T.UNSIGNED_SHORT;
     else if (t.array.constructor === Int8Array)
-      o = b.BYTE;
+      o = T.BYTE;
     else if (t.array.constructor === Uint8Array)
-      o = b.UNSIGNED_BYTE;
+      o = T.UNSIGNED_BYTE;
     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);
     let c;
-    e !== void 0 && (c = t === e.index ? b.ELEMENT_ARRAY_BUFFER : b.ARRAY_BUFFER);
+    e !== void 0 && (c = t === e.index ? T.ELEMENT_ARRAY_BUFFER : T.ARRAY_BUFFER);
     const l = this.processBufferView(t, o, n, s, c), h = {
       bufferView: l.id,
       byteOffset: l.byteOffset,
@@ -3806,16 +3801,16 @@ 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 = Et();
+      const u = { 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 !== zt && 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 !== _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);
         const x = new Uint8ClampedArray(t.height * t.width * 4);
-        for (let g = 0; g < x.length; g += 4)
-          x[g + 0] = t.data[g + 0], x[g + 1] = t.data[g + 1], x[g + 2] = t.data[g + 2], x[g + 3] = t.data[g + 3];
+        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];
         p.putImageData(new ImageData(x, t.width, t.height), 0, 0);
       } else if (typeof HTMLImageElement < "u" && t instanceof HTMLImageElement || typeof HTMLCanvasElement < "u" && t instanceof HTMLCanvasElement || typeof ImageBitmap < "u" && t instanceof ImageBitmap || typeof OffscreenCanvas < "u" && t instanceof OffscreenCanvas)
         p.drawImage(t, 0, 0, f.width, f.height);
@@ -3825,7 +3820,7 @@ class Ne {
         ve(f, s).then((x) => i.processBufferViewImage(x)).then((x) => {
           u.bufferView = x;
         })
-      ) : u.uri = _t.getDataURL(f, s);
+      ) : u.uri = qt.getDataURL(f, s);
       const y = o.images.push(u) - 1;
       return l[h] = y, y;
     } else
@@ -3840,10 +3835,10 @@ class Ne {
     const e = this.json;
     e.samplers || (e.samplers = []);
     const n = {
-      magFilter: U[t.magFilter],
-      minFilter: U[t.minFilter],
-      wrapS: U[t.wrapS],
-      wrapT: U[t.wrapT]
+      magFilter: G[t.magFilter],
+      minFilter: G[t.minFilter],
+      wrapS: G[t.wrapS],
+      wrapT: G[t.wrapT]
     };
     return e.samplers.push(n) - 1;
   }
@@ -3855,7 +3850,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 tt && (t = await this.decompressTextureAsync(t, n.maxTextureSize));
+    i.textures || (i.textures = []), t instanceof nt && (t = await this.decompressTextureAsync(t, n.maxTextureSize));
     let r = t.userData.mimeType;
     r === "image/webp" && (r = "image/png");
     const o = {
@@ -3882,7 +3877,7 @@ class Ne {
     const s = { pbrMetallicRoughness: {} };
     t.isMeshStandardMaterial !== !0 && t.isMeshBasicMaterial !== !0 && console.warn("GLTFExporter: Use MeshStandardMaterial or MeshBasicMaterial for best results.");
     const i = t.color.toArray().concat([t.opacity]);
-    if (W(i, [1, 1, 1, 1]) || (s.pbrMetallicRoughness.baseColorFactor = i), t.isMeshStandardMaterial ? (s.pbrMetallicRoughness.metallicFactor = t.metalness, s.pbrMetallicRoughness.roughnessFactor = t.roughness) : (s.pbrMetallicRoughness.metallicFactor = 0, s.pbrMetallicRoughness.roughnessFactor = 1), t.metalnessMap || t.roughnessMap) {
+    if (H(i, [1, 1, 1, 1]) || (s.pbrMetallicRoughness.baseColorFactor = i), t.isMeshStandardMaterial ? (s.pbrMetallicRoughness.metallicFactor = t.metalness, s.pbrMetallicRoughness.roughnessFactor = t.roughness) : (s.pbrMetallicRoughness.metallicFactor = 0, s.pbrMetallicRoughness.roughnessFactor = 1), t.metalnessMap || t.roughnessMap) {
       const o = await this.buildMetalRoughTextureAsync(t.metalnessMap, t.roughnessMap), a = {
         index: await this.processTextureAsync(o),
         texCoord: o.channel
@@ -3920,7 +3915,7 @@ class Ne {
       };
       t.aoMapIntensity !== 1 && (o.strength = t.aoMapIntensity), this.applyTextureTransform(o, t.aoMap), s.occlusionTexture = o;
     }
-    t.transparent ? s.alphaMode = "BLEND" : t.alphaTest > 0 && (s.alphaMode = "MASK", s.alphaCutoff = t.alphaTest), t.side === qt && (s.doubleSided = !0), t.name !== "" && (s.name = t.name), this.serializeUserData(t, s), await this._invokeAllAsync(async function(o) {
+    t.transparent ? s.alphaMode = "BLEND" : t.alphaTest > 0 && (s.alphaMode = "MASK", s.alphaCutoff = t.alphaTest), t.side === Yt && (s.doubleSided = !0), t.name !== "" && (s.name = t.name), this.serializeUserData(t, s), await this._invokeAllAsync(async function(o) {
       o.writeMaterialAsync && await o.writeMaterialAsync(t, s);
     });
     const r = n.materials.push(s) - 1;
@@ -3934,15 +3929,15 @@ class Ne {
   async processMeshAsync(t) {
     const e = this.cache, n = this.json, s = [t.geometry.uuid];
     if (Array.isArray(t.material))
-      for (let m = 0, S = t.material.length; m < S; m++)
-        s.push(t.material[m].uuid);
+      for (let g = 0, S = t.material.length; g < S; g++)
+        s.push(t.material[g].uuid);
     else
       s.push(t.material.uuid);
     const i = s.join(":");
     if (e.meshes.has(i)) return e.meshes.get(i);
     const r = t.geometry;
     let o;
-    t.isLineSegments ? o = b.LINES : t.isLineLoop ? o = b.LINE_LOOP : t.isLine ? o = b.LINE_STRIP : t.isPoints ? o = b.POINTS : o = t.material.wireframe ? b.LINES : b.TRIANGLES;
+    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 = {
       uv: "TEXCOORD_0",
       uv1: "TEXCOORD_1",
@@ -3954,76 +3949,76 @@ class Ne {
     }, f = r.getAttribute("normal");
     f !== void 0 && !this.isNormalizedNormalAttribute(f) && (console.warn("THREE.GLTFExporter: Creating normalized normal attribute from the non-normalized one."), r.setAttribute("normal", this.createNormalizedNormalAttribute(f)));
     let p = null;
-    for (let m in r.attributes) {
-      if (m.slice(0, 5) === "morph") continue;
-      const S = r.attributes[m];
-      if (m = u[m] || m.toUpperCase(), /^(POSITION|NORMAL|TANGENT|TEXCOORD_\d+|COLOR_\d+|JOINTS_\d+|WEIGHTS_\d+)$/.test(m) || (m = "_" + m), e.attributes.has(this.getUID(S))) {
-        c[m] = e.attributes.get(this.getUID(S));
+    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))) {
+        c[g] = e.attributes.get(this.getUID(S));
         continue;
       }
       p = null;
-      const L = S.array;
-      m === "JOINTS_0" && !(L instanceof Uint16Array) && !(L instanceof Uint8Array) ? (console.warn('GLTFExporter: Attribute "skinIndex" converted to type UNSIGNED_SHORT.'), p = new _(new Uint16Array(L), S.itemSize, S.normalized)) : (L instanceof Uint32Array || L instanceof Int32Array) && !m.startsWith("_") && (console.warn(`GLTFExporter: Attribute "${m}" converted to type FLOAT.`), p = Z.Utils.toFloat32BufferAttribute(S));
-      const A = this.processAccessor(p || S, r);
-      A !== null && (m.startsWith("_") || this.detectMeshQuantization(m, S), c[m] = A, e.attributes.set(this.getUID(S), A));
+      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 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 m = [], S = [], T = {};
+      const g = [], S = [], D = {};
       if (t.morphTargetDictionary !== void 0)
-        for (const L in t.morphTargetDictionary)
-          T[t.morphTargetDictionary[L]] = L;
-      for (let L = 0; L < t.morphTargetInfluences.length; ++L) {
-        const A = {};
-        let P = !1;
-        for (const N in r.morphAttributes) {
-          if (N !== "position" && N !== "normal") {
-            P || (console.warn("GLTFExporter: Only POSITION and NORMAL morph are supported."), P = !0);
+        for (const E in t.morphTargetDictionary)
+          D[t.morphTargetDictionary[E]] = E;
+      for (let E = 0; E < t.morphTargetInfluences.length; ++E) {
+        const b = {};
+        let R = !1;
+        for (const P in r.morphAttributes) {
+          if (P !== "position" && P !== "normal") {
+            R || (console.warn("GLTFExporter: Only POSITION and NORMAL morph are supported."), R = !0);
             continue;
           }
-          const O = r.morphAttributes[N][L], C = N.toUpperCase(), G = r.attributes[N];
-          if (e.attributes.has(this.getUID(O, !0))) {
-            A[C] = e.attributes.get(this.getUID(O, !0));
+          const B = r.morphAttributes[P][E], C = P.toUpperCase(), U = r.attributes[P];
+          if (e.attributes.has(this.getUID(B, !0))) {
+            b[C] = e.attributes.get(this.getUID(B, !0));
             continue;
           }
-          const B = O.clone();
+          const O = B.clone();
           if (!r.morphTargetsRelative)
-            for (let v = 0, V = O.count; v < V; v++)
-              for (let j = 0; j < O.itemSize; j++)
-                j === 0 && B.setX(v, O.getX(v) - G.getX(v)), j === 1 && B.setY(v, O.getY(v) - G.getY(v)), j === 2 && B.setZ(v, O.getZ(v) - G.getZ(v)), j === 3 && B.setW(v, O.getW(v) - G.getW(v));
-          A[C] = this.processAccessor(B, r), e.attributes.set(this.getUID(G, !0), A[C]);
+            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]);
         }
-        h.push(A), m.push(t.morphTargetInfluences[L]), t.morphTargetDictionary !== void 0 && S.push(T[L]);
+        h.push(b), g.push(t.morphTargetInfluences[E]), t.morphTargetDictionary !== void 0 && S.push(D[E]);
       }
-      a.weights = m, S.length > 0 && (a.extras = {}, a.extras.targetNames = S);
+      a.weights = g, S.length > 0 && (a.extras = {}, a.extras.targetNames = S);
     }
     const y = Array.isArray(t.material);
     if (y && r.groups.length === 0) return null;
     let x = !1;
     if (y && r.index === null) {
-      const m = [];
-      for (let S = 0, T = r.attributes.position.count; S < T; S++)
-        m[S] = S;
-      r.setIndex(m), x = !0;
+      const g = [];
+      for (let S = 0, D = r.attributes.position.count; S < D; S++)
+        g[S] = S;
+      r.setIndex(g), x = !0;
     }
-    const g = y ? t.material : [t.material], w = y ? r.groups : [{ materialIndex: 0, start: void 0, count: void 0 }];
-    for (let m = 0, S = w.length; m < S; m++) {
-      const T = {
+    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 = {
         mode: o,
         attributes: c
       };
-      if (this.serializeUserData(r, T), h.length > 0 && (T.targets = h), r.index !== null) {
-        let A = this.getUID(r.index);
-        (w[m].start !== void 0 || w[m].count !== void 0) && (A += ":" + w[m].start + ":" + w[m].count), e.attributes.has(A) ? T.indices = e.attributes.get(A) : (T.indices = this.processAccessor(r.index, r, w[m].start, w[m].count), e.attributes.set(A, T.indices)), T.indices === null && delete T.indices;
+      if (this.serializeUserData(r, D), h.length > 0 && (D.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;
       }
-      const L = await this.processMaterialAsync(g[w[m].materialIndex]);
-      L !== null && (T.material = L), l.push(T);
+      const E = await this.processMaterialAsync(m[L[g].materialIndex]);
+      E !== null && (D.material = E), l.push(D);
     }
-    x === !0 && r.setIndex(null), a.primitives = l, n.meshes || (n.meshes = []), await this._invokeAllAsync(function(m) {
-      m.writeMesh && m.writeMesh(t, a);
+    x === !0 && r.setIndex(null), a.primitives = l, n.meshes || (n.meshes = []), await this._invokeAllAsync(function(g) {
+      g.writeMesh && g.writeMesh(t, a);
     });
-    const E = n.meshes.push(a) - 1;
-    return e.meshes.set(i, E), E;
+    const w = n.meshes.push(a) - 1;
+    return e.meshes.set(i, w), w;
   }
   /**
    * If a vertex attribute with a
@@ -4037,7 +4032,7 @@ class Ne {
    * @param {THREE.BufferAttribute} attribute
    */
   detectMeshQuantization(t, e) {
-    if (this.extensionsUsed[et]) return;
+    if (this.extensionsUsed[st]) return;
     let n;
     switch (e.array.constructor) {
       case Int8Array:
@@ -4057,7 +4052,7 @@ class Ne {
     }
     e.normalized && (n += " normalized");
     const s = t.split("_", 1)[0];
-    mt[s] && mt[s].includes(n) && (this.extensionsUsed[et] = !0, this.extensionsRequired[et] = !0);
+    St[s] && St[s].includes(n) && (this.extensionsUsed[st] = !0, this.extensionsRequired[st] = !0);
   }
   /**
    * Process camera
@@ -4077,7 +4072,7 @@ class Ne {
       znear: t.near < 0 ? 0 : t.near
     } : s.perspective = {
       aspectRatio: t.aspect,
-      yfov: it.degToRad(t.fov),
+      yfov: ot.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;
@@ -4094,21 +4089,21 @@ class Ne {
    */
   processAnimation(t, e) {
     const n = this.json, s = this.nodeMap;
-    n.animations || (n.animations = []), t = Z.Utils.mergeMorphTargetTracks(t.clone(), e);
+    n.animations || (n.animations = []), t = tt.Utils.mergeMorphTargetTracks(t.clone(), e);
     const i = t.tracks, r = [], o = [];
     for (let c = 0; c < i.length; ++c) {
-      const l = i[c], h = $.parseTrackName(l.name);
-      let u = $.findNode(e, h.nodeName);
-      const f = wt[h.propertyName];
+      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) {
         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 === wt.morphTargetInfluences && (y /= u.morphTargetInfluences.length);
+      f === Lt.morphTargetInfluences && (y /= u.morphTargetInfluences.length);
       let x;
-      l.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline === !0 ? (x = "CUBICSPLINE", y /= 3) : l.getInterpolation() === Yt ? x = "STEP" : x = "LINEAR", o.push({
+      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)),
         interpolation: x
@@ -4136,7 +4131,7 @@ class Ne {
     if (i === void 0) return null;
     const r = t.skeleton.bones[0];
     if (r === void 0) return null;
-    const o = [], a = new Float32Array(i.bones.length * 16), c = new Lt();
+    const o = [], a = new Float32Array(i.bones.length * 16), c = new bt();
     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({
@@ -4156,7 +4151,7 @@ class Ne {
     const i = {};
     if (n.trs) {
       const o = t.quaternion.toArray(), a = t.position.toArray(), c = t.scale.toArray();
-      W(o, [0, 0, 0, 1]) || (i.rotation = o), W(a, [0, 0, 0]) || (i.translation = a), W(c, [1, 1, 1]) || (i.scale = c);
+      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);
     if (t.name !== "" && (i.name = String(t.name)), this.serializeUserData(t, i), t.isMesh || t.isLine || t.isPoints) {
@@ -4204,7 +4199,7 @@ class Ne {
    * @param {Array<THREE.Object3D>} objects List of objects to process
    */
   async processObjectsAsync(t) {
-    const e = new ut();
+    const e = new ft();
     e.name = "AuxScene";
     for (let n = 0; n < t.length; n++)
       e.children.push(t[n]);
@@ -4220,7 +4215,7 @@ class Ne {
     });
     const n = [];
     for (let s = 0; s < t.length; s++)
-      t[s] instanceof ut ? await this.processSceneAsync(t[s]) : n.push(t[s]);
+      t[s] instanceof ft ? await this.processSceneAsync(t[s]) : n.push(t[s]);
     n.length > 0 && await this.processObjectsAsync(n);
     for (let s = 0; s < this.skins.length; ++s)
       this.processSkin(this.skins[s]);
@@ -4302,7 +4297,7 @@ class Fe {
     i.dispersion = t.dispersion, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Ue {
+class Ge {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_iridescence";
   }
@@ -4326,7 +4321,7 @@ class Ue {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Ge {
+class Ue {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_transmission";
   }
@@ -4343,7 +4338,7 @@ class Ge {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class je {
+class ze {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_volume";
   }
@@ -4360,7 +4355,7 @@ class je {
     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 ze {
+class je {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_ior";
   }
@@ -4375,7 +4370,7 @@ class _e {
     this.writer = t, this.name = "KHR_materials_specular";
   }
   async writeMaterialAsync(t, e) {
-    if (!t.isMeshPhysicalMaterial || t.specularIntensity === 1 && t.specularColor.equals(De) && !t.specularIntensityMap && !t.specularColorMap) return;
+    if (!t.isMeshPhysicalMaterial || t.specularIntensity === 1 && t.specularColor.equals(Ee) && !t.specularIntensityMap && !t.specularColorMap) return;
     const n = this.writer, s = n.extensionsUsed, i = {};
     if (t.specularIntensityMap) {
       const r = {
@@ -4442,7 +4437,7 @@ class ke {
     i.emissiveStrength = t.emissiveIntensity, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Xe {
+class Ve {
   constructor(t) {
     this.writer = t, this.name = "EXT_materials_bump";
   }
@@ -4459,13 +4454,13 @@ class Xe {
     i.bumpFactor = t.bumpScale, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Ve {
+class Xe {
   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 Lt(), c = new J(), l = new Ft(), h = new J();
+    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();
     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 = {
@@ -4476,7 +4471,7 @@ class Ve {
     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;
   }
 }
-Z.Utils = {
+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));
     let o;
@@ -4506,7 +4501,7 @@ Z.Utils = {
     const e = [], n = {}, s = d.tracks;
     for (let i = 0; i < s.length; ++i) {
       let r = s[i];
-      const o = $.parseTrackName(r.name), a = $.findNode(t, o.nodeName);
+      const o = Z.parseTrackName(r.name), a = Z.findNode(t, o.nodeName);
       if (o.propertyName !== "morphTargetInfluences" || o.propertyIndex === void 0) {
         e.push(r);
         continue;
@@ -4514,7 +4509,7 @@ Z.Utils = {
       if (r.createInterpolant !== r.InterpolantFactoryMethodDiscrete && r.createInterpolant !== r.InterpolantFactoryMethodLinear) {
         if (r.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline)
           throw new Error("THREE.GLTFExporter: Cannot merge tracks with glTF CUBICSPLINE interpolation.");
-        console.warn("THREE.GLTFExporter: Morph target interpolation mode not yet supported. Using LINEAR instead."), r = r.clone(), r.setInterpolation(te);
+        console.warn("THREE.GLTFExporter: Morph target interpolation mode not yet supported. Using LINEAR instead."), r = r.clone(), r.setInterpolation(ee);
       }
       const c = a.morphTargetInfluences.length, l = a.morphTargetDictionary[o.propertyIndex];
       if (l === void 0)
@@ -4559,7 +4554,7 @@ async function We(d) {
       n.onload = () => t(n.result), n.onerror = () => e(new Error("Failed to read Blob as Data URL")), n.readAsDataURL(d);
     });
 }
-async function st(d) {
+async function rt(d) {
   if (typeof d.arrayBuffer == "function")
     return await d.arrayBuffer();
   if (typeof FileReader < "u")
@@ -4572,7 +4567,7 @@ async function st(d) {
     return t.buffer.slice(t.byteOffset, t.byteOffset + t.byteLength);
   }
 }
-const He = new ee(), Je = new Z();
+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;
   return {
@@ -4588,7 +4583,7 @@ function $e(d, t, e = 0.1) {
     rectIndices: [0, 1, 3, 2, 0]
   };
 }
-class Rt extends q {
+class Nt extends q {
   static name = "WhiteModel";
   Dxf = null;
   Variable = null;
@@ -4724,7 +4719,7 @@ class Rt extends q {
     }
   }
 }
-class vt extends q {
+class Ct extends q {
   static name = "DetailsPoint";
   Dxf = null;
   WhiteModel = null;
@@ -4801,7 +4796,7 @@ class vt extends q {
     }, 50);
   }
 }
-class Nt extends q {
+class Bt extends q {
   static name = "DxfLineModel";
   dxfLineModel = new I.LineSegments();
   dxfDoorsLineModel = new I.LineSegments();
@@ -4826,21 +4821,21 @@ class Nt extends q {
 }
 const Ke = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  DetailsPoint: vt,
-  DxfLineModel: Nt,
-  WhiteModel: Rt
+  DetailsPoint: Ct,
+  DxfLineModel: Bt,
+  WhiteModel: Nt
 }, Symbol.toStringTag, { value: "Module" }));
-function Dt(d, t = {}) {
+function Tt(d, t = {}) {
   const {
     detailsPoint: e = !0,
     whiteModel: n = !0,
     dxfLineModel: s = !0
   } = t;
-  s && d.addComponent(new Nt()), n && d.addComponent(new Rt()), e && d.addComponent(new vt());
+  s && d.addComponent(new Bt()), n && d.addComponent(new Nt()), e && d.addComponent(new Ct());
 }
-const Ze = Object.assign(Dt, {
+const Ze = Object.assign(Tt, {
   create(d = {}) {
-    return (t) => Dt(t, d);
+    return (t) => Tt(t, d);
   }
 }), Qe = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
@@ -4853,9 +4848,9 @@ function tn() {
 function en() {
   return import("./index3.js");
 }
-let ht = null;
+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 ct().usePlugin(s.ModelDataPlugin.create({
+  const s = await Promise.resolve().then(() => Qe), i = await tn(), r = await en(), o = new ht().usePlugin(s.ModelDataPlugin.create({
     detailsPoint: !1,
     whiteModel: !0
   })).usePlugin(i.RenderPlugin.create({
@@ -4865,12 +4860,12 @@ 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), ht = o, {
+  return a && d.appendChild(a.domElement), dt = o, {
     dxfSystem: o,
     getFileAll: () => nn(o)
   };
 }
-async function nn(d = ht) {
+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" });
   return {
     dxf: n,
@@ -4883,22 +4878,22 @@ async function nn(d = ht) {
   };
 }
 function hn() {
-  return ht;
+  return dt;
 }
 export {
-  Tt as A,
-  R as B,
+  Pt as A,
+  N as B,
   q as C,
-  ct as D,
-  At as E,
-  D as L,
+  ht as D,
+  It as E,
+  A as L,
   Ze as M,
   M as P,
   F as Q,
-  Ee as T,
-  bt as V,
-  Rt as W,
-  vt as a,
+  Le as T,
+  Rt as V,
+  Nt as W,
+  Ct as a,
   X as b,
   ln as c,
   hn as d,
@@ -4906,6 +4901,6 @@ export {
   cn as f,
   nn as g,
   Ke as i,
-  It as r,
-  rt as u
+  Q as r,
+  at as u
 };