build-dxf 0.0.33 → 0.0.34

package/src/build.js

@@ -1,16 +1,16 @@
-import * as U from "three";
-import { EventDispatcher as Pe, Color as ve, Matrix4 as Ae, Vector3 as ee, Quaternion as Ne, BufferAttribute as H, REVISION as Ce, CompressedTexture as ie, Source as Be, NoColorSpace as Oe, MathUtils as ce, RGBAFormat as Fe, ImageUtils as Ue, DoubleSide as Ge, PropertyBinding as te, InterpolateDiscrete as _e, Scene as fe, SRGBColorSpace as ze, NearestFilter as qe, NearestMipmapNearestFilter as je, NearestMipmapLinearFilter as Ye, LinearFilter as Xe, LinearMipmapNearestFilter as ke, LinearMipmapLinearFilter as Ve, ClampToEdgeWrapping as We, RepeatWrapping as He, MirroredRepeatWrapping as Je, InterpolateLinear as Ke } from "three";
-import pe from "clipper-lib";
-import Q from "dxf-writer";
-import { OBJExporter as $e } from "three/examples/jsm/exporters/OBJExporter.js";
-function le() {
-  return "xxxx-xxxx-4xxx-yxxx-xxxx".replace(/[xy]/g, function(d) {
-    var e = Math.random() * 16 | 0, t = d == "x" ? e : e & 3 | 8;
+import * as z from "three";
+import { EventDispatcher as Ge, Color as ze, Matrix4 as ve, Vector3 as ce, Quaternion as _e, BufferAttribute as te, REVISION as qe, CompressedTexture as de, Source as je, NoColorSpace as Ye, MathUtils as ye, RGBAFormat as ke, ImageUtils as Xe, DoubleSide as Ve, PropertyBinding as le, InterpolateDiscrete as We, Scene as Se, SRGBColorSpace as He, NearestFilter as Je, NearestMipmapNearestFilter as Ke, NearestMipmapLinearFilter as $e, LinearFilter as Ze, LinearMipmapNearestFilter as Qe, LinearMipmapLinearFilter as et, ClampToEdgeWrapping as tt, RepeatWrapping as nt, MirroredRepeatWrapping as st, InterpolateLinear as it } from "three";
+import Le from "clipper-lib";
+import ae from "dxf-writer";
+import { OBJExporter as rt } from "three/examples/jsm/exporters/OBJExporter.js";
+function me() {
+  return "xxxx-xxxx-4xxx-yxxx-xxxx".replace(/[xy]/g, function(f) {
+    var e = Math.random() * 16 | 0, t = f == "x" ? e : e & 3 | 8;
     return t.toString(16);
   });
 }
-class Ee extends Pe {
-  uuid = le();
+class Ne extends Ge {
+  uuid = me();
   addEventListener(e, t, n) {
     const { once: s = !1 } = n ?? {}, i = (o) => {
       t(o), s && r();
@@ -30,7 +30,7 @@ class Ee extends Pe {
     t && (t.forEach((n) => n()), this.eventRecordStack.delete(e));
   }
 }
-class J extends Ee {
+class ne extends Ne {
   parent;
   destroyed = !1;
   constructor(...e) {
@@ -48,7 +48,7 @@ class J extends Ee {
     this.destroyed = !0;
   }
 }
-class Ze extends Ee {
+class ot extends Ne {
   static EventType = {
     ADD_COMPONENT: "addComponent"
   };
@@ -71,7 +71,7 @@ class Ze extends Ee {
    * @param component 
    */
   removeComponent(e) {
-    if (e instanceof J) {
+    if (e instanceof ne) {
       const t = this.components.indexOf(e);
       t > -1 && (this.components.splice(t, 1), this.dispatchEvent({
         type: "removeComponent",
@@ -116,17 +116,17 @@ class Ze extends Ee {
     return t || null;
   }
 }
-class _ {
+class j {
   minX = 0;
   maxX = 0;
   minY = 0;
   maxY = 0;
   get points() {
     return [
-      new w(this.minX, this.minY),
-      new w(this.maxX, this.minY),
-      new w(this.maxX, this.maxY),
-      new w(this.minX, this.maxY)
+      new g(this.minX, this.minY),
+      new g(this.maxX, this.minY),
+      new g(this.maxX, this.maxY),
+      new g(this.minX, this.maxY)
     ];
   }
   get width() {
@@ -136,7 +136,7 @@ class _ {
     return this.maxY - this.minY;
   }
   get center() {
-    return new w(
+    return new g(
       this.minX + (this.maxX - this.minX) * 0.5,
       this.minY + (this.maxY - this.minY) * 0.5
     );
@@ -202,9 +202,9 @@ class _ {
     const o = this.points;
     for (let l = 0; l < 4; l++) {
       const c = o[l], h = o[(l + 1) % 4];
-      for (let f = 0; f < 4; f++) {
-        const u = t[f], p = t[(f + 1) % 4], y = (h.x - c.x) * (u.y - c.y) - (h.y - c.y) * (u.x - c.x), x = (h.x - c.x) * (p.y - c.y) - (h.y - c.y) * (p.x - c.x), S = (p.x - u.x) * (c.y - u.y) - (p.y - u.y) * (c.x - u.x), R = (p.x - u.x) * (h.y - u.y) - (p.y - u.y) * (h.x - u.x);
-        if (y * x < 0 && S * R < 0 || y === 0 && Math.min(c.x, h.x) <= u.x && u.x <= Math.max(c.x, h.x) && Math.min(c.y, h.y) <= u.y && u.y <= Math.max(c.y, h.y) || x === 0 && Math.min(c.x, h.x) <= p.x && p.x <= Math.max(c.x, h.x) && Math.min(c.y, h.y) <= p.y && p.y <= Math.max(c.y, h.y) || S === 0 && Math.min(u.x, p.x) <= c.x && c.x <= Math.max(u.x, p.x) && Math.min(u.y, p.y) <= c.y && c.y <= Math.max(u.y, p.y) || R === 0 && Math.min(u.x, p.x) <= h.x && h.x <= Math.max(u.x, p.x) && Math.min(u.y, p.y) <= h.y && h.y <= Math.max(u.y, p.y))
+      for (let d = 0; d < 4; d++) {
+        const u = t[d], p = t[(d + 1) % 4], y = (h.x - c.x) * (u.y - c.y) - (h.y - c.y) * (u.x - c.x), x = (h.x - c.x) * (p.y - c.y) - (h.y - c.y) * (p.x - c.x), S = (p.x - u.x) * (c.y - u.y) - (p.y - u.y) * (c.x - u.x), T = (p.x - u.x) * (h.y - u.y) - (p.y - u.y) * (h.x - u.x);
+        if (y * x < 0 && S * T < 0 || y === 0 && Math.min(c.x, h.x) <= u.x && u.x <= Math.max(c.x, h.x) && Math.min(c.y, h.y) <= u.y && u.y <= Math.max(c.y, h.y) || x === 0 && Math.min(c.x, h.x) <= p.x && p.x <= Math.max(c.x, h.x) && Math.min(c.y, h.y) <= p.y && p.y <= Math.max(c.y, h.y) || S === 0 && Math.min(u.x, p.x) <= c.x && c.x <= Math.max(u.x, p.x) && Math.min(u.y, p.y) <= c.y && c.y <= Math.max(u.y, p.y) || T === 0 && Math.min(u.x, p.x) <= h.x && h.x <= Math.max(u.x, p.x) && Math.min(u.y, p.y) <= h.y && h.y <= Math.max(u.y, p.y))
           return !0;
       }
     }
@@ -216,9 +216,9 @@ class _ {
     const a = (l) => {
       let c = 0;
       for (let h = 0; h < 4; h++) {
-        const f = t[h], u = t[(h + 1) % 4], p = (u.x - f.x) * (l.y - f.y) - (u.y - f.y) * (l.x - f.x);
+        const d = t[h], u = t[(h + 1) % 4], p = (u.x - d.x) * (l.y - d.y) - (u.y - d.y) * (l.x - d.x);
         if (p === 0) {
-          const y = Math.abs(u.x - f.x) > 1e-10 ? u.x - f.x : u.y - f.y, x = y ? (l.x - f.x) / y : 0;
+          const y = Math.abs(u.x - d.x) > 1e-10 ? u.x - d.x : u.y - d.y, x = y ? (l.x - d.x) / y : 0;
           if (x >= 0 && x <= 1) return !0;
         } else {
           const y = p > 0 ? 1 : -1;
@@ -299,7 +299,7 @@ class _ {
    * @returns 
    */
   clone() {
-    return new _(this.minX, this.maxX, this.minY, this.maxY);
+    return new j(this.minX, this.maxX, this.minY, this.maxY);
   }
   /**
    * 
@@ -310,7 +310,7 @@ class _ {
     const t = [], n = [];
     return e.forEach((s) => {
       t.push(s.x), n.push(s.y);
-    }), new _(
+    }), new j(
       Math.min(...t),
       Math.max(...t),
       Math.min(...n),
@@ -328,7 +328,7 @@ class _ {
       s?.points?.forEach((i) => {
         t.push(i.x), n.push(i.y);
       });
-    }), new _(
+    }), new j(
       Math.min(...t),
       Math.max(...t),
       Math.min(...n),
@@ -336,7 +336,7 @@ class _ {
     );
   }
 }
-class se {
+class ue {
   points;
   get p0() {
     return this.points[0];
@@ -359,7 +359,7 @@ class se {
   path2D(e) {
     return this.points.flatMap((t, n) => {
       const s = this.points[(n + 1) % this.points.length];
-      return e && e(new w(t.x, t.y), new w(s.x, s.y)), [t.x, t.y, s.x, s.y];
+      return e && e(new g(t.x, t.y), new g(s.x, s.y)), [t.x, t.y, s.x, s.y];
     });
   }
   createGeometry() {
@@ -394,8 +394,8 @@ class se {
         if (Math.max(p, y) >= 0 && Math.min(p, y) <= 1)
           return !0;
       } else {
-        const f = ((o.x - t.x) * c - (o.y - t.y) * l) / h, u = ((o.x - t.x) * i - (o.y - t.y) * s) / h;
-        if (f >= 0 && f <= 1 && u >= 0 && u <= 1)
+        const d = ((o.x - t.x) * c - (o.y - t.y) * l) / h, u = ((o.x - t.x) * i - (o.y - t.y) * s) / h;
+        if (d >= 0 && d <= 1 && u >= 0 && u <= 1)
           return !0;
       }
     }
@@ -477,7 +477,7 @@ class se {
     let e = 1 / 0, t = -1 / 0, n = 1 / 0, s = -1 / 0;
     return this.points.forEach((i) => {
       t = Math.max(i.x, t), e = Math.min(i.x, e), s = Math.max(i.x, s), n = Math.min(i.x, n);
-    }), new _(e, t, n, s);
+    }), new j(e, t, n, s);
   }
   /**
    * 
@@ -486,21 +486,21 @@ class se {
    * @returns 
    */
   static fromByLineSegment(e, t = 0.1, n = !1, s = 0.5) {
-    const i = e.points[0], r = e.points[1], o = r.normal(i), a = n ? r.direction(i).mutiplyScalar(t * s) : w.zero(), l = n ? i.direction(r).mutiplyScalar(t * s) : w.zero(), c = o.x * t * 0.5, h = o.y * t * 0.5;
-    return new se([
-      new w(i.x + c, i.y + h).add(l),
-      new w(r.x + c, r.y + h).add(a),
-      new w(r.x - c, r.y - h).add(a),
-      new w(i.x - c, i.y - h).add(l)
+    const i = e.points[0], r = e.points[1], o = r.normal(i), a = n ? r.direction(i).mutiplyScalar(t * s) : g.zero(), l = n ? i.direction(r).mutiplyScalar(t * s) : g.zero(), c = o.x * t * 0.5, h = o.y * t * 0.5;
+    return new ue([
+      new g(i.x + c, i.y + h).add(l),
+      new g(r.x + c, r.y + h).add(a),
+      new g(r.x - c, r.y - h).add(a),
+      new g(i.x - c, i.y - h).add(l)
     ]);
   }
 }
-class B {
-  points = [new w(), new w()];
+class N {
+  points = [new g(), new g()];
   userData = {};
   // line: any
   get center() {
-    return new w(
+    return new g(
       this.points[0].x + (this.points[1].x - this.points[0].x) * 0.5,
       this.points[0].y + (this.points[1].y - this.points[0].y) * 0.5
     );
@@ -511,7 +511,7 @@ class B {
   get end() {
     return this.points[1];
   }
-  constructor(e = new w(), t = new w()) {
+  constructor(e = new g(), t = new g()) {
     this.points = [e, t];
   }
   set(e, t) {
@@ -597,15 +597,15 @@ class B {
    * @returns {Rectangle}
    */
   expandToRectangle(e = 0.1, t = "all") {
-    const n = this.start, s = this.end, i = s.normal(n), r = t === "bothSides" ? w.zero() : s.direction(n).mutiplyScalar(e * 0.5), o = t === "bothSides" ? w.zero() : n.direction(s).mutiplyScalar(e * 0.5), a = i.x * e * 0.5, l = i.y * e * 0.5, c = [
+    const n = this.start, s = this.end, i = s.normal(n), r = t === "bothSides" ? g.zero() : s.direction(n).mutiplyScalar(e * 0.5), o = t === "bothSides" ? g.zero() : n.direction(s).mutiplyScalar(e * 0.5), a = i.x * e * 0.5, l = i.y * e * 0.5, c = [
       // 第一条线
-      new w(n.x + a, n.y + l).add(o),
-      new w(s.x + a, s.y + l).add(r),
+      new g(n.x + a, n.y + l).add(o),
+      new g(s.x + a, s.y + l).add(r),
       // 第二条线
-      new w(n.x - a, n.y - l).add(o),
-      new w(s.x - a, s.y - l).add(r)
+      new g(n.x - a, n.y - l).add(o),
+      new g(s.x - a, s.y - l).add(r)
     ];
-    return new se([0, 1, 3, 2].map((h) => c[h]));
+    return new ue([0, 1, 3, 2].map((h) => c[h]));
   }
   /**
    * 计算线段的长度
@@ -642,24 +642,24 @@ class B {
   projectLineSegment(e) {
     if (e.points.length !== 2 || this.points.length !== 2)
       throw new Error("每条线段必须由两个点定义");
-    const [t, n] = e.points, [s, i] = this.points, r = new w(i.x - s.x, i.y - s.y);
+    const [t, n] = e.points, [s, i] = this.points, r = new g(i.x - s.x, i.y - s.y);
     if (r.x === 0 && r.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
     const o = (p) => {
-      const y = new w(p.x - s.x, p.y - s.y), x = r.x * r.x + r.y * r.y, R = (y.x * r.x + y.y * r.y) / x, F = s.x + R * r.x, A = s.y + R * r.y;
-      return new w(F, A);
+      const y = new g(p.x - s.x, p.y - s.y), x = r.x * r.x + r.y * r.y, T = (y.x * r.x + y.y * r.y) / x, G = s.x + T * r.x, E = s.y + T * r.y;
+      return new g(G, E);
     };
     let a = o(t), l = o(n);
     const c = (p) => {
-      const y = new w(p.x - s.x, p.y - s.y), x = r.x * r.x + r.y * r.y;
+      const y = new g(p.x - s.x, p.y - s.y), x = r.x * r.x + r.y * r.y;
       return (y.x * r.x + y.y * r.y) / x;
     };
-    let h = c(a), f = c(l);
+    let h = c(a), d = c(l);
     const u = (p) => {
       const y = Math.max(0, Math.min(1, p)), x = s.x + y * r.x, S = s.y + y * r.y;
-      return new w(x, S);
+      return new g(x, S);
     };
-    return (h < 0 || h > 1) && (a = u(h)), (f < 0 || f > 1) && (l = u(f)), a.x === l.x && a.y === l.y ? new B(a, a) : new B(a, l);
+    return (h < 0 || h > 1) && (a = u(h)), (d < 0 || d > 1) && (l = u(d)), a.x === l.x && a.y === l.y ? new N(a, a) : new N(a, l);
   }
   /**
    * 计算一条线段在另一条直线上的投影
@@ -668,17 +668,17 @@ class B {
    * @returns 投影并裁剪后的线段
    */
   projectPoint(e, t = !0) {
-    const [n, s] = this.points, i = new w(s.x - n.x, s.y - n.y);
+    const [n, s] = this.points, i = new g(s.x - n.x, s.y - n.y);
     if (i.x === 0 && i.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
     let o = ((c) => {
-      const h = new w(c.x - n.x, c.y - n.y), f = i.x * i.x + i.y * i.y, p = (h.x * i.x + h.y * i.y) / f, y = n.x + p * i.x, x = n.y + p * i.y;
-      return new w(y, x);
+      const h = new g(c.x - n.x, c.y - n.y), d = i.x * i.x + i.y * i.y, p = (h.x * i.x + h.y * i.y) / d, y = n.x + p * i.x, x = n.y + p * i.y;
+      return new g(y, x);
     })(e);
     if (!t) return o;
     let l = ((c) => {
-      const h = new w(c.x - n.x, c.y - n.y), f = i.x * i.x + i.y * i.y;
-      return (h.x * i.x + h.y * i.y) / f;
+      const h = new g(c.x - n.x, c.y - n.y), d = i.x * i.x + i.y * i.y;
+      return (h.x * i.x + h.y * i.y) / d;
     })(o);
     return l < 0 || l > 1 ? null : o;
   }
@@ -696,8 +696,8 @@ class B {
     function a(u, p, y) {
       return Math.min(p.x, y.x) - 1e-10 <= u.x && u.x <= Math.max(p.x, y.x) + 1e-10 && Math.min(p.y, y.y) - 1e-10 <= u.y && u.y <= Math.max(p.y, y.y) + 1e-10;
     }
-    const l = o(n, s, i), c = o(n, s, r), h = o(i, r, n), f = o(i, r, s);
-    return !!(l * c < 0 && h * f < 0 || t && (Math.abs(l) < 1e-10 && a(i, n, s) || Math.abs(c) < 1e-10 && a(r, n, s) || Math.abs(h) < 1e-10 && a(n, i, r) || Math.abs(f) < 1e-10 && a(s, i, r)));
+    const l = o(n, s, i), c = o(n, s, r), h = o(i, r, n), d = o(i, r, s);
+    return !!(l * c < 0 && h * d < 0 || t && (Math.abs(l) < 1e-10 && a(i, n, s) || Math.abs(c) < 1e-10 && a(r, n, s) || Math.abs(h) < 1e-10 && a(n, i, r) || Math.abs(d) < 1e-10 && a(s, i, r)));
   }
   /**
    * 判断一个点是否在线段上（含端点）
@@ -718,7 +718,7 @@ class B {
     if (Math.abs(r) < 1e-10)
       return null;
     const o = ((t.x - s.x) * (s.y - i.y) - (t.y - s.y) * (s.x - i.x)) / r, a = t.x + o * (n.x - t.x), l = t.y + o * (n.y - t.y);
-    return new w(a, l);
+    return new g(a, l);
   }
   /**
    * 获取两条线段夹角
@@ -758,6 +758,52 @@ class B {
     const n = this.includedAngle(e);
     return n < t || n > 180 - t;
   }
+  /** 判断点在当前线段的左边还是右边，或者线段上
+   * @param point 
+   */
+  pointPosition(e) {
+    const t = this.start, n = this.end, s = (n.x - t.x) * (e.y - t.y) - (n.y - t.y) * (e.x - t.x);
+    return Math.abs(s) < 1e-10 ? "on" : s > 0 ? "left" : "right";
+  }
+  /** 
+   * @returns 
+   */
+  getRightDirection() {
+    return this.normal();
+  }
+  /**
+   * 
+   * @returns 
+   */
+  getLeftDirection() {
+    return this.normal().multiplyScalar(-1);
+  }
+  /** @param line 获取两条线段之间的最短距离
+   */
+  getMinLength(e) {
+    if (this.intersectLineSegment(e))
+      return 0;
+    const t = (n, s) => {
+      const i = s.start, r = s.end, o = r.x - i.x, a = r.y - i.y, l = o * o + a * a;
+      if (l < 1e-10)
+        return n.distance(i);
+      const c = ((n.x - i.x) * o + (n.y - i.y) * a) / l;
+      if (c < 0)
+        return n.distance(i);
+      if (c > 1)
+        return n.distance(r);
+      {
+        const h = i.x + c * o, d = i.y + c * a;
+        return n.distance(new g(h, d));
+      }
+    };
+    return Math.min(
+      t(this.start, e),
+      t(this.end, e),
+      t(e.start, this),
+      t(e.end, this)
+    );
+  }
   /**
    * 判断两条直线是否重合
    * @param line 
@@ -767,8 +813,11 @@ class B {
     const t = this.start, n = this.end, s = e.start, i = e.end, r = (n.y - t.y) / (n.x - t.x), o = t.y - r * t.x, a = (i.y - s.y) / (i.x - s.x), l = s.y - a * s.x;
     return !isFinite(r) && !isFinite(a) ? t.x === s.x && n.x === s.x : Math.abs(r - a) < 1e-3 && Math.abs(o - l) < 1e-3;
   }
+  /** 克隆
+   * @returns 
+   */
   clone() {
-    const e = new B(
+    const e = new N(
       this.points[0].clone(),
       this.points[1].clone()
     );
@@ -788,7 +837,7 @@ class B {
     return s;
   }
 }
-class w {
+class g {
   x;
   y;
   get X() {
@@ -905,7 +954,7 @@ class w {
    */
   normal(e) {
     const t = this.x - e.x, n = this.y - e.y, s = Math.sqrt(t * t + n * n), i = -n / s, r = t / s;
-    return new w(i, r);
+    return new g(i, r);
   }
   /**
    * 获取由传入的点到该点的单位方向向量
@@ -915,17 +964,18 @@ class w {
    */
   direction(e) {
     const t = this.x - e.x, n = this.y - e.y, s = Math.sqrt(t * t + n * n);
-    return s === 0 ? new w(0, 0) : new w(t / s, n / s);
+    return s === 0 ? new g(0, 0) : new g(t / s, n / s);
   }
   /** 展开为线
    * @param direction 
    * @param length 
    */
-  expandAsLine(e, t) {
-    return new B(
+  expandAsLine(e, t, n) {
+    const s = new N(
       this.clone(),
       this.clone().add(e.clone().multiplyScalar(t))
     );
+    return s.userData = n, s;
   }
   /**
    * 计算模长
@@ -983,7 +1033,7 @@ class w {
    * @returns 
    */
   clone() {
-    return new w(this.x, this.y);
+    return new g(this.x, this.y);
   }
   /**
    * 克隆
@@ -1000,24 +1050,24 @@ class w {
     };
   }
   static from(e) {
-    return Array.isArray(e) ? new w(e[0], e[1]) : "x" in e && "y" in e ? new w(e.x, e.y) : "X" in e && "Y" in e ? new w(e.X, e.Y) : this.zero();
+    return Array.isArray(e) ? new g(e[0], e[1]) : "x" in e && "y" in e ? new g(e.x, e.y) : "X" in e && "Y" in e ? new g(e.X, e.Y) : this.zero();
   }
   static zero() {
-    return new w(0, 0);
+    return new g(0, 0);
   }
 }
-async function K(d, e = !0) {
+async function se(f, e = !0) {
   if (typeof global < "u" && typeof require < "u")
-    return require(d);
+    return require(f);
   {
     let t = await import(
       /* @vite-ignore */
-      d
+      f
     );
     return e && (t = t.default), t;
   }
 }
-class X {
+class Z {
   bounds;
   // 包围盒
   capacity;
@@ -1083,23 +1133,23 @@ class X {
     if (!this.isLeaf) return;
     this.isLeaf = !1, this.children = [];
     const e = (this.bounds.minX + this.bounds.maxX) / 2, t = (this.bounds.minY + this.bounds.maxY) / 2;
-    this.children[0] = new X(
-      new _(this.bounds.minX, e, this.bounds.minY, t),
+    this.children[0] = new Z(
+      new j(this.bounds.minX, e, this.bounds.minY, t),
       this.capacity,
       this.maxDepth,
       this.depth + 1
-    ), this.children[1] = new X(
-      new _(e, this.bounds.maxX, this.bounds.minY, t),
+    ), this.children[1] = new Z(
+      new j(e, this.bounds.maxX, this.bounds.minY, t),
       this.capacity,
       this.maxDepth,
       this.depth + 1
-    ), this.children[2] = new X(
-      new _(this.bounds.minX, e, t, this.bounds.maxY),
+    ), this.children[2] = new Z(
+      new j(this.bounds.minX, e, t, this.bounds.maxY),
       this.capacity,
       this.maxDepth,
       this.depth + 1
-    ), this.children[3] = new X(
-      new _(e, this.bounds.maxX, t, this.bounds.maxY),
+    ), this.children[3] = new Z(
+      new j(e, this.bounds.maxX, t, this.bounds.maxY),
       this.capacity,
       this.maxDepth,
       this.depth + 1
@@ -1128,7 +1178,7 @@ class X {
    * @returns 相交的节点数组
    */
   queryCircle(e, t) {
-    const n = [], s = new _(
+    const n = [], s = new j(
       e.x - t,
       e.x + t,
       e.y - t,
@@ -1140,8 +1190,8 @@ class X {
       const [r, o] = i.line.points, a = o.x - r.x, l = o.y - r.y, c = a * a + l * l;
       let h = ((e.x - r.x) * a + (e.y - r.y) * l) / c;
       h = Math.max(0, Math.min(1, h));
-      const f = r.x + h * a, u = r.y + h * l;
-      e.distance(new w(f, u)) <= t && n.push(i);
+      const d = r.x + h * a, u = r.y + h * l;
+      e.distance(new g(d, u)) <= t && n.push(i);
     }
     if (!this.isLeaf)
       for (const i of this.children)
@@ -1209,7 +1259,7 @@ class X {
     })), e;
   }
 }
-class he {
+class ge {
   map = /* @__PURE__ */ new Map();
   targetMap = /* @__PURE__ */ new Map();
   gridSize;
@@ -1263,7 +1313,7 @@ class he {
    */
   decodeGridId(e) {
     const [t, n] = e.split(".").map(Number);
-    return new w(t, n);
+    return new g(t, n);
   }
   /**
    * 查询与矩形相交的点
@@ -1288,7 +1338,7 @@ class he {
    * @returns 相交的节点数组
    */
   queryCircle(e, t) {
-    const n = new _(e.x - t, e.x + t, e.y - t, e.y + t), 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 j(e.x - t, e.x + t, e.y - t, e.y + t), 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 l = s; l <= i; l++)
       for (let c = r; c <= o; c++) {
         const h = `${l}.${c}`;
@@ -1338,7 +1388,7 @@ class he {
     return null;
   }
 }
-const Qe = {
+const at = {
   Unitless: 1,
   // 无单位，1米 = 1（无单位）
   Inches: 39.37007874015748,
@@ -1382,27 +1432,27 @@ const Qe = {
   Parsecs: 3240779289666404e-32
   // 秒差距，1米 ≈ 0.00000000000000003240779289666404秒差距
 };
-function xe(d) {
+function Ee(f) {
   const e = [];
-  for (let t = 0; t < d.length; t++)
-    e.push(new B(
-      d[t].clone(),
-      d[(t + 1) % d.length].clone()
+  for (let t = 0; t < f.length; t++)
+    e.push(new N(
+      f[t].clone(),
+      f[(t + 1) % f.length].clone()
     ));
   return e;
 }
-function ye(d) {
-  return d.flatMap((e, t) => (t === d.length - 1 && [...e.points, d[0].points[0]], [e.points[0]]));
+function De(f) {
+  return f.flatMap((e, t) => (t === f.length - 1 && [...e.points, f[0].points[0]], [e.points[0]]));
 }
-class V extends J {
+class $ extends ne {
   static name = "Dxf";
   shortLine = 0.04;
   width = 0.04;
   scale = 1;
   originalData = [];
   data = [];
-  originalBox = new _(0, 0, 0, 0);
-  box = new _(0, 0, 0, 0);
+  originalBox = new j(0, 0, 0, 0);
+  box = new j(0, 0, 0, 0);
   pointsGroups = [];
   wallsGroup = [];
   doors = [];
@@ -1427,7 +1477,6 @@ class V extends J {
     return this.lineSegments;
   }
   /**初始化
-   * @param data 点云数据
    * @param width 墙体宽度
    * @param scale 缩放比例
    */
@@ -1438,62 +1487,62 @@ class V extends J {
    * 预处理数据
    * @param data 
    */
-  preprocessing(e, t = !1) {
-    const n = [];
-    let s = -1;
-    const i = [];
-    e.forEach(({ start: o, end: a, ...l }, c) => {
-      i.push(o.z ?? 0, a.z ?? 0);
-      const h = new B(
-        w.from(o),
-        w.from(a)
+  preprocessing(e, t = !1, n) {
+    let s = [], i = -1;
+    const r = [];
+    e.forEach(({ start: a, end: l, ...c }, h) => {
+      r.push(a.z ?? 0, l.z ?? 0);
+      const d = new N(
+        g.from(a),
+        g.from(l)
       );
-      h.userData = l, n.push(h), l.isVerticalReferenceLine && (s = c);
-    }), this.originalZAverage = i.reduce((o, a) => o + a, 0) / i.length, s === -1 && (s = B.maxLengthLineIndex(n, (o) => !o.userData.insetionArr?.length));
-    const r = n[s];
-    if (r.userData.isVerticalReferenceLine = !0, e[s].isVerticalReferenceLine = !0, t) {
-      let o = V.axisAlignmentCorrection.call(this, n, r);
-      return {
-        lineSegments: o,
-        data: this.lineDataToOriginalData(o)
-      };
-    }
-    return {
-      lineSegments: n,
-      data: e
-    };
+      d.userData = c, s.push(d), c.isVerticalReferenceLine && (i = h);
+    }), this.originalZAverage = r.reduce((a, l) => a + l, 0) / r.length, i === -1 && (i = N.maxLengthLineIndex(s, (a) => !a.userData.insetionArr?.length));
+    const o = s[i];
+    return o.userData.isVerticalReferenceLine = !0, e[i].isVerticalReferenceLine = !0, t && (s = $.axisAlignmentCorrection.call(this, s, o, n), e = this.lineDataToOriginalData(s)), this.dispatchEvent({
+      type: "preprocessing",
+      data: e,
+      setData(a) {
+        s = a.map(({ start: l, end: c, ...h }) => {
+          const d = new N(g.from(l), g.from(c));
+          return d.userData = h, d;
+        }), e = a;
+      }
+    }), { lineSegments: s, data: e };
   }
-  /**
-   * 设置
-   * @param data 
-   * @param width 
-   * @param scale 
+  /** 设置
+   * @param data 房屋结构数据，node环境可以为路径
+   * @param width 墙体宽度
+   * @param scale 缩放比例
+   * @param axisAlignmentCorrection 需要执行轴对称垂直纠正
+   * @param option 
+   * @returns 
    */
-  async set(e, t = this.width, n = this.scale, s = !1) {
+  async set(e, t = this.width, n = this.scale, s = !1, i) {
     if (typeof e == "string")
       if (typeof global < "u") {
-        const { default: a } = await import(
+        const { default: l } = await import(
           /* @vite-ignore */
           "fs"
-        ), l = a.readFileSync(e), c = JSON.parse(l.toString("utf-8"));
-        return this.set(c, t, n, s);
+        ), c = l.readFileSync(e), h = JSON.parse(c.toString("utf-8"));
+        return this.set(h, t, n, s);
       } else
         throw new Error("非node环境不允许使用路径");
     this.scale = n, this.width = t;
-    const i = this.preprocessing(e, s);
-    e = i.data, this.lineSegments = i.lineSegments, this.originalData = e;
-    const r = [];
-    this.data = e.map(({ start: o, end: a, insetionArr: l, isDoor: c = !1 }, h) => {
-      r.push(o.z ?? 0, a.z ?? 0);
-      const f = this.lineSegments[h];
+    const r = this.preprocessing(e, s, i);
+    e = r.data, this.lineSegments = r.lineSegments, this.originalData = e;
+    const o = [];
+    this.data = e.map(({ start: a, end: l, insetionArr: c, isDoor: h = !1 }, d) => {
+      o.push(a.z ?? 0, l.z ?? 0);
+      const u = this.lineSegments[d];
       return [
-        f.points[0],
-        f.points[1],
-        (l ?? []).map((u) => u.index),
-        c,
-        h
+        u.points[0],
+        u.points[1],
+        (c ?? []).map((p) => p.index),
+        h,
+        d
       ];
-    }), this.originalZAverage = r.reduce((o, a) => o + a, 0) / r.length, this.computedOriginalSize(e, this.originalBox), this.dispatchEvent({
+    }), this.originalZAverage = o.reduce((a, l) => a + l, 0) / o.length, this.computedOriginalSize(e, this.originalBox), this.dispatchEvent({
       type: "setDta",
       originalData: this.originalData,
       data: this.data
@@ -1508,8 +1557,8 @@ class V extends J {
    */
   createGroups() {
     const e = [], t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Map(), i = (r, o, a = -1) => {
-      const [l, c, h, f] = this.data[r];
-      if (t.add(r), f)
+      const [l, c, h, d] = this.data[r];
+      if (t.add(r), d)
         return s.has(r) || s.set(r, []), s.get(r)?.push(a), n.add(this.data[r]);
       o.push([l, c]), h.forEach((u) => {
         t.has(u) || i(u, o, r);
@@ -1604,7 +1653,7 @@ class V extends J {
         break;
       }
     }
-    const t = this.mergeSameDirectionLine(xe(e)), n = [t[0]];
+    const t = this.mergeSameDirectionLine(Ee(e)), n = [t[0]];
     for (let s = 1; s < t.length; s++) {
       const i = t[s], r = t[(t.length + s - 1) % t.length];
       if (i.length() > this.width * 0.9) {
@@ -1619,7 +1668,7 @@ class V extends J {
       const a = t[s + 2];
       a && r.includedAngle(a) < 2 ? (s = s + 2, n.push(a)) : n.push(i);
     }
-    return n.length > 3 ? ye(this.mergeSameDirectionLine(n)) : [];
+    return n.length > 3 ? De(this.mergeSameDirectionLine(n)) : [];
   }
   /**
    * 移除短线段
@@ -1627,7 +1676,7 @@ class V extends J {
    * @param path 
    */
   removeShortLine(e, t = this.shortLine) {
-    const n = xe(e), s = [], i = Math.PI / 180;
+    const n = Ee(e), s = [], i = Math.PI / 180;
     for (let r = 0; r < n.length; r++) {
       const o = n[r], a = o.length(), l = r;
       if (a > t || s.length === 0) {
@@ -1635,9 +1684,9 @@ class V extends J {
         continue;
       }
       let c = n[++r];
-      const h = s[s.length - 1], f = h.direction();
+      const h = s[s.length - 1], d = h.direction();
       for (; r < n.length; ) {
-        const p = f.angleBetween(c.direction()) / i;
+        const p = d.angleBetween(c.direction()) / i;
         if (c.length() <= t || p < 4 || p > 176)
           c = n[++r];
         else break;
@@ -1655,20 +1704,20 @@ class V extends J {
       } else
         r = l;
     }
-    return s.length > 3 ? ye(s) : [];
+    return s.length > 3 ? De(s) : [];
   }
   /** 线偏移
    * @description 使用 ClipperLib 对每个点组进行线偏移处理，生成具有指定宽度的墙体路径
    */
-  lineOffset(e = V.EndType.etOpenSquare, t = V.JoinType.jtMiter, n = 1e4) {
-    let s = new pe.Paths();
-    const i = new pe.ClipperOffset(20, 0.25);
+  lineOffset(e = $.EndType.etOpenSquare, t = $.JoinType.jtMiter, n = 1e4) {
+    let s = new Le.Paths();
+    const i = new Le.ClipperOffset(20, 0.25);
     return this.pointsGroups.forEach((r) => {
       const o = this.lineTopology(r).map((a) => a.map((l) => l.clone().mutiplyScalar(n)));
       i.AddPaths(o, t, e);
     }), i.Execute(s, this.width / 2 * n), this.wallsGroup = s.map((r) => {
-      let o = r.map((a) => w.from(a).divisionScalar(n));
-      return o = this.lineSegmentStraightening(o), e == V.EndType.etOpenSquare && (o = this.squareRemoveBurr(o)), o;
+      let o = r.map((a) => g.from(a).divisionScalar(n));
+      return o = this.lineSegmentStraightening(o), e == $.EndType.etOpenSquare && (o = this.squareRemoveBurr(o)), o;
     }), this.dispatchEvent({
       type: "lineOffset",
       wallsGroup: this.wallsGroup
@@ -1703,31 +1752,13 @@ class V extends J {
    * 线段数据转为原始json数据
    */
   lineDataToOriginalData(e, t) {
-    return t || (t = new X(_.fromByLineSegment(...e)), e.forEach((n) => t?.insert({ line: n, userData: void 0 }))), e.map((n) => {
-      const s = n.userData, i = s.drawWindow, r = t.queryLineSegment(n).filter((o) => o.line !== n && !o.userData?.isDoor).map((o) => ({ index: e.indexOf(o.line) }));
-      return {
-        start: n.start.toJson(this.originalZAverage),
-        end: n.end.toJson(this.originalZAverage),
-        insetionArr: r,
-        isDoor: s.isDoor,
-        doorDirectConnection: s.isDoor,
-        length: n.length(),
-        isWindow: s.isWindow,
-        isVerticalReferenceLine: s.isVerticalReferenceLine,
-        wallWidth: n.userData.wallWidth,
-        drawWindow: i && i.map((o) => ({
-          p: { x: o.p.x, y: o.p.y, z: o.p.z },
-          width: o.width,
-          full: o.full
-        }))
-      };
-    });
+    return $.lineDataToOriginalData(e, this.originalZAverage, t);
   }
   /**
    * 转为绘制数据
    */
   toDrawDataJson(e = "Millimeters") {
-    const t = Qe[e], n = {
+    const t = at[e], n = {
       unit: e,
       line: [],
       arc: [],
@@ -1741,13 +1772,13 @@ class V extends J {
     function i(l, c) {
       n.line.push([l.x * t, l.y * t, c.x * t, c.y * t, s]);
     }
-    function r(l, c, h, f) {
+    function r(l, c, h, d) {
       n.arc.push([
         l.x * t,
         l.y * t,
         c * t,
         h,
-        f,
+        d,
         s
       ]);
     }
@@ -1760,7 +1791,7 @@ class V extends J {
     }
     this.wallsGroup.forEach((l) => {
       for (let c = 0; c < l.length; c++) {
-        const h = l[c], f = c === l.length - 1 ? 0 : c + 1, u = l[f];
+        const h = l[c], d = c === l.length - 1 ? 0 : c + 1, u = l[d];
         i(h, u);
       }
     });
@@ -1771,29 +1802,29 @@ class V extends J {
       if (s = "cyan", c.length() < 1.2) {
         c.expansion(-o * 0.5);
         const h = l.normal();
-        let f = new B(
+        let d = new N(
           c.start.clone(),
           c.start.clone().add(h.clone().multiplyScalar(c.length()))
         );
-        const u = f.clone().directionMove(f.normal(), c.length() * -0.5).expandToRectangle(c.length(), "bothSides");
-        for (let A = 0; A < a.length; A++)
-          if (a[A].intersectRectangle(u)) {
-            f = new B(
+        const u = d.clone().directionMove(d.normal(), c.length() * -0.5).expandToRectangle(c.length(), "bothSides");
+        for (let E = 0; E < a.length; E++)
+          if (a[E].intersectRectangle(u)) {
+            d = new N(
               c.start.clone(),
               c.start.clone().add(h.clone().multiplyScalar(-c.length()))
             );
             break;
           }
-        f.expansion(-o * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((A, P) => i(A, P));
-        const p = c.length(), y = f.length(), x = (p ** 2 + y ** 2) / (2 * y), S = f.end.clone().add(f.direction().multiplyScalar(-x)), [R, F] = this.getArcAngleRange(S, c.end, f.end);
-        r(S, x, Math.min(R, F), Math.max(R, F)), a.push(u);
+        d.expansion(-o * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((E, R) => i(E, R));
+        const p = c.length(), y = d.length(), x = (p ** 2 + y ** 2) / (2 * y), S = d.end.clone().add(d.direction().multiplyScalar(-x)), [T, G] = this.getArcAngleRange(S, c.end, d.end);
+        r(S, x, Math.min(T, G), Math.max(T, G)), a.push(u);
       } else
-        c.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((h, f) => i(h, f)), c.clone().directionMove(c.normal(), o * 0.5).directionMove(c.direction(), o * 0.5).expansion(-c.length() * 0.45, "end").forward(o * 0.5).expandToRectangle(o).path2D((h, f) => i(h, f)), c.clone().directionMove(c.normal(), -o * 0.5).directionMove(c.direction(), -o * 0.5).expansion(-c.length() * 0.45, "start").forward(-o * 0.5).expandToRectangle(o).path2D((h, f) => i(h, f));
+        c.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((h, d) => i(h, d)), c.clone().directionMove(c.normal(), o * 0.5).directionMove(c.direction(), o * 0.5).expansion(-c.length() * 0.45, "end").forward(o * 0.5).expandToRectangle(o).path2D((h, d) => i(h, d)), c.clone().directionMove(c.normal(), -o * 0.5).directionMove(c.direction(), -o * 0.5).expansion(-c.length() * 0.45, "start").forward(-o * 0.5).expandToRectangle(o).path2D((h, d) => i(h, d));
     }), s = "yellow", this.lineSegments.forEach((l) => {
       if (!l.userData.isWindow) return !1;
       Array.isArray(l.userData.drawWindow) && l.userData.drawWindow.forEach((c) => {
-        const { p: h, width: f } = c, u = w.from(h), p = u.clone().add(l.direction().multiplyScalar(f * 0.5)), y = u.clone().add(l.direction().multiplyScalar(-f * 0.5)), x = new B(p, y);
-        i(x.start, x.end), x.expandToRectangle(this.width, "bothSides").path2D((S, R) => i(S, R));
+        const { p: h, width: d } = c, u = g.from(h), p = u.clone().add(l.direction().multiplyScalar(d * 0.5)), y = u.clone().add(l.direction().multiplyScalar(-d * 0.5)), x = new N(p, y);
+        i(x.start, x.end), x.expandToRectangle(this.width, "bothSides").path2D((S, T) => i(S, T));
       });
     }), n;
   }
@@ -1807,7 +1838,7 @@ class V extends J {
     if (typeof window < "u")
       i = document.createElement("canvas");
     else if (typeof global < "u") {
-      const { createCanvas: l } = await K("canvas");
+      const { createCanvas: l } = await se("canvas");
       i = l();
     } else
       throw new Error("创建画布失败");
@@ -1818,12 +1849,12 @@ class V extends J {
     };
     i.width = s.width + r * 2, i.height = s.height + r * 2;
     const a = i.getContext("2d");
-    return n && (a.fillStyle = n, a.fillRect(0, 0, i.width, i.height)), a.translate(s.width * 0.5 + r, s.height * 0.5 + r), a.scale(1, -1), s.line.forEach(([l, c, h, f, u]) => {
-      a.strokeStyle = o[u], a.beginPath(), a.moveTo(l, c), a.lineTo(h, f), a.closePath(), a.stroke();
-    }), s.arc.forEach(([l, c, h, f, u, p]) => {
-      a.strokeStyle = o[p], a.beginPath(), a.arc(l, c, h, f * (Math.PI / 180), u * (Math.PI / 180)), a.stroke();
+    return n && (a.fillStyle = n, a.fillRect(0, 0, i.width, i.height)), a.translate(s.width * 0.5 + r, s.height * 0.5 + r), a.scale(1, -1), s.line.forEach(([l, c, h, d, u]) => {
+      a.strokeStyle = o[u], a.beginPath(), a.moveTo(l, c), a.lineTo(h, d), a.closePath(), a.stroke();
+    }), s.arc.forEach(([l, c, h, d, u, p]) => {
+      a.strokeStyle = o[p], a.beginPath(), a.arc(l, c, h, d * (Math.PI / 180), u * (Math.PI / 180)), a.stroke();
     }), a.beginPath(), s.dimensionLine.forEach((l) => {
-      let [c, h, f, u] = l;
+      let [c, h, d, u] = l;
       const p = Math.min(h, u), y = Math.max(h, u), x = (i.width * 0.5 - 0.4 * s.scale) * (c < 0 ? -1 : 1), S = (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, S + p), a.moveTo(x, y), a.lineTo(x, y - S), 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((l) => {
@@ -1836,8 +1867,8 @@ class V extends J {
    * 将点json结构转换为Dxf string
    */
   toDxfString(e = "Millimeters") {
-    const t = new Q();
-    t.setUnits(e), t.addLayer("cyan", Q.ACI.CYAN, "DOTTED"), t.addLayer("yellow", Q.ACI.YELLOW, "DOTTED"), t.addLayer("white", Q.ACI.WHITE, "DOTTED");
+    const t = new ae();
+    t.setUnits(e), t.addLayer("cyan", ae.ACI.CYAN, "DOTTED"), t.addLayer("yellow", ae.ACI.YELLOW, "DOTTED"), t.addLayer("white", ae.ACI.WHITE, "DOTTED");
     const n = this.toDrawDataJson();
     return n.line.forEach((s) => {
       let [i, r, o, a, l] = s;
@@ -1863,7 +1894,7 @@ class V extends J {
     if (typeof window < "u") {
       const n = new Blob([t], { type: "application/json" }), s = document.createElement("a");
       s.href = URL.createObjectURL(n), s.download = e, s.click();
-    } else typeof global < "u" && (await K("fs", !1)).writeFileSync(e, t);
+    } else typeof global < "u" && (await se("fs", !1)).writeFileSync(e, t);
   }
   /**
    * 下载
@@ -1873,7 +1904,7 @@ class V extends J {
     if (typeof window < "u") {
       const n = this.toDxfBlob(t), s = document.createElement("a");
       s.href = URL.createObjectURL(n), s.download = e + ".dxf", s.click();
-    } else typeof global < "u" && (await K("fs", !1)).writeFileSync(e, this.toDxfString(t));
+    } else typeof global < "u" && (await se("fs", !1)).writeFileSync(e, this.toDxfString(t));
   }
   /**
    * 下载
@@ -1885,7 +1916,7 @@ class V extends J {
     if (typeof window < "u") {
       const i = document.createElement("a");
       i.href = URL.createObjectURL(s), i.download = e, i.click();
-    } else typeof global < "u" ? (await K("fs", !1)).writeFileSync(e, s) : console.error("图片下载失败");
+    } else typeof global < "u" ? (await se("fs", !1)).writeFileSync(e, s) : console.error("图片下载失败");
     return !0;
   }
   /**
@@ -1893,10 +1924,34 @@ class V extends J {
    * @description 计算所有线段的起点和终点的最小最大值，形成一个边界框
    * @returns 
    */
-  computedOriginalSize(e, t = new _(0, 0, 0, 0)) {
+  computedOriginalSize(e, t = new j(0, 0, 0, 0)) {
     const n = e.flatMap((l) => [l.start.x, l.end.x]), s = e.flatMap((l) => [l.start.y, l.end.y]), i = Math.min(...n), r = Math.min(...s), o = Math.max(...n), a = Math.max(...s);
     return t.set(i, r, o, a), t;
   }
+  /**
+   * 线段数据转为原始json数据
+   */
+  static lineDataToOriginalData(e, t = 0, n) {
+    return n || (n = new Z(j.fromByLineSegment(...e)), e.forEach((s) => n?.insert({ line: s, userData: void 0 }))), e.map((s) => {
+      const i = s.userData, r = i.drawWindow, o = n.queryLineSegment(s).filter((a) => a.line !== s && !a.userData?.isDoor).map((a) => ({ index: e.indexOf(a.line) }));
+      return {
+        start: s.start.toJson(t),
+        end: s.end.toJson(t),
+        insetionArr: o,
+        isDoor: i.isDoor,
+        doorDirectConnection: i.isDoor,
+        length: s.length(),
+        isWindow: i.isWindow,
+        isVerticalReferenceLine: i.isVerticalReferenceLine,
+        wallWidth: s.userData.wallWidth,
+        drawWindow: r && r.map((a) => ({
+          p: { x: a.p.x, y: a.p.y, z: a.p.z },
+          width: a.width,
+          full: a.full
+        }))
+      };
+    });
+  }
   /**
    * 创建数据
    * @param pointsGroups 
@@ -1926,292 +1981,316 @@ class V extends J {
    * @param targettLine 轴线段
    * @returns 
    */
-  static axisAlignmentCorrection(e, t) {
-    function n(M, L) {
-      const g = [];
-      for (let b = 0; b < M.length; b++) {
-        const m = M[b], E = /* @__PURE__ */ new Map();
-        m.userData.isDoor || m.points.forEach((T) => {
-          if (L.queryPoint(T).length > 1) return;
-          const I = L.queryCircle(T, 0.4).filter((D) => {
-            const v = D.userData;
+  static axisAlignmentCorrection(e, t, n) {
+    const { principalAxisThreshold: s = 0.3, crossAxistThreshold: i = 0.06, snapThreshold: r = 0.2 } = n ?? {};
+    function o(D, b) {
+      const L = [];
+      for (let M = 0; M < D.length; M++) {
+        const m = D[M], w = /* @__PURE__ */ new Map();
+        m.userData.isDoor || m.points.forEach((I) => {
+          if (b.queryPoint(I).length > 1) return;
+          const A = b.queryCircle(I, 0.4).filter((F) => {
+            const v = F.userData;
             if (v === m || !m.parallel(v, 25)) return !1;
-            if (L.queryPoint(D.point).length > 1) return;
-            const O = new B(T, D.point), q = new B(m.start === T ? m.end : m.start, v.start === D.point ? v.end : v.start);
-            if (!O.intersectLineSegment(q)) return !1;
-            const G = T.distance(D.point);
-            return G < 1e-3 ? !1 : (E.set(D.point, G), !0);
-          }).sort((D, v) => {
-            const O = E.get(D.point), q = E.get(v.point);
-            return O - q;
+            if (b.queryPoint(F.point).length > 1) return;
+            const _ = new N(I, F.point), q = new N(m.start === I ? m.end : m.start, v.start === F.point ? v.end : v.start);
+            if (!_.intersectLineSegment(q)) return !1;
+            const Y = I.distance(F.point);
+            return Y < 1e-3 ? !1 : (w.set(F.point, Y), !0);
+          }).sort((F, v) => {
+            const _ = w.get(F.point), q = w.get(v.point);
+            return _ - q;
           });
-          if (I.length === 0) return;
-          const N = I[0].userData;
-          g.push(new B(m.projectLineSegment(N).center, N.projectLineSegment(m).center));
+          if (A.length === 0) return;
+          const B = A[0].userData;
+          L.push(new N(m.projectLineSegment(B).center, B.projectLineSegment(m).center));
         });
       }
-      return [...M, ...g];
+      return [...D, ...L];
     }
-    function s(M) {
-      const L = new he(), g = new X(_.fromByLineSegment(...M)), b = [];
-      return M.forEach((m) => {
-        m.userData.isDoor ? b.push(m) : (m.points.forEach((E) => L.insert(E, m)), g.insert({ line: m, userData: void 0 }));
-      }), b.forEach((m) => {
-        const E = L.queryPoint(m.start), T = L.queryPoint(m.end);
-        E.length ? m.userData.startIntersection = E[0].userData : m.userData.startIntersection = g.queryPoint(m.start)[0]?.line, T.length ? m.userData.endIntersection = T[0].userData : m.userData.endIntersection = g.queryPoint(m.end)[0]?.line;
-      }), M = n(M, L), M;
+    function a(D) {
+      const b = new ge(), L = new Z(j.fromByLineSegment(...D)), M = [];
+      return D.forEach((m) => {
+        m.userData.isDoor ? M.push(m) : (m.points.forEach((w) => b.insert(w, m)), L.insert({ line: m, userData: void 0 }));
+      }), M.forEach((m) => {
+        const w = b.queryPoint(m.start), I = b.queryPoint(m.end);
+        w.length ? m.userData.startIntersection = w[0].userData : m.userData.startIntersection = L.queryPoint(m.start)[0]?.line, I.length ? m.userData.endIntersection = I[0].userData : m.userData.endIntersection = L.queryPoint(m.end)[0]?.line;
+      }), D = o(D, b), D;
     }
-    function i(M, L) {
-      const g = [M], b = [], m = [], E = [];
-      for (let T = 0; T < L.length; T++) {
-        const I = L[T];
-        if (M !== I)
-          if (I.userData.isWindow && E.push(I), I.parallel(M, 45)) {
-            const N = Math.atan2(I.end.y - I.start.y, I.end.x - I.start.x);
-            let v = Math.atan2(M.end.y - M.start.y, M.end.x - M.start.x) - N;
+    function l(D) {
+      const b = new Z(j.fromByLineSegment(...D));
+      D.forEach((M) => {
+        M.userData.isDoor || b.insert({ line: M, userData: void 0 });
+      });
+      const L = /* @__PURE__ */ new Map();
+      for (let M = 0; M < D.length; M++) {
+        const m = D[M];
+        L.set(m, b.queryLineSegment(m).filter((w) => w.line !== m).map((w) => w.line));
+      }
+      return L;
+    }
+    function c(D, b) {
+      const L = [D], M = [], m = [], w = [];
+      for (let I = 0; I < b.length; I++) {
+        const A = b[I];
+        if (D !== A)
+          if (A.userData.isWindow && w.push(A), A.parallel(D, 45)) {
+            const B = Math.atan2(A.end.y - A.start.y, A.end.x - A.start.x);
+            let v = Math.atan2(D.end.y - D.start.y, D.end.x - D.start.x) - B;
             for (; v > Math.PI; ) v -= 2 * Math.PI;
             for (; v < -Math.PI; ) v += 2 * Math.PI;
-            const O = I.center;
-            I.start.rotate(O, v), I.end.rotate(O, v), I.userData.isDoor ? m.push(I) : g.push(I);
+            const _ = A.center;
+            A.start.rotate(_, v), A.end.rotate(_, v), A.userData.isDoor ? m.push(A) : L.push(A);
           } else {
-            const N = Math.atan2(I.end.y - I.start.y, I.end.x - I.start.x), D = Math.atan2(M.end.y - M.start.y, M.end.x - M.start.x);
-            let v = D + Math.PI / 2 - N, O = D - Math.PI / 2 - N;
+            const B = Math.atan2(A.end.y - A.start.y, A.end.x - A.start.x), F = Math.atan2(D.end.y - D.start.y, D.end.x - D.start.x);
+            let v = F + Math.PI / 2 - B, _ = F - Math.PI / 2 - B;
             for (; v > Math.PI; ) v -= 2 * Math.PI;
             for (; v < -Math.PI; ) v += 2 * Math.PI;
-            for (; O > Math.PI; ) O -= 2 * Math.PI;
-            for (; O < -Math.PI; ) O += 2 * Math.PI;
-            const q = Math.abs(v) < Math.abs(O) ? v : O, G = I.center;
-            I.start.rotate(G, q), I.end.rotate(G, q), I.userData.isDoor ? m.push(I) : b.push(I);
+            for (; _ > Math.PI; ) _ -= 2 * Math.PI;
+            for (; _ < -Math.PI; ) _ += 2 * Math.PI;
+            const q = Math.abs(v) < Math.abs(_) ? v : _, Y = A.center;
+            A.start.rotate(Y, q), A.end.rotate(Y, q), A.userData.isDoor ? m.push(A) : M.push(A);
           }
       }
-      return { parallelLines: g, verticalLines: b, doorLines: m, windowLines: E };
+      return { parallelLines: L, verticalLines: M, doorLines: m, windowLines: w };
     }
-    function r(M, L, g, b = 0.3, m = 0.1) {
-      const E = [];
-      M.forEach((N) => {
-        const D = g.projectPoint(N.start, !1);
-        D && (D.userData = N, E.push(D));
-      }), E.sort((N, D) => D.distance(g.start) - N.distance(g.start));
-      const T = [], I = [];
-      for (let N = 0; N < E.length; N++) {
-        const D = E[N];
-        if (N === 0) {
-          I.push(D);
+    function h(D, b, L) {
+      const M = [];
+      D.forEach((I) => {
+        const A = L.projectPoint(I.start, !1);
+        A && (A.userData = I, M.push(A));
+      }), M.sort((I, A) => A.distance(L.start) - I.distance(L.start));
+      const m = [], w = [];
+      for (let I = 0; I < M.length; I++) {
+        const A = M[I];
+        if (I === 0) {
+          w.push(A);
           continue;
         }
-        E[N - 1].distance(D) < m || (T.push([...I]), I.length = 0), I.push(D), N === E.length - 1 && T.push(I);
+        M[I - 1].distance(A) < i || (m.push([...w]), w.length = 0), w.push(A), I === M.length - 1 && m.push(w);
       }
-      return T.flatMap((N) => {
-        const D = N.flatMap((G) => {
-          const j = G.userData;
-          return j.points.map((k) => {
-            const z = L.projectPoint(k, !1);
-            return z.userData = j, z;
+      return m.flatMap((I) => {
+        const A = I.flatMap((_) => {
+          const q = _.userData;
+          return q.points.map((Y) => {
+            const Q = b.projectPoint(Y, !1);
+            return Q.userData = q, Q;
           });
         });
-        D.sort((G, j) => G.distance(L.start) - j.distance(L.start));
-        const v = /* @__PURE__ */ new Map(), O = [], q = [];
-        return D.forEach((G, j) => {
-          v.size === 0 && j > 0 && D[j - 1].distance(G) > b && (O.push([...q]), q.length = 0), v.set(G.userData, (v.get(G.userData) ?? 0) + 1);
-          for (const k of v.values()) if (k !== 2) return;
-          q.push(...v.keys()), v.clear();
-        }), O.push([...q]), O;
+        A.sort((_, q) => _.distance(b.start) - q.distance(b.start));
+        const B = /* @__PURE__ */ new Map(), F = [], v = [];
+        return A.forEach((_, q) => {
+          B.size === 0 && q > 0 && A[q - 1].distance(_) > s && (F.push([...v]), v.length = 0), B.set(_.userData, (B.get(_.userData) ?? 0) + 1);
+          for (const Y of B.values()) if (Y !== 2) return;
+          v.push(...B.keys()), B.clear();
+        }), F.push([...v]), F;
       });
     }
-    function o(M, L = 0.1) {
-      return M.map((g) => {
-        if (g.length === 0) return;
-        if (g.length === 1) return g[0];
-        const b = [];
-        g.forEach((z) => {
-          b.push(z.start.clone(), z.end.clone());
+    function d(D, b) {
+      const L = /* @__PURE__ */ new Set();
+      return D.forEach((M) => {
+        for (let m = 1; m < M.length; m++) {
+          const w = M[m], I = M[m - 1];
+          [...b.get(w) ?? [], ...b.get(I) ?? []].forEach((B) => {
+            B.sameEndpointAsStart(w) && B.sameEndpointAsEnd(I) && B.sameEndpointAsStart(I) && B.sameEndpointAsEnd(w) && L.add(B);
+          });
+        }
+      }), D.map((M) => M.filter((m) => !L.has(m)));
+    }
+    function u(D, b = 0.1) {
+      return D.map((L) => {
+        if (L.length === 0) return;
+        if (L.length === 1) return L[0];
+        const M = [];
+        L.forEach((K) => {
+          M.push(K.start.clone(), K.end.clone());
         });
-        const m = g[0].direction().normalize();
-        let E = 1 / 0, T = -1 / 0, I = 0, N = 0;
-        b.forEach((z) => {
-          const $ = z.x * m.x + z.y * m.y;
-          E = Math.min(E, $), T = Math.max(T, $), I += z.x, N += z.y;
+        const m = L[0].direction().normalize();
+        let w = 1 / 0, I = -1 / 0, A = 0, B = 0;
+        M.forEach((K) => {
+          const re = K.x * m.x + K.y * m.y;
+          w = Math.min(w, re), I = Math.max(I, re), A += K.x, B += K.y;
         });
-        const D = new w(I / b.length, N / b.length), v = D.x * m.x + D.y * m.y, O = new w(D.x + (E - v) * m.x, D.y + (E - v) * m.y), q = new w(D.x + (T - v) * m.x, D.y + (T - v) * m.y), G = new B(O, q), j = g[0].normal().normalize();
-        E = 1 / 0, T = -1 / 0, b.forEach((z) => {
-          const $ = z.x * j.x + z.y * j.y;
-          E = Math.min(E, $), T = Math.max(T, $);
+        const F = new g(A / M.length, B / M.length), v = F.x * m.x + F.y * m.y, _ = new g(F.x + (w - v) * m.x, F.y + (w - v) * m.y), q = new g(F.x + (I - v) * m.x, F.y + (I - v) * m.y), Y = new N(_, q), Q = L[0].normal().normalize();
+        w = 1 / 0, I = -1 / 0, M.forEach((K) => {
+          const re = K.x * Q.x + K.y * Q.y;
+          w = Math.min(w, re), I = Math.max(I, re);
         });
-        const k = T - E;
-        return k >= L && (G.userData.wallWidth = k), g.forEach((z) => z.userData.fittedLine = G), G;
-      }).filter((g) => !!g);
+        const ie = I - w;
+        return ie >= b && (Y.userData.wallWidth = ie), L.forEach((K) => K.userData.fittedLine = Y), Y;
+      }).filter((L) => !!L);
     }
-    function a(M, L = 0.2) {
-      const g = new X(_.fromByLineSegment(...M)), b = /* @__PURE__ */ new Map();
-      M.forEach((E) => {
-        b.set(E, { line: E, userData: void 0 }), g.insert(b.get(E));
+    function p(D) {
+      const b = new Z(j.fromByLineSegment(...D)), L = /* @__PURE__ */ new Map();
+      D.forEach((m) => {
+        L.set(m, { line: m, userData: void 0 }), b.insert(L.get(m));
       });
-      const m = new B();
-      for (let E = 0; E < M.length; E++) {
-        const T = M[E];
-        if (T.userData.isAdsorbed) continue;
-        const I = T.direction().multiplyScalar(L), [N, D] = T.points.map((v) => {
-          m.set(v, v), m.start.add(I), m.end.add(I.multiplyScalar(-1));
-          const O = /* @__PURE__ */ new Map(), q = g.queryRect(m.expandToRectangle(0.1, "bothSides")).filter((G) => G.line !== T).map((G) => {
-            const j = G.line.getIntersection(m);
-            return O.set(G.line, j), G.line;
-          }).sort((G, j) => {
-            const k = O.get(G), z = O.get(j);
-            return k && z ? k.distance(v) - z.distance(v) : 0;
+      const M = new N();
+      for (let m = 0; m < D.length; m++) {
+        const w = D[m];
+        if (w.userData.isAdsorbed) continue;
+        const I = w.direction().multiplyScalar(r), [A, B] = w.points.map((F) => {
+          M.set(F, F), M.start.add(I), M.end.add(I.multiplyScalar(-1));
+          const v = /* @__PURE__ */ new Map(), _ = b.queryRect(M.expandToRectangle(0.1, "bothSides")).filter((q) => q.line !== w).map((q) => {
+            const Y = q.line.getIntersection(M);
+            return v.set(q.line, Y), q.line;
+          }).sort((q, Y) => {
+            const Q = v.get(q), ie = v.get(Y);
+            return Q && ie ? Q.distance(F) - ie.distance(F) : 0;
           });
-          return q.length ? O.get(q[0]) : void 0;
+          return _.length ? v.get(_[0]) : void 0;
         });
-        if (N && D) {
-          if (N.equal(D)) {
-            const v = T.start.distance(N), O = T.end.distance(D);
-            v < O ? T.directionMove(T.start.direction(T.end), v) : T.directionMove(T.end.direction(T.start), O);
+        if (A && B) {
+          if (A.equal(B)) {
+            const F = w.start.distance(A), v = w.end.distance(B);
+            F < v ? w.directionMove(w.start.direction(w.end), F) : w.directionMove(w.end.direction(w.start), v);
           } else
-            T.start.copy(N), T.end.copy(D);
-          T.userData.isAdsorbed = !0;
-        } else N ? T.start.copy(N) : D && T.end.copy(D);
-        g.remove(b.get(T)), g.insert(b.get(T));
+            w.start.copy(A), w.end.copy(B);
+          w.userData.isAdsorbed = !0;
+        } else A ? w.start.copy(A) : B && w.end.copy(B);
+        b.remove(L.get(w)), b.insert(L.get(w));
       }
-      return M.filter((E) => E.length() > 1e-3);
+      return D.filter((m) => m.length() > 1e-3);
     }
-    function l(M) {
-      for (let L = 0; L < M.length; L++) {
-        const g = M[L], b = g.userData.fittedLine;
-        if (b) {
-          const m = g.direction();
-          b.userData.isWindow = !0, b.userData.drawWindow = b.userData.drawWindow ?? [], g.userData.drawWindow?.forEach((E) => {
-            const T = w.from(E.p), I = b.projectPoint(
-              T.clone().add(m.clone().multiplyScalar(E.width * 0.5))
-            ), N = b.projectPoint(
-              T.clone().add(m.clone().multiplyScalar(E.width * -0.5))
-            ), D = new B(I, N), v = D.center;
-            b.userData.drawWindow?.push({
-              p: new U.Vector3(v?.x ?? 0, v?.y ?? 0, E.p.z),
-              width: D.length(),
-              full: E.full
+    function y(D) {
+      for (let b = 0; b < D.length; b++) {
+        const L = D[b], M = L.userData.fittedLine;
+        if (M) {
+          const m = L.direction();
+          M.userData.isWindow = !0, M.userData.drawWindow = M.userData.drawWindow ?? [], L.userData.drawWindow?.forEach((w) => {
+            const I = g.from(w.p), A = M.projectPoint(
+              I.clone().add(m.clone().multiplyScalar(w.width * 0.5))
+            ), B = M.projectPoint(
+              I.clone().add(m.clone().multiplyScalar(w.width * -0.5))
+            ), F = new N(A, B), v = F.center;
+            M.userData.drawWindow?.push({
+              p: new z.Vector3(v?.x ?? 0, v?.y ?? 0, w.p.z),
+              width: F.length(),
+              full: w.full
             });
           });
         }
       }
     }
-    function c(M) {
-      for (let L = 0; L < M.length; L++) {
-        const g = M[L];
-        let { endIntersection: b, startIntersection: m } = g.userData;
-        if (!(!b || !m)) {
-          if (m.userData.fittedLine && (m = m.userData.fittedLine), b.userData.fittedLine && (b = b.userData.fittedLine), g.isParallel(m))
-            g.start.distance(m.start) < g.start.distance(m.end) ? g.start.copy(m.start) : g.start.copy(m.end);
+    function x(D) {
+      for (let b = 0; b < D.length; b++) {
+        const L = D[b];
+        let { endIntersection: M, startIntersection: m } = L.userData;
+        if (!(!M || !m)) {
+          if (m.userData.fittedLine && (m = m.userData.fittedLine), M.userData.fittedLine && (M = M.userData.fittedLine), L.isParallel(m))
+            L.start.distance(m.start) < L.start.distance(m.end) ? L.start.copy(m.start) : L.start.copy(m.end);
           else {
-            const E = m.projectPoint(g.start);
-            E && g.start.copy(E);
+            const w = m.projectPoint(L.start);
+            w && L.start.copy(w);
           }
-          if (g.isParallel(b))
-            g.end.distance(b.start) < g.end.distance(b.end) ? g.end.copy(b.start) : g.end.copy(b.end);
+          if (L.isParallel(M))
+            L.end.distance(M.start) < L.end.distance(M.end) ? L.end.copy(M.start) : L.end.copy(M.end);
           else {
-            const E = b.projectPoint(g.end);
-            E && g.end.copy(E);
+            const w = M.projectPoint(L.end);
+            w && L.end.copy(w);
           }
         }
       }
-      return M;
+      return D;
     }
-    function h(M) {
-      const L = new X(_.fromByLineSegment(...M));
-      return M.forEach((g) => L.insert({ line: g, userData: void 0 })), M.flatMap((g) => {
-        const b = L.queryLineSegment(g, !0).map((m) => {
-          if (m.line === g) return;
-          const E = m.line.getIntersection(g);
-          if (!(!E || g.start.equal(E) || g.end.equal(E)))
-            return E;
+    function S(D) {
+      const b = new Z(j.fromByLineSegment(...D));
+      return D.forEach((L) => b.insert({ line: L, userData: void 0 })), D.flatMap((L) => {
+        const M = b.queryLineSegment(L, !0).map((m) => {
+          if (m.line === L) return;
+          const w = m.line.getIntersection(L);
+          if (!(!w || L.start.equal(w) || L.end.equal(w)))
+            return w;
         }).filter((m) => !!m);
-        if (b.length) {
-          const m = g.clone();
-          b.sort((T, I) => m.start.distance(T) - m.start.distance(I));
-          const E = b.map((T) => {
-            const I = m.clone();
-            return I.set(m.start.clone(), T), m.start.copy(T), m.userData.isWindow && (I.userData.isWindow = !0, I.userData.drawWindow = m.userData.drawWindow?.filter((N) => I.isPointOnSegment(w.from(N.p))) ?? []), I;
+        if (M.length) {
+          const m = L.clone();
+          M.sort((I, A) => m.start.distance(I) - m.start.distance(A));
+          const w = M.map((I) => {
+            const A = m.clone();
+            return A.set(m.start.clone(), I), m.start.copy(I), m.userData.isWindow && (A.userData.isWindow = !0, A.userData.drawWindow = m.userData.drawWindow?.filter((B) => A.isPointOnSegment(g.from(B.p))) ?? []), A;
           });
-          return m.userData.drawWindow = m.userData.drawWindow?.filter((T) => m.isPointOnSegment(w.from(T.p))) ?? [], [...E, m];
+          return m.userData.drawWindow = m.userData.drawWindow?.filter((I) => m.isPointOnSegment(g.from(I.p))) ?? [], [...w, m];
         }
-        return g;
-      }).filter((g) => g.length() > 0.03);
+        return L;
+      }).filter((L) => L.length() > 0.03);
     }
-    e = s(e.map((M) => M.clone()));
-    const { parallelLines: f, verticalLines: u, doorLines: p, windowLines: y } = i(t, e), x = t.normal(), S = t.center, R = t.direction(), F = new B(
-      S.clone().add(x.clone().multiplyScalar(-1e3)),
-      S.clone().add(x.clone().multiplyScalar(1e3))
-    ), A = new B(
-      S.clone().add(R.clone().multiplyScalar(-1e3)),
-      S.clone().add(R.clone().multiplyScalar(1e3))
+    e = a(e.map((D) => D.clone()));
+    const T = l(e), { parallelLines: G, verticalLines: E, doorLines: R, windowLines: U } = c(t, e), P = t.normal(), O = t.center, X = t.direction(), k = new N(
+      O.clone().add(P.clone().multiplyScalar(-1e3)),
+      O.clone().add(P.clone().multiplyScalar(1e3))
+    ), W = new N(
+      O.clone().add(X.clone().multiplyScalar(-1e3)),
+      O.clone().add(X.clone().multiplyScalar(1e3))
     );
-    let P = o([
-      ...r.call(this, f, A, F),
-      ...r.call(this, u, F, A)
-    ]);
-    return P = a.call(this, P), P = a.call(this, P), l(y), c(p), P = h.call(this, P), P.push(...p), P;
+    let J = [
+      ...h.call(this, G, W, k),
+      ...h.call(this, E, k, W)
+    ];
+    J = d(J, T);
+    let V = u(J);
+    return V = p.call(this, V), V = p.call(this, V), y(U), x(R), V = S.call(this, V), V.push(...R), V;
   }
   /** 
    * @param lines 
-   * @param trajectoryPositions 
+   * @param trajectoryPoints
    * @returns 
    */
-  static excessLineSegments(e, t) {
-    const n = new X(_.fromByLineSegment(...e));
-    return e.forEach((s) => n.insert({ line: s, userData: void 0 })), e = e.filter((s) => {
-      const i = s.center;
-      for (const r of t) {
-        const o = new B(i, r);
-        if (!n.queryLineSegment(o).filter((l) => l.line !== s).length) return !1;
-      }
-      return !0;
-    }), e.filter((s) => {
-      const i = n.queryLineSegment(s).filter((r) => r.line !== s);
-      for (let r = 0; r < i.length; r++) {
-        const o = i[r];
-        if (e.indexOf(o.line) === -1) return !1;
+  static findExteriorWall(e, t, n = 0.4) {
+    const s = new Z(j.fromByLineSegment(...e));
+    return e.forEach((i) => s.insert({ line: i, userData: void 0 })), e = e.filter((i) => {
+      const r = i.center, o = /* @__PURE__ */ new Set();
+      for (const a of t) {
+        if (o.size === 2) break;
+        const l = new N(r, a);
+        if (!s.queryLineSegment(l).filter((h) => {
+          if (h.line === i) return !1;
+          if (h.line.isParallel(i)) {
+            if (i.getMinLength(h.line) < n) return !1;
+          } else if (h.line.sameEndpoint(i) && h.line.length() < n) return !1;
+          return !0;
+        }).length) {
+          const h = i.pointPosition(a);
+          h !== "on" && o.add(h);
+        }
       }
-      return !0;
-    });
+      if (i.userData.expandDirect = [...o][0], o.size < 2) return !0;
+    }), e;
   }
   /** 边线外扩
    * @param lines 
-   * @param trajectory 
-   */
-  static boundaryExtension(e, t) {
-    const s = this.parent?.findComponentByName("Renderer"), i = V.excessLineSegments(e, t);
-    e = e.filter((o) => i.indexOf(o) === -1);
-    const r = new X(_.fromByLineSegment(...e));
-    e.forEach((o) => o.userData.isDoor || r.insert({ line: o, userData: void 0 }));
-    for (let o = 0; o < e.length; o++) {
-      if (e[o].userData.isDoor) continue;
-      const a = e[o], l = a.direction(), c = a.normal(), h = a.center, f = 20;
-      if ([
-        h.expandAsLine(c, f),
-        h.expandAsLine(c, -f),
-        a.start.expandAsLine(l, -f),
-        a.start.expandAsLine(c, f),
-        a.start.expandAsLine(c, -f),
-        a.end.expandAsLine(l, f),
-        a.end.expandAsLine(c, f),
-        a.end.expandAsLine(c, -f)
-      ].filter((y) => (y.directionMove(y.direction(), 1e-3), r.queryLineSegment(y, !1).filter((x) => x.line !== a).length === 0)).length) {
-        const y = s.createLineSegments([a], 0, { color: 16711680 });
-        y.position.z = 1e-3;
+   * @param trajectoryPoints 
+   */
+  static boundaryExtension(e, t, n = 0.1) {
+    const s = Object.keys(t).map((c) => g.from(t[c])), i = [];
+    let r = e.map(({ start: c, end: h, ...d }) => {
+      const u = new N(g.from(c), g.from(h));
+      return u.userData = d, i.push(c.z ?? 0, h.z ?? 0), u;
+    });
+    const o = i.reduce((c, h) => c + h, 0) / i.length, a = $.findExteriorWall(r, s), l = a.filter((c) => c.userData.expandDirect);
+    return r = r.filter((c) => !(a.includes(c) && !c.userData.expandDirect)), l.forEach((c) => {
+      const h = c.userData.expandDirect;
+      if (h === "left") {
+        const d = c.getLeftDirection();
+        c.directionMove(d, n * 0.5);
+      } else if (h === "right") {
+        const d = c.getRightDirection();
+        c.directionMove(d, n * 0.5);
       }
-    }
-    return e;
+    }), $.lineDataToOriginalData(r, o);
   }
+  boundaryExtension = $.boundaryExtension;
 }
-function ue(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(ue);
+function we(f) {
+  if (f === null || typeof f != "object") return f;
+  if (f instanceof Date) return new Date(f.getTime());
+  if (Array.isArray(f)) return f.map(we);
   const e = {};
-  for (const t in d)
-    Object.prototype.hasOwnProperty.call(d, t) && (e[t] = ue(d[t]));
+  for (const t in f)
+    Object.prototype.hasOwnProperty.call(f, t) && (e[t] = we(f[t]));
   return e;
 }
-const W = new B();
-class et extends V {
+const ee = new N();
+class ct extends $ {
   static name = "AngleCorrectionDxf";
   angle = 0;
   onAddFromParent(e) {
@@ -2222,27 +2301,27 @@ class et extends V {
     let s = 0, i = null;
     for (let l = 0; l < t.originalData.length; l++) {
       const c = t.originalData[l];
-      if (W.start.copy(c.start), W.end.copy(c.end), c.isVerticalReferenceLine) {
-        const [h, f] = c.start.y < c.end.y ? [W.start, W.end] : [W.end, W.start];
-        s = -new B(h, f).direction().angleBetween(new w(0, 1), "angle", "360"), i = null;
+      if (ee.start.copy(c.start), ee.end.copy(c.end), c.isVerticalReferenceLine) {
+        const [h, d] = c.start.y < c.end.y ? [ee.start, ee.end] : [ee.end, ee.start];
+        s = -new N(h, d).direction().angleBetween(new g(0, 1), "angle", "360"), i = null;
         break;
       }
-      (!i || W.length() > i.length()) && (i = W.clone(), i.userData.index = l);
+      (!i || ee.length() > i.length()) && (i = ee.clone(), i.userData.index = l);
     }
     if (i) {
       t.originalData[i.userData.index].isVerticalReferenceLine = !0;
       const [l, c] = i.start.y < i.end.y ? [i.start, i.end] : [i.end, i.start];
-      s = -new B(l, c).direction().angleBetween(new w(0, 1), "angle", "360");
+      s = -new N(l, c).direction().angleBetween(new g(0, 1), "angle", "360");
     }
-    const r = t.originalBox.center, o = w.zero(), a = t.originalData.map((l) => {
-      const c = o.copy(l.start).division(r).rotate(w.zero(), s * (Math.PI / 180)).toJson(l.start.z), h = o.copy(l.end).division(r).rotate(w.zero(), s * (Math.PI / 180)).toJson(l.end.z), f = Object.assign(ue(l), { start: c, end: h });
-      return f.drawWindow && f.drawWindow.forEach((u) => {
-        u.p = o.copy(u.p).division(r).rotate(w.zero(), s * (Math.PI / 180)).toJson(u.p.z);
-      }), f;
+    const r = t.originalBox.center, o = g.zero(), a = t.originalData.map((l) => {
+      const c = o.copy(l.start).division(r).rotate(g.zero(), s * (Math.PI / 180)).toJson(l.start.z), h = o.copy(l.end).division(r).rotate(g.zero(), s * (Math.PI / 180)).toJson(l.end.z), d = Object.assign(we(l), { start: c, end: h });
+      return d.drawWindow && d.drawWindow.forEach((u) => {
+        u.p = o.copy(u.p).division(r).rotate(g.zero(), s * (Math.PI / 180)).toJson(u.p.z);
+      }), d;
     });
     n.appendLineSegmentList.forEach((l) => {
       const c = l.clone();
-      c.start.division(r).rotate(w.zero(), s * (Math.PI / 180)), c.end.division(r).rotate(w.zero(), s * (Math.PI / 180)), a.push({
+      c.start.division(r).rotate(g.zero(), s * (Math.PI / 180)), c.end.division(r).rotate(g.zero(), s * (Math.PI / 180)), a.push({
         start: c.start.toJson(t.originalZAverage),
         end: c.end.toJson(t.originalZAverage),
         insetionArr: [],
@@ -2250,13 +2329,13 @@ class et extends V {
       });
     }), await this.set(a, t.width, t.scale), this.lineOffset(), this.doorLineSegment = t.doorLineSegment.map((l) => {
       const c = l.clone();
-      return c.start.division(r).rotate(w.zero(), s * (Math.PI / 180)), c.end.division(r).rotate(w.zero(), s * (Math.PI / 180)), c;
+      return c.start.division(r).rotate(g.zero(), s * (Math.PI / 180)), c.end.division(r).rotate(g.zero(), s * (Math.PI / 180)), c;
     }), this.angle = s, this.dispatchEvent({
       type: "updateData"
     });
   }
 }
-class Te extends J {
+class Ce extends ne {
   static name = "Variable";
   originalLineVisible = !0;
   dxfVisible = !0;
@@ -2283,13 +2362,13 @@ class Te extends J {
     if (e in this) return this[e];
   }
 }
-class tt {
+class lt {
   // 所有可查找的点位
   possibleDoorPoints = [];
   doorPoint = [];
   dxf;
   // 包含所有点的虚拟网格
-  pointVirtualGrid = new he();
+  pointVirtualGrid = new ge();
   // 只包含可查找点的虚拟网格
   findPointVirtualGrid;
   quadtree;
@@ -2302,7 +2381,7 @@ class tt {
   lineAnalysis;
   continueFind = !0;
   constructor(e) {
-    if (this.lineAnalysis = e, this.dxf = e.Dxf, this.findPointVirtualGrid = new he(), this.quadtree = e.quadtree, this.resultList = e.resultList, this.lineSegments = e.lineSegmentList, this.dxf.doorLineSegment.length = 0, this.lineSegments.forEach((n) => {
+    if (this.lineAnalysis = e, this.dxf = e.Dxf, this.findPointVirtualGrid = new ge(), this.quadtree = e.quadtree, this.resultList = e.resultList, this.lineSegments = e.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;
     const t = this.searchDoubleLinePoint();
@@ -2332,15 +2411,15 @@ class tt {
     );
     const a = [];
     return o.forEach((l) => {
-      const c = new B(l?.start, l?.end), h = c.length();
+      const c = new N(l?.start, l?.end), h = c.length();
       if (h < n) return;
-      const f = c.normal(), u = c.direction(), p = (h - r.width * 2) / 2;
+      const d = c.normal(), u = c.direction(), p = (h - r.width * 2) / 2;
       for (let y = 0; y < 3; y++) {
-        const x = c.start.clone().add(u.clone().multiplyScalar(r.width + p * y)), S = new B(
+        const x = c.start.clone().add(u.clone().multiplyScalar(r.width + p * y)), S = new N(
           x,
-          x.clone().add(f.clone().multiplyScalar(1))
+          x.clone().add(d.clone().multiplyScalar(1))
         );
-        if (S.directionMove(f, -0.5), this.quadtree.queryLineSegment(S).length) return;
+        if (S.directionMove(d, -0.5), this.quadtree.queryLineSegment(S).length) return;
       }
       a.push(c);
     }), a;
@@ -2360,7 +2439,7 @@ class tt {
     return this.lineSegments.forEach((t) => {
       t.points.forEach((n, s) => {
         for (let r = 0; r < this._pointsExcludeRule.length; r++) if (this._pointsExcludeRule[r](t, n, s)) return;
-        this.pointVirtualGrid.queryPoint(n).filter((r) => r.userData !== t).length === 0 && e.push({ line: t, point: n, uuid: le() });
+        this.pointVirtualGrid.queryPoint(n).filter((r) => r.userData !== t).length === 0 && e.push({ line: t, point: n, uuid: me() });
       });
     }), e;
   }
@@ -2372,21 +2451,21 @@ class tt {
     return t.doors.forEach((s) => {
       const i = t.lineSegments[s[4]], r = t.originalData[s[4]];
       if (r.drawDoorData) {
-        const o = w.from(r.drawDoorData.start), a = w.from(r.drawDoorData.n), l = n.queryPoint(o).filter((c) => {
+        const o = g.from(r.drawDoorData.start), a = g.from(r.drawDoorData.n), l = n.queryPoint(o).filter((c) => {
           if (c.userData === i) return !1;
-          const h = c.userData, f = h.direction();
-          h.start.equal(o) && f.multiplyScalar(-1);
-          const u = a.angleBetween(f, "angle");
+          const h = c.userData, d = h.direction();
+          h.start.equal(o) && d.multiplyScalar(-1);
+          const u = a.angleBetween(d, "angle");
           return u > 80 || u < 10;
         });
         l.length && e.push({
           line: l[0].userData,
           point: o,
-          uuid: le()
+          uuid: me()
         });
       } else if (r.doorDirectConnection) {
         this.continueFind = !1;
-        const o = new B(w.from(r.start), w.from(r.end));
+        const o = new N(g.from(r.start), g.from(r.end));
         o.userData = {
           doorDirectConnection: !0,
           isDoor: !0
@@ -2416,83 +2495,83 @@ class tt {
    */
   searchNearby(e, t = [], n = this.doorSearchDistance, s = this.doorSearchNearAngle) {
     const i = this.findPointVirtualGrid, r = this.quadtree;
-    function o({ point: x, line: S }, R, F) {
-      const A = S.direction();
-      S.start === x && A.multiplyScalar(-1);
-      const P = i.queryCircle(x, n).filter((L) => L.userData !== S).sort((L, g) => L.point.distance(x) - g.point.distance(x)), M = [];
-      for (let L = 0; L < P.length; L++) {
-        const g = t.findIndex((N) => N.point === P[L].point), b = e[R].uuid, m = t[g].uuid;
-        if (F.has(`${b}.${m}`)) continue;
-        F.add(`${b}.${m}`), F.add(`${m}.${b}`);
-        const E = P[L].point, T = new B(x.clone(), E.clone());
-        if (T.direction().angleBetween(A, "angle") < s) {
-          const N = e[g].line.direction();
-          P[L].userData.start.equal(P[L].point) && N.multiplyScalar(-1), T.direction().multiplyScalar(-1).angleBetween(N, "angle") < s && (r.queryLineSegment(T).length || M.push({
-            findData: P[L],
-            findUuid: m,
-            doorLine: T,
-            doorUuid: b
+    function o({ point: x, line: S }, T, G) {
+      const E = S.direction();
+      S.start === x && E.multiplyScalar(-1);
+      const R = i.queryCircle(x, n).filter((P) => P.userData !== S).sort((P, O) => P.point.distance(x) - O.point.distance(x)), U = [];
+      for (let P = 0; P < R.length; P++) {
+        const O = t.findIndex((D) => D.point === R[P].point), X = e[T].uuid, k = t[O].uuid;
+        if (G.has(`${X}.${k}`)) continue;
+        G.add(`${X}.${k}`), G.add(`${k}.${X}`);
+        const W = R[P].point, J = new N(x.clone(), W.clone());
+        if (J.direction().angleBetween(E, "angle") < s) {
+          const D = e[O].line.direction();
+          R[P].userData.start.equal(R[P].point) && D.multiplyScalar(-1), J.direction().multiplyScalar(-1).angleBetween(D, "angle") < s && (r.queryLineSegment(J).length || U.push({
+            findData: R[P],
+            findUuid: k,
+            doorLine: J,
+            doorUuid: X
           }));
         }
       }
-      return M;
+      return U;
     }
-    function a(x, S, R, F, A) {
-      F.add(x);
-      const P = [];
-      A && P.push(A);
-      for (let M = 0; M < R.length; M++) {
-        const L = R[M];
-        if (S.has(L.findUuid)) {
-          const g = S.get(L.findUuid);
-          a(L.findUuid, S, g, F, L) && P.push(L);
-        } else P.push(L);
+    function a(x, S, T, G, E) {
+      G.add(x);
+      const R = [];
+      E && R.push(E);
+      for (let U = 0; U < T.length; U++) {
+        const P = T[U];
+        if (S.has(P.findUuid)) {
+          const O = S.get(P.findUuid);
+          a(P.findUuid, S, O, G, P) && R.push(P);
+        } else R.push(P);
       }
-      return P.sort((M, L) => M.doorLine.length() - L.doorLine.length()), A && P[0] === A ? (R.splice(0), !0) : (R.splice(1), !1);
+      return R.sort((U, P) => U.doorLine.length() - P.doorLine.length()), E && R[0] === E ? (T.splice(0), !0) : (T.splice(1), !1);
     }
     const l = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Map();
     e.map((x, S) => {
-      const R = o(x, S, l);
-      R.length && c.set(x.uuid, R);
+      const T = o(x, S, l);
+      T.length && c.set(x.uuid, T);
     }), l.clear();
     const h = /* @__PURE__ */ new Map();
     c.forEach((x, S) => {
       if (!l.has(S) && x.length && a(S, c, x, l), x.length) {
-        const R = x[0];
-        h.has(R.doorUuid) || h.set(R.doorUuid, []), h.get(R.doorUuid)?.push(R), h.has(R.findUuid) || h.set(R.findUuid, []), h.get(R.findUuid)?.push(R);
+        const T = x[0];
+        h.has(T.doorUuid) || h.set(T.doorUuid, []), h.get(T.doorUuid)?.push(T), h.has(T.findUuid) || h.set(T.findUuid, []), h.get(T.findUuid)?.push(T);
       }
     });
-    const f = /* @__PURE__ */ new Set();
+    const d = /* @__PURE__ */ new Set();
     h.forEach((x) => {
       if (x.length > 1) {
-        x.sort((S, R) => S.doorLine.length() - R.doorLine.length());
-        for (let S = 1; S < x.length; S++) f.add(x[S]);
+        x.sort((S, T) => S.doorLine.length() - T.doorLine.length());
+        for (let S = 1; S < x.length; S++) d.add(x[S]);
       }
     });
     const u = [], p = [];
     c.forEach((x) => {
       if (x.length) {
         const S = x[0];
-        f.has(S) || (u.push(S), p.push(S.doorUuid, S.findUuid));
+        d.has(S) || (u.push(S), p.push(S.doorUuid, S.findUuid));
       }
     });
     const y = [];
     return u.forEach((x) => {
-      const S = e.findIndex((g) => g.uuid === x.doorUuid), R = t.findIndex((g) => g.uuid === x.findUuid), F = e[S].point.clone(), A = t[R].point.clone(), P = this.findLongLineSegment(e[S].line), M = this.findLongLineSegment(t[R].line), L = P.projectPoint(A);
-      if (L) {
-        F.copy(L);
-        const g = new B(F, A), b = M.includedAngle(g);
-        (b < 10 || b > 170 || Math.abs(90 - b) < 10) && y.push({
-          start: F,
-          end: A
+      const S = e.findIndex((O) => O.uuid === x.doorUuid), T = t.findIndex((O) => O.uuid === x.findUuid), G = e[S].point.clone(), E = t[T].point.clone(), R = this.findLongLineSegment(e[S].line), U = this.findLongLineSegment(t[T].line), P = R.projectPoint(E);
+      if (P) {
+        G.copy(P);
+        const O = new N(G, E), X = U.includedAngle(O);
+        (X < 10 || X > 170 || Math.abs(90 - X) < 10) && y.push({
+          start: G,
+          end: E
         });
       } else {
-        const g = M.projectPoint(F);
-        g && A.copy(g);
-        const b = new B(F, A), m = P.includedAngle(b);
-        (m < 10 || m > 170 || Math.abs(90 - m) < 10) && y.push({
-          start: F,
-          end: A
+        const O = U.projectPoint(G);
+        O && E.copy(O);
+        const X = new N(G, E), k = R.includedAngle(X);
+        (k < 10 || k > 170 || Math.abs(90 - k) < 10) && y.push({
+          start: G,
+          end: E
         });
       }
     }), t.splice(
@@ -2513,7 +2592,7 @@ class tt {
   searchAlongDirection({ point: e, line: t }, n = this.doorSearchDistance) {
     const s = this.quadtree, i = t.direction();
     t.start === e && i.multiplyScalar(-1);
-    const r = e.clone().add(i.clone().multiplyScalar(n)), o = new B(e.clone(), r), a = s.queryLineSegment(o).map((l) => ({
+    const r = e.clone().add(i.clone().multiplyScalar(n)), o = new N(e.clone(), r), a = s.queryLineSegment(o).map((l) => ({
       point: l.line.getIntersection(o),
       line: l.line
     })).filter((l) => l.point).sort((l, c) => e.distance(l.point) - e.distance(c.point));
@@ -2532,22 +2611,22 @@ class tt {
   searchAlongNormalDirection({ point: e, line: t }, n = this.doorSearchDistance) {
     const s = this.pointVirtualGrid, i = this.quadtree, r = t.direction(), o = t.start.normal(t.end), a = t.start.clone();
     t.start === e && r.multiplyScalar(-1), t.start === e && a.copy(t.end);
-    const l = s.queryPoint(a).filter((f) => f.userData !== t);
-    for (let f = 0; f < l.length; f++) {
-      const u = l[f], p = u.userData, y = p.direction();
+    const l = s.queryPoint(a).filter((d) => d.userData !== t);
+    for (let d = 0; d < l.length; d++) {
+      const u = l[d], p = u.userData, y = p.direction();
       if (p.start === u.point && r.multiplyScalar(-1), y.angleBetween(o) / (Math.PI / 180) > 90) {
         o.multiplyScalar(-1);
         break;
       }
     }
-    const c = new B(e.clone(), e.clone().add(o.multiplyScalar(n))), h = i.queryLineSegment(c).map((f) => ({
-      point: f.line.getIntersection(c),
-      line: f.line
-    })).filter((f) => f.point).sort((f, u) => e.distance(f.point) - e.distance(u.point));
+    const c = new N(e.clone(), e.clone().add(o.multiplyScalar(n))), h = i.queryLineSegment(c).map((d) => ({
+      point: d.line.getIntersection(c),
+      line: d.line
+    })).filter((d) => d.point).sort((d, u) => e.distance(d.point) - e.distance(u.point));
     if (h.length) {
-      const f = h[0];
-      if (Math.abs(90 - f.line.direction().angleBetween(o, "angle")) < 5)
-        return f;
+      const d = h[0];
+      if (Math.abs(90 - d.line.direction().angleBetween(o, "angle")) < 5)
+        return d;
     }
   }
   /**
@@ -2574,12 +2653,12 @@ class tt {
     return t;
   }
 }
-class nt extends J {
+class ht extends ne {
   static name = "LineAnalysis";
   Dxf = null;
   Variable = null;
   lineSegmentList = [];
-  container = new U.Group();
+  container = new z.Group();
   // 误差角度
   errorAngle = 4;
   width = 0.4;
@@ -2588,7 +2667,7 @@ class nt extends J {
    * @param parent 
    */
   onAddFromParent(e) {
-    this.Dxf = e.findComponentByType(V), this.Variable = this.parent?.findComponentByType(Te), this.Dxf.addEventListener("setDta", this.lineAnalysis.bind(this)), this.Dxf.addEventListener("createGroup", this.doorsAnalysis.bind(this));
+    this.Dxf = e.findComponentByType($), this.Variable = this.parent?.findComponentByType(Ce), this.Dxf.addEventListener("setDta", this.lineAnalysis.bind(this)), this.Dxf.addEventListener("createGroup", this.doorsAnalysis.bind(this));
   }
   /**
    * 
@@ -2602,11 +2681,11 @@ class nt extends J {
     return {
       points: [
         // 第一条线
-        new w(e.x + o, e.y + a).add(r),
-        new w(t.x + o, t.y + a).add(i),
+        new g(e.x + o, e.y + a).add(r),
+        new g(t.x + o, t.y + a).add(i),
         // 第二条线
-        new w(e.x - o, e.y - a).add(r),
-        new w(t.x - o, t.y - a).add(i)
+        new g(e.x - o, e.y - a).add(r),
+        new g(t.x - o, t.y - a).add(i)
       ],
       indices: [0, 1, 1, 3, 3, 2, 2, 0],
       rectIndices: [0, 1, 3, 2, 0]
@@ -2620,7 +2699,7 @@ class nt extends J {
    */
   addData(e, t) {
     const n = this.Dxf;
-    n.data.push([e.clone(), t.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new B(e.clone(), t.clone()));
+    n.data.push([e.clone(), t.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new N(e.clone(), t.clone()));
   }
   /** 结果分析创建矩形
    * @param result 
@@ -2628,14 +2707,14 @@ class nt extends J {
   createRectangle(e) {
     const t = this.Dxf, n = e.project, s = e.project2;
     n.includedAngle(s) > 135 && (s.points = [s.points[1], s.points[0]]), this.addData(n.points[0], s.points[0]), this.addData(n.points[1], s.points[1]);
-    const i = n.points[0].distance(s.points[0]), r = n.points[1].distance(s.points[1]), o = Math.ceil(Math.max(i, r) / t.width), a = i / o, l = r / o, c = s.points[0].direction(n.points[0]), h = s.points[1].direction(n.points[1]), f = n.points[0].clone(), u = n.points[1].clone(), p = u.direction(f);
+    const i = n.points[0].distance(s.points[0]), r = n.points[1].distance(s.points[1]), o = Math.ceil(Math.max(i, r) / t.width), a = i / o, l = r / o, c = s.points[0].direction(n.points[0]), h = s.points[1].direction(n.points[1]), d = n.points[0].clone(), u = n.points[1].clone(), p = u.direction(d);
     p.multiplyScalar(t.width * 0.5);
-    const y = f.clone().add(p), x = u.clone().add(p.multiplyScalar(-1)), S = f.direction(u), R = y.direction(x);
-    if (!(S.x > 0 && R.x < 0 || S.x < 0 && R.x > 0 || S.y > 0 && R.y < 0 || S.y < 0 && R.y > 0)) {
-      f.set(y.x, y.y), u.set(x.x, x.y);
-      for (let F = 1; F < o; F++) {
-        const A = c.clone().multiplyScalar(a * F), P = h.clone().multiplyScalar(l * F), M = f.clone().add(A), L = u.clone().add(P);
-        this.addData(M, L);
+    const y = d.clone().add(p), x = u.clone().add(p.multiplyScalar(-1)), S = d.direction(u), T = y.direction(x);
+    if (!(S.x > 0 && T.x < 0 || S.x < 0 && T.x > 0 || S.y > 0 && T.y < 0 || S.y < 0 && T.y > 0)) {
+      d.set(y.x, y.y), u.set(x.x, x.y);
+      for (let G = 1; G < o; G++) {
+        const E = c.clone().multiplyScalar(a * G), R = h.clone().multiplyScalar(l * G), U = d.clone().add(E), P = u.clone().add(R);
+        this.addData(U, P);
       }
     }
   }
@@ -2645,7 +2724,7 @@ class nt extends J {
    */
   buildQuadtree() {
     const e = this.Dxf, t = [];
-    this.quadtree = new X(e.originalBox, 2), e.lineSegments.forEach((n) => {
+    this.quadtree = new Z(e.originalBox, 2), e.lineSegments.forEach((n) => {
       n.userData?.isDoor || (this.quadtree?.insert({
         line: n,
         userData: t.length
@@ -2662,7 +2741,7 @@ class nt extends J {
     this.buildQuadtree();
     const e = this.quadtree, t = this.lineSegmentList, n = /* @__PURE__ */ new Set(), s = [];
     t.forEach((i, r) => {
-      const o = t[r], a = se.fromByLineSegment(o, this.width * 2, !1, -0.01);
+      const o = t[r], a = ue.fromByLineSegment(o, this.width * 2, !1, -0.01);
       e.queryRect(a).map((c) => c.userData).filter((c) => c !== r).forEach((c) => {
         try {
           if (n.has(`${r}-${c}`) || n.has(`${c}-${r}`)) return;
@@ -2706,12 +2785,12 @@ class nt extends J {
   doors = [];
   DoorsAnalysis;
   doorsAnalysis() {
-    this.DoorsAnalysis = new tt(this), this.dispatchEvent({
+    this.DoorsAnalysis = new lt(this), this.dispatchEvent({
       type: "analysisCompleted"
     });
   }
 }
-class st extends J {
+class ut extends ne {
   static name = "ThreeVJia";
   lineSegments = [];
   onAddFromParent() {
@@ -2723,28 +2802,28 @@ class st extends J {
     const n = this.parent?.findComponentByName("AngleCorrectionDxf"), s = /* @__PURE__ */ new Map();
     let i = [...t.lineSegments], r = [], o = [];
     e.resultList.forEach((c) => {
-      const h = s.get(c.target) ?? [], f = s.get(c.source) ?? [], u = c.project.clone(), p = c.project2.clone();
-      u.includedAngle(p) > 135 && (p.points = [p.points[1], p.points[0]]), h.push(...u.points), f.push(...p.points), s.set(c.target, h), s.set(c.source, f);
-      const y = new B(u.start, p.start), x = new B(u.end, p.end), S = new B(y.center, x.center);
+      const h = s.get(c.target) ?? [], d = s.get(c.source) ?? [], u = c.project.clone(), p = c.project2.clone();
+      u.includedAngle(p) > 135 && (p.points = [p.points[1], p.points[0]]), h.push(...u.points), d.push(...p.points), s.set(c.target, h), s.set(c.source, d);
+      const y = new N(u.start, p.start), x = new N(u.end, p.end), S = new N(y.center, x.center);
       S.userData.wallWidth = Math.max(y.length(), x.length()), r.push(S);
     });
     const a = [];
     i = i.filter((c) => {
       if (o.indexOf(c) > -1) return !1;
       if (s.has(c)) {
-        const h = s.get(c), f = c.clone();
+        const h = s.get(c), d = c.clone();
         if (h) {
           for (let p = 0; p < h.length; p += 2) {
             const y = h[p], x = h[p + 1];
-            y.userData.length = y.distance(f.start), x.userData.length = x.distance(f.start), y.userData.type = "start", x.userData.type = "end", f.start.distance(y) > f.start.distance(x) && (h[p] = x, h[p + 1] = y, y.userData.type = "end", x.userData.type = "start");
+            y.userData.length = y.distance(d.start), x.userData.length = x.distance(d.start), y.userData.type = "start", x.userData.type = "end", d.start.distance(y) > d.start.distance(x) && (h[p] = x, h[p + 1] = y, y.userData.type = "end", x.userData.type = "start");
           }
           h.sort((p, y) => p.userData.length - y.userData.length);
           const u = [];
           for (let p = 0; p < h.length; p++) {
             const y = h[p];
-            y.userData.type === "start" ? (u.length === 0 && (a.push(new B(f.start.clone(), y.clone())), f.start.copy(y)), u.push("start")) : (u.pop(), u.length === 0 && f.start.copy(y));
+            y.userData.type === "start" ? (u.length === 0 && (a.push(new N(d.start.clone(), y.clone())), d.start.copy(y)), u.push("start")) : (u.pop(), u.length === 0 && d.start.copy(y));
           }
-          a.push(f);
+          a.push(d);
         }
         return !1;
       }
@@ -2800,7 +2879,7 @@ class st extends J {
           };
         if (s.userData.isWindow)
           return s.userData.drawWindow.map((i) => {
-            const r = w.from(i.p), o = r.clone().add(
+            const r = g.from(i.p), o = r.clone().add(
               s.direction().multiplyScalar(i.width * 0.5)
             ), a = r.clone().add(
               s.direction().multiplyScalar(-i.width * 0.5)
@@ -2833,10 +2912,10 @@ class st extends J {
     if (typeof window < "u") {
       const t = new Blob([JSON.stringify(this.toJson())]), n = document.createElement("a");
       n.href = URL.createObjectURL(t), n.download = e, n.click();
-    } else typeof global < "u" && (await K("fs", !1)).writeFileSync(e, JSON.stringify(this.toJson()));
+    } else typeof global < "u" && (await se("fs", !1)).writeFileSync(e, JSON.stringify(this.toJson()));
   }
 }
-class it extends Ze {
+class dt extends ot {
   Dxf;
   AngleCorrectionDxf;
   Variable;
@@ -2847,7 +2926,7 @@ class it extends Ze {
    * @param scale 原始数据缩放比例
    */
   constructor(e = 0.1, t = 1) {
-    super(), this.environment = typeof window < "u" ? "browser" : typeof global < "u" ? "node" : "unknown", this.wallWidth = e, this.Dxf = new V(this.wallWidth, t), this.AngleCorrectionDxf = new et(), this.Variable = new Te(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(new nt()), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new st());
+    super(), this.environment = typeof window < "u" ? "browser" : typeof global < "u" ? "node" : "unknown", this.wallWidth = e, this.Dxf = new $(this.wallWidth, t), this.AngleCorrectionDxf = new ct(), this.Variable = new Ce(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(new ht()), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new ut());
   }
   usePlugin(e) {
     return typeof e == "function" && e.call(this, this), this;
@@ -2860,7 +2939,7 @@ class it extends Ze {
     });
   }
 }
-const me = {
+const Ae = {
   POSITION: [
     "byte",
     "byte normalized",
@@ -2888,36 +2967,36 @@ const me = {
     "unsigned short"
   ]
 };
-class ne {
+class he {
   constructor() {
     this.textureUtils = null, this.pluginCallbacks = [], this.register(function(e) {
-      return new xt(e);
+      return new Et(e);
+    }), this.register(function(e) {
+      return new Dt(e);
     }), this.register(function(e) {
-      return new yt(e);
+      return new It(e);
     }), this.register(function(e) {
-      return new Mt(e);
+      return new Rt(e);
     }), this.register(function(e) {
-      return new Lt(e);
+      return new Pt(e);
     }), this.register(function(e) {
-      return new St(e);
+      return new vt(e);
     }), this.register(function(e) {
       return new At(e);
     }), this.register(function(e) {
-      return new mt(e);
-    }), this.register(function(e) {
-      return new gt(e);
+      return new Tt(e);
     }), this.register(function(e) {
-      return new wt(e);
+      return new bt(e);
     }), this.register(function(e) {
-      return new Et(e);
+      return new Nt(e);
     }), this.register(function(e) {
-      return new Tt(e);
+      return new Ct(e);
     }), this.register(function(e) {
-      return new Dt(e);
+      return new Bt(e);
     }), this.register(function(e) {
-      return new bt(e);
+      return new Ot(e);
     }), this.register(function(e) {
-      return new It(e);
+      return new Ft(e);
     });
   }
   register(e) {
@@ -2930,7 +3009,7 @@ class ne {
     return this.textureUtils = e, this;
   }
   parse(e, t, n, s) {
-    const i = new pt(), r = [];
+    const i = new Lt(), r = [];
     for (let o = 0, a = this.pluginCallbacks.length; o < a; o++)
       r.push(this.pluginCallbacks[o](i));
     i.setPlugins(r), i.setTextureUtils(this.textureUtils), i.writeAsync(e, t, s).catch(n);
@@ -2966,78 +3045,78 @@ const C = {
   CLAMP_TO_EDGE: 33071,
   MIRRORED_REPEAT: 33648,
   REPEAT: 10497
-}, re = "KHR_mesh_quantization", Y = {};
-Y[qe] = C.NEAREST;
-Y[je] = C.NEAREST_MIPMAP_NEAREST;
-Y[Ye] = C.NEAREST_MIPMAP_LINEAR;
-Y[Xe] = C.LINEAR;
-Y[ke] = C.LINEAR_MIPMAP_NEAREST;
-Y[Ve] = C.LINEAR_MIPMAP_LINEAR;
-Y[We] = C.CLAMP_TO_EDGE;
-Y[He] = C.REPEAT;
-Y[Je] = C.MIRRORED_REPEAT;
-const ge = {
+}, fe = "KHR_mesh_quantization", H = {};
+H[Je] = C.NEAREST;
+H[Ke] = C.NEAREST_MIPMAP_NEAREST;
+H[$e] = C.NEAREST_MIPMAP_LINEAR;
+H[Ze] = C.LINEAR;
+H[Qe] = C.LINEAR_MIPMAP_NEAREST;
+H[et] = C.LINEAR_MIPMAP_LINEAR;
+H[tt] = C.CLAMP_TO_EDGE;
+H[nt] = C.REPEAT;
+H[st] = C.MIRRORED_REPEAT;
+const Te = {
   scale: "scale",
   position: "translation",
   quaternion: "rotation",
   morphTargetInfluences: "weights"
-}, rt = new ve(), we = 12, ot = 1179937895, at = 2, Me = 8, ct = 1313821514, lt = 5130562;
-function Z(d, e) {
-  return d.length === e.length && d.every(function(t, n) {
+}, ft = new ze(), be = 12, pt = 1179937895, xt = 2, Ie = 8, yt = 1313821514, mt = 5130562;
+function oe(f, e) {
+  return f.length === e.length && f.every(function(t, n) {
     return t === e[n];
   });
 }
-function ht(d) {
-  return new TextEncoder().encode(d).buffer;
+function gt(f) {
+  return new TextEncoder().encode(f).buffer;
 }
-function ut(d) {
-  return Z(d.elements, [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]);
+function wt(f) {
+  return oe(f.elements, [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]);
 }
-function dt(d, e, t) {
+function Mt(f, e, t) {
   const n = {
-    min: new Array(d.itemSize).fill(Number.POSITIVE_INFINITY),
-    max: new Array(d.itemSize).fill(Number.NEGATIVE_INFINITY)
+    min: new Array(f.itemSize).fill(Number.POSITIVE_INFINITY),
+    max: new Array(f.itemSize).fill(Number.NEGATIVE_INFINITY)
   };
   for (let s = e; s < e + t; s++)
-    for (let i = 0; i < d.itemSize; i++) {
+    for (let i = 0; i < f.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 = ce.normalize(r, d.array))), n.min[i] = Math.min(n.min[i], r), n.max[i] = Math.max(n.max[i], r);
+      f.itemSize > 4 ? r = f.array[s * f.itemSize + i] : (i === 0 ? r = f.getX(s) : i === 1 ? r = f.getY(s) : i === 2 ? r = f.getZ(s) : i === 3 && (r = f.getW(s)), f.normalized === !0 && (r = ye.normalize(r, f.array))), n.min[i] = Math.min(n.min[i], r), n.max[i] = Math.max(n.max[i], r);
     }
   return n;
 }
-function De(d) {
-  return Math.ceil(d / 4) * 4;
+function Be(f) {
+  return Math.ceil(f / 4) * 4;
 }
-function oe(d, e = 0) {
-  const t = De(d.byteLength);
-  if (t !== d.byteLength) {
+function pe(f, e = 0) {
+  const t = Be(f.byteLength);
+  if (t !== f.byteLength) {
     const n = new Uint8Array(t);
-    if (n.set(new Uint8Array(d)), e !== 0)
-      for (let s = d.byteLength; s < t; s++)
+    if (n.set(new Uint8Array(f)), e !== 0)
+      for (let s = f.byteLength; s < t; s++)
         n[s] = e;
     return n.buffer;
   }
-  return d;
+  return f;
 }
-function Le() {
+function Re() {
   return typeof document > "u" && typeof OffscreenCanvas < "u" ? new OffscreenCanvas(1, 1) : document.createElement("canvas");
 }
-function ft(d, e) {
-  if (typeof OffscreenCanvas < "u" && d instanceof OffscreenCanvas) {
+function St(f, e) {
+  if (typeof OffscreenCanvas < "u" && f instanceof OffscreenCanvas) {
     let t;
-    return e === "image/jpeg" ? t = 0.92 : e === "image/webp" && (t = 0.8), d.convertToBlob({
+    return e === "image/jpeg" ? t = 0.92 : e === "image/webp" && (t = 0.8), f.convertToBlob({
       type: e,
       quality: t
     });
   } else
-    return new Promise((t) => d.toBlob(t, e));
+    return new Promise((t) => f.toBlob(t, e));
 }
-class pt {
+class Lt {
   constructor() {
     this.plugins = [], this.options = {}, this.pending = [], this.buffers = [], this.byteOffset = 0, this.buffers = [], this.nodeMap = /* @__PURE__ */ new Map(), this.skins = [], this.extensionsUsed = {}, this.extensionsRequired = {}, this.uids = /* @__PURE__ */ new Map(), this.uid = 0, this.json = {
       asset: {
         version: "2.0",
-        generator: "THREE.GLTFExporter r" + Ce
+        generator: "THREE.GLTFExporter r" + qe
       }
     }, this.cache = {
       meshes: /* @__PURE__ */ new Map(),
@@ -3074,27 +3153,27 @@ class pt {
     const s = this, i = s.buffers, r = s.json;
     n = s.options;
     const o = s.extensionsUsed, a = s.extensionsRequired, l = new Blob(i, { type: "application/octet-stream" }), c = Object.keys(o), h = Object.keys(a);
-    c.length > 0 && (r.extensionsUsed = c), h.length > 0 && (r.extensionsRequired = h), r.buffers && r.buffers.length > 0 && (r.buffers[0].byteLength = l.size), n.binary === !0 ? ae(l).then(function(f) {
-      const u = oe(f), p = new DataView(new ArrayBuffer(Me));
-      p.setUint32(0, u.byteLength, !0), p.setUint32(4, lt, !0);
-      const y = oe(ht(JSON.stringify(r)), 32), x = new DataView(new ArrayBuffer(Me));
-      x.setUint32(0, y.byteLength, !0), x.setUint32(4, ct, !0);
-      const S = new ArrayBuffer(we), R = new DataView(S);
-      R.setUint32(0, ot, !0), R.setUint32(4, at, !0);
-      const F = we + x.byteLength + y.byteLength + p.byteLength + u.byteLength;
-      R.setUint32(8, F, !0);
-      const A = new Blob([
+    c.length > 0 && (r.extensionsUsed = c), h.length > 0 && (r.extensionsRequired = h), r.buffers && r.buffers.length > 0 && (r.buffers[0].byteLength = l.size), n.binary === !0 ? xe(l).then(function(d) {
+      const u = pe(d), p = new DataView(new ArrayBuffer(Ie));
+      p.setUint32(0, u.byteLength, !0), p.setUint32(4, mt, !0);
+      const y = pe(gt(JSON.stringify(r)), 32), x = new DataView(new ArrayBuffer(Ie));
+      x.setUint32(0, y.byteLength, !0), x.setUint32(4, yt, !0);
+      const S = new ArrayBuffer(be), T = new DataView(S);
+      T.setUint32(0, pt, !0), T.setUint32(4, xt, !0);
+      const G = be + x.byteLength + y.byteLength + p.byteLength + u.byteLength;
+      T.setUint32(8, G, !0);
+      const E = new Blob([
         S,
         x,
         y,
         p,
         u
       ], { type: "application/octet-stream" });
-      ae(A).then((P) => {
-        t(P);
+      xe(E).then((R) => {
+        t(R);
       });
-    }) : r.buffers && r.buffers.length > 0 ? Rt(l).then((f) => {
-      r.buffers[0].uri = f, t(r);
+    }) : r.buffers && r.buffers.length > 0 ? Ut(l).then((d) => {
+      r.buffers[0].uri = d, t(r);
     }) : t(r);
   }
   /**
@@ -3141,7 +3220,7 @@ class pt {
    */
   isNormalizedNormalAttribute(e) {
     if (this.cache.attributesNormalized.has(e)) return !1;
-    const n = new ee();
+    const n = new ce();
     for (let s = 0, i = e.count; s < i; s++)
       if (Math.abs(n.fromBufferAttribute(e, s).length() - 1) > 5e-4) return !1;
     return !0;
@@ -3156,7 +3235,7 @@ class pt {
   createNormalizedNormalAttribute(e) {
     const t = this.cache;
     if (t.attributesNormalized.has(e)) return t.attributesNormalized.get(e);
-    const n = e.clone(), s = new ee();
+    const n = e.clone(), s = new ce();
     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 t.attributesNormalized.set(e, n), n;
@@ -3176,14 +3255,14 @@ class pt {
   async buildMetalRoughTextureAsync(e, t) {
     if (e === t) return e;
     function n(u) {
-      return u.colorSpace === ze ? function(y) {
+      return u.colorSpace === He ? function(y) {
         return y < 0.04045 ? y * 0.0773993808 : Math.pow(y * 0.9478672986 + 0.0521327014, 2.4);
       } : function(y) {
         return y;
       };
     }
-    e instanceof ie && (e = await this.decompressTextureAsync(e)), t instanceof ie && (t = await this.decompressTextureAsync(t));
-    const s = e ? e.image : null, i = t ? t.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 = Le();
+    e instanceof de && (e = await this.decompressTextureAsync(e)), t instanceof de && (t = await this.decompressTextureAsync(t));
+    const s = e ? e.image : null, i = t ? t.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 = Re();
     a.width = r, a.height = o;
     const l = a.getContext("2d", {
       willReadFrequently: !0
@@ -3203,8 +3282,8 @@ class pt {
         c.data[y] = u(p[y] / 256) * 256;
     }
     l.putImageData(c, 0, 0);
-    const f = (e || t).clone();
-    return f.source = new Be(a), f.colorSpace = Oe, f.channel = (e || t).channel, e && t && e.channel !== t.channel && console.warn("THREE.GLTFExporter: UV channels for metalnessMap and roughnessMap textures must match."), console.warn("THREE.GLTFExporter: Merged metalnessMap and roughnessMap textures."), f;
+    const d = (e || t).clone();
+    return d.source = new je(a), d.colorSpace = Ye, d.channel = (e || t).channel, e && t && e.channel !== t.channel && console.warn("THREE.GLTFExporter: UV channels for metalnessMap and roughnessMap textures must match."), console.warn("THREE.GLTFExporter: Merged metalnessMap and roughnessMap textures."), d;
   }
   async decompressTextureAsync(e, t = 1 / 0) {
     if (this.textureUtils === null)
@@ -3247,21 +3326,21 @@ class pt {
     }
     let a = e.itemSize * o;
     i === C.ARRAY_BUFFER && (a = Math.ceil(a / 4) * 4);
-    const l = De(s * a), c = new DataView(new ArrayBuffer(l));
+    const l = Be(s * a), c = new DataView(new ArrayBuffer(l));
     let h = 0;
     for (let p = n; p < n + s; p++) {
       for (let y = 0; y < e.itemSize; y++) {
         let x;
-        e.itemSize > 4 ? x = e.array[p * e.itemSize + y] : (y === 0 ? x = e.getX(p) : y === 1 ? x = e.getY(p) : y === 2 ? x = e.getZ(p) : y === 3 && (x = e.getW(p)), e.normalized === !0 && (x = ce.normalize(x, e.array))), t === C.FLOAT ? c.setFloat32(h, x, !0) : t === C.INT ? c.setInt32(h, x, !0) : t === C.UNSIGNED_INT ? c.setUint32(h, x, !0) : t === C.SHORT ? c.setInt16(h, x, !0) : t === C.UNSIGNED_SHORT ? c.setUint16(h, x, !0) : t === C.BYTE ? c.setInt8(h, x) : t === C.UNSIGNED_BYTE && c.setUint8(h, x), h += o;
+        e.itemSize > 4 ? x = e.array[p * e.itemSize + y] : (y === 0 ? x = e.getX(p) : y === 1 ? x = e.getY(p) : y === 2 ? x = e.getZ(p) : y === 3 && (x = e.getW(p)), e.normalized === !0 && (x = ye.normalize(x, e.array))), t === C.FLOAT ? c.setFloat32(h, x, !0) : t === C.INT ? c.setInt32(h, x, !0) : t === C.UNSIGNED_INT ? c.setUint32(h, x, !0) : t === C.SHORT ? c.setInt16(h, x, !0) : t === C.UNSIGNED_SHORT ? c.setUint16(h, x, !0) : t === C.BYTE ? c.setInt8(h, x) : t === C.UNSIGNED_BYTE && c.setUint8(h, x), h += o;
       }
       h % a !== 0 && (h += a - h % a);
     }
-    const f = {
+    const d = {
       buffer: this.processBuffer(c.buffer),
       byteOffset: this.byteOffset,
       byteLength: l
     };
-    return i !== void 0 && (f.target = i), i === C.ARRAY_BUFFER && (f.byteStride = a), this.byteOffset += l, r.bufferViews.push(f), {
+    return i !== void 0 && (d.target = i), i === C.ARRAY_BUFFER && (d.byteStride = a), this.byteOffset += l, r.bufferViews.push(d), {
       id: r.bufferViews.length - 1,
       byteLength: 0
     };
@@ -3274,8 +3353,8 @@ class pt {
   processBufferViewImage(e) {
     const t = this, n = t.json;
     return n.bufferViews || (n.bufferViews = []), new Promise(async function(s) {
-      ae(e).then((i) => {
-        const r = oe(i), o = {
+      xe(e).then((i) => {
+        const r = pe(i), o = {
           buffer: t.processBuffer(r),
           byteOffset: t.byteOffset,
           byteLength: r.byteLength
@@ -3319,7 +3398,7 @@ class pt {
     else
       throw new Error("THREE.GLTFExporter: Unsupported bufferAttribute component type: " + e.array.constructor.name);
     if (n === void 0 && (n = 0), (s === void 0 || s === 1 / 0) && (s = e.count), s === 0) return null;
-    const a = dt(e, n, s);
+    const a = Mt(e, n, s);
     let l;
     t !== void 0 && (l = e === t.index ? C.ELEMENT_ARRAY_BUFFER : C.ARRAY_BUFFER);
     const c = this.processBufferView(e, o, n, s, l), h = {
@@ -3348,13 +3427,13 @@ class pt {
       const c = r.images.get(e), h = s + ":flipY/" + n.toString();
       if (c[h] !== void 0) return c[h];
       o.images || (o.images = []);
-      const f = { mimeType: s }, u = Le();
+      const d = { mimeType: s }, u = Re();
       u.width = Math.min(e.width, a.maxTextureSize), u.height = Math.min(e.height, a.maxTextureSize);
       const p = u.getContext("2d", {
         willReadFrequently: !0
       });
       if (n === !0 && (p.translate(0, u.height), p.scale(1, -1)), e.data !== void 0) {
-        t !== Fe && console.error("GLTFExporter: Only RGBAFormat is supported.", t), (e.width > a.maxTextureSize || e.height > a.maxTextureSize) && console.warn("GLTFExporter: Image size is bigger than maxTextureSize", e);
+        t !== ke && console.error("GLTFExporter: Only RGBAFormat is supported.", t), (e.width > a.maxTextureSize || e.height > a.maxTextureSize) && console.warn("GLTFExporter: Image size is bigger than maxTextureSize", e);
         const x = new Uint8ClampedArray(e.height * e.width * 4);
         for (let S = 0; S < x.length; S += 4)
           x[S + 0] = e.data[S + 0], x[S + 1] = e.data[S + 1], x[S + 2] = e.data[S + 2], x[S + 3] = e.data[S + 3];
@@ -3364,11 +3443,11 @@ class pt {
       else
         throw new Error("THREE.GLTFExporter: Invalid image type. Use HTMLImageElement, HTMLCanvasElement, ImageBitmap or OffscreenCanvas.");
       a.binary === !0 ? l.push(
-        ft(u, s).then((x) => i.processBufferViewImage(x)).then((x) => {
-          f.bufferView = x;
+        St(u, s).then((x) => i.processBufferViewImage(x)).then((x) => {
+          d.bufferView = x;
         })
-      ) : f.uri = Ue.getDataURL(u, s);
-      const y = o.images.push(f) - 1;
+      ) : d.uri = Xe.getDataURL(u, s);
+      const y = o.images.push(d) - 1;
       return c[h] = y, y;
     } else
       throw new Error("THREE.GLTFExporter: No valid image data found. Unable to process texture.");
@@ -3382,10 +3461,10 @@ class pt {
     const t = this.json;
     t.samplers || (t.samplers = []);
     const n = {
-      magFilter: Y[e.magFilter],
-      minFilter: Y[e.minFilter],
-      wrapS: Y[e.wrapS],
-      wrapT: Y[e.wrapT]
+      magFilter: H[e.magFilter],
+      minFilter: H[e.minFilter],
+      wrapS: H[e.wrapS],
+      wrapT: H[e.wrapT]
     };
     return t.samplers.push(n) - 1;
   }
@@ -3397,7 +3476,7 @@ class pt {
   async processTextureAsync(e) {
     const n = this.options, s = this.cache, i = this.json;
     if (s.textures.has(e)) return s.textures.get(e);
-    i.textures || (i.textures = []), e instanceof ie && (e = await this.decompressTextureAsync(e, n.maxTextureSize));
+    i.textures || (i.textures = []), e instanceof de && (e = await this.decompressTextureAsync(e, n.maxTextureSize));
     let r = e.userData.mimeType;
     r === "image/webp" && (r = "image/png");
     const o = {
@@ -3424,7 +3503,7 @@ class pt {
     const s = { pbrMetallicRoughness: {} };
     e.isMeshStandardMaterial !== !0 && e.isMeshBasicMaterial !== !0 && console.warn("GLTFExporter: Use MeshStandardMaterial or MeshBasicMaterial for best results.");
     const i = e.color.toArray().concat([e.opacity]);
-    if (Z(i, [1, 1, 1, 1]) || (s.pbrMetallicRoughness.baseColorFactor = i), e.isMeshStandardMaterial ? (s.pbrMetallicRoughness.metallicFactor = e.metalness, s.pbrMetallicRoughness.roughnessFactor = e.roughness) : (s.pbrMetallicRoughness.metallicFactor = 0, s.pbrMetallicRoughness.roughnessFactor = 1), e.metalnessMap || e.roughnessMap) {
+    if (oe(i, [1, 1, 1, 1]) || (s.pbrMetallicRoughness.baseColorFactor = i), e.isMeshStandardMaterial ? (s.pbrMetallicRoughness.metallicFactor = e.metalness, s.pbrMetallicRoughness.roughnessFactor = e.roughness) : (s.pbrMetallicRoughness.metallicFactor = 0, s.pbrMetallicRoughness.roughnessFactor = 1), e.metalnessMap || e.roughnessMap) {
       const o = await this.buildMetalRoughTextureAsync(e.metalnessMap, e.roughnessMap), a = {
         index: await this.processTextureAsync(o),
         texCoord: o.channel
@@ -3462,7 +3541,7 @@ class pt {
       };
       e.aoMapIntensity !== 1 && (o.strength = e.aoMapIntensity), this.applyTextureTransform(o, e.aoMap), s.occlusionTexture = o;
     }
-    e.transparent ? s.alphaMode = "BLEND" : e.alphaTest > 0 && (s.alphaMode = "MASK", s.alphaCutoff = e.alphaTest), e.side === Ge && (s.doubleSided = !0), e.name !== "" && (s.name = e.name), this.serializeUserData(e, s), await this._invokeAllAsync(async function(o) {
+    e.transparent ? s.alphaMode = "BLEND" : e.alphaTest > 0 && (s.alphaMode = "MASK", s.alphaCutoff = e.alphaTest), e.side === Ve && (s.doubleSided = !0), e.name !== "" && (s.name = e.name), this.serializeUserData(e, s), await this._invokeAllAsync(async function(o) {
       o.writeMaterialAsync && await o.writeMaterialAsync(e, s);
     });
     const r = n.materials.push(s) - 1;
@@ -3476,8 +3555,8 @@ class pt {
   async processMeshAsync(e) {
     const t = this.cache, n = this.json, s = [e.geometry.uuid];
     if (Array.isArray(e.material))
-      for (let A = 0, P = e.material.length; A < P; A++)
-        s.push(e.material[A].uuid);
+      for (let E = 0, R = e.material.length; E < R; E++)
+        s.push(e.material[E].uuid);
     else
       s.push(e.material.uuid);
     const i = s.join(":");
@@ -3485,7 +3564,7 @@ class pt {
     const r = e.geometry;
     let o;
     e.isLineSegments ? o = C.LINES : e.isLineLoop ? o = C.LINE_LOOP : e.isLine ? o = C.LINE_STRIP : e.isPoints ? o = C.POINTS : o = e.material.wireframe ? C.LINES : C.TRIANGLES;
-    const a = {}, l = {}, c = [], h = [], f = {
+    const a = {}, l = {}, c = [], h = [], d = {
       uv: "TEXCOORD_0",
       uv1: "TEXCOORD_1",
       uv2: "TEXCOORD_2",
@@ -3496,76 +3575,76 @@ class pt {
     }, u = r.getAttribute("normal");
     u !== void 0 && !this.isNormalizedNormalAttribute(u) && (console.warn("THREE.GLTFExporter: Creating normalized normal attribute from the non-normalized one."), r.setAttribute("normal", this.createNormalizedNormalAttribute(u)));
     let p = null;
-    for (let A in r.attributes) {
-      if (A.slice(0, 5) === "morph") continue;
-      const P = r.attributes[A];
-      if (A = f[A] || A.toUpperCase(), /^(POSITION|NORMAL|TANGENT|TEXCOORD_\d+|COLOR_\d+|JOINTS_\d+|WEIGHTS_\d+)$/.test(A) || (A = "_" + A), t.attributes.has(this.getUID(P))) {
-        l[A] = t.attributes.get(this.getUID(P));
+    for (let E in r.attributes) {
+      if (E.slice(0, 5) === "morph") continue;
+      const R = r.attributes[E];
+      if (E = d[E] || E.toUpperCase(), /^(POSITION|NORMAL|TANGENT|TEXCOORD_\d+|COLOR_\d+|JOINTS_\d+|WEIGHTS_\d+)$/.test(E) || (E = "_" + E), t.attributes.has(this.getUID(R))) {
+        l[E] = t.attributes.get(this.getUID(R));
         continue;
       }
       p = null;
-      const L = P.array;
-      A === "JOINTS_0" && !(L instanceof Uint16Array) && !(L instanceof Uint8Array) ? (console.warn('GLTFExporter: Attribute "skinIndex" converted to type UNSIGNED_SHORT.'), p = new H(new Uint16Array(L), P.itemSize, P.normalized)) : (L instanceof Uint32Array || L instanceof Int32Array) && !A.startsWith("_") && (console.warn(`GLTFExporter: Attribute "${A}" converted to type FLOAT.`), p = ne.Utils.toFloat32BufferAttribute(P));
-      const g = this.processAccessor(p || P, r);
-      g !== null && (A.startsWith("_") || this.detectMeshQuantization(A, P), l[A] = g, t.attributes.set(this.getUID(P), g));
+      const P = R.array;
+      E === "JOINTS_0" && !(P instanceof Uint16Array) && !(P instanceof Uint8Array) ? (console.warn('GLTFExporter: Attribute "skinIndex" converted to type UNSIGNED_SHORT.'), p = new te(new Uint16Array(P), R.itemSize, R.normalized)) : (P instanceof Uint32Array || P instanceof Int32Array) && !E.startsWith("_") && (console.warn(`GLTFExporter: Attribute "${E}" converted to type FLOAT.`), p = he.Utils.toFloat32BufferAttribute(R));
+      const O = this.processAccessor(p || R, r);
+      O !== null && (E.startsWith("_") || this.detectMeshQuantization(E, R), l[E] = O, t.attributes.set(this.getUID(R), O));
     }
     if (u !== void 0 && r.setAttribute("normal", u), Object.keys(l).length === 0) return null;
     if (e.morphTargetInfluences !== void 0 && e.morphTargetInfluences.length > 0) {
-      const A = [], P = [], M = {};
+      const E = [], R = [], U = {};
       if (e.morphTargetDictionary !== void 0)
-        for (const L in e.morphTargetDictionary)
-          M[e.morphTargetDictionary[L]] = L;
-      for (let L = 0; L < e.morphTargetInfluences.length; ++L) {
-        const g = {};
-        let b = !1;
-        for (const m in r.morphAttributes) {
-          if (m !== "position" && m !== "normal") {
-            b || (console.warn("GLTFExporter: Only POSITION and NORMAL morph are supported."), b = !0);
+        for (const P in e.morphTargetDictionary)
+          U[e.morphTargetDictionary[P]] = P;
+      for (let P = 0; P < e.morphTargetInfluences.length; ++P) {
+        const O = {};
+        let X = !1;
+        for (const k in r.morphAttributes) {
+          if (k !== "position" && k !== "normal") {
+            X || (console.warn("GLTFExporter: Only POSITION and NORMAL morph are supported."), X = !0);
             continue;
           }
-          const E = r.morphAttributes[m][L], T = m.toUpperCase(), I = r.attributes[m];
-          if (t.attributes.has(this.getUID(E, !0))) {
-            g[T] = t.attributes.get(this.getUID(E, !0));
+          const W = r.morphAttributes[k][P], J = k.toUpperCase(), V = r.attributes[k];
+          if (t.attributes.has(this.getUID(W, !0))) {
+            O[J] = t.attributes.get(this.getUID(W, !0));
             continue;
           }
-          const N = E.clone();
+          const D = W.clone();
           if (!r.morphTargetsRelative)
-            for (let D = 0, v = E.count; D < v; D++)
-              for (let O = 0; O < E.itemSize; O++)
-                O === 0 && N.setX(D, E.getX(D) - I.getX(D)), O === 1 && N.setY(D, E.getY(D) - I.getY(D)), O === 2 && N.setZ(D, E.getZ(D) - I.getZ(D)), O === 3 && N.setW(D, E.getW(D) - I.getW(D));
-          g[T] = this.processAccessor(N, r), t.attributes.set(this.getUID(I, !0), g[T]);
+            for (let b = 0, L = W.count; b < L; b++)
+              for (let M = 0; M < W.itemSize; M++)
+                M === 0 && D.setX(b, W.getX(b) - V.getX(b)), M === 1 && D.setY(b, W.getY(b) - V.getY(b)), M === 2 && D.setZ(b, W.getZ(b) - V.getZ(b)), M === 3 && D.setW(b, W.getW(b) - V.getW(b));
+          O[J] = this.processAccessor(D, r), t.attributes.set(this.getUID(V, !0), O[J]);
         }
-        h.push(g), A.push(e.morphTargetInfluences[L]), e.morphTargetDictionary !== void 0 && P.push(M[L]);
+        h.push(O), E.push(e.morphTargetInfluences[P]), e.morphTargetDictionary !== void 0 && R.push(U[P]);
       }
-      a.weights = A, P.length > 0 && (a.extras = {}, a.extras.targetNames = P);
+      a.weights = E, R.length > 0 && (a.extras = {}, a.extras.targetNames = R);
     }
     const y = Array.isArray(e.material);
     if (y && r.groups.length === 0) return null;
     let x = !1;
     if (y && r.index === null) {
-      const A = [];
-      for (let P = 0, M = r.attributes.position.count; P < M; P++)
-        A[P] = P;
-      r.setIndex(A), x = !0;
+      const E = [];
+      for (let R = 0, U = r.attributes.position.count; R < U; R++)
+        E[R] = R;
+      r.setIndex(E), x = !0;
     }
-    const S = y ? e.material : [e.material], R = y ? r.groups : [{ materialIndex: 0, start: void 0, count: void 0 }];
-    for (let A = 0, P = R.length; A < P; A++) {
-      const M = {
+    const S = y ? e.material : [e.material], T = y ? r.groups : [{ materialIndex: 0, start: void 0, count: void 0 }];
+    for (let E = 0, R = T.length; E < R; E++) {
+      const U = {
         mode: o,
         attributes: l
       };
-      if (this.serializeUserData(r, M), h.length > 0 && (M.targets = h), r.index !== null) {
-        let g = this.getUID(r.index);
-        (R[A].start !== void 0 || R[A].count !== void 0) && (g += ":" + R[A].start + ":" + R[A].count), t.attributes.has(g) ? M.indices = t.attributes.get(g) : (M.indices = this.processAccessor(r.index, r, R[A].start, R[A].count), t.attributes.set(g, M.indices)), M.indices === null && delete M.indices;
+      if (this.serializeUserData(r, U), h.length > 0 && (U.targets = h), r.index !== null) {
+        let O = this.getUID(r.index);
+        (T[E].start !== void 0 || T[E].count !== void 0) && (O += ":" + T[E].start + ":" + T[E].count), t.attributes.has(O) ? U.indices = t.attributes.get(O) : (U.indices = this.processAccessor(r.index, r, T[E].start, T[E].count), t.attributes.set(O, U.indices)), U.indices === null && delete U.indices;
       }
-      const L = await this.processMaterialAsync(S[R[A].materialIndex]);
-      L !== null && (M.material = L), c.push(M);
+      const P = await this.processMaterialAsync(S[T[E].materialIndex]);
+      P !== null && (U.material = P), c.push(U);
     }
-    x === !0 && r.setIndex(null), a.primitives = c, n.meshes || (n.meshes = []), await this._invokeAllAsync(function(A) {
-      A.writeMesh && A.writeMesh(e, a);
+    x === !0 && r.setIndex(null), a.primitives = c, n.meshes || (n.meshes = []), await this._invokeAllAsync(function(E) {
+      E.writeMesh && E.writeMesh(e, a);
     });
-    const F = n.meshes.push(a) - 1;
-    return t.meshes.set(i, F), F;
+    const G = n.meshes.push(a) - 1;
+    return t.meshes.set(i, G), G;
   }
   /**
    * If a vertex attribute with a
@@ -3579,7 +3658,7 @@ class pt {
    * @param {THREE.BufferAttribute} attribute
    */
   detectMeshQuantization(e, t) {
-    if (this.extensionsUsed[re]) return;
+    if (this.extensionsUsed[fe]) return;
     let n;
     switch (t.array.constructor) {
       case Int8Array:
@@ -3599,7 +3678,7 @@ class pt {
     }
     t.normalized && (n += " normalized");
     const s = e.split("_", 1)[0];
-    me[s] && me[s].includes(n) && (this.extensionsUsed[re] = !0, this.extensionsRequired[re] = !0);
+    Ae[s] && Ae[s].includes(n) && (this.extensionsUsed[fe] = !0, this.extensionsRequired[fe] = !0);
   }
   /**
    * Process camera
@@ -3619,7 +3698,7 @@ class pt {
       znear: e.near < 0 ? 0 : e.near
     } : s.perspective = {
       aspectRatio: e.aspect,
-      yfov: ce.degToRad(e.fov),
+      yfov: ye.degToRad(e.fov),
       zfar: e.far <= 0 ? 1e-3 : e.far,
       znear: e.near < 0 ? 0 : e.near
     }, e.name !== "" && (s.name = e.type), t.cameras.push(s) - 1;
@@ -3636,28 +3715,28 @@ class pt {
    */
   processAnimation(e, t) {
     const n = this.json, s = this.nodeMap;
-    n.animations || (n.animations = []), e = ne.Utils.mergeMorphTargetTracks(e.clone(), t);
+    n.animations || (n.animations = []), e = he.Utils.mergeMorphTargetTracks(e.clone(), t);
     const i = e.tracks, r = [], o = [];
     for (let l = 0; l < i.length; ++l) {
-      const c = i[l], h = te.parseTrackName(c.name);
-      let f = te.findNode(t, h.nodeName);
-      const u = ge[h.propertyName];
-      if (h.objectName === "bones" && (f.isSkinnedMesh === !0 ? f = f.skeleton.getBoneByName(h.objectIndex) : f = void 0), !f || !u) {
+      const c = i[l], h = le.parseTrackName(c.name);
+      let d = le.findNode(t, h.nodeName);
+      const u = Te[h.propertyName];
+      if (h.objectName === "bones" && (d.isSkinnedMesh === !0 ? d = d.skeleton.getBoneByName(h.objectIndex) : d = void 0), !d || !u) {
         console.warn('THREE.GLTFExporter: Could not export animation track "%s".', c.name);
         continue;
       }
       const p = 1;
       let y = c.values.length / c.times.length;
-      u === ge.morphTargetInfluences && (y /= f.morphTargetInfluences.length);
+      u === Te.morphTargetInfluences && (y /= d.morphTargetInfluences.length);
       let x;
-      c.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline === !0 ? (x = "CUBICSPLINE", y /= 3) : c.getInterpolation() === _e ? x = "STEP" : x = "LINEAR", o.push({
-        input: this.processAccessor(new H(c.times, p)),
-        output: this.processAccessor(new H(c.values, y)),
+      c.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline === !0 ? (x = "CUBICSPLINE", y /= 3) : c.getInterpolation() === We ? x = "STEP" : x = "LINEAR", o.push({
+        input: this.processAccessor(new te(c.times, p)),
+        output: this.processAccessor(new te(c.values, y)),
         interpolation: x
       }), r.push({
         sampler: o.length - 1,
         target: {
-          node: s.get(f),
+          node: s.get(d),
           path: u
         }
       });
@@ -3678,11 +3757,11 @@ class pt {
     if (i === void 0) return null;
     const r = e.skeleton.bones[0];
     if (r === void 0) return null;
-    const o = [], a = new Float32Array(i.bones.length * 16), l = new Ae();
+    const o = [], a = new Float32Array(i.bones.length * 16), l = new ve();
     for (let h = 0; h < i.bones.length; ++h)
       o.push(n.get(i.bones[h])), l.copy(i.boneInverses[h]), l.multiply(e.bindMatrix).toArray(a, h * 16);
     return t.skins === void 0 && (t.skins = []), t.skins.push({
-      inverseBindMatrices: this.processAccessor(new H(a, 16)),
+      inverseBindMatrices: this.processAccessor(new te(a, 16)),
       joints: o,
       skeleton: n.get(r)
     }), s.skin = t.skins.length - 1;
@@ -3698,9 +3777,9 @@ class pt {
     const i = {};
     if (n.trs) {
       const o = e.quaternion.toArray(), a = e.position.toArray(), l = e.scale.toArray();
-      Z(o, [0, 0, 0, 1]) || (i.rotation = o), Z(a, [0, 0, 0]) || (i.translation = a), Z(l, [1, 1, 1]) || (i.scale = l);
+      oe(o, [0, 0, 0, 1]) || (i.rotation = o), oe(a, [0, 0, 0]) || (i.translation = a), oe(l, [1, 1, 1]) || (i.scale = l);
     } else
-      e.matrixAutoUpdate && e.updateMatrix(), ut(e.matrix) === !1 && (i.matrix = e.matrix.elements);
+      e.matrixAutoUpdate && e.updateMatrix(), wt(e.matrix) === !1 && (i.matrix = e.matrix.elements);
     if (e.name !== "" && (i.name = String(e.name)), this.serializeUserData(e, i), e.isMesh || e.isLine || e.isPoints) {
       const o = await this.processMeshAsync(e);
       o !== null && (i.mesh = o);
@@ -3746,7 +3825,7 @@ class pt {
    * @param {Array<THREE.Object3D>} objects List of objects to process
    */
   async processObjectsAsync(e) {
-    const t = new fe();
+    const t = new Se();
     t.name = "AuxScene";
     for (let n = 0; n < e.length; n++)
       t.children.push(e[n]);
@@ -3762,7 +3841,7 @@ class pt {
     });
     const n = [];
     for (let s = 0; s < e.length; s++)
-      e[s] instanceof fe ? await this.processSceneAsync(e[s]) : n.push(e[s]);
+      e[s] instanceof Se ? await this.processSceneAsync(e[s]) : n.push(e[s]);
     n.length > 0 && await this.processObjectsAsync(n);
     for (let s = 0; s < this.skins.length; ++s)
       this.processSkin(this.skins[s]);
@@ -3777,7 +3856,7 @@ class pt {
       await e(this.plugins[t]);
   }
 }
-class xt {
+class Et {
   constructor(e) {
     this.writer = e, this.name = "KHR_lights_punctual";
   }
@@ -3793,7 +3872,7 @@ class xt {
     o.push(r), t.extensions = t.extensions || {}, t.extensions[this.name] = { light: o.length - 1 };
   }
 }
-class yt {
+class Dt {
   constructor(e) {
     this.writer = e, this.name = "KHR_materials_unlit";
   }
@@ -3803,7 +3882,7 @@ class yt {
     t.extensions = t.extensions || {}, t.extensions[this.name] = {}, s[this.name] = !0, t.pbrMetallicRoughness.metallicFactor = 0, t.pbrMetallicRoughness.roughnessFactor = 0.9;
   }
 }
-class mt {
+class At {
   constructor(e) {
     this.writer = e, this.name = "KHR_materials_clearcoat";
   }
@@ -3834,7 +3913,7 @@ class mt {
     t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class gt {
+class Tt {
   constructor(e) {
     this.writer = e, this.name = "KHR_materials_dispersion";
   }
@@ -3844,7 +3923,7 @@ class gt {
     i.dispersion = e.dispersion, t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class wt {
+class bt {
   constructor(e) {
     this.writer = e, this.name = "KHR_materials_iridescence";
   }
@@ -3868,7 +3947,7 @@ class wt {
     t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Mt {
+class It {
   constructor(e) {
     this.writer = e, this.name = "KHR_materials_transmission";
   }
@@ -3885,7 +3964,7 @@ class Mt {
     t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Lt {
+class Rt {
   constructor(e) {
     this.writer = e, this.name = "KHR_materials_volume";
   }
@@ -3902,7 +3981,7 @@ class Lt {
     e.attenuationDistance !== 1 / 0 && (i.attenuationDistance = e.attenuationDistance), i.attenuationColor = e.attenuationColor.toArray(), t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class St {
+class Pt {
   constructor(e) {
     this.writer = e, this.name = "KHR_materials_ior";
   }
@@ -3912,12 +3991,12 @@ class St {
     i.ior = e.ior, t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class At {
+class vt {
   constructor(e) {
     this.writer = e, this.name = "KHR_materials_specular";
   }
   async writeMaterialAsync(e, t) {
-    if (!e.isMeshPhysicalMaterial || e.specularIntensity === 1 && e.specularColor.equals(rt) && !e.specularIntensityMap && !e.specularColorMap) return;
+    if (!e.isMeshPhysicalMaterial || e.specularIntensity === 1 && e.specularColor.equals(ft) && !e.specularIntensityMap && !e.specularColorMap) return;
     const n = this.writer, s = n.extensionsUsed, i = {};
     if (e.specularIntensityMap) {
       const r = {
@@ -3936,7 +4015,7 @@ class At {
     i.specularFactor = e.specularIntensity, i.specularColorFactor = e.specularColor.toArray(), t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Et {
+class Nt {
   constructor(e) {
     this.writer = e, this.name = "KHR_materials_sheen";
   }
@@ -3960,7 +4039,7 @@ class Et {
     i.sheenRoughnessFactor = e.sheenRoughness, i.sheenColorFactor = e.sheenColor.toArray(), t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Tt {
+class Ct {
   constructor(e) {
     this.writer = e, this.name = "KHR_materials_anisotropy";
   }
@@ -3974,7 +4053,7 @@ class Tt {
     i.anisotropyStrength = e.anisotropy, i.anisotropyRotation = e.anisotropyRotation, t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Dt {
+class Bt {
   constructor(e) {
     this.writer = e, this.name = "KHR_materials_emissive_strength";
   }
@@ -3984,7 +4063,7 @@ class Dt {
     i.emissiveStrength = e.emissiveIntensity, t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class bt {
+class Ot {
   constructor(e) {
     this.writer = e, this.name = "EXT_materials_bump";
   }
@@ -4001,54 +4080,54 @@ class bt {
     i.bumpFactor = e.bumpScale, t.extensions = t.extensions || {}, t.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class It {
+class Ft {
   constructor(e) {
     this.writer = e, this.name = "EXT_mesh_gpu_instancing";
   }
   writeNode(e, t) {
     if (!e.isInstancedMesh) return;
-    const n = this.writer, s = e, i = new Float32Array(s.count * 3), r = new Float32Array(s.count * 4), o = new Float32Array(s.count * 3), a = new Ae(), l = new ee(), c = new Ne(), h = new ee();
+    const n = this.writer, s = e, i = new Float32Array(s.count * 3), r = new Float32Array(s.count * 4), o = new Float32Array(s.count * 3), a = new ve(), l = new ce(), c = new _e(), h = new ce();
     for (let u = 0; u < s.count; u++)
       s.getMatrixAt(u, a), a.decompose(l, c, h), l.toArray(i, u * 3), c.toArray(r, u * 4), h.toArray(o, u * 3);
-    const f = {
-      TRANSLATION: n.processAccessor(new H(i, 3)),
-      ROTATION: n.processAccessor(new H(r, 4)),
-      SCALE: n.processAccessor(new H(o, 3))
+    const d = {
+      TRANSLATION: n.processAccessor(new te(i, 3)),
+      ROTATION: n.processAccessor(new te(r, 4)),
+      SCALE: n.processAccessor(new te(o, 3))
     };
-    s.instanceColor && (f._COLOR_0 = n.processAccessor(s.instanceColor)), t.extensions = t.extensions || {}, t.extensions[this.name] = { attributes: f }, n.extensionsUsed[this.name] = !0, n.extensionsRequired[this.name] = !0;
+    s.instanceColor && (d._COLOR_0 = n.processAccessor(s.instanceColor)), t.extensions = t.extensions || {}, t.extensions[this.name] = { attributes: d }, n.extensionsUsed[this.name] = !0, n.extensionsRequired[this.name] = !0;
   }
 }
-ne.Utils = {
-  insertKeyframe: function(d, e) {
-    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));
+he.Utils = {
+  insertKeyframe: function(f, e) {
+    const n = f.getValueSize(), s = new f.TimeBufferType(f.times.length + 1), i = new f.ValueBufferType(f.values.length + n), r = f.createInterpolant(new f.ValueBufferType(n));
     let o;
-    if (d.times.length === 0) {
+    if (f.times.length === 0) {
       s[0] = e;
       for (let a = 0; a < n; a++)
         i[a] = 0;
       o = 0;
-    } else if (e < d.times[0]) {
-      if (Math.abs(d.times[0] - e) < 1e-3) return 0;
-      s[0] = e, s.set(d.times, 1), i.set(r.evaluate(e), 0), i.set(d.values, n), o = 0;
-    } else if (e > d.times[d.times.length - 1]) {
-      if (Math.abs(d.times[d.times.length - 1] - e) < 1e-3)
-        return d.times.length - 1;
-      s[s.length - 1] = e, s.set(d.times, 0), i.set(d.values, 0), i.set(r.evaluate(e), d.values.length), o = s.length - 1;
+    } else if (e < f.times[0]) {
+      if (Math.abs(f.times[0] - e) < 1e-3) return 0;
+      s[0] = e, s.set(f.times, 1), i.set(r.evaluate(e), 0), i.set(f.values, n), o = 0;
+    } else if (e > f.times[f.times.length - 1]) {
+      if (Math.abs(f.times[f.times.length - 1] - e) < 1e-3)
+        return f.times.length - 1;
+      s[s.length - 1] = e, s.set(f.times, 0), i.set(f.values, 0), i.set(r.evaluate(e), f.values.length), o = s.length - 1;
     } else
-      for (let a = 0; a < d.times.length; a++) {
-        if (Math.abs(d.times[a] - e) < 1e-3) return a;
-        if (d.times[a] < e && d.times[a + 1] > e) {
-          s.set(d.times.slice(0, a + 1), 0), s[a + 1] = e, s.set(d.times.slice(a + 1), a + 2), i.set(d.values.slice(0, (a + 1) * n), 0), i.set(r.evaluate(e), (a + 1) * n), i.set(d.values.slice((a + 1) * n), (a + 2) * n), o = a + 1;
+      for (let a = 0; a < f.times.length; a++) {
+        if (Math.abs(f.times[a] - e) < 1e-3) return a;
+        if (f.times[a] < e && f.times[a + 1] > e) {
+          s.set(f.times.slice(0, a + 1), 0), s[a + 1] = e, s.set(f.times.slice(a + 1), a + 2), i.set(f.values.slice(0, (a + 1) * n), 0), i.set(r.evaluate(e), (a + 1) * n), i.set(f.values.slice((a + 1) * n), (a + 2) * n), o = a + 1;
           break;
         }
       }
-    return d.times = s, d.values = i, o;
+    return f.times = s, f.values = i, o;
   },
-  mergeMorphTargetTracks: function(d, e) {
-    const t = [], n = {}, s = d.tracks;
+  mergeMorphTargetTracks: function(f, e) {
+    const t = [], n = {}, s = f.tracks;
     for (let i = 0; i < s.length; ++i) {
       let r = s[i];
-      const o = te.parseTrackName(r.name), a = te.findNode(e, o.nodeName);
+      const o = le.parseTrackName(r.name), a = le.findNode(e, o.nodeName);
       if (o.propertyName !== "morphTargetInfluences" || o.propertyIndex === void 0) {
         t.push(r);
         continue;
@@ -4056,7 +4135,7 @@ ne.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(Ke);
+        console.warn("THREE.GLTFExporter: Morph target interpolation mode not yet supported. Using LINEAR instead."), r = r.clone(), r.setInterpolation(it);
       }
       const l = a.morphTargetInfluences.length, c = a.morphTargetDictionary[o.propertyIndex];
       if (c === void 0)
@@ -4070,77 +4149,77 @@ ne.Utils = {
         h.name = (o.nodeName || "") + ".morphTargetInfluences", h.values = u, n[a.uuid] = h, t.push(h);
         continue;
       }
-      const f = r.createInterpolant(new r.ValueBufferType(1));
+      const d = r.createInterpolant(new r.ValueBufferType(1));
       h = n[a.uuid];
       for (let u = 0; u < h.times.length; u++)
-        h.values[u * l + c] = f.evaluate(h.times[u]);
+        h.values[u * l + c] = d.evaluate(h.times[u]);
       for (let u = 0; u < r.times.length; u++) {
         const p = this.insertKeyframe(h, r.times[u]);
         h.values[p * l + c] = r.values[u];
       }
     }
-    return d.tracks = t, d;
+    return f.tracks = t, f;
   },
-  toFloat32BufferAttribute: function(d) {
-    const e = new H(new Float32Array(d.count * d.itemSize), d.itemSize, !1);
-    if (!d.normalized && !d.isInterleavedBufferAttribute)
-      return e.array.set(d.array), e;
-    for (let t = 0, n = d.count; t < n; t++)
-      for (let s = 0; s < d.itemSize; s++)
-        e.setComponent(t, s, d.getComponent(t, s));
+  toFloat32BufferAttribute: function(f) {
+    const e = new te(new Float32Array(f.count * f.itemSize), f.itemSize, !1);
+    if (!f.normalized && !f.isInterleavedBufferAttribute)
+      return e.array.set(f.array), e;
+    for (let t = 0, n = f.count; t < n; t++)
+      for (let s = 0; s < f.itemSize; s++)
+        e.setComponent(t, s, f.getComponent(t, s));
     return e;
   }
 };
-async function Rt(d) {
+async function Ut(f) {
   if (typeof FileReader > "u") {
-    const e = await d.arrayBuffer(), n = Buffer.from(e).toString("base64");
-    return `data:${d.type};base64,${n}`;
+    const e = await f.arrayBuffer(), n = Buffer.from(e).toString("base64");
+    return `data:${f.type};base64,${n}`;
   } else
     return new Promise((e, t) => {
       const n = new FileReader();
-      n.onload = () => e(n.result), n.onerror = () => t(new Error("Failed to read Blob as Data URL")), n.readAsDataURL(d);
+      n.onload = () => e(n.result), n.onerror = () => t(new Error("Failed to read Blob as Data URL")), n.readAsDataURL(f);
     });
 }
-async function ae(d) {
-  if (typeof d.arrayBuffer == "function")
-    return await d.arrayBuffer();
+async function xe(f) {
+  if (typeof f.arrayBuffer == "function")
+    return await f.arrayBuffer();
   if (typeof FileReader < "u")
     return new Promise((e, t) => {
       const n = new FileReader();
-      n.onload = () => e(n.result), n.onerror = () => t(n.error), n.readAsArrayBuffer(d);
+      n.onload = () => e(n.result), n.onerror = () => t(n.error), n.readAsArrayBuffer(f);
     });
   {
-    const e = Buffer.from(await d.text());
+    const e = Buffer.from(await f.text());
     return e.buffer.slice(e.byteOffset, e.byteOffset + e.byteLength);
   }
 }
-const Pt = new $e(), vt = new ne();
-function Nt(d, e, t = 0.1) {
-  const n = e.normal(d), s = e.direction(d).mutiplyScalar(t * 0.5), i = d.direction(e).mutiplyScalar(t * 0.5), r = n.x * t * 0.5, o = n.y * t * 0.5;
+const Gt = new rt(), zt = new he();
+function _t(f, e, t = 0.1) {
+  const n = e.normal(f), s = e.direction(f).mutiplyScalar(t * 0.5), i = f.direction(e).mutiplyScalar(t * 0.5), r = n.x * t * 0.5, o = n.y * t * 0.5;
   return {
     points: [
       // 第一条线
-      new w(d.x + r, d.y + o).add(i),
-      new w(e.x + r, e.y + o).add(s),
+      new g(f.x + r, f.y + o).add(i),
+      new g(e.x + r, e.y + o).add(s),
       // 第二条线
-      new w(d.x - r, d.y - o).add(i),
-      new w(e.x - r, e.y - o).add(s)
+      new g(f.x - r, f.y - o).add(i),
+      new g(e.x - r, e.y - o).add(s)
     ],
     indices: [0, 1, 1, 3, 3, 2, 2, 0],
     rectIndices: [0, 1, 3, 2, 0]
   };
 }
-class be extends J {
+class Oe extends ne {
   static name = "WhiteModel";
   Dxf = null;
   Variable = null;
   // dxf数据白模
-  whiteModelGroup = new U.Group();
+  whiteModelGroup = new z.Group();
   // dxf数据白模边缘线
-  whiteModelLineGroup = new U.Group();
+  whiteModelLineGroup = new z.Group();
   // 原始数据白模
-  originalWhiteMode = new U.Group();
-  material = new U.MeshStandardMaterial({ color: 16777215, transparent: !0, opacity: 0.8, side: U.DoubleSide });
+  originalWhiteMode = new z.Group();
+  material = new z.MeshStandardMaterial({ color: 16777215, transparent: !0, opacity: 0.8, side: z.DoubleSide });
   onAddFromParent(e) {
     this.Dxf = e.findComponentByName("Dxf"), this.Variable = e.findComponentByName("Variable"), this.originalWhiteMode.visible = !1, this.Dxf?.addEventListener("lineOffset", () => {
       this.updateModel();
@@ -4150,17 +4229,17 @@ class be extends J {
     this.Variable?.set("whiteModelVisible", !1);
     const e = this.Dxf;
     this.originalWhiteMode.clear(), this.whiteModelGroup.clear(), this.whiteModelLineGroup.clear(), this.whiteModelGroup.add(this.whiteModelLineGroup), this.whiteModelGroup.position.z = e.originalZAverage, this.originalWhiteMode.position.z = e.originalZAverage, e.wallsGroup.forEach((n) => {
-      const s = new U.Shape();
+      const s = new z.Shape();
       n.forEach((o, a) => a === 0 ? s.moveTo(o.x / e.scale, o.y / e.scale) : s.lineTo(o.x / e.scale, o.y / e.scale));
-      const i = new U.ExtrudeGeometry(s, {
+      const i = new z.ExtrudeGeometry(s, {
         depth: 2.8,
         bevelSize: 0
-      }), r = new U.Mesh(i, this.material);
+      }), r = new z.Mesh(i, this.material);
       this.whiteModelGroup.add(r), this.whiteModelLineGroup.add(
-        new U.LineSegments(new U.EdgesGeometry(i), new U.LineBasicMaterial({ color: 0 }))
+        new z.LineSegments(new z.EdgesGeometry(i), new z.LineBasicMaterial({ color: 0 }))
       );
     }), e.originalData.map(({ start: n, end: s, insetionArr: i }) => {
-      const r = new w(n.x, n.y).mutiplyScalar(e.scale), o = new w(s.x, s.y).mutiplyScalar(e.scale), { points: a, indices: l, rectIndices: c } = Nt(r, o, e.width);
+      const r = new g(n.x, n.y).mutiplyScalar(e.scale), o = new g(s.x, s.y).mutiplyScalar(e.scale), { points: a, indices: l, rectIndices: c } = _t(r, o, e.width);
       return {
         points: a,
         indices: l,
@@ -4168,17 +4247,17 @@ class be extends J {
         insetions: (i ?? []).map((h) => h.index)
       };
     }).forEach((n) => {
-      const s = new U.Shape();
+      const s = new z.Shape();
       n.rectIndices.forEach((o, a) => {
         const l = n.points[o];
         a === 0 ? s.moveTo(l.x, l.y) : s.lineTo(l.x, l.y);
       });
-      const i = new U.ExtrudeGeometry(s, {
+      const i = new z.ExtrudeGeometry(s, {
         depth: 2.8,
         bevelSize: 0
       });
       if (i.attributes.position.array.filter((o) => Number.isNaN(o)).length) return;
-      const r = new U.Mesh(i);
+      const r = new z.Mesh(i);
       this.originalWhiteMode?.add(r);
     }), this.dispatchEvent({
       type: "updateModel",
@@ -4193,7 +4272,7 @@ class be extends J {
   toOBJ() {
     return new Promise((e) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(() => {
-        e(Pt.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
+        e(Gt.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
       }, 20);
     });
   }
@@ -4205,7 +4284,7 @@ class be extends J {
   toGltf(e = !0) {
     return new Promise((t) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(async () => {
-        vt.parse(this.whiteModelGroup.children, (n) => {
+        zt.parse(this.whiteModelGroup.children, (n) => {
           t(n), this.material.opacity = 0.8, this.material.transparent = !0;
         }, () => {
           t(void 0);
@@ -4246,7 +4325,7 @@ class be extends J {
       n.href = URL.createObjectURL(t), n.download = e, n.click();
     } else if (typeof global < "u") {
       const t = await this.toOBJ();
-      t && (await K("fs", !1)).writeFileSync(e, t);
+      t && (await se("fs", !1)).writeFileSync(e, t);
     }
   }
   /**
@@ -4262,11 +4341,11 @@ class be extends J {
       s.href = URL.createObjectURL(n), s.download = e, s.click();
     } else if (typeof global < "u") {
       const n = await this.toGltf(t);
-      n && (await K("fs", !1)).writeFileSync(e, t ? Buffer.from(n) : JSON.stringify(n));
+      n && (await se("fs", !1)).writeFileSync(e, t ? Buffer.from(n) : JSON.stringify(n));
     }
   }
 }
-class Ie extends J {
+class Fe extends ne {
   static name = "DetailsPoint";
   Dxf = null;
   WhiteModel = null;
@@ -4317,17 +4396,17 @@ class Ie extends J {
       this._timer = null;
       const e = this.parent?.findComponentByName("WhiteModel");
       this.raylines.length = 0, this.desPoints.length = 0, this.data.forEach((t) => {
-        const n = new U.Vector3(
+        const n = new z.Vector3(
           t.position.x,
           t.position.y,
           t.position.z
-        ), s = new U.Vector3(
+        ), s = new z.Vector3(
           t.direction.x,
           t.direction.y,
           t.direction.z
         ), i = 100;
         this.racasterHelper(n, s, i), s.z = 0;
-        const o = new U.Raycaster(n, s, 0, i).intersectObject(e.originalWhiteMode);
+        const o = new z.Raycaster(n, s, 0, i).intersectObject(e.originalWhiteMode);
         if (o.length) {
           const { point: a } = o[0];
           this.desPoints.push({
@@ -4343,61 +4422,61 @@ class Ie extends J {
     }, 50);
   }
 }
-class Re extends J {
+class Ue extends ne {
   static name = "DxfLineModel";
-  dxfLineModel = new U.LineSegments();
-  dxfDoorsLineModel = new U.LineSegments();
-  dxfModelGroup = new U.Group();
+  dxfLineModel = new z.LineSegments();
+  dxfDoorsLineModel = new z.LineSegments();
+  dxfModelGroup = new z.Group();
   onAddFromParent(e) {
     const t = e.findComponentByName("Dxf");
-    this.dxfModelGroup.add(this.dxfLineModel), this.dxfModelGroup.add(this.dxfDoorsLineModel), this.dxfDoorsLineModel.material = new U.LineBasicMaterial({ color: 16776960, vertexColors: !0 }), t?.addEventListener("lineOffset", () => this.updateMode());
+    this.dxfModelGroup.add(this.dxfLineModel), this.dxfModelGroup.add(this.dxfDoorsLineModel), this.dxfDoorsLineModel.material = new z.LineBasicMaterial({ color: 16776960, vertexColors: !0 }), t?.addEventListener("lineOffset", () => this.updateMode());
   }
   updateMode() {
     const e = this.parent?.findComponentByName("Dxf");
     this.dxfLineModel.clear();
     const t = e.to3DArray(1 / e.scale, 0);
-    this.dxfLineModel.geometry = new U.BufferGeometry().setAttribute("position", new U.BufferAttribute(t, 3, !0));
+    this.dxfLineModel.geometry = new z.BufferGeometry().setAttribute("position", new z.BufferAttribute(t, 3, !0));
     const n = new Float32Array(
       e.doorLineSegment.flatMap(({ start: i, end: r }) => [i.x, i.y, 0, r.x, r.y, 0])
     ).map((i) => i / e.scale), s = new Float32Array(e.doorLineSegment.flatMap(() => [1, 0, 0, 0, 1, 0]));
-    this.dxfDoorsLineModel.geometry = new U.BufferGeometry().setAttribute("position", new U.BufferAttribute(n, 3, !0)).setAttribute("color", new U.BufferAttribute(s, 3)), this.dxfModelGroup.position.z = e.originalZAverage, this.dispatchEvent({
+    this.dxfDoorsLineModel.geometry = new z.BufferGeometry().setAttribute("position", new z.BufferAttribute(n, 3, !0)).setAttribute("color", new z.BufferAttribute(s, 3)), this.dxfModelGroup.position.z = e.originalZAverage, this.dispatchEvent({
       type: "modelUpdate",
       model: this.dxfModelGroup
     });
   }
 }
-const Ct = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const qt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  DetailsPoint: Ie,
-  DxfLineModel: Re,
-  WhiteModel: be
+  DetailsPoint: Fe,
+  DxfLineModel: Ue,
+  WhiteModel: Oe
 }, Symbol.toStringTag, { value: "Module" }));
-function Se(d, e = {}) {
+function Pe(f, e = {}) {
   const {
     detailsPoint: t = !0,
     whiteModel: n = !0,
     dxfLineModel: s = !0
   } = e;
-  s && d.addComponent(new Re()), n && d.addComponent(new be()), t && d.addComponent(new Ie());
+  s && f.addComponent(new Ue()), n && f.addComponent(new Oe()), t && f.addComponent(new Fe());
 }
-const Bt = Object.assign(Se, {
-  create(d = {}) {
-    return (e) => Se(e, d);
+const jt = Object.assign(Pe, {
+  create(f = {}) {
+    return (e) => Pe(e, f);
   }
-}), Ot = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}), Yt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  ModelDataPlugin: Bt,
-  components: Ct
+  ModelDataPlugin: jt,
+  components: qt
 }, Symbol.toStringTag, { value: "Module" }));
-function Ft() {
+function kt() {
   return import("./index2.js");
 }
-function Ut() {
+function Xt() {
   return import("./index3.js");
 }
-let de = null;
-async function Yt(d, e, t = !1, n) {
-  const s = await Promise.resolve().then(() => Ot), i = await Ft(), r = await Ut(), o = new it().usePlugin(s.ModelDataPlugin.create({
+let Me = null;
+async function $t(f, e, t = !1, n) {
+  const s = await Promise.resolve().then(() => Yt), i = await kt(), r = await Xt(), o = new dt().usePlugin(s.ModelDataPlugin.create({
     detailsPoint: !1,
     whiteModel: !0
   })).usePlugin(i.RenderPlugin.create({
@@ -4407,13 +4486,13 @@ async function Yt(d, e, t = !1, n) {
     orbitControls: t,
     camera: e
   })).usePlugin(r.Editor.create({ viewPermission: n })), a = o.findComponentByType(i.components.DomContainer);
-  return a && d.appendChild(a.domElement), de = o, {
+  return a && f.appendChild(a.domElement), Me = o, {
     dxfSystem: o,
-    getFileAll: () => Gt(o)
+    getFileAll: () => Vt(o)
   };
 }
-async function Gt(d = de) {
-  const e = d.findComponentByName("WhiteModel"), t = 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 e.toOBJBlob()], "model.obj", { type: "application/octet-stream" }), r = new File([await e.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), o = new File([await e.toGltfBlob(!1)], "model.gltf", { type: "application/json" }), a = new File([JSON.stringify(d.Dxf.originalData)], "json.json", { type: "application/json" });
+async function Vt(f = Me) {
+  const e = f.findComponentByName("WhiteModel"), t = new File([await f.AngleCorrectionDxf.toDxfImageBlob()], "img.jpg", { type: "image/jpeg" }), n = new File([f.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), s = new File([f.AngleCorrectionDxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), i = new File([await e.toOBJBlob()], "model.obj", { type: "application/octet-stream" }), r = new File([await e.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), o = new File([await e.toGltfBlob(!1)], "model.gltf", { type: "application/json" }), a = new File([JSON.stringify(f.Dxf.originalData)], "json.json", { type: "application/json" });
   return {
     dxf: n,
     obj: i,
@@ -4424,27 +4503,27 @@ async function Gt(d = de) {
     correctionDxf: s
   };
 }
-function Xt() {
-  return de;
+function Zt() {
+  return Me;
 }
 export {
-  _ as B,
-  J as C,
-  it as D,
-  Ee as E,
-  B as L,
-  Bt as M,
-  w as P,
-  X as Q,
-  st as T,
-  Te as V,
-  be as W,
-  Ie as a,
-  he as b,
-  V as c,
-  Yt as d,
-  Xt as e,
-  Gt as g,
-  Ct as i,
-  le as u
+  j as B,
+  ne as C,
+  dt as D,
+  Ne as E,
+  N as L,
+  jt as M,
+  g as P,
+  Z as Q,
+  ut as T,
+  Ce as V,
+  Oe as W,
+  Fe as a,
+  ge as b,
+  $ as c,
+  $t as d,
+  Zt as e,
+  Vt as g,
+  qt as i,
+  me as u
 };