build-dxf 0.0.48 → 0.0.49

package/src/build.js

@@ -1,16 +1,16 @@
-import * as P 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 * as v from "three";
+import { EventDispatcher as oe, Color as ae, Matrix4 as Gt, Vector3 as it, Quaternion as ce, BufferAttribute as Y, REVISION as le, CompressedTexture as ht, Source as he, NoColorSpace as ue, MathUtils as pt, RGBAFormat as de, ImageUtils as fe, DoubleSide as pe, PropertyBinding as rt, InterpolateDiscrete as ge, Scene as Dt, SRGBColorSpace as ye, NearestFilter as xe, NearestMipmapNearestFilter as me, NearestMipmapLinearFilter as we, LinearFilter as Me, LinearMipmapNearestFilter as De, LinearMipmapLinearFilter as Le, ClampToEdgeWrapping as Se, RepeatWrapping as Ee, MirroredRepeatWrapping as Ae, InterpolateLinear as Te } from "three";
+import Lt from "clipper-lib";
 import st from "dxf-writer";
-import { OBJExporter as xe } from "three/examples/jsm/exporters/OBJExporter.js";
-function tt() {
+import { OBJExporter as be } from "three/examples/jsm/exporters/OBJExporter.js";
+function $() {
   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 Nt extends $t {
-  uuid = tt();
+class Ut extends oe {
+  uuid = $();
   addEventListener(t, e, n) {
     const { once: s = !1 } = n ?? {}, i = (o) => {
       e(o), s && r();
@@ -30,7 +30,7 @@ class Nt extends $t {
     e && (e.forEach((n) => n()), this.eventRecordStack.delete(t));
   }
 }
-class G extends Nt {
+class z extends Ut {
   parent;
   destroyed = !1;
   constructor(...t) {
@@ -48,7 +48,7 @@ class G extends Nt {
     this.destroyed = !0;
   }
 }
-class me extends Nt {
+class Pe extends Ut {
   static EventType = {
     ADD_COMPONENT: "addComponent"
   };
@@ -71,7 +71,7 @@ class me extends Nt {
    * @param component 
    */
   removeComponent(t) {
-    if (t instanceof G) {
+    if (t instanceof z) {
       const e = this.components.indexOf(t);
       e > -1 && (this.components.splice(e, 1), this.dispatchEvent({
         type: "removeComponent",
@@ -116,17 +116,17 @@ class me extends Nt {
     return e || null;
   }
 }
-class I {
+class R {
   minX = 0;
   maxX = 0;
   minY = 0;
   maxY = 0;
   get points() {
     return [
-      new w(this.minX, this.minY),
-      new w(this.maxX, this.minY),
-      new w(this.maxX, this.maxY),
-      new w(this.minX, this.maxY)
+      new D(this.minX, this.minY),
+      new D(this.maxX, this.minY),
+      new D(this.maxX, this.maxY),
+      new D(this.minX, this.maxY)
     ];
   }
   get width() {
@@ -136,7 +136,7 @@ class I {
     return this.maxY - this.minY;
   }
   get center() {
-    return new w(
+    return new D(
       this.minX + (this.maxX - this.minX) * 0.5,
       this.minY + (this.maxY - this.minY) * 0.5
     );
@@ -202,9 +202,9 @@ class I {
     const o = this.points;
     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 = (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))
+      for (let f = 0; f < 4; f++) {
+        const d = e[f], p = e[(f + 1) % 4], g = (h.x - l.x) * (d.y - l.y) - (h.y - l.y) * (d.x - l.x), y = (h.x - l.x) * (p.y - l.y) - (h.y - l.y) * (p.x - l.x), x = (p.x - d.x) * (l.y - d.y) - (p.y - d.y) * (l.x - d.x), m = (p.x - d.x) * (h.y - d.y) - (p.y - d.y) * (h.x - d.x);
+        if (g * y < 0 && x * m < 0 || g === 0 && Math.min(l.x, h.x) <= d.x && d.x <= Math.max(l.x, h.x) && Math.min(l.y, h.y) <= d.y && d.y <= Math.max(l.y, h.y) || y === 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(d.x, p.x) <= l.x && l.x <= Math.max(d.x, p.x) && Math.min(d.y, p.y) <= l.y && l.y <= Math.max(d.y, p.y) || m === 0 && Math.min(d.x, p.x) <= h.x && h.x <= Math.max(d.x, p.x) && Math.min(d.y, p.y) <= h.y && h.y <= Math.max(d.y, p.y))
           return !0;
       }
     }
@@ -216,14 +216,14 @@ class I {
     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);
+        const f = e[h], d = e[(h + 1) % 4], p = (d.x - f.x) * (c.y - f.y) - (d.y - f.y) * (c.x - f.x);
         if (p === 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;
+          const g = Math.abs(d.x - f.x) > 1e-10 ? d.x - f.x : d.y - f.y, y = g ? (c.x - f.x) / g : 0;
+          if (y >= 0 && y <= 1) return !0;
         } else {
-          const y = p > 0 ? 1 : -1;
-          if (l === 0) l = y;
-          else if (l !== y) return !1;
+          const g = p > 0 ? 1 : -1;
+          if (l === 0) l = g;
+          else if (l !== g) return !1;
         }
       }
       return !0;
@@ -299,7 +299,7 @@ class I {
    * @returns 
    */
   clone() {
-    return new I(this.minX, this.maxX, this.minY, this.maxY);
+    return new R(this.minX, this.maxX, this.minY, this.maxY);
   }
   /**
    * 
@@ -310,7 +310,7 @@ class I {
     const e = [], n = [];
     return t.forEach((s) => {
       e.push(s.x), n.push(s.y);
-    }), new I(
+    }), new R(
       Math.min(...e),
       Math.max(...e),
       Math.min(...n),
@@ -328,7 +328,7 @@ class I {
       s?.points?.forEach((i) => {
         e.push(i.x), n.push(i.y);
       });
-    }), new I(
+    }), new R(
       Math.min(...e),
       Math.max(...e),
       Math.min(...n),
@@ -336,7 +336,7 @@ class I {
     );
   }
 }
-class we extends Array {
+class Ie extends Array {
   userDataList() {
     return this.map((t) => t.userData);
   }
@@ -344,7 +344,7 @@ class we extends Array {
     return this.map((t) => t.point);
   }
 }
-class Y {
+class q {
   map = /* @__PURE__ */ new Map();
   gridSize;
   id;
@@ -365,7 +365,7 @@ class Y {
     const s = this.map.get(n), i = { point: t, userData: e };
     s.add(i);
     const r = { set: s, target: i, id: n };
-    t.currentData.pointVirtualGrid = r, t.currentData[this.id] = r;
+    return t.currentData.pointVirtualGrid = r, t.currentData[this.id] = r, this;
   }
   /**
    * 批量加入
@@ -383,6 +383,7 @@ class Y {
       const { target: e, set: n, id: s } = t.currentData[this.id];
       n && (n.delete(e), delete t?.userData?.pointVirtualGridMap, delete t.currentData[this.id], n.size === 0 && this.map.delete(s));
     }
+    return this;
   }
   update(t) {
     const { target: e, set: n } = t.currentData[this.id];
@@ -416,7 +417,7 @@ class Y {
    */
   decodeGridId(t) {
     const [e, n] = t.split(".").map(Number);
-    return new w(e, n);
+    return new D(e, n);
   }
   /**
    * 查询与矩形相交的点
@@ -441,13 +442,13 @@ class Y {
    * @returns 相交的节点数组
    */
   queryCircle(t, e) {
-    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 = [];
+    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 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);
+        this.map.get(h)?.forEach((d) => {
+          t.distance(d.point) <= e && a.push(d);
         });
       }
     return a;
@@ -474,7 +475,7 @@ class Y {
    * @param point 
    */
   queryPoint(t, e = !1) {
-    const n = new we();
+    const n = new Ie();
     let s;
     if (t.currentData[this.id])
       s = t.currentData[this.id]?.set;
@@ -515,7 +516,7 @@ class Y {
       if (t.size === 1) return [...t][0];
   }
 }
-function J(u) {
+function V(u) {
   if (!u || typeof u != "object")
     return u;
   const t = Array.isArray(u) ? [] : {}, e = Object.keys(u);
@@ -526,17 +527,17 @@ function J(u) {
       continue;
     }
     if (Array.isArray(s)) {
-      t[n] = s.map((i) => J(i));
+      t[n] = s.map((i) => V(i));
       continue;
     }
     if (Object.getPrototypeOf(s) === Object.prototype) {
-      t[n] = J(s);
+      t[n] = V(s);
       continue;
     }
   }
   return t;
 }
-class nt {
+class et {
   points;
   get p0() {
     return this.points[0];
@@ -559,7 +560,7 @@ class nt {
   path2D(t) {
     return this.points.flatMap((e, n) => {
       const s = this.points[(n + 1) % this.points.length];
-      return t && t(new w(e.x, e.y), new w(s.x, s.y)), [e.x, e.y, s.x, s.y];
+      return t && t(new D(e.x, e.y), new D(s.x, s.y)), [e.x, e.y, s.x, s.y];
     });
   }
   createGeometry() {
@@ -590,12 +591,12 @@ class nt {
       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)
+        const d = c * c + l * l, p = ((e.x - o.x) * c + (e.y - o.y) * l) / d, g = ((n.x - o.x) * c + (n.y - o.y) * l) / d;
+        if (Math.max(p, g) >= 0 && Math.min(p, g) <= 1)
           return !0;
       } else {
-        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)
+        const f = ((o.x - e.x) * l - (o.y - e.y) * c) / h, d = ((o.x - e.x) * i - (o.y - e.y) * s) / h;
+        if (f >= 0 && f <= 1 && d >= 0 && d <= 1)
           return !0;
       }
     }
@@ -677,7 +678,7 @@ class nt {
     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 I(t, e, n, s);
+    }), new R(t, e, n, s);
   }
   /**
    * 
@@ -686,16 +687,16 @@ class nt {
    * @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) : 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)
+    const i = t.points[0], r = t.points[1], o = r.normal(i), a = n ? r.direction(i).mutiplyScalar(e * s) : D.zero(), c = n ? i.direction(r).mutiplyScalar(e * s) : D.zero(), l = o.x * e * 0.5, h = o.y * e * 0.5;
+    return new et([
+      new D(i.x + l, i.y + h).add(c),
+      new D(r.x + l, r.y + h).add(a),
+      new D(r.x - l, r.y - h).add(a),
+      new D(i.x - l, i.y - h).add(c)
     ]);
   }
 }
-class B {
+class j {
   bounds;
   // 包围盒
   capacity;
@@ -721,7 +722,7 @@ class B {
    * @param node 线段节点
    */
   insert(t) {
-    if (t instanceof D) {
+    if (t instanceof L) {
       this.insert({ line: t, userData: {} });
       return;
     }
@@ -746,7 +747,7 @@ class B {
    * @param node 
    */
   remove(t) {
-    if (t instanceof D) {
+    if (t instanceof L) {
       t = t.currentData[this.id], t && this.remove(t);
       return;
     }
@@ -781,26 +782,26 @@ class B {
     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 B(
-      new I(this.bounds.minX, t, this.bounds.minY, e),
+    this.children[0] = new j(
+      new R(this.bounds.minX, t, this.bounds.minY, e),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
       this.id
-    ), this.children[1] = new B(
-      new I(t, this.bounds.maxX, this.bounds.minY, e),
+    ), this.children[1] = new j(
+      new R(t, this.bounds.maxX, this.bounds.minY, e),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
       this.id
-    ), this.children[2] = new B(
-      new I(this.bounds.minX, t, e, this.bounds.maxY),
+    ), this.children[2] = new j(
+      new R(this.bounds.minX, t, e, this.bounds.maxY),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
       this.id
-    ), this.children[3] = new B(
-      new I(t, this.bounds.maxX, e, this.bounds.maxY),
+    ), this.children[3] = new j(
+      new R(t, this.bounds.maxX, e, this.bounds.maxY),
       this.capacity,
       this.maxDepth,
       this.depth + 1,
@@ -830,7 +831,7 @@ class B {
    * @returns 相交的节点数组
    */
   queryCircle(t, e) {
-    const n = [], s = new I(
+    const n = [], s = new R(
       t.x - e,
       t.x + e,
       t.y - e,
@@ -842,8 +843,8 @@ class B {
       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);
+      const f = r.x + h * a, d = r.y + h * c;
+      t.distance(new D(f, d)) <= e && n.push(i);
     }
     if (!this.isLeaf)
       for (const i of this.children)
@@ -911,13 +912,110 @@ class B {
     })), t;
   }
 }
-class D {
-  points = [new w(), new w()];
+class gt extends Map {
+  get valueArray() {
+    return [...this.values()];
+  }
+  map(t) {
+    const e = [];
+    for (const [n, s] of this)
+      e.push(t(s, n));
+    return e;
+  }
+  filter(t) {
+    const e = [];
+    for (const [n, s] of this)
+      t(s, n) && e.push(s);
+    return e;
+  }
+  reduce(t, e) {
+    for (const [n, s] of this)
+      e = t(e, s, n);
+    return e;
+  }
+  some(t) {
+    for (const [e, n] of this)
+      if (t(n, e)) return !0;
+    return !1;
+  }
+  every(t) {
+    for (const [e, n] of this)
+      if (!t(n, e)) return !1;
+    return !0;
+  }
+  find(t) {
+    for (const [e, n] of this)
+      if (t(n, e)) return n;
+  }
+  findKey(t) {
+    for (const [e, n] of this)
+      if (t(n, e)) return e;
+  }
+  someKeys(t) {
+    return t.some((e) => this.has(e));
+  }
+  everyKeys(t) {
+    return t.every((e) => this.has(e));
+  }
+  group(t) {
+    const e = new J();
+    for (const [n, s] of this) {
+      const i = t(s, n);
+      e.append(i, s);
+    }
+    return e;
+  }
+  toObject() {
+    return this.reduce((t, e, n) => (t[`${n}`] = e, t), {});
+  }
+}
+class J extends gt {
+  append(t, ...e) {
+    return e.forEach((n) => {
+      this.has(t) || this.set(t, []), this.get(t)?.push(n);
+    }), this;
+  }
+}
+class qt extends gt {
+  set(t) {
+    let e = super.get(t) ?? 0;
+    return super.set(t, ++e), this;
+  }
+}
+class ct {
+  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 J();
+    for (const e of this.parent.keys()) {
+      const n = this.find(e);
+      t.append(n, e);
+    }
+    return t;
+  }
+}
+class L {
+  points = [new D(), new D()];
   userData = {};
   currentData = {};
   // line: any
   get center() {
-    return new w(
+    return new D(
       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
     );
@@ -928,8 +1026,7 @@ class D {
   get end() {
     return this.points[1];
   }
-  id = 0;
-  constructor(t = new w(), e = new w()) {
+  constructor(t = new D(), e = new D()) {
     this.points = [t, e];
   }
   set(t, e) {
@@ -1019,21 +1116,32 @@ class D {
     const e = this.center;
     return this.start.rotate(e, t), this.end.rotate(e, t), this;
   }
+  /** 镜像线段
+   */
+  mirror() {
+    this.end.rotate(this.start, Math.PI);
+  }
+  /** 交换两个端点
+   */
+  swap() {
+    const t = this.points[1];
+    this.points[0] = this.points[1], this.points[1] = t;
+  }
   /** 膨胀为矩形
    * 
    * @param width 
    * @returns {Rectangle}
    */
   expandToRectangle(t = 0.1, e = "all") {
-    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 = [
+    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, c = i.y * t * 0.5, l = [
       // 第一条线
-      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 + c).add(o),
+      new D(s.x + a, s.y + c).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 - c).add(o),
+      new D(s.x - a, s.y - c).add(r)
     ];
-    return new nt([0, 1, 3, 2].map((h) => l[h]));
+    return new et([0, 1, 3, 2].map((h) => l[h]));
   }
   /**
    * 计算线段的长度
@@ -1070,24 +1178,24 @@ class D {
   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 w(i.x - s.x, i.y - s.y);
+    const [e, n] = t.points, [s, i] = this.points, r = new D(i.x - s.x, i.y - s.y);
     if (r.x === 0 && r.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
     const o = (p) => {
-      const y = new w(p.x - s.x, p.y - s.y), 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);
+      const g = new D(p.x - s.x, p.y - s.y), y = r.x * r.x + r.y * r.y, m = (g.x * r.x + g.y * r.y) / y, w = s.x + m * r.x, M = s.y + m * r.y;
+      return new D(w, M);
     };
     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;
+      const g = new D(p.x - s.x, p.y - s.y), y = r.x * r.x + r.y * r.y;
+      return (g.x * r.x + g.y * r.y) / y;
     };
-    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 w(g, x);
+    let h = l(a), f = l(c);
+    const d = (p) => {
+      const g = Math.max(0, Math.min(1, p)), y = s.x + g * r.x, x = s.y + g * r.y;
+      return new D(y, x);
     };
-    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);
+    return (h < 0 || h > 1) && (a = d(h)), (f < 0 || f > 1) && (c = d(f)), a.x === c.x && a.y === c.y ? new L(a, a) : new L(a, c);
   }
   /**
    * 计算一条线段在另一条直线上的投影
@@ -1096,27 +1204,27 @@ class D {
    * @returns 投影并裁剪后的线段
    */
   projectPoint(t, e = !0) {
-    const [n, s] = this.points, i = new w(s.x - n.x, s.y - n.y);
+    const [n, s] = this.points, i = new D(s.x - n.x, s.y - n.y);
     if (i.x === 0 && i.y === 0)
       return null;
     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);
+      const h = new D(l.x - n.x, l.y - n.y), f = i.x * i.x + i.y * i.y, p = (h.x * i.x + h.y * i.y) / f, g = n.x + p * i.x, y = n.y + p * i.y;
+      return new D(g, y);
     })(t);
     if (!e) return o;
     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;
+      const h = new D(l.x - n.x, l.y - n.y), f = i.x * i.x + i.y * i.y;
+      return (h.x * i.x + h.y * i.y) / f;
     })(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);
+    const [e, n] = this.points, s = new D(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;
+    const i = new D(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;
   }
   /**
@@ -1137,14 +1245,14 @@ class D {
    */
   intersectLineSegment(t, e = !0) {
     const n = this.start, s = this.end, i = t.start, r = t.end;
-    function o(f, p, y) {
-      return (p.x - f.x) * (y.y - f.y) - (p.y - f.y) * (y.x - f.x);
+    function o(d, p, g) {
+      return (p.x - d.x) * (g.y - d.y) - (p.y - d.y) * (g.x - d.x);
     }
-    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;
+    function a(d, p, g) {
+      return Math.min(p.x, g.x) - 1e-10 <= d.x && d.x <= Math.max(p.x, g.x) + 1e-10 && Math.min(p.y, g.y) - 1e-10 <= d.y && d.y <= Math.max(p.y, g.y) + 1e-10;
     }
-    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)));
+    const c = o(n, s, i), l = o(n, s, r), h = o(i, r, n), f = o(i, r, s);
+    return !!(c * l < 0 && h * f < 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(f) < 1e-10 && a(s, i, r)));
   }
   /**
    * 判断一个点是否在线段上（含端点）
@@ -1165,7 +1273,7 @@ class D {
     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), c = e.y + o * (n.y - e.y);
-    return new w(a, c);
+    return new D(a, c);
   }
   /**
    * 获取两条线段夹角
@@ -1187,7 +1295,7 @@ class D {
    * @param line 
    */
   parallel(t, e = 1) {
-    return t instanceof D ? this.parallel(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), t < e || t > 180 - e);
+    return t instanceof L ? this.parallel(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), t < e || t > 180 - e);
   }
   /** 两条线段或角度是否 垂直
    * @param line 
@@ -1195,7 +1303,7 @@ class D {
    * @returns 
    */
   vertical(t, e = 0.1) {
-    return t instanceof D ? this.vertical(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), Math.abs(t - 90) < e);
+    return t instanceof L ? this.vertical(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), Math.abs(t - 90) < e);
   }
   /**
    * 两条线段方向相反否一致
@@ -1246,8 +1354,8 @@ class D {
       if (l > 1)
         return n.distance(r);
       {
-        const h = i.x + l * o, d = i.y + l * a;
-        return n.distance(new w(h, d));
+        const h = i.x + l * o, f = i.y + l * a;
+        return n.distance(new D(h, f));
       }
     };
     return Math.min(
@@ -1270,11 +1378,11 @@ class D {
    * @returns 
    */
   clone() {
-    const t = new D(
+    const t = new L(
       this.points[0].clone(),
       this.points[1].clone()
     );
-    return t.userData = J(this.userData), t;
+    return t.userData = V(this.userData), t;
   }
   /**
    * 获取最长线段
@@ -1293,7 +1401,7 @@ class D {
    * @param lines 
    */
   static groupBySamePointAndParallel(t) {
-    const e = new Y(), n = new B(I.fromByLineSegment(...t));
+    const e = new q(), n = new j(R.fromByLineSegment(...t));
     t.forEach((o) => {
       o.points.forEach((a) => e.insert(a, o)), n.insert(o);
     });
@@ -1331,22 +1439,60 @@ class D {
       n.has(i) || n.set(i, []), n.get(i)?.push(s);
     }), [...n.values()];
   }
+  /** 通过路径，给线段分组
+   * @param lines 
+   * @returns 
+   */
+  static groupByPath(t) {
+    const e = new q();
+    t.forEach((r) => r.points.forEach((o) => e.insert(o, r)));
+    function n(r, o, a) {
+      e.queryPoint(r, !0).forEach((l) => {
+        const h = l.userData;
+        if (a.has(h)) return;
+        a.add(h), o.push(h);
+        const f = h.getAnotherPoint(l.point);
+        n(f, o, a);
+      });
+    }
+    const s = /* @__PURE__ */ new Set(), i = [];
+    for (let r = 0; r < t.length; r++) {
+      const o = t[r];
+      if (s.has(o)) continue;
+      const a = [o];
+      s.add(o), n(o.start, a, s), n(o.end, a, s), i.push(a);
+    }
+    return i;
+  }
+  /** 分组，通过点
+   * @param lines 
+   * @returns 
+   */
+  static groupByPoint(t) {
+    const e = new ct(t.length), n = /* @__PURE__ */ new Map();
+    for (let s = 0; s < t.length; s++)
+      t[s].points.forEach((i) => {
+        const r = i.hashCode();
+        n.has(r) && e.union(n.get(r), s), n.set(r, s);
+      });
+    return e.getAllSets().valueArray.map((s) => s.map((i) => t[i]));
+  }
   /** 合并线段到最长线段
    * @param lines
    * @returns 
    */
   static mergeLinesByMaxlength(...t) {
     if (t.length === 1) return t[0];
-    const n = t.slice(0).sort((h, d) => d.length() - h.length())[0], s = n.direction().normalize();
+    const n = t.slice(0).sort((h, f) => f.length() - h.length())[0], s = n.direction().normalize();
     let i = n.start.clone(), r = n.end.clone();
     const o = (h) => h.x * s.x + h.y * s.y;
     let a = o(i), c = o(r);
     for (const h of t)
-      for (const d of h.points) {
-        const f = o(d);
-        f < a && (a = f, i = n.projectPoint(d, !1)), f > c && (c = f, r = n.projectPoint(d, !1));
+      for (const f of h.points) {
+        const d = o(f);
+        d < a && (a = d, i = n.projectPoint(f, !1)), d > c && (c = d, r = n.projectPoint(f, !1));
       }
-    const l = new D(i, r);
+    const l = new L(i, r);
     return t.forEach((h) => h.userData.fittedLine = l), l;
   }
   /** 合并平行线段
@@ -1355,18 +1501,18 @@ class D {
    */
   static mergeLines(...t) {
     if (t.length === 1) return t[0];
-    const e = t.slice(0).sort((p, y) => y.length() - p.length()), n = [];
+    const e = t.slice(0).sort((p, g) => g.length() - p.length()), n = [];
     t.forEach((p) => {
       n.push(p.start.clone(), p.end.clone());
     });
     const s = e[0].direction().normalize();
     let i = 1 / 0, r = -1 / 0, o = 0, a = 0;
     n.forEach((p) => {
-      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 g = p.x * s.x + p.y * s.y;
+      i = Math.min(i, g), r = Math.max(r, g), o += p.x, a += p.y;
     });
-    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;
+    const c = new D(o / n.length, a / n.length), l = c.x * s.x + c.y * s.y, h = new D(c.x + (i - l) * s.x, c.y + (i - l) * s.y), f = new D(c.x + (r - l) * s.x, c.y + (r - l) * s.y), d = new L(h, f);
+    return t.forEach((p) => p.userData.fittedLine = d), d;
   }
   /** 合并满足平行的线段
    * @param selectLines 
@@ -1397,18 +1543,18 @@ class D {
     const s = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map();
     function r(c) {
       const l = i.get(c[0]), h = i.get(c[1]);
-      let d;
+      let f;
       if (l && h) {
-        d = l;
+        f = l;
         const p = s.get(l);
-        [...s.get(h)].forEach((g) => {
-          p.add(g), i.set(g, d);
+        [...s.get(h)].forEach((y) => {
+          p.add(y), i.set(y, f);
         });
-      } else d = l ?? h ?? (Math.random() * 16777215).toString(16);
-      s.has(d) || s.set(d, /* @__PURE__ */ new Set());
-      const f = s.get(d);
+      } else f = l ?? h ?? (Math.random() * 16777215).toString(16);
+      s.has(f) || s.set(f, /* @__PURE__ */ new Set());
+      const d = s.get(f);
       c.forEach((p) => {
-        i.set(p, d), f?.add(p);
+        i.set(p, f), d?.add(p);
       });
     }
     for (const c of n.values()) {
@@ -1419,7 +1565,7 @@ class D {
     const o = /* @__PURE__ */ new Set(), a = [];
     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);
+      e && e(h, l), l.forEach((f) => o.add(f)), a.push(h);
     }
     return t = t.filter((c) => !o.has(c)), t.push(...a), t;
   }
@@ -1441,7 +1587,7 @@ class D {
    * @returns 
    */
   static clipping(t, e, n) {
-    if (!(t instanceof D)) throw new Error("参数1并非线段");
+    if (!(t instanceof L)) 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));
@@ -1460,7 +1606,7 @@ class D {
     return this.clipping(t, [s, i].filter((o) => !!o), n).filter((o) => !(e.projectLineSegment(o).length() / e.length() > 0.8));
   }
 }
-class w {
+class D {
   x;
   y;
   get X() {
@@ -1554,6 +1700,9 @@ class w {
   add(t) {
     return this.x += t.x, this.y += t.y, this;
   }
+  parseInt() {
+    return this.x = ~~this.x, this.y = ~~this.y, this;
+  }
   /**
    * 绕point旋转angle
    * @param point 
@@ -1587,7 +1736,7 @@ class w {
    */
   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 w(i, r);
+    return new D(i, r);
   }
   /**
    * 获取由传入的点到该点的单位方向向量
@@ -1597,14 +1746,14 @@ class w {
    */
   direction(t) {
     const e = this.x - t.x, n = this.y - t.y, s = Math.sqrt(e * e + n * n);
-    return s === 0 ? new w(0, 0) : new w(e / s, n / s);
+    return s === 0 ? new D(0, 0) : new D(e / s, n / s);
   }
   /** 展开为线
    * @param direction 
    * @param length 
    */
   expandAsLine(t, e, n) {
-    const s = new D(
+    const s = new L(
       this.clone(),
       this.clone().add(t.clone().multiplyScalar(e))
     );
@@ -1679,7 +1828,7 @@ class w {
    * @returns 
    */
   clone() {
-    return new w(this.x, this.y);
+    return new D(this.x, this.y);
   }
   /**
    * 克隆
@@ -1696,10 +1845,10 @@ class w {
     };
   }
   static from(t) {
-    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();
+    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();
   }
   static zero() {
-    return new w(0, 0);
+    return new D(0, 0);
   }
 }
 async function H(u, t = !0) {
@@ -1713,25 +1862,25 @@ async function H(u, t = !0) {
     return t && (e = e.default), e;
   }
 }
-function Bt(u, t = 0, e, n) {
+function zt(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 {
-    ...J(s),
+    ...V(s),
     start: u.start.toJson(t),
     end: u.end.toJson(t),
     insetionArr: r,
     length: u.length(),
     drawWindow: i && i.map((a) => ({
-      ...J(a),
+      ...V(a),
       p: { x: a.p.x, y: a.p.y, z: a.p.z }
     }))
   };
 }
-function et(u, t = 0, e) {
-  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 tt(u, t = 0, e) {
+  return e || (e = new j(R.fromByLineSegment(...u)), u.forEach((n) => e?.insert({ line: n, userData: void 0 })), Promise.resolve().then(() => e?.clear())), u.map((n) => zt(n, t, e, u));
 }
-function ft(u, t = 0.03) {
-  const e = new B(I.fromByLineSegment(...u));
+function ot(u, t = 0.03) {
+  const e = new j(R.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) => {
@@ -1745,247 +1894,72 @@ function ft(u, t = 0.03) {
       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 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(D.from(l.p))) ?? []), c;
       });
-      return r.userData.drawWindow = r.userData.drawWindow?.filter((a) => r.isPointOnSegment(w.from(a.p))) ?? [], [...o, r];
+      return r.userData.drawWindow = r.userData.drawWindow?.filter((a) => r.isPointOnSegment(D.from(a.p))) ?? [], [...o, r];
     }
     return s;
   }).filter((s) => s.length() >= t);
   return e.clear(), n;
 }
-function X(...u) {
+function K(...u) {
   u.forEach((t) => {
     const e = t.direction();
     t.userData.drawWindow?.forEach((n) => {
       try {
-        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 D(i, r)), a = o.center;
-        n.p = {
-          x: a?.x ?? 0,
-          y: a?.y ?? 0,
-          z: n.p.z
-        }, n.width = o.length();
+        if (n.full) {
+          const s = t.center;
+          n.p = { x: s?.x ?? 0, y: s?.y ?? 0, z: n.p.z }, n.width = t.length();
+        } else {
+          const s = D.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 L(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 Ot(u) {
-  if (u.length < 3) return 0;
-  let t = 0;
-  const e = u.length;
-  for (let n = 0; n < e; n++) {
-    const s = (n + 1) % e;
-    t += u[n].x * u[s].y, t -= u[s].x * u[n].y;
-  }
-  return Math.abs(t) / 2;
-}
-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 Me extends Map {
-  get valueArray() {
-    return [...this.values()];
-  }
-  map(t) {
-    const e = [];
-    for (const [n, s] of this)
-      e.push(t(s, n));
-    return e;
-  }
-  filter(t) {
-    const e = [];
-    for (const [n, s] of this)
-      t(s, n) && e.push(s);
-    return e;
-  }
-  reduce(t, e) {
-    for (const [n, s] of this)
-      e = t(e, s, n);
-    return e;
-  }
-  some(t) {
-    for (const [e, n] of this)
-      if (t(n, e)) return !0;
-    return !1;
-  }
-  every(t) {
-    for (const [e, n] of this)
-      if (!t(n, e)) return !1;
-    return !0;
-  }
-  find(t) {
-    for (const [e, n] of this)
-      if (t(n, e)) return n;
-  }
-  findKey(t) {
-    for (const [e, n] of this)
-      if (t(n, e)) return e;
-  }
-  someKeys(t) {
-    return t.some((e) => this.has(e));
-  }
-  everyKeys(t) {
-    return t.every((e) => this.has(e));
-  }
-  group(t) {
-    const e = new at();
-    for (const [n, s] of this) {
-      const i = t(s, n);
-      e.append(i, s);
-    }
-    return e;
-  }
-  toObject() {
-    return this.reduce((t, e, n) => (t[`${n}`] = e, t), {});
-  }
-}
-class at extends Me {
-  append(t, ...e) {
-    return e.forEach((n) => {
-      this.has(t) || this.set(t, []), this.get(t)?.push(n);
-    }), this;
-  }
-}
-function De(u, t, e, n = !0) {
-  e = e ?? /* @__PURE__ */ new Set();
-  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 o = 0; o < u.length; o++) {
-    const a = u[o];
-    r(a);
-  }
-  return s || i.clear(), e;
-}
-function jt(u, t) {
-  const e = t || V(u);
-  function n(r, o, a) {
-    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);
-    });
-  }
-  const s = /* @__PURE__ */ new Set(), i = [];
-  for (let r = 0; r < u.length; r++) {
-    const o = u[r];
-    if (s.has(o)) continue;
-    const a = [o];
-    s.add(o), n(o.start, a, s), n(o.end, a, s), i.push(a);
-  }
-  return i;
-}
-function Le(u, t = /* @__PURE__ */ new Set(), e) {
-  const n = e ?? V(u), s = /* @__PURE__ */ new Set();
-  let i = 0;
-  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 === l[0]) {
-        if (y.end === g) continue;
-        return !0;
-      }
-      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 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 ? jt(u) : [u];
-}
-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);
-    if (i.length !== 1) break;
-    const { point: r, userData: o } = i[0];
-    if (s = o?.getAnotherPoint(r), n.has(s)) break;
-    n.add(s);
-  }
-  return n.add(e.clone()), [...n];
-}
-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 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;
+function _t(...u) {
+  u.forEach((t) => {
+    t.userData.drawWindow?.forEach((e) => {
+      try {
+        const n = t.projectPoint(D.from(e.p));
+        e.p = {
+          x: n?.x ?? 0,
+          y: n?.y ?? 0,
+          z: e.p.z
+        };
+      } catch {
       }
-      l.push(y), i(y, l, p.point), l.pop();
-    });
-  }
-  for (let c = 0; c < u.length; c++) {
-    const l = u[c];
-    n.has(l) || i(l, [l]);
-  }
-  let r = 0, o = [];
-  e.forEach((c) => {
-    const l = Se(c), h = Ot(l);
-    h >= r && (r = h, o = c);
+    }), t.userData.drawWindow = t.userData.drawWindow?.filter((e) => e.width > 1e-9);
   });
-  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 Ft(u) {
-  if (u.length === 0) return { lines: u, groups: [], removeLines: [] };
-  const t = V(u), e = De(u, t);
-  let n = u.filter((i) => !e.has(i));
-  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
-  };
 }
-function $(u, t) {
+function U(u, t) {
   if (Array.isArray(t))
-    return t.forEach((s) => $(u, s));
+    return t.forEach((s) => U(u, s));
   const { drawWindow: e, ...n } = t.userData;
   Object.keys(n).forEach((s) => {
     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 qt(u, t) {
+function yt(u, t) {
   const { drawWindow: e, ...n } = t.userData;
   e && (u.userData.drawWindow || (u.userData.drawWindow = []), e.forEach((s) => {
-    const i = w.from(s.p);
+    const i = D.from(s.p);
     u.projectPoint(i) && u.userData.drawWindow?.push(s);
-  }), X(u)), Object.assign(u.userData, n);
+  }), K(u)), Object.assign(u.userData, n);
 }
-class Ae {
+class kt {
   static errorAngle = 4;
   /** 线段投影分析
    * @param index 
@@ -2015,55 +1989,63 @@ class Ae {
       }, !c || c.project.getLength() < 0.08 || c.project2.getLength() < 0.08 ? void 0 : c;
     }
   }
-  /**
-   * 
+  /** 
    * @param lines 
    * @param wallWidth 
    * @returns 
    */
   static complementSide(t, e = 0.4) {
     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) => {
+    let r = new j(R.fromByLineSegment(...n));
+    n.forEach((h, f) => r.insert({ line: h, userData: f })), n.forEach((h, f) => {
+      const d = et.fromByLineSegment(h, e * 2, !1, -0.01);
+      r.queryRect(d).map((g) => g.userData).filter((g) => g !== f).forEach((g) => {
         try {
-          if (s.has(`${d}-${y}`) || s.has(`${y}-${d}`)) return;
-          const g = this.projectionAnalysis(y, d, h, n);
-          g && i.push(g), s.add(`${d}-${y}`);
-        } catch (g) {
-          console.log(g);
+          if (s.has(`${f}-${g}`) || s.has(`${g}-${f}`)) return;
+          const y = this.projectionAnalysis(g, f, h, n);
+          y && i.push(y), s.add(`${f}-${g}`);
+        } catch (y) {
+          console.log(y);
         }
       });
     });
     let o = [];
     const a = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Map();
-    function l(h, d) {
+    function l(h, f) {
       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);
+      const d = h.projectPoint(f.start), p = h.projectPoint(f.end), g = c.get(h);
+      d && g.push(d), p && g.push(p), a.add(h), r.remove(h);
     }
     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 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((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)
+      const f = h.project, d = h.project2, p = h.source, g = h.target;
+      f.includedAngle(d) > 135 && (d.points = [d.points[1], d.points[0]]);
+      const y = new L(f.start.clone(), d.start.clone()), x = new L(f.end.clone(), d.end.clone());
+      o.push(y, x), l(p, f), l(g, d);
+    }), c.forEach((h, f) => {
+      const d = L.clipping(f, h, yt);
+      t.push(...d);
+    }), t = t.filter((h) => !a.has(h)), r.clear(), r = new j(R.fromByLineSegment(...t)), t.forEach((h) => h.userData.isDoor || r.insert(h)), o = L.autoMergeLines(o).lines, o = o.filter((h) => h.length() !== 0).map((h) => {
+      const f = r.queryLineSegment(h).filter((p) => !(!p.line.parallel(h) || p.line.projectLineSegment(h).length() === 0)).map((p) => p.line);
+      if (f.length === 0)
         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((h) => !a.has(h)), t.push(...o), r.clear(), t;
+      const d = L.mergeLines(...f, h);
+      return f.forEach((p) => {
+        U(d, p), r.remove(p), a.add(p);
+      }), r.insert(d), d;
+    }), o = o.filter((h) => !a.has(h)), t = t.filter((h) => !a.has(h)), t.push(...o), t = ot(t, 1e-9), r.clear(), t;
   }
 }
-class be {
+class Yt {
   index = 0;
+  get size() {
+    return this.index;
+  }
+  constructor(t = []) {
+    t.forEach((e) => {
+      const n = this.next();
+      this.map.set(e, n), this.lineMap.set(n, e);
+    });
+  }
   next() {
     return this.index++;
   }
@@ -2083,35 +2065,418 @@ class be {
     return this.lineMap.get(t);
   }
 }
-class Te {
-  parent;
-  rank;
-  constructor(t) {
-    this.parent = Array(t).fill(0).map((e, n) => n), this.rank = Array(t).fill(1);
+class ve {
+  adjacencyList;
+  get size() {
+    return this.adjacencyList.size;
   }
-  // 查找操作，使用路径压缩优化
-  find(t) {
-    return this.parent[t] !== t && (this.parent[t] = this.find(this.parent[t])), this.parent[t];
+  constructor() {
+    this.adjacencyList = /* @__PURE__ */ new Map();
+  }
+  // 添加一个节点到图中
+  addNode(t) {
+    this.adjacencyList.has(t) || this.adjacencyList.set(t, /* @__PURE__ */ new Set());
+  }
+  // 添加一条边（无向边），连接节点 u 和 v
+  addEdge(t, e) {
+    this.adjacencyList.get(t)?.add(e) ?? this.adjacencyList.set(t, /* @__PURE__ */ new Set([e])), this.adjacencyList.get(e)?.add(t) ?? this.adjacencyList.set(e, /* @__PURE__ */ new Set([t]));
+  }
+  // 删除一条边，断开节点 u 和 v 的连接
+  removeEdge(t, e) {
+    this.adjacencyList.get(t)?.delete(e), this.adjacencyList.get(e)?.delete(t);
+  }
+  // 删除一个节点及其相关的所有边
+  removeNode(t) {
+    const e = this.adjacencyList.get(t);
+    if (e) {
+      for (const n of e)
+        this.adjacencyList.get(n)?.delete(t);
+      this.adjacencyList.delete(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));
+  // 获取节点的邻居列表
+  getNeighbors(t) {
+    return this.adjacencyList.get(t);
   }
-  /** 获取所有集合
+  // 打印图的所有节点及其邻居
+  printGraph() {
+    for (let [t, e] of this.adjacencyList.entries())
+      console.log(`${t} -> ${[...e].join(", ")}`);
+  }
+  /** 循环
+   * @param callbackFun 
+   */
+  forEach(t) {
+    for (let [e, n] of this.adjacencyList.entries())
+      t(e, n);
+  }
+}
+class Re extends ve {
+  // 线段存储：使用规范化 key (小索引-大索引) 避免双向存储
+  lineMap = /* @__PURE__ */ new Map();
+  // 点坐标映射
+  pointToIndex = /* @__PURE__ */ new Map();
+  indexToPoint = /* @__PURE__ */ new Map();
+  nextIndex = 0;
+  constructor(t = []) {
+    super(), t.length > 0 && this.buildFromLines(t);
+  }
+  buildFromLines(t) {
+    t.length > 1e3 && (this.pointToIndex.clear(), this.indexToPoint.clear(), this.nextIndex = 0);
+    for (const e of t) {
+      const n = this.getOrCreateIndex(e.start), s = this.getOrCreateIndex(e.end);
+      super.addEdge(n, s);
+      const i = n < s ? `${n}-${s}` : `${s}-${n}`;
+      this.lineMap.set(i, e);
+    }
+  }
+  /** 
+   * 获取两点之间的线段（无向）
+   */
+  getLine(t, e) {
+    const n = t < e ? `${t}-${e}` : `${e}-${t}`;
+    return this.lineMap.get(n);
+  }
+  /** 
+   * 获取或创建点的索引
+   */
+  getOrCreateIndex(t) {
+    const e = t.hashCode();
+    let n = this.pointToIndex.get(e);
+    return n === void 0 && (n = this.nextIndex++, this.pointToIndex.set(e, n), this.indexToPoint.set(n, t)), n;
+  }
+  /** 
+   * 安全获取点索引（已存在才返回）
+   */
+  getIndex(t) {
+    return this.pointToIndex.get(t.hashCode());
+  }
+  /** 
+   * @param index 
    * @returns 
    */
-  getAllSets() {
-    const t = new at();
-    for (const e of this.parent.keys()) {
-      const n = this.find(e);
-      t.append(n, e);
+  getPoint(t) {
+    return this.indexToPoint.get(t);
+  }
+  /** 
+   * 获取所有点（只读数组，懒计算或缓存可进一步优化）
+   */
+  get points() {
+    return Array.from(this.indexToPoint.values());
+  }
+  /** 
+   * 获取所有线段
+   */
+  get lines() {
+    return Array.from(this.lineMap.values());
+  }
+  /** 
+   * 批量添加线段（比逐条 addLine 更快）
+   */
+  addLines(t) {
+    return this.buildFromLines(t), this;
+  }
+  /** 
+   * 清空图
+   */
+  clear() {
+    this.adjacencyList.clear(), this.lineMap.clear(), this.pointToIndex.clear(), this.indexToPoint.clear(), this.nextIndex = 0;
+  }
+}
+function nt(u) {
+  const t = new q();
+  for (const e of u)
+    t.insert(e.start, e), t.insert(e.end, e);
+  return t;
+}
+const Ce = Math.PI / 180;
+function Wt(u, t, e = !1) {
+  const n = nt(u), s = new L(), i = new L(), r = [], o = /* @__PURE__ */ new Set();
+  function a(f, d, p) {
+    const g = f.center, y = f.normal(), x = f.getAnotherPoint(d), m = x.direction(d);
+    s.start.copy(g), s.end.copy(g).add(y.clone().multiplyScalar(1));
+    const w = p.getIntersection(s);
+    return s.end.copy(w), p.direction().angleBetween(m) > Ce * 170 && s.mirror(), s.clone();
+  }
+  function c(f, d, p, g, y, x, m = !0) {
+    if (x.length > u.length || o.has(d)) return;
+    o.add(d);
+    let w;
+    const M = d.getAnotherPoint(p);
+    if (m)
+      if (d.vertical(g))
+        w = a(d, p, y);
+      else {
+        const A = d.center, S = A.distance(y.start), T = A.direction(y.start);
+        w = y.directionMove(T, S);
+      }
+    else w = y;
+    let E = n.queryPoint(M, !0);
+    if (E.length === 1) {
+      const A = E[0], S = A.userData, T = S.getAnotherPoint(A.point), P = T.direction(A.point);
+      if (f === S) return x;
+      if (S.vertical(d)) {
+        const I = M.direction(p), C = S.center, N = P.angleBetween(w.direction()) < 1e-9;
+        w.start.copy(C), w.end.copy(C).add(I.multiplyScalar(0.02)), N && w.mirror();
+      } else {
+        const I = S.center, C = S.center.direction(w.start);
+        w.directionMove(C, I.distance(w.start));
+      }
+      if (x.push(S), c(f, S, A.point, d, w, x, !1)) return x;
+    } else {
+      i.start.copy(w.start).add(w.direction().multiplyScalar(5e-3));
+      const A = [d, ...E.map((S) => {
+        const T = S.userData;
+        return T.length(), T;
+      })];
+      for (let S = 0; S < E.length; S++) {
+        const T = E[S], P = T.userData;
+        if (f === P) return x;
+        if (!(E.length === 4 && P.parallel(d)) && (i.end.copy(P.center), !A.some((I) => I === P ? !1 : I.intersectLineSegment(i))))
+          return x.push(P), c(f, P, T.point, d, w, x);
+      }
     }
-    return t;
+  }
+  function l(f) {
+    const d = n.queryPoint(f.start, !0), p = n.queryPoint(f.end, !0), g = d.length < p.length ? d : p;
+    return g.filter((x) => {
+      if (g.length === 3 && x.userData?.parallel(f)) return !1;
+      const m = x.userData?.getAnotherPoint(x.point);
+      return x.line = x.userData, x.direct = m.direction(x.point), !0;
+    });
+  }
+  function h(f, d) {
+    const p = [], g = f.center;
+    for (let y = 0; y < d.length; y++) {
+      const x = d[y];
+      let m = x.direct;
+      o.clear(), x.line.parallel(f) && (m = d[y ? 0 : 1].direct.clone().multiplyScalar(-1));
+      const w = new L(g.clone(), g.clone().add(m.clone().multiplyScalar(0.2))), M = [f, x.line];
+      (c(f, x.line, x.point, f, w, M) || e) && p.push(M);
+    }
+    return p;
+  }
+  for (let f = 0; f < t.length; f++) {
+    const d = t[f], p = l(d);
+    let g = h(d, p);
+    if (g.length === 0) {
+      const y = p.filter((x) => x.line.parallel(d) ? !1 : (x.direct.multiplyScalar(-1), !0));
+      g = h(d, y);
+    }
+    if (g.length === 2) {
+      const y = new Set(g[0]);
+      g[1].filter((m) => y.has(m)).length > 1 && g.splice(0, 2, g[0].length < g[1].length ? g[0] : g[1]);
+    }
+    r.push(...g);
+  }
+  return r;
+}
+function Ne(u) {
+  const t = new J(), e = [];
+  u.forEach((n) => t.append(n.length, n));
+  for (const n of t.values()) {
+    const s = new Yt(n.flat()), i = new J();
+    n.map((r) => {
+      const o = r.map((a) => s.getIndex(a)).sort((a, c) => a - c).join(",");
+      i.append(o, r);
+    }), i.forEach((r) => e.push(r[0]));
+  }
+  return e;
+}
+function Be(u) {
+  const t = /* @__PURE__ */ new Map(), e = new ct(u.length), n = [];
+  u.forEach((r, o) => {
+    for (let a = 0; a < r.length; a++) {
+      const c = r[a];
+      t.has(c) ? e.union(o, t.get(c)) : t.set(c, o);
+    }
+  });
+  const s = new qt(), i = e.getAllSets().valueArray.map((r) => {
+    let o = r.map((c) => u[c]);
+    return o.length === 1 ? o[0] : (s.clear(), o = Ne(o), o.forEach((c) => c.forEach((l) => s.set(l))), s.reduce((c, l, h) => (l === 1 ? c.push(h) : n.push(h), c), []));
+  });
+  return {
+    internalEdges: n,
+    rings: i
+  };
+}
+function Vt(u) {
+  const t = new Re(u), e = new ct(t.size), n = /* @__PURE__ */ new Set(), s = [];
+  function i(r) {
+    n.add(r), t.getNeighbors(r)?.forEach((a) => {
+      if (!n.has(a))
+        if (e.find(r) === e.find(a)) {
+          const c = t.getLine(r, a);
+          s.push(c);
+        } else
+          e.union(r, a);
+    });
+  }
+  return t.forEach((r) => {
+    n.has(r) || i(r);
+  }), s;
+}
+function Xt(u) {
+  Log.clear();
+  const t = L.groupByPath(u), e = [], n = [];
+  t.forEach((r, o) => {
+    try {
+      let a = Vt(r);
+      const c = Be(Wt(r, a));
+      e.push(...c.rings), n.push(...c.internalEdges);
+    } catch (a) {
+      console.warn("环查找出现异常：", a.message);
+    }
+  });
+  const s = /* @__PURE__ */ new Set([...n]), i = /* @__PURE__ */ new Set([...e.flat()]);
+  return u = u.filter((r) => !s.has(r)), u.forEach((r) => !i.has(r)), u = [...new Set(u)], Log.timeConsuming("找环时间"), {
+    newLines: u,
+    rings: e,
+    internalEdges: n
+  };
+}
+class O {
+  /**
+   * 获取线段的所有分组信息
+   * @param line 
+   * @returns 
+   */
+  static get(t) {
+    const e = [];
+    return typeof t.userData.groupId < "u" && e.push({
+      id: t.userData.groupId,
+      type: t.userData.groupType
+    }), t.userData?.groups?.forEach((n) => e.push({
+      id: n.id,
+      type: n.type
+    })), e;
+  }
+  /**
+   * 为线段添加新的分组
+   * @param line 
+   * @param id 
+   * @param type 
+   * @returns 
+   */
+  static set(t, e, n) {
+    if (!(this.hasId(t, e) || this.hasType(t, n))) {
+      if (typeof t.userData.groupId > "u") {
+        t.userData.groupId = e, t.userData.groupType = n;
+        return;
+      }
+      typeof t.userData.groups > "u" && (t.userData.groups = []), t.userData?.groups?.push({ id: e, type: n });
+    }
+  }
+  /**
+   * 替换线段中的分组信息
+   * @param line 
+   * @param id 
+   * @param type 
+   * @returns 
+   */
+  static replace(t, e, n) {
+    if (t.userData.groupId === e)
+      return t.userData.groupType = n, !0;
+    if (t.userData.groupType === n)
+      return t.userData.groupId = e, !0;
+    if (t.userData.groups)
+      for (let s = 0; s < t.userData.groups.length; s++) {
+        const i = t.userData.groups[s];
+        if (i.id === e)
+          return i.type = n, !0;
+        if (i.type === n)
+          return i.id = e, !0;
+      }
+    return !1;
+  }
+  /**
+   * 检查线段是否包含指定的分组ID
+   * @param line 
+   * @param id 
+   * @returns 
+   */
+  static hasId(t, e) {
+    return typeof t.userData.groupId < "u" && t.userData.groupId === e ? !0 : t.userData?.groups?.some((n) => n.id === e);
+  }
+  /**
+   * 检查线段是否包含指定的分组类型
+   * @param line 
+   * @param type 
+   * @returns 
+   */
+  static hasType(t, e) {
+    return typeof t.userData.groupType < "u" && t.userData.groupType === e ? !0 : !!t.userData?.groups?.some((n) => n.type === e);
+  }
+  /**
+   * 检查线段是否包含所有指定的分组类型
+   * @param line 
+   * @param types 
+   * @returns 
+   */
+  static hasTypes(t, e) {
+    return e.every((n) => this.hasType(t, n));
+  }
+  /**
+   * 检查线段是否包含所有指定的分组类型
+   * @param lines 
+   * @param type 
+   * @returns 
+   */
+  static everyType(t, e) {
+    return !t || t.length === 0 ? !1 : t.every((n) => this.hasType(n, e));
+  }
+  /**
+   * 获取所有线段的交集类型（所有线段都包含的类型）
+   * @param lines 
+   * @returns 
+   */
+  static getIntersectionTypes(t) {
+    const e = new qt();
+    t.forEach((s) => {
+      s.userData.groups && s.userData.groups.forEach((i) => e.set(i.type)), s.userData.groupType && e.set(s.userData.groupType);
+    });
+    const n = [];
+    return e.forEach((s, i) => {
+      s === t.length && n.push(i);
+    }), n;
+  }
+  /**
+   * 获取所有线段的交集类型（所有线段都包含的类型）
+   * @param lines 
+   * @returns 
+   */
+  static getUnionTypes(t) {
+    const e = /* @__PURE__ */ new Set();
+    return t.forEach((n) => {
+      n.userData.groups && n.userData.groups.forEach((s) => e.add(s.type)), n.userData.groupType && e.add(n.userData.groupType);
+    }), Array.from(e);
+  }
+  /**
+   * 获取所有线段的交集类型（所有线段都包含的类型）
+   * @param line 
+   * @param id 
+   * @returns 
+   */
+  static remove(t, e) {
+    if (typeof t.userData.groupType < "u" && t.userData.groupId === e)
+      return delete t.userData.groupId, delete t.userData.groupType, !0;
+    if (t.userData?.groups) {
+      for (let n = 0; n < t.userData.groups.length; n++)
+        if (t.userData.groups[n].id === e)
+          return t.userData.groups.splice(n, 1), !0;
+    }
+    return !1;
+  }
+  /**
+   * 清空线段的所有分组信息
+   * @param line 
+   */
+  static clear(t) {
+    delete t.userData.groupId, delete t.userData.groupType, delete t.userData.groups;
   }
 }
-function Pe(u, t = 0.1, e) {
-  e || (e = new Y(), u.forEach((i) => {
+function je(u, t = 0.1, e) {
+  e || (e = new q(), u.forEach((i) => {
     i.userData.isDoor || i.points.forEach((r) => e?.insert(r, i));
   }));
   const n = [], s = /* @__PURE__ */ new Set();
@@ -2120,38 +2485,38 @@ function Pe(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 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);
+      const c = e.queryCircle(a, t).filter((g) => {
+        if (s.has(g.point)) return !1;
+        const y = g.userData;
+        if (y === r || !r.parallel(y, 25) || e.queryPoint(g.point).length > 1) return !1;
+        const x = a.distance(g.point);
         if (x < 1e-3) return !1;
-        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);
+        const m = a.direction(r.getAnotherPoint(a)), w = g.point.direction(y.getAnotherPoint(g.point));
+        if (180 - m.angleBetween(w, "angle") < 25)
+          return o.set(g.point, x), !0;
+      }).sort((g, y) => {
+        const x = o.get(g.point), m = o.get(y.point);
         return x - m;
       });
       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));
+      const l = c[0].userData, h = r.projectLineSegment(l), f = l.projectLineSegment(r), d = h.length(), p = f.length();
+      d === 0 && p === 0 ? n.push(new L(a.clone(), c[0].point.clone())) : n.push(new L(h.center, f.center));
     });
   }
   return [...u, ...n];
 }
-function Ie(u) {
-  const t = new Y(), e = new B(I.fromByLineSegment(...u)), n = [];
+function Oe(u) {
+  const t = new q(), e = new j(R.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 = Pe(u, 0.4, t), t.clear(), e.clear(), u;
+  }), u = je(u, 0.4, t), t.clear(), e.clear(), u;
 }
-function ve(u) {
-  const t = new B(I.fromByLineSegment(...u));
+function Fe(u) {
+  const t = new j(R.fromByLineSegment(...u));
   u.forEach((n) => {
     n.userData.isDoor || t.insert({ line: n, userData: void 0 });
   });
@@ -2170,59 +2535,59 @@ function ve(u) {
   }
   return t.clear(), e;
 }
-function Re(u, t, e, n = 15) {
+function Ge(u, t, e, n = 15) {
   const s = [u], i = [], r = [], o = [];
-  function a(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);
-    let y = Math.atan2(u.end.y - u.start.y, u.end.x - u.start.x) - f;
-    for (; y > Math.PI; ) y -= 2 * Math.PI;
-    for (; y < -Math.PI; ) y += 2 * Math.PI;
-    const 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 a(f) {
+    if (f.userData.isDoor) return r.push(f);
+    const d = Math.atan2(f.end.y - f.start.y, f.end.x - f.start.x);
+    let g = Math.atan2(u.end.y - u.start.y, u.end.x - u.start.x) - d;
+    for (; g > Math.PI; ) g -= 2 * Math.PI;
+    for (; g < -Math.PI; ) g += 2 * Math.PI;
+    const y = f.center;
+    return f.start.rotate(y, g), f.end.rotate(y, g), f.userData.isDoor ? r.push(f) : s.push(f), f;
   }
-  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;
-    for (; y > Math.PI; ) y -= 2 * Math.PI;
-    for (; y < -Math.PI; ) y += 2 * Math.PI;
+  function c(f) {
+    if (f.userData.isDoor) return r.push(f);
+    const d = Math.atan2(f.end.y - f.start.y, f.end.x - f.start.x), p = Math.atan2(u.end.y - u.start.y, u.end.x - u.start.x);
+    let g = p + Math.PI / 2 - d, y = p - Math.PI / 2 - d;
     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;
+    for (; y > Math.PI; ) y -= 2 * Math.PI;
+    for (; y < -Math.PI; ) y += 2 * Math.PI;
+    const x = Math.abs(g) < Math.abs(y) ? g : y, m = f.center;
+    return f.start.rotate(m, x), f.end.rotate(m, x), f.userData.isDoor ? r.push(f) : i.push(f), f;
   }
-  function l(d, f, p = !1) {
-    if (p) return l(d === "parallel" ? "vertical" : "parallel", f);
-    d === "parallel" ? a(f) : c(f);
+  function l(f, d, p = !1) {
+    if (p) return l(f === "parallel" ? "vertical" : "parallel", d);
+    f === "parallel" ? a(d) : c(d);
   }
   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)) c(f);
+  for (let f = 0; f < t.length; f++) {
+    const d = t[f];
+    if (u !== d)
+      if (d.userData.isWindow && o.push(d), d.parallel(u, n)) a(d);
+      else if (d.vertical(u, n)) c(d);
       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 ? h.push(() => {
-          const g = [...y.values()].map(
-            (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];
+        const g = e.get(d)?.reduce((y, x) => (x.sourcePoint && (y.has(x.sourcePoint) || y.set(x.sourcePoint, []), y.get(x.sourcePoint)?.push(x)), y), /* @__PURE__ */ new Map());
+        g && g.size > 1 ? h.push(() => {
+          const y = [...g.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 = y[0], m = y[1];
           if (x.length === 1 && m.length === 1) {
-            if (x[0] === m[0]) return l(x[0], f, !0);
+            if (x[0] === m[0]) return l(x[0], d, !0);
             if (x.length === 1) {
-              if (m.includes(x[0])) return l(x[0], f, !0);
+              if (m.includes(x[0])) return l(x[0], d, !0);
               if (m.length === 1 && x.includes(m[0]))
-                return l(m[0], f, !0);
+                return l(m[0], d, !0);
             }
           }
-          c(f);
-        }) : c(f);
+          c(d);
+        }) : c(d);
       }
   }
-  return h.forEach((d) => d()), { parallelLines: s, verticalLines: i, doorLines: r, windowLines: o };
+  return h.forEach((f) => f()), { parallelLines: s, verticalLines: i, doorLines: r, windowLines: o };
 }
-function mt(u, t, e, n, s) {
+function St(u, t, e, n, s) {
   const i = [], r = /* @__PURE__ */ new Map();
   u.forEach((c) => {
     const l = e.projectPoint(c.start, !1);
@@ -2239,91 +2604,72 @@ function mt(u, t, e, n, s) {
   }
   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;
+      const g = p.userData;
+      return g.points.map((y) => {
+        const x = t.projectPoint(y, !1);
+        return x.userData = g, x;
       });
     });
-    l.sort((p, y) => p.distance(t.start) - y.distance(t.start));
-    const h = /* @__PURE__ */ new Map(), d = [];
-    let f = [];
-    return l.forEach((p, y) => {
-      h.size === 0 && y > 0 && l[y - 1].distance(p) > n && (f.push([...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;
+    l.sort((p, g) => p.distance(t.start) - g.distance(t.start));
+    const h = /* @__PURE__ */ new Map(), f = [];
+    let d = [];
+    return l.forEach((p, g) => {
+      h.size === 0 && g > 0 && l[g - 1].distance(p) > n && (d.push([...f]), f.length = 0), h.set(p.userData, (h.get(p.userData) ?? 0) + 1);
+      for (const y of h.values()) if (y !== 2) return;
+      f.push(...h.keys()), h.clear();
+    }), d.push([...f]), d;
   });
 }
-function wt(u, t, e, n) {
-  const s = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), o = [];
-  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));
+function Et(u, t, e, n) {
+  const s = /* @__PURE__ */ new Map(), i = [], r = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map();
+  u.forEach((d) => {
+    const p = e.projectValue(d.start), g = e.projectPoint(d.start, !1), y = { value: p, line: d, point: g, index: -1 };
+    s.set(d, y), i.push(y), d.points.forEach((x, m) => {
+      const w = t.projectValue(x);
+      m === 0 ? r.set(d, w) : o.set(d, w);
     });
-  }), 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 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 L;
-  });
-  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 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);
-          }
-          h.push(R, v);
-        } else {
-          const R = Math.floor(g.length * 0.5);
-          h.push(g.slice(0, R), g.slice(R));
+  }), i.sort((d, p) => p.value - d.value).forEach((d, p) => d.index = p);
+  const a = new ct(u.length), c = new Yt(u);
+  function l(d, p) {
+    return d.point.distance(p.point) <= n;
+  }
+  function h(d, p, g) {
+    const y = r.get(d.line), x = o.get(d.line), m = y < x ? y : x, w = y > x ? y : x;
+    return m >= p && m <= g || w >= p && w <= g || p >= m && p <= w || g >= m && g <= w;
+  }
+  for (let d = 0; d < i.length; d++) {
+    const p = i[d], { line: g } = p, y = r.get(g), x = o.get(g), m = y < x ? y : x, w = y > x ? y : x;
+    for (let M = d - 1; M >= 0; M--) {
+      const E = i[M];
+      if (l(E, p)) {
+        if (h(E, m, w)) {
+          a.union(c.getIndex(g), c.getIndex(E.line));
+          break;
         }
-        continue;
-      }
+      } else break;
     }
-    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;
+  let f = a.getAllSets().valueArray.map((d) => d.map((p) => c.getLine(p)));
+  return f = f.map((d) => {
+    if (d.length <= 2) return [d];
+    const p = d.map((P) => s.get(P)).sort((P, I) => P.value - I.value), g = p[0], y = p[p.length - 1];
+    if (g.point.distance(y.point) < n) return [d];
+    const x = [...p].sort((P, I) => I.line.length() - P.line.length()), m = x[0], w = x[0], M = m.line.length(), E = w.line.length(), A = m.line.projectLineSegment(w.line), S = A.length();
+    if (m.point.distance(w.point) > n || E / M > 0.5 && S / E < 0.5) {
+      const P = [m.line], I = [w.line];
+      for (let C = 0; C < p.length; C++) {
+        const N = p[C];
+        if (N === m || N === w) continue;
+        const _ = w.line.projectLineSegment(N.line), G = _.length();
+        w.point.distance(N.point) <= n && G / E > 0 ? I.push(N.line) : P.push(N.line);
+      }
+      return [P, I];
+    }
+    const T = Math.floor(p.length * 0.5);
+    return [p.slice(0, T).map((P) => P.line), p.slice(T).map((P) => P.line)];
+  }).flat(1), f;
 }
-function Mt(u, t) {
+function At(u, t) {
   function e(i, r = /* @__PURE__ */ new Set()) {
     if (r.has(i)) return r;
     r.add(i);
@@ -2344,28 +2690,28 @@ function Mt(u, t) {
   }
   return s;
 }
-function Ce(u, t, e, n, s, i) {
+function Ue(u, t, e, n, s, i) {
   const {
     principalAxisThreshold: r = 0.3,
-    crossAxistThreshold: o = 0.06,
+    crossAxistThreshold: o = 0.08,
     groupMethod: a = "principalAndCross"
   } = i ?? {}, c = {
     cross: () => [
-      ...wt(u, n, e, o),
-      ...wt(t, e, n, o)
+      ...Et(u, n, e, o),
+      ...Et(t, e, n, o)
     ],
     principalAndCross: () => [
-      ...mt(u, n, e, r, o),
-      ...mt(t, e, n, r, o)
+      ...St(u, n, e, r, o),
+      ...St(t, e, n, r, o)
     ],
     originalInterPoint: () => [
-      ...Mt(u, s),
-      ...Mt(t, s)
+      ...At(u, s),
+      ...At(t, s)
     ]
   };
   return c[a] ? c[a]() : c.originalInterPoint();
 }
-function Ne(u, t) {
+function qe(u, t) {
   const e = /* @__PURE__ */ new Set();
   return u.forEach((n) => {
     const s = /* @__PURE__ */ new Map();
@@ -2381,141 +2727,143 @@ function Ne(u, t) {
       }
   }), u.map((n) => n.filter((s) => !e.has(s)));
 }
-function Be(u, t = 0.1, e) {
+function ze(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((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((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 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);
+    s.forEach((d) => i.push(d.start.clone(), d.end.clone()));
+    const r = n === "average" ? L.mergeLines(...s) : L.mergeLinesByMaxlength(...s);
+    let o = [], a = [];
+    s.forEach((d) => {
+      const { drawDoorData: p, drawWindow: g, rooftopPz: y, isWindow: x, ...m } = d.userData;
+      Object.assign(r.userData, m), o.push(y ?? 1 / 0), x && (a.push(...g), r.userData.isWindow = !0);
+    }), a.length && (r.userData.drawWindow = a, _t(r)), r.userData.rooftopPz = Math.min(...o), r.userData.rooftopPz === 1 / 0 && (r.userData.rooftopPz = 0);
+    let c = 1 / 0, l = -1 / 0;
+    const h = s[0].normal().normalize();
+    c = 1 / 0, l = -1 / 0, i.forEach((d) => {
+      const p = d.x * h.x + d.y * h.y;
+      c = Math.min(c, p), l = Math.max(l, p);
     });
-    const l = a - o;
-    return l >= t && (r.userData.wallWidth = l), s.forEach((h) => h.userData.fittedLine = r), r;
+    const f = l - c;
+    return f >= t && (r.userData.wallWidth = f), s.forEach((d) => d.userData.fittedLine = r), r.currentData.isFittedLine = !0, r;
   }).filter((s) => !!s);
 }
-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 _e(u, t, e) {
+  const { snapThreshold: n = 0.2 } = e ?? {}, s = new q(), i = new j(R.fromByLineSegment(...u)), r = new L(), o = /* @__PURE__ */ new Map();
+  u.forEach((f) => {
+    f.userData.isDoor || (i.insert(f), f.points.forEach((d) => s.insert(d, f)));
   });
-  function a(d, f) {
-    o.has(d) || o.set(d, []), o.get(d)?.push(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) => {
+  function a(f, d) {
+    o.has(f) || o.set(f, []), o.get(f)?.push(d);
+  }
+  function c(f, d) {
+    if (i.queryPoint(f).length > 1) return;
+    const p = d.direction().multiplyScalar(n);
+    r.set(f, f), r.start.add(p), r.end.add(p.multiplyScalar(-1));
+    const g = /* @__PURE__ */ new Map(), y = i.queryLineSegment(r).filter((x) => x.line !== d).map((x) => {
       const m = x.line.getIntersection(r);
-      return y.set(x.line, m), x.line;
+      return g.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;
+      const w = g.get(x), M = g.get(m);
+      return w && M ? w.distance(f) - M.distance(f) : 0;
     });
-    if (g.length) return y.get(g[0]);
+    if (y.length) return g.get(y[0]);
   }
-  function l(d, f) {
-    let p = c(d, f);
+  function l(f, d) {
+    let p = c(f, d);
     if (p)
-      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);
+      return a(d, new L(f.clone(), p.clone()));
+    if (s.queryPoint(f).filter((w) => w.userData !== d).length !== 0 || i.queryCircle(f, 1e-3).filter((w) => w.line !== d).length > 0) return;
+    const y = s.queryCircle(f, n).filter((w) => w.userData !== d && w.userData?.vertical(d)).sort((w, M) => w.point.distance(f) - M.point.distance(f));
+    if (!y.length) return;
+    const x = y[0], m = x.userData?.projectPoint(f, !1);
     if (m) {
-      const L = x.userData;
-      a(f, new D(d.clone(), m.clone())), a(L, new D(x.point.clone(), m.clone()));
+      const w = x.userData;
+      a(d, new L(f.clone(), m.clone())), a(w, new L(x.point.clone(), m.clone()));
     }
   }
-  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)) {
-          const x = g.projectPoint(f, !0);
-          return x && f.distance(x) / d.length() > 0.9 ? void 0 : x;
-        }
-      }).filter((g) => !!g).sort((g, x) => g.distance(f) - x.distance(f));
-      if (y.length) return y[0];
-    }
+  function h(f, d, p) {
+    return null;
   }
-  for (let d = 0; d < u.length; d++) {
-    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) => {
+  for (let f = 0; f < u.length; f++) {
+    const d = u[f], g = (t.get(d) ?? []).reduce((m, w) => (w.sourcePoint === d.start ? m[0].push(w) : m[1].push(w), m), [[], []]), [y, x] = d.points.map((m, w) => {
       if (!s.queryPoint(m, !0).length) {
-        const M = h(f, m, y[L]);
+        const M = h(d, m, g[w]);
         if (M)
-          m.copy(M), s.update(m), i.update(f);
+          m.copy(M), s.update(m), i.update(d);
         else return !1;
       }
       return !0;
     });
-    g || l(f.start, f), x || l(f.end, f);
+    y || l(d.start, d), x || l(d.end, d);
   }
-  return o.forEach((d, f) => {
-    const p = D.mergeLines(f, ...d);
-    f.set(p.start, p.end);
+  return o.forEach((f, d) => {
+    const p = L.mergeLines(d, ...f);
+    d.set(p.start, p.end);
   }), s.clear(), i.clear(), 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 ?? [])) : X(n);
-  }
-  t.forEach((e) => X(e));
+function ke(u) {
+  const t = u.filter((n) => n.userData.isBayWindow), e = /* @__PURE__ */ new Set();
+  return t.forEach((n) => {
+    const s = Wt(u, [n], !1).filter((i) => i.some((r) => r.userData.isWindow && O.hasType(r, "bayWindow")));
+    if (s.length) {
+      const i = s[0], r = $();
+      i.forEach((o) => {
+        O.clear(o), O.set(o, r, "bayWindow"), e.add(o);
+      });
+    } else O.clear(n);
+  }), u.forEach((n) => e.has(n) || O.clear(n)), u;
 }
-function Fe(u) {
+function Ye(u) {
   for (let t = 0; t < u.length; t++) {
-    const e = u[t];
-    let { endIntersection: n, startIntersection: s } = e.userData;
-    if (!(!n || !s)) {
-      if (s.userData.fittedLine && (s = s.userData.fittedLine), n.userData.fittedLine && (n = n.userData.fittedLine), e.parallel(s))
-        e.start.distance(s.start) < e.start.distance(s.end) ? e.start.copy(s.start) : e.start.copy(s.end);
+    const e = $(), n = u[t];
+    let { endIntersection: s, startIntersection: i } = n.userData;
+    if (O.replace(n, e, "door") || O.set(n, e, "door"), !(!s || !i)) {
+      if (i.userData.fittedLine && (i = i.userData.fittedLine), s.userData.fittedLine && (s = s.userData.fittedLine), n.parallel(i))
+        n.start.distance(i.start) < n.start.distance(i.end) ? n.start.copy(i.start) : n.start.copy(i.end);
       else {
-        const i = s.projectPoint(e.start);
-        i && e.start.copy(i);
+        const r = i.projectPoint(n.start);
+        r && n.start.copy(r);
       }
-      if (e.parallel(n))
-        e.end.distance(n.start) < e.end.distance(n.end) ? e.end.copy(n.start) : e.end.copy(n.end);
+      if (n.parallel(s))
+        n.end.distance(s.start) < n.end.distance(s.end) ? n.end.copy(s.start) : n.end.copy(s.end);
       else {
-        const i = n.projectPoint(e.end);
-        i && e.end.copy(i);
+        const r = s.projectPoint(n.end);
+        r && n.end.copy(r);
       }
     }
   }
   return u;
 }
-function Dt(u, t = 0.01) {
-  const e = new Y();
+function Tt(u, t = 0.01) {
+  const e = new q();
   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 = D.brokenLineMerging(u, (n, s) => {
-    s.forEach((i) => $(n, i)), X(n);
+  }), u = L.brokenLineMerging(u, (n, s) => {
+    s.forEach((i) => U(n, i)), K(n);
   }), e.clear(), 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;
+function bt(u) {
+  const t = [];
+  u = u.filter((i) => i.userData.isBayWindow || i.userData.isWindow ? (t.push(i), !1) : !0);
+  const { newLines: e, rings: n } = Xt(u), s = new Set(n.flat());
+  return n.forEach((i) => {
+    const r = $();
+    i.forEach((o) => {
+      O.replace(o, r, "doubleWall") || O.set(o, r, "doubleWall");
+    });
+  }), e.forEach((i) => {
+    s.has(i) || O.hasType(i, "bayWindow") || Object.assign(i.userData, O.set(i, "default", "wall"));
+  }), e.push(...t), e;
 }
-class Gt {
+class Ht {
+  // private 
   /**
    * 轴对齐垂直修正
    * @param lines 待调整线段组
@@ -2524,43 +2872,43 @@ class Gt {
    */
   static correction(t, e, n) {
     const s = t.indexOf(e);
-    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))
+    t = t.map((x) => x.clone()), e = s > -1 ? t[s] : e, t = Oe(t);
+    const i = Fe(t), { parallelLines: r, verticalLines: o, doorLines: a } = Ge(e, t, i, 25), c = e.normal(), l = e.center, h = e.direction(), f = new L(
+      l.clone().add(c.clone().multiplyScalar(-1e3)),
+      l.clone().add(c.clone().multiplyScalar(1e3))
+    ), d = new L(
+      l.clone().add(h.clone().multiplyScalar(-1e3)),
+      l.clone().add(h.clone().multiplyScalar(1e3))
     );
-    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;
+    let p = Ue(r, o, f, d, i, n);
+    p = qe(p, i);
+    let g = ze(p, 0.1, n);
+    g = L.brokenLineMerging(g, U), g = _e(g, i, n), g = ot(g, 1e-9), g = Tt(g, 0.15);
+    const { wallGroup: y = !0 } = n ?? {};
+    return g = ke(g), y && (g = bt(g), g = kt.complementSide(g), g = L.brokenLineMerging(g, U), K(...g), g = ot(g, 1e-9), g = bt(g)), g = Tt(g, 0.15), g = L.brokenLineMerging(g, U), K(...g), Ye(a), g.push(...a), g;
   }
 }
-const Ge = new D(
-  new w(0, 0),
-  new w(0, 1)
+const We = new L(
+  new D(0, 0),
+  new D(0, 1)
 );
-function Ue(u) {
+function $t(u) {
   const t = [...u].sort((i, r) => r.length() - i.length()).slice(0, 20), e = t.map((i) => {
-    let r = parseInt(Ge.includedAngle(i) + "");
+    let r = parseInt(We.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 ze(u) {
+function Jt(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 c = new D(
-      w.from(i),
-      w.from(r)
+    const c = new L(
+      D.from(i),
+      D.from(r)
     );
     c.userData = o, t.push(c), o.isVerticalReferenceLine && (e = a);
   }), {
@@ -2569,7 +2917,17 @@ function ze(u) {
     verticalReferenceIndex: e
   };
 }
-const _e = {
+function Kt(u) {
+  if (u.length < 3) return 0;
+  let t = 0;
+  const e = u.length;
+  for (let n = 0; n < e; n++) {
+    const s = (n + 1) % e;
+    t += u[n].x * u[s].y, t -= u[s].x * u[n].y;
+  }
+  return Math.abs(t) / 2;
+}
+const Ve = {
   Unitless: 1,
   // 无单位，1米 = 1（无单位）
   Inches: 39.37007874015748,
@@ -2613,27 +2971,27 @@ const _e = {
   Parsecs: 3240779289666404e-32
   // 秒差距，1米 ≈ 0.00000000000000003240779289666404秒差距
 };
-function Lt(u) {
+function Pt(u) {
   const t = [];
   for (let e = 0; e < u.length; e++)
-    t.push(new D(
+    t.push(new L(
       u[e].clone(),
       u[(e + 1) % u.length].clone()
     ));
   return t;
 }
-function St(u) {
+function It(u) {
   return u.flatMap((t, e) => (e === u.length - 1 && [...t.points, u[0].points[0]], [t.points[0]]));
 }
-class k extends G {
+class W extends z {
   static name = "Dxf";
   shortLine = 0.04;
   width = 0.04;
   scale = 1;
   originalData = [];
   data = [];
-  originalBox = new I(0, 0, 0, 0);
-  box = new I(0, 0, 0, 0);
+  originalBox = new R(0, 0, 0, 0);
+  box = new R(0, 0, 0, 0);
   pointsGroups = [];
   wallsGroup = [];
   doors = [];
@@ -2670,9 +3028,9 @@ class k extends G {
    * @param data 
    */
   preprocessing(t) {
-    let { lineSegments: e, verticalReferenceIndex: n, originalZAverage: s } = ze(t);
+    let { lineSegments: e, verticalReferenceIndex: n, originalZAverage: s } = Jt(t);
     if (this.originalZAverage = s, n === -1) {
-      const r = Ue(e);
+      const r = $t(e);
       n = e.indexOf(r);
     }
     const i = e[n];
@@ -2681,7 +3039,7 @@ class k extends G {
       data: t,
       setData(r) {
         e = r.map(({ start: o, end: a, ...c }) => {
-          const l = new D(w.from(o), w.from(a));
+          const l = new L(D.from(o), D.from(a));
           return l.userData = c, l;
         }), t = r;
       }
@@ -2738,15 +3096,17 @@ class k extends G {
   createGroups() {
     const t = [], e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Map(), i = (r, o, a = -1) => {
       if (!this.data[r]) return;
-      const [c, l, h, d] = this.data[r];
-      if (e.add(r), d)
-        return s.has(r) || s.set(r, []), s.get(r)?.push(a), n.add(this.data[r]);
-      o.push([c, l]), h.forEach((f) => {
-        e.has(f) || i(f, o, r);
-      });
+      const [c, l, h, f] = this.data[r];
+      if (!this.lineSegments[r]?.userData.isBayWindow) {
+        if (e.add(r), f)
+          return s.has(r) || s.set(r, []), s.get(r)?.push(a), n.add(this.data[r]);
+        o.push([c, l]), h.forEach((d) => {
+          e.has(d) || i(d, o, r);
+        });
+      }
     };
     return this.data.forEach((r, o) => {
-      if (!e.has(o)) {
+      if (!this.lineSegments[o]?.userData.isBayWindow && !e.has(o)) {
         const a = [];
         i(o, a), t.push(a);
       }
@@ -2834,7 +3194,7 @@ class k extends G {
         break;
       }
     }
-    const e = this.mergeSameDirectionLine(Lt(t)), n = [e[0]];
+    const e = this.mergeSameDirectionLine(Pt(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) {
@@ -2849,7 +3209,7 @@ class k extends G {
       const a = e[s + 2];
       a && r.includedAngle(a) < 2 ? (s = s + 2, n.push(a)) : n.push(i);
     }
-    return n.length > 3 ? St(this.mergeSameDirectionLine(n)) : [];
+    return n.length > 3 ? It(this.mergeSameDirectionLine(n)) : [];
   }
   /**
    * 移除短线段
@@ -2857,7 +3217,7 @@ class k extends G {
    * @param path 
    */
   removeShortLine(t, e = this.shortLine) {
-    const n = Lt(t), s = [], i = Math.PI / 180;
+    const n = Pt(t), s = [], i = Math.PI / 180;
     for (let r = 0; r < n.length; r++) {
       const o = n[r], a = o.length(), c = r;
       if (a > e || s.length === 0) {
@@ -2865,41 +3225,41 @@ class k extends G {
         continue;
       }
       let l = n[++r];
-      const h = s[s.length - 1], d = h.direction();
+      const h = s[s.length - 1], f = h.direction();
       for (; r < n.length; ) {
-        const p = d.angleBetween(l.direction()) / i;
+        const p = f.angleBetween(l.direction()) / i;
         if (l.length() <= e || p < 4 || p > 176)
           l = n[++r];
         else break;
       }
       if (!l) continue;
-      const f = n[r - 1];
-      if (h.length() > f.length()) {
+      const d = n[r - 1];
+      if (h.length() > d.length()) {
         const p = h.getIntersection(l);
         if (p) {
-          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));
+          const g = h.points[1].clone(), y = l.points[0].clone();
+          h.points[1].copy(p), l.points[0].copy(p), h.length() < this.width ? (h.points[1].copy(g), l.points[0].copy(g)) : l.length() < this.width && (h.points[1].copy(y), l.points[0].copy(y));
         } else
           h.points[1].copy(l.points[0]);
         s.push(l);
       } else
         r = c;
     }
-    return s.length > 3 ? St(s) : [];
+    return s.length > 3 ? It(s) : [];
   }
   /** 线偏移
    * @description 使用 ClipperLib 对每个点组进行线偏移处理，生成具有指定宽度的墙体路径
    */
-  lineOffset(t = k.EndType.etOpenSquare, e = k.JoinType.jtMiter, n = 1e4) {
-    let s = new xt.Paths();
-    const i = new xt.ClipperOffset(20, 0.25);
+  lineOffset(t = W.EndType.etOpenSquare, e = W.JoinType.jtMiter, n = 1e4) {
+    let s = new Lt.Paths();
+    const i = new Lt.ClipperOffset(20, 0.25);
     return this.pointsGroups.forEach((r) => {
       const o = this.lineTopology(r).map((a) => a.map((c) => c.clone().mutiplyScalar(n)));
       i.AddPaths(o, e, t);
     }), i.Execute(s, this.width / 2 * n), this.wallsGroup = s.map((r) => {
-      let o = r.map((a) => w.from(a).divisionScalar(n));
-      return o = this.lineSegmentStraightening(o), t == k.EndType.etOpenSquare && (o = this.squareRemoveBurr(o)), o;
-    }).filter((r) => r.length > 4 || Ot(r) > 0.2), this.dispatchEvent({
+      let o = r.map((a) => D.from(a).divisionScalar(n));
+      return o = this.lineSegmentStraightening(o), t == W.EndType.etOpenSquare && (o = this.squareRemoveBurr(o)), o;
+    }).filter((r) => r.length > 4 || Kt(r) > 0.2), this.dispatchEvent({
       type: "lineOffset",
       wallsGroup: this.wallsGroup
     }), this.wallsGroup;
@@ -2909,10 +3269,9 @@ class k extends G {
    */
   axisAlignCorr(t) {
     if (this.verticalReferenceLine) {
-      this.doorLineSegment;
-      const e = this.getLineSegments(), n = performance.now(), s = Gt.correction(e, this.verticalReferenceLine, t);
+      const e = this.getLineSegments(), n = performance.now(), s = Ht.correction(e, this.verticalReferenceLine, t);
       console.log("垂直纠正消耗时间：", (performance.now() - n).toFixed(2), "ms", "处理线段数量：", e.length);
-      const i = et(s);
+      const i = tt(s);
       this.set(i);
     } else
       throw new Error("未找到一条垂直纠正基准轴线");
@@ -2956,13 +3315,13 @@ class k extends G {
    * 线段数据转为原始json数据
    */
   lineDataToOriginalData(t, e) {
-    return et(t, this.originalZAverage, e);
+    return tt(t, this.originalZAverage, e);
   }
   /**
    * 转为绘制数据
    */
   toDrawDataJson(t = "Millimeters") {
-    const e = _e[t], n = {
+    const e = Ve[t], n = {
       unit: t,
       line: [],
       arc: [],
@@ -2976,13 +3335,13 @@ class k extends G {
     function i(c, l) {
       n.line.push([c.x * e, c.y * e, l.x * e, l.y * e, s]);
     }
-    function r(c, l, h, d) {
+    function r(c, l, h, f) {
       n.arc.push([
         c.x * e,
         c.y * e,
         l * e,
         h,
-        d,
+        f,
         s
       ]);
     }
@@ -2995,8 +3354,8 @@ class k extends G {
     }
     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 h = c[l], f = l === c.length - 1 ? 0 : l + 1, d = c[f];
+        i(h, d);
       }
     });
     const o = this.width * 0.2, a = [];
@@ -3006,29 +3365,29 @@ class k extends G {
       if (s = "cyan", l.length() < 1.2) {
         l.expansion(-o * 0.5);
         const h = c.normal();
-        let d = new D(
+        let f = new L(
           l.start.clone(),
           l.start.clone().add(h.clone().multiplyScalar(l.length()))
         );
-        const f = d.clone().directionMove(d.normal(), l.length() * -0.5).expandToRectangle(l.length(), "bothSides");
+        const d = f.clone().directionMove(f.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(
+          if (a[M].intersectRectangle(d)) {
+            f = new L(
               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 = 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);
+        f.expansion(-o * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((M, E) => i(M, E));
+        const p = l.length(), g = f.length(), y = (p ** 2 + g ** 2) / (2 * g), x = f.end.clone().add(f.direction().multiplyScalar(-y)), [m, w] = this.getArcAngleRange(x, l.end, f.end);
+        r(x, y, Math.min(m, w), Math.max(m, w)), a.push(d);
       } else
-        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));
+        l.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((h, f) => i(h, f)), 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, f) => i(h, f)), 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, f) => i(h, f));
     }), 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));
+        const { p: h, width: f } = l, d = D.from(h), p = d.clone().add(c.direction().multiplyScalar(f * 0.5)), g = d.clone().add(c.direction().multiplyScalar(-f * 0.5)), y = new L(p, g);
+        i(y.start, y.end), y.expandToRectangle(this.width, "bothSides").path2D((x, m) => i(x, m));
       });
     }), n;
   }
@@ -3053,14 +3412,14 @@ class k extends G {
     };
     i.width = s.width + r * 2, i.height = s.height + r * 2;
     const a = i.getContext("2d");
-    return n && (a.fillStyle = n, a.fillRect(0, 0, i.width, i.height)), a.translate(s.width * 0.5 + r, s.height * 0.5 + r), a.scale(1, -1), s.line.forEach(([c, l, h, 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();
+    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, f, d]) => {
+      a.strokeStyle = o[d], a.beginPath(), a.moveTo(c, l), a.lineTo(h, f), a.closePath(), a.stroke();
+    }), s.arc.forEach(([c, l, h, f, d, p]) => {
+      a.strokeStyle = o[p], a.beginPath(), a.arc(c, l, h, f * (Math.PI / 180), d * (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);
+      let [l, h, f, d] = c;
+      const p = Math.min(h, d), g = Math.max(h, d), y = (i.width * 0.5 - 0.4 * s.scale) * (l < 0 ? -1 : 1), x = (g - p) * 0.45;
+      a.fillStyle = "#fff", a.font = `${0.15 * s.scale}px Arial`, a.textAlign = "center", a.textBaseline = "middle", a.save(), a.translate(y, p + (g - p) * 0.5), a.scale(1, -1), a.fillText((g - p).toFixed(2) + "cm", 0, 0), a.restore(), a.moveTo(y - 0.1 * s.scale, p), a.lineTo(y + 0.1 * s.scale, p), a.moveTo(y, p), a.lineTo(y, x + p), a.moveTo(y, g), a.lineTo(y, g - x), a.moveTo(y - 0.1 * s.scale, g), a.lineTo(y + 0.1 * s.scale, g);
     }), a.closePath(), a.strokeStyle = "#fff", a.stroke(), "toBlob" in i ? new Promise((c) => {
       i.toBlob((l) => {
         c(l);
@@ -3094,7 +3453,7 @@ class k extends G {
   * @param filename 
   */
   async downloadOriginalData(t) {
-    const e = et(this.getLineSegments()), n = JSON.stringify(e);
+    const e = tt(this.getLineSegments()), n = JSON.stringify(e);
     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();
@@ -3128,7 +3487,7 @@ class k extends G {
    * @description 计算所有线段的起点和终点的最小最大值，形成一个边界框
    * @returns 
    */
-  computedOriginalSize(t, e = new I(0, 0, 0, 0)) {
+  computedOriginalSize(t, e = new R(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;
   }
@@ -3156,8 +3515,8 @@ class k extends G {
     });
   }
 }
-const z = new D();
-class ke extends k {
+const k = new L();
+class Xe extends W {
   static name = "AngleCorrectionDxf";
   angle = 0;
   onAddFromParent(t) {
@@ -3168,24 +3527,24 @@ class ke extends k {
     let s = 0, 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;
+      if (k.start.copy(h.start), k.end.copy(h.end), h.isVerticalReferenceLine) {
+        const [f, d] = h.start.y < h.end.y ? [k.start, k.end] : [k.end, k.start];
+        s = -new L(f, d).direction().angleBetween(new D(0, 1), "angle", "360"), i = null;
         break;
       }
-      (!i || z.length() > i.length()) && (i = z.clone(), i.userData.index = l);
+      (!i || k.length() > i.length()) && (i = k.clone(), i.userData.index = l);
     }
     if (i) {
       e.originalData[i.userData.index].isVerticalReferenceLine = !0;
       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");
+      s = -new L(l, h).direction().angleBetween(new D(0, 1), "angle", "360");
     }
     function r(l, h) {
-      return l.division(o).rotate(w.zero(), h * (Math.PI / 180));
+      return l.division(o).rotate(D.zero(), h * (Math.PI / 180));
     }
-    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;
+    const o = e.originalBox.center, a = D.zero(), c = e.originalData.map((l) => {
+      const h = r(a.copy(l.start), s).toJson(l.start.z), f = r(a.copy(l.end), s).toJson(l.start.z), d = Object.assign(V(l), { start: h, end: f });
+      return d.drawWindow && d.drawWindow.forEach((p) => p.p = r(a.copy(p.p), s).toJson(p.p.z)), d;
     });
     n.appendLineSegmentList.forEach((l) => {
       const h = l.clone();
@@ -3197,13 +3556,13 @@ class ke extends k {
       });
     }), 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;
+      return h.start.division(o).rotate(D.zero(), s * (Math.PI / 180)), h.end.division(o).rotate(D.zero(), s * (Math.PI / 180)), h;
     }), this.angle = s, this.dispatchEvent({
       type: "updateData"
     });
   }
 }
-class Ut extends G {
+class Zt extends z {
   static name = "Variable";
   originalLineVisible = !0;
   dxfVisible = !0;
@@ -3230,12 +3589,12 @@ class Ut extends G {
     if (t in this) return this[t];
   }
 }
-class zt extends G {
+class Qt extends z {
   static name = "LineAnalysis";
   Dxf = null;
   Variable = null;
   lineSegmentList = [];
-  container = new P.Group();
+  container = new v.Group();
   // 误差角度
   errorAngle = 4;
   width = 0.4;
@@ -3244,7 +3603,7 @@ class zt extends G {
    * @param parent 
    */
   onAddFromParent(t) {
-    this.Dxf = t.findComponentByType(k), this.Variable = this.parent?.findComponentByType(Ut), this.Dxf.addEventListener("setDta", () => {
+    this.Dxf = t.findComponentByType(W), this.Variable = this.parent?.findComponentByType(Zt), this.Dxf.addEventListener("setDta", () => {
       this.lineAnalysis(), this.dispatchEvent({ type: "analysisCompleted" });
     });
   }
@@ -3260,11 +3619,11 @@ class zt extends G {
     return {
       points: [
         // 第一条线
-        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)
+        new D(t.x - o, t.y - a).add(r),
+        new D(e.x - o, e.y - a).add(i)
       ],
       indices: [0, 1, 1, 3, 3, 2, 2, 0],
       rectIndices: [0, 1, 3, 2, 0]
@@ -3278,7 +3637,7 @@ class zt extends G {
    */
   addData(t, e) {
     const n = this.Dxf;
-    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new D(t.clone(), e.clone()));
+    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new L(t.clone(), e.clone()));
   }
   /** 结果分析创建矩形
    * @param result 
@@ -3286,14 +3645,14 @@ class zt extends G {
   createRectangle(t) {
     const e = this.Dxf, n = t.project, s = t.project2;
     n.includedAngle(s) > 135 && (s.points = [s.points[1], s.points[0]]), this.addData(n.points[0], s.points[0]), this.addData(n.points[1], s.points[1]);
-    const i = n.points[0].distance(s.points[0]), r = n.points[1].distance(s.points[1]), o = Math.ceil(Math.max(i, r) / e.width), a = i / o, c = r / o, l = s.points[0].direction(n.points[0]), h = s.points[1].direction(n.points[1]), 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]), f = n.points[0].clone(), d = n.points[1].clone(), p = d.direction(f);
     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);
+    const g = f.clone().add(p), y = d.clone().add(p.multiplyScalar(-1)), x = f.direction(d), m = g.direction(y);
     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 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);
+      f.set(g.x, g.y), d.set(y.x, y.y);
+      for (let w = 1; w < o; w++) {
+        const M = l.clone().multiplyScalar(a * w), E = h.clone().multiplyScalar(c * w), A = f.clone().add(M), S = d.clone().add(E);
+        this.addData(A, S);
       }
     }
   }
@@ -3303,7 +3662,7 @@ class zt extends G {
    */
   buildQuadtree() {
     const t = this.Dxf, e = [];
-    this.quadtree = new B(t.originalBox, 2), t.lineSegments.forEach((n) => {
+    this.quadtree = new j(t.originalBox, 2), t.lineSegments.forEach((n) => {
       n.userData?.isDoor || (this.quadtree?.insert({
         line: n,
         userData: e.length
@@ -3320,7 +3679,7 @@ class zt extends G {
     this.buildQuadtree();
     const t = this.quadtree, e = this.lineSegmentList, n = /* @__PURE__ */ new Set(), s = [];
     e.forEach((i, r) => {
-      const o = e[r], a = nt.fromByLineSegment(o, this.width * 2, !1, -0.01);
+      const o = e[r], a = et.fromByLineSegment(o, this.width * 2, !1, -0.01);
       t.queryRect(a).map((l) => l.userData).filter((l) => l !== r).forEach((l) => {
         try {
           if (n.has(`${r}-${l}`) || n.has(`${l}-${r}`)) return;
@@ -3360,14 +3719,14 @@ class zt extends G {
     }
   }
 }
-class Ye {
+class He {
   // 所有可查找的点位
   possibleDoorPoints = [];
   doorPoint = [];
   calculatedDoorPoint = [];
   dxf;
   // 包含所有点的虚拟网格
-  pointVirtualGrid = new Y();
+  pointVirtualGrid = new q();
   // 只包含可查找点的虚拟网格
   findPointVirtualGrid;
   quadtree;
@@ -3380,7 +3739,7 @@ class Ye {
   lineAnalysis;
   continueFind = !0;
   constructor(t) {
-    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.lineAnalysis = t, this.dxf = t.Dxf, this.findPointVirtualGrid = new q(), 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();
@@ -3420,18 +3779,18 @@ class Ye {
     );
     const a = [];
     return o.forEach((c) => {
-      const l = new D(c?.start, c?.end), h = l.length();
+      const l = new L(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 = l.start.clone().add(f.clone().multiplyScalar(r.width + p * y)), x = new D(
-          g,
-          g.clone().add(d.clone().multiplyScalar(1))
+      const f = l.normal(), d = l.direction(), p = (h - r.width * 2) / 2;
+      for (let g = 0; g < 3; g++) {
+        const y = l.start.clone().add(d.clone().multiplyScalar(r.width + p * g)), x = new L(
+          y,
+          y.clone().add(f.clone().multiplyScalar(1))
         );
-        if (x.directionMove(d, -0.5), this.quadtree.queryLineSegment(x).length) return;
+        if (x.directionMove(f, -0.5), this.quadtree.queryLineSegment(x).length) return;
       }
       a.push(l);
-    }), a;
+    }), a.forEach((c) => c.userData.doorAutomaticFind = !0), a;
   }
   /** 添加可查找点的过滤规则
    * @param rule 
@@ -3448,7 +3807,7 @@ class Ye {
     return this.lineSegments.forEach((e) => {
       e.points.forEach((n, s) => {
         for (let r = 0; r < this._pointsExcludeRule.length; r++) if (this._pointsExcludeRule[r](e, n, s)) return;
-        this.pointVirtualGrid.queryPoint(n).filter((r) => r.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: tt() });
+        this.pointVirtualGrid.queryPoint(n).filter((r) => r.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: $() });
       });
     }), t;
   }
@@ -3460,31 +3819,33 @@ class Ye {
     return n.doors.forEach((i) => {
       const r = n.lineSegments[i[4]], o = n.originalData[i[4]];
       if (o.doorDirectConnection) {
+        const { start: a, end: c, ...l } = o;
         this.continueFind = !1;
-        const a = new D(w.from(o.start), w.from(o.end));
-        a.userData = {
+        const h = new L(D.from(a), D.from(c));
+        h.userData = {
+          ...V(l),
           doorDirectConnection: !0,
           isDoor: !0
-        }, 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()
+        }, this.dxf.doorLineSegment.push(h), h.points.forEach((f) => {
+          const d = s.queryPoint(f);
+          d.length && e.push({
+            line: d[0].userData,
+            point: d[0].point,
+            uuid: $()
           });
         });
       } else if (o.drawDoorData) {
-        const a = w.from(o.drawDoorData.start), c = w.from(o.drawDoorData.n), l = s.queryPoint(a).filter((h) => {
+        const a = D.from(o.drawDoorData.start), c = D.from(o.drawDoorData.n), l = s.queryPoint(a).filter((h) => {
           if (h.userData === r) return !1;
-          const d = h.userData, f = d.direction();
-          d.start.equal(a) && f.multiplyScalar(-1);
-          const p = c.angleBetween(f, "angle");
+          const f = h.userData, d = f.direction();
+          f.start.equal(a) && d.multiplyScalar(-1);
+          const p = c.angleBetween(d, "angle");
           return p > 170 || p < 10;
         });
         l.length && t.push({
           line: l[0].userData,
           point: a,
-          uuid: tt()
+          uuid: $()
         });
       } else
         console.warn(`门的线段顺序${i[4]} 没有drawDoorData属性`);
@@ -3511,96 +3872,96 @@ class Ye {
    */
   searchNearby(t, e = [], n = this.doorSearchDistance, s = this.doorSearchNearAngle) {
     const i = this.findPointVirtualGrid, r = this.quadtree;
-    function o({ point: g, line: x }, m, L) {
+    function o({ point: y, line: x }, m, w) {
       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);
+      x.start === y && M.multiplyScalar(-1);
+      const E = i.queryCircle(y, n).filter((S) => S.userData !== x).sort((S, T) => S.point.distance(y) - T.point.distance(y)), A = [];
+      for (let S = 0; S < E.length; S++) {
+        const T = e.findIndex((G) => G.point === E[S].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
+        const P = t[m].uuid, I = e[T].uuid;
+        if (w.has(`${P}.${I}`)) continue;
+        w.add(`${P}.${I}`), w.add(`${I}.${P}`);
+        const C = E[S].point, N = new L(y.clone(), C.clone());
+        if (N.direction().angleBetween(M, "angle") < s) {
+          const G = t[m].line.direction(), B = E[S].userData;
+          B.start.equal(E[S].point) && G.multiplyScalar(-1), N.direction().multiplyScalar(-1).angleBetween(G, "angle") < s && (r.queryLineSegment(N).filter((lt) => !(lt.line.start.equal(y) || lt.line.end.equal(y) || lt.line === B)).length || A.push({
+            findData: E[S],
+            findUuid: I,
+            doorLine: N,
+            doorUuid: P
           }));
         }
       }
       return A;
     }
-    function a(g, x, m, L, M) {
-      L.add(g);
-      const S = [];
-      M && S.push(M);
+    function a(y, x, m, w, M) {
+      w.add(y);
+      const E = [];
+      M && E.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);
+        const S = m[A];
+        if (x.has(S.findUuid)) {
+          const T = x.get(S.findUuid);
+          a(S.findUuid, x, T, w, S) && E.push(S);
+        } else E.push(S);
       }
-      return S.sort((A, E) => A.doorLine.length() - E.doorLine.length()), M && S[0] === M ? (m.splice(0), !0) : (m.splice(1), !1);
+      return E.sort((A, S) => A.doorLine.length() - S.doorLine.length()), M && E[0] === M ? (m.splice(0), !0) : (m.splice(1), !1);
     }
     const c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Map();
-    t.map((g, x) => {
-      const m = o(g, x, c);
-      m.length && l.set(g.uuid, m);
+    t.map((y, x) => {
+      const m = o(y, x, c);
+      m.length && l.set(y.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];
+    l.forEach((y, x) => {
+      if (!c.has(x) && y.length && a(x, l, y, c), y.length) {
+        const m = y[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();
-    h.forEach((g) => {
-      if (g.length > 1) {
-        g.sort((x, m) => x.doorLine.length() - m.doorLine.length());
-        for (let x = 1; x < g.length; x++) d.add(g[x]);
+    const f = /* @__PURE__ */ new Set();
+    h.forEach((y) => {
+      if (y.length > 1) {
+        y.sort((x, m) => x.doorLine.length() - m.doorLine.length());
+        for (let x = 1; x < y.length; x++) f.add(y[x]);
       }
     });
-    const f = [], p = [];
-    l.forEach((g) => {
-      if (g.length) {
-        const x = g[0];
-        d.has(x) || (f.push(x), p.push(x.doorUuid, x.findUuid));
+    const d = [], p = [];
+    l.forEach((y) => {
+      if (y.length) {
+        const x = y[0];
+        f.has(x) || (d.push(x), p.push(x.doorUuid, x.findUuid));
       }
     });
-    const y = [];
-    return f.forEach((g) => {
-      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,
+    const g = [];
+    return d.forEach((y) => {
+      const x = t.findIndex((T) => T.uuid === y.doorUuid), m = e.findIndex((T) => T.uuid === y.findUuid), w = t[x].point.clone(), M = e[m].point.clone(), E = this.findLongLineSegment(t[x].line), A = this.findLongLineSegment(e[m].line), S = E.projectPoint(M);
+      if (S) {
+        w.copy(S);
+        const T = new L(w, M), P = A.includedAngle(T);
+        (P < 10 || P > 170 || Math.abs(90 - P) < 10) && g.push({
+          start: w,
           end: M
         });
       } else {
-        const T = A.projectPoint(L);
+        const T = A.projectPoint(w);
         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,
+        const P = new L(w, M), I = E.includedAngle(P);
+        (I < 10 || I > 170 || Math.abs(90 - I) < 10) && g.push({
+          start: w,
           end: M
         });
       }
     }), e.splice(
       0,
       e.length,
-      ...e.filter((g) => p.indexOf(g.uuid) === -1)
+      ...e.filter((y) => p.indexOf(y.uuid) === -1)
     ), t.splice(
       0,
       t.length,
-      ...t.filter((g) => p.indexOf(g.uuid) === -1)
-    ), y;
+      ...t.filter((y) => p.indexOf(y.uuid) === -1)
+    ), g;
   }
   /** 方案二： 沿方向查找
    * @description 
@@ -3610,7 +3971,7 @@ class Ye {
   searchAlongDirection({ point: t, line: e }, n = this.doorSearchDistance) {
     const s = this.quadtree, i = e.direction();
     e.start === t && i.multiplyScalar(-1);
-    const r = t.clone().add(i.clone().multiplyScalar(n)), o = new D(t.clone(), r), a = s.queryLineSegment(o).map((c) => ({
+    const r = t.clone().add(i.clone().multiplyScalar(n)), o = new L(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));
@@ -3629,22 +3990,22 @@ class Ye {
   searchAlongNormalDirection({ point: t, line: e }, n = this.doorSearchDistance) {
     const s = this.pointVirtualGrid, i = this.quadtree, r = e.direction(), o = e.start.normal(e.end), a = e.start.clone();
     e.start === t && r.multiplyScalar(-1), e.start === t && a.copy(e.end);
-    const c = s.queryPoint(a).filter((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) {
+    const c = s.queryPoint(a).filter((f) => f.userData !== e);
+    for (let f = 0; f < c.length; f++) {
+      const d = c[f], p = d.userData, g = p.direction();
+      if (p.start === d.point && r.multiplyScalar(-1), g.angleBetween(o) / (Math.PI / 180) > 90) {
         o.multiplyScalar(-1);
         break;
       }
     }
-    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));
+    const l = new L(t.clone(), t.clone().add(o.multiplyScalar(n))), h = i.queryLineSegment(l).map((f) => ({
+      point: f.line.getIntersection(l),
+      line: f.line
+    })).filter((f) => f.point).sort((f, d) => t.distance(f.point) - t.distance(d.point));
     if (h.length) {
-      const d = h[0];
-      if (Math.abs(90 - d.line.direction().angleBetween(o, "angle")) < 5)
-        return d;
+      const f = h[0];
+      if (Math.abs(90 - f.line.direction().angleBetween(o, "angle")) < 5)
+        return f;
     }
   }
   /**
@@ -3671,7 +4032,7 @@ class Ye {
     return e;
   }
 }
-class Xe extends G {
+class $e extends z {
   doorSearchNearAngle = 110;
   doorSearchDistance = 2;
   DoorsAnalysis;
@@ -3683,28 +4044,28 @@ class Xe extends G {
    * @param parent 
    */
   onAddFromParent(t) {
-    const e = t.findComponentByType(k), n = this.parent?.findComponentByType(zt);
+    const e = t.findComponentByType(W), n = this.parent?.findComponentByType(Qt);
     e.addEventListener("createGroup", () => {
-      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" });
+      this.skipFindDoor ? this.needsSaveDoor && (this.doors = e.doors.map((s) => e.lineSegments[s[4]])) : this.DoorsAnalysis = new He(n), this.skipFindDoor = !1, this.dispatchEvent({ type: "analysisCompleted" });
     });
   }
 }
-function Ve(u, t) {
+function Je(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), 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(l.point) ? u.end : u.start).direction(l.point).angleBetween(y, "angle") < 1 ? null : h;
+    const l = s > i ? n : e, h = l.userData, f = h.getAnotherPoint(l.point), d = t.queryPoint(f, !0)[0];
+    if (!d) return null;
+    const p = d.userData?.getAnotherPoint(d.point), g = p.direction(d.point);
+    return (u.start.equal(l.point) ? u.end : u.start).direction(l.point).angleBetween(g, "angle") < 1 ? null : h;
   }
   return null;
 }
-function We(u, t) {
-  const e = new B(I.fromByLineSegment(...u)), n = t.clone().expansion(100), s = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set();
+function Ke(u, t) {
+  const e = new j(R.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++) {
@@ -3716,41 +4077,41 @@ function We(u, t) {
     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));
+      const h = L.clipping(c, [l], yt);
+      s.add(c), h.forEach((f) => i.add(f));
     }
   }
   u = u.filter((a) => !s.has(a)), u.push(...i);
-  const o = D.groupByPosition(u, n);
+  const o = L.groupByPosition(u, n);
   return o.forEach((a) => {
-    const c = new at();
+    const c = new J();
     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 f = a[h], d = f.start.hashCode(), p = f.end.hashCode();
+      c.append(d, f.start), c.append(p, f.end);
     }
     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());
+      const h = new L(l[0].clone(), l[1].clone());
       a.push(h);
     }
   }), e.clear(), o;
 }
-function _t(u) {
-  if (u = u.map((n) => n.clone()), u = D.brokenLineMerging(u, $), u.length <= 4) return [u];
+function xt(u) {
+  if (u = u.map((n) => n.clone()), u = L.brokenLineMerging(u, U), u.length <= 4) return [u];
   u = u.sort((n, s) => s.length() - n.length());
-  const t = V(u), e = [];
+  const t = nt(u), e = [];
   for (let n = 0; n < u.length; n++) {
-    const s = u[n], i = Ve(s, t);
+    const s = u[n], i = Je(s, t);
     if (i) {
-      We(u, i).forEach((r) => {
-        r.length === 4 ? e.push(r) : e.push(..._t(r));
+      Ke(u, i).forEach((r) => {
+        r.length === 4 ? e.push(r) : e.push(...xt(r));
       });
       break;
     }
   }
   return t.clear(), e;
 }
-class He extends G {
+class Ze extends z {
   static name = "ThreeVJia";
   lineSegments = [];
   neededUpdate = !0;
@@ -3764,10 +4125,10 @@ class He extends G {
    * @returns 
    */
   getGroups(t) {
-    const e = t.reduce((n, s) => {
-      let i = s.userData.groupId ?? "door";
-      return s.userData.groupType === "wall" && (i = "wall"), n.append(i, s);
-    }, new at());
+    const e = t.reduce((n, s) => (O.get(s).forEach((r) => {
+      let o = r.id ?? "wall";
+      r.type === "wall" && (o = "wall"), n.append(o, s);
+    }), n), new J());
     return e.size === 1 ? null : e;
   }
   /** 更新
@@ -3780,16 +4141,18 @@ class He extends G {
    * @param map 
    */
   handleGroup(t) {
-    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) => {
-      _t(r).forEach((a) => {
-        if (a.length < 4) return i.push(...a);
-        a = a.sort((d, f) => d.length() - f.length());
-        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);
+    const e = t.group((o) => O.everyType(o, "bayWindow") ? "wall" : O.everyType(o, "doubleWall") ? "doubleWall" : "wall"), n = e.get("wall") ?? [], s = e.get("doubleWall") ?? [];
+    let i = [], r = new Set(s.flat());
+    n.forEach((o) => {
+      o.forEach((a) => r.has(a) || i.push(a));
+    }), s.forEach((o) => {
+      xt(o).forEach((c) => {
+        if (c.length < 4) return i.push(...c);
+        c = c.sort((d, p) => d.length() - p.length());
+        const l = c[0], h = c[1], f = new L(l.center.clone(), h.center.clone());
+        U(f, c), f.userData.wallWidth = l.length(), i.push(f);
       });
-    }), i = i.map((r) => r.clone()), this.lineSegments = i;
+    }), i = i.map((o) => o.clone()), this.lineSegments = i.filter((o) => !o.userData.isBayWindow);
   }
   /**
    * 角度纠正
@@ -3797,7 +4160,7 @@ class He extends G {
   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 = w.from(i.p);
+      const r = D.from(i.p);
       r.rotate(n, e.angle * (Math.PI / 180)), i.p = r.toJson(i.p.z);
     }), s));
   }
@@ -3808,10 +4171,10 @@ class He extends G {
     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 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 c = n.get(a.target) ?? [], l = n.get(a.source) ?? [], h = a.project.clone(), f = a.project2.clone();
+      h.includedAngle(f) > 135 && (f.points = [f.points[1], f.points[0]]), c.push(...h.points), l.push(...f.points), n.set(a.target, c), n.set(a.source, l);
+      const d = new L(h.start, f.start), p = new L(h.end, f.end), g = new L(d.center, p.center);
+      g.userData.wallWidth = Math.max(d.length(), p.length()), i.push(g);
     });
     const o = [];
     s = s.filter((a) => {
@@ -3819,15 +4182,15 @@ class He extends G {
       if (n.has(a)) {
         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");
+          for (let f = 0; f < c.length; f += 2) {
+            const d = c[f], p = c[f + 1];
+            d.userData.length = d.distance(l.start), p.userData.length = p.distance(l.start), d.userData.type = "start", p.userData.type = "end", l.start.distance(d) > l.start.distance(p) && (c[f] = p, c[f + 1] = d, d.userData.type = "end", p.userData.type = "start");
           }
-          c.sort((d, f) => d.userData.length - f.userData.length);
+          c.sort((f, d) => f.userData.length - d.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));
+          for (let f = 0; f < c.length; f++) {
+            const d = c[f];
+            d.userData.type === "start" ? (h.length === 0 && (o.push(new L(l.start.clone(), d.clone())), l.start.copy(d)), h.push("start")) : (h.pop(), h.length === 0 && l.start.copy(d));
           }
           o.push(l);
         }
@@ -3882,7 +4245,7 @@ class He extends G {
           };
         if (s.userData.isWindow && s.userData.drawWindow)
           return s.userData.drawWindow.map((i) => {
-            const r = w.from(i.p), o = r.clone().add(
+            const r = D.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)
@@ -3899,8 +4262,8 @@ class He extends G {
                 y: a.y * t
               },
               height: 1.6 * t,
-              groundClearance: 0.9 * t,
-              sillHeiqht: (s.userData?.sillHeight ?? 0.9) * t
+              groundClearance: (s.userData?.groundClearance ?? 0.9) * t,
+              sillHeiqht: (s.userData?.groundClearance ?? 0.9) * t
             };
           });
       }).filter((s) => !!s),
@@ -3918,7 +4281,7 @@ class He extends G {
     } else typeof global < "u" && (await H("fs", !1)).writeFileSync(t, JSON.stringify(this.toJson()));
   }
 }
-class Z extends me {
+class Z extends Pe {
   Dxf;
   AngleCorrectionDxf;
   Variable;
@@ -3932,7 +4295,7 @@ class Z extends me {
    * @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 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;
+    super(), this.environment = typeof window < "u" ? "browser" : typeof global < "u" ? "node" : "unknown", this.wallWidth = t, this.Dxf = new W(this.wallWidth, e), this.AngleCorrectionDxf = new Xe(), this.Variable = new Zt(), this.LineAnalysis = new Qt(), this.DoorsAnalysis = new $e(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(this.LineAnalysis), this.addComponent(this.DoorsAnalysis), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new Ze()), Z.finalInstance = this;
   }
   usePlugin(t) {
     return typeof t == "function" && t.call(this, this), this;
@@ -3945,7 +4308,7 @@ class Z extends me {
     });
   }
 }
-function Et(u, t, e) {
+function vt(u, t, e) {
   return e.reduce((n, s, i) => {
     const r = s.userData;
     if (r.parallel(u)) n[0] = i;
@@ -3956,23 +4319,23 @@ function Et(u, t, e) {
     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());
+function Qe(u, t, e, n, s) {
+  const { point: i } = u[e[0]], r = new L(i.clone(), t.clone());
   return r.points.forEach((o) => s.insert(o, r)), n.push(r), r;
 }
-function $e(u, t, e, n) {
+function tn(u, t, e, n) {
   const { point: s } = u[e[1]];
   s.copy(t), n.update(s);
 }
-function Ke(u, t, e, n) {
+function en(u, t, e, n) {
   const { point: s } = u[e[2]];
   s.copy(t), n.update(s);
 }
-function At(u, t, e, n, s) {
+function Rt(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 ?? {}));
+  if (r && tn(t, u, e, s), i) {
+    const a = Qe(t, u, e, n, s);
+    r && (a.userData = V(t[e[1]].userData?.userData ?? {}));
     return;
   }
   if (o) {
@@ -3980,27 +4343,27 @@ function At(u, t, e, n, s) {
       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);
+    en(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);
+function nn(u, t = 0.12, e, n) {
+  const s = n.queryPoint(u.start, !0), i = n.queryPoint(u.end, !0), r = u.userData.expandDirect, o = vt(u, r, s), a = vt(u, r, i), c = r === "left" ? u.getRightDirection() : u.getLeftDirection();
+  u.directionMove(c, t * 0.5), u.points.forEach((l) => n.update(l)), Rt(u.start, s, o, e, n), Rt(u.end, i, a, e, n);
 }
-class pt {
+class mt {
   /** 通过轨迹点查找外墙
    * @param lines 
    * @param trajectoryPoints
    * @returns 
    */
   static findExtWallByTraj(t, e, n = 0.4) {
-    const s = new B(I.fromByLineSegment(...t));
+    const s = new j(R.fromByLineSegment(...t));
     return t.forEach((i) => s.insert({ line: i, userData: void 0 })), t = t.filter((i) => {
       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 c = new D(r, a);
+        const c = new L(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);
@@ -4014,29 +4377,77 @@ class pt {
    * @param trajectoryPoints 
    */
   static boundExtbyTraj(t, e, n = 0.12, s) {
-    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 i = Object.keys(e).map((d) => D.from(e[d])), r = [];
+    let o = t.map(({ start: d, end: p, ...g }) => {
+      const y = new L(D.from(d), D.from(p));
+      return y.userData = g, r.push(d.z ?? 0, p.z ?? 0), y;
+    });
+    const a = r.reduce((d, p) => d + p, 0) / r.length;
+    let l = mt.findExtWallByTraj(o, i).filter((d) => d.userData.expandDirect);
+    o = o.filter((d) => !l.includes(d)), o.push(...l), s && s(l, i);
+    const h = nt(o), f = [];
+    return l.forEach((d) => {
+      d.userData.isDoor || nn(d, n, f, h);
+    }), o.push(...f.filter((d) => d.length() > 1e-9)), K(...o), tt(o, a);
+  }
+}
+function sn(u, t, e, n = !0) {
+  e = e ?? /* @__PURE__ */ new Set();
+  const s = !!t, i = t || nt(u);
+  function r(o) {
+    if (!(o instanceof L) || 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 o = 0; o < u.length; o++) {
+    const a = u[o];
+    r(a);
+  }
+  return s || i.clear(), e;
+}
+function rn(u, t, e = !1) {
+  t = t || /* @__PURE__ */ new Set();
+  const n = new gt();
+  for (u.forEach((s) => {
+    t.size && t.has(s) || s.points.forEach((i) => {
+      const r = i.hashCode();
+      n.has(r) || n.set(r, /* @__PURE__ */ new Set()), n.get(r)?.add(s);
     });
-    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 s = /* @__PURE__ */ new Set();
+    for (const [i, r] of n.entries()) {
+      if (r.size !== 1) continue;
+      const o = r.values().next().value;
+      t.add(o), n.delete(i), s.add(o);
+    }
+    if (s.forEach((i) => {
+      n.get(i.start.hashCode())?.delete(i), n.get(i.end.hashCode())?.delete(i);
+    }), s.size === 0 || !e) break;
   }
+  return t;
 }
-const Un = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Vn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  AxisAlignCorr: Gt,
-  BoundExt: pt,
-  lineDataToOriginalData: et,
-  lineSegmentClipping: ft,
-  recomputedWindow: X,
-  toOriginalDataItem: Bt
-}, Symbol.toStringTag, { value: "Module" })), bt = {
+  AxisAlignCorr: Ht,
+  BoundExt: mt,
+  DoubleWallHelper: kt,
+  clippingDoubleWall: xt,
+  clippingLineUserData: yt,
+  closedPathArea: Kt,
+  createPointVirtualGrid: nt,
+  findCircleEdges: Vt,
+  findDiscretePointLine: sn,
+  findDiscretePointLine2: rn,
+  findLargestCircle: Xt,
+  findVerticalReference: $t,
+  lineDataToOriginalData: tt,
+  lineSegmentClipping: ot,
+  mergeLineUserData: U,
+  originalDataToLineData: Jt,
+  recomputedWindow: K,
+  recomputedWindowCenter: _t,
+  toOriginalDataItem: zt
+}, Symbol.toStringTag, { value: "Module" })), Ct = {
   POSITION: [
     "byte",
     "byte normalized",
@@ -4064,36 +4475,36 @@ const Un = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     "unsigned short"
   ]
 };
-class ot {
+class at {
   constructor() {
     this.textureUtils = null, this.pluginCallbacks = [], this.register(function(t) {
-      return new hn(t);
-    }), this.register(function(t) {
-      return new un(t);
-    }), this.register(function(t) {
-      return new gn(t);
-    }), this.register(function(t) {
       return new yn(t);
     }), this.register(function(t) {
       return new xn(t);
     }), this.register(function(t) {
-      return new mn(t);
+      return new Dn(t);
     }), this.register(function(t) {
-      return new dn(t);
+      return new Ln(t);
+    }), this.register(function(t) {
+      return new Sn(t);
     }), this.register(function(t) {
-      return new fn(t);
+      return new En(t);
     }), this.register(function(t) {
-      return new pn(t);
+      return new mn(t);
     }), this.register(function(t) {
       return new wn(t);
     }), this.register(function(t) {
       return new Mn(t);
     }), this.register(function(t) {
-      return new Dn(t);
+      return new An(t);
     }), this.register(function(t) {
-      return new Ln(t);
+      return new Tn(t);
     }), this.register(function(t) {
-      return new Sn(t);
+      return new bn(t);
+    }), this.register(function(t) {
+      return new Pn(t);
+    }), this.register(function(t) {
+      return new In(t);
     });
   }
   register(t) {
@@ -4106,7 +4517,7 @@ class ot {
     return this.textureUtils = t, this;
   }
   parse(t, e, n, s) {
-    const i = new ln(), r = [];
+    const i = new gn(), 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);
@@ -4142,34 +4553,34 @@ const b = {
   CLAMP_TO_EDGE: 33071,
   MIRRORED_REPEAT: 33648,
   REPEAT: 10497
-}, 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 = {
+}, ut = "KHR_mesh_quantization", F = {};
+F[xe] = b.NEAREST;
+F[me] = b.NEAREST_MIPMAP_NEAREST;
+F[we] = b.NEAREST_MIPMAP_LINEAR;
+F[Me] = b.LINEAR;
+F[De] = b.LINEAR_MIPMAP_NEAREST;
+F[Le] = b.LINEAR_MIPMAP_LINEAR;
+F[Se] = b.CLAMP_TO_EDGE;
+F[Ee] = b.REPEAT;
+F[Ae] = b.MIRRORED_REPEAT;
+const Nt = {
   scale: "scale",
   position: "translation",
   quaternion: "rotation",
   morphTargetInfluences: "weights"
-}, Qe = new Kt(), Pt = 12, tn = 1179937895, en = 2, It = 8, nn = 1313821514, sn = 5130562;
+}, on = new ae(), Bt = 12, an = 1179937895, cn = 2, jt = 8, ln = 1313821514, hn = 5130562;
 function Q(u, t) {
   return u.length === t.length && u.every(function(e, n) {
     return e === t[n];
   });
 }
-function rn(u) {
+function un(u) {
   return new TextEncoder().encode(u).buffer;
 }
-function on(u) {
+function dn(u) {
   return Q(u.elements, [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]);
 }
-function an(u, t, e) {
+function fn(u, t, e) {
   const n = {
     min: new Array(u.itemSize).fill(Number.POSITIVE_INFINITY),
     max: new Array(u.itemSize).fill(Number.NEGATIVE_INFINITY)
@@ -4177,15 +4588,15 @@ function an(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 = dt.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 = pt.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 kt(u) {
+function te(u) {
   return Math.ceil(u / 4) * 4;
 }
-function ht(u, t = 0) {
-  const e = kt(u.byteLength);
+function dt(u, t = 0) {
+  const e = te(u.byteLength);
   if (e !== u.byteLength) {
     const n = new Uint8Array(e);
     if (n.set(new Uint8Array(u)), t !== 0)
@@ -4195,10 +4606,10 @@ function ht(u, t = 0) {
   }
   return u;
 }
-function vt() {
+function Ot() {
   return typeof document > "u" && typeof OffscreenCanvas < "u" ? new OffscreenCanvas(1, 1) : document.createElement("canvas");
 }
-function cn(u, t) {
+function pn(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({
@@ -4208,12 +4619,12 @@ function cn(u, t) {
   } else
     return new Promise((e) => u.toBlob(e, t));
 }
-class ln {
+class gn {
   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" + Qt
+        generator: "THREE.GLTFExporter r" + le
       }
     }, this.cache = {
       meshes: /* @__PURE__ */ new Map(),
@@ -4250,27 +4661,27 @@ class ln {
     const s = this, i = s.buffers, r = s.json;
     n = s.options;
     const o = s.extensionsUsed, a = s.extensionsRequired, c = new Blob(i, { type: "application/octet-stream" }), l = Object.keys(o), h = Object.keys(a);
-    l.length > 0 && (r.extensionsUsed = l), h.length > 0 && (r.extensionsRequired = h), r.buffers && r.buffers.length > 0 && (r.buffers[0].byteLength = c.size), n.binary === !0 ? 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);
+    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 ? ft(c).then(function(f) {
+      const d = dt(f), p = new DataView(new ArrayBuffer(jt));
+      p.setUint32(0, d.byteLength, !0), p.setUint32(4, hn, !0);
+      const g = dt(un(JSON.stringify(r)), 32), y = new DataView(new ArrayBuffer(jt));
+      y.setUint32(0, g.byteLength, !0), y.setUint32(4, ln, !0);
+      const x = new ArrayBuffer(Bt), m = new DataView(x);
+      m.setUint32(0, an, !0), m.setUint32(4, cn, !0);
+      const w = Bt + y.byteLength + g.byteLength + p.byteLength + d.byteLength;
+      m.setUint32(8, w, !0);
       const M = new Blob([
         x,
-        g,
         y,
+        g,
         p,
-        f
+        d
       ], { type: "application/octet-stream" });
-      ut(M).then((S) => {
-        e(S);
+      ft(M).then((E) => {
+        e(E);
       });
-    }) : r.buffers && r.buffers.length > 0 ? En(c).then((d) => {
-      r.buffers[0].uri = d, e(r);
+    }) : r.buffers && r.buffers.length > 0 ? vn(c).then((f) => {
+      r.buffers[0].uri = f, e(r);
     }) : e(r);
   }
   /**
@@ -4351,15 +4762,15 @@ class ln {
   }
   async buildMetalRoughTextureAsync(t, e) {
     if (t === e) return t;
-    function n(f) {
-      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;
+    function n(d) {
+      return d.colorSpace === ye ? function(g) {
+        return g < 0.04045 ? g * 0.0773993808 : Math.pow(g * 0.9478672986 + 0.0521327014, 2.4);
+      } : function(g) {
+        return g;
       };
     }
-    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();
+    t instanceof ht && (t = await this.decompressTextureAsync(t)), e instanceof ht && (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 = Ot();
     a.width = r, a.height = o;
     const c = a.getContext("2d", {
       willReadFrequently: !0
@@ -4368,19 +4779,19 @@ class ln {
     const l = c.getImageData(0, 0, r, o);
     if (s) {
       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)
-        l.data[y] = f(p[y] / 256) * 256;
+      const d = n(t), p = c.getImageData(0, 0, r, o).data;
+      for (let g = 2; g < p.length; g += 4)
+        l.data[g] = d(p[g] / 256) * 256;
     }
     if (i) {
       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)
-        l.data[y] = f(p[y] / 256) * 256;
+      const d = n(e), p = c.getImageData(0, 0, r, o).data;
+      for (let g = 1; g < p.length; g += 4)
+        l.data[g] = d(p[g] / 256) * 256;
     }
     c.putImageData(l, 0, 0);
-    const d = (t || e).clone();
-    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;
+    const f = (t || e).clone();
+    return f.source = new he(a), f.colorSpace = ue, f.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."), f;
   }
   async decompressTextureAsync(t, e = 1 / 0) {
     if (this.textureUtils === null)
@@ -4423,21 +4834,21 @@ class ln {
     }
     let a = t.itemSize * o;
     i === b.ARRAY_BUFFER && (a = Math.ceil(a / 4) * 4);
-    const c = kt(s * a), l = new DataView(new ArrayBuffer(c));
+    const c = te(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 = 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;
+      for (let g = 0; g < t.itemSize; g++) {
+        let y;
+        t.itemSize > 4 ? y = t.array[p * t.itemSize + g] : (g === 0 ? y = t.getX(p) : g === 1 ? y = t.getY(p) : g === 2 ? y = t.getZ(p) : g === 3 && (y = t.getW(p)), t.normalized === !0 && (y = pt.normalize(y, t.array))), e === b.FLOAT ? l.setFloat32(h, y, !0) : e === b.INT ? l.setInt32(h, y, !0) : e === b.UNSIGNED_INT ? l.setUint32(h, y, !0) : e === b.SHORT ? l.setInt16(h, y, !0) : e === b.UNSIGNED_SHORT ? l.setUint16(h, y, !0) : e === b.BYTE ? l.setInt8(h, y) : e === b.UNSIGNED_BYTE && l.setUint8(h, y), h += o;
       }
       h % a !== 0 && (h += a - h % a);
     }
-    const d = {
+    const f = {
       buffer: this.processBuffer(l.buffer),
       byteOffset: this.byteOffset,
       byteLength: c
     };
-    return i !== void 0 && (d.target = i), i === b.ARRAY_BUFFER && (d.byteStride = a), this.byteOffset += c, r.bufferViews.push(d), {
+    return i !== void 0 && (f.target = i), i === b.ARRAY_BUFFER && (f.byteStride = a), this.byteOffset += c, r.bufferViews.push(f), {
       id: r.bufferViews.length - 1,
       byteLength: 0
     };
@@ -4450,8 +4861,8 @@ class ln {
   processBufferViewImage(t) {
     const e = this, n = e.json;
     return n.bufferViews || (n.bufferViews = []), new Promise(async function(s) {
-      ut(t).then((i) => {
-        const r = ht(i), o = {
+      ft(t).then((i) => {
+        const r = dt(i), o = {
           buffer: e.processBuffer(r),
           byteOffset: e.byteOffset,
           byteLength: r.byteLength
@@ -4495,7 +4906,7 @@ class ln {
     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 = an(t, n, s);
+    const a = fn(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 = {
@@ -4524,28 +4935,28 @@ class ln {
       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 = vt();
-      f.width = Math.min(t.width, a.maxTextureSize), f.height = Math.min(t.height, a.maxTextureSize);
-      const p = f.getContext("2d", {
+      const f = { mimeType: s }, d = Ot();
+      d.width = Math.min(t.width, a.maxTextureSize), d.height = Math.min(t.height, a.maxTextureSize);
+      const p = d.getContext("2d", {
         willReadFrequently: !0
       });
-      if (n === !0 && (p.translate(0, f.height), p.scale(1, -1)), t.data !== void 0) {
-        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];
-        p.putImageData(new ImageData(g, t.width, t.height), 0, 0);
+      if (n === !0 && (p.translate(0, d.height), p.scale(1, -1)), t.data !== void 0) {
+        e !== de && 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 y = new Uint8ClampedArray(t.height * t.width * 4);
+        for (let x = 0; x < y.length; x += 4)
+          y[x + 0] = t.data[x + 0], y[x + 1] = t.data[x + 1], y[x + 2] = t.data[x + 2], y[x + 3] = t.data[x + 3];
+        p.putImageData(new ImageData(y, t.width, t.height), 0, 0);
       } else if (typeof HTMLImageElement < "u" && t instanceof HTMLImageElement || typeof HTMLCanvasElement < "u" && t instanceof HTMLCanvasElement || typeof ImageBitmap < "u" && t instanceof ImageBitmap || typeof OffscreenCanvas < "u" && t instanceof OffscreenCanvas)
-        p.drawImage(t, 0, 0, f.width, f.height);
+        p.drawImage(t, 0, 0, d.width, d.height);
       else
         throw new Error("THREE.GLTFExporter: Invalid image type. Use HTMLImageElement, HTMLCanvasElement, ImageBitmap or OffscreenCanvas.");
       a.binary === !0 ? c.push(
-        cn(f, s).then((g) => i.processBufferViewImage(g)).then((g) => {
-          d.bufferView = g;
+        pn(d, s).then((y) => i.processBufferViewImage(y)).then((y) => {
+          f.bufferView = y;
         })
-      ) : d.uri = se.getDataURL(f, s);
-      const y = o.images.push(d) - 1;
-      return l[h] = y, y;
+      ) : f.uri = fe.getDataURL(d, s);
+      const g = o.images.push(f) - 1;
+      return l[h] = g, g;
     } else
       throw new Error("THREE.GLTFExporter: No valid image data found. Unable to process texture.");
   }
@@ -4558,10 +4969,10 @@ class ln {
     const e = this.json;
     e.samplers || (e.samplers = []);
     const n = {
-      magFilter: j[t.magFilter],
-      minFilter: j[t.minFilter],
-      wrapS: j[t.wrapS],
-      wrapT: j[t.wrapT]
+      magFilter: F[t.magFilter],
+      minFilter: F[t.minFilter],
+      wrapS: F[t.wrapS],
+      wrapT: F[t.wrapT]
     };
     return e.samplers.push(n) - 1;
   }
@@ -4573,7 +4984,7 @@ class ln {
   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 ct && (t = await this.decompressTextureAsync(t, n.maxTextureSize));
+    i.textures || (i.textures = []), t instanceof ht && (t = await this.decompressTextureAsync(t, n.maxTextureSize));
     let r = t.userData.mimeType;
     r === "image/webp" && (r = "image/png");
     const o = {
@@ -4638,7 +5049,7 @@ class ln {
       };
       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 === ie && (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 === pe && (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;
@@ -4652,7 +5063,7 @@ class ln {
   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++)
+      for (let M = 0, E = t.material.length; M < E; M++)
         s.push(t.material[M].uuid);
     else
       s.push(t.material.uuid);
@@ -4661,7 +5072,7 @@ class ln {
     const r = t.geometry;
     let o;
     t.isLineSegments ? o = b.LINES : t.isLineLoop ? o = b.LINE_LOOP : t.isLine ? o = b.LINE_STRIP : t.isPoints ? o = b.POINTS : o = t.material.wireframe ? b.LINES : b.TRIANGLES;
-    const a = {}, c = {}, l = [], h = [], d = {
+    const a = {}, c = {}, l = [], h = [], f = {
       uv: "TEXCOORD_0",
       uv1: "TEXCOORD_1",
       uv2: "TEXCOORD_2",
@@ -4669,63 +5080,63 @@ class ln {
       color: "COLOR_0",
       skinWeight: "WEIGHTS_0",
       skinIndex: "JOINTS_0"
-    }, 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)));
+    }, d = r.getAttribute("normal");
+    d !== void 0 && !this.isNormalizedNormalAttribute(d) && (console.warn("THREE.GLTFExporter: Creating normalized normal attribute from the non-normalized one."), r.setAttribute("normal", this.createNormalizedNormalAttribute(d)));
     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))) {
-        c[M] = e.attributes.get(this.getUID(S));
+      const E = r.attributes[M];
+      if (M = f[M] || M.toUpperCase(), /^(POSITION|NORMAL|TANGENT|TEXCOORD_\d+|COLOR_\d+|JOINTS_\d+|WEIGHTS_\d+)$/.test(M) || (M = "_" + M), e.attributes.has(this.getUID(E))) {
+        c[M] = e.attributes.get(this.getUID(E));
         continue;
       }
       p = null;
-      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));
+      const S = E.array;
+      M === "JOINTS_0" && !(S instanceof Uint16Array) && !(S instanceof Uint8Array) ? (console.warn('GLTFExporter: Attribute "skinIndex" converted to type UNSIGNED_SHORT.'), p = new Y(new Uint16Array(S), E.itemSize, E.normalized)) : (S instanceof Uint32Array || S instanceof Int32Array) && !M.startsWith("_") && (console.warn(`GLTFExporter: Attribute "${M}" converted to type FLOAT.`), p = at.Utils.toFloat32BufferAttribute(E));
+      const T = this.processAccessor(p || E, r);
+      T !== null && (M.startsWith("_") || this.detectMeshQuantization(M, E), c[M] = T, e.attributes.set(this.getUID(E), T));
     }
-    if (f !== void 0 && r.setAttribute("normal", f), Object.keys(c).length === 0) return null;
+    if (d !== void 0 && r.setAttribute("normal", d), Object.keys(c).length === 0) return null;
     if (t.morphTargetInfluences !== void 0 && t.morphTargetInfluences.length > 0) {
-      const M = [], S = [], A = {};
+      const M = [], E = [], A = {};
       if (t.morphTargetDictionary !== void 0)
-        for (const E in t.morphTargetDictionary)
-          A[t.morphTargetDictionary[E]] = E;
-      for (let E = 0; E < t.morphTargetInfluences.length; ++E) {
+        for (const S in t.morphTargetDictionary)
+          A[t.morphTargetDictionary[S]] = S;
+      for (let S = 0; S < t.morphTargetInfluences.length; ++S) {
         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);
+        let P = !1;
+        for (const I in r.morphAttributes) {
+          if (I !== "position" && I !== "normal") {
+            P || (console.warn("GLTFExporter: Only POSITION and NORMAL morph are supported."), P = !0);
             continue;
           }
-          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));
+          const C = r.morphAttributes[I][S], N = I.toUpperCase(), _ = r.attributes[I];
+          if (e.attributes.has(this.getUID(C, !0))) {
+            T[N] = e.attributes.get(this.getUID(C, !0));
             continue;
           }
-          const R = O.clone();
+          const G = C.clone();
           if (!r.morphTargetsRelative)
-            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]);
+            for (let B = 0, Mt = C.count; B < Mt; B++)
+              for (let X = 0; X < C.itemSize; X++)
+                X === 0 && G.setX(B, C.getX(B) - _.getX(B)), X === 1 && G.setY(B, C.getY(B) - _.getY(B)), X === 2 && G.setZ(B, C.getZ(B) - _.getZ(B)), X === 3 && G.setW(B, C.getW(B) - _.getW(B));
+          T[N] = this.processAccessor(G, r), e.attributes.set(this.getUID(_, !0), T[N]);
         }
-        h.push(T), M.push(t.morphTargetInfluences[E]), t.morphTargetDictionary !== void 0 && S.push(A[E]);
+        h.push(T), M.push(t.morphTargetInfluences[S]), t.morphTargetDictionary !== void 0 && E.push(A[S]);
       }
-      a.weights = M, S.length > 0 && (a.extras = {}, a.extras.targetNames = S);
+      a.weights = M, E.length > 0 && (a.extras = {}, a.extras.targetNames = E);
     }
-    const y = Array.isArray(t.material);
-    if (y && r.groups.length === 0) return null;
-    let g = !1;
-    if (y && r.index === null) {
+    const g = Array.isArray(t.material);
+    if (g && r.groups.length === 0) return null;
+    let y = !1;
+    if (g && r.index === null) {
       const M = [];
-      for (let S = 0, A = r.attributes.position.count; S < A; S++)
-        M[S] = S;
-      r.setIndex(M), g = !0;
+      for (let E = 0, A = r.attributes.position.count; E < A; E++)
+        M[E] = E;
+      r.setIndex(M), y = !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 = g ? t.material : [t.material], m = g ? r.groups : [{ materialIndex: 0, start: void 0, count: void 0 }];
+    for (let M = 0, E = m.length; M < E; M++) {
       const A = {
         mode: o,
         attributes: c
@@ -4734,14 +5145,14 @@ class ln {
         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 E = await this.processMaterialAsync(x[m[M].materialIndex]);
-      E !== null && (A.material = E), l.push(A);
+      const S = await this.processMaterialAsync(x[m[M].materialIndex]);
+      S !== null && (A.material = S), l.push(A);
     }
-    g === !0 && r.setIndex(null), a.primitives = l, n.meshes || (n.meshes = []), await this._invokeAllAsync(function(M) {
+    y === !0 && r.setIndex(null), a.primitives = l, n.meshes || (n.meshes = []), await this._invokeAllAsync(function(M) {
       M.writeMesh && M.writeMesh(t, a);
     });
-    const L = n.meshes.push(a) - 1;
-    return e.meshes.set(i, L), L;
+    const w = n.meshes.push(a) - 1;
+    return e.meshes.set(i, w), w;
   }
   /**
    * If a vertex attribute with a
@@ -4755,7 +5166,7 @@ class ln {
    * @param {THREE.BufferAttribute} attribute
    */
   detectMeshQuantization(t, e) {
-    if (this.extensionsUsed[lt]) return;
+    if (this.extensionsUsed[ut]) return;
     let n;
     switch (e.array.constructor) {
       case Int8Array:
@@ -4775,7 +5186,7 @@ class ln {
     }
     e.normalized && (n += " normalized");
     const s = t.split("_", 1)[0];
-    bt[s] && bt[s].includes(n) && (this.extensionsUsed[lt] = !0, this.extensionsRequired[lt] = !0);
+    Ct[s] && Ct[s].includes(n) && (this.extensionsUsed[ut] = !0, this.extensionsRequired[ut] = !0);
   }
   /**
    * Process camera
@@ -4795,7 +5206,7 @@ class ln {
       znear: t.near < 0 ? 0 : t.near
     } : s.perspective = {
       aspectRatio: t.aspect,
-      yfov: dt.degToRad(t.fov),
+      yfov: pt.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;
@@ -4812,29 +5223,29 @@ class ln {
    */
   processAnimation(t, e) {
     const n = this.json, s = this.nodeMap;
-    n.animations || (n.animations = []), t = ot.Utils.mergeMorphTargetTracks(t.clone(), e);
+    n.animations || (n.animations = []), t = at.Utils.mergeMorphTargetTracks(t.clone(), e);
     const i = t.tracks, r = [], o = [];
     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) {
+      let f = rt.findNode(e, h.nodeName);
+      const d = Nt[h.propertyName];
+      if (h.objectName === "bones" && (f.isSkinnedMesh === !0 ? f = f.skeleton.getBoneByName(h.objectIndex) : f = void 0), !f || !d) {
         console.warn('THREE.GLTFExporter: Could not export animation track "%s".', l.name);
         continue;
       }
       const p = 1;
-      let y = l.values.length / l.times.length;
-      f === Tt.morphTargetInfluences && (y /= d.morphTargetInfluences.length);
-      let g;
-      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
+      let g = l.values.length / l.times.length;
+      d === Nt.morphTargetInfluences && (g /= f.morphTargetInfluences.length);
+      let y;
+      l.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline === !0 ? (y = "CUBICSPLINE", g /= 3) : l.getInterpolation() === ge ? y = "STEP" : y = "LINEAR", o.push({
+        input: this.processAccessor(new Y(l.times, p)),
+        output: this.processAccessor(new Y(l.values, g)),
+        interpolation: y
       }), r.push({
         sampler: o.length - 1,
         target: {
-          node: s.get(d),
-          path: f
+          node: s.get(f),
+          path: d
         }
       });
     }
@@ -4854,11 +5265,11 @@ class ln {
     if (i === void 0) return null;
     const r = t.skeleton.bones[0];
     if (r === void 0) return null;
-    const o = [], a = new Float32Array(i.bones.length * 16), c = new Ct();
+    const o = [], a = new Float32Array(i.bones.length * 16), c = new Gt();
     for (let h = 0; h < i.bones.length; ++h)
       o.push(n.get(i.bones[h])), c.copy(i.boneInverses[h]), c.multiply(t.bindMatrix).toArray(a, h * 16);
     return e.skins === void 0 && (e.skins = []), e.skins.push({
-      inverseBindMatrices: this.processAccessor(new _(a, 16)),
+      inverseBindMatrices: this.processAccessor(new Y(a, 16)),
       joints: o,
       skeleton: n.get(r)
     }), s.skin = e.skins.length - 1;
@@ -4876,7 +5287,7 @@ class ln {
       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(), on(t.matrix) === !1 && (i.matrix = t.matrix.elements);
+      t.matrixAutoUpdate && t.updateMatrix(), dn(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);
@@ -4922,7 +5333,7 @@ class ln {
    * @param {Array<THREE.Object3D>} objects List of objects to process
    */
   async processObjectsAsync(t) {
-    const e = new yt();
+    const e = new Dt();
     e.name = "AuxScene";
     for (let n = 0; n < t.length; n++)
       e.children.push(t[n]);
@@ -4938,7 +5349,7 @@ class ln {
     });
     const n = [];
     for (let s = 0; s < t.length; s++)
-      t[s] instanceof yt ? await this.processSceneAsync(t[s]) : n.push(t[s]);
+      t[s] instanceof Dt ? await this.processSceneAsync(t[s]) : n.push(t[s]);
     n.length > 0 && await this.processObjectsAsync(n);
     for (let s = 0; s < this.skins.length; ++s)
       this.processSkin(this.skins[s]);
@@ -4953,7 +5364,7 @@ class ln {
       await t(this.plugins[e]);
   }
 }
-class hn {
+class yn {
   constructor(t) {
     this.writer = t, this.name = "KHR_lights_punctual";
   }
@@ -4969,7 +5380,7 @@ class hn {
     o.push(r), e.extensions = e.extensions || {}, e.extensions[this.name] = { light: o.length - 1 };
   }
 }
-class un {
+class xn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_unlit";
   }
@@ -4979,7 +5390,7 @@ class un {
     e.extensions = e.extensions || {}, e.extensions[this.name] = {}, s[this.name] = !0, e.pbrMetallicRoughness.metallicFactor = 0, e.pbrMetallicRoughness.roughnessFactor = 0.9;
   }
 }
-class dn {
+class mn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_clearcoat";
   }
@@ -5010,7 +5421,7 @@ class dn {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class fn {
+class wn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_dispersion";
   }
@@ -5020,7 +5431,7 @@ class fn {
     i.dispersion = t.dispersion, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class pn {
+class Mn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_iridescence";
   }
@@ -5044,7 +5455,7 @@ class pn {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class gn {
+class Dn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_transmission";
   }
@@ -5061,7 +5472,7 @@ class gn {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class yn {
+class Ln {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_volume";
   }
@@ -5078,7 +5489,7 @@ class yn {
     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 xn {
+class Sn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_ior";
   }
@@ -5088,12 +5499,12 @@ class xn {
     i.ior = t.ior, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class mn {
+class En {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_specular";
   }
   async writeMaterialAsync(t, e) {
-    if (!t.isMeshPhysicalMaterial || t.specularIntensity === 1 && t.specularColor.equals(Qe) && !t.specularIntensityMap && !t.specularColorMap) return;
+    if (!t.isMeshPhysicalMaterial || t.specularIntensity === 1 && t.specularColor.equals(on) && !t.specularIntensityMap && !t.specularColorMap) return;
     const n = this.writer, s = n.extensionsUsed, i = {};
     if (t.specularIntensityMap) {
       const r = {
@@ -5112,7 +5523,7 @@ class mn {
     i.specularFactor = t.specularIntensity, i.specularColorFactor = t.specularColor.toArray(), e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class wn {
+class An {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_sheen";
   }
@@ -5136,7 +5547,7 @@ class wn {
     i.sheenRoughnessFactor = t.sheenRoughness, i.sheenColorFactor = t.sheenColor.toArray(), e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Mn {
+class Tn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_anisotropy";
   }
@@ -5150,7 +5561,7 @@ class Mn {
     i.anisotropyStrength = t.anisotropy, i.anisotropyRotation = t.anisotropyRotation, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Dn {
+class bn {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_emissive_strength";
   }
@@ -5160,7 +5571,7 @@ class Dn {
     i.emissiveStrength = t.emissiveIntensity, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Ln {
+class Pn {
   constructor(t) {
     this.writer = t, this.name = "EXT_materials_bump";
   }
@@ -5177,24 +5588,24 @@ class Ln {
     i.bumpFactor = t.bumpScale, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Sn {
+class In {
   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 Ct(), c = new it(), l = new Zt(), h = new it();
-    for (let f = 0; f < s.count; f++)
-      s.getMatrixAt(f, a), a.decompose(c, l, h), c.toArray(i, f * 3), l.toArray(r, f * 4), h.toArray(o, f * 3);
-    const d = {
-      TRANSLATION: n.processAccessor(new _(i, 3)),
-      ROTATION: n.processAccessor(new _(r, 4)),
-      SCALE: n.processAccessor(new _(o, 3))
+    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 Gt(), c = new it(), l = new ce(), h = new it();
+    for (let d = 0; d < s.count; d++)
+      s.getMatrixAt(d, a), a.decompose(c, l, h), c.toArray(i, d * 3), l.toArray(r, d * 4), h.toArray(o, d * 3);
+    const f = {
+      TRANSLATION: n.processAccessor(new Y(i, 3)),
+      ROTATION: n.processAccessor(new Y(r, 4)),
+      SCALE: n.processAccessor(new Y(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;
+    s.instanceColor && (f._COLOR_0 = n.processAccessor(s.instanceColor)), e.extensions = e.extensions || {}, e.extensions[this.name] = { attributes: f }, n.extensionsUsed[this.name] = !0, n.extensionsRequired[this.name] = !0;
   }
 }
-ot.Utils = {
+at.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;
@@ -5232,7 +5643,7 @@ ot.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(ye);
+        console.warn("THREE.GLTFExporter: Morph target interpolation mode not yet supported. Using LINEAR instead."), r = r.clone(), r.setInterpolation(Te);
       }
       const c = a.morphTargetInfluences.length, l = a.morphTargetDictionary[o.propertyIndex];
       if (l === void 0)
@@ -5240,25 +5651,25 @@ ot.Utils = {
       let h;
       if (n[a.uuid] === void 0) {
         h = r.clone();
-        const f = new h.ValueBufferType(c * h.times.length);
+        const d = 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);
+          d[p * c + l] = h.values[p];
+        h.name = (o.nodeName || "") + ".morphTargetInfluences", h.values = d, n[a.uuid] = h, e.push(h);
         continue;
       }
-      const d = r.createInterpolant(new r.ValueBufferType(1));
+      const f = r.createInterpolant(new r.ValueBufferType(1));
       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(h, r.times[f]);
-        h.values[p * c + l] = r.values[f];
+      for (let d = 0; d < h.times.length; d++)
+        h.values[d * c + l] = f.evaluate(h.times[d]);
+      for (let d = 0; d < r.times.length; d++) {
+        const p = this.insertKeyframe(h, r.times[d]);
+        h.values[p * c + l] = r.values[d];
       }
     }
     return u.tracks = e, u;
   },
   toFloat32BufferAttribute: function(u) {
-    const t = new _(new Float32Array(u.count * u.itemSize), u.itemSize, !1);
+    const t = new Y(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++)
@@ -5267,7 +5678,7 @@ ot.Utils = {
     return t;
   }
 };
-async function En(u) {
+async function vn(u) {
   if (typeof FileReader > "u") {
     const t = await u.arrayBuffer(), n = Buffer.from(t).toString("base64");
     return `data:${u.type};base64,${n}`;
@@ -5277,7 +5688,7 @@ async function En(u) {
       n.onload = () => t(n.result), n.onerror = () => e(new Error("Failed to read Blob as Data URL")), n.readAsDataURL(u);
     });
 }
-async function ut(u) {
+async function ft(u) {
   if (typeof u.arrayBuffer == "function")
     return await u.arrayBuffer();
   if (typeof FileReader < "u")
@@ -5290,33 +5701,33 @@ async function ut(u) {
     return t.buffer.slice(t.byteOffset, t.byteOffset + t.byteLength);
   }
 }
-const An = new xe(), bn = new ot();
-function Tn(u, t, e = 0.1) {
+const Rn = new be(), Cn = new at();
+function Nn(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 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)
+      new D(u.x - r, u.y - o).add(i),
+      new D(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 G {
+class ee extends z {
   static name = "WhiteModel";
   Dxf = null;
   Variable = null;
   // dxf数据白模
-  whiteModelGroup = new P.Group();
+  whiteModelGroup = new v.Group();
   // dxf数据白模边缘线
-  whiteModelLineGroup = new P.Group();
+  whiteModelLineGroup = new v.Group();
   // 原始数据白模
-  originalWhiteMode = new P.Group();
-  material = new P.MeshStandardMaterial({ color: 16777215, transparent: !0, opacity: 0.8, side: P.DoubleSide });
+  originalWhiteMode = new v.Group();
+  material = new v.MeshStandardMaterial({ color: 16777215, transparent: !0, opacity: 0.8, side: v.DoubleSide });
   onAddFromParent(t) {
     this.Dxf = t.findComponentByName("Dxf"), this.Variable = t.findComponentByName("Variable"), this.originalWhiteMode.visible = !1, this.Dxf?.addEventListener("lineOffset", () => {
       this.updateModel();
@@ -5326,17 +5737,17 @@ class Yt extends G {
     this.Variable?.set("whiteModelVisible", !1);
     const t = this.Dxf;
     this.originalWhiteMode.clear(), this.whiteModelGroup.clear(), this.whiteModelLineGroup.clear(), this.whiteModelGroup.add(this.whiteModelLineGroup), this.whiteModelGroup.position.z = t.originalZAverage, this.originalWhiteMode.position.z = t.originalZAverage, t.wallsGroup.forEach((n) => {
-      const s = new P.Shape();
+      const s = new v.Shape();
       n.forEach((o, a) => a === 0 ? s.moveTo(o.x / t.scale, o.y / t.scale) : s.lineTo(o.x / t.scale, o.y / t.scale));
-      const i = new P.ExtrudeGeometry(s, {
+      const i = new v.ExtrudeGeometry(s, {
         depth: 2.8,
         bevelSize: 0
-      }), r = new P.Mesh(i, this.material);
+      }), r = new v.Mesh(i, this.material);
       this.whiteModelGroup.add(r), this.whiteModelLineGroup.add(
-        new P.LineSegments(new P.EdgesGeometry(i), new P.LineBasicMaterial({ color: 0 }))
+        new v.LineSegments(new v.EdgesGeometry(i), new v.LineBasicMaterial({ color: 0 }))
       );
     }), t.originalData.map(({ start: n, end: s, insetionArr: i }) => {
-      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);
+      const r = new D(n.x, n.y).mutiplyScalar(t.scale), o = new D(s.x, s.y).mutiplyScalar(t.scale), { points: a, indices: c, rectIndices: l } = Nn(r, o, t.width);
       return {
         points: a,
         indices: c,
@@ -5344,17 +5755,17 @@ class Yt extends G {
         insetions: (i ?? []).map((h) => h.index)
       };
     }).forEach((n) => {
-      const s = new P.Shape();
+      const s = new v.Shape();
       n.rectIndices.forEach((o, a) => {
         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, {
+      const i = new v.ExtrudeGeometry(s, {
         depth: 2.8,
         bevelSize: 0
       });
       if (i.attributes.position.array.filter((o) => Number.isNaN(o)).length) return;
-      const r = new P.Mesh(i);
+      const r = new v.Mesh(i);
       this.originalWhiteMode?.add(r);
     }), this.dispatchEvent({
       type: "updateModel",
@@ -5369,7 +5780,7 @@ class Yt extends G {
   toOBJ() {
     return new Promise((t) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(() => {
-        t(An.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
+        t(Rn.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
       }, 20);
     });
   }
@@ -5381,7 +5792,7 @@ class Yt extends G {
   toGltf(t = !0) {
     return new Promise((e) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(async () => {
-        bn.parse(this.whiteModelGroup.children, (n) => {
+        Cn.parse(this.whiteModelGroup.children, (n) => {
           e(n), this.material.opacity = 0.8, this.material.transparent = !0;
         }, () => {
           e(void 0);
@@ -5442,7 +5853,7 @@ class Yt extends G {
     }
   }
 }
-class Xt extends G {
+class ne extends z {
   static name = "DetailsPoint";
   Dxf = null;
   WhiteModel = null;
@@ -5493,17 +5904,17 @@ class Xt extends G {
       this._timer = null;
       const t = this.parent?.findComponentByName("WhiteModel");
       this.raylines.length = 0, this.desPoints.length = 0, this.data.forEach((e) => {
-        const n = new P.Vector3(
+        const n = new v.Vector3(
           e.position.x,
           e.position.y,
           e.position.z
-        ), s = new P.Vector3(
+        ), s = new v.Vector3(
           e.direction.x,
           e.direction.y,
           e.direction.z
         ), i = 100;
         this.racasterHelper(n, s, i), s.z = 0;
-        const o = new P.Raycaster(n, s, 0, i).intersectObject(t.originalWhiteMode);
+        const o = new v.Raycaster(n, s, 0, i).intersectObject(t.originalWhiteMode);
         if (o.length) {
           const { point: a } = o[0];
           this.desPoints.push({
@@ -5519,71 +5930,73 @@ class Xt extends G {
     }, 50);
   }
 }
-class Vt extends G {
+class se extends z {
   static name = "DxfLineModel";
-  dxfLineModel = new P.LineSegments();
-  dxfDoorsLineModel = new P.LineSegments();
-  dxfModelGroup = new P.Group();
+  dxfLineModel = new v.LineSegments();
+  dxfDoorsLineModel = new v.LineSegments();
+  dxfModelGroup = new v.Group();
   onAddFromParent(t) {
     const e = t.findComponentByName("Dxf");
-    this.dxfModelGroup.add(this.dxfLineModel), this.dxfModelGroup.add(this.dxfDoorsLineModel), this.dxfDoorsLineModel.material = new P.LineBasicMaterial({ color: 16776960, vertexColors: !0 }), e?.addEventListener("lineOffset", () => this.updateMode());
+    this.dxfModelGroup.add(this.dxfLineModel), this.dxfModelGroup.add(this.dxfDoorsLineModel), this.dxfDoorsLineModel.material = new v.LineBasicMaterial({ color: 16776960, vertexColors: !0 }), e?.addEventListener("lineOffset", () => this.updateMode());
   }
   updateMode() {
     const t = this.parent?.findComponentByName("Dxf");
     this.dxfLineModel.clear();
     const e = t.to3DArray(1 / t.scale, 0);
-    this.dxfLineModel.geometry = new P.BufferGeometry().setAttribute("position", new P.BufferAttribute(e, 3, !0));
+    this.dxfLineModel.geometry = new v.BufferGeometry().setAttribute("position", new v.BufferAttribute(e, 3, !0));
     const n = new Float32Array(
       t.doorLineSegment.flatMap(({ start: i, end: r }) => [i.x, i.y, 0, r.x, r.y, 0])
     ).map((i) => i / t.scale), s = new Float32Array(t.doorLineSegment.flatMap(() => [1, 0, 0, 0, 1, 0]));
-    this.dxfDoorsLineModel.geometry = new P.BufferGeometry().setAttribute("position", new P.BufferAttribute(n, 3, !0)).setAttribute("color", new P.BufferAttribute(s, 3)), this.dxfModelGroup.position.z = t.originalZAverage, this.dispatchEvent({
+    this.dxfDoorsLineModel.geometry = new v.BufferGeometry().setAttribute("position", new v.BufferAttribute(n, 3, !0)).setAttribute("color", new v.BufferAttribute(s, 3)), this.dxfModelGroup.position.z = t.originalZAverage, this.dispatchEvent({
       type: "modelUpdate",
       model: this.dxfModelGroup
     });
   }
 }
-const Pn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Bn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  DetailsPoint: Xt,
-  DxfLineModel: Vt,
-  WhiteModel: Yt
+  DetailsPoint: ne,
+  DxfLineModel: se,
+  WhiteModel: ee
 }, Symbol.toStringTag, { value: "Module" }));
-function Rt(u, t = {}) {
+function Ft(u, t = {}) {
   const {
     detailsPoint: e = !0,
     whiteModel: n = !0,
     dxfLineModel: s = !0
   } = t;
-  s && u.addComponent(new Vt()), n && u.addComponent(new Yt()), e && u.addComponent(new Xt());
+  s && u.addComponent(new se()), n && u.addComponent(new ee()), e && u.addComponent(new ne());
 }
-const In = Object.assign(Rt, {
+const jn = Object.assign(Ft, {
   create(u = {}) {
-    return (t) => Rt(t, u);
+    return (t) => Ft(t, u);
   }
-}), vn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}), On = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  ModelDataPlugin: In,
-  components: Pn
+  ModelDataPlugin: jn,
+  components: Bn
 }, Symbol.toStringTag, { value: "Module" }));
-function Wt(u, t, e = 1e-3) {
-  if (Array.isArray(u) && u[0] instanceof w) {
+function ie(u, t, e = 1e-3) {
+  if (Array.isArray(u) && u[0] instanceof D) {
     const s = u;
     u = s.map((i, r) => {
       const o = s[(r + 1) % s.length];
-      return new D(i, o);
+      return new L(i, o);
     });
   }
-  if (u instanceof D) return Wt([u], t, e);
+  if (u instanceof L) return ie([u], t, e);
   const n = Z.finalInstance;
   if (n) {
     const s = n.findComponentByName("Renderer");
     if (s) {
-      const i = n.findComponentByName("Editor"), r = s.createLineSegments(u, 0, t, i?.container);
+      const i = n.findComponentByName("Editor");
+      if (u.length === 0) return;
+      const r = s.createLineSegments(u, 0, t, i?.container);
       return r.position.z = e, r;
     }
   }
 }
-function Rn(u, t, e = 1e-3) {
+function Fn(u, t, e = 1e-3) {
   const n = Z.finalInstance;
   if (n) {
     const s = n.findComponentByName("Renderer");
@@ -5593,7 +6006,7 @@ function Rn(u, t, e = 1e-3) {
     }
   }
 }
-function Cn(u, t, e, n = 1e-3) {
+function Gn(u, t, e, n = 1e-3) {
   const s = Z.finalInstance;
   if (s) {
     const i = s.findComponentByName("Renderer"), r = s.findComponentByName("Editor");
@@ -5603,16 +6016,31 @@ function Cn(u, t, e, n = 1e-3) {
     }
   }
 }
-function Nn() {
+function Un() {
   return import("./index2.js");
 }
-function Bn() {
+function qn() {
   return import("./index3.js");
 }
-let gt = null;
-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({
+let wt = null, re = class {
+  static preTime = performance.now();
+  static firstTime = performance.now();
+  static clear() {
+    this.preTime = performance.now(), this.firstTime = this.preTime;
+  }
+  static timeConsuming(t = "") {
+    const e = performance.now(), n = e - this.preTime;
+    return console.log(t + " %c time " + parseFloat(n.toFixed(6)) + "ms", "color: green;"), this.preTime = e, n;
+  }
+  static totalTime(t = "") {
+    const e = performance.now(), n = e - this.firstTime;
+    return console.log(t + " %c totalTime " + parseFloat(n.toFixed(6)) + "ms", "color: green;"), this.preTime = e, n;
+  }
+};
+typeof window < "u" && (window.drawLines = ie, window.drawPoint = Fn, window.drawText = Gn, window.randomColor = () => Math.floor(Math.random() * 16777215), window.Log = re);
+typeof globalThis < "u" && (globalThis.Log = re);
+async function Hn(u, t, e = !1, n) {
+  const s = await Promise.resolve().then(() => On), i = await Un(), r = await qn(), o = new Z().usePlugin(s.ModelDataPlugin.create({
     detailsPoint: !1,
     whiteModel: !0
   })).usePlugin(i.RenderPlugin.create({
@@ -5622,12 +6050,12 @@ async function zn(u, t, e = !1, n) {
     orbitControls: e,
     camera: t
   })).usePlugin(r.Editor.create({ viewPermission: n })), a = o.findComponentByType(i.components.DomContainer);
-  return a && u.appendChild(a.domElement), gt = o, {
+  return a && u.appendChild(a.domElement), wt = o, {
     dxfSystem: o,
-    getFileAll: () => On(o)
+    getFileAll: () => zn(o)
   };
 }
-async function On(u = gt) {
+async function zn(u = wt) {
   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,
@@ -5639,32 +6067,32 @@ async function On(u = gt) {
     correctionDxf: s
   };
 }
-function _n() {
-  return gt;
+function $n() {
+  return wt;
 }
 export {
-  Gt as A,
-  I as B,
-  G as C,
+  Ht as A,
+  R as B,
+  z 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,
-  Xt as a,
-  Y as b,
-  J as c,
-  Xe as d,
-  zn as e,
-  _n as f,
-  On as g,
-  k as h,
-  Pn as i,
-  Un as j,
-  X as r,
-  tt as u
+  Ut as E,
+  L,
+  jn as M,
+  D as P,
+  j as Q,
+  Ze as T,
+  Zt as V,
+  ee as W,
+  ne as a,
+  q as b,
+  V as c,
+  $e as d,
+  Hn as e,
+  $n as f,
+  zn as g,
+  W as h,
+  Bn as i,
+  Vn as j,
+  K as r,
+  $ as u
 };