build-dxf 0.0.47 → 0.0.48

package/src/build.js

@@ -1,15 +1,15 @@
 import * as P from "three";
-import { EventDispatcher as Vt, Color as Ht, Matrix4 as vt, Vector3 as rt, Quaternion as Jt, BufferAttribute as Y, REVISION as $t, CompressedTexture as lt, Source as Kt, NoColorSpace as Zt, MathUtils as ft, RGBAFormat as Qt, ImageUtils as te, DoubleSide as ee, PropertyBinding as ot, InterpolateDiscrete as ne, Scene as yt, SRGBColorSpace as se, NearestFilter as ie, NearestMipmapNearestFilter as re, NearestMipmapLinearFilter as oe, LinearFilter as ae, LinearMipmapNearestFilter as ce, LinearMipmapLinearFilter as le, ClampToEdgeWrapping as he, RepeatWrapping as ue, MirroredRepeatWrapping as de, InterpolateLinear as fe } from "three";
+import { EventDispatcher as $t, Color as Kt, Matrix4 as Ct, Vector3 as it, Quaternion as Zt, BufferAttribute as _, REVISION as Qt, CompressedTexture as ct, Source as te, NoColorSpace as ee, MathUtils as dt, RGBAFormat as ne, ImageUtils as se, DoubleSide as ie, PropertyBinding as rt, InterpolateDiscrete as re, Scene as yt, SRGBColorSpace as oe, NearestFilter as ae, NearestMipmapNearestFilter as ce, NearestMipmapLinearFilter as le, LinearFilter as he, LinearMipmapNearestFilter as ue, LinearMipmapLinearFilter as de, ClampToEdgeWrapping as fe, RepeatWrapping as pe, MirroredRepeatWrapping as ge, InterpolateLinear as ye } from "three";
 import xt from "clipper-lib";
-import it from "dxf-writer";
-import { OBJExporter as pe } from "three/examples/jsm/exporters/OBJExporter.js";
+import st from "dxf-writer";
+import { OBJExporter as xe } from "three/examples/jsm/exporters/OBJExporter.js";
 function tt() {
   return "xxxx-xxxx-4xxx-yxxx-xxxx".replace(/[xy]/g, function(u) {
     var t = Math.random() * 16 | 0, e = u == "x" ? t : t & 3 | 8;
     return e.toString(16);
   });
 }
-class Rt extends Vt {
+class Nt extends $t {
   uuid = tt();
   addEventListener(t, e, n) {
     const { once: s = !1 } = n ?? {}, i = (o) => {
@@ -30,7 +30,7 @@ class Rt extends Vt {
     e && (e.forEach((n) => n()), this.eventRecordStack.delete(t));
   }
 }
-class z extends Rt {
+class G extends Nt {
   parent;
   destroyed = !1;
   constructor(...t) {
@@ -48,7 +48,7 @@ class z extends Rt {
     this.destroyed = !0;
   }
 }
-class ge extends Rt {
+class me extends Nt {
   static EventType = {
     ADD_COMPONENT: "addComponent"
   };
@@ -71,7 +71,7 @@ class ge extends Rt {
    * @param component 
    */
   removeComponent(t) {
-    if (t instanceof z) {
+    if (t instanceof G) {
       const e = this.components.indexOf(t);
       e > -1 && (this.components.splice(e, 1), this.dispatchEvent({
         type: "removeComponent",
@@ -116,17 +116,17 @@ class ge extends Rt {
     return e || null;
   }
 }
-class R {
+class I {
   minX = 0;
   maxX = 0;
   minY = 0;
   maxY = 0;
   get points() {
     return [
-      new D(this.minX, this.minY),
-      new D(this.maxX, this.minY),
-      new D(this.maxX, this.maxY),
-      new D(this.minX, this.maxY)
+      new w(this.minX, this.minY),
+      new w(this.maxX, this.minY),
+      new w(this.maxX, this.maxY),
+      new w(this.minX, this.maxY)
     ];
   }
   get width() {
@@ -136,7 +136,7 @@ class R {
     return this.maxY - this.minY;
   }
   get center() {
-    return new D(
+    return new w(
       this.minX + (this.maxX - this.minX) * 0.5,
       this.minY + (this.maxY - this.minY) * 0.5
     );
@@ -167,13 +167,13 @@ class R {
       return this.minX <= e.x && e.x <= this.maxX && this.minY <= e.y && e.y <= this.maxY;
     let r = Number.NEGATIVE_INFINITY, o = Number.POSITIVE_INFINITY;
     if (s !== 0) {
-      const a = (this.minX - e.x) / s, l = (this.maxX - e.x) / s;
-      r = Math.max(r, Math.min(a, l)), o = Math.min(o, Math.max(a, l));
+      const a = (this.minX - e.x) / s, c = (this.maxX - e.x) / s;
+      r = Math.max(r, Math.min(a, c)), o = Math.min(o, Math.max(a, c));
     } else if (e.x < this.minX || e.x > this.maxX)
       return !1;
     if (i !== 0) {
-      const a = (this.minY - e.y) / i, l = (this.maxY - e.y) / i;
-      r = Math.max(r, Math.min(a, l)), o = Math.min(o, Math.max(a, l));
+      const a = (this.minY - e.y) / i, c = (this.maxY - e.y) / i;
+      r = Math.max(r, Math.min(a, c)), o = Math.min(o, Math.max(a, c));
     } else if (e.y < this.minY || e.y > this.maxY)
       return !1;
     return r <= o && r <= 1 && o >= 0;
@@ -193,43 +193,43 @@ class R {
   intersectRectangle(t) {
     const e = t.points;
     let n = e[0].x, s = e[0].y, i = e[0].x, r = e[0].y;
-    for (let l = 1; l < 4; l++) {
-      const h = e[l];
-      h.x < n && (n = h.x), h.y < s && (s = h.y), h.x > i && (i = h.x), h.y > r && (r = h.y);
+    for (let c = 1; c < 4; c++) {
+      const l = e[c];
+      l.x < n && (n = l.x), l.y < s && (s = l.y), l.x > i && (i = l.x), l.y > r && (r = l.y);
     }
     if (this.maxX < n || this.minX > i || this.maxY < s || this.minY > r)
       return !1;
     const o = this.points;
-    for (let l = 0; l < 4; l++) {
-      const h = o[l], c = o[(l + 1) % 4];
+    for (let c = 0; c < 4; c++) {
+      const l = o[c], h = o[(c + 1) % 4];
       for (let d = 0; d < 4; d++) {
-        const f = e[d], p = e[(d + 1) % 4], y = (c.x - h.x) * (f.y - h.y) - (c.y - h.y) * (f.x - h.x), g = (c.x - h.x) * (p.y - h.y) - (c.y - h.y) * (p.x - h.x), x = (p.x - f.x) * (h.y - f.y) - (p.y - f.y) * (h.x - f.x), M = (p.x - f.x) * (c.y - f.y) - (p.y - f.y) * (c.x - f.x);
-        if (y * g < 0 && x * M < 0 || y === 0 && Math.min(h.x, c.x) <= f.x && f.x <= Math.max(h.x, c.x) && Math.min(h.y, c.y) <= f.y && f.y <= Math.max(h.y, c.y) || g === 0 && Math.min(h.x, c.x) <= p.x && p.x <= Math.max(h.x, c.x) && Math.min(h.y, c.y) <= p.y && p.y <= Math.max(h.y, c.y) || x === 0 && Math.min(f.x, p.x) <= h.x && h.x <= Math.max(f.x, p.x) && Math.min(f.y, p.y) <= h.y && h.y <= Math.max(f.y, p.y) || M === 0 && Math.min(f.x, p.x) <= c.x && c.x <= Math.max(f.x, p.x) && Math.min(f.y, p.y) <= c.y && c.y <= Math.max(f.y, p.y))
+        const f = e[d], p = e[(d + 1) % 4], y = (h.x - l.x) * (f.y - l.y) - (h.y - l.y) * (f.x - l.x), g = (h.x - l.x) * (p.y - l.y) - (h.y - l.y) * (p.x - l.x), x = (p.x - f.x) * (l.y - f.y) - (p.y - f.y) * (l.x - f.x), m = (p.x - f.x) * (h.y - f.y) - (p.y - f.y) * (h.x - f.x);
+        if (y * g < 0 && x * m < 0 || y === 0 && Math.min(l.x, h.x) <= f.x && f.x <= Math.max(l.x, h.x) && Math.min(l.y, h.y) <= f.y && f.y <= Math.max(l.y, h.y) || g === 0 && Math.min(l.x, h.x) <= p.x && p.x <= Math.max(l.x, h.x) && Math.min(l.y, h.y) <= p.y && p.y <= Math.max(l.y, h.y) || x === 0 && Math.min(f.x, p.x) <= l.x && l.x <= Math.max(f.x, p.x) && Math.min(f.y, p.y) <= l.y && l.y <= Math.max(f.y, p.y) || m === 0 && Math.min(f.x, p.x) <= h.x && h.x <= Math.max(f.x, p.x) && Math.min(f.y, p.y) <= h.y && h.y <= Math.max(f.y, p.y))
           return !0;
       }
     }
-    for (let l = 0; l < 4; l++) {
-      const h = e[l];
-      if (h.x >= this.minX && h.x <= this.maxX && h.y >= this.minY && h.y <= this.maxY)
+    for (let c = 0; c < 4; c++) {
+      const l = e[c];
+      if (l.x >= this.minX && l.x <= this.maxX && l.y >= this.minY && l.y <= this.maxY)
         return !0;
     }
-    const a = (l) => {
-      let h = 0;
-      for (let c = 0; c < 4; c++) {
-        const d = e[c], f = e[(c + 1) % 4], p = (f.x - d.x) * (l.y - d.y) - (f.y - d.y) * (l.x - d.x);
+    const a = (c) => {
+      let l = 0;
+      for (let h = 0; h < 4; h++) {
+        const d = e[h], f = e[(h + 1) % 4], p = (f.x - d.x) * (c.y - d.y) - (f.y - d.y) * (c.x - d.x);
         if (p === 0) {
-          const y = Math.abs(f.x - d.x) > 1e-10 ? f.x - d.x : f.y - d.y, g = y ? (l.x - d.x) / y : 0;
+          const y = Math.abs(f.x - d.x) > 1e-10 ? f.x - d.x : f.y - d.y, g = y ? (c.x - d.x) / y : 0;
           if (g >= 0 && g <= 1) return !0;
         } else {
           const y = p > 0 ? 1 : -1;
-          if (h === 0) h = y;
-          else if (h !== y) return !1;
+          if (l === 0) l = y;
+          else if (l !== y) return !1;
         }
       }
       return !0;
     };
-    for (let l = 0; l < 4; l++)
-      if (a(o[l])) return !0;
+    for (let c = 0; c < 4; c++)
+      if (a(o[c])) return !0;
     return !1;
   }
   /**
@@ -299,7 +299,7 @@ class R {
    * @returns 
    */
   clone() {
-    return new R(this.minX, this.maxX, this.minY, this.maxY);
+    return new I(this.minX, this.maxX, this.minY, this.maxY);
   }
   /**
    * 
@@ -310,7 +310,7 @@ class R {
     const e = [], n = [];
     return t.forEach((s) => {
       e.push(s.x), n.push(s.y);
-    }), new R(
+    }), new I(
       Math.min(...e),
       Math.max(...e),
       Math.min(...n),
@@ -328,7 +328,7 @@ class R {
       s?.points?.forEach((i) => {
         e.push(i.x), n.push(i.y);
       });
-    }), new R(
+    }), new I(
       Math.min(...e),
       Math.max(...e),
       Math.min(...n),
@@ -336,12 +336,20 @@ class R {
     );
   }
 }
-class G {
+class we extends Array {
+  userDataList() {
+    return this.map((t) => t.userData);
+  }
+  points() {
+    return this.map((t) => t.point);
+  }
+}
+class Y {
   map = /* @__PURE__ */ new Map();
   gridSize;
-  id = Symbol("id");
+  id;
   constructor(t = 2) {
-    this.gridSize = t;
+    this.gridSize = t, this.id = Symbol("id");
   }
   /**
    * 插入
@@ -377,7 +385,11 @@ class G {
     }
   }
   update(t) {
-    this.remove(t), this.insert(t);
+    const { target: e, set: n } = t.currentData[this.id];
+    if (!e) return !1;
+    const s = this.getGridId(t);
+    let i = this.map.get(s);
+    return i === n ? !1 : (n.delete(e), i || (i = /* @__PURE__ */ new Set(), this.map.set(s, i)), i.add(e), t.currentData[this.id].set = i, t.currentData[this.id].id = s, !0);
   }
   /**
    * 获取通过坐标，获取唯一网格索引
@@ -388,6 +400,15 @@ class G {
     const e = Math.ceil(t.x / this.gridSize), n = Math.ceil(t.y / this.gridSize);
     return `${e}.${n}`;
   }
+  /**
+   * 清空所有数据
+   */
+  clear() {
+    for (const t of this.map.values())
+      for (const e of t)
+        delete e.point.currentData[this.id], delete e.point.currentData.pointVirtualGrid;
+    this.map.clear();
+  }
   /**
    * 
    * @param gridId 
@@ -395,7 +416,7 @@ class G {
    */
   decodeGridId(t) {
     const [e, n] = t.split(".").map(Number);
-    return new D(e, n);
+    return new w(e, n);
   }
   /**
    * 查询与矩形相交的点
@@ -406,10 +427,10 @@ class G {
     const e = t.toBox(), n = Math.ceil(e.minX / this.gridSize), s = Math.ceil(e.maxX / this.gridSize), i = Math.ceil(e.minY / this.gridSize), r = Math.ceil(e.maxY / this.gridSize);
     for (let o = n; o <= s; o++)
       for (let a = i; a <= r; a++) {
-        const l = `${o}.${a}`;
-        if (!this.map.has(l)) continue;
-        this.map.get(l)?.forEach((c) => {
-          t.containsPoint(c.point);
+        const c = `${o}.${a}`;
+        if (!this.map.has(c)) continue;
+        this.map.get(c)?.forEach((h) => {
+          t.containsPoint(h.point);
         });
       }
   }
@@ -420,12 +441,12 @@ class G {
    * @returns 相交的节点数组
    */
   queryCircle(t, e) {
-    const n = new R(t.x - e, t.x + e, t.y - e, t.y + e), s = Math.ceil(n.minX / this.gridSize), i = Math.ceil(n.maxX / this.gridSize), r = Math.ceil(n.minY / this.gridSize), o = Math.ceil(n.maxY / this.gridSize), a = [];
-    for (let l = s; l <= i; l++)
-      for (let h = r; h <= o; h++) {
-        const c = `${l}.${h}`;
-        if (!this.map.has(c)) continue;
-        this.map.get(c)?.forEach((f) => {
+    const n = new I(t.x - e, t.x + e, t.y - e, t.y + e), s = Math.ceil(n.minX / this.gridSize), i = Math.ceil(n.maxX / this.gridSize), r = Math.ceil(n.minY / this.gridSize), o = Math.ceil(n.maxY / this.gridSize), a = [];
+    for (let c = s; c <= i; c++)
+      for (let l = r; l <= o; l++) {
+        const h = `${c}.${l}`;
+        if (!this.map.has(h)) continue;
+        this.map.get(h)?.forEach((f) => {
           t.distance(f.point) <= e && a.push(f);
         });
       }
@@ -440,10 +461,10 @@ class G {
     const e = Math.ceil(t.minX / this.gridSize), n = Math.ceil(t.maxX / this.gridSize), s = Math.ceil(t.minY / this.gridSize), i = Math.ceil(t.maxY / this.gridSize), r = [];
     for (let o = e; o <= n; o++)
       for (let a = s; a <= i; a++) {
-        const l = `${o}.${a}`;
-        if (!this.map.has(l)) continue;
-        this.map.get(l)?.forEach((c) => {
-          t.containsPoint(c.point) && r.push(c);
+        const c = `${o}.${a}`;
+        if (!this.map.has(c)) continue;
+        this.map.get(c)?.forEach((h) => {
+          t.containsPoint(h.point) && r.push(h);
         });
       }
     return r;
@@ -453,7 +474,7 @@ class G {
    * @param point 
    */
   queryPoint(t, e = !1) {
-    const n = [];
+    const n = new we();
     let s;
     if (t.currentData[this.id])
       s = t.currentData[this.id]?.set;
@@ -494,7 +515,7 @@ class G {
       if (t.size === 1) return [...t][0];
   }
 }
-function W(u) {
+function J(u) {
   if (!u || typeof u != "object")
     return u;
   const t = Array.isArray(u) ? [] : {}, e = Object.keys(u);
@@ -505,17 +526,17 @@ function W(u) {
       continue;
     }
     if (Array.isArray(s)) {
-      t[n] = s.map((i) => W(i));
+      t[n] = s.map((i) => J(i));
       continue;
     }
     if (Object.getPrototypeOf(s) === Object.prototype) {
-      t[n] = W(s);
+      t[n] = J(s);
       continue;
     }
   }
   return t;
 }
-class st {
+class nt {
   points;
   get p0() {
     return this.points[0];
@@ -538,7 +559,7 @@ class st {
   path2D(t) {
     return this.points.flatMap((e, n) => {
       const s = this.points[(n + 1) % this.points.length];
-      return t && t(new D(e.x, e.y), new D(s.x, s.y)), [e.x, e.y, s.x, s.y];
+      return t && t(new w(e.x, e.y), new w(s.x, s.y)), [e.x, e.y, s.x, s.y];
     });
   }
   createGeometry() {
@@ -566,14 +587,14 @@ class st {
       throw new Error("LineSegment must have exactly 2 points");
     const [e, n] = t.points, s = n.x - e.x, i = n.y - e.y;
     for (let r = 0; r < 4; r++) {
-      const o = this.points[r], a = this.points[(r + 1) % 4], l = a.x - o.x, h = a.y - o.y, c = s * h - i * l;
-      if (c === 0) {
-        if ((e.x - o.x) * h - (e.y - o.y) * l !== 0) continue;
-        const f = l * l + h * h, p = ((e.x - o.x) * l + (e.y - o.y) * h) / f, y = ((n.x - o.x) * l + (n.y - o.y) * h) / f;
+      const o = this.points[r], a = this.points[(r + 1) % 4], c = a.x - o.x, l = a.y - o.y, h = s * l - i * c;
+      if (h === 0) {
+        if ((e.x - o.x) * l - (e.y - o.y) * c !== 0) continue;
+        const f = c * c + l * l, p = ((e.x - o.x) * c + (e.y - o.y) * l) / f, y = ((n.x - o.x) * c + (n.y - o.y) * l) / f;
         if (Math.max(p, y) >= 0 && Math.min(p, y) <= 1)
           return !0;
       } else {
-        const d = ((o.x - e.x) * h - (o.y - e.y) * l) / c, f = ((o.x - e.x) * i - (o.y - e.y) * s) / c;
+        const d = ((o.x - e.x) * l - (o.y - e.y) * c) / h, f = ((o.x - e.x) * i - (o.y - e.y) * s) / h;
         if (d >= 0 && d <= 1 && f >= 0 && f <= 1)
           return !0;
       }
@@ -591,13 +612,13 @@ class st {
     const e = (n) => {
       let s = 0;
       for (let i = 0; i < 4; i++) {
-        const r = this.points[i], o = this.points[(i + 1) % 4], a = { x: o.x - r.x, y: o.y - r.y }, l = { x: n.x - r.x, y: n.y - r.y }, h = a.x * l.y - a.y * l.x;
-        if (h === 0) {
-          const c = a.x !== 0 ? (n.x - r.x) / a.x : (n.y - r.y) / a.y;
-          if (c >= 0 && c <= 1) return !0;
+        const r = this.points[i], o = this.points[(i + 1) % 4], a = { x: o.x - r.x, y: o.y - r.y }, c = { x: n.x - r.x, y: n.y - r.y }, l = a.x * c.y - a.y * c.x;
+        if (l === 0) {
+          const h = a.x !== 0 ? (n.x - r.x) / a.x : (n.y - r.y) / a.y;
+          if (h >= 0 && h <= 1) return !0;
         } else {
-          const c = h > 0 ? 1 : -1;
-          if (s === 0 && (s = c), s !== c) return !1;
+          const h = l > 0 ? 1 : -1;
+          if (s === 0 && (s = h), s !== h) return !1;
         }
       }
       return !0;
@@ -656,7 +677,7 @@ class st {
     let t = 1 / 0, e = -1 / 0, n = 1 / 0, s = -1 / 0;
     return this.points.forEach((i) => {
       e = Math.max(i.x, e), t = Math.min(i.x, t), s = Math.max(i.x, s), n = Math.min(i.x, n);
-    }), new R(t, e, n, s);
+    }), new I(t, e, n, s);
   }
   /**
    * 
@@ -665,16 +686,16 @@ class st {
    * @returns 
    */
   static fromByLineSegment(t, e = 0.1, n = !1, s = 0.5) {
-    const i = t.points[0], r = t.points[1], o = r.normal(i), a = n ? r.direction(i).mutiplyScalar(e * s) : D.zero(), l = n ? i.direction(r).mutiplyScalar(e * s) : D.zero(), h = o.x * e * 0.5, c = o.y * e * 0.5;
-    return new st([
-      new D(i.x + h, i.y + c).add(l),
-      new D(r.x + h, r.y + c).add(a),
-      new D(r.x - h, r.y - c).add(a),
-      new D(i.x - h, i.y - c).add(l)
+    const i = t.points[0], r = t.points[1], o = r.normal(i), a = n ? r.direction(i).mutiplyScalar(e * s) : w.zero(), c = n ? i.direction(r).mutiplyScalar(e * s) : w.zero(), l = o.x * e * 0.5, h = o.y * e * 0.5;
+    return new nt([
+      new w(i.x + l, i.y + h).add(c),
+      new w(r.x + l, r.y + h).add(a),
+      new w(r.x - l, r.y - h).add(a),
+      new w(i.x - l, i.y - h).add(c)
     ]);
   }
 }
-class O {
+class B {
   bounds;
   // 包围盒
   capacity;
@@ -700,7 +721,7 @@ class O {
    * @param node 线段节点
    */
   insert(t) {
-    if (t instanceof E) {
+    if (t instanceof D) {
       this.insert({ line: t, userData: {} });
       return;
     }
@@ -725,7 +746,7 @@ class O {
    * @param node 
    */
   remove(t) {
-    if (t instanceof E) {
+    if (t instanceof D) {
       t = t.currentData[this.id], t && this.remove(t);
       return;
     }
@@ -738,6 +759,11 @@ class O {
   update(t) {
     this.remove(t), this.insert(t);
   }
+  clear() {
+    this.isLeaf || (this.children?.forEach((t) => t.clear()), this.children = null, this.isLeaf = !0), this.nodes.forEach((t) => {
+      delete t.line.currentData[this.id];
+    }), this.nodes = [];
+  }
   /**
    * 获取线段所属的象限
    * @param line 线段
@@ -755,26 +781,26 @@ class O {
     if (!this.isLeaf) return;
     this.isLeaf = !1, this.children = [];
     const t = (this.bounds.minX + this.bounds.maxX) / 2, e = (this.bounds.minY + this.bounds.maxY) / 2;
-    this.children[0] = new O(
-      new R(this.bounds.minX, t, this.bounds.minY, e),
+    this.children[0] = new B(
+      new I(this.bounds.minX, t, this.bounds.minY, e),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
       this.id
-    ), this.children[1] = new O(
-      new R(t, this.bounds.maxX, this.bounds.minY, e),
+    ), this.children[1] = new B(
+      new I(t, this.bounds.maxX, this.bounds.minY, e),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
       this.id
-    ), this.children[2] = new O(
-      new R(this.bounds.minX, t, e, this.bounds.maxY),
+    ), this.children[2] = new B(
+      new I(this.bounds.minX, t, e, this.bounds.maxY),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
       this.id
-    ), this.children[3] = new O(
-      new R(t, this.bounds.maxX, e, this.bounds.maxY),
+    ), this.children[3] = new B(
+      new I(t, this.bounds.maxX, e, this.bounds.maxY),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
@@ -804,7 +830,7 @@ class O {
    * @returns 相交的节点数组
    */
   queryCircle(t, e) {
-    const n = [], s = new R(
+    const n = [], s = new I(
       t.x - e,
       t.x + e,
       t.y - e,
@@ -813,11 +839,11 @@ class O {
     if (!this.bounds.intersectBox(s))
       return n;
     for (const i of this.nodes) {
-      const [r, o] = i.line.points, a = o.x - r.x, l = o.y - r.y, h = a * a + l * l;
-      let c = ((t.x - r.x) * a + (t.y - r.y) * l) / h;
-      c = Math.max(0, Math.min(1, c));
-      const d = r.x + c * a, f = r.y + c * l;
-      t.distance(new D(d, f)) <= e && n.push(i);
+      const [r, o] = i.line.points, a = o.x - r.x, c = o.y - r.y, l = a * a + c * c;
+      let h = ((t.x - r.x) * a + (t.y - r.y) * c) / l;
+      h = Math.max(0, Math.min(1, h));
+      const d = r.x + h * a, f = r.y + h * c;
+      t.distance(new w(d, f)) <= e && n.push(i);
     }
     if (!this.isLeaf)
       for (const i of this.children)
@@ -885,13 +911,13 @@ class O {
     })), t;
   }
 }
-class E {
-  points = [new D(), new D()];
+class D {
+  points = [new w(), new w()];
   userData = {};
   currentData = {};
   // line: any
   get center() {
-    return new D(
+    return new w(
       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
     );
@@ -903,7 +929,7 @@ class E {
     return this.points[1];
   }
   id = 0;
-  constructor(t = new D(), e = new D()) {
+  constructor(t = new w(), e = new w()) {
     this.points = [t, e];
   }
   set(t, e) {
@@ -986,21 +1012,28 @@ class E {
     const n = t.clone().multiplyScalar(e);
     return this.start.add(n), this.end.add(n), this;
   }
+  /** 旋转
+   * @param angle 弧度
+   */
+  rotate(t) {
+    const e = this.center;
+    return this.start.rotate(e, t), this.end.rotate(e, t), this;
+  }
   /** 膨胀为矩形
    * 
    * @param width 
    * @returns {Rectangle}
    */
   expandToRectangle(t = 0.1, e = "all") {
-    const n = this.start, s = this.end, i = s.normal(n), r = e === "bothSides" ? D.zero() : s.direction(n).mutiplyScalar(t * 0.5), o = e === "bothSides" ? D.zero() : n.direction(s).mutiplyScalar(t * 0.5), a = i.x * t * 0.5, l = i.y * t * 0.5, h = [
+    const n = this.start, s = this.end, i = s.normal(n), r = e === "bothSides" ? w.zero() : s.direction(n).mutiplyScalar(t * 0.5), o = e === "bothSides" ? w.zero() : n.direction(s).mutiplyScalar(t * 0.5), a = i.x * t * 0.5, c = i.y * t * 0.5, l = [
       // 第一条线
-      new D(n.x + a, n.y + l).add(o),
-      new D(s.x + a, s.y + l).add(r),
+      new w(n.x + a, n.y + c).add(o),
+      new w(s.x + a, s.y + c).add(r),
       // 第二条线
-      new D(n.x - a, n.y - l).add(o),
-      new D(s.x - a, s.y - l).add(r)
+      new w(n.x - a, n.y - c).add(o),
+      new w(s.x - a, s.y - c).add(r)
     ];
-    return new st([0, 1, 3, 2].map((c) => h[c]));
+    return new nt([0, 1, 3, 2].map((h) => l[h]));
   }
   /**
    * 计算线段的长度
@@ -1037,24 +1070,24 @@ class E {
   projectLineSegment(t) {
     if (t.points.length !== 2 || this.points.length !== 2)
       throw new Error("每条线段必须由两个点定义");
-    const [e, n] = t.points, [s, i] = this.points, r = new D(i.x - s.x, i.y - s.y);
+    const [e, n] = t.points, [s, i] = this.points, r = new w(i.x - s.x, i.y - s.y);
     if (r.x === 0 && r.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
     const o = (p) => {
-      const y = new D(p.x - s.x, p.y - s.y), g = r.x * r.x + r.y * r.y, M = (y.x * r.x + y.y * r.y) / g, w = s.x + M * r.x, m = s.y + M * r.y;
-      return new D(w, m);
+      const y = new w(p.x - s.x, p.y - s.y), g = r.x * r.x + r.y * r.y, m = (y.x * r.x + y.y * r.y) / g, L = s.x + m * r.x, M = s.y + m * r.y;
+      return new w(L, M);
     };
-    let a = o(e), l = o(n);
-    const h = (p) => {
-      const y = new D(p.x - s.x, p.y - s.y), g = r.x * r.x + r.y * r.y;
+    let a = o(e), c = o(n);
+    const l = (p) => {
+      const y = new w(p.x - s.x, p.y - s.y), g = r.x * r.x + r.y * r.y;
       return (y.x * r.x + y.y * r.y) / g;
     };
-    let c = h(a), d = h(l);
+    let h = l(a), d = l(c);
     const f = (p) => {
       const y = Math.max(0, Math.min(1, p)), g = s.x + y * r.x, x = s.y + y * r.y;
-      return new D(g, x);
+      return new w(g, x);
     };
-    return (c < 0 || c > 1) && (a = f(c)), (d < 0 || d > 1) && (l = f(d)), a.x === l.x && a.y === l.y ? new E(a, a) : new E(a, l);
+    return (h < 0 || h > 1) && (a = f(h)), (d < 0 || d > 1) && (c = f(d)), a.x === c.x && a.y === c.y ? new D(a, a) : new D(a, c);
   }
   /**
    * 计算一条线段在另一条直线上的投影
@@ -1063,19 +1096,28 @@ class E {
    * @returns 投影并裁剪后的线段
    */
   projectPoint(t, e = !0) {
-    const [n, s] = this.points, i = new D(s.x - n.x, s.y - n.y);
+    const [n, s] = this.points, i = new w(s.x - n.x, s.y - n.y);
     if (i.x === 0 && i.y === 0)
       return null;
-    let o = ((h) => {
-      const c = new D(h.x - n.x, h.y - n.y), d = i.x * i.x + i.y * i.y, p = (c.x * i.x + c.y * i.y) / d, y = n.x + p * i.x, g = n.y + p * i.y;
-      return new D(y, g);
+    let o = ((l) => {
+      const h = new w(l.x - n.x, l.y - n.y), d = i.x * i.x + i.y * i.y, p = (h.x * i.x + h.y * i.y) / d, y = n.x + p * i.x, g = n.y + p * i.y;
+      return new w(y, g);
     })(t);
     if (!e) return o;
-    let l = ((h) => {
-      const c = new D(h.x - n.x, h.y - n.y), d = i.x * i.x + i.y * i.y;
-      return (c.x * i.x + c.y * i.y) / d;
+    let c = ((l) => {
+      const h = new w(l.x - n.x, l.y - n.y), d = i.x * i.x + i.y * i.y;
+      return (h.x * i.x + h.y * i.y) / d;
     })(o);
-    return l < 0 || l > 1 ? null : o;
+    return c < 0 || c > 1 ? null : o;
+  }
+  /** 获取点的投影值
+   */
+  projectValue(t) {
+    const [e, n] = this.points, s = new w(n.x - e.x, n.y - e.y);
+    if (s.x === 0 && s.y === 0)
+      return 0;
+    const i = new w(t.x - e.x, t.y - e.y), r = s.x * s.x + s.y * s.y;
+    return (i.x * s.x + i.y * s.y) / r;
   }
   /**
    * 判断两条线段，是否在同一直线上：
@@ -1084,7 +1126,7 @@ class E {
    *  - 返回 1：共线且有重合（端点或区间重叠）
    */
   sameLine(t) {
-    const e = this.start, n = this.end, s = t.start, i = t.end, r = 1e-10, o = (a, l, h) => Math.abs((l.x - a.x) * (h.y - a.y) - (l.y - a.y) * (h.x - a.x)) < r;
+    const e = this.start, n = this.end, s = t.start, i = t.end, r = 1e-10, o = (a, c, l) => Math.abs((c.x - a.x) * (l.y - a.y) - (c.y - a.y) * (l.x - a.x)) < r;
     return o(e, n, s) && o(e, n, i) ? this.containsPoint(s) || this.containsPoint(i) || t.containsPoint(e) || t.containsPoint(n) ? 1 : 0 : -1;
   }
   /**
@@ -1101,8 +1143,8 @@ class E {
     function a(f, p, y) {
       return Math.min(p.x, y.x) - 1e-10 <= f.x && f.x <= Math.max(p.x, y.x) + 1e-10 && Math.min(p.y, y.y) - 1e-10 <= f.y && f.y <= Math.max(p.y, y.y) + 1e-10;
     }
-    const l = o(n, s, i), h = o(n, s, r), c = o(i, r, n), d = o(i, r, s);
-    return !!(l * h < 0 && c * d < 0 || e && (Math.abs(l) < 1e-10 && a(i, n, s) || Math.abs(h) < 1e-10 && a(r, n, s) || Math.abs(c) < 1e-10 && a(n, i, r) || Math.abs(d) < 1e-10 && a(s, i, r)));
+    const c = o(n, s, i), l = o(n, s, r), h = o(i, r, n), d = o(i, r, s);
+    return !!(c * l < 0 && h * d < 0 || e && (Math.abs(c) < 1e-10 && a(i, n, s) || Math.abs(l) < 1e-10 && a(r, n, s) || Math.abs(h) < 1e-10 && a(n, i, r) || Math.abs(d) < 1e-10 && a(s, i, r)));
   }
   /**
    * 判断一个点是否在线段上（含端点）
@@ -1122,8 +1164,8 @@ class E {
     const e = this.start, n = this.end, s = t.start, i = t.end, r = (e.x - n.x) * (s.y - i.y) - (e.y - n.y) * (s.x - i.x);
     if (Math.abs(r) < 1e-10)
       return null;
-    const o = ((e.x - s.x) * (s.y - i.y) - (e.y - s.y) * (s.x - i.x)) / r, a = e.x + o * (n.x - e.x), l = e.y + o * (n.y - e.y);
-    return new D(a, l);
+    const o = ((e.x - s.x) * (s.y - i.y) - (e.y - s.y) * (s.x - i.x)) / r, a = e.x + o * (n.x - e.x), c = e.y + o * (n.y - e.y);
+    return new w(a, c);
   }
   /**
    * 获取两条线段夹角
@@ -1145,7 +1187,7 @@ class E {
    * @param line 
    */
   parallel(t, e = 1) {
-    return t instanceof E ? this.parallel(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), t < e || t > 180 - e);
+    return t instanceof D ? this.parallel(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), t < e || t > 180 - e);
   }
   /** 两条线段或角度是否 垂直
    * @param line 
@@ -1153,7 +1195,7 @@ class E {
    * @returns 
    */
   vertical(t, e = 0.1) {
-    return t instanceof E ? this.vertical(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), Math.abs(t - 90) < e);
+    return t instanceof D ? this.vertical(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), Math.abs(t - 90) < e);
   }
   /**
    * 两条线段方向相反否一致
@@ -1180,14 +1222,14 @@ class E {
    * @returns 
    */
   getRightDirection() {
-    return this.normal();
+    return this.normal().multiplyScalar(-1);
   }
   /**
    * 
    * @returns 
    */
   getLeftDirection() {
-    return this.normal().multiplyScalar(-1);
+    return this.normal();
   }
   /** @param line 获取两条线段之间的最短距离
    */
@@ -1195,17 +1237,17 @@ class E {
     if (this.intersectLineSegment(t))
       return 0;
     const e = (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)
+      const i = s.start, r = s.end, o = r.x - i.x, a = r.y - i.y, c = o * o + a * a;
+      if (c < 1e-10)
         return n.distance(i);
-      const h = ((n.x - i.x) * o + (n.y - i.y) * a) / l;
-      if (h < 0)
+      const l = ((n.x - i.x) * o + (n.y - i.y) * a) / c;
+      if (l < 0)
         return n.distance(i);
-      if (h > 1)
+      if (l > 1)
         return n.distance(r);
       {
-        const c = i.x + h * o, d = i.y + h * a;
-        return n.distance(new D(c, d));
+        const h = i.x + l * o, d = i.y + l * a;
+        return n.distance(new w(h, d));
       }
     };
     return Math.min(
@@ -1221,18 +1263,18 @@ class E {
    * @returns 
    */
   areLinesCoincident(t) {
-    const e = this.start, n = this.end, s = t.start, i = t.end, r = (n.y - e.y) / (n.x - e.x), o = e.y - r * e.x, a = (i.y - s.y) / (i.x - s.x), l = s.y - a * s.x;
-    return !isFinite(r) && !isFinite(a) ? e.x === s.x && n.x === s.x : Math.abs(r - a) < 1e-3 && Math.abs(o - l) < 1e-3;
+    const e = this.start, n = this.end, s = t.start, i = t.end, r = (n.y - e.y) / (n.x - e.x), o = e.y - r * e.x, a = (i.y - s.y) / (i.x - s.x), c = s.y - a * s.x;
+    return !isFinite(r) && !isFinite(a) ? e.x === s.x && n.x === s.x : Math.abs(r - a) < 1e-3 && Math.abs(o - c) < 1e-3;
   }
   /** 克隆
    * @returns 
    */
   clone() {
-    const t = new E(
+    const t = new D(
       this.points[0].clone(),
       this.points[1].clone()
     );
-    return t.userData = W(this.userData), t;
+    return t.userData = J(this.userData), t;
   }
   /**
    * 获取最长线段
@@ -1251,29 +1293,29 @@ class E {
    * @param lines 
    */
   static groupBySamePointAndParallel(t) {
-    const e = new G(), n = new O(R.fromByLineSegment(...t));
+    const e = new Y(), n = new B(I.fromByLineSegment(...t));
     t.forEach((o) => {
       o.points.forEach((a) => e.insert(a, o)), n.insert(o);
     });
     const s = /* @__PURE__ */ new Set();
-    function i(o, a, l) {
+    function i(o, a, c) {
       if (a.has(o)) return;
-      const h = [];
-      return h.push(
-        ...e.queryPoint(o.start).filter((c) => c.userData !== o && o.parallel(c.userData, 0.1)).map((c) => c.userData),
-        ...e.queryPoint(o.end).filter((c) => c.userData !== o && o.parallel(c.userData, 0.1)).map((c) => c.userData),
-        ...n.queryPoint(o.start).filter((c) => c.line !== o && o.parallel(c.line, 0.1)).map((c) => c.line),
-        ...n.queryPoint(o.end).filter((c) => c.line !== o && o.parallel(c.line, 0.1)).map((c) => c.line)
-      ), h.forEach((c) => {
-        c && !l.has(c) && (l.add(c), i(c, a, l));
-      }), a.add(o), l;
+      const l = [];
+      return l.push(
+        ...e.queryPoint(o.start).filter((h) => h.userData !== o && o.parallel(h.userData, 0.1)).map((h) => h.userData),
+        ...e.queryPoint(o.end).filter((h) => h.userData !== o && o.parallel(h.userData, 0.1)).map((h) => h.userData),
+        ...n.queryPoint(o.start).filter((h) => h.line !== o && o.parallel(h.line, 0.1)).map((h) => h.line),
+        ...n.queryPoint(o.end).filter((h) => h.line !== o && o.parallel(h.line, 0.1)).map((h) => h.line)
+      ), l.forEach((h) => {
+        h && !c.has(h) && (c.add(h), i(h, a, c));
+      }), a.add(o), c;
     }
     const r = [];
     for (let o = 0; o < t.length; o++) {
       const a = t[o];
       if (s.has(a)) continue;
-      const l = i(a, s, /* @__PURE__ */ new Set([a]));
-      l && r.push([...l]);
+      const c = i(a, s, /* @__PURE__ */ new Set([a]));
+      c && r.push([...c]);
     }
     return r;
   }
@@ -1295,17 +1337,17 @@ class E {
    */
   static mergeLinesByMaxlength(...t) {
     if (t.length === 1) return t[0];
-    const n = t.slice(0).sort((c, d) => d.length() - c.length())[0], s = n.direction().normalize();
+    const n = t.slice(0).sort((h, d) => d.length() - h.length())[0], s = n.direction().normalize();
     let i = n.start.clone(), r = n.end.clone();
-    const o = (c) => c.x * s.x + c.y * s.y;
-    let a = o(i), l = o(r);
-    for (const c of t)
-      for (const d of c.points) {
+    const o = (h) => h.x * s.x + h.y * s.y;
+    let a = o(i), c = o(r);
+    for (const h of t)
+      for (const d of h.points) {
         const f = o(d);
-        f < a && (a = f, i = n.projectPoint(d, !1)), f > l && (l = f, r = n.projectPoint(d, !1));
+        f < a && (a = f, i = n.projectPoint(d, !1)), f > c && (c = f, r = n.projectPoint(d, !1));
       }
-    const h = new E(i, r);
-    return t.forEach((c) => c.userData.fittedLine = h), h;
+    const l = new D(i, r);
+    return t.forEach((h) => h.userData.fittedLine = l), l;
   }
   /** 合并平行线段
    * @param lines
@@ -1323,7 +1365,7 @@ class E {
       const y = p.x * s.x + p.y * s.y;
       i = Math.min(i, y), r = Math.max(r, y), o += p.x, a += p.y;
     });
-    const l = new D(o / n.length, a / n.length), h = l.x * s.x + l.y * s.y, c = new D(l.x + (i - h) * s.x, l.y + (i - h) * s.y), d = new D(l.x + (r - h) * s.x, l.y + (r - h) * s.y), f = new E(c, d);
+    const c = new w(o / n.length, a / n.length), l = c.x * s.x + c.y * s.y, h = new w(c.x + (i - l) * s.x, c.y + (i - l) * s.y), d = new w(c.x + (r - l) * s.x, c.y + (r - l) * s.y), f = new D(h, d);
     return t.forEach((p) => p.userData.fittedLine = f), f;
   }
   /** 合并满足平行的线段
@@ -1348,38 +1390,38 @@ class E {
    */
   static brokenLineMerging(t, e) {
     const n = /* @__PURE__ */ new Map();
-    t.forEach((l) => l.points.forEach((h) => {
-      const c = `${h.X.toFixed(6)}_${h.Y.toFixed(6)}`;
-      n.has(c) || n.set(c, []), n.get(c)?.push(l);
+    t.forEach((c) => c.points.forEach((l) => {
+      const h = `${l.X.toFixed(6)}_${l.Y.toFixed(6)}`;
+      n.has(h) || n.set(h, []), n.get(h)?.push(c);
     }));
     const s = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map();
-    function r(l) {
-      const h = i.get(l[0]), c = i.get(l[1]);
+    function r(c) {
+      const l = i.get(c[0]), h = i.get(c[1]);
       let d;
-      if (h && c) {
-        d = h;
-        const p = s.get(h);
-        [...s.get(c)].forEach((g) => {
+      if (l && h) {
+        d = l;
+        const p = s.get(l);
+        [...s.get(h)].forEach((g) => {
           p.add(g), i.set(g, d);
         });
-      } else d = h ?? c ?? (Math.random() * 16777215).toString(16);
+      } else d = l ?? h ?? (Math.random() * 16777215).toString(16);
       s.has(d) || s.set(d, /* @__PURE__ */ new Set());
       const f = s.get(d);
-      l.forEach((p) => {
+      c.forEach((p) => {
         i.set(p, d), f?.add(p);
       });
     }
-    for (const l of n.values()) {
-      if (l.length !== 2) continue;
-      const h = l[0], c = l[1];
-      h.parallel(c) && r(l);
+    for (const c of n.values()) {
+      if (c.length !== 2) continue;
+      const l = c[0], h = c[1];
+      l.parallel(h) && r(c);
     }
     const o = /* @__PURE__ */ new Set(), a = [];
-    for (const l of s.values()) {
-      const h = [...l], c = this.mergeLines(...h);
-      e && e(c, h), h.forEach((d) => o.add(d)), a.push(c);
+    for (const c of s.values()) {
+      const l = [...c], h = this.mergeLines(...l);
+      e && e(h, l), l.forEach((d) => o.add(d)), a.push(h);
     }
-    return t = t.filter((l) => !o.has(l)), t.push(...a), t;
+    return t = t.filter((c) => !o.has(c)), t.push(...a), t;
   }
   /** 去重
    * @param lines 
@@ -1388,8 +1430,8 @@ class E {
   static deduplication(t) {
     const e = /* @__PURE__ */ new Set(), n = [];
     for (const s of t) {
-      const i = s.start, r = s.end, o = `${i.x.toFixed(10)}_${i.y.toFixed(10)}`, a = `${r.x.toFixed(10)}_${r.y.toFixed(10)}`, l = o < a ? `${o}_${a}` : `${a}_${o}`;
-      e.has(l) || (e.add(l), n.push(s));
+      const i = s.start, r = s.end, o = `${i.x.toFixed(10)}_${i.y.toFixed(10)}`, a = `${r.x.toFixed(10)}_${r.y.toFixed(10)}`, c = o < a ? `${o}_${a}` : `${a}_${o}`;
+      e.has(c) || (e.add(c), n.push(s));
     }
     return n;
   }
@@ -1399,7 +1441,7 @@ class E {
    * @returns 
    */
   static clipping(t, e, n) {
-    if (!(t instanceof E)) throw new Error("参数1并非线段");
+    if (!(t instanceof D)) throw new Error("参数1并非线段");
     e = e.map((r) => t.projectPoint(r)).filter((r) => !!r);
     const s = t.clone();
     e.sort((r, o) => s.start.distance(r) - s.start.distance(o));
@@ -1418,7 +1460,7 @@ class E {
     return this.clipping(t, [s, i].filter((o) => !!o), n).filter((o) => !(e.projectLineSegment(o).length() / e.length() > 0.8));
   }
 }
-class D {
+class w {
   x;
   y;
   get X() {
@@ -1545,7 +1587,7 @@ class D {
    */
   normal(t) {
     const e = this.x - t.x, n = this.y - t.y, s = Math.sqrt(e * e + n * n), i = -n / s, r = e / s;
-    return new D(i, r);
+    return new w(i, r);
   }
   /**
    * 获取由传入的点到该点的单位方向向量
@@ -1555,14 +1597,14 @@ class D {
    */
   direction(t) {
     const e = this.x - t.x, n = this.y - t.y, s = Math.sqrt(e * e + n * n);
-    return s === 0 ? new D(0, 0) : new D(e / s, n / s);
+    return s === 0 ? new w(0, 0) : new w(e / s, n / s);
   }
   /** 展开为线
    * @param direction 
    * @param length 
    */
   expandAsLine(t, e, n) {
-    const s = new E(
+    const s = new D(
       this.clone(),
       this.clone().add(t.clone().multiplyScalar(e))
     );
@@ -1637,7 +1679,7 @@ class D {
    * @returns 
    */
   clone() {
-    return new D(this.x, this.y);
+    return new w(this.x, this.y);
   }
   /**
    * 克隆
@@ -1654,13 +1696,13 @@ class D {
     };
   }
   static from(t) {
-    return Array.isArray(t) ? new D(t[0], t[1]) : "x" in t && "y" in t ? new D(t.x, t.y) : "X" in t && "Y" in t ? new D(t.X, t.Y) : this.zero();
+    return Array.isArray(t) ? new w(t[0], t[1]) : "x" in t && "y" in t ? new w(t.x, t.y) : "X" in t && "Y" in t ? new w(t.X, t.Y) : this.zero();
   }
   static zero() {
-    return new D(0, 0);
+    return new w(0, 0);
   }
 }
-async function X(u, t = !0) {
+async function H(u, t = !0) {
   if (typeof global < "u" && typeof require < "u")
     return require(u);
   {
@@ -1671,67 +1713,69 @@ async function X(u, t = !0) {
     return t && (e = e.default), e;
   }
 }
-function Ct(u, t = 0, e, n) {
+function Bt(u, t = 0, e, n) {
   const s = u.userData, i = s.drawWindow, r = e ? e.queryLineSegment(u).filter((a) => a.line !== u && !a.userData?.isDoor).map((a) => ({ index: n?.indexOf(a.line) })) : [];
   return {
-    ...W(s),
+    ...J(s),
     start: u.start.toJson(t),
     end: u.end.toJson(t),
     insetionArr: r,
     length: u.length(),
     drawWindow: i && i.map((a) => ({
-      ...W(a),
+      ...J(a),
       p: { x: a.p.x, y: a.p.y, z: a.p.z }
     }))
   };
 }
 function et(u, t = 0, e) {
-  return e || (e = new O(R.fromByLineSegment(...u)), u.forEach((n) => e?.insert({ line: n, userData: void 0 }))), u.map((n) => Ct(n, t, e, u));
+  return e || (e = new B(I.fromByLineSegment(...u)), u.forEach((n) => e?.insert({ line: n, userData: void 0 })), Promise.resolve().then(() => e?.clear())), u.map((n) => Bt(n, t, e, u));
 }
-function at(u, t = 0.03) {
-  const e = new O(R.fromByLineSegment(...u));
-  return u.forEach((n) => e.insert({ line: n, userData: void 0 })), u.flatMap((n) => {
-    const s = e.queryLineSegment(n, !0).map((i) => {
-      if (i.line === n) return;
-      const r = i.line.getIntersection(n);
-      if (!(!r || n.start.equal(r) || n.end.equal(r)))
-        return r;
-    }).filter((i) => !!i);
-    if (s.length) {
-      const i = n.clone();
-      s.sort((o, a) => i.start.distance(o) - i.start.distance(a));
-      const r = s.map((o) => {
-        const a = i.clone();
-        return a.set(i.start.clone(), o), i.start.copy(o), i.userData.isWindow && (a.userData.isWindow = !0, a.userData.drawWindow = i.userData.drawWindow?.filter((l) => a.isPointOnSegment(D.from(l.p))) ?? []), a;
+function ft(u, t = 0.03) {
+  const e = new B(I.fromByLineSegment(...u));
+  u.forEach((s) => e.insert({ line: s, userData: void 0 }));
+  const n = u.flatMap((s) => {
+    const i = e.queryLineSegment(s, !0).map((r) => {
+      if (r.line === s) return;
+      const o = r.line.getIntersection(s);
+      if (!(!o || s.start.equal(o) || s.end.equal(o)))
+        return o;
+    }).filter((r) => !!r);
+    if (i.length) {
+      const r = s.clone();
+      i.sort((a, c) => r.start.distance(a) - r.start.distance(c));
+      const o = i.map((a) => {
+        const c = r.clone();
+        return c.set(r.start.clone(), a), r.start.copy(a), r.userData.isWindow && (c.userData.isWindow = !0, c.userData.drawWindow = r.userData.drawWindow?.filter((l) => c.isPointOnSegment(w.from(l.p))) ?? []), c;
       });
-      return i.userData.drawWindow = i.userData.drawWindow?.filter((o) => i.isPointOnSegment(D.from(o.p))) ?? [], [...r, i];
+      return r.userData.drawWindow = r.userData.drawWindow?.filter((a) => r.isPointOnSegment(w.from(a.p))) ?? [], [...o, r];
     }
-    return n;
-  }).filter((n) => n.length() >= t);
+    return s;
+  }).filter((s) => s.length() >= t);
+  return e.clear(), n;
 }
-function V(...u) {
+function X(...u) {
   u.forEach((t) => {
     const e = t.direction();
     t.userData.drawWindow?.forEach((n) => {
       try {
-        const s = D.from(n.p), i = t.projectPoint(
+        const s = w.from(n.p), i = t.projectPoint(
           s.clone().add(e.clone().multiplyScalar(n.width * 0.5)),
           !1
         ), r = t.projectPoint(
           s.clone().add(e.clone().multiplyScalar(n.width * -0.5)),
           !1
-        ), o = t.projectLineSegment(new E(i, r)), a = o.center;
+        ), o = t.projectLineSegment(new D(i, r)), a = o.center;
         n.p = {
           x: a?.x ?? 0,
           y: a?.y ?? 0,
           z: n.p.z
-        };
+        }, n.width = o.length();
       } catch {
       }
-    });
+    }), t.userData.drawWindow = t.userData.drawWindow?.filter((n) => n.width > 1e-9);
   });
 }
-function Nt(u) {
+function Ot(u) {
   if (u.length < 3) return 0;
   let t = 0;
   const e = u.length;
@@ -1741,13 +1785,13 @@ function Nt(u) {
   }
   return Math.abs(t) / 2;
 }
-function J(u) {
-  const t = new G();
+function V(u) {
+  const t = new Y();
   for (const e of u)
     t.insert(e.start, e), t.insert(e.end, e);
   return t;
 }
-class ye extends Map {
+class Me extends Map {
   get valueArray() {
     return [...this.values()];
   }
@@ -1793,7 +1837,7 @@ class ye extends Map {
     return t.every((e) => this.has(e));
   }
   group(t) {
-    const e = new nt();
+    const e = new at();
     for (const [n, s] of this) {
       const i = t(s, n);
       e.append(i, s);
@@ -1804,35 +1848,35 @@ class ye extends Map {
     return this.reduce((t, e, n) => (t[`${n}`] = e, t), {});
   }
 }
-class nt extends ye {
+class at extends Me {
   append(t, ...e) {
     return e.forEach((n) => {
       this.has(t) || this.set(t, []), this.get(t)?.push(n);
     }), this;
   }
 }
-function Bt(u, t, e, n = !0) {
+function De(u, t, e, n = !0) {
   e = e ?? /* @__PURE__ */ new Set();
-  const s = t || J(u);
-  function i(r) {
-    if (!(r instanceof E) || e?.has(r)) return;
-    const o = s?.queryPoint(r.start, !0), a = s?.queryPoint(r.end, !0);
-    o && a && (o?.length === 0 || a?.length === 0) && (e?.add(r), s.remove(r.start), s.remove(r.end), n && (o.forEach(({ userData: l }) => i(l)), a.forEach(({ userData: l }) => i(l))));
+  const s = !!t, i = t || V(u);
+  function r(o) {
+    if (!(o instanceof D) || e?.has(o)) return;
+    const a = i?.queryPoint(o.start, !0), c = i?.queryPoint(o.end, !0);
+    a && c && (a?.length === 0 || c?.length === 0) && (e?.add(o), i.remove(o.start), i.remove(o.end), n && (a.forEach(({ userData: l }) => r(l)), c.forEach(({ userData: l }) => r(l))));
   }
-  for (let r = 0; r < u.length; r++) {
-    const o = u[r];
-    i(o);
+  for (let o = 0; o < u.length; o++) {
+    const a = u[o];
+    r(a);
   }
-  return e;
+  return s || i.clear(), e;
 }
-function Ot(u, t) {
-  const e = t || J(u);
+function jt(u, t) {
+  const e = t || V(u);
   function n(r, o, a) {
-    e.queryPoint(r, !0).forEach((h) => {
-      const c = h.userData;
-      if (a.has(c)) return;
-      a.add(c), o.push(c);
-      const d = c.getAnotherPoint(h.point);
+    e.queryPoint(r, !0).forEach((l) => {
+      const h = l.userData;
+      if (a.has(h)) return;
+      a.add(h), o.push(h);
+      const d = h.getAnotherPoint(l.point);
       n(d, o, a);
     });
   }
@@ -1845,36 +1889,36 @@ function Ot(u, t) {
   }
   return i;
 }
-function xe(u, t = /* @__PURE__ */ new Set(), e) {
-  const n = e ?? J(u), s = /* @__PURE__ */ new Set();
+function Le(u, t = /* @__PURE__ */ new Set(), e) {
+  const n = e ?? V(u), s = /* @__PURE__ */ new Set();
   let i = 0;
-  function r(a, l, h, c = /* @__PURE__ */ new Set()) {
-    const d = a.getAnotherPoint(l);
-    if (h.length > 1 && d.equal(h[0].end)) return !1;
+  function r(a, c, l, h = /* @__PURE__ */ new Set()) {
+    const d = a.getAnotherPoint(c);
+    if (l.length > 1 && d.equal(l[0].end)) return !1;
     const f = n.queryPoint(d, !0);
     for (let p = 0; p < f.length; p++) {
       const y = f[p].userData, g = f[p].point;
-      if (y === h[0]) {
+      if (y === l[0]) {
         if (y.end === g) continue;
         return !0;
       }
-      if (!c.has(y)) {
-        if (h.push(y), c.add(y), r(y, g, h, c)) return !0;
-        h.pop();
+      if (!h.has(y)) {
+        if (l.push(y), h.add(y), r(y, g, l, h)) return !0;
+        l.pop();
       }
     }
   }
   for (i = 0; i < u.length; i++) {
     const a = u[i];
     if (s.has(a)) continue;
-    const l = [a];
-    r(a, a.start, l) ? l.forEach((h) => s.add(h)) : (t.add(a), n.remove(a.start), n.remove(a.end));
+    const c = [a];
+    r(a, a.start, c) ? c.forEach((l) => s.add(l)) : (t.add(a), n.remove(a.start), n.remove(a.end));
   }
   const o = u.length;
-  return u = u.filter((a) => !t.has(a)), o !== u.length ? Ot(u) : [u];
+  return u = u.filter((a) => !t.has(a)), o !== u.length ? jt(u) : [u];
 }
-function me(u) {
-  const t = J(u), e = u[0].start, n = /* @__PURE__ */ new Set();
+function Se(u) {
+  const t = V(u), e = u[0].start, n = /* @__PURE__ */ new Set();
   let s = e;
   for (n.add(s); ; ) {
     const i = t.queryPoint(s, !0);
@@ -1885,42 +1929,42 @@ function me(u) {
   }
   return n.add(e.clone()), [...n];
 }
-function we(u, t) {
-  const e = J(u), n = [], s = /* @__PURE__ */ new Set(), i = performance.now();
-  function r(h, c = [], d) {
-    if (performance.now() - i > 200)
+function Ee(u) {
+  const t = V(u), e = [], n = /* @__PURE__ */ new Set(), s = performance.now();
+  function i(c, l = [], h) {
+    if (performance.now() - s > 200)
       return;
-    let f = h.start;
-    d && (f = h.getAnotherPoint(d)), e.queryPoint(f, !0).forEach((y) => {
-      const g = y.userData;
-      if (c.includes(g)) {
-        if (c[0] === g) {
-          const x = [...c];
-          n.push(x), x.forEach((M) => s.add(M));
+    let d = c.start;
+    h && (d = c.getAnotherPoint(h)), t.queryPoint(d, !0).forEach((p) => {
+      const y = p.userData;
+      if (l.includes(y)) {
+        if (l[0] === y) {
+          const g = [...l];
+          e.push(g), g.forEach((x) => n.add(x));
         }
         return;
       }
-      c.push(g), r(g, c, y.point), c.pop();
+      l.push(y), i(y, l, p.point), l.pop();
     });
   }
-  for (let h = 0; h < u.length; h++) {
-    const c = u[h];
-    s.has(c) || r(c, [c]);
+  for (let c = 0; c < u.length; c++) {
+    const l = u[c];
+    n.has(l) || i(l, [l]);
   }
-  let o = 0, a = [];
-  n.forEach((h) => {
-    const c = me(h), d = Nt(c);
-    d >= o && (o = d, a = h);
+  let r = 0, o = [];
+  e.forEach((c) => {
+    const l = Se(c), h = Ot(l);
+    h >= r && (r = h, o = c);
   });
-  const l = Date.now().toString(16) + "-" + Math.floor(Math.random() * 16777215).toString(16).padStart(6, "0");
-  return a.forEach((h) => Object.assign(h.userData, { groupId: l, groupType: "doubleWall" })), a;
+  const a = Date.now().toString(16) + "-" + Math.floor(Math.random() * 16777215).toString(16).padStart(6, "0");
+  return o.forEach((c) => Object.assign(c.userData, { groupId: a, groupType: "doubleWall" })), t.clear(), o;
 }
-function jt(u) {
+function Ft(u) {
   if (u.length === 0) return { lines: u, groups: [], removeLines: [] };
-  const t = J(u), e = Bt(u, t);
+  const t = V(u), e = De(u, t);
   let n = u.filter((i) => !e.has(i));
-  const s = Ot(n, t).flatMap((i) => xe(i, e, t)).map((i) => we(i));
-  return u = [...e, ...s.flat()], {
+  const s = jt(n, t).flatMap((i) => Le(i, e, t)).map((i) => Ee(i));
+  return u = [...e, ...s.flat()], t.clear(), {
     removeLines: [...e],
     groups: s,
     lines: u
@@ -1934,14 +1978,14 @@ function $(u, t) {
     n[s] === void 0 && delete n[s];
   }), e && (u.userData.drawWindow || (u.userData.drawWindow = []), u.userData.drawWindow.push(...e)), Object.assign(u.userData, n);
 }
-function Ft(u, t) {
+function qt(u, t) {
   const { drawWindow: e, ...n } = t.userData;
   e && (u.userData.drawWindow || (u.userData.drawWindow = []), e.forEach((s) => {
-    const i = D.from(s.p);
+    const i = w.from(s.p);
     u.projectPoint(i) && u.userData.drawWindow?.push(s);
-  }), V(u)), Object.assign(u.userData, n);
+  }), X(u)), Object.assign(u.userData, n);
 }
-class Me {
+class Ae {
   static errorAngle = 4;
   /** 线段投影分析
    * @param index 
@@ -1952,23 +1996,23 @@ class Me {
   static projectionAnalysis(t, e, n, s) {
     const i = s[t], r = n.direction(), o = i.direction(), a = r.angleBetween(o) / (Math.PI / 180);
     if (a < this.errorAngle || a > 180 - this.errorAngle) {
-      let l;
-      const h = i.projectLineSegment(n), c = n.projectLineSegment(i);
-      return h.getLength() > c.getLength() ? l = {
+      let c;
+      const l = i.projectLineSegment(n), h = n.projectLineSegment(i);
+      return l.getLength() > h.getLength() ? c = {
         target: i,
         targetIndex: t,
         source: n,
         sourceIndex: e,
-        project: h,
-        project2: c
-      } : l = {
+        project: l,
+        project2: h
+      } : c = {
         target: n,
         targetIndex: e,
         source: i,
         sourceIndex: t,
-        project: c,
-        project2: h
-      }, !l || l.project.getLength() < 0.2 || l.project2.getLength() < 0.2 ? void 0 : l;
+        project: h,
+        project2: l
+      }, !c || c.project.getLength() < 0.08 || c.project2.getLength() < 0.08 ? void 0 : c;
     }
   }
   /**
@@ -1978,14 +2022,14 @@ class Me {
    * @returns 
    */
   static complementSide(t, e = 0.4) {
-    const n = t.filter((c) => !c.userData.isDoor && !c.userData.groupId), s = /* @__PURE__ */ new Set(), i = [];
-    let r = new O(R.fromByLineSegment(...n));
-    n.forEach((c, d) => r.insert({ line: c, userData: d })), n.forEach((c, d) => {
-      const f = st.fromByLineSegment(c, e * 2, !1, -0.01);
+    const n = t.filter((h) => !h.userData.isDoor && !h.userData.groupId), s = /* @__PURE__ */ new Set(), i = [];
+    let r = new B(I.fromByLineSegment(...n));
+    n.forEach((h, d) => r.insert({ line: h, userData: d })), n.forEach((h, d) => {
+      const f = nt.fromByLineSegment(h, e * 2, !1, -0.01);
       r.queryRect(f).map((y) => y.userData).filter((y) => y !== d).forEach((y) => {
         try {
           if (s.has(`${d}-${y}`) || s.has(`${y}-${d}`)) return;
-          const g = this.projectionAnalysis(y, d, c, n);
+          const g = this.projectionAnalysis(y, d, h, n);
           g && i.push(g), s.add(`${d}-${y}`);
         } catch (g) {
           console.log(g);
@@ -1993,33 +2037,81 @@ class Me {
       });
     });
     let o = [];
-    const a = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Map();
-    function h(c, d) {
-      l.has(c) || l.set(c, []);
-      const f = c.projectPoint(d.start), p = c.projectPoint(d.end), y = l.get(c);
-      f && y.push(f), p && y.push(p), a.add(c), r.remove(c);
+    const a = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Map();
+    function l(h, d) {
+      c.has(h) || c.set(h, []);
+      const f = h.projectPoint(d.start), p = h.projectPoint(d.end), y = c.get(h);
+      f && y.push(f), p && y.push(p), a.add(h), r.remove(h);
     }
-    return i.forEach((c) => {
-      const d = c.project, f = c.project2, p = c.source, y = c.target;
+    return i.forEach((h) => {
+      const d = h.project, f = h.project2, p = h.source, y = h.target;
       d.includedAngle(f) > 135 && (f.points = [f.points[1], f.points[0]]);
-      const g = new E(d.start.clone(), f.start.clone()), x = new E(d.end.clone(), f.end.clone());
-      o.push(g, x), h(p, d), h(y, f);
-    }), l.forEach((c, d) => {
-      const f = E.clipping(d, c, Ft);
+      const g = new D(d.start.clone(), f.start.clone()), x = new D(d.end.clone(), f.end.clone());
+      o.push(g, x), l(p, d), l(y, f);
+    }), c.forEach((h, d) => {
+      const f = D.clipping(d, h, qt);
       t.push(...f);
-    }), t = t.filter((c) => !a.has(c)), r = new O(R.fromByLineSegment(...t)), t.forEach((c) => c.userData.isDoor || r.insert(c)), o = E.autoMergeLines(o).lines, o = o.filter((c) => c.length() !== 0).map((c) => {
-      const d = r.queryLineSegment(c).filter((p) => !(!p.line.parallel(c) || p.line.projectLineSegment(c).length() === 0)).map((p) => p.line);
+    }), t = t.filter((h) => !a.has(h)), r.clear(), r = new B(I.fromByLineSegment(...t)), t.forEach((h) => h.userData.isDoor || r.insert(h)), o = D.autoMergeLines(o).lines, o = o.filter((h) => h.length() !== 0).map((h) => {
+      const d = r.queryLineSegment(h).filter((p) => !(!p.line.parallel(h) || p.line.projectLineSegment(h).length() === 0)).map((p) => p.line);
       if (d.length === 0)
-        return r.insert(c), c;
-      const f = E.mergeLines(...d, c);
+        return r.insert(h), h;
+      const f = D.mergeLines(...d, h);
       return d.forEach((p) => {
         $(f, p), r.remove(p), a.add(p);
       }), r.insert(f), f;
-    }), t = t.filter((c) => !a.has(c)), t.push(...o), t;
+    }), t = t.filter((h) => !a.has(h)), t.push(...o), r.clear(), t;
+  }
+}
+class be {
+  index = 0;
+  next() {
+    return this.index++;
+  }
+  reset() {
+    this.index = 0;
+  }
+  map = /* @__PURE__ */ new Map();
+  lineMap = /* @__PURE__ */ new Map();
+  getIndex(t) {
+    if (!this.map.has(t)) {
+      const e = this.next();
+      this.map.set(t, e), this.lineMap.set(e, t);
+    }
+    return this.map.get(t);
+  }
+  getLine(t) {
+    return this.lineMap.get(t);
   }
 }
-function De(u, t = 0.1, e) {
-  e || (e = new G(), u.forEach((i) => {
+class Te {
+  parent;
+  rank;
+  constructor(t) {
+    this.parent = Array(t).fill(0).map((e, n) => n), this.rank = Array(t).fill(1);
+  }
+  // 查找操作，使用路径压缩优化
+  find(t) {
+    return this.parent[t] !== t && (this.parent[t] = this.find(this.parent[t])), this.parent[t];
+  }
+  // 合并操作，使用按秩合并优化
+  union(t, e) {
+    let n = this.find(t), s = this.find(e);
+    n !== s && (this.rank[n] > this.rank[s] ? this.parent[s] = n : this.rank[n] < this.rank[s] ? this.parent[n] = s : (this.parent[s] = n, this.rank[n] += 1));
+  }
+  /** 获取所有集合
+   * @returns 
+   */
+  getAllSets() {
+    const t = new at();
+    for (const e of this.parent.keys()) {
+      const n = this.find(e);
+      t.append(n, e);
+    }
+    return t;
+  }
+}
+function Pe(u, t = 0.1, e) {
+  e || (e = new Y(), u.forEach((i) => {
     i.userData.isDoor || i.points.forEach((r) => e?.insert(r, i));
   }));
   const n = [], s = /* @__PURE__ */ new Set();
@@ -2028,38 +2120,38 @@ function De(u, t = 0.1, e) {
     r.userData.isDoor || r.points.forEach((a) => {
       if (s.has(a)) return !1;
       if (e.queryPoint(a).length > 1) return;
-      const l = e.queryCircle(a, t).filter((y) => {
+      const c = e.queryCircle(a, t).filter((y) => {
         if (s.has(y.point)) return !1;
         const g = y.userData;
         if (g === r || !r.parallel(g, 25) || e.queryPoint(y.point).length > 1) return !1;
         const x = a.distance(y.point);
         if (x < 1e-3) return !1;
-        const M = a.direction(r.getAnotherPoint(a)), w = y.point.direction(g.getAnotherPoint(y.point));
-        if (180 - M.angleBetween(w, "angle") < 25)
+        const m = a.direction(r.getAnotherPoint(a)), L = y.point.direction(g.getAnotherPoint(y.point));
+        if (180 - m.angleBetween(L, "angle") < 25)
           return o.set(y.point, x), !0;
       }).sort((y, g) => {
-        const x = o.get(y.point), M = o.get(g.point);
-        return x - M;
+        const x = o.get(y.point), m = o.get(g.point);
+        return x - m;
       });
-      if (l.length === 0) return;
-      s.add(a), s.add(l[0].point);
-      const h = l[0].userData, c = r.projectLineSegment(h), d = h.projectLineSegment(r), f = c.length(), p = d.length();
-      f === 0 && p === 0 ? n.push(new E(a.clone(), l[0].point.clone())) : n.push(new E(c.center, d.center));
+      if (c.length === 0) return;
+      s.add(a), s.add(c[0].point);
+      const l = c[0].userData, h = r.projectLineSegment(l), d = l.projectLineSegment(r), f = h.length(), p = d.length();
+      f === 0 && p === 0 ? n.push(new D(a.clone(), c[0].point.clone())) : n.push(new D(h.center, d.center));
     });
   }
   return [...u, ...n];
 }
-function Se(u) {
-  const t = new G(), e = new O(R.fromByLineSegment(...u)), n = [];
+function Ie(u) {
+  const t = new Y(), e = new B(I.fromByLineSegment(...u)), n = [];
   return u.forEach((s) => {
     s.userData.isDoor ? n.push(s) : (s.points.forEach((i) => t.insert(i, s)), e.insert(s));
   }), n.forEach((s) => {
     const i = t.queryPoint(s.start), r = t.queryPoint(s.end);
     i.length ? s.userData.startIntersection = i[0].userData : s.userData.startIntersection = e.queryPoint(s.start)[0]?.line, r.length ? s.userData.endIntersection = r[0].userData : s.userData.endIntersection = e.queryPoint(s.end)[0]?.line;
-  }), u = De(u, 0.4, t), u;
+  }), u = Pe(u, 0.4, t), t.clear(), e.clear(), u;
 }
-function Le(u) {
-  const t = new O(R.fromByLineSegment(...u));
+function ve(u) {
+  const t = new B(I.fromByLineSegment(...u));
   u.forEach((n) => {
     n.userData.isDoor || t.insert({ line: n, userData: void 0 });
   });
@@ -2076,9 +2168,9 @@ function Le(u) {
     });
     e.set(s, i);
   }
-  return e;
+  return t.clear(), e;
 }
-function Ee(u, t, e, n = 15) {
+function Re(u, t, e, n = 15) {
   const s = [u], i = [], r = [], o = [];
   function a(d) {
     if (d.userData.isDoor) return r.push(d);
@@ -2089,7 +2181,7 @@ function Ee(u, t, e, n = 15) {
     const g = d.center;
     return d.start.rotate(g, y), d.end.rotate(g, y), d.userData.isDoor ? r.push(d) : s.push(d), d;
   }
-  function l(d) {
+  function c(d) {
     if (d.userData.isDoor) return r.push(d);
     const f = Math.atan2(d.end.y - d.start.y, d.end.x - d.start.x), p = Math.atan2(u.end.y - u.start.y, u.end.x - u.start.x);
     let y = p + Math.PI / 2 - f, g = p - Math.PI / 2 - f;
@@ -2097,133 +2189,139 @@ function Ee(u, t, e, n = 15) {
     for (; y < -Math.PI; ) y += 2 * Math.PI;
     for (; g > Math.PI; ) g -= 2 * Math.PI;
     for (; g < -Math.PI; ) g += 2 * Math.PI;
-    const x = Math.abs(y) < Math.abs(g) ? y : g, M = d.center;
-    return d.start.rotate(M, x), d.end.rotate(M, x), d.userData.isDoor ? r.push(d) : i.push(d), d;
+    const x = Math.abs(y) < Math.abs(g) ? y : g, m = d.center;
+    return d.start.rotate(m, x), d.end.rotate(m, x), d.userData.isDoor ? r.push(d) : i.push(d), d;
   }
-  function h(d, f, p = !1) {
-    if (p) return h(d === "parallel" ? "vertical" : "parallel", f);
-    d === "parallel" ? a(f) : l(f);
+  function l(d, f, p = !1) {
+    if (p) return l(d === "parallel" ? "vertical" : "parallel", f);
+    d === "parallel" ? a(f) : c(f);
   }
-  const c = [];
+  const h = [];
   for (let d = 0; d < t.length; d++) {
     const f = t[d];
     if (u !== f)
       if (f.userData.isWindow && o.push(f), f.parallel(u, n)) a(f);
-      else if (f.vertical(u, n)) l(f);
+      else if (f.vertical(u, n)) c(f);
       else {
         const y = e.get(f)?.reduce((g, x) => (x.sourcePoint && (g.has(x.sourcePoint) || g.set(x.sourcePoint, []), g.get(x.sourcePoint)?.push(x)), g), /* @__PURE__ */ new Map());
-        y && y.size > 1 ? c.push(() => {
+        y && y.size > 1 ? h.push(() => {
           const g = [...y.values()].map(
-            (w) => w.map((m) => s.includes(m.line) ? "parallel" : i.includes(m.line) ? "vertical" : null).filter((m) => !!m)
-          ).map((w) => [...new Set(w)]), x = g[0], M = g[1];
-          if (x.length === 1 && M.length === 1) {
-            if (x[0] === M[0]) return h(x[0], f, !0);
+            (L) => L.map((M) => s.includes(M.line) ? "parallel" : i.includes(M.line) ? "vertical" : null).filter((M) => !!M)
+          ).map((L) => [...new Set(L)]), x = g[0], m = g[1];
+          if (x.length === 1 && m.length === 1) {
+            if (x[0] === m[0]) return l(x[0], f, !0);
             if (x.length === 1) {
-              if (M.includes(x[0])) return h(x[0], f, !0);
-              if (M.length === 1 && x.includes(M[0]))
-                return h(M[0], f, !0);
+              if (m.includes(x[0])) return l(x[0], f, !0);
+              if (m.length === 1 && x.includes(m[0]))
+                return l(m[0], f, !0);
             }
           }
-          l(f);
-        }) : l(f);
+          c(f);
+        }) : c(f);
       }
   }
-  return c.forEach((d) => d()), { parallelLines: s, verticalLines: i, doorLines: r, windowLines: o };
+  return h.forEach((d) => d()), { parallelLines: s, verticalLines: i, doorLines: r, windowLines: o };
 }
 function mt(u, t, e, n, s) {
   const i = [], r = /* @__PURE__ */ new Map();
-  u.forEach((l) => {
-    const h = e.projectPoint(l.start, !1);
-    h && (h.userData = l, i.push(h), r.set(l, h));
-  }), i.sort((l, h) => h.distance(e.start) - l.distance(e.start));
+  u.forEach((c) => {
+    const l = e.projectPoint(c.start, !1);
+    l && (l.userData = c, i.push(l), r.set(c, l));
+  }), i.sort((c, l) => l.distance(e.start) - c.distance(e.start));
   const o = [], a = [];
-  for (let l = 0; l < i.length; l++) {
-    const h = i[l];
-    if (l === 0) {
-      a.push(h);
+  for (let c = 0; c < i.length; c++) {
+    const l = i[c];
+    if (c === 0) {
+      a.push(l);
       continue;
     }
-    i[l - 1].distance(h) < s || (o.push([...a]), a.length = 0), a.push(h), l === i.length - 1 && o.push(a);
+    i[c - 1].distance(l) < s || (o.push([...a]), a.length = 0), a.push(l), c === i.length - 1 && o.push(a);
   }
-  return o.flatMap((l) => {
-    const h = l.flatMap((p) => {
+  return o.flatMap((c) => {
+    const l = c.flatMap((p) => {
       const y = p.userData;
       return y.points.map((g) => {
         const x = t.projectPoint(g, !1);
         return x.userData = y, x;
       });
     });
-    h.sort((p, y) => p.distance(t.start) - y.distance(t.start));
-    const c = /* @__PURE__ */ new Map(), d = [];
+    l.sort((p, y) => p.distance(t.start) - y.distance(t.start));
+    const h = /* @__PURE__ */ new Map(), d = [];
     let f = [];
-    return h.forEach((p, y) => {
-      c.size === 0 && y > 0 && h[y - 1].distance(p) > n && (f.push([...d]), d.length = 0), c.set(p.userData, (c.get(p.userData) ?? 0) + 1);
-      for (const g of c.values()) if (g !== 2) return;
-      d.push(...c.keys()), c.clear();
+    return l.forEach((p, y) => {
+      h.size === 0 && y > 0 && l[y - 1].distance(p) > n && (f.push([...d]), d.length = 0), h.set(p.userData, (h.get(p.userData) ?? 0) + 1);
+      for (const g of h.values()) if (g !== 2) return;
+      d.push(...h.keys()), h.clear();
     }), f.push([...d]), f;
   });
 }
 function wt(u, t, e, n) {
   const s = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), o = [];
-  u.forEach((d) => {
-    const f = e.projectPoint(d.start, !1);
-    f && (f.userData = d, s.set(d, f), o.push(f)), d.points.forEach((p, y) => {
-      const g = t.projectPoint(p, !1);
-      g && (g.userData = d, y === 0 ? i.set(d, g) : r.set(d, g));
+  u.forEach((p) => {
+    const y = e.projectPoint(p.start, !1);
+    y && (y.userData = p, s.set(p, y), o.push(y)), p.points.forEach((g, x) => {
+      const m = t.projectPoint(g, !1);
+      m && (m.userData = p, x === 0 ? i.set(p, m) : r.set(p, m));
     });
-  }), o.sort((d, f) => f.distance(e.start) - d.distance(e.start));
-  const a = o.map((d) => {
-    const f = d.userData, p = i.get(f), y = r.get(f), g = new E(p, y), x = [];
+  }), o.sort((p, y) => y.distance(e.start) - p.distance(e.start));
+  const a = o.map((p) => {
+    const y = p.userData, g = i.get(y), x = r.get(y), m = new D(g, x), L = [];
     for (let M = 0; M < o.length; M++) {
-      const w = o[M];
-      if (d !== w && d.distance(w) < n) {
-        const m = w.userData, S = i.get(m), A = r.get(m);
-        (g.isPointOnSegment(S) || g.isPointOnSegment(A)) && x.push(M);
+      const S = o[M];
+      if (p !== S && p.distance(S) < n) {
+        const A = S.userData, E = i.get(A), T = r.get(A);
+        (m.isPointOnSegment(E) || m.isPointOnSegment(T)) && L.push(M);
       }
     }
-    return x;
+    return L;
   });
-  function l(d, f, p = /* @__PURE__ */ new Set()) {
-    if (p.has(d)) return p;
-    const y = f[d];
-    p.add(d);
-    for (let g = 0; g < y.length; g++) {
-      const x = y[g];
-      l(x, f, p);
+  function c(p, y, g = /* @__PURE__ */ new Set()) {
+    if (g.has(p)) return g;
+    const x = y[p];
+    g.add(p);
+    for (let m = 0; m < x.length; m++) {
+      const L = x[m];
+      c(L, y, g);
     }
-    return p;
-  }
-  const h = /* @__PURE__ */ new Set(), c = [];
-  for (let d = 0; d < o.length; d++) {
-    if (h.has(d)) continue;
-    const f = l(d, a), p = [];
-    if (f.forEach((y) => {
-      h.add(y), p.push(o[y].userData);
-    }), p.length > 2) {
-      const y = p.map((w) => s.get(w));
-      y.sort((w, m) => m.distance(e.start) - w.distance(e.start));
-      const g = y[0], x = y[y.length - 1];
-      if (g.distance(x) > n) {
-        const w = [...p].sort((B, j) => j.length() - B.length()), m = w[0], S = w[1], A = s.get(m), L = s.get(S), b = m.length(), v = S.length(), C = m.projectLineSegment(S), I = C.length();
-        if (A.distance(L) || v / b > 0.5 && I / v < 0.5) {
-          const B = [m], j = [S];
-          for (let F = 0; F < y.length; F++) {
-            const N = y[F], H = N.userData;
-            if (N === A || N === L) continue;
-            const U = S.projectLineSegment(H), Z = U.length();
-            L.distance(N) <= n && Z / v > 0 ? j.push(H) : B.push(H);
+    return g;
+  }
+  const l = /* @__PURE__ */ new Set();
+  let h = [];
+  for (let p = 0; p < o.length; p++) {
+    if (l.has(p)) continue;
+    const y = c(p, a), g = [];
+    if (y.forEach((x) => {
+      l.add(x), g.push(o[x].userData);
+    }), g.length > 2) {
+      const x = g.map((S) => s.get(S));
+      x.sort((S, A) => A.distance(e.start) - S.distance(e.start));
+      const m = x[0], L = x[x.length - 1];
+      if (m.distance(L) > n) {
+        const S = [...g].sort((R, v) => v.length() - R.length()), A = S[0], E = S[1], T = s.get(A), C = s.get(E), N = A.length(), O = E.length(), q = A.projectLineSegment(E), U = q.length();
+        if (T.distance(C) || O / N > 0.5 && U / O < 0.5) {
+          const R = [A], v = [E];
+          for (let K = 0; K < x.length; K++) {
+            const F = x[K], W = F.userData;
+            if (F === T || F === C) continue;
+            const Ht = E.projectLineSegment(W), Jt = Ht.length();
+            C.distance(F) <= n && Jt / O > 0 ? v.push(W) : R.push(W);
           }
-          c.push(B, j);
+          h.push(R, v);
         } else {
-          const B = Math.floor(p.length * 0.5);
-          c.push(p.slice(0, B), p.slice(B));
+          const R = Math.floor(g.length * 0.5);
+          h.push(g.slice(0, R), g.slice(R));
         }
         continue;
       }
     }
-    c.push(p);
-  }
-  return c;
+    h.push(g);
+  }
+  const d = new be(), f = new Te(u.length);
+  return h.forEach((p) => {
+    const y = p.map((g) => d.getIndex(g));
+    for (let g = 1; g < y.length; g++)
+      f.union(y[0], y[g]);
+  }), h = f.getAllSets().valueArray.map((p) => p.map((y) => d.getLine(y))), h;
 }
 function Mt(u, t) {
   function e(i, r = /* @__PURE__ */ new Set()) {
@@ -2232,8 +2330,8 @@ function Mt(u, t) {
     const o = t.get(i);
     if (!o) return r;
     for (let a = 0; a < o.length; a++) {
-      const { line: l, angle: h } = o[a];
-      l.parallel(h, 0.5) && e(l, r);
+      const { line: c, angle: l } = o[a];
+      c.parallel(l, 0.5) && e(c, r);
     }
     return r;
   }
@@ -2246,12 +2344,12 @@ function Mt(u, t) {
   }
   return s;
 }
-function Ae(u, t, e, n, s, i) {
+function Ce(u, t, e, n, s, i) {
   const {
     principalAxisThreshold: r = 0.3,
     crossAxistThreshold: o = 0.06,
     groupMethod: a = "principalAndCross"
-  } = i ?? {}, l = {
+  } = i ?? {}, c = {
     cross: () => [
       ...wt(u, n, e, o),
       ...wt(t, e, n, o)
@@ -2265,9 +2363,9 @@ function Ae(u, t, e, n, s, i) {
       ...Mt(t, s)
     ]
   };
-  return l[a] ? l[a]() : l.originalInterPoint();
+  return c[a] ? c[a]() : c.originalInterPoint();
 }
-function be(u, t) {
+function Ne(u, t) {
   const e = /* @__PURE__ */ new Set();
   return u.forEach((n) => {
     const s = /* @__PURE__ */ new Map();
@@ -2283,65 +2381,65 @@ function be(u, t) {
       }
   }), u.map((n) => n.filter((s) => !e.has(s)));
 }
-function Te(u, t = 0.1, e) {
+function Be(u, t = 0.1, e) {
   const { fittingMethod: n = "average" } = e ?? {};
   return u.map((s) => {
     if (s.length === 0) return;
     if (s.length === 1) return s[0];
     const i = [];
-    s.forEach((c) => i.push(c.start.clone(), c.end.clone()));
-    const r = n === "average" ? E.mergeLines(...s) : E.mergeLinesByMaxlength(...s);
+    s.forEach((h) => i.push(h.start.clone(), h.end.clone()));
+    const r = n === "average" ? D.mergeLines(...s) : D.mergeLinesByMaxlength(...s);
     r.userData.rooftopPz = Math.min(
-      ...s.map((c) => {
-        const { drawDoorData: d, drawWindow: f, rooftopPz: p, ...y } = c.userData;
+      ...s.map((h) => {
+        const { drawDoorData: d, drawWindow: f, rooftopPz: p, ...y } = h.userData;
         return Object.assign(r.userData, y), p ?? 1 / 0;
       })
     ), r.userData.rooftopPz === 1 / 0 && (r.userData.rooftopPz = 0);
     let o = 1 / 0, a = -1 / 0;
-    const l = s[0].normal().normalize();
-    o = 1 / 0, a = -1 / 0, i.forEach((c) => {
-      const d = c.x * l.x + c.y * l.y;
+    const c = s[0].normal().normalize();
+    o = 1 / 0, a = -1 / 0, i.forEach((h) => {
+      const d = h.x * c.x + h.y * c.y;
       o = Math.min(o, d), a = Math.max(a, d);
     });
-    const h = a - o;
-    return h >= t && (r.userData.wallWidth = h), s.forEach((c) => c.userData.fittedLine = r), r;
+    const l = a - o;
+    return l >= t && (r.userData.wallWidth = l), s.forEach((h) => h.userData.fittedLine = r), r;
   }).filter((s) => !!s);
 }
-function Pe(u, t, e) {
-  const { snapThreshold: n = 0.2 } = e ?? {}, s = new G(), i = new O(R.fromByLineSegment(...u)), r = new E(), o = /* @__PURE__ */ new Map();
+function Oe(u, t, e) {
+  const { snapThreshold: n = 0.2 } = e ?? {}, s = new Y(), i = new B(I.fromByLineSegment(...u)), r = new D(), o = /* @__PURE__ */ new Map();
   u.forEach((d) => {
     d.userData.isDoor || (i.insert(d), d.points.forEach((f) => s.insert(f, d)));
   });
   function a(d, f) {
     o.has(d) || o.set(d, []), o.get(d)?.push(f);
   }
-  function l(d, f) {
+  function c(d, f) {
     if (i.queryPoint(d).length > 1) return;
     const p = f.direction().multiplyScalar(n);
     r.set(d, d), r.start.add(p), r.end.add(p.multiplyScalar(-1));
     const y = /* @__PURE__ */ new Map(), g = i.queryLineSegment(r).filter((x) => x.line !== f).map((x) => {
-      const M = x.line.getIntersection(r);
-      return y.set(x.line, M), x.line;
-    }).sort((x, M) => {
-      const w = y.get(x), m = y.get(M);
-      return w && m ? w.distance(d) - m.distance(d) : 0;
+      const m = x.line.getIntersection(r);
+      return y.set(x.line, m), x.line;
+    }).sort((x, m) => {
+      const L = y.get(x), M = y.get(m);
+      return L && M ? L.distance(d) - M.distance(d) : 0;
     });
     if (g.length) return y.get(g[0]);
   }
-  function h(d, f) {
-    let p = l(d, f);
+  function l(d, f) {
+    let p = c(d, f);
     if (p)
-      return a(f, new E(d.clone(), p.clone()));
-    if (s.queryPoint(d).filter((w) => w.userData !== f).length !== 0 || i.queryCircle(d, 1e-3).filter((w) => w.line !== f).length > 0) return;
-    const g = s.queryCircle(d, n).filter((w) => w.userData !== f && w.userData?.vertical(f)).sort((w, m) => w.point.distance(d) - m.point.distance(d));
+      return a(f, new D(d.clone(), p.clone()));
+    if (s.queryPoint(d).filter((L) => L.userData !== f).length !== 0 || i.queryCircle(d, 1e-3).filter((L) => L.line !== f).length > 0) return;
+    const g = s.queryCircle(d, n).filter((L) => L.userData !== f && L.userData?.vertical(f)).sort((L, M) => L.point.distance(d) - M.point.distance(d));
     if (!g.length) return;
-    const x = g[0], M = x.userData?.projectPoint(d, !1);
-    if (M) {
-      const w = x.userData;
-      a(f, new E(d.clone(), M.clone())), a(w, new E(x.point.clone(), M.clone()));
+    const x = g[0], m = x.userData?.projectPoint(d, !1);
+    if (m) {
+      const L = x.userData;
+      a(f, new D(d.clone(), m.clone())), a(L, new D(x.point.clone(), m.clone()));
     }
   }
-  function c(d, f, p) {
+  function h(d, f, p) {
     if (p.length) {
       const y = p.map(({ line: g }) => {
         if (g.userData.fittedLine && (g = g.userData.fittedLine), g.vertical(d)) {
@@ -2353,31 +2451,31 @@ function Pe(u, t, e) {
     }
   }
   for (let d = 0; d < u.length; d++) {
-    const f = u[d], y = (t.get(f) ?? []).reduce((M, w) => (w.sourcePoint === f.start ? M[0].push(w) : M[1].push(w), M), [[], []]), [g, x] = f.points.map((M, w) => {
-      if (!s.queryPoint(M, !0).length) {
-        const m = c(f, M, y[w]);
-        if (m)
-          M.copy(m), s.update(M), i.update(f);
+    const f = u[d], y = (t.get(f) ?? []).reduce((m, L) => (L.sourcePoint === f.start ? m[0].push(L) : m[1].push(L), m), [[], []]), [g, x] = f.points.map((m, L) => {
+      if (!s.queryPoint(m, !0).length) {
+        const M = h(f, m, y[L]);
+        if (M)
+          m.copy(M), s.update(m), i.update(f);
         else return !1;
       }
       return !0;
     });
-    g || h(f.start, f), x || h(f.end, f);
+    g || l(f.start, f), x || l(f.end, f);
   }
   return o.forEach((d, f) => {
-    const p = E.mergeLines(f, ...d);
+    const p = D.mergeLines(f, ...d);
     f.set(p.start, p.end);
-  }), u;
+  }), s.clear(), i.clear(), u;
 }
-function Ie(u) {
+function je(u) {
   const t = /* @__PURE__ */ new Set();
   for (let e = 0; e < u.length; e++) {
     const n = u[e], s = n.userData.fittedLine;
-    s ? (t.add(s), s.userData.isWindow = !0, s.userData.drawWindow || (s.userData.drawWindow = []), s.userData.drawWindow.push(...n.userData.drawWindow ?? [])) : V(n);
+    s ? (t.add(s), s.userData.isWindow = !0, s.userData.drawWindow || (s.userData.drawWindow = []), s.userData.drawWindow.push(...n.userData.drawWindow ?? [])) : X(n);
   }
-  t.forEach((e) => V(e));
+  t.forEach((e) => X(e));
 }
-function ve(u) {
+function Fe(u) {
   for (let t = 0; t < u.length; t++) {
     const e = u[t];
     let { endIntersection: n, startIntersection: s } = e.userData;
@@ -2399,25 +2497,25 @@ function ve(u) {
   return u;
 }
 function Dt(u, t = 0.01) {
-  const e = new G();
+  const e = new Y();
   return u.forEach((n) => n.points.forEach((s) => e.insert(s, n))), u = u.filter((n) => {
     if (n.length() <= t) {
       const s = e.queryPoint(n.start).filter((r) => r.userData !== n).length === 0, i = e.queryPoint(n.end).filter((r) => r.userData !== n).length === 0;
       if (s || i) return !1;
     }
     return !0;
-  }), u = E.brokenLineMerging(u, (n, s) => {
-    s.forEach((i) => $(n, i)), V(n);
-  }), u;
+  }), u = D.brokenLineMerging(u, (n, s) => {
+    s.forEach((i) => $(n, i)), X(n);
+  }), e.clear(), u;
 }
-function Re(u) {
-  const { lines: t, groups: e, removeLines: n } = jt(u);
+function qe(u) {
+  const { lines: t, groups: e, removeLines: n } = Ft(u);
   return e.forEach((s) => {
     const i = tt();
     s.forEach((r) => Object.assign(r.userData, { groupId: i, groupType: "doubleWall" }));
   }), n.forEach((s) => Object.assign(s.userData, { groupId: "default", groupType: "wall" })), u = t, u;
 }
-class qt {
+class Gt {
   /**
    * 轴对齐垂直修正
    * @param lines 待调整线段组
@@ -2426,52 +2524,52 @@ class qt {
    */
   static correction(t, e, n) {
     const s = t.indexOf(e);
-    t = t.map((w) => w.clone()), e = s > -1 ? t[s] : e, t = Se(t);
-    const i = Le(t), { parallelLines: r, verticalLines: o, doorLines: a, windowLines: l } = Ee(e, t, i, 25), h = e.normal(), c = e.center, d = e.direction(), f = new E(
-      c.clone().add(h.clone().multiplyScalar(-1e3)),
-      c.clone().add(h.clone().multiplyScalar(1e3))
-    ), p = new E(
-      c.clone().add(d.clone().multiplyScalar(-1e3)),
-      c.clone().add(d.clone().multiplyScalar(1e3))
+    t = t.map((L) => L.clone()), e = s > -1 ? t[s] : e, t = Ie(t);
+    const i = ve(t), { parallelLines: r, verticalLines: o, doorLines: a, windowLines: c } = Re(e, t, i, 25), l = e.normal(), h = e.center, d = e.direction(), f = new D(
+      h.clone().add(l.clone().multiplyScalar(-1e3)),
+      h.clone().add(l.clone().multiplyScalar(1e3))
+    ), p = new D(
+      h.clone().add(d.clone().multiplyScalar(-1e3)),
+      h.clone().add(d.clone().multiplyScalar(1e3))
     );
-    let y = Ae(r, o, f, p, i, n);
-    y = be(y, i);
-    let g = Te(y, 0.1, n);
-    g = E.autoMergeLines(g).lines, g = Pe(g, i, n), Ie(l), g = at(g, 1e-9), g = Dt(g, 0.15);
-    const { removeClosedLine: x = !0, wallGroup: M = !0 } = n ?? {};
-    return x && (g = jt(g).lines, M && (g = Me.complementSide(g), g = E.brokenLineMerging(g, $), V(...g), g = at(g, 1e-9), g = Re(g)), g = Dt(g, 0.15)), ve(a), g.push(...a), g;
+    let y = Ce(r, o, f, p, i, n);
+    y = Ne(y, i);
+    let g = Be(y, 0.1, n);
+    g = D.brokenLineMerging(g, $), X(...g), g = Oe(g, i, n), je(c), g = ft(g, 1e-9), g = Dt(g, 0.15);
+    const { removeClosedLine: x = !0, wallGroup: m = !0 } = n ?? {};
+    return x && (g = Ft(g).lines, m && (g = Ae.complementSide(g), g = D.brokenLineMerging(g, $), X(...g), g = ft(g, 1e-9), g = qe(g)), g = Dt(g, 0.15)), Fe(a), g.push(...a), g;
   }
 }
-const Ce = new E(
-  new D(0, 0),
-  new D(0, 1)
+const Ge = new D(
+  new w(0, 0),
+  new w(0, 1)
 );
-function Ne(u) {
+function Ue(u) {
   const t = [...u].sort((i, r) => r.length() - i.length()).slice(0, 20), e = t.map((i) => {
-    let r = parseInt(Ce.includedAngle(i) + "");
+    let r = parseInt(Ge.includedAngle(i) + "");
     return r > 90 && (r = 180 - r), r;
   }), n = /* @__PURE__ */ new Map();
   return e.forEach((i, r) => {
     n.has(i) || n.set(i, []), n.get(i)?.push(t[r]);
   }), [...n.values()].sort((i, r) => r.length - i.length)[0].sort((i, r) => r.length() - i.length())[0];
 }
-function Be(u) {
+function ze(u) {
   let t = [], e = -1;
   const n = [];
   return u.forEach(({ start: i, end: r, ...o }, a) => {
     n.push(i.z ?? 0, r.z ?? 0);
-    const l = new E(
-      D.from(i),
-      D.from(r)
+    const c = new D(
+      w.from(i),
+      w.from(r)
     );
-    l.userData = o, t.push(l), o.isVerticalReferenceLine && (e = a);
+    c.userData = o, t.push(c), o.isVerticalReferenceLine && (e = a);
   }), {
     originalZAverage: n.reduce((i, r) => i + r, 0) / n.length,
     lineSegments: t,
     verticalReferenceIndex: e
   };
 }
-const Oe = {
+const _e = {
   Unitless: 1,
   // 无单位，1米 = 1（无单位）
   Inches: 39.37007874015748,
@@ -2515,27 +2613,27 @@ const Oe = {
   Parsecs: 3240779289666404e-32
   // 秒差距，1米 ≈ 0.00000000000000003240779289666404秒差距
 };
-function St(u) {
+function Lt(u) {
   const t = [];
   for (let e = 0; e < u.length; e++)
-    t.push(new E(
+    t.push(new D(
       u[e].clone(),
       u[(e + 1) % u.length].clone()
     ));
   return t;
 }
-function Lt(u) {
+function St(u) {
   return u.flatMap((t, e) => (e === u.length - 1 && [...t.points, u[0].points[0]], [t.points[0]]));
 }
-class k extends z {
+class k extends G {
   static name = "Dxf";
   shortLine = 0.04;
   width = 0.04;
   scale = 1;
   originalData = [];
   data = [];
-  originalBox = new R(0, 0, 0, 0);
-  box = new R(0, 0, 0, 0);
+  originalBox = new I(0, 0, 0, 0);
+  box = new I(0, 0, 0, 0);
   pointsGroups = [];
   wallsGroup = [];
   doors = [];
@@ -2572,9 +2670,9 @@ class k extends z {
    * @param data 
    */
   preprocessing(t) {
-    let { lineSegments: e, verticalReferenceIndex: n, originalZAverage: s } = Be(t);
+    let { lineSegments: e, verticalReferenceIndex: n, originalZAverage: s } = ze(t);
     if (this.originalZAverage = s, n === -1) {
-      const r = Ne(e);
+      const r = Ue(e);
       n = e.indexOf(r);
     }
     const i = e[n];
@@ -2582,9 +2680,9 @@ class k extends z {
       type: "preprocessing",
       data: t,
       setData(r) {
-        e = r.map(({ start: o, end: a, ...l }) => {
-          const h = new E(D.from(o), D.from(a));
-          return h.userData = l, h;
+        e = r.map(({ start: o, end: a, ...c }) => {
+          const l = new D(w.from(o), w.from(a));
+          return l.userData = c, l;
         }), t = r;
       }
     }), { lineSegments: e, data: t };
@@ -2614,15 +2712,15 @@ class k extends z {
       t = i.data, this.lineSegments = i.lineSegments, this.originalData = t;
     }
     const s = [];
-    this.data = t.map(({ start: i, end: r, insetionArr: o, isDoor: a = !1 }, l) => {
+    this.data = t.map(({ start: i, end: r, insetionArr: o, isDoor: a = !1 }, c) => {
       s.push(i.z ?? 0, r.z ?? 0);
-      const h = this.lineSegments[l];
+      const l = this.lineSegments[c];
       return [
-        h.points[0],
-        h.points[1],
-        (o ?? []).map((c) => c.index),
+        l.points[0],
+        l.points[1],
+        (o ?? []).map((h) => h.index),
         a,
-        l
+        c
       ];
     }), this.originalZAverage = s.reduce((i, r) => i + r, 0) / s.length, this.computedOriginalSize(t, this.originalBox), this.dispatchEvent({
       type: "setDta",
@@ -2640,10 +2738,10 @@ class k extends z {
   createGroups() {
     const t = [], e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Map(), i = (r, o, a = -1) => {
       if (!this.data[r]) return;
-      const [l, h, c, d] = this.data[r];
+      const [c, l, h, d] = this.data[r];
       if (e.add(r), d)
         return s.has(r) || s.set(r, []), s.get(r)?.push(a), n.add(this.data[r]);
-      o.push([l, h]), c.forEach((f) => {
+      o.push([c, l]), h.forEach((f) => {
         e.has(f) || i(f, o, r);
       });
     };
@@ -2672,10 +2770,10 @@ class k extends z {
     function n(i, r) {
       const [o, a] = t[i];
       e[i] = !0, r.push(a);
-      for (let l = 0; l < t.length; l++) {
-        const [h, c] = t[l];
-        if (!e[l] && Math.abs(a.x - h.x) < 1e-6 && Math.abs(a.y - h.y) < 1e-6)
-          return n(l, r);
+      for (let c = 0; c < t.length; c++) {
+        const [l, h] = t[c];
+        if (!e[c] && Math.abs(a.x - l.x) < 1e-6 && Math.abs(a.y - l.y) < 1e-6)
+          return n(c, r);
       }
     }
     const s = [];
@@ -2713,8 +2811,8 @@ class k extends z {
       if (s.distance(i) < this.width * 0.5) {
         let o = 0;
         for (let a = n + 1; a < t.length; a++) {
-          const l = t[a - 1], h = t[a];
-          if (l.distance(h) < this.width * 0.8) o++;
+          const c = t[a - 1], l = t[a];
+          if (c.distance(l) < this.width * 0.8) o++;
           else break;
         }
         o === 0 && n + o === t.length - 1 || n == 1 && o === 1 || (o === 3 ? (e.push(t[n + 1]), n += o) : o === 5 ? (e.push(t[n + 2]), n += o) : e.push(i));
@@ -2736,7 +2834,7 @@ class k extends z {
         break;
       }
     }
-    const e = this.mergeSameDirectionLine(St(t)), n = [e[0]];
+    const e = this.mergeSameDirectionLine(Lt(t)), n = [e[0]];
     for (let s = 1; s < e.length; s++) {
       const i = e[s], r = e[(e.length + s - 1) % e.length];
       if (i.length() > this.width * 0.9) {
@@ -2751,7 +2849,7 @@ class k extends z {
       const a = e[s + 2];
       a && r.includedAngle(a) < 2 ? (s = s + 2, n.push(a)) : n.push(i);
     }
-    return n.length > 3 ? Lt(this.mergeSameDirectionLine(n)) : [];
+    return n.length > 3 ? St(this.mergeSameDirectionLine(n)) : [];
   }
   /**
    * 移除短线段
@@ -2759,35 +2857,35 @@ class k extends z {
    * @param path 
    */
   removeShortLine(t, e = this.shortLine) {
-    const n = St(t), s = [], i = Math.PI / 180;
+    const n = Lt(t), s = [], i = Math.PI / 180;
     for (let r = 0; r < n.length; r++) {
-      const o = n[r], a = o.length(), l = r;
+      const o = n[r], a = o.length(), c = r;
       if (a > e || s.length === 0) {
         s.push(o);
         continue;
       }
-      let h = n[++r];
-      const c = s[s.length - 1], d = c.direction();
+      let l = n[++r];
+      const h = s[s.length - 1], d = h.direction();
       for (; r < n.length; ) {
-        const p = d.angleBetween(h.direction()) / i;
-        if (h.length() <= e || p < 4 || p > 176)
-          h = n[++r];
+        const p = d.angleBetween(l.direction()) / i;
+        if (l.length() <= e || p < 4 || p > 176)
+          l = n[++r];
         else break;
       }
-      if (!h) continue;
+      if (!l) continue;
       const f = n[r - 1];
-      if (c.length() > f.length()) {
-        const p = c.getIntersection(h);
+      if (h.length() > f.length()) {
+        const p = h.getIntersection(l);
         if (p) {
-          const y = c.points[1].clone(), g = h.points[0].clone();
-          c.points[1].copy(p), h.points[0].copy(p), c.length() < this.width ? (c.points[1].copy(y), h.points[0].copy(y)) : h.length() < this.width && (c.points[1].copy(g), h.points[0].copy(g));
+          const y = h.points[1].clone(), g = l.points[0].clone();
+          h.points[1].copy(p), l.points[0].copy(p), h.length() < this.width ? (h.points[1].copy(y), l.points[0].copy(y)) : l.length() < this.width && (h.points[1].copy(g), l.points[0].copy(g));
         } else
-          c.points[1].copy(h.points[0]);
-        s.push(h);
+          h.points[1].copy(l.points[0]);
+        s.push(l);
       } else
-        r = l;
+        r = c;
     }
-    return s.length > 3 ? Lt(s) : [];
+    return s.length > 3 ? St(s) : [];
   }
   /** 线偏移
    * @description 使用 ClipperLib 对每个点组进行线偏移处理，生成具有指定宽度的墙体路径
@@ -2796,12 +2894,12 @@ class k extends z {
     let s = new xt.Paths();
     const i = new xt.ClipperOffset(20, 0.25);
     return this.pointsGroups.forEach((r) => {
-      const o = this.lineTopology(r).map((a) => a.map((l) => l.clone().mutiplyScalar(n)));
+      const o = this.lineTopology(r).map((a) => a.map((c) => c.clone().mutiplyScalar(n)));
       i.AddPaths(o, e, t);
     }), i.Execute(s, this.width / 2 * n), this.wallsGroup = s.map((r) => {
-      let o = r.map((a) => D.from(a).divisionScalar(n));
+      let o = r.map((a) => w.from(a).divisionScalar(n));
       return o = this.lineSegmentStraightening(o), t == k.EndType.etOpenSquare && (o = this.squareRemoveBurr(o)), o;
-    }).filter((r) => r.length > 4 || Nt(r) > 0.2), this.dispatchEvent({
+    }).filter((r) => r.length > 4 || Ot(r) > 0.2), this.dispatchEvent({
       type: "lineOffset",
       wallsGroup: this.wallsGroup
     }), this.wallsGroup;
@@ -2812,7 +2910,7 @@ class k extends z {
   axisAlignCorr(t) {
     if (this.verticalReferenceLine) {
       this.doorLineSegment;
-      const e = this.getLineSegments(), n = performance.now(), s = qt.correction(e, this.verticalReferenceLine, t);
+      const e = this.getLineSegments(), n = performance.now(), s = Gt.correction(e, this.verticalReferenceLine, t);
       console.log("垂直纠正消耗时间：", (performance.now() - n).toFixed(2), "ms", "处理线段数量：", e.length);
       const i = et(s);
       this.set(i);
@@ -2849,10 +2947,10 @@ class k extends z {
    */
   getArcAngleRange(t, e, n) {
     const s = e.x - t.x, i = e.y - t.y, r = n.x - t.x, o = n.y - t.y;
-    let a = Math.atan2(i, s), l = Math.atan2(o, r);
-    a = a < 0 ? a + 2 * Math.PI : a, l = l < 0 ? l + 2 * Math.PI : l;
-    let h, c;
-    return Math.abs(l - a) <= Math.PI ? (h = Math.min(a, l), c = Math.max(a, l)) : (h = Math.max(a, l), c = Math.min(a, l) + 2 * Math.PI), [h / (Math.PI / 180), c / (Math.PI / 180)];
+    let a = Math.atan2(i, s), c = Math.atan2(o, r);
+    a = a < 0 ? a + 2 * Math.PI : a, c = c < 0 ? c + 2 * Math.PI : c;
+    let l, h;
+    return Math.abs(c - a) <= Math.PI ? (l = Math.min(a, c), h = Math.max(a, c)) : (l = Math.max(a, c), h = Math.min(a, c) + 2 * Math.PI), [l / (Math.PI / 180), h / (Math.PI / 180)];
   }
   /**
    * 线段数据转为原始json数据
@@ -2864,7 +2962,7 @@ class k extends z {
    * 转为绘制数据
    */
   toDrawDataJson(t = "Millimeters") {
-    const e = Oe[t], n = {
+    const e = _e[t], n = {
       unit: t,
       line: [],
       arc: [],
@@ -2875,62 +2973,62 @@ class k extends z {
       scale: e
     };
     let s = "white";
-    function i(l, h) {
-      n.line.push([l.x * e, l.y * e, h.x * e, h.y * e, s]);
+    function i(c, l) {
+      n.line.push([c.x * e, c.y * e, l.x * e, l.y * e, s]);
     }
-    function r(l, h, c, d) {
+    function r(c, l, h, d) {
       n.arc.push([
-        l.x * e,
-        l.y * e,
-        h * e,
-        c,
+        c.x * e,
+        c.y * e,
+        l * e,
+        h,
         d,
         s
       ]);
     }
-    for (let l = 0; l < this.originalData.length; l++) {
-      const h = this.originalData[l];
-      if (h.isVerticalReferenceLine) {
-        n.dimensionLine.push([h.start.x * e, h.start.y * e, h.end.x * e, h.end.y * e]);
+    for (let c = 0; c < this.originalData.length; c++) {
+      const l = this.originalData[c];
+      if (l.isVerticalReferenceLine) {
+        n.dimensionLine.push([l.start.x * e, l.start.y * e, l.end.x * e, l.end.y * e]);
         break;
       }
     }
-    this.wallsGroup.forEach((l) => {
-      for (let h = 0; h < l.length; h++) {
-        const c = l[h], d = h === l.length - 1 ? 0 : h + 1, f = l[d];
-        i(c, f);
+    this.wallsGroup.forEach((c) => {
+      for (let l = 0; l < c.length; l++) {
+        const h = c[l], d = l === c.length - 1 ? 0 : l + 1, f = c[d];
+        i(h, f);
       }
     });
     const o = this.width * 0.2, a = [];
-    return this.doorLineSegment.forEach((l) => {
-      if (l.length() < 0.4) return;
-      const h = l.clone().expansion(-this.width * 0.5);
-      if (s = "cyan", h.length() < 1.2) {
-        h.expansion(-o * 0.5);
-        const c = l.normal();
-        let d = new E(
-          h.start.clone(),
-          h.start.clone().add(c.clone().multiplyScalar(h.length()))
+    return this.doorLineSegment.forEach((c) => {
+      if (c.length() < 0.4) return;
+      const l = c.clone().expansion(-this.width * 0.5);
+      if (s = "cyan", l.length() < 1.2) {
+        l.expansion(-o * 0.5);
+        const h = c.normal();
+        let d = new D(
+          l.start.clone(),
+          l.start.clone().add(h.clone().multiplyScalar(l.length()))
         );
-        const f = d.clone().directionMove(d.normal(), h.length() * -0.5).expandToRectangle(h.length(), "bothSides");
-        for (let m = 0; m < a.length; m++)
-          if (a[m].intersectRectangle(f)) {
-            d = new E(
-              h.start.clone(),
-              h.start.clone().add(c.clone().multiplyScalar(-h.length()))
+        const f = d.clone().directionMove(d.normal(), l.length() * -0.5).expandToRectangle(l.length(), "bothSides");
+        for (let M = 0; M < a.length; M++)
+          if (a[M].intersectRectangle(f)) {
+            d = new D(
+              l.start.clone(),
+              l.start.clone().add(h.clone().multiplyScalar(-l.length()))
             );
             break;
           }
-        d.expansion(-o * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((m, S) => i(m, S));
-        const p = h.length(), y = d.length(), g = (p ** 2 + y ** 2) / (2 * y), x = d.end.clone().add(d.direction().multiplyScalar(-g)), [M, w] = this.getArcAngleRange(x, h.end, d.end);
-        r(x, g, Math.min(M, w), Math.max(M, w)), a.push(f);
+        d.expansion(-o * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((M, S) => i(M, S));
+        const p = l.length(), y = d.length(), g = (p ** 2 + y ** 2) / (2 * y), x = d.end.clone().add(d.direction().multiplyScalar(-g)), [m, L] = this.getArcAngleRange(x, l.end, d.end);
+        r(x, g, Math.min(m, L), Math.max(m, L)), a.push(f);
       } else
-        h.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((c, d) => i(c, d)), h.clone().directionMove(h.normal(), o * 0.5).directionMove(h.direction(), o * 0.5).expansion(-h.length() * 0.45, "end").forward(o * 0.5).expandToRectangle(o).path2D((c, d) => i(c, d)), h.clone().directionMove(h.normal(), -o * 0.5).directionMove(h.direction(), -o * 0.5).expansion(-h.length() * 0.45, "start").forward(-o * 0.5).expandToRectangle(o).path2D((c, d) => i(c, d));
-    }), s = "yellow", this.lineSegments.forEach((l) => {
-      if (!l.userData.isWindow) return !1;
-      Array.isArray(l.userData.drawWindow) && l.userData.drawWindow.forEach((h) => {
-        const { p: c, width: d } = h, f = D.from(c), p = f.clone().add(l.direction().multiplyScalar(d * 0.5)), y = f.clone().add(l.direction().multiplyScalar(-d * 0.5)), g = new E(p, y);
-        i(g.start, g.end), g.expandToRectangle(this.width, "bothSides").path2D((x, M) => i(x, M));
+        l.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((h, d) => i(h, d)), l.clone().directionMove(l.normal(), o * 0.5).directionMove(l.direction(), o * 0.5).expansion(-l.length() * 0.45, "end").forward(o * 0.5).expandToRectangle(o).path2D((h, d) => i(h, d)), l.clone().directionMove(l.normal(), -o * 0.5).directionMove(l.direction(), -o * 0.5).expansion(-l.length() * 0.45, "start").forward(-o * 0.5).expandToRectangle(o).path2D((h, d) => i(h, d));
+    }), s = "yellow", this.lineSegments.forEach((c) => {
+      if (!c.userData.isWindow) return !1;
+      Array.isArray(c.userData.drawWindow) && c.userData.drawWindow.forEach((l) => {
+        const { p: h, width: d } = l, f = w.from(h), p = f.clone().add(c.direction().multiplyScalar(d * 0.5)), y = f.clone().add(c.direction().multiplyScalar(-d * 0.5)), g = new D(p, y);
+        i(g.start, g.end), g.expandToRectangle(this.width, "bothSides").path2D((x, m) => i(x, m));
       });
     }), n;
   }
@@ -2944,8 +3042,8 @@ class k extends z {
     if (typeof window < "u")
       i = document.createElement("canvas");
     else if (typeof global < "u") {
-      const { createCanvas: l } = await X("canvas");
-      i = l();
+      const { createCanvas: c } = await H("canvas");
+      i = c();
     } else
       throw new Error("创建画布失败");
     const r = 2 * s.scale, o = {
@@ -2955,17 +3053,17 @@ class k extends z {
     };
     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, h, c, d, f]) => {
-      a.strokeStyle = o[f], a.beginPath(), a.moveTo(l, h), a.lineTo(c, d), a.closePath(), a.stroke();
-    }), s.arc.forEach(([l, h, c, d, f, p]) => {
-      a.strokeStyle = o[p], a.beginPath(), a.arc(l, h, c, d * (Math.PI / 180), f * (Math.PI / 180)), a.stroke();
-    }), a.beginPath(), s.dimensionLine.forEach((l) => {
-      let [h, c, d, f] = l;
-      const p = Math.min(c, f), y = Math.max(c, f), g = (i.width * 0.5 - 0.4 * s.scale) * (h < 0 ? -1 : 1), x = (y - p) * 0.45;
+    return n && (a.fillStyle = n, a.fillRect(0, 0, i.width, i.height)), a.translate(s.width * 0.5 + r, s.height * 0.5 + r), a.scale(1, -1), s.line.forEach(([c, l, h, d, f]) => {
+      a.strokeStyle = o[f], a.beginPath(), a.moveTo(c, l), a.lineTo(h, d), a.closePath(), a.stroke();
+    }), s.arc.forEach(([c, l, h, d, f, p]) => {
+      a.strokeStyle = o[p], a.beginPath(), a.arc(c, l, h, d * (Math.PI / 180), f * (Math.PI / 180)), a.stroke();
+    }), a.beginPath(), s.dimensionLine.forEach((c) => {
+      let [l, h, d, f] = c;
+      const p = Math.min(h, f), y = Math.max(h, f), g = (i.width * 0.5 - 0.4 * s.scale) * (l < 0 ? -1 : 1), x = (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(g, p + (y - p) * 0.5), a.scale(1, -1), a.fillText((y - p).toFixed(2) + "cm", 0, 0), a.restore(), a.moveTo(g - 0.1 * s.scale, p), a.lineTo(g + 0.1 * s.scale, p), a.moveTo(g, p), a.lineTo(g, x + p), a.moveTo(g, y), a.lineTo(g, y - x), a.moveTo(g - 0.1 * s.scale, y), a.lineTo(g + 0.1 * s.scale, y);
-    }), a.closePath(), a.strokeStyle = "#fff", a.stroke(), "toBlob" in i ? new Promise((l) => {
-      i.toBlob((h) => {
-        l(h);
+    }), a.closePath(), a.strokeStyle = "#fff", a.stroke(), "toBlob" in i ? new Promise((c) => {
+      i.toBlob((l) => {
+        c(l);
       }, e, 1);
     }) : i.toBuffer(e, { quality: 1 });
   }
@@ -2973,15 +3071,15 @@ class k extends z {
    * 将点json结构转换为Dxf string
    */
   toDxfString(t = "Millimeters") {
-    const e = new it();
-    e.setUnits(t), e.addLayer("cyan", it.ACI.CYAN, "DOTTED"), e.addLayer("yellow", it.ACI.YELLOW, "DOTTED"), e.addLayer("white", it.ACI.WHITE, "DOTTED");
+    const e = new st();
+    e.setUnits(t), e.addLayer("cyan", st.ACI.CYAN, "DOTTED"), e.addLayer("yellow", st.ACI.YELLOW, "DOTTED"), e.addLayer("white", st.ACI.WHITE, "DOTTED");
     const n = this.toDrawDataJson();
     return n.line.forEach((s) => {
-      let [i, r, o, a, l] = s;
-      e.setActiveLayer(l), e.drawLine(i, r, o, a);
+      let [i, r, o, a, c] = s;
+      e.setActiveLayer(c), e.drawLine(i, r, o, a);
     }), n.arc.forEach((s) => {
-      const [i, r, o, a, l, h] = s;
-      e.setActiveLayer(h), e.drawArc(i, r, o, a, l);
+      const [i, r, o, a, c, l] = s;
+      e.setActiveLayer(l), e.drawArc(i, r, o, a, c);
     }), e.toDxfString();
   }
   /**
@@ -3000,7 +3098,7 @@ class k extends z {
     if (typeof window < "u") {
       const s = new Blob([n], { type: "application/json" }), i = document.createElement("a");
       i.href = URL.createObjectURL(s), i.download = t, i.click();
-    } else typeof global < "u" && (await X("fs", !1)).writeFileSync(t, n);
+    } else typeof global < "u" && (await H("fs", !1)).writeFileSync(t, n);
   }
   /**
    * 下载
@@ -3010,7 +3108,7 @@ class k extends z {
     if (typeof window < "u") {
       const n = this.toDxfBlob(e), s = document.createElement("a");
       s.href = URL.createObjectURL(n), s.download = t + ".dxf", s.click();
-    } else typeof global < "u" && (await X("fs", !1)).writeFileSync(t, this.toDxfString(e));
+    } else typeof global < "u" && (await H("fs", !1)).writeFileSync(t, this.toDxfString(e));
   }
   /**
    * 下载
@@ -3022,7 +3120,7 @@ class k extends z {
     if (typeof window < "u") {
       const i = document.createElement("a");
       i.href = URL.createObjectURL(s), i.download = t, i.click();
-    } else typeof global < "u" ? (await X("fs", !1)).writeFileSync(t, s) : console.error("图片下载失败");
+    } else typeof global < "u" ? (await H("fs", !1)).writeFileSync(t, s) : console.error("图片下载失败");
     return !0;
   }
   /**
@@ -3030,8 +3128,8 @@ class k extends z {
    * @description 计算所有线段的起点和终点的最小最大值，形成一个边界框
    * @returns 
    */
-  computedOriginalSize(t, e = new R(0, 0, 0, 0)) {
-    const n = t.flatMap((l) => [l.start.x, l.end.x]), s = t.flatMap((l) => [l.start.y, l.end.y]), i = Math.min(...n), r = Math.min(...s), o = Math.max(...n), a = Math.max(...s);
+  computedOriginalSize(t, e = new I(0, 0, 0, 0)) {
+    const n = t.flatMap((c) => [c.start.x, c.end.x]), s = t.flatMap((c) => [c.start.y, c.end.y]), i = Math.min(...n), r = Math.min(...s), o = Math.max(...n), a = Math.max(...s);
     return e.set(i, r, o, a), e;
   }
   /**
@@ -3043,13 +3141,13 @@ class k extends z {
     let n = 0;
     return t.flatMap((i) => {
       const r = i.map((o, a) => {
-        const l = a === i.length - 1 ? 0 : a + 1, h = i[l];
+        const c = a === i.length - 1 ? 0 : a + 1, l = i[c];
         return {
           start: { x: o.x, y: o.y },
-          end: { x: h.x, y: h.y },
+          end: { x: l.x, y: l.y },
           insetionArr: [
             {
-              index: l + n
+              index: c + n
             }
           ]
         };
@@ -3058,8 +3156,8 @@ class k extends z {
     });
   }
 }
-const _ = new E();
-class je extends k {
+const z = new D();
+class ke extends k {
   static name = "AngleCorrectionDxf";
   angle = 0;
   onAddFromParent(t) {
@@ -3068,44 +3166,44 @@ class je extends k {
   async update() {
     const t = this.parent, e = t.findComponentByName("Dxf"), n = t.findComponentByName("LineAnalysis");
     let s = 0, i = null;
-    for (let h = 0; h < e.originalData.length; h++) {
-      const c = e.originalData[h];
-      if (_.start.copy(c.start), _.end.copy(c.end), c.isVerticalReferenceLine) {
-        const [d, f] = c.start.y < c.end.y ? [_.start, _.end] : [_.end, _.start];
-        s = -new E(d, f).direction().angleBetween(new D(0, 1), "angle", "360"), i = null;
+    for (let l = 0; l < e.originalData.length; l++) {
+      const h = e.originalData[l];
+      if (z.start.copy(h.start), z.end.copy(h.end), h.isVerticalReferenceLine) {
+        const [d, f] = h.start.y < h.end.y ? [z.start, z.end] : [z.end, z.start];
+        s = -new D(d, f).direction().angleBetween(new w(0, 1), "angle", "360"), i = null;
         break;
       }
-      (!i || _.length() > i.length()) && (i = _.clone(), i.userData.index = h);
+      (!i || z.length() > i.length()) && (i = z.clone(), i.userData.index = l);
     }
     if (i) {
       e.originalData[i.userData.index].isVerticalReferenceLine = !0;
-      const [h, c] = i.start.y < i.end.y ? [i.start, i.end] : [i.end, i.start];
-      s = -new E(h, c).direction().angleBetween(new D(0, 1), "angle", "360");
+      const [l, h] = i.start.y < i.end.y ? [i.start, i.end] : [i.end, i.start];
+      s = -new D(l, h).direction().angleBetween(new w(0, 1), "angle", "360");
     }
-    function r(h, c) {
-      return h.division(o).rotate(D.zero(), c * (Math.PI / 180));
+    function r(l, h) {
+      return l.division(o).rotate(w.zero(), h * (Math.PI / 180));
     }
-    const o = e.originalBox.center, a = D.zero(), l = e.originalData.map((h) => {
-      const c = r(a.copy(h.start), s).toJson(h.start.z), d = r(a.copy(h.end), s).toJson(h.start.z), f = Object.assign(W(h), { start: c, end: d });
+    const o = e.originalBox.center, a = w.zero(), c = e.originalData.map((l) => {
+      const h = r(a.copy(l.start), s).toJson(l.start.z), d = r(a.copy(l.end), s).toJson(l.start.z), f = Object.assign(J(l), { start: h, end: d });
       return f.drawWindow && f.drawWindow.forEach((p) => p.p = r(a.copy(p.p), s).toJson(p.p.z)), f;
     });
-    n.appendLineSegmentList.forEach((h) => {
-      const c = h.clone();
-      r(c.start, s), r(c.end, s), l.push({
-        start: c.start.toJson(e.originalZAverage),
-        end: c.end.toJson(e.originalZAverage),
+    n.appendLineSegmentList.forEach((l) => {
+      const h = l.clone();
+      r(h.start, s), r(h.end, s), c.push({
+        start: h.start.toJson(e.originalZAverage),
+        end: h.end.toJson(e.originalZAverage),
         insetionArr: [],
-        length: c.length()
+        length: h.length()
       });
-    }), await this.set(l, e.width, e.scale), this.lineOffset(), this.doorLineSegment = e.doorLineSegment.map((h) => {
-      const c = h.clone();
-      return c.start.division(o).rotate(D.zero(), s * (Math.PI / 180)), c.end.division(o).rotate(D.zero(), s * (Math.PI / 180)), c;
+    }), await this.set(c, e.width, e.scale), this.lineOffset(), this.doorLineSegment = e.doorLineSegment.map((l) => {
+      const h = l.clone();
+      return h.start.division(o).rotate(w.zero(), s * (Math.PI / 180)), h.end.division(o).rotate(w.zero(), s * (Math.PI / 180)), h;
     }), this.angle = s, this.dispatchEvent({
       type: "updateData"
     });
   }
 }
-class Ut extends z {
+class Ut extends G {
   static name = "Variable";
   originalLineVisible = !0;
   dxfVisible = !0;
@@ -3132,7 +3230,7 @@ class Ut extends z {
     if (t in this) return this[t];
   }
 }
-class Gt extends z {
+class zt extends G {
   static name = "LineAnalysis";
   Dxf = null;
   Variable = null;
@@ -3162,11 +3260,11 @@ class Gt extends z {
     return {
       points: [
         // 第一条线
-        new D(t.x + o, t.y + a).add(r),
-        new D(e.x + o, e.y + a).add(i),
+        new w(t.x + o, t.y + a).add(r),
+        new w(e.x + o, e.y + a).add(i),
         // 第二条线
-        new D(t.x - o, t.y - a).add(r),
-        new D(e.x - o, e.y - a).add(i)
+        new w(t.x - o, t.y - a).add(r),
+        new w(e.x - o, e.y - a).add(i)
       ],
       indices: [0, 1, 1, 3, 3, 2, 2, 0],
       rectIndices: [0, 1, 3, 2, 0]
@@ -3180,7 +3278,7 @@ class Gt extends z {
    */
   addData(t, e) {
     const n = this.Dxf;
-    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new E(t.clone(), e.clone()));
+    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new D(t.clone(), e.clone()));
   }
   /** 结果分析创建矩形
    * @param result 
@@ -3188,14 +3286,14 @@ class Gt extends z {
   createRectangle(t) {
     const e = this.Dxf, n = t.project, s = t.project2;
     n.includedAngle(s) > 135 && (s.points = [s.points[1], s.points[0]]), this.addData(n.points[0], s.points[0]), this.addData(n.points[1], s.points[1]);
-    const i = n.points[0].distance(s.points[0]), r = n.points[1].distance(s.points[1]), o = Math.ceil(Math.max(i, r) / e.width), a = i / o, l = r / o, h = s.points[0].direction(n.points[0]), c = s.points[1].direction(n.points[1]), d = n.points[0].clone(), f = n.points[1].clone(), p = f.direction(d);
+    const i = n.points[0].distance(s.points[0]), r = n.points[1].distance(s.points[1]), o = Math.ceil(Math.max(i, r) / e.width), a = i / o, c = r / o, l = s.points[0].direction(n.points[0]), h = s.points[1].direction(n.points[1]), d = n.points[0].clone(), f = n.points[1].clone(), p = f.direction(d);
     p.multiplyScalar(e.width * 0.5);
-    const y = d.clone().add(p), g = f.clone().add(p.multiplyScalar(-1)), x = d.direction(f), M = y.direction(g);
-    if (!(x.x > 0 && M.x < 0 || x.x < 0 && M.x > 0 || x.y > 0 && M.y < 0 || x.y < 0 && M.y > 0)) {
+    const y = d.clone().add(p), g = f.clone().add(p.multiplyScalar(-1)), x = d.direction(f), m = y.direction(g);
+    if (!(x.x > 0 && m.x < 0 || x.x < 0 && m.x > 0 || x.y > 0 && m.y < 0 || x.y < 0 && m.y > 0)) {
       d.set(y.x, y.y), f.set(g.x, g.y);
-      for (let w = 1; w < o; w++) {
-        const m = h.clone().multiplyScalar(a * w), S = c.clone().multiplyScalar(l * w), A = d.clone().add(m), L = f.clone().add(S);
-        this.addData(A, L);
+      for (let L = 1; L < o; L++) {
+        const M = l.clone().multiplyScalar(a * L), S = h.clone().multiplyScalar(c * L), A = d.clone().add(M), E = f.clone().add(S);
+        this.addData(A, E);
       }
     }
   }
@@ -3205,7 +3303,7 @@ class Gt extends z {
    */
   buildQuadtree() {
     const t = this.Dxf, e = [];
-    this.quadtree = new O(t.originalBox, 2), t.lineSegments.forEach((n) => {
+    this.quadtree = new B(t.originalBox, 2), t.lineSegments.forEach((n) => {
       n.userData?.isDoor || (this.quadtree?.insert({
         line: n,
         userData: e.length
@@ -3222,12 +3320,12 @@ class Gt extends z {
     this.buildQuadtree();
     const t = this.quadtree, e = this.lineSegmentList, n = /* @__PURE__ */ new Set(), s = [];
     e.forEach((i, r) => {
-      const o = e[r], a = st.fromByLineSegment(o, this.width * 2, !1, -0.01);
-      t.queryRect(a).map((h) => h.userData).filter((h) => h !== r).forEach((h) => {
+      const o = e[r], a = nt.fromByLineSegment(o, this.width * 2, !1, -0.01);
+      t.queryRect(a).map((l) => l.userData).filter((l) => l !== r).forEach((l) => {
         try {
-          if (n.has(`${r}-${h}`) || n.has(`${h}-${r}`)) return;
-          const c = this.projectionAnalysis(h, r, o, e);
-          c && s.push(c), n.add(`${r}-${h}`);
+          if (n.has(`${r}-${l}`) || n.has(`${l}-${r}`)) return;
+          const h = this.projectionAnalysis(l, r, o, e);
+          h && s.push(h), n.add(`${r}-${l}`);
         } catch {
         }
       });
@@ -3242,34 +3340,34 @@ class Gt extends z {
   projectionAnalysis(t, e, n, s) {
     const i = s[t], r = n.direction(), o = i.direction(), a = r.angleBetween(o) / (Math.PI / 180);
     if (a < this.errorAngle || a > 180 - this.errorAngle) {
-      let l;
-      const h = i.projectLineSegment(n), c = n.projectLineSegment(i);
-      return h.getLength() > c.getLength() ? l = {
+      let c;
+      const l = i.projectLineSegment(n), h = n.projectLineSegment(i);
+      return l.getLength() > h.getLength() ? c = {
         target: i,
         targetIndex: t,
         source: n,
         sourceIndex: e,
-        project: h,
-        project2: c
-      } : l = {
+        project: l,
+        project2: h
+      } : c = {
         target: n,
         targetIndex: e,
         source: i,
         sourceIndex: t,
-        project: c,
-        project2: h
-      }, !l || l.project.getLength() < 0.2 || l.project2.getLength() < 0.2 ? void 0 : l;
+        project: h,
+        project2: l
+      }, !c || c.project.getLength() < 0.2 || c.project2.getLength() < 0.2 ? void 0 : c;
     }
   }
 }
-class Fe {
+class Ye {
   // 所有可查找的点位
   possibleDoorPoints = [];
   doorPoint = [];
   calculatedDoorPoint = [];
   dxf;
   // 包含所有点的虚拟网格
-  pointVirtualGrid = new G();
+  pointVirtualGrid = new Y();
   // 只包含可查找点的虚拟网格
   findPointVirtualGrid;
   quadtree;
@@ -3282,15 +3380,15 @@ class Fe {
   lineAnalysis;
   continueFind = !0;
   constructor(t) {
-    this.lineAnalysis = t, this.dxf = t.Dxf, this.findPointVirtualGrid = new G(), this.quadtree = t.quadtree, this.resultList = t.resultList, this.lineSegments = t.lineSegmentList, this.dxf.doorLineSegment.length = 0, this.lineSegments.forEach((i) => {
+    this.lineAnalysis = t, this.dxf = t.Dxf, this.findPointVirtualGrid = new Y(), this.quadtree = t.quadtree, this.resultList = t.resultList, this.lineSegments = t.lineSegmentList, this.dxf.doorLineSegment.length = 0, this.lineSegments.forEach((i) => {
       this.pointVirtualGrid.insert(i.start, i), this.pointVirtualGrid.insert(i.end, i);
     });
     const { doorPoints: e, calculatedDoorPoint: n } = this.getDoorPoint();
     this.doorPoint = e, this.calculatedDoorPoint = n;
     const s = this.searchDoubleLinePoint();
     this.addPointsExcludeRule((i, r, o) => {
-      const a = this.lineSegments.indexOf(i), l = s.get(a);
-      return typeof l == "number" ? l === -1 || l === o : !1;
+      const a = this.lineSegments.indexOf(i), c = s.get(a);
+      return typeof c == "number" ? c === -1 || c === o : !1;
     }), this.addPointsExcludeRule((i, r) => !!this.doorPoint.find((o) => o.point.equal(r))), this.addPointsExcludeRule((i, r) => !!this.calculatedDoorPoint.find((o) => o.point.equal(r))), this.possibleDoorPoints = this.getPossiblePoints(), this.possibleDoorPoints.forEach((i) => this.findPointVirtualGrid.insert(i.point, i.line)), this.handle();
   }
   handle() {
@@ -3307,32 +3405,32 @@ class Fe {
   search(t, e = [], n = 0.6, s = this.doorSearchDistance, i = this.doorSearchNearAngle) {
     const r = this.dxf, o = this.searchNearby(t, e, s, i);
     o.push(
-      ...t.map((l) => {
-        const h = this.searchAlongDirection(l, s);
+      ...t.map((c) => {
+        const l = this.searchAlongDirection(c, s);
+        if (l) return {
+          start: c.point,
+          end: l.point
+        };
+        const h = this.searchAlongNormalDirection(c, s);
         if (h) return {
-          start: l.point,
+          start: c.point,
           end: h.point
         };
-        const c = this.searchAlongNormalDirection(l, s);
-        if (c) return {
-          start: l.point,
-          end: c.point
-        };
-      }).filter((l) => !!l && l.start.distance(l.end) < s)
+      }).filter((c) => !!c && c.start.distance(c.end) < s)
     );
     const a = [];
-    return o.forEach((l) => {
-      const h = new E(l?.start, l?.end), c = h.length();
-      if (c < n) return;
-      const d = h.normal(), f = h.direction(), p = (c - r.width * 2) / 2;
+    return o.forEach((c) => {
+      const l = new D(c?.start, c?.end), h = l.length();
+      if (h < n) return;
+      const d = l.normal(), f = l.direction(), p = (h - r.width * 2) / 2;
       for (let y = 0; y < 3; y++) {
-        const g = h.start.clone().add(f.clone().multiplyScalar(r.width + p * y)), x = new E(
+        const g = l.start.clone().add(f.clone().multiplyScalar(r.width + p * y)), x = new D(
           g,
           g.clone().add(d.clone().multiplyScalar(1))
         );
         if (x.directionMove(d, -0.5), this.quadtree.queryLineSegment(x).length) return;
       }
-      a.push(h);
+      a.push(l);
     }), a;
   }
   /** 添加可查找点的过滤规则
@@ -3363,28 +3461,28 @@ class Fe {
       const r = n.lineSegments[i[4]], o = n.originalData[i[4]];
       if (o.doorDirectConnection) {
         this.continueFind = !1;
-        const a = new E(D.from(o.start), D.from(o.end));
+        const a = new D(w.from(o.start), w.from(o.end));
         a.userData = {
           doorDirectConnection: !0,
           isDoor: !0
-        }, this.dxf.doorLineSegment.push(a), a.points.forEach((l) => {
-          const h = s.queryPoint(l);
-          h.length && e.push({
-            line: h[0].userData,
-            point: h[0].point,
+        }, this.dxf.doorLineSegment.push(a), a.points.forEach((c) => {
+          const l = s.queryPoint(c);
+          l.length && e.push({
+            line: l[0].userData,
+            point: l[0].point,
             uuid: tt()
           });
         });
       } else if (o.drawDoorData) {
-        const a = D.from(o.drawDoorData.start), l = D.from(o.drawDoorData.n), h = s.queryPoint(a).filter((c) => {
-          if (c.userData === r) return !1;
-          const d = c.userData, f = d.direction();
+        const a = w.from(o.drawDoorData.start), c = w.from(o.drawDoorData.n), l = s.queryPoint(a).filter((h) => {
+          if (h.userData === r) return !1;
+          const d = h.userData, f = d.direction();
           d.start.equal(a) && f.multiplyScalar(-1);
-          const p = l.angleBetween(f, "angle");
+          const p = c.angleBetween(f, "angle");
           return p > 170 || p < 10;
         });
-        h.length && t.push({
-          line: h[0].userData,
+        l.length && t.push({
+          line: l[0].userData,
           point: a,
           uuid: tt()
         });
@@ -3399,8 +3497,8 @@ class Fe {
   searchDoubleLinePoint() {
     const t = /* @__PURE__ */ new Map();
     return this.resultList.flatMap((e) => {
-      const n = this.lineSegments[e.sourceIndex], s = this.lineSegments[e.targetIndex], i = s.projectPoint(n.start), r = s.projectPoint(n.end), o = n.projectPoint(s.start), a = n.projectPoint(s.end), l = i && r ? -1 : i ? 0 : r ? 1 : -1, h = o && a ? -1 : o ? 0 : a ? 1 : -1;
-      t.has(e.sourceIndex) ? t.get(e.sourceIndex) != l && t.set(e.sourceIndex, -1) : t.set(e.sourceIndex, l), t.has(e.targetIndex) ? t.get(e.targetIndex) != h && t.set(e.targetIndex, -1) : t.set(e.targetIndex, h);
+      const n = this.lineSegments[e.sourceIndex], s = this.lineSegments[e.targetIndex], i = s.projectPoint(n.start), r = s.projectPoint(n.end), o = n.projectPoint(s.start), a = n.projectPoint(s.end), c = i && r ? -1 : i ? 0 : r ? 1 : -1, l = o && a ? -1 : o ? 0 : a ? 1 : -1;
+      t.has(e.sourceIndex) ? t.get(e.sourceIndex) != c && t.set(e.sourceIndex, -1) : t.set(e.sourceIndex, c), t.has(e.targetIndex) ? t.get(e.targetIndex) != l && t.set(e.targetIndex, -1) : t.set(e.targetIndex, l);
     }), t;
   }
   /** 查找方案一：最近点查找
@@ -3413,63 +3511,63 @@ class Fe {
    */
   searchNearby(t, e = [], n = this.doorSearchDistance, s = this.doorSearchNearAngle) {
     const i = this.findPointVirtualGrid, r = this.quadtree;
-    function o({ point: g, line: x }, M, w) {
-      const m = x.direction();
-      x.start === g && m.multiplyScalar(-1);
-      const S = i.queryCircle(g, n).filter((L) => L.userData !== x).sort((L, b) => L.point.distance(g) - b.point.distance(g)), A = [];
-      for (let L = 0; L < S.length; L++) {
-        const b = e.findIndex((F) => F.point === S[L].point);
-        if (b === -1) continue;
-        const v = t[M].uuid, C = e[b].uuid;
-        if (w.has(`${v}.${C}`)) continue;
-        w.add(`${v}.${C}`), w.add(`${C}.${v}`);
-        const I = S[L].point, B = new E(g.clone(), I.clone());
-        if (B.direction().angleBetween(m, "angle") < s) {
-          const F = t[M].line.direction(), N = S[L].userData;
-          N.start.equal(S[L].point) && F.multiplyScalar(-1), B.direction().multiplyScalar(-1).angleBetween(F, "angle") < s && (r.queryLineSegment(B).filter((Z) => !(Z.line.start.equal(g) || Z.line.end.equal(g) || Z.line === N)).length || A.push({
-            findData: S[L],
-            findUuid: C,
-            doorLine: B,
-            doorUuid: v
+    function o({ point: g, line: x }, m, L) {
+      const M = x.direction();
+      x.start === g && M.multiplyScalar(-1);
+      const S = i.queryCircle(g, n).filter((E) => E.userData !== x).sort((E, T) => E.point.distance(g) - T.point.distance(g)), A = [];
+      for (let E = 0; E < S.length; E++) {
+        const T = e.findIndex((R) => R.point === S[E].point);
+        if (T === -1) continue;
+        const C = t[m].uuid, N = e[T].uuid;
+        if (L.has(`${C}.${N}`)) continue;
+        L.add(`${C}.${N}`), L.add(`${N}.${C}`);
+        const O = S[E].point, q = new D(g.clone(), O.clone());
+        if (q.direction().angleBetween(M, "angle") < s) {
+          const R = t[m].line.direction(), v = S[E].userData;
+          v.start.equal(S[E].point) && R.multiplyScalar(-1), q.direction().multiplyScalar(-1).angleBetween(R, "angle") < s && (r.queryLineSegment(q).filter((W) => !(W.line.start.equal(g) || W.line.end.equal(g) || W.line === v)).length || A.push({
+            findData: S[E],
+            findUuid: N,
+            doorLine: q,
+            doorUuid: C
           }));
         }
       }
       return A;
     }
-    function a(g, x, M, w, m) {
-      w.add(g);
+    function a(g, x, m, L, M) {
+      L.add(g);
       const S = [];
-      m && S.push(m);
-      for (let A = 0; A < M.length; A++) {
-        const L = M[A];
-        if (x.has(L.findUuid)) {
-          const b = x.get(L.findUuid);
-          a(L.findUuid, x, b, w, L) && S.push(L);
-        } else S.push(L);
+      M && S.push(M);
+      for (let A = 0; A < m.length; A++) {
+        const E = m[A];
+        if (x.has(E.findUuid)) {
+          const T = x.get(E.findUuid);
+          a(E.findUuid, x, T, L, E) && S.push(E);
+        } else S.push(E);
       }
-      return S.sort((A, L) => A.doorLine.length() - L.doorLine.length()), m && S[0] === m ? (M.splice(0), !0) : (M.splice(1), !1);
+      return S.sort((A, E) => A.doorLine.length() - E.doorLine.length()), M && S[0] === M ? (m.splice(0), !0) : (m.splice(1), !1);
     }
-    const l = /* @__PURE__ */ new Set(), h = /* @__PURE__ */ new Map();
+    const c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Map();
     t.map((g, x) => {
-      const M = o(g, x, l);
-      M.length && h.set(g.uuid, M);
-    }), l.clear();
-    const c = /* @__PURE__ */ new Map();
-    h.forEach((g, x) => {
-      if (!l.has(x) && g.length && a(x, h, g, l), g.length) {
-        const M = g[0];
-        c.has(M.doorUuid) || c.set(M.doorUuid, []), c.get(M.doorUuid)?.push(M), c.has(M.findUuid) || c.set(M.findUuid, []), c.get(M.findUuid)?.push(M);
+      const m = o(g, x, c);
+      m.length && l.set(g.uuid, m);
+    }), c.clear();
+    const h = /* @__PURE__ */ new Map();
+    l.forEach((g, x) => {
+      if (!c.has(x) && g.length && a(x, l, g, c), g.length) {
+        const m = g[0];
+        h.has(m.doorUuid) || h.set(m.doorUuid, []), h.get(m.doorUuid)?.push(m), h.has(m.findUuid) || h.set(m.findUuid, []), h.get(m.findUuid)?.push(m);
       }
     });
     const d = /* @__PURE__ */ new Set();
-    c.forEach((g) => {
+    h.forEach((g) => {
       if (g.length > 1) {
-        g.sort((x, M) => x.doorLine.length() - M.doorLine.length());
+        g.sort((x, m) => x.doorLine.length() - m.doorLine.length());
         for (let x = 1; x < g.length; x++) d.add(g[x]);
       }
     });
     const f = [], p = [];
-    h.forEach((g) => {
+    l.forEach((g) => {
       if (g.length) {
         const x = g[0];
         d.has(x) || (f.push(x), p.push(x.doorUuid, x.findUuid));
@@ -3477,21 +3575,21 @@ class Fe {
     });
     const y = [];
     return f.forEach((g) => {
-      const x = t.findIndex((b) => b.uuid === g.doorUuid), M = e.findIndex((b) => b.uuid === g.findUuid), w = t[x].point.clone(), m = e[M].point.clone(), S = this.findLongLineSegment(t[x].line), A = this.findLongLineSegment(e[M].line), L = S.projectPoint(m);
-      if (L) {
-        w.copy(L);
-        const b = new E(w, m), v = A.includedAngle(b);
-        (v < 10 || v > 170 || Math.abs(90 - v) < 10) && y.push({
-          start: w,
-          end: m
+      const x = t.findIndex((T) => T.uuid === g.doorUuid), m = e.findIndex((T) => T.uuid === g.findUuid), L = t[x].point.clone(), M = e[m].point.clone(), S = this.findLongLineSegment(t[x].line), A = this.findLongLineSegment(e[m].line), E = S.projectPoint(M);
+      if (E) {
+        L.copy(E);
+        const T = new D(L, M), C = A.includedAngle(T);
+        (C < 10 || C > 170 || Math.abs(90 - C) < 10) && y.push({
+          start: L,
+          end: M
         });
       } else {
-        const b = A.projectPoint(w);
-        b && m.copy(b);
-        const v = new E(w, m), C = S.includedAngle(v);
-        (C < 10 || C > 170 || Math.abs(90 - C) < 10) && y.push({
-          start: w,
-          end: m
+        const T = A.projectPoint(L);
+        T && M.copy(T);
+        const C = new D(L, M), N = S.includedAngle(C);
+        (N < 10 || N > 170 || Math.abs(90 - N) < 10) && y.push({
+          start: L,
+          end: M
         });
       }
     }), e.splice(
@@ -3512,14 +3610,14 @@ class Fe {
   searchAlongDirection({ point: t, line: e }, n = this.doorSearchDistance) {
     const s = this.quadtree, i = e.direction();
     e.start === t && i.multiplyScalar(-1);
-    const r = t.clone().add(i.clone().multiplyScalar(n)), o = new E(t.clone(), r), a = s.queryLineSegment(o).map((l) => ({
-      point: l.line.getIntersection(o),
-      line: l.line
-    })).filter((l) => l.point).sort((l, h) => t.distance(l.point) - t.distance(h.point));
+    const r = t.clone().add(i.clone().multiplyScalar(n)), o = new D(t.clone(), r), a = s.queryLineSegment(o).map((c) => ({
+      point: c.line.getIntersection(o),
+      line: c.line
+    })).filter((c) => c.point).sort((c, l) => t.distance(c.point) - t.distance(l.point));
     if (a.length) {
-      const l = a[0];
-      if (Math.abs(90 - l.line.direction().angleBetween(i, "angle")) < 5)
-        return l;
+      const c = a[0];
+      if (Math.abs(90 - c.line.direction().angleBetween(i, "angle")) < 5)
+        return c;
     }
   }
   /** 方案三： 沿法线方向查找
@@ -3531,20 +3629,20 @@ class Fe {
   searchAlongNormalDirection({ point: t, line: e }, n = this.doorSearchDistance) {
     const s = this.pointVirtualGrid, i = this.quadtree, r = e.direction(), o = e.start.normal(e.end), a = e.start.clone();
     e.start === t && r.multiplyScalar(-1), e.start === t && a.copy(e.end);
-    const l = s.queryPoint(a).filter((d) => d.userData !== e);
-    for (let d = 0; d < l.length; d++) {
-      const f = l[d], p = f.userData, y = p.direction();
+    const c = s.queryPoint(a).filter((d) => d.userData !== e);
+    for (let d = 0; d < c.length; d++) {
+      const f = c[d], p = f.userData, y = p.direction();
       if (p.start === f.point && r.multiplyScalar(-1), y.angleBetween(o) / (Math.PI / 180) > 90) {
         o.multiplyScalar(-1);
         break;
       }
     }
-    const h = new E(t.clone(), t.clone().add(o.multiplyScalar(n))), c = i.queryLineSegment(h).map((d) => ({
-      point: d.line.getIntersection(h),
+    const l = new D(t.clone(), t.clone().add(o.multiplyScalar(n))), h = i.queryLineSegment(l).map((d) => ({
+      point: d.line.getIntersection(l),
       line: d.line
     })).filter((d) => d.point).sort((d, f) => t.distance(d.point) - t.distance(f.point));
-    if (c.length) {
-      const d = c[0];
+    if (h.length) {
+      const d = h[0];
       if (Math.abs(90 - d.line.direction().angleBetween(o, "angle")) < 5)
         return d;
     }
@@ -3573,7 +3671,7 @@ class Fe {
     return e;
   }
 }
-class qe extends z {
+class Xe extends G {
   doorSearchNearAngle = 110;
   doorSearchDistance = 2;
   DoorsAnalysis;
@@ -3585,80 +3683,74 @@ class qe extends z {
    * @param parent 
    */
   onAddFromParent(t) {
-    const e = t.findComponentByType(k), n = this.parent?.findComponentByType(Gt);
+    const e = t.findComponentByType(k), n = this.parent?.findComponentByType(zt);
     e.addEventListener("createGroup", () => {
-      this.skipFindDoor ? this.needsSaveDoor && (this.doors = e.doors.map((s) => e.lineSegments[s[4]])) : this.DoorsAnalysis = new Fe(n), this.skipFindDoor = !1, this.dispatchEvent({ type: "analysisCompleted" });
+      this.skipFindDoor ? this.needsSaveDoor && (this.doors = e.doors.map((s) => e.lineSegments[s[4]])) : this.DoorsAnalysis = new Ye(n), this.skipFindDoor = !1, this.dispatchEvent({ type: "analysisCompleted" });
     });
   }
 }
-function Ue(u) {
-  const t = new G();
-  for (const e of u)
-    t.insert(e.start, e), t.insert(e.end, e);
-  return t;
-}
-function Ge(u, t) {
+function Ve(u, t) {
   const e = t.queryPoint(u.start, !0)[0], n = t.queryPoint(u.end, !0)[0];
   if (e && n) {
     const s = e.userData.length(), i = n.userData.length();
     if (Math.abs(s - i) < 1e-9) return null;
-    const r = e.userData?.getAnotherPoint(e.point), o = n.userData?.getAnotherPoint(n.point), a = r.direction(e.point), l = o.direction(n.point);
-    if (a.angleBetween(l) > 1e-9) return null;
-    const h = s > i ? n : e, c = h.userData, d = c.getAnotherPoint(h.point), f = t.queryPoint(d, !0)[0];
+    const r = e.userData?.getAnotherPoint(e.point), o = n.userData?.getAnotherPoint(n.point), a = r.direction(e.point), c = o.direction(n.point);
+    if (a.angleBetween(c) > 1e-9) return null;
+    const l = s > i ? n : e, h = l.userData, d = h.getAnotherPoint(l.point), f = t.queryPoint(d, !0)[0];
     if (!f) return null;
     const p = f.userData?.getAnotherPoint(f.point), y = p.direction(f.point);
-    return (u.start.equal(h.point) ? u.end : u.start).direction(h.point).angleBetween(y, "angle") < 1 ? null : c;
+    return (u.start.equal(l.point) ? u.end : u.start).direction(l.point).angleBetween(y, "angle") < 1 ? null : h;
   }
   return null;
 }
-function ze(u, t) {
-  const e = new O(R.fromByLineSegment(...u)), n = t.clone().expansion(100), s = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set();
+function We(u, t) {
+  const e = new B(I.fromByLineSegment(...u)), n = t.clone().expansion(100), s = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set();
   u.forEach((a) => e.insert(a));
   const r = e.queryLineSegment(n);
   for (let a = 0; a < r.length; a++) {
-    const { line: l } = r[a];
-    if (l.parallel(n)) {
-      s.add(l);
+    const { line: c } = r[a];
+    if (c.parallel(n)) {
+      s.add(c);
       continue;
     }
-    const h = l.getIntersection(n);
-    if (h) {
-      if (l.start.equal(h) || l.end.equal(h)) continue;
-      const c = E.clipping(l, [h], Ft);
-      s.add(l), c.forEach((d) => i.add(d));
+    const l = c.getIntersection(n);
+    if (l) {
+      if (c.start.equal(l) || c.end.equal(l)) continue;
+      const h = D.clipping(c, [l], qt);
+      s.add(c), h.forEach((d) => i.add(d));
     }
   }
   u = u.filter((a) => !s.has(a)), u.push(...i);
-  const o = E.groupByPosition(u, n);
+  const o = D.groupByPosition(u, n);
   return o.forEach((a) => {
-    const l = new nt();
-    for (let c = 0; c < a.length; c++) {
-      const d = a[c], f = d.start.hashCode(), p = d.end.hashCode();
-      l.append(f, d.start), l.append(p, d.end);
+    const c = new at();
+    for (let h = 0; h < a.length; h++) {
+      const d = a[h], f = d.start.hashCode(), p = d.end.hashCode();
+      c.append(f, d.start), c.append(p, d.end);
     }
-    const h = l.filter((c) => c.length === 1).map((c) => c[0]);
-    if (h.length === 2) {
-      const c = new E(h[0].clone(), h[1].clone());
-      a.push(c);
+    const l = c.filter((h) => h.length === 1).map((h) => h[0]);
+    if (l.length === 2) {
+      const h = new D(l[0].clone(), l[1].clone());
+      a.push(h);
     }
-  }), o;
+  }), e.clear(), o;
 }
-function zt(u) {
-  if (u = u.map((n) => n.clone()), u = E.brokenLineMerging(u, $), u.length <= 4) return [u];
+function _t(u) {
+  if (u = u.map((n) => n.clone()), u = D.brokenLineMerging(u, $), u.length <= 4) return [u];
   u = u.sort((n, s) => s.length() - n.length());
-  const t = Ue(u), e = [];
+  const t = V(u), e = [];
   for (let n = 0; n < u.length; n++) {
-    const s = u[n], i = Ge(s, t);
+    const s = u[n], i = Ve(s, t);
     if (i) {
-      ze(u, i).forEach((r) => {
-        r.length === 4 ? e.push(r) : e.push(...zt(r));
+      We(u, i).forEach((r) => {
+        r.length === 4 ? e.push(r) : e.push(..._t(r));
       });
       break;
     }
   }
-  return e;
+  return t.clear(), e;
 }
-class _e extends z {
+class He extends G {
   static name = "ThreeVJia";
   lineSegments = [];
   neededUpdate = !0;
@@ -3675,7 +3767,7 @@ class _e extends z {
     const e = t.reduce((n, s) => {
       let i = s.userData.groupId ?? "door";
       return s.userData.groupType === "wall" && (i = "wall"), n.append(i, s);
-    }, new nt());
+    }, new at());
     return e.size === 1 ? null : e;
   }
   /** 更新
@@ -3691,11 +3783,11 @@ class _e extends z {
     const e = t.group((r, o) => ({ wall: "wall", door: "wall" })[o] ?? "doubleWall"), n = e.get("wall") ?? [], s = e.get("doubleWall") ?? [];
     let i = [];
     n.forEach((r) => i.push(...r)), s.forEach((r) => {
-      zt(r).forEach((a) => {
+      _t(r).forEach((a) => {
         if (a.length < 4) return i.push(...a);
         a = a.sort((d, f) => d.length() - f.length());
-        const l = a[0], h = a[1], c = new E(l.center.clone(), h.center.clone());
-        $(c, a), c.userData.wallWidth = l.length(), i.push(c);
+        const c = a[0], l = a[1], h = new D(c.center.clone(), l.center.clone());
+        $(h, a), h.userData.wallWidth = c.length(), i.push(h);
       });
     }), i = i.map((r) => r.clone()), this.lineSegments = i;
   }
@@ -3705,7 +3797,7 @@ class _e extends z {
   angleCorrection() {
     const t = this.parent?.findComponentByName("Dxf"), e = this.parent?.findComponentByName("AngleCorrectionDxf"), n = t.box.center;
     this.lineSegments = this.lineSegments.map((s) => (s.start.rotate(n, e.angle * (Math.PI / 180)), s.end.rotate(n, e.angle * (Math.PI / 180)), s.userData.drawWindow && s.userData.drawWindow.forEach((i) => {
-      const r = D.from(i.p);
+      const r = w.from(i.p);
       r.rotate(n, e.angle * (Math.PI / 180)), i.p = r.toJson(i.p.z);
     }), s));
   }
@@ -3716,28 +3808,28 @@ class _e extends z {
     const t = this.parent?.findComponentByName("LineAnalysis"), e = this.parent?.findComponentByName("Dxf"), n = /* @__PURE__ */ new Map();
     let s = [...e.lineSegments], i = [], r = [];
     t.resultList.forEach((a) => {
-      const l = n.get(a.target) ?? [], h = n.get(a.source) ?? [], c = a.project.clone(), d = a.project2.clone();
-      c.includedAngle(d) > 135 && (d.points = [d.points[1], d.points[0]]), l.push(...c.points), h.push(...d.points), n.set(a.target, l), n.set(a.source, h);
-      const f = new E(c.start, d.start), p = new E(c.end, d.end), y = new E(f.center, p.center);
+      const c = n.get(a.target) ?? [], l = n.get(a.source) ?? [], h = a.project.clone(), d = a.project2.clone();
+      h.includedAngle(d) > 135 && (d.points = [d.points[1], d.points[0]]), c.push(...h.points), l.push(...d.points), n.set(a.target, c), n.set(a.source, l);
+      const f = new D(h.start, d.start), p = new D(h.end, d.end), y = new D(f.center, p.center);
       y.userData.wallWidth = Math.max(f.length(), p.length()), i.push(y);
     });
     const o = [];
     s = s.filter((a) => {
       if (r.indexOf(a) > -1) return !1;
       if (n.has(a)) {
-        const l = n.get(a), h = a.clone();
-        if (l) {
-          for (let d = 0; d < l.length; d += 2) {
-            const f = l[d], p = l[d + 1];
-            f.userData.length = f.distance(h.start), p.userData.length = p.distance(h.start), f.userData.type = "start", p.userData.type = "end", h.start.distance(f) > h.start.distance(p) && (l[d] = p, l[d + 1] = f, f.userData.type = "end", p.userData.type = "start");
+        const c = n.get(a), l = a.clone();
+        if (c) {
+          for (let d = 0; d < c.length; d += 2) {
+            const f = c[d], p = c[d + 1];
+            f.userData.length = f.distance(l.start), p.userData.length = p.distance(l.start), f.userData.type = "start", p.userData.type = "end", l.start.distance(f) > l.start.distance(p) && (c[d] = p, c[d + 1] = f, f.userData.type = "end", p.userData.type = "start");
           }
-          l.sort((d, f) => d.userData.length - f.userData.length);
-          const c = [];
-          for (let d = 0; d < l.length; d++) {
-            const f = l[d];
-            f.userData.type === "start" ? (c.length === 0 && (o.push(new E(h.start.clone(), f.clone())), h.start.copy(f)), c.push("start")) : (c.pop(), c.length === 0 && h.start.copy(f));
+          c.sort((d, f) => d.userData.length - f.userData.length);
+          const h = [];
+          for (let d = 0; d < c.length; d++) {
+            const f = c[d];
+            f.userData.type === "start" ? (h.length === 0 && (o.push(new D(l.start.clone(), f.clone())), l.start.copy(f)), h.push("start")) : (h.pop(), h.length === 0 && l.start.copy(f));
           }
-          o.push(h);
+          o.push(l);
         }
         return !1;
       }
@@ -3790,7 +3882,7 @@ class _e extends z {
           };
         if (s.userData.isWindow && s.userData.drawWindow)
           return s.userData.drawWindow.map((i) => {
-            const r = D.from(i.p), o = r.clone().add(
+            const r = w.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)
@@ -3823,10 +3915,10 @@ class _e extends z {
     if (typeof window < "u") {
       const e = new Blob([JSON.stringify(this.toJson())]), n = document.createElement("a");
       n.href = URL.createObjectURL(e), n.download = t, n.click();
-    } else typeof global < "u" && (await X("fs", !1)).writeFileSync(t, JSON.stringify(this.toJson()));
+    } else typeof global < "u" && (await H("fs", !1)).writeFileSync(t, JSON.stringify(this.toJson()));
   }
 }
-class K extends ge {
+class Z extends me {
   Dxf;
   AngleCorrectionDxf;
   Variable;
@@ -3840,7 +3932,7 @@ class K extends ge {
    * @param scale 原始数据缩放比例
    */
   constructor(t = 0.1, e = 1) {
-    super(), this.environment = typeof window < "u" ? "browser" : typeof global < "u" ? "node" : "unknown", this.wallWidth = t, this.Dxf = new k(this.wallWidth, e), this.AngleCorrectionDxf = new je(), this.Variable = new Ut(), this.LineAnalysis = new Gt(), this.DoorsAnalysis = new qe(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(this.LineAnalysis), this.addComponent(this.DoorsAnalysis), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new _e()), K.finalInstance = this;
+    super(), this.environment = typeof window < "u" ? "browser" : typeof global < "u" ? "node" : "unknown", this.wallWidth = t, this.Dxf = new k(this.wallWidth, e), this.AngleCorrectionDxf = new ke(), this.Variable = new Ut(), this.LineAnalysis = new zt(), this.DoorsAnalysis = new Xe(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(this.LineAnalysis), this.addComponent(this.DoorsAnalysis), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new He()), Z.finalInstance = this;
   }
   usePlugin(t) {
     return typeof t == "function" && t.call(this, this), this;
@@ -3853,6 +3945,48 @@ class K extends ge {
     });
   }
 }
+function Et(u, t, e) {
+  return e.reduce((n, s, i) => {
+    const r = s.userData;
+    if (r.parallel(u)) n[0] = i;
+    else {
+      const o = r.center, a = u.pointPosition(o);
+      t !== a ? n[1] = i : n[2] = i;
+    }
+    return n;
+  }, [-1, -1, -1]);
+}
+function Je(u, t, e, n, s) {
+  const { point: i } = u[e[0]], r = new D(i.clone(), t.clone());
+  return r.points.forEach((o) => s.insert(o, r)), n.push(r), r;
+}
+function $e(u, t, e, n) {
+  const { point: s } = u[e[1]];
+  s.copy(t), n.update(s);
+}
+function Ke(u, t, e, n) {
+  const { point: s } = u[e[2]];
+  s.copy(t), n.update(s);
+}
+function At(u, t, e, n, s) {
+  const i = e[0] > -1, r = e[1] > -1, o = e[2] > -1;
+  if (r && $e(t, u, e, s), i) {
+    const a = Je(t, u, e, n, s);
+    r && (a.userData = J(t[e[1]].userData?.userData ?? {}));
+    return;
+  }
+  if (o) {
+    if (r) {
+      const a = t[e[1]].userData;
+      u = a.start.distance(t[e[2]].point) < a.end.distance(t[e[2]].point) ? a.start : a.end;
+    }
+    Ke(t, u, e, s);
+  }
+}
+function Ze(u, t = 0.12, e, n) {
+  const s = n.queryPoint(u.start, !0), i = n.queryPoint(u.end, !0), r = u.userData.expandDirect, o = Et(u, r, s), a = Et(u, r, i), c = r === "left" ? u.getRightDirection() : u.getLeftDirection();
+  u.directionMove(c, t * 0.5), u.points.forEach((l) => n.update(l)), At(u.start, s, o, e, n), At(u.end, i, a, e, n);
+}
 class pt {
   /** 通过轨迹点查找外墙
    * @param lines 
@@ -3860,16 +3994,16 @@ class pt {
    * @returns 
    */
   static findExtWallByTraj(t, e, n = 0.4) {
-    const s = new O(R.fromByLineSegment(...t));
+    const s = new B(I.fromByLineSegment(...t));
     return t.forEach((i) => s.insert({ line: i, userData: void 0 })), t = t.filter((i) => {
-      if (i.userData.groupType === "doubleWall") return;
+      if (i.userData.groupType === "doubleWall" || i.userData.isDoor) return;
       const r = i.center, o = /* @__PURE__ */ new Set();
       for (const a of e) {
         if (o.size === 2) break;
-        const l = new E(r, a);
-        if (!s.queryLineSegment(l).filter((c) => c.line === i ? !1 : i.userData.groupType === "wall" ? !0 : !(c.line.parallel(i) && i.getMinLength(c.line) < n && c.line.projectLineSegment(i).length() / i.length() > 0.6)).length) {
-          const c = i.pointPosition(a);
-          c !== "on" && o.add(c);
+        const c = new D(r, a);
+        if (!s.queryLineSegment(c).filter((h) => h.line === i ? !1 : i.userData.groupType === "wall" ? !0 : !(h.line.parallel(i) && i.getMinLength(h.line) < n && h.line.projectLineSegment(i).length() / i.length() > 0.6)).length) {
+          const h = i.pointPosition(a);
+          h !== "on" && o.add(h);
         }
       }
       if (i.userData.expandDirect = [...o][0], o.size < 2) return !0;
@@ -3880,100 +4014,29 @@ class pt {
    * @param trajectoryPoints 
    */
   static boundExtbyTraj(t, e, n = 0.12, s) {
-    function i(w, m) {
-      return m.queryLineSegment(w).filter((S) => S.line !== w).map(({ line: S }) => {
-        const A = { resultLine: S, type: "intersect", direction: "vertical", point: null, newLine: null };
-        w.sameEndpoint(S) && (A.type = "endpoint"), w.parallel(S) && (A.direction = "parallel");
-        const L = w.getSameEndpoint(S);
-        if (L) A.point = L[1];
-        else {
-          const b = S.getIntersection(w);
-          b && (A.point = S.start.equal(b) ? S.start : S.end);
-        }
-        return A;
-      });
-    }
-    function r(w) {
-      const m = w.userData.expandDirect;
-      if (m === "left") {
-        const S = w.getLeftDirection();
-        w.directionMove(S, n * 0.5);
-      } else if (m === "right") {
-        const S = w.getRightDirection();
-        w.directionMove(S, n * 0.5);
-      }
-    }
-    function o({ resultLine: w, type: m, direction: S, point: A }, L, b, v) {
-      const C = [];
-      if (m === "intersect")
-        A && A.copy(L.projectPoint(A) ?? A);
-      else if (S === "vertical") {
-        if (A) {
-          const I = L.projectPoint(A, !1);
-          A.copy(I), L.isPointOnSegment(I) || (L.start.distance(I) < L.end.distance(I) ? C.push(new E(I.clone(), L.start.clone())) : C.push(new E(I.clone(), L.end.clone())));
-        }
-      } else if (!p.includes(w) && A) {
-        let I = L.projectPoint(A, !1), B;
-        if (L.start.distance(A) < L.end.distance(A) ? B = L.start : B = L.end, I) {
-          C.push(new E(A.clone(), I.clone()));
-          const j = new E(I.clone(), B.clone());
-          j.length() && C.push(j);
-        }
-      }
-      b.update(w), C.forEach((I) => Object.assign(I.userData, W(w.userData))), v.push(...C);
-    }
-    function a(w) {
-      const m = w.reduce((L, b) => {
-        let v = b.userData.groupId ?? "door";
-        return b.userData.groupType === "wall" && (v = "wall"), L.append(v, b);
-      }, new nt());
-      return m.size === 1 || (m.group((L, b) => ({ wall: "wall", door: "wall" })[b] ?? "doubleWall").get("doubleWall") ?? []).forEach((L) => {
-        Bt(L).forEach((v) => {
-          v.userData.groupId = "default", v.userData.groupType = "wall";
-        });
-      }), w;
-    }
-    const l = Object.keys(e).map((w) => D.from(e[w])), h = [];
-    let c = t.map(({ start: w, end: m, ...S }) => {
-      const A = new E(D.from(w), D.from(m));
-      return A.userData = S, h.push(w.z ?? 0, m.z ?? 0), A;
+    const i = Object.keys(e).map((f) => w.from(e[f])), r = [];
+    let o = t.map(({ start: f, end: p, ...y }) => {
+      const g = new D(w.from(f), w.from(p));
+      return g.userData = y, r.push(f.z ?? 0, p.z ?? 0), g;
     });
-    const d = h.reduce((w, m) => w + m, 0) / h.length;
-    let p = pt.findExtWallByTraj(c, l).filter((w) => w.userData.expandDirect);
-    c = c.filter((w) => !p.includes(w)), c.push(...p), s && s(p, l);
-    const y = E.groupBySamePointAndParallel(p), g = new O(R.fromByLineSegment(...c));
-    c.forEach((w) => w.userData.isDoor || g.insert(w));
-    const x = y.map((w) => w.flatMap((m) => i(m, g))), M = [];
-    return y.flatMap((w, m) => (w.forEach((A) => (r(A), g.update(A))), x[m].filter((A) => {
-      if (!p.includes(A.resultLine)) {
-        let L;
-        return Object.defineProperty(A, "newLine", {
-          get() {
-            return L || (L = E.mergeLines(...w)), L;
-          }
-        }), !0;
-      }
-      o(A, E.mergeLines(...w), g, M);
-    }))).reduce((w, m) => (w.append(m.resultLine, m), w), new nt()).forEach((w) => {
-      w.reduce((m, S) => (m.has(S.point) || m.set(S.point, []), m.get(S.point)?.push(S), m), /* @__PURE__ */ new Map()).forEach((m) => {
-        const S = /* @__PURE__ */ new Set();
-        for (let A = 0; A < m.length; A++) {
-          const L = m[A];
-          S.has(L.point) || (o(L, L.newLine, g, M), S.add(L.point));
-        }
-      });
-    }), c.push(...E.deduplication(M)), c.forEach((w) => w.userData.isWindow && V(w)), c = at(c), c = E.deduplication(c), c = a(c), et(c, d);
+    const a = r.reduce((f, p) => f + p, 0) / r.length;
+    let l = pt.findExtWallByTraj(o, i).filter((f) => f.userData.expandDirect);
+    o = o.filter((f) => !l.includes(f)), o.push(...l), s && s(l, i);
+    const h = V(o), d = [];
+    return l.forEach((f) => {
+      f.userData.isDoor || Ze(f, n, d, h);
+    }), o.push(...d.filter((f) => f.length() > 1e-9)), X(...o), et(o, a);
   }
 }
-const vn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Un = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  AxisAlignCorr: qt,
+  AxisAlignCorr: Gt,
   BoundExt: pt,
   lineDataToOriginalData: et,
-  lineSegmentClipping: at,
-  recomputedWindow: V,
-  toOriginalDataItem: Ct
-}, Symbol.toStringTag, { value: "Module" })), Et = {
+  lineSegmentClipping: ft,
+  recomputedWindow: X,
+  toOriginalDataItem: Bt
+}, Symbol.toStringTag, { value: "Module" })), bt = {
   POSITION: [
     "byte",
     "byte normalized",
@@ -4001,36 +4064,36 @@ const vn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     "unsigned short"
   ]
 };
-class ct {
+class ot {
   constructor() {
     this.textureUtils = null, this.pluginCallbacks = [], this.register(function(t) {
-      return new Qe(t);
+      return new hn(t);
     }), this.register(function(t) {
-      return new tn(t);
+      return new un(t);
     }), this.register(function(t) {
-      return new rn(t);
+      return new gn(t);
     }), this.register(function(t) {
-      return new on(t);
+      return new yn(t);
     }), this.register(function(t) {
-      return new an(t);
+      return new xn(t);
     }), this.register(function(t) {
-      return new cn(t);
+      return new mn(t);
     }), this.register(function(t) {
-      return new en(t);
+      return new dn(t);
     }), this.register(function(t) {
-      return new nn(t);
+      return new fn(t);
     }), this.register(function(t) {
-      return new sn(t);
+      return new pn(t);
     }), this.register(function(t) {
-      return new ln(t);
+      return new wn(t);
     }), this.register(function(t) {
-      return new hn(t);
+      return new Mn(t);
     }), this.register(function(t) {
-      return new un(t);
+      return new Dn(t);
     }), this.register(function(t) {
-      return new dn(t);
+      return new Ln(t);
     }), this.register(function(t) {
-      return new fn(t);
+      return new Sn(t);
     });
   }
   register(t) {
@@ -4043,7 +4106,7 @@ class ct {
     return this.textureUtils = t, this;
   }
   parse(t, e, n, s) {
-    const i = new Ze(), r = [];
+    const i = new ln(), r = [];
     for (let o = 0, a = this.pluginCallbacks.length; o < a; o++)
       r.push(this.pluginCallbacks[o](i));
     i.setPlugins(r), i.setTextureUtils(this.textureUtils), i.writeAsync(t, e, s).catch(n);
@@ -4055,7 +4118,7 @@ class ct {
     });
   }
 }
-const T = {
+const b = {
   POINTS: 0,
   LINES: 1,
   LINE_LOOP: 2,
@@ -4079,34 +4142,34 @@ const T = {
   CLAMP_TO_EDGE: 33071,
   MIRRORED_REPEAT: 33648,
   REPEAT: 10497
-}, ht = "KHR_mesh_quantization", q = {};
-q[ie] = T.NEAREST;
-q[re] = T.NEAREST_MIPMAP_NEAREST;
-q[oe] = T.NEAREST_MIPMAP_LINEAR;
-q[ae] = T.LINEAR;
-q[ce] = T.LINEAR_MIPMAP_NEAREST;
-q[le] = T.LINEAR_MIPMAP_LINEAR;
-q[he] = T.CLAMP_TO_EDGE;
-q[ue] = T.REPEAT;
-q[de] = T.MIRRORED_REPEAT;
-const At = {
+}, lt = "KHR_mesh_quantization", j = {};
+j[ae] = b.NEAREST;
+j[ce] = b.NEAREST_MIPMAP_NEAREST;
+j[le] = b.NEAREST_MIPMAP_LINEAR;
+j[he] = b.LINEAR;
+j[ue] = b.LINEAR_MIPMAP_NEAREST;
+j[de] = b.LINEAR_MIPMAP_LINEAR;
+j[fe] = b.CLAMP_TO_EDGE;
+j[pe] = b.REPEAT;
+j[ge] = b.MIRRORED_REPEAT;
+const Tt = {
   scale: "scale",
   position: "translation",
   quaternion: "rotation",
   morphTargetInfluences: "weights"
-}, Ye = new Ht(), bt = 12, ke = 1179937895, Xe = 2, Tt = 8, We = 1313821514, Ve = 5130562;
+}, Qe = new Kt(), Pt = 12, tn = 1179937895, en = 2, It = 8, nn = 1313821514, sn = 5130562;
 function Q(u, t) {
   return u.length === t.length && u.every(function(e, n) {
     return e === t[n];
   });
 }
-function He(u) {
+function rn(u) {
   return new TextEncoder().encode(u).buffer;
 }
-function Je(u) {
+function on(u) {
   return Q(u.elements, [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]);
 }
-function $e(u, t, e) {
+function an(u, t, e) {
   const n = {
     min: new Array(u.itemSize).fill(Number.POSITIVE_INFINITY),
     max: new Array(u.itemSize).fill(Number.NEGATIVE_INFINITY)
@@ -4114,15 +4177,15 @@ function $e(u, t, e) {
   for (let s = t; s < t + e; s++)
     for (let i = 0; i < u.itemSize; i++) {
       let r;
-      u.itemSize > 4 ? r = u.array[s * u.itemSize + i] : (i === 0 ? r = u.getX(s) : i === 1 ? r = u.getY(s) : i === 2 ? r = u.getZ(s) : i === 3 && (r = u.getW(s)), u.normalized === !0 && (r = ft.normalize(r, u.array))), n.min[i] = Math.min(n.min[i], r), n.max[i] = Math.max(n.max[i], r);
+      u.itemSize > 4 ? r = u.array[s * u.itemSize + i] : (i === 0 ? r = u.getX(s) : i === 1 ? r = u.getY(s) : i === 2 ? r = u.getZ(s) : i === 3 && (r = u.getW(s)), u.normalized === !0 && (r = dt.normalize(r, u.array))), n.min[i] = Math.min(n.min[i], r), n.max[i] = Math.max(n.max[i], r);
     }
   return n;
 }
-function _t(u) {
+function kt(u) {
   return Math.ceil(u / 4) * 4;
 }
-function ut(u, t = 0) {
-  const e = _t(u.byteLength);
+function ht(u, t = 0) {
+  const e = kt(u.byteLength);
   if (e !== u.byteLength) {
     const n = new Uint8Array(e);
     if (n.set(new Uint8Array(u)), t !== 0)
@@ -4132,10 +4195,10 @@ function ut(u, t = 0) {
   }
   return u;
 }
-function Pt() {
+function vt() {
   return typeof document > "u" && typeof OffscreenCanvas < "u" ? new OffscreenCanvas(1, 1) : document.createElement("canvas");
 }
-function Ke(u, t) {
+function cn(u, t) {
   if (typeof OffscreenCanvas < "u" && u instanceof OffscreenCanvas) {
     let e;
     return t === "image/jpeg" ? e = 0.92 : t === "image/webp" && (e = 0.8), u.convertToBlob({
@@ -4145,12 +4208,12 @@ function Ke(u, t) {
   } else
     return new Promise((e) => u.toBlob(e, t));
 }
-class Ze {
+class ln {
   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" + $t
+        generator: "THREE.GLTFExporter r" + Qt
       }
     }, this.cache = {
       meshes: /* @__PURE__ */ new Map(),
@@ -4186,27 +4249,27 @@ class Ze {
     }, n), this.options.animations.length > 0 && (this.options.trs = !0), await this.processInputAsync(t), await Promise.all(this.pending);
     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" }), h = Object.keys(o), c = Object.keys(a);
-    h.length > 0 && (r.extensionsUsed = h), c.length > 0 && (r.extensionsRequired = c), r.buffers && r.buffers.length > 0 && (r.buffers[0].byteLength = l.size), n.binary === !0 ? dt(l).then(function(d) {
-      const f = ut(d), p = new DataView(new ArrayBuffer(Tt));
-      p.setUint32(0, f.byteLength, !0), p.setUint32(4, Ve, !0);
-      const y = ut(He(JSON.stringify(r)), 32), g = new DataView(new ArrayBuffer(Tt));
-      g.setUint32(0, y.byteLength, !0), g.setUint32(4, We, !0);
-      const x = new ArrayBuffer(bt), M = new DataView(x);
-      M.setUint32(0, ke, !0), M.setUint32(4, Xe, !0);
-      const w = bt + g.byteLength + y.byteLength + p.byteLength + f.byteLength;
-      M.setUint32(8, w, !0);
-      const m = new Blob([
+    const o = s.extensionsUsed, a = s.extensionsRequired, c = new Blob(i, { type: "application/octet-stream" }), l = Object.keys(o), h = Object.keys(a);
+    l.length > 0 && (r.extensionsUsed = l), h.length > 0 && (r.extensionsRequired = h), r.buffers && r.buffers.length > 0 && (r.buffers[0].byteLength = c.size), n.binary === !0 ? ut(c).then(function(d) {
+      const f = ht(d), p = new DataView(new ArrayBuffer(It));
+      p.setUint32(0, f.byteLength, !0), p.setUint32(4, sn, !0);
+      const y = ht(rn(JSON.stringify(r)), 32), g = new DataView(new ArrayBuffer(It));
+      g.setUint32(0, y.byteLength, !0), g.setUint32(4, nn, !0);
+      const x = new ArrayBuffer(Pt), m = new DataView(x);
+      m.setUint32(0, tn, !0), m.setUint32(4, en, !0);
+      const L = Pt + g.byteLength + y.byteLength + p.byteLength + f.byteLength;
+      m.setUint32(8, L, !0);
+      const M = new Blob([
         x,
         g,
         y,
         p,
         f
       ], { type: "application/octet-stream" });
-      dt(m).then((S) => {
+      ut(M).then((S) => {
         e(S);
       });
-    }) : r.buffers && r.buffers.length > 0 ? pn(l).then((d) => {
+    }) : r.buffers && r.buffers.length > 0 ? En(c).then((d) => {
       r.buffers[0].uri = d, e(r);
     }) : e(r);
   }
@@ -4254,7 +4317,7 @@ class Ze {
    */
   isNormalizedNormalAttribute(t) {
     if (this.cache.attributesNormalized.has(t)) return !1;
-    const n = new rt();
+    const n = new it();
     for (let s = 0, i = t.count; s < i; s++)
       if (Math.abs(n.fromBufferAttribute(t, s).length() - 1) > 5e-4) return !1;
     return !0;
@@ -4269,7 +4332,7 @@ class Ze {
   createNormalizedNormalAttribute(t) {
     const e = this.cache;
     if (e.attributesNormalized.has(t)) return e.attributesNormalized.get(t);
-    const n = t.clone(), s = new rt();
+    const n = t.clone(), s = new it();
     for (let i = 0, r = n.count; i < r; i++)
       s.fromBufferAttribute(n, i), s.x === 0 && s.y === 0 && s.z === 0 ? s.setX(1) : s.normalize(), n.setXYZ(i, s.x, s.y, s.z);
     return e.attributesNormalized.set(t, n), n;
@@ -4289,35 +4352,35 @@ class Ze {
   async buildMetalRoughTextureAsync(t, e) {
     if (t === e) return t;
     function n(f) {
-      return f.colorSpace === se ? function(y) {
+      return f.colorSpace === oe ? function(y) {
         return y < 0.04045 ? y * 0.0773993808 : Math.pow(y * 0.9478672986 + 0.0521327014, 2.4);
       } : function(y) {
         return y;
       };
     }
-    t instanceof lt && (t = await this.decompressTextureAsync(t)), e instanceof lt && (e = await this.decompressTextureAsync(e));
-    const s = t ? t.image : null, i = e ? e.image : null, r = Math.max(s ? s.width : 0, i ? i.width : 0), o = Math.max(s ? s.height : 0, i ? i.height : 0), a = Pt();
+    t instanceof ct && (t = await this.decompressTextureAsync(t)), e instanceof ct && (e = await this.decompressTextureAsync(e));
+    const s = t ? t.image : null, i = e ? e.image : null, r = Math.max(s ? s.width : 0, i ? i.width : 0), o = Math.max(s ? s.height : 0, i ? i.height : 0), a = vt();
     a.width = r, a.height = o;
-    const l = a.getContext("2d", {
+    const c = a.getContext("2d", {
       willReadFrequently: !0
     });
-    l.fillStyle = "#00ffff", l.fillRect(0, 0, r, o);
-    const h = l.getImageData(0, 0, r, o);
+    c.fillStyle = "#00ffff", c.fillRect(0, 0, r, o);
+    const l = c.getImageData(0, 0, r, o);
     if (s) {
-      l.drawImage(s, 0, 0, r, o);
-      const f = n(t), p = l.getImageData(0, 0, r, o).data;
+      c.drawImage(s, 0, 0, r, o);
+      const f = n(t), p = c.getImageData(0, 0, r, o).data;
       for (let y = 2; y < p.length; y += 4)
-        h.data[y] = f(p[y] / 256) * 256;
+        l.data[y] = f(p[y] / 256) * 256;
     }
     if (i) {
-      l.drawImage(i, 0, 0, r, o);
-      const f = n(e), p = l.getImageData(0, 0, r, o).data;
+      c.drawImage(i, 0, 0, r, o);
+      const f = n(e), p = c.getImageData(0, 0, r, o).data;
       for (let y = 1; y < p.length; y += 4)
-        h.data[y] = f(p[y] / 256) * 256;
+        l.data[y] = f(p[y] / 256) * 256;
     }
-    l.putImageData(h, 0, 0);
+    c.putImageData(l, 0, 0);
     const d = (t || e).clone();
-    return d.source = new Kt(a), d.colorSpace = Zt, d.channel = (t || e).channel, t && e && t.channel !== e.channel && console.warn("THREE.GLTFExporter: UV channels for metalnessMap and roughnessMap textures must match."), console.warn("THREE.GLTFExporter: Merged metalnessMap and roughnessMap textures."), d;
+    return d.source = new te(a), d.colorSpace = ee, d.channel = (t || e).channel, t && e && t.channel !== e.channel && console.warn("THREE.GLTFExporter: UV channels for metalnessMap and roughnessMap textures must match."), console.warn("THREE.GLTFExporter: Merged metalnessMap and roughnessMap textures."), d;
   }
   async decompressTextureAsync(t, e = 1 / 0) {
     if (this.textureUtils === null)
@@ -4347,34 +4410,34 @@ class Ze {
     r.bufferViews || (r.bufferViews = []);
     let o;
     switch (e) {
-      case T.BYTE:
-      case T.UNSIGNED_BYTE:
+      case b.BYTE:
+      case b.UNSIGNED_BYTE:
         o = 1;
         break;
-      case T.SHORT:
-      case T.UNSIGNED_SHORT:
+      case b.SHORT:
+      case b.UNSIGNED_SHORT:
         o = 2;
         break;
       default:
         o = 4;
     }
     let a = t.itemSize * o;
-    i === T.ARRAY_BUFFER && (a = Math.ceil(a / 4) * 4);
-    const l = _t(s * a), h = new DataView(new ArrayBuffer(l));
-    let c = 0;
+    i === b.ARRAY_BUFFER && (a = Math.ceil(a / 4) * 4);
+    const c = kt(s * a), l = new DataView(new ArrayBuffer(c));
+    let h = 0;
     for (let p = n; p < n + s; p++) {
       for (let y = 0; y < t.itemSize; y++) {
         let g;
-        t.itemSize > 4 ? g = t.array[p * t.itemSize + y] : (y === 0 ? g = t.getX(p) : y === 1 ? g = t.getY(p) : y === 2 ? g = t.getZ(p) : y === 3 && (g = t.getW(p)), t.normalized === !0 && (g = ft.normalize(g, t.array))), e === T.FLOAT ? h.setFloat32(c, g, !0) : e === T.INT ? h.setInt32(c, g, !0) : e === T.UNSIGNED_INT ? h.setUint32(c, g, !0) : e === T.SHORT ? h.setInt16(c, g, !0) : e === T.UNSIGNED_SHORT ? h.setUint16(c, g, !0) : e === T.BYTE ? h.setInt8(c, g) : e === T.UNSIGNED_BYTE && h.setUint8(c, g), c += o;
+        t.itemSize > 4 ? g = t.array[p * t.itemSize + y] : (y === 0 ? g = t.getX(p) : y === 1 ? g = t.getY(p) : y === 2 ? g = t.getZ(p) : y === 3 && (g = t.getW(p)), t.normalized === !0 && (g = dt.normalize(g, t.array))), e === b.FLOAT ? l.setFloat32(h, g, !0) : e === b.INT ? l.setInt32(h, g, !0) : e === b.UNSIGNED_INT ? l.setUint32(h, g, !0) : e === b.SHORT ? l.setInt16(h, g, !0) : e === b.UNSIGNED_SHORT ? l.setUint16(h, g, !0) : e === b.BYTE ? l.setInt8(h, g) : e === b.UNSIGNED_BYTE && l.setUint8(h, g), h += o;
       }
-      c % a !== 0 && (c += a - c % a);
+      h % a !== 0 && (h += a - h % a);
     }
     const d = {
-      buffer: this.processBuffer(h.buffer),
+      buffer: this.processBuffer(l.buffer),
       byteOffset: this.byteOffset,
-      byteLength: l
+      byteLength: c
     };
-    return i !== void 0 && (d.target = i), i === T.ARRAY_BUFFER && (d.byteStride = a), this.byteOffset += l, r.bufferViews.push(d), {
+    return i !== void 0 && (d.target = i), i === b.ARRAY_BUFFER && (d.byteStride = a), this.byteOffset += c, r.bufferViews.push(d), {
       id: r.bufferViews.length - 1,
       byteLength: 0
     };
@@ -4387,8 +4450,8 @@ class Ze {
   processBufferViewImage(t) {
     const e = this, n = e.json;
     return n.bufferViews || (n.bufferViews = []), new Promise(async function(s) {
-      dt(t).then((i) => {
-        const r = ut(i), o = {
+      ut(t).then((i) => {
+        const r = ht(i), o = {
           buffer: e.processBuffer(r),
           byteOffset: e.byteOffset,
           byteLength: r.byteLength
@@ -4416,35 +4479,35 @@ class Ze {
     };
     let o;
     if (t.array.constructor === Float32Array)
-      o = T.FLOAT;
+      o = b.FLOAT;
     else if (t.array.constructor === Int32Array)
-      o = T.INT;
+      o = b.INT;
     else if (t.array.constructor === Uint32Array)
-      o = T.UNSIGNED_INT;
+      o = b.UNSIGNED_INT;
     else if (t.array.constructor === Int16Array)
-      o = T.SHORT;
+      o = b.SHORT;
     else if (t.array.constructor === Uint16Array)
-      o = T.UNSIGNED_SHORT;
+      o = b.UNSIGNED_SHORT;
     else if (t.array.constructor === Int8Array)
-      o = T.BYTE;
+      o = b.BYTE;
     else if (t.array.constructor === Uint8Array)
-      o = T.UNSIGNED_BYTE;
+      o = b.UNSIGNED_BYTE;
     else
       throw new Error("THREE.GLTFExporter: Unsupported bufferAttribute component type: " + t.array.constructor.name);
     if (n === void 0 && (n = 0), (s === void 0 || s === 1 / 0) && (s = t.count), s === 0) return null;
-    const a = $e(t, n, s);
-    let l;
-    e !== void 0 && (l = t === e.index ? T.ELEMENT_ARRAY_BUFFER : T.ARRAY_BUFFER);
-    const h = this.processBufferView(t, o, n, s, l), c = {
-      bufferView: h.id,
-      byteOffset: h.byteOffset,
+    const a = an(t, n, s);
+    let c;
+    e !== void 0 && (c = t === e.index ? b.ELEMENT_ARRAY_BUFFER : b.ARRAY_BUFFER);
+    const l = this.processBufferView(t, o, n, s, c), h = {
+      bufferView: l.id,
+      byteOffset: l.byteOffset,
       componentType: o,
       count: s,
       max: a.max,
       min: a.min,
       type: r[t.itemSize]
     };
-    return t.normalized === !0 && (c.normalized = !0), i.accessors || (i.accessors = []), i.accessors.push(c) - 1;
+    return t.normalized === !0 && (h.normalized = !0), i.accessors || (i.accessors = []), i.accessors.push(h) - 1;
   }
   /**
    * Process image
@@ -4456,18 +4519,18 @@ class Ze {
    */
   processImage(t, e, n, s = "image/png") {
     if (t !== null) {
-      const i = this, r = i.cache, o = i.json, a = i.options, l = i.pending;
+      const i = this, r = i.cache, o = i.json, a = i.options, c = i.pending;
       r.images.has(t) || r.images.set(t, {});
-      const h = r.images.get(t), c = s + ":flipY/" + n.toString();
-      if (h[c] !== void 0) return h[c];
+      const l = r.images.get(t), h = s + ":flipY/" + n.toString();
+      if (l[h] !== void 0) return l[h];
       o.images || (o.images = []);
-      const d = { mimeType: s }, f = Pt();
+      const d = { mimeType: s }, f = vt();
       f.width = Math.min(t.width, a.maxTextureSize), f.height = Math.min(t.height, a.maxTextureSize);
       const p = f.getContext("2d", {
         willReadFrequently: !0
       });
       if (n === !0 && (p.translate(0, f.height), p.scale(1, -1)), t.data !== void 0) {
-        e !== Qt && console.error("GLTFExporter: Only RGBAFormat is supported.", e), (t.width > a.maxTextureSize || t.height > a.maxTextureSize) && console.warn("GLTFExporter: Image size is bigger than maxTextureSize", t);
+        e !== ne && console.error("GLTFExporter: Only RGBAFormat is supported.", e), (t.width > a.maxTextureSize || t.height > a.maxTextureSize) && console.warn("GLTFExporter: Image size is bigger than maxTextureSize", t);
         const g = new Uint8ClampedArray(t.height * t.width * 4);
         for (let x = 0; x < g.length; x += 4)
           g[x + 0] = t.data[x + 0], g[x + 1] = t.data[x + 1], g[x + 2] = t.data[x + 2], g[x + 3] = t.data[x + 3];
@@ -4476,13 +4539,13 @@ class Ze {
         p.drawImage(t, 0, 0, f.width, f.height);
       else
         throw new Error("THREE.GLTFExporter: Invalid image type. Use HTMLImageElement, HTMLCanvasElement, ImageBitmap or OffscreenCanvas.");
-      a.binary === !0 ? l.push(
-        Ke(f, s).then((g) => i.processBufferViewImage(g)).then((g) => {
+      a.binary === !0 ? c.push(
+        cn(f, s).then((g) => i.processBufferViewImage(g)).then((g) => {
           d.bufferView = g;
         })
-      ) : d.uri = te.getDataURL(f, s);
+      ) : d.uri = se.getDataURL(f, s);
       const y = o.images.push(d) - 1;
-      return h[c] = y, y;
+      return l[h] = y, y;
     } else
       throw new Error("THREE.GLTFExporter: No valid image data found. Unable to process texture.");
   }
@@ -4495,10 +4558,10 @@ class Ze {
     const e = this.json;
     e.samplers || (e.samplers = []);
     const n = {
-      magFilter: q[t.magFilter],
-      minFilter: q[t.minFilter],
-      wrapS: q[t.wrapS],
-      wrapT: q[t.wrapT]
+      magFilter: j[t.magFilter],
+      minFilter: j[t.minFilter],
+      wrapS: j[t.wrapS],
+      wrapT: j[t.wrapT]
     };
     return e.samplers.push(n) - 1;
   }
@@ -4510,15 +4573,15 @@ class Ze {
   async processTextureAsync(t) {
     const n = this.options, s = this.cache, i = this.json;
     if (s.textures.has(t)) return s.textures.get(t);
-    i.textures || (i.textures = []), t instanceof lt && (t = await this.decompressTextureAsync(t, n.maxTextureSize));
+    i.textures || (i.textures = []), t instanceof ct && (t = await this.decompressTextureAsync(t, n.maxTextureSize));
     let r = t.userData.mimeType;
     r === "image/webp" && (r = "image/png");
     const o = {
       sampler: this.processSampler(t),
       source: this.processImage(t.image, t.format, t.flipY, r)
     };
-    t.name && (o.name = t.name), await this._invokeAllAsync(async function(l) {
-      l.writeTexture && await l.writeTexture(t, o);
+    t.name && (o.name = t.name), await this._invokeAllAsync(async function(c) {
+      c.writeTexture && await c.writeTexture(t, o);
     });
     const a = i.textures.push(o) - 1;
     return s.textures.set(t, a), a;
@@ -4554,11 +4617,11 @@ class Ze {
     if (t.emissive) {
       const o = t.emissive;
       if (Math.max(o.r, o.g, o.b) > 0 && (s.emissiveFactor = t.emissive.toArray()), t.emissiveMap) {
-        const l = {
+        const c = {
           index: await this.processTextureAsync(t.emissiveMap),
           texCoord: t.emissiveMap.channel
         };
-        this.applyTextureTransform(l, t.emissiveMap), s.emissiveTexture = l;
+        this.applyTextureTransform(c, t.emissiveMap), s.emissiveTexture = c;
       }
     }
     if (t.normalMap) {
@@ -4575,7 +4638,7 @@ class Ze {
       };
       t.aoMapIntensity !== 1 && (o.strength = t.aoMapIntensity), this.applyTextureTransform(o, t.aoMap), s.occlusionTexture = o;
     }
-    t.transparent ? s.alphaMode = "BLEND" : t.alphaTest > 0 && (s.alphaMode = "MASK", s.alphaCutoff = t.alphaTest), t.side === ee && (s.doubleSided = !0), t.name !== "" && (s.name = t.name), this.serializeUserData(t, s), await this._invokeAllAsync(async function(o) {
+    t.transparent ? s.alphaMode = "BLEND" : t.alphaTest > 0 && (s.alphaMode = "MASK", s.alphaCutoff = t.alphaTest), t.side === ie && (s.doubleSided = !0), t.name !== "" && (s.name = t.name), this.serializeUserData(t, s), await this._invokeAllAsync(async function(o) {
       o.writeMaterialAsync && await o.writeMaterialAsync(t, s);
     });
     const r = n.materials.push(s) - 1;
@@ -4589,16 +4652,16 @@ class Ze {
   async processMeshAsync(t) {
     const e = this.cache, n = this.json, s = [t.geometry.uuid];
     if (Array.isArray(t.material))
-      for (let m = 0, S = t.material.length; m < S; m++)
-        s.push(t.material[m].uuid);
+      for (let M = 0, S = t.material.length; M < S; M++)
+        s.push(t.material[M].uuid);
     else
       s.push(t.material.uuid);
     const i = s.join(":");
     if (e.meshes.has(i)) return e.meshes.get(i);
     const r = t.geometry;
     let o;
-    t.isLineSegments ? o = T.LINES : t.isLineLoop ? o = T.LINE_LOOP : t.isLine ? o = T.LINE_STRIP : t.isPoints ? o = T.POINTS : o = t.material.wireframe ? T.LINES : T.TRIANGLES;
-    const a = {}, l = {}, h = [], c = [], d = {
+    t.isLineSegments ? o = b.LINES : t.isLineLoop ? o = b.LINE_LOOP : t.isLine ? o = b.LINE_STRIP : t.isPoints ? o = b.POINTS : o = t.material.wireframe ? b.LINES : b.TRIANGLES;
+    const a = {}, c = {}, l = [], h = [], d = {
       uv: "TEXCOORD_0",
       uv1: "TEXCOORD_1",
       uv2: "TEXCOORD_2",
@@ -4609,76 +4672,76 @@ class Ze {
     }, f = r.getAttribute("normal");
     f !== void 0 && !this.isNormalizedNormalAttribute(f) && (console.warn("THREE.GLTFExporter: Creating normalized normal attribute from the non-normalized one."), r.setAttribute("normal", this.createNormalizedNormalAttribute(f)));
     let p = null;
-    for (let m in r.attributes) {
-      if (m.slice(0, 5) === "morph") continue;
-      const S = r.attributes[m];
-      if (m = d[m] || m.toUpperCase(), /^(POSITION|NORMAL|TANGENT|TEXCOORD_\d+|COLOR_\d+|JOINTS_\d+|WEIGHTS_\d+)$/.test(m) || (m = "_" + m), e.attributes.has(this.getUID(S))) {
-        l[m] = e.attributes.get(this.getUID(S));
+    for (let M in r.attributes) {
+      if (M.slice(0, 5) === "morph") continue;
+      const S = r.attributes[M];
+      if (M = d[M] || M.toUpperCase(), /^(POSITION|NORMAL|TANGENT|TEXCOORD_\d+|COLOR_\d+|JOINTS_\d+|WEIGHTS_\d+)$/.test(M) || (M = "_" + M), e.attributes.has(this.getUID(S))) {
+        c[M] = e.attributes.get(this.getUID(S));
         continue;
       }
       p = null;
-      const L = S.array;
-      m === "JOINTS_0" && !(L instanceof Uint16Array) && !(L instanceof Uint8Array) ? (console.warn('GLTFExporter: Attribute "skinIndex" converted to type UNSIGNED_SHORT.'), p = new Y(new Uint16Array(L), S.itemSize, S.normalized)) : (L instanceof Uint32Array || L instanceof Int32Array) && !m.startsWith("_") && (console.warn(`GLTFExporter: Attribute "${m}" converted to type FLOAT.`), p = ct.Utils.toFloat32BufferAttribute(S));
-      const b = this.processAccessor(p || S, r);
-      b !== null && (m.startsWith("_") || this.detectMeshQuantization(m, S), l[m] = b, e.attributes.set(this.getUID(S), b));
+      const E = S.array;
+      M === "JOINTS_0" && !(E instanceof Uint16Array) && !(E instanceof Uint8Array) ? (console.warn('GLTFExporter: Attribute "skinIndex" converted to type UNSIGNED_SHORT.'), p = new _(new Uint16Array(E), S.itemSize, S.normalized)) : (E instanceof Uint32Array || E instanceof Int32Array) && !M.startsWith("_") && (console.warn(`GLTFExporter: Attribute "${M}" converted to type FLOAT.`), p = ot.Utils.toFloat32BufferAttribute(S));
+      const T = this.processAccessor(p || S, r);
+      T !== null && (M.startsWith("_") || this.detectMeshQuantization(M, S), c[M] = T, e.attributes.set(this.getUID(S), T));
     }
-    if (f !== void 0 && r.setAttribute("normal", f), Object.keys(l).length === 0) return null;
+    if (f !== void 0 && r.setAttribute("normal", f), Object.keys(c).length === 0) return null;
     if (t.morphTargetInfluences !== void 0 && t.morphTargetInfluences.length > 0) {
-      const m = [], S = [], A = {};
+      const M = [], S = [], A = {};
       if (t.morphTargetDictionary !== void 0)
-        for (const L in t.morphTargetDictionary)
-          A[t.morphTargetDictionary[L]] = L;
-      for (let L = 0; L < t.morphTargetInfluences.length; ++L) {
-        const b = {};
-        let v = !1;
-        for (const C in r.morphAttributes) {
-          if (C !== "position" && C !== "normal") {
-            v || (console.warn("GLTFExporter: Only POSITION and NORMAL morph are supported."), v = !0);
+        for (const E in t.morphTargetDictionary)
+          A[t.morphTargetDictionary[E]] = E;
+      for (let E = 0; E < t.morphTargetInfluences.length; ++E) {
+        const T = {};
+        let C = !1;
+        for (const N in r.morphAttributes) {
+          if (N !== "position" && N !== "normal") {
+            C || (console.warn("GLTFExporter: Only POSITION and NORMAL morph are supported."), C = !0);
             continue;
           }
-          const I = r.morphAttributes[C][L], B = C.toUpperCase(), j = r.attributes[C];
-          if (e.attributes.has(this.getUID(I, !0))) {
-            b[B] = e.attributes.get(this.getUID(I, !0));
+          const O = r.morphAttributes[N][E], q = N.toUpperCase(), U = r.attributes[N];
+          if (e.attributes.has(this.getUID(O, !0))) {
+            T[q] = e.attributes.get(this.getUID(O, !0));
             continue;
           }
-          const F = I.clone();
+          const R = O.clone();
           if (!r.morphTargetsRelative)
-            for (let N = 0, H = I.count; N < H; N++)
-              for (let U = 0; U < I.itemSize; U++)
-                U === 0 && F.setX(N, I.getX(N) - j.getX(N)), U === 1 && F.setY(N, I.getY(N) - j.getY(N)), U === 2 && F.setZ(N, I.getZ(N) - j.getZ(N)), U === 3 && F.setW(N, I.getW(N) - j.getW(N));
-          b[B] = this.processAccessor(F, r), e.attributes.set(this.getUID(j, !0), b[B]);
+            for (let v = 0, K = O.count; v < K; v++)
+              for (let F = 0; F < O.itemSize; F++)
+                F === 0 && R.setX(v, O.getX(v) - U.getX(v)), F === 1 && R.setY(v, O.getY(v) - U.getY(v)), F === 2 && R.setZ(v, O.getZ(v) - U.getZ(v)), F === 3 && R.setW(v, O.getW(v) - U.getW(v));
+          T[q] = this.processAccessor(R, r), e.attributes.set(this.getUID(U, !0), T[q]);
         }
-        c.push(b), m.push(t.morphTargetInfluences[L]), t.morphTargetDictionary !== void 0 && S.push(A[L]);
+        h.push(T), M.push(t.morphTargetInfluences[E]), t.morphTargetDictionary !== void 0 && S.push(A[E]);
       }
-      a.weights = m, S.length > 0 && (a.extras = {}, a.extras.targetNames = S);
+      a.weights = M, S.length > 0 && (a.extras = {}, a.extras.targetNames = S);
     }
     const y = Array.isArray(t.material);
     if (y && r.groups.length === 0) return null;
     let g = !1;
     if (y && r.index === null) {
-      const m = [];
+      const M = [];
       for (let S = 0, A = r.attributes.position.count; S < A; S++)
-        m[S] = S;
-      r.setIndex(m), g = !0;
+        M[S] = S;
+      r.setIndex(M), g = !0;
     }
-    const x = y ? t.material : [t.material], M = y ? r.groups : [{ materialIndex: 0, start: void 0, count: void 0 }];
-    for (let m = 0, S = M.length; m < S; m++) {
+    const x = y ? t.material : [t.material], m = y ? r.groups : [{ materialIndex: 0, start: void 0, count: void 0 }];
+    for (let M = 0, S = m.length; M < S; M++) {
       const A = {
         mode: o,
-        attributes: l
+        attributes: c
       };
-      if (this.serializeUserData(r, A), c.length > 0 && (A.targets = c), r.index !== null) {
-        let b = this.getUID(r.index);
-        (M[m].start !== void 0 || M[m].count !== void 0) && (b += ":" + M[m].start + ":" + M[m].count), e.attributes.has(b) ? A.indices = e.attributes.get(b) : (A.indices = this.processAccessor(r.index, r, M[m].start, M[m].count), e.attributes.set(b, A.indices)), A.indices === null && delete A.indices;
+      if (this.serializeUserData(r, A), h.length > 0 && (A.targets = h), r.index !== null) {
+        let T = this.getUID(r.index);
+        (m[M].start !== void 0 || m[M].count !== void 0) && (T += ":" + m[M].start + ":" + m[M].count), e.attributes.has(T) ? A.indices = e.attributes.get(T) : (A.indices = this.processAccessor(r.index, r, m[M].start, m[M].count), e.attributes.set(T, A.indices)), A.indices === null && delete A.indices;
       }
-      const L = await this.processMaterialAsync(x[M[m].materialIndex]);
-      L !== null && (A.material = L), h.push(A);
+      const E = await this.processMaterialAsync(x[m[M].materialIndex]);
+      E !== null && (A.material = E), l.push(A);
     }
-    g === !0 && r.setIndex(null), a.primitives = h, n.meshes || (n.meshes = []), await this._invokeAllAsync(function(m) {
-      m.writeMesh && m.writeMesh(t, a);
+    g === !0 && r.setIndex(null), a.primitives = l, n.meshes || (n.meshes = []), await this._invokeAllAsync(function(M) {
+      M.writeMesh && M.writeMesh(t, a);
     });
-    const w = n.meshes.push(a) - 1;
-    return e.meshes.set(i, w), w;
+    const L = n.meshes.push(a) - 1;
+    return e.meshes.set(i, L), L;
   }
   /**
    * If a vertex attribute with a
@@ -4692,7 +4755,7 @@ class Ze {
    * @param {THREE.BufferAttribute} attribute
    */
   detectMeshQuantization(t, e) {
-    if (this.extensionsUsed[ht]) return;
+    if (this.extensionsUsed[lt]) return;
     let n;
     switch (e.array.constructor) {
       case Int8Array:
@@ -4712,7 +4775,7 @@ class Ze {
     }
     e.normalized && (n += " normalized");
     const s = t.split("_", 1)[0];
-    Et[s] && Et[s].includes(n) && (this.extensionsUsed[ht] = !0, this.extensionsRequired[ht] = !0);
+    bt[s] && bt[s].includes(n) && (this.extensionsUsed[lt] = !0, this.extensionsRequired[lt] = !0);
   }
   /**
    * Process camera
@@ -4732,7 +4795,7 @@ class Ze {
       znear: t.near < 0 ? 0 : t.near
     } : s.perspective = {
       aspectRatio: t.aspect,
-      yfov: ft.degToRad(t.fov),
+      yfov: dt.degToRad(t.fov),
       zfar: t.far <= 0 ? 1e-3 : t.far,
       znear: t.near < 0 ? 0 : t.near
     }, t.name !== "" && (s.name = t.type), e.cameras.push(s) - 1;
@@ -4749,23 +4812,23 @@ class Ze {
    */
   processAnimation(t, e) {
     const n = this.json, s = this.nodeMap;
-    n.animations || (n.animations = []), t = ct.Utils.mergeMorphTargetTracks(t.clone(), e);
+    n.animations || (n.animations = []), t = ot.Utils.mergeMorphTargetTracks(t.clone(), e);
     const i = t.tracks, r = [], o = [];
-    for (let l = 0; l < i.length; ++l) {
-      const h = i[l], c = ot.parseTrackName(h.name);
-      let d = ot.findNode(e, c.nodeName);
-      const f = At[c.propertyName];
-      if (c.objectName === "bones" && (d.isSkinnedMesh === !0 ? d = d.skeleton.getBoneByName(c.objectIndex) : d = void 0), !d || !f) {
-        console.warn('THREE.GLTFExporter: Could not export animation track "%s".', h.name);
+    for (let c = 0; c < i.length; ++c) {
+      const l = i[c], h = rt.parseTrackName(l.name);
+      let d = rt.findNode(e, h.nodeName);
+      const f = Tt[h.propertyName];
+      if (h.objectName === "bones" && (d.isSkinnedMesh === !0 ? d = d.skeleton.getBoneByName(h.objectIndex) : d = void 0), !d || !f) {
+        console.warn('THREE.GLTFExporter: Could not export animation track "%s".', l.name);
         continue;
       }
       const p = 1;
-      let y = h.values.length / h.times.length;
-      f === At.morphTargetInfluences && (y /= d.morphTargetInfluences.length);
+      let y = l.values.length / l.times.length;
+      f === Tt.morphTargetInfluences && (y /= d.morphTargetInfluences.length);
       let g;
-      h.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline === !0 ? (g = "CUBICSPLINE", y /= 3) : h.getInterpolation() === ne ? g = "STEP" : g = "LINEAR", o.push({
-        input: this.processAccessor(new Y(h.times, p)),
-        output: this.processAccessor(new Y(h.values, y)),
+      l.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline === !0 ? (g = "CUBICSPLINE", y /= 3) : l.getInterpolation() === re ? g = "STEP" : g = "LINEAR", o.push({
+        input: this.processAccessor(new _(l.times, p)),
+        output: this.processAccessor(new _(l.values, y)),
         interpolation: g
       }), r.push({
         sampler: o.length - 1,
@@ -4791,11 +4854,11 @@ class Ze {
     if (i === void 0) return null;
     const r = t.skeleton.bones[0];
     if (r === void 0) return null;
-    const o = [], a = new Float32Array(i.bones.length * 16), l = new vt();
-    for (let c = 0; c < i.bones.length; ++c)
-      o.push(n.get(i.bones[c])), l.copy(i.boneInverses[c]), l.multiply(t.bindMatrix).toArray(a, c * 16);
+    const o = [], a = new Float32Array(i.bones.length * 16), c = new Ct();
+    for (let h = 0; h < i.bones.length; ++h)
+      o.push(n.get(i.bones[h])), c.copy(i.boneInverses[h]), c.multiply(t.bindMatrix).toArray(a, h * 16);
     return e.skins === void 0 && (e.skins = []), e.skins.push({
-      inverseBindMatrices: this.processAccessor(new Y(a, 16)),
+      inverseBindMatrices: this.processAccessor(new _(a, 16)),
       joints: o,
       skeleton: n.get(r)
     }), s.skin = e.skins.length - 1;
@@ -4810,10 +4873,10 @@ class Ze {
     e.nodes || (e.nodes = []);
     const i = {};
     if (n.trs) {
-      const o = t.quaternion.toArray(), a = t.position.toArray(), l = t.scale.toArray();
-      Q(o, [0, 0, 0, 1]) || (i.rotation = o), Q(a, [0, 0, 0]) || (i.translation = a), Q(l, [1, 1, 1]) || (i.scale = l);
+      const o = t.quaternion.toArray(), a = t.position.toArray(), c = t.scale.toArray();
+      Q(o, [0, 0, 0, 1]) || (i.rotation = o), Q(a, [0, 0, 0]) || (i.translation = a), Q(c, [1, 1, 1]) || (i.scale = c);
     } else
-      t.matrixAutoUpdate && t.updateMatrix(), Je(t.matrix) === !1 && (i.matrix = t.matrix.elements);
+      t.matrixAutoUpdate && t.updateMatrix(), on(t.matrix) === !1 && (i.matrix = t.matrix.elements);
     if (t.name !== "" && (i.name = String(t.name)), this.serializeUserData(t, i), t.isMesh || t.isLine || t.isPoints) {
       const o = await this.processMeshAsync(t);
       o !== null && (i.mesh = o);
@@ -4822,11 +4885,11 @@ class Ze {
     const r = e.nodes.push(i) - 1;
     if (s.set(t, r), t.children.length > 0) {
       const o = [];
-      for (let a = 0, l = t.children.length; a < l; a++) {
-        const h = t.children[a];
-        if (h.visible || n.onlyVisible === !1) {
-          const c = await this.processNodeAsync(h);
-          c !== null && o.push(c);
+      for (let a = 0, c = t.children.length; a < c; a++) {
+        const l = t.children[a];
+        if (l.visible || n.onlyVisible === !1) {
+          const h = await this.processNodeAsync(l);
+          h !== null && o.push(h);
         }
       }
       o.length > 0 && (i.children = o);
@@ -4848,8 +4911,8 @@ class Ze {
     for (let r = 0, o = t.children.length; r < o; r++) {
       const a = t.children[r];
       if (a.visible || n.onlyVisible === !1) {
-        const l = await this.processNodeAsync(a);
-        l !== null && i.push(l);
+        const c = await this.processNodeAsync(a);
+        c !== null && i.push(c);
       }
     }
     i.length > 0 && (s.nodes = i), this.serializeUserData(t, s);
@@ -4890,7 +4953,7 @@ class Ze {
       await t(this.plugins[e]);
   }
 }
-class Qe {
+class hn {
   constructor(t) {
     this.writer = t, this.name = "KHR_lights_punctual";
   }
@@ -4906,7 +4969,7 @@ class Qe {
     o.push(r), e.extensions = e.extensions || {}, e.extensions[this.name] = { light: o.length - 1 };
   }
 }
-class tn {
+class un {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_unlit";
   }
@@ -4916,7 +4979,7 @@ class tn {
     e.extensions = e.extensions || {}, e.extensions[this.name] = {}, s[this.name] = !0, e.pbrMetallicRoughness.metallicFactor = 0, e.pbrMetallicRoughness.roughnessFactor = 0.9;
   }
 }
-class en {
+class dn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_clearcoat";
   }
@@ -4947,7 +5010,7 @@ class en {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class nn {
+class fn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_dispersion";
   }
@@ -4957,7 +5020,7 @@ class nn {
     i.dispersion = t.dispersion, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class sn {
+class pn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_iridescence";
   }
@@ -4981,7 +5044,7 @@ class sn {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class rn {
+class gn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_transmission";
   }
@@ -4998,7 +5061,7 @@ class rn {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class on {
+class yn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_volume";
   }
@@ -5015,7 +5078,7 @@ class on {
     t.attenuationDistance !== 1 / 0 && (i.attenuationDistance = t.attenuationDistance), i.attenuationColor = t.attenuationColor.toArray(), e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class an {
+class xn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_ior";
   }
@@ -5025,12 +5088,12 @@ class an {
     i.ior = t.ior, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class cn {
+class mn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_specular";
   }
   async writeMaterialAsync(t, e) {
-    if (!t.isMeshPhysicalMaterial || t.specularIntensity === 1 && t.specularColor.equals(Ye) && !t.specularIntensityMap && !t.specularColorMap) return;
+    if (!t.isMeshPhysicalMaterial || t.specularIntensity === 1 && t.specularColor.equals(Qe) && !t.specularIntensityMap && !t.specularColorMap) return;
     const n = this.writer, s = n.extensionsUsed, i = {};
     if (t.specularIntensityMap) {
       const r = {
@@ -5049,7 +5112,7 @@ class cn {
     i.specularFactor = t.specularIntensity, i.specularColorFactor = t.specularColor.toArray(), e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class ln {
+class wn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_sheen";
   }
@@ -5073,7 +5136,7 @@ class ln {
     i.sheenRoughnessFactor = t.sheenRoughness, i.sheenColorFactor = t.sheenColor.toArray(), e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class hn {
+class Mn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_anisotropy";
   }
@@ -5087,7 +5150,7 @@ class hn {
     i.anisotropyStrength = t.anisotropy, i.anisotropyRotation = t.anisotropyRotation, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class un {
+class Dn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_emissive_strength";
   }
@@ -5097,7 +5160,7 @@ class un {
     i.emissiveStrength = t.emissiveIntensity, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class dn {
+class Ln {
   constructor(t) {
     this.writer = t, this.name = "EXT_materials_bump";
   }
@@ -5114,24 +5177,24 @@ class dn {
     i.bumpFactor = t.bumpScale, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class fn {
+class Sn {
   constructor(t) {
     this.writer = t, this.name = "EXT_mesh_gpu_instancing";
   }
   writeNode(t, e) {
     if (!t.isInstancedMesh) return;
-    const n = this.writer, s = t, i = new Float32Array(s.count * 3), r = new Float32Array(s.count * 4), o = new Float32Array(s.count * 3), a = new vt(), l = new rt(), h = new Jt(), c = new rt();
+    const n = this.writer, s = t, i = new Float32Array(s.count * 3), r = new Float32Array(s.count * 4), o = new Float32Array(s.count * 3), a = new Ct(), c = new it(), l = new Zt(), h = new it();
     for (let f = 0; f < s.count; f++)
-      s.getMatrixAt(f, a), a.decompose(l, h, c), l.toArray(i, f * 3), h.toArray(r, f * 4), c.toArray(o, f * 3);
+      s.getMatrixAt(f, a), a.decompose(c, l, h), c.toArray(i, f * 3), l.toArray(r, f * 4), h.toArray(o, f * 3);
     const d = {
-      TRANSLATION: n.processAccessor(new Y(i, 3)),
-      ROTATION: n.processAccessor(new Y(r, 4)),
-      SCALE: n.processAccessor(new Y(o, 3))
+      TRANSLATION: n.processAccessor(new _(i, 3)),
+      ROTATION: n.processAccessor(new _(r, 4)),
+      SCALE: n.processAccessor(new _(o, 3))
     };
     s.instanceColor && (d._COLOR_0 = n.processAccessor(s.instanceColor)), e.extensions = e.extensions || {}, e.extensions[this.name] = { attributes: d }, n.extensionsUsed[this.name] = !0, n.extensionsRequired[this.name] = !0;
   }
 }
-ct.Utils = {
+ot.Utils = {
   insertKeyframe: function(u, t) {
     const n = u.getValueSize(), s = new u.TimeBufferType(u.times.length + 1), i = new u.ValueBufferType(u.values.length + n), r = u.createInterpolant(new u.ValueBufferType(n));
     let o;
@@ -5161,7 +5224,7 @@ ct.Utils = {
     const e = [], n = {}, s = u.tracks;
     for (let i = 0; i < s.length; ++i) {
       let r = s[i];
-      const o = ot.parseTrackName(r.name), a = ot.findNode(t, o.nodeName);
+      const o = rt.parseTrackName(r.name), a = rt.findNode(t, o.nodeName);
       if (o.propertyName !== "morphTargetInfluences" || o.propertyIndex === void 0) {
         e.push(r);
         continue;
@@ -5169,33 +5232,33 @@ ct.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(fe);
+        console.warn("THREE.GLTFExporter: Morph target interpolation mode not yet supported. Using LINEAR instead."), r = r.clone(), r.setInterpolation(ye);
       }
-      const l = a.morphTargetInfluences.length, h = a.morphTargetDictionary[o.propertyIndex];
-      if (h === void 0)
+      const c = a.morphTargetInfluences.length, l = a.morphTargetDictionary[o.propertyIndex];
+      if (l === void 0)
         throw new Error("THREE.GLTFExporter: Morph target name not found: " + o.propertyIndex);
-      let c;
+      let h;
       if (n[a.uuid] === void 0) {
-        c = r.clone();
-        const f = new c.ValueBufferType(l * c.times.length);
-        for (let p = 0; p < c.times.length; p++)
-          f[p * l + h] = c.values[p];
-        c.name = (o.nodeName || "") + ".morphTargetInfluences", c.values = f, n[a.uuid] = c, e.push(c);
+        h = r.clone();
+        const f = new h.ValueBufferType(c * h.times.length);
+        for (let p = 0; p < h.times.length; p++)
+          f[p * c + l] = h.values[p];
+        h.name = (o.nodeName || "") + ".morphTargetInfluences", h.values = f, n[a.uuid] = h, e.push(h);
         continue;
       }
       const d = r.createInterpolant(new r.ValueBufferType(1));
-      c = n[a.uuid];
-      for (let f = 0; f < c.times.length; f++)
-        c.values[f * l + h] = d.evaluate(c.times[f]);
+      h = n[a.uuid];
+      for (let f = 0; f < h.times.length; f++)
+        h.values[f * c + l] = d.evaluate(h.times[f]);
       for (let f = 0; f < r.times.length; f++) {
-        const p = this.insertKeyframe(c, r.times[f]);
-        c.values[p * l + h] = r.values[f];
+        const p = this.insertKeyframe(h, r.times[f]);
+        h.values[p * c + l] = r.values[f];
       }
     }
     return u.tracks = e, u;
   },
   toFloat32BufferAttribute: function(u) {
-    const t = new Y(new Float32Array(u.count * u.itemSize), u.itemSize, !1);
+    const t = new _(new Float32Array(u.count * u.itemSize), u.itemSize, !1);
     if (!u.normalized && !u.isInterleavedBufferAttribute)
       return t.array.set(u.array), t;
     for (let e = 0, n = u.count; e < n; e++)
@@ -5204,7 +5267,7 @@ ct.Utils = {
     return t;
   }
 };
-async function pn(u) {
+async function En(u) {
   if (typeof FileReader > "u") {
     const t = await u.arrayBuffer(), n = Buffer.from(t).toString("base64");
     return `data:${u.type};base64,${n}`;
@@ -5214,7 +5277,7 @@ async function pn(u) {
       n.onload = () => t(n.result), n.onerror = () => e(new Error("Failed to read Blob as Data URL")), n.readAsDataURL(u);
     });
 }
-async function dt(u) {
+async function ut(u) {
   if (typeof u.arrayBuffer == "function")
     return await u.arrayBuffer();
   if (typeof FileReader < "u")
@@ -5227,23 +5290,23 @@ async function dt(u) {
     return t.buffer.slice(t.byteOffset, t.byteOffset + t.byteLength);
   }
 }
-const gn = new pe(), yn = new ct();
-function xn(u, t, e = 0.1) {
+const An = new xe(), bn = new ot();
+function Tn(u, t, e = 0.1) {
   const n = t.normal(u), s = t.direction(u).mutiplyScalar(e * 0.5), i = u.direction(t).mutiplyScalar(e * 0.5), r = n.x * e * 0.5, o = n.y * e * 0.5;
   return {
     points: [
       // 第一条线
-      new D(u.x + r, u.y + o).add(i),
-      new D(t.x + r, t.y + o).add(s),
+      new w(u.x + r, u.y + o).add(i),
+      new w(t.x + r, t.y + o).add(s),
       // 第二条线
-      new D(u.x - r, u.y - o).add(i),
-      new D(t.x - r, t.y - o).add(s)
+      new w(u.x - r, u.y - o).add(i),
+      new w(t.x - r, t.y - o).add(s)
     ],
     indices: [0, 1, 1, 3, 3, 2, 2, 0],
     rectIndices: [0, 1, 3, 2, 0]
   };
 }
-class Yt extends z {
+class Yt extends G {
   static name = "WhiteModel";
   Dxf = null;
   Variable = null;
@@ -5273,18 +5336,18 @@ class Yt extends z {
         new P.LineSegments(new P.EdgesGeometry(i), new P.LineBasicMaterial({ color: 0 }))
       );
     }), t.originalData.map(({ start: n, end: s, insetionArr: i }) => {
-      const r = new D(n.x, n.y).mutiplyScalar(t.scale), o = new D(s.x, s.y).mutiplyScalar(t.scale), { points: a, indices: l, rectIndices: h } = xn(r, o, t.width);
+      const r = new w(n.x, n.y).mutiplyScalar(t.scale), o = new w(s.x, s.y).mutiplyScalar(t.scale), { points: a, indices: c, rectIndices: l } = Tn(r, o, t.width);
       return {
         points: a,
-        indices: l,
-        rectIndices: h,
-        insetions: (i ?? []).map((c) => c.index)
+        indices: c,
+        rectIndices: l,
+        insetions: (i ?? []).map((h) => h.index)
       };
     }).forEach((n) => {
       const s = new P.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 c = n.points[o];
+        a === 0 ? s.moveTo(c.x, c.y) : s.lineTo(c.x, c.y);
       });
       const i = new P.ExtrudeGeometry(s, {
         depth: 2.8,
@@ -5306,7 +5369,7 @@ class Yt extends z {
   toOBJ() {
     return new Promise((t) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(() => {
-        t(gn.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
+        t(An.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
       }, 20);
     });
   }
@@ -5318,7 +5381,7 @@ class Yt extends z {
   toGltf(t = !0) {
     return new Promise((e) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(async () => {
-        yn.parse(this.whiteModelGroup.children, (n) => {
+        bn.parse(this.whiteModelGroup.children, (n) => {
           e(n), this.material.opacity = 0.8, this.material.transparent = !0;
         }, () => {
           e(void 0);
@@ -5359,7 +5422,7 @@ class Yt extends z {
       n.href = URL.createObjectURL(e), n.download = t, n.click();
     } else if (typeof global < "u") {
       const e = await this.toOBJ();
-      e && (await X("fs", !1)).writeFileSync(t, e);
+      e && (await H("fs", !1)).writeFileSync(t, e);
     }
   }
   /**
@@ -5375,11 +5438,11 @@ class Yt extends z {
       s.href = URL.createObjectURL(n), s.download = t, s.click();
     } else if (typeof global < "u") {
       const n = await this.toGltf(e);
-      n && (await X("fs", !1)).writeFileSync(t, e ? Buffer.from(n) : JSON.stringify(n));
+      n && (await H("fs", !1)).writeFileSync(t, e ? Buffer.from(n) : JSON.stringify(n));
     }
   }
 }
-class kt extends z {
+class Xt extends G {
   static name = "DetailsPoint";
   Dxf = null;
   WhiteModel = null;
@@ -5456,7 +5519,7 @@ class kt extends z {
     }, 50);
   }
 }
-class Xt extends z {
+class Vt extends G {
   static name = "DxfLineModel";
   dxfLineModel = new P.LineSegments();
   dxfDoorsLineModel = new P.LineSegments();
@@ -5479,39 +5542,39 @@ class Xt extends z {
     });
   }
 }
-const mn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Pn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  DetailsPoint: kt,
-  DxfLineModel: Xt,
+  DetailsPoint: Xt,
+  DxfLineModel: Vt,
   WhiteModel: Yt
 }, Symbol.toStringTag, { value: "Module" }));
-function It(u, t = {}) {
+function Rt(u, t = {}) {
   const {
     detailsPoint: e = !0,
     whiteModel: n = !0,
     dxfLineModel: s = !0
   } = t;
-  s && u.addComponent(new Xt()), n && u.addComponent(new Yt()), e && u.addComponent(new kt());
+  s && u.addComponent(new Vt()), n && u.addComponent(new Yt()), e && u.addComponent(new Xt());
 }
-const wn = Object.assign(It, {
+const In = Object.assign(Rt, {
   create(u = {}) {
-    return (t) => It(t, u);
+    return (t) => Rt(t, u);
   }
-}), Mn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}), vn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  ModelDataPlugin: wn,
-  components: mn
+  ModelDataPlugin: In,
+  components: Pn
 }, Symbol.toStringTag, { value: "Module" }));
 function Wt(u, t, e = 1e-3) {
-  if (Array.isArray(u) && u[0] instanceof D) {
+  if (Array.isArray(u) && u[0] instanceof w) {
     const s = u;
     u = s.map((i, r) => {
       const o = s[(r + 1) % s.length];
-      return new E(i, o);
+      return new D(i, o);
     });
   }
-  if (u instanceof E) return Wt([u], t, e);
-  const n = K.finalInstance;
+  if (u instanceof D) return Wt([u], t, e);
+  const n = Z.finalInstance;
   if (n) {
     const s = n.findComponentByName("Renderer");
     if (s) {
@@ -5520,8 +5583,8 @@ function Wt(u, t, e = 1e-3) {
     }
   }
 }
-function Dn(u, t, e = 1e-3) {
-  const n = K.finalInstance;
+function Rn(u, t, e = 1e-3) {
+  const n = Z.finalInstance;
   if (n) {
     const s = n.findComponentByName("Renderer");
     if (s) {
@@ -5530,8 +5593,8 @@ function Dn(u, t, e = 1e-3) {
     }
   }
 }
-function Sn(u, t, e, n = 1e-3) {
-  const s = K.finalInstance;
+function Cn(u, t, e, n = 1e-3) {
+  const s = Z.finalInstance;
   if (s) {
     const i = s.findComponentByName("Renderer"), r = s.findComponentByName("Editor");
     if (i) {
@@ -5540,16 +5603,16 @@ function Sn(u, t, e, n = 1e-3) {
     }
   }
 }
-function Ln() {
+function Nn() {
   return import("./index2.js");
 }
-function En() {
+function Bn() {
   return import("./index3.js");
 }
 let gt = null;
-typeof window < "u" && (window.drawLines = Wt, window.drawPoint = Dn, window.drawText = Sn, window.rendomColor = () => Math.floor(Math.random() * 16777215));
-async function Rn(u, t, e = !1, n) {
-  const s = await Promise.resolve().then(() => Mn), i = await Ln(), r = await En(), o = new K().usePlugin(s.ModelDataPlugin.create({
+typeof window < "u" && (window.drawLines = Wt, window.drawPoint = Rn, window.drawText = Cn, window.randomColor = () => Math.floor(Math.random() * 16777215));
+async function zn(u, t, e = !1, n) {
+  const s = await Promise.resolve().then(() => vn), i = await Nn(), r = await Bn(), o = new Z().usePlugin(s.ModelDataPlugin.create({
     detailsPoint: !1,
     whiteModel: !0
   })).usePlugin(i.RenderPlugin.create({
@@ -5561,10 +5624,10 @@ async function Rn(u, t, e = !1, n) {
   })).usePlugin(r.Editor.create({ viewPermission: n })), a = o.findComponentByType(i.components.DomContainer);
   return a && u.appendChild(a.domElement), gt = o, {
     dxfSystem: o,
-    getFileAll: () => An(o)
+    getFileAll: () => On(o)
   };
 }
-async function An(u = gt) {
+async function On(u = gt) {
   const t = u.findComponentByName("WhiteModel"), e = new File([await u.AngleCorrectionDxf.toDxfImageBlob()], "img.jpg", { type: "image/jpeg" }), n = new File([u.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), s = new File([u.AngleCorrectionDxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), i = new File([await t.toOBJBlob()], "model.obj", { type: "application/octet-stream" }), r = new File([await t.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), o = new File([await t.toGltfBlob(!1)], "model.gltf", { type: "application/json" }), a = new File([JSON.stringify(u.Dxf.originalData)], "json.json", { type: "application/json" });
   return {
     dxf: n,
@@ -5576,32 +5639,32 @@ async function An(u = gt) {
     correctionDxf: s
   };
 }
-function Cn() {
+function _n() {
   return gt;
 }
 export {
-  qt as A,
-  R as B,
-  z as C,
-  K as D,
-  Rt as E,
-  E as L,
-  wn as M,
-  D as P,
-  O as Q,
-  _e as T,
+  Gt as A,
+  I as B,
+  G as C,
+  Z as D,
+  Nt as E,
+  D as L,
+  In as M,
+  w as P,
+  B as Q,
+  He as T,
   Ut as V,
   Yt as W,
-  kt as a,
-  G as b,
-  W as c,
-  qe as d,
-  Rn as e,
-  Cn as f,
-  An as g,
+  Xt as a,
+  Y as b,
+  J as c,
+  Xe as d,
+  zn as e,
+  _n as f,
+  On as g,
   k as h,
-  mn as i,
-  vn as j,
-  V as r,
+  Pn as i,
+  Un as j,
+  X as r,
   tt as u
 };