build-dxf 0.0.27 → 0.0.28

package/src/build.js

@@ -1,8 +1,8 @@
 import * as q from "three";
-import { EventDispatcher as ot } from "three";
+import { EventDispatcher as rt } from "three";
 import Z from "clipper-lib";
 import W from "dxf-writer";
-import { OBJExporter as rt } from "three/examples/jsm/exporters/OBJExporter.js";
+import { OBJExporter as ot } from "three/examples/jsm/exporters/OBJExporter.js";
 import { GLTFExporter as at } from "three/examples/jsm/exporters/GLTFExporter.js";
 function k() {
   return "xxxx-xxxx-4xxx-yxxx-xxxx".replace(/[xy]/g, function(M) {
@@ -10,13 +10,13 @@ function k() {
     return e.toString(16);
   });
 }
-class tt extends ot {
+class tt extends rt {
   uuid = k();
   addEventListener(t, e, n) {
-    const { once: i = !1 } = n ?? {}, s = (r) => {
-      e(r), i && o();
-    }, o = () => this.removeEventListener(t, s);
-    return super.addEventListener(t, s), o;
+    const { once: i = !1 } = n ?? {}, s = (o) => {
+      e(o), i && r();
+    }, r = () => this.removeEventListener(t, s);
+    return super.addEventListener(t, s), r;
   }
   eventRecordStack = /* @__PURE__ */ new Map();
   addEventRecord(t, ...e) {
@@ -207,8 +207,8 @@ class g {
    * @param angle 旋转角度，单位为弧度
    */
   rotate(t, e) {
-    const n = this.x - t.x, i = this.y - t.y, s = Math.cos(e), o = Math.sin(e), r = n * s - i * o, l = n * o + i * s;
-    return this.x = r + t.x, this.y = l + t.y, this;
+    const n = this.x - t.x, i = this.y - t.y, s = Math.cos(e), r = Math.sin(e), o = n * s - i * r, l = n * r + i * s;
+    return this.x = o + t.x, this.y = l + t.y, this;
   }
   /**
    * 保留小数位数
@@ -233,8 +233,8 @@ class g {
    * @returns 
    */
   normal(t) {
-    const e = this.x - t.x, n = this.y - t.y, i = Math.sqrt(e * e + n * n), s = -n / i, o = e / i;
-    return new g(s, o);
+    const e = this.x - t.x, n = this.y - t.y, i = Math.sqrt(e * e + n * n), s = -n / i, r = e / i;
+    return new g(s, r);
   }
   /**
    * 获取由传入的点到该点的单位方向向量
@@ -277,9 +277,9 @@ class g {
    * @returns 
    */
   angleBetween(t, e = "radian", n = "180") {
-    const i = this.dot(t), s = this.magnitude(), o = t.magnitude();
-    if (s === 0 || o === 0) return 0;
-    const r = i / (s * o), l = Math.max(-1, Math.min(1, r));
+    const i = this.dot(t), s = this.magnitude(), r = t.magnitude();
+    if (s === 0 || r === 0) return 0;
+    const o = i / (s * r), l = Math.max(-1, Math.min(1, o));
     return e === "radian" ? Math.acos(l) : e === "cos" ? l : n === "180" || this.cross(t) < 0 ? Math.acos(l) / (Math.PI / 180) : 360 - Math.acos(l) / (Math.PI / 180);
   }
   /** 获取向量长度
@@ -361,8 +361,8 @@ class C {
   getPaths3D(t = 0) {
     const e = this.points, n = [];
     return e.forEach((i, s) => {
-      const o = e[(s + 1) % e.length];
-      n.push(i.x, i.y, t), n.push(o.x, o.y, t);
+      const r = e[(s + 1) % e.length];
+      n.push(i.x, i.y, t), n.push(r.x, r.y, t);
     }), n;
   }
   /**
@@ -374,18 +374,18 @@ class C {
     const e = t.points[0], n = t.points[1], i = n.x - e.x, s = n.y - e.y;
     if (i === 0 && s === 0)
       return this.minX <= e.x && e.x <= this.maxX && this.minY <= e.y && e.y <= this.maxY;
-    let o = Number.NEGATIVE_INFINITY, r = Number.POSITIVE_INFINITY;
+    let r = Number.NEGATIVE_INFINITY, o = Number.POSITIVE_INFINITY;
     if (i !== 0) {
       const l = (this.minX - e.x) / i, c = (this.maxX - e.x) / i;
-      o = Math.max(o, Math.min(l, c)), r = Math.min(r, Math.max(l, c));
+      r = Math.max(r, Math.min(l, c)), o = Math.min(o, Math.max(l, c));
     } else if (e.x < this.minX || e.x > this.maxX)
       return !1;
     if (s !== 0) {
       const l = (this.minY - e.y) / s, c = (this.maxY - e.y) / s;
-      o = Math.max(o, Math.min(l, c)), r = Math.min(r, Math.max(l, c));
+      r = Math.max(r, Math.min(l, c)), o = Math.min(o, Math.max(l, c));
     } else if (e.y < this.minY || e.y > this.maxY)
       return !1;
-    return o <= r && o <= 1 && r >= 0;
+    return r <= o && r <= 1 && o >= 0;
   }
   /**
    * 判断线段是在包围盒内
@@ -401,19 +401,19 @@ class C {
    */
   intersectRectangle(t) {
     const e = t.points;
-    let n = e[0].x, i = e[0].y, s = e[0].x, o = e[0].y;
+    let n = e[0].x, i = e[0].y, s = e[0].x, r = e[0].y;
     for (let c = 1; c < 4; c++) {
       const a = e[c];
-      a.x < n && (n = a.x), a.y < i && (i = a.y), a.x > s && (s = a.x), a.y > o && (o = a.y);
+      a.x < n && (n = a.x), a.y < i && (i = a.y), a.x > s && (s = a.x), a.y > r && (r = a.y);
     }
-    if (this.maxX < n || this.minX > s || this.maxY < i || this.minY > o)
+    if (this.maxX < n || this.minX > s || this.maxY < i || this.minY > r)
       return !1;
-    const r = this.points;
+    const o = this.points;
     for (let c = 0; c < 4; c++) {
-      const a = r[c], h = r[(c + 1) % 4];
+      const a = o[c], h = o[(c + 1) % 4];
       for (let d = 0; d < 4; d++) {
-        const u = e[d], f = e[(d + 1) % 4], y = (h.x - a.x) * (u.y - a.y) - (h.y - a.y) * (u.x - a.x), p = (h.x - a.x) * (f.y - a.y) - (h.y - a.y) * (f.x - a.x), x = (f.x - u.x) * (a.y - u.y) - (f.y - u.y) * (a.x - u.x), D = (f.x - u.x) * (h.y - u.y) - (f.y - u.y) * (h.x - u.x);
-        if (y * p < 0 && x * D < 0 || y === 0 && Math.min(a.x, h.x) <= u.x && u.x <= Math.max(a.x, h.x) && Math.min(a.y, h.y) <= u.y && u.y <= Math.max(a.y, h.y) || p === 0 && Math.min(a.x, h.x) <= f.x && f.x <= Math.max(a.x, h.x) && Math.min(a.y, h.y) <= f.y && f.y <= Math.max(a.y, h.y) || x === 0 && Math.min(u.x, f.x) <= a.x && a.x <= Math.max(u.x, f.x) && Math.min(u.y, f.y) <= a.y && a.y <= Math.max(u.y, f.y) || D === 0 && Math.min(u.x, f.x) <= h.x && h.x <= Math.max(u.x, f.x) && Math.min(u.y, f.y) <= h.y && h.y <= Math.max(u.y, f.y))
+        const u = e[d], f = e[(d + 1) % 4], y = (h.x - a.x) * (u.y - a.y) - (h.y - a.y) * (u.x - a.x), m = (h.x - a.x) * (f.y - a.y) - (h.y - a.y) * (f.x - a.x), x = (f.x - u.x) * (a.y - u.y) - (f.y - u.y) * (a.x - u.x), D = (f.x - u.x) * (h.y - u.y) - (f.y - u.y) * (h.x - u.x);
+        if (y * m < 0 && x * D < 0 || y === 0 && Math.min(a.x, h.x) <= u.x && u.x <= Math.max(a.x, h.x) && Math.min(a.y, h.y) <= u.y && u.y <= Math.max(a.y, h.y) || m === 0 && Math.min(a.x, h.x) <= f.x && f.x <= Math.max(a.x, h.x) && Math.min(a.y, h.y) <= f.y && f.y <= Math.max(a.y, h.y) || x === 0 && Math.min(u.x, f.x) <= a.x && a.x <= Math.max(u.x, f.x) && Math.min(u.y, f.y) <= a.y && a.y <= Math.max(u.y, f.y) || D === 0 && Math.min(u.x, f.x) <= h.x && h.x <= Math.max(u.x, f.x) && Math.min(u.y, f.y) <= h.y && h.y <= Math.max(u.y, f.y))
           return !0;
       }
     }
@@ -427,8 +427,8 @@ class C {
       for (let h = 0; h < 4; h++) {
         const d = e[h], u = e[(h + 1) % 4], f = (u.x - d.x) * (c.y - d.y) - (u.y - d.y) * (c.x - d.x);
         if (f === 0) {
-          const y = Math.abs(u.x - d.x) > 1e-10 ? u.x - d.x : u.y - d.y, p = y ? (c.x - d.x) / y : 0;
-          if (p >= 0 && p <= 1) return !0;
+          const y = Math.abs(u.x - d.x) > 1e-10 ? u.x - d.x : u.y - d.y, m = y ? (c.x - d.x) / y : 0;
+          if (m >= 0 && m <= 1) return !0;
         } else {
           const y = f > 0 ? 1 : -1;
           if (a === 0) a = y;
@@ -438,7 +438,7 @@ class C {
       return !0;
     };
     for (let c = 0; c < 4; c++)
-      if (l(r[c])) return !0;
+      if (l(o[c])) return !0;
     return !1;
   }
   /**
@@ -603,10 +603,10 @@ class U {
    * @returns 相交的节点数组
    */
   queryRect(t) {
-    const e = t.toBox(), n = Math.ceil(e.minX / this.gridSize), i = Math.ceil(e.maxX / this.gridSize), s = Math.ceil(e.minY / this.gridSize), o = Math.ceil(e.maxY / this.gridSize);
-    for (let r = n; r <= i; r++)
-      for (let l = s; l <= o; l++) {
-        const c = `${r}.${l}`;
+    const e = t.toBox(), n = Math.ceil(e.minX / this.gridSize), i = Math.ceil(e.maxX / this.gridSize), s = Math.ceil(e.minY / this.gridSize), r = Math.ceil(e.maxY / this.gridSize);
+    for (let o = n; o <= i; o++)
+      for (let l = s; l <= r; l++) {
+        const c = `${o}.${l}`;
         if (!this.map.has(c)) continue;
         this.map.get(c)?.forEach((h) => {
           t.containsPoint(h.point);
@@ -620,9 +620,9 @@ class U {
    * @returns 相交的节点数组
    */
   queryCircle(t, e) {
-    const n = new C(t.x - e, t.x + e, t.y - e, t.y + e), i = Math.ceil(n.minX / this.gridSize), s = Math.ceil(n.maxX / this.gridSize), o = Math.ceil(n.minY / this.gridSize), r = Math.ceil(n.maxY / this.gridSize), l = [];
+    const n = new C(t.x - e, t.x + e, t.y - e, t.y + e), i = Math.ceil(n.minX / this.gridSize), s = Math.ceil(n.maxX / this.gridSize), r = Math.ceil(n.minY / this.gridSize), o = Math.ceil(n.maxY / this.gridSize), l = [];
     for (let c = i; c <= s; c++)
-      for (let a = o; a <= r; a++) {
+      for (let a = r; a <= o; a++) {
         const h = `${c}.${a}`;
         if (!this.map.has(h)) continue;
         this.map.get(h)?.forEach((u) => {
@@ -637,16 +637,16 @@ class U {
    * @returns 相交的节点数组
    */
   queryBox(t) {
-    const e = Math.ceil(t.minX / this.gridSize), n = Math.ceil(t.maxX / this.gridSize), i = Math.ceil(t.minY / this.gridSize), s = Math.ceil(t.maxY / this.gridSize), o = [];
-    for (let r = e; r <= n; r++)
+    const e = Math.ceil(t.minX / this.gridSize), n = Math.ceil(t.maxX / this.gridSize), i = Math.ceil(t.minY / this.gridSize), s = Math.ceil(t.maxY / this.gridSize), r = [];
+    for (let o = e; o <= n; o++)
       for (let l = i; l <= s; l++) {
-        const c = `${r}.${l}`;
+        const c = `${o}.${l}`;
         if (!this.map.has(c)) continue;
         this.map.get(c)?.forEach((h) => {
-          t.containsPoint(h.point) && o.push(h);
+          t.containsPoint(h.point) && r.push(h);
         });
       }
-    return o;
+    return r;
   }
   /**
    * 查找相同点
@@ -716,15 +716,15 @@ class J {
     if (t.points.length !== 2)
       throw new Error("LineSegment must have exactly 2 points");
     const [e, n] = t.points, i = n.x - e.x, s = n.y - e.y;
-    for (let o = 0; o < 4; o++) {
-      const r = this.points[o], l = this.points[(o + 1) % 4], c = l.x - r.x, a = l.y - r.y, h = i * a - s * c;
+    for (let r = 0; r < 4; r++) {
+      const o = this.points[r], l = this.points[(r + 1) % 4], c = l.x - o.x, a = l.y - o.y, h = i * a - s * c;
       if (h === 0) {
-        if ((e.x - r.x) * a - (e.y - r.y) * c !== 0) continue;
-        const u = c * c + a * a, f = ((e.x - r.x) * c + (e.y - r.y) * a) / u, y = ((n.x - r.x) * c + (n.y - r.y) * a) / u;
+        if ((e.x - o.x) * a - (e.y - o.y) * c !== 0) continue;
+        const u = c * c + a * a, f = ((e.x - o.x) * c + (e.y - o.y) * a) / u, y = ((n.x - o.x) * c + (n.y - o.y) * a) / u;
         if (Math.max(f, y) >= 0 && Math.min(f, y) <= 1)
           return !0;
       } else {
-        const d = ((r.x - e.x) * a - (r.y - e.y) * c) / h, u = ((r.x - e.x) * s - (r.y - e.y) * i) / h;
+        const d = ((o.x - e.x) * a - (o.y - e.y) * c) / h, u = ((o.x - e.x) * s - (o.y - e.y) * i) / h;
         if (d >= 0 && d <= 1 && u >= 0 && u <= 1)
           return !0;
       }
@@ -742,9 +742,9 @@ class J {
     const e = (n) => {
       let i = 0;
       for (let s = 0; s < 4; s++) {
-        const o = this.points[s], r = this.points[(s + 1) % 4], l = { x: r.x - o.x, y: r.y - o.y }, c = { x: n.x - o.x, y: n.y - o.y }, a = l.x * c.y - l.y * c.x;
+        const r = this.points[s], o = this.points[(s + 1) % 4], l = { x: o.x - r.x, y: o.y - r.y }, c = { x: n.x - r.x, y: n.y - r.y }, a = l.x * c.y - l.y * c.x;
         if (a === 0) {
-          const h = l.x !== 0 ? (n.x - o.x) / l.x : (n.y - o.y) / l.y;
+          const h = l.x !== 0 ? (n.x - r.x) / l.x : (n.y - r.y) / l.y;
           if (h >= 0 && h <= 1) return !0;
         } else {
           const h = a > 0 ? 1 : -1;
@@ -764,23 +764,23 @@ class J {
   intersectRectangle(t) {
     const e = [];
     for (let s = 0; s < 4; s++) {
-      const o = this.points[s], r = this.points[(s + 1) % 4];
-      e.push(o.normal(r));
+      const r = this.points[s], o = this.points[(s + 1) % 4];
+      e.push(r.normal(o));
     }
     for (let s = 0; s < 4; s++) {
-      const o = t.points[s], r = t.points[(s + 1) % 4];
-      e.push(o.normal(r));
+      const r = t.points[s], o = t.points[(s + 1) % 4];
+      e.push(r.normal(o));
     }
-    function n(s, o) {
-      const r = s.points.map((l) => l.dot(o));
-      return [Math.min(...r), Math.max(...r)];
+    function n(s, r) {
+      const o = s.points.map((l) => l.dot(r));
+      return [Math.min(...o), Math.max(...o)];
     }
-    function i(s, o) {
-      return s[0] < o[1] && o[0] < s[1];
+    function i(s, r) {
+      return s[0] < r[1] && r[0] < s[1];
     }
     for (const s of e) {
-      const o = n(this, s), r = n(t, s);
-      if (!i(o, r))
+      const r = n(this, s), o = n(t, s);
+      if (!i(r, o))
         return !1;
     }
     return !0;
@@ -792,9 +792,9 @@ class J {
   containsPoint(t) {
     let e = 0, n = 0;
     for (let i = 0; i < 4; i++) {
-      const s = this.points[i], o = this.points[(i + 1) % 4], r = (o.x - s.x) * (t.y - s.y) - (o.y - s.y) * (t.x - s.x);
-      if (r > 0) e++;
-      else if (r < 0) n++;
+      const s = this.points[i], r = this.points[(i + 1) % 4], o = (r.x - s.x) * (t.y - s.y) - (r.y - s.y) * (t.x - s.x);
+      if (o > 0) e++;
+      else if (o < 0) n++;
       else return !1;
     }
     return e === 4 || n === 4;
@@ -816,11 +816,11 @@ class J {
    * @returns 
    */
   static fromByLineSegment(t, e = 0.1, n = !1, i = 0.5) {
-    const s = t.points[0], o = t.points[1], r = o.normal(s), l = n ? o.direction(s).mutiplyScalar(e * i) : g.zero(), c = n ? s.direction(o).mutiplyScalar(e * i) : g.zero(), a = r.x * e * 0.5, h = r.y * e * 0.5;
+    const s = t.points[0], r = t.points[1], o = r.normal(s), l = n ? r.direction(s).mutiplyScalar(e * i) : g.zero(), c = n ? s.direction(r).mutiplyScalar(e * i) : g.zero(), a = o.x * e * 0.5, h = o.y * e * 0.5;
     return new J([
       new g(s.x + a, s.y + h).add(c),
-      new g(o.x + a, o.y + h).add(l),
-      new g(o.x - a, o.y - h).add(l),
+      new g(r.x + a, r.y + h).add(l),
+      new g(r.x - a, r.y - h).add(l),
       new g(s.x - a, s.y - h).add(c)
     ]);
   }
@@ -881,8 +881,8 @@ class T {
    */
   getQuadrant(t) {
     const e = this.children[0].bounds.intersectLineSegment(t), n = this.children[1].bounds.intersectLineSegment(t), i = this.children[2].bounds.intersectLineSegment(t), s = this.children[3].bounds.intersectLineSegment(t);
-    let o = 0, r = -1;
-    return e && (o++, r = 0), n && (o++, r = 1), i && (o++, r = 2), s && (o++, r = 3), o === 1 ? r : -1;
+    let r = 0, o = -1;
+    return e && (r++, o = 0), n && (r++, o = 1), i && (r++, o = 2), s && (r++, o = 3), r === 1 ? o : -1;
   }
   /**
    * 细分当前节点为四个子节点
@@ -945,10 +945,10 @@ class T {
     if (!this.bounds.intersectBox(i))
       return n;
     for (const s of this.nodes) {
-      const [o, r] = s.line.points, l = r.x - o.x, c = r.y - o.y, a = l * l + c * c;
-      let h = ((t.x - o.x) * l + (t.y - o.y) * c) / a;
+      const [r, o] = s.line.points, l = o.x - r.x, c = o.y - r.y, a = l * l + c * c;
+      let h = ((t.x - r.x) * l + (t.y - r.y) * c) / a;
       h = Math.max(0, Math.min(1, h));
-      const d = o.x + h * l, u = o.y + h * c;
+      const d = r.x + h * l, u = r.y + h * c;
       t.distance(new g(d, u)) <= e && n.push(s);
     }
     if (!this.isLeaf)
@@ -995,9 +995,9 @@ class T {
    * @returns 
    */
   boundsToArray(t = [], e, n = !0) {
-    return !this.isLeaf && n && this.children?.forEach((i) => i.boundsToArray(t, e)), t.push(...this.bounds.points.flatMap((i, s, o) => {
-      const r = o[(s + 1) % o.length];
-      return e?.push(...this.color), e?.push(...this.color), [i.x, i.y, 0, r.x, r.y, 0];
+    return !this.isLeaf && n && this.children?.forEach((i) => i.boundsToArray(t, e)), t.push(...this.bounds.points.flatMap((i, s, r) => {
+      const o = r[(s + 1) % r.length];
+      return e?.push(...this.color), e?.push(...this.color), [i.x, i.y, 0, o.x, o.y, 0];
     })), t;
   }
 }
@@ -1094,13 +1094,13 @@ class I {
    * @returns {Rectangle}
    */
   expandToRectangle(t = 0.1, e = "all") {
-    const n = this.start, i = this.end, s = i.normal(n), o = e === "bothSides" ? g.zero() : i.direction(n).mutiplyScalar(t * 0.5), r = e === "bothSides" ? g.zero() : n.direction(i).mutiplyScalar(t * 0.5), l = s.x * t * 0.5, c = s.y * t * 0.5, a = [
+    const n = this.start, i = this.end, s = i.normal(n), r = e === "bothSides" ? g.zero() : i.direction(n).mutiplyScalar(t * 0.5), o = e === "bothSides" ? g.zero() : n.direction(i).mutiplyScalar(t * 0.5), l = s.x * t * 0.5, c = s.y * t * 0.5, a = [
       // 第一条线
-      new g(n.x + l, n.y + c).add(r),
-      new g(i.x + l, i.y + c).add(o),
+      new g(n.x + l, n.y + c).add(o),
+      new g(i.x + l, i.y + c).add(r),
       // 第二条线
-      new g(n.x - l, n.y - c).add(r),
-      new g(i.x - l, i.y - c).add(o)
+      new g(n.x - l, n.y - c).add(o),
+      new g(i.x - l, i.y - c).add(r)
     ];
     return new J([0, 1, 3, 2].map((h) => a[h]));
   }
@@ -1139,22 +1139,22 @@ class I {
   projectLineSegment(t) {
     if (t.points.length !== 2 || this.points.length !== 2)
       throw new Error("每条线段必须由两个点定义");
-    const [e, n] = t.points, [i, s] = this.points, o = new g(s.x - i.x, s.y - i.y);
-    if (o.x === 0 && o.y === 0)
+    const [e, n] = t.points, [i, s] = this.points, r = new g(s.x - i.x, s.y - i.y);
+    if (r.x === 0 && r.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
-    const r = (f) => {
-      const y = new g(f.x - i.x, f.y - i.y), p = o.x * o.x + o.y * o.y, D = (y.x * o.x + y.y * o.y) / p, w = i.x + D * o.x, b = i.y + D * o.y;
-      return new g(w, b);
+    const o = (f) => {
+      const y = new g(f.x - i.x, f.y - i.y), m = r.x * r.x + r.y * r.y, D = (y.x * r.x + y.y * r.y) / m, w = i.x + D * r.x, P = i.y + D * r.y;
+      return new g(w, P);
     };
-    let l = r(e), c = r(n);
+    let l = o(e), c = o(n);
     const a = (f) => {
-      const y = new g(f.x - i.x, f.y - i.y), p = o.x * o.x + o.y * o.y;
-      return (y.x * o.x + y.y * o.y) / p;
+      const y = new g(f.x - i.x, f.y - i.y), m = r.x * r.x + r.y * r.y;
+      return (y.x * r.x + y.y * r.y) / m;
     };
     let h = a(l), d = a(c);
     const u = (f) => {
-      const y = Math.max(0, Math.min(1, f)), p = i.x + y * o.x, x = i.y + y * o.y;
-      return new g(p, x);
+      const y = Math.max(0, Math.min(1, f)), m = i.x + y * r.x, x = i.y + y * r.y;
+      return new g(m, x);
     };
     return (h < 0 || h > 1) && (l = u(h)), (d < 0 || d > 1) && (c = u(d)), l.x === c.x && l.y === c.y ? new I(l, l) : new I(l, c);
   }
@@ -1168,16 +1168,16 @@ class I {
     const [n, i] = this.points, s = new g(i.x - n.x, i.y - n.y);
     if (s.x === 0 && s.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
-    let r = ((a) => {
-      const h = new g(a.x - n.x, a.y - n.y), d = s.x * s.x + s.y * s.y, f = (h.x * s.x + h.y * s.y) / d, y = n.x + f * s.x, p = n.y + f * s.y;
-      return new g(y, p);
+    let o = ((a) => {
+      const h = new g(a.x - n.x, a.y - n.y), d = s.x * s.x + s.y * s.y, f = (h.x * s.x + h.y * s.y) / d, y = n.x + f * s.x, m = n.y + f * s.y;
+      return new g(y, m);
     })(t);
-    if (!e) return r;
+    if (!e) return o;
     let c = ((a) => {
       const h = new g(a.x - n.x, a.y - n.y), d = s.x * s.x + s.y * s.y;
       return (h.x * s.x + h.y * s.y) / d;
-    })(r);
-    return c < 0 || c > 1 ? null : r;
+    })(o);
+    return c < 0 || c > 1 ? null : o;
   }
   /**
    * 判断线段是否与另一条线段相交（包含共用端点或部分重合的情况）
@@ -1186,15 +1186,15 @@ class I {
    * @returns 
    */
   intersectLineSegment(t, e = !0) {
-    const n = this.start, i = this.end, s = t.start, o = t.end;
-    function r(u, f, y) {
+    const n = this.start, i = this.end, s = t.start, r = t.end;
+    function o(u, f, y) {
       return (f.x - u.x) * (y.y - u.y) - (f.y - u.y) * (y.x - u.x);
     }
     function l(u, f, y) {
       return Math.min(f.x, y.x) - 1e-10 <= u.x && u.x <= Math.max(f.x, y.x) + 1e-10 && Math.min(f.y, y.y) - 1e-10 <= u.y && u.y <= Math.max(f.y, y.y) + 1e-10;
     }
-    const c = r(n, i, s), a = r(n, i, o), h = r(s, o, n), d = r(s, o, i);
-    return !!(c * a < 0 && h * d < 0 || e && (Math.abs(c) < 1e-10 && l(s, n, i) || Math.abs(a) < 1e-10 && l(o, n, i) || Math.abs(h) < 1e-10 && l(n, s, o) || Math.abs(d) < 1e-10 && l(i, s, o)));
+    const c = o(n, i, s), a = o(n, i, r), h = o(s, r, n), d = o(s, r, i);
+    return !!(c * a < 0 && h * d < 0 || e && (Math.abs(c) < 1e-10 && l(s, n, i) || Math.abs(a) < 1e-10 && l(r, n, i) || Math.abs(h) < 1e-10 && l(n, s, r) || Math.abs(d) < 1e-10 && l(i, s, r)));
   }
   /**
    * 判断一个点是否在线段上（含端点）
@@ -1211,10 +1211,10 @@ class I {
    * @returns 
    */
   getIntersection(t) {
-    const e = this.start, n = this.end, i = t.start, s = t.end, o = (e.x - n.x) * (i.y - s.y) - (e.y - n.y) * (i.x - s.x);
-    if (Math.abs(o) < 1e-10)
+    const e = this.start, n = this.end, i = t.start, s = t.end, r = (e.x - n.x) * (i.y - s.y) - (e.y - n.y) * (i.x - s.x);
+    if (Math.abs(r) < 1e-10)
       return null;
-    const r = ((e.x - i.x) * (i.y - s.y) - (e.y - i.y) * (i.x - s.x)) / o, l = e.x + r * (n.x - e.x), c = e.y + r * (n.y - e.y);
+    const o = ((e.x - i.x) * (i.y - s.y) - (e.y - i.y) * (i.x - s.x)) / r, l = e.x + o * (n.x - e.x), c = e.y + o * (n.y - e.y);
     return new g(l, c);
   }
   /**
@@ -1261,8 +1261,8 @@ class I {
    * @returns 
    */
   areLinesCoincident(t) {
-    const e = this.start, n = this.end, i = t.start, s = t.end, o = (n.y - e.y) / (n.x - e.x), r = e.y - o * e.x, l = (s.y - i.y) / (s.x - i.x), c = i.y - l * i.x;
-    return !isFinite(o) && !isFinite(l) ? e.x === i.x && n.x === i.x : Math.abs(o - l) < 1e-3 && Math.abs(r - c) < 1e-3;
+    const e = this.start, n = this.end, i = t.start, s = t.end, r = (n.y - e.y) / (n.x - e.x), o = e.y - r * e.x, l = (s.y - i.y) / (s.x - i.x), c = i.y - l * i.x;
+    return !isFinite(r) && !isFinite(l) ? e.x === i.x && n.x === i.x : Math.abs(r - l) < 1e-3 && Math.abs(o - c) < 1e-3;
   }
   clone() {
     const t = new I(
@@ -1280,155 +1280,160 @@ class I {
   static axisAlignmentCorrection(t, e) {
     function n(x) {
       const D = new U();
-      x.forEach((b) => b.points.forEach((P) => D.insert(P, b)));
+      x.forEach((P) => P.userData.isDoor || P.points.forEach((b) => D.insert(b, P)));
       const w = [];
-      for (let b = 0; b < x.length; b++) {
-        const P = x[b], S = /* @__PURE__ */ new Map();
-        P.points.forEach((m) => {
-          if (D.queryPoint(m).length > 1) return;
-          const A = D.queryCircle(m, 0.4).filter((E) => {
-            const L = m.distance(E.point);
-            return S.set(E.point, L), E.userData !== P || L > 1e-3;
-          }).sort((E, L) => {
-            const v = S.get(E.point), B = S.get(L.point);
+      for (let P = 0; P < x.length; P++) {
+        const b = x[P], L = /* @__PURE__ */ new Map();
+        b.userData.isDoor || b.points.forEach((p) => {
+          if (D.queryPoint(p).length > 1) return;
+          const A = D.queryCircle(p, 0.4).filter((E) => {
+            const S = E.userData;
+            if (S === b || !b.parallel(S, 25)) return !1;
+            if (D.queryPoint(E.point).length > 1) return;
+            const v = new I(p, E.point), B = new I(b.start === p ? b.end : b.start, S.start === E.point ? S.end : S.start);
+            if (!v.intersectLineSegment(B)) return !1;
+            const Y = p.distance(E.point);
+            return Y < 1e-3 ? !1 : (L.set(E.point, Y), !0);
+          }).sort((E, S) => {
+            const v = L.get(E.point), B = L.get(S.point);
             return v - B;
           });
-          A.length !== 0 && w.push(new I(m.clone(), A[0].point.clone()));
+          A.length !== 0 && w.push(new I(p.clone(), A[0].point.clone()));
         });
       }
       return [...x, ...w];
     }
     function i(x, D) {
-      const w = [x], b = [], P = [];
-      for (let S = 0; S < D.length; S++) {
-        const m = D[S];
-        if (x !== m) {
-          if (m.userData.isDoor) {
-            P.push(m);
+      const w = [x], P = [], b = [];
+      for (let L = 0; L < D.length; L++) {
+        const p = D[L];
+        if (x !== p) {
+          if (p.userData.isDoor) {
+            b.push(p);
             continue;
           }
-          if (m.parallel(x, 45)) {
-            const A = Math.atan2(m.end.y - m.start.y, m.end.x - m.start.x);
-            let L = Math.atan2(x.end.y - x.start.y, x.end.x - x.start.x) - A;
-            for (; L > Math.PI; ) L -= 2 * Math.PI;
-            for (; L < -Math.PI; ) L += 2 * Math.PI;
-            const v = m.center;
-            m.start.rotate(v, L), m.end.rotate(v, L), w.push(m);
+          if (p.parallel(x, 45)) {
+            const A = Math.atan2(p.end.y - p.start.y, p.end.x - p.start.x);
+            let S = Math.atan2(x.end.y - x.start.y, x.end.x - x.start.x) - A;
+            for (; S > Math.PI; ) S -= 2 * Math.PI;
+            for (; S < -Math.PI; ) S += 2 * Math.PI;
+            const v = p.center;
+            p.start.rotate(v, S), p.end.rotate(v, S), w.push(p);
           } else {
-            const A = Math.atan2(m.end.y - m.start.y, m.end.x - m.start.x), E = Math.atan2(x.end.y - x.start.y, x.end.x - x.start.x);
-            let L = E + Math.PI / 2 - A, v = E - Math.PI / 2 - A;
-            for (; L > Math.PI; ) L -= 2 * Math.PI;
-            for (; L < -Math.PI; ) L += 2 * Math.PI;
+            const A = Math.atan2(p.end.y - p.start.y, p.end.x - p.start.x), E = Math.atan2(x.end.y - x.start.y, x.end.x - x.start.x);
+            let S = E + Math.PI / 2 - A, v = E - Math.PI / 2 - A;
+            for (; S > Math.PI; ) S -= 2 * Math.PI;
+            for (; S < -Math.PI; ) S += 2 * Math.PI;
             for (; v > Math.PI; ) v -= 2 * Math.PI;
             for (; v < -Math.PI; ) v += 2 * Math.PI;
-            const B = Math.abs(L) < Math.abs(v) ? L : v, X = m.center;
-            m.start.rotate(X, B), m.end.rotate(X, B), b.push(m);
+            const B = Math.abs(S) < Math.abs(v) ? S : v, Y = p.center;
+            p.start.rotate(Y, B), p.end.rotate(Y, B), P.push(p);
           }
         }
       }
-      return { parallelLines: w, verticalLines: b, doorLines: P };
+      return { parallelLines: w, verticalLines: P, doorLines: b };
     }
-    function s(x, D, w, b = 0.3, P = 0.06) {
-      const S = [];
+    function s(x, D, w, P = 0.3, b = 0.06) {
+      const L = [];
       x.forEach((E) => {
-        const L = w.projectPoint(E.start, !1);
-        L && (L.userData = E, S.push(L));
-      }), S.sort((E, L) => L.distance(w.start) - E.distance(w.start));
-      const m = [], A = [];
-      for (let E = 0; E < S.length; E++) {
-        const L = S[E];
+        const S = w.projectPoint(E.start, !1);
+        S && (S.userData = E, L.push(S));
+      }), L.sort((E, S) => S.distance(w.start) - E.distance(w.start));
+      const p = [], A = [];
+      for (let E = 0; E < L.length; E++) {
+        const S = L[E];
         if (E === 0) {
-          A.push(L);
+          A.push(S);
           continue;
         }
-        S[E - 1].distance(L) < P || (m.push([...A]), A.length = 0), A.push(L), E === S.length - 1 && m.push(A);
+        L[E - 1].distance(S) < b || (p.push([...A]), A.length = 0), A.push(S), E === L.length - 1 && p.push(A);
       }
-      return m.flatMap((E) => {
-        const L = E.flatMap((j) => {
-          const G = j.userData;
-          return G.points.map((R) => {
-            const Y = D.projectPoint(R, !1);
-            return Y.userData = G, Y;
+      return p.flatMap((E) => {
+        const S = E.flatMap((j) => {
+          const X = j.userData;
+          return X.points.map((R) => {
+            const G = D.projectPoint(R, !1);
+            return G.userData = X, G;
           });
         });
-        L.sort((j, G) => j.distance(D.start) - G.distance(D.start));
-        const v = /* @__PURE__ */ new Map(), B = [], X = [];
-        return L.forEach((j, G) => {
-          v.size === 0 && G > 0 && L[G - 1].distance(j) > b && (B.push([...X]), X.length = 0), v.set(j.userData, (v.get(j.userData) ?? 0) + 1);
+        S.sort((j, X) => j.distance(D.start) - X.distance(D.start));
+        const v = /* @__PURE__ */ new Map(), B = [], Y = [];
+        return S.forEach((j, X) => {
+          v.size === 0 && X > 0 && S[X - 1].distance(j) > P && (B.push([...Y]), Y.length = 0), v.set(j.userData, (v.get(j.userData) ?? 0) + 1);
           for (const R of v.values()) if (R !== 2) return;
-          X.push(...v.keys()), v.clear();
-        }), B.push([...X]), B;
+          Y.push(...v.keys()), v.clear();
+        }), B.push([...Y]), B;
       });
     }
-    function o(x, D = 0.1) {
+    function r(x, D = 0.1) {
       return x.map((w) => {
         if (w.length === 0) return;
         if (w.length === 1) return w[0];
-        const b = [];
-        w.forEach((Y) => {
-          b.push(Y.start.clone(), Y.end.clone());
+        const P = [];
+        w.forEach((G) => {
+          P.push(G.start.clone(), G.end.clone());
         });
-        const P = w[0].direction().normalize();
-        let S = 1 / 0, m = -1 / 0, A = 0, E = 0;
-        b.forEach((Y) => {
-          const F = Y.x * P.x + Y.y * P.y;
-          S = Math.min(S, F), m = Math.max(m, F), A += Y.x, E += Y.y;
+        const b = w[0].direction().normalize();
+        let L = 1 / 0, p = -1 / 0, A = 0, E = 0;
+        P.forEach((G) => {
+          const F = G.x * b.x + G.y * b.y;
+          L = Math.min(L, F), p = Math.max(p, F), A += G.x, E += G.y;
         });
-        const L = new g(A / b.length, E / b.length), v = L.x * P.x + L.y * P.y, B = new g(L.x + (S - v) * P.x, L.y + (S - v) * P.y), X = new g(L.x + (m - v) * P.x, L.y + (m - v) * P.y), j = new I(B, X), G = w[0].normal().normalize();
-        S = 1 / 0, m = -1 / 0, b.forEach((Y) => {
-          const F = Y.x * G.x + Y.y * G.y;
-          S = Math.min(S, F), m = Math.max(m, F);
+        const S = new g(A / P.length, E / P.length), v = S.x * b.x + S.y * b.y, B = new g(S.x + (L - v) * b.x, S.y + (L - v) * b.y), Y = new g(S.x + (p - v) * b.x, S.y + (p - v) * b.y), j = new I(B, Y), X = w[0].normal().normalize();
+        L = 1 / 0, p = -1 / 0, P.forEach((G) => {
+          const F = G.x * X.x + G.y * X.y;
+          L = Math.min(L, F), p = Math.max(p, F);
         });
-        const R = m - S;
+        const R = p - L;
         return R >= D && (j.userData.wallWidth = R), j;
       }).filter((w) => !!w);
     }
-    function r(x, D = 0.2) {
-      const w = new T(C.fromByLineSegment(...x)), b = /* @__PURE__ */ new Map();
-      x.forEach((S) => {
-        b.set(S, { line: S, userData: void 0 }), w.insert(b.get(S));
+    function o(x, D = 0.2) {
+      const w = new T(C.fromByLineSegment(...x)), P = /* @__PURE__ */ new Map();
+      x.forEach((L) => {
+        P.set(L, { line: L, userData: void 0 }), w.insert(P.get(L));
       });
-      const P = new I();
-      for (let S = 0; S < x.length; S++) {
-        const m = x[S];
-        if (m.userData.isAdsorbed) continue;
-        const A = m.direction().multiplyScalar(D), [E, L] = m.points.map((v) => {
-          P.set(v, v), P.start.add(A), P.end.add(A.multiplyScalar(-1));
-          const B = /* @__PURE__ */ new Map(), X = w.queryRect(P.expandToRectangle(0.1, "bothSides")).filter((j) => j.line !== m).map((j) => {
-            const G = j.line.getIntersection(P);
-            return B.set(j.line, G), j.line;
-          }).sort((j, G) => {
-            const R = B.get(j), Y = B.get(G);
-            return R && Y ? R.distance(v) - Y.distance(v) : 0;
+      const b = new I();
+      for (let L = 0; L < x.length; L++) {
+        const p = x[L];
+        if (p.userData.isAdsorbed) continue;
+        const A = p.direction().multiplyScalar(D), [E, S] = p.points.map((v) => {
+          b.set(v, v), b.start.add(A), b.end.add(A.multiplyScalar(-1));
+          const B = /* @__PURE__ */ new Map(), Y = w.queryRect(b.expandToRectangle(0.1, "bothSides")).filter((j) => j.line !== p).map((j) => {
+            const X = j.line.getIntersection(b);
+            return B.set(j.line, X), j.line;
+          }).sort((j, X) => {
+            const R = B.get(j), G = B.get(X);
+            return R && G ? R.distance(v) - G.distance(v) : 0;
           });
-          return X.length ? B.get(X[0]) : void 0;
+          return Y.length ? B.get(Y[0]) : void 0;
         });
-        if (E && L) {
-          if (E.equal(L)) {
-            const v = m.start.distance(E), B = m.end.distance(L);
-            v < B ? m.directionMove(m.start.direction(m.end), v) : m.directionMove(m.end.direction(m.start), B);
+        if (E && S) {
+          if (E.equal(S)) {
+            const v = p.start.distance(E), B = p.end.distance(S);
+            v < B ? p.directionMove(p.start.direction(p.end), v) : p.directionMove(p.end.direction(p.start), B);
           } else
-            m.start.copy(E), m.end.copy(L);
-          m.userData.isAdsorbed = !0;
-        } else E ? m.start.copy(E) : L && m.end.copy(L);
-        w.remove(b.get(m)), w.insert(b.get(m));
+            p.start.copy(E), p.end.copy(S);
+          p.userData.isAdsorbed = !0;
+        } else E ? p.start.copy(E) : S && p.end.copy(S);
+        w.remove(P.get(p)), w.insert(P.get(p));
       }
-      return x.filter((S) => S.length() > 1e-3);
+      return x.filter((L) => L.length() > 1e-3);
     }
     function l(x) {
       const D = new T(C.fromByLineSegment(...x));
       return x.forEach((w) => D.insert({ line: w, userData: void 0 })), x.flatMap((w) => {
-        const b = D.queryLineSegment(w, !0).map((P) => {
-          if (P.line === w) return;
-          const S = P.line.getIntersection(w);
-          if (!(!S || w.start.equal(S) || w.end.equal(S)))
-            return S;
-        }).filter((P) => !!P);
-        return b.length ? (w = w.clone(), b.sort((S, m) => w.start.distance(S) - w.start.distance(m)), [...b.map((S) => {
-          const m = w.clone();
-          return m.set(w.start.clone(), S), w.start.copy(S), m;
+        const P = D.queryLineSegment(w, !0).map((b) => {
+          if (b.line === w) return;
+          const L = b.line.getIntersection(w);
+          if (!(!L || w.start.equal(L) || w.end.equal(L)))
+            return L;
+        }).filter((b) => !!b);
+        return P.length ? (w = w.clone(), P.sort((L, p) => w.start.distance(L) - w.start.distance(p)), [...P.map((L) => {
+          const p = w.clone();
+          return p.set(w.start.clone(), L), w.start.copy(L), p;
         }), w]) : w;
-      }).filter((w) => w.length() > 0.1);
+      }).filter((w) => w.length() > 0.05);
     }
     t = n(t);
     const { parallelLines: c, verticalLines: a } = i(e, t.map((x) => x.clone())), h = e.normal(), d = e.center, u = e.direction(), f = new I(
@@ -1438,11 +1443,11 @@ class I {
       d.clone().add(u.clone().multiplyScalar(-1e3)),
       d.clone().add(u.clone().multiplyScalar(1e3))
     );
-    let p = o([
+    let m = r([
       ...s.call(this, c, y, f),
       ...s.call(this, a, f, y)
     ]);
-    return p = r.call(this, p), p = r.call(this, p), p = l.call(this, p), p;
+    return m = o.call(this, m), m = o.call(this, m), m = l.call(this, m), m;
   }
   /**
    * 获取最长线段
@@ -1512,7 +1517,7 @@ const lt = {
   Parsecs: 3240779289666404e-32
   // 秒差距，1米 ≈ 0.00000000000000003240779289666404秒差距
 };
-function _(M) {
+function K(M) {
   const t = [];
   for (let e = 0; e < M.length; e++)
     t.push(new I(
@@ -1521,7 +1526,7 @@ function _(M) {
     ));
   return t;
 }
-function K(M) {
+function Q(M) {
   return M.flatMap((t, e) => (e === M.length - 1 && [...t.points, M[0].points[0]], [t.points[0]]));
 }
 class z extends V {
@@ -1571,19 +1576,19 @@ class z extends V {
   preprocessing(t, e = !1) {
     const n = [];
     let i = -1;
-    t.forEach(({ start: o, end: r, ...l }, c) => {
+    t.forEach(({ start: r, end: o, ...l }, c) => {
       const a = new I(
-        g.from(o),
-        g.from(r)
+        g.from(r),
+        g.from(o)
       );
       a.userData = l, n.push(a), l.isVerticalReferenceLine && (i = c);
     }), i === -1 && (i = I.maxLengthLineIndex(n));
     const s = n[i];
     if (s.userData.isVerticalReferenceLine = !0, t[i].isVerticalReferenceLine = !0, e) {
-      const o = I.axisAlignmentCorrection(n, s);
-      return i = I.maxLengthLineIndex(o), o[i].userData.isVerticalReferenceLine = !0, {
-        lineSegments: o,
-        data: this.lineDataToOriginalData(o)
+      const r = I.axisAlignmentCorrection(n, s);
+      return i = I.maxLengthLineIndex(r), r[i].userData.isVerticalReferenceLine = !0, {
+        lineSegments: r,
+        data: this.lineDataToOriginalData(r)
       };
     }
     return {
@@ -1610,9 +1615,9 @@ class z extends V {
     this.scale = n, this.width = e;
     const s = this.preprocessing(t, i);
     t = s.data, this.lineSegments = s.lineSegments, this.originalData = t;
-    const o = [];
-    this.data = t.map(({ start: r, end: l, insetionArr: c, isDoor: a = !1 }, h) => {
-      o.push(r.z ?? 0, l.z ?? 0);
+    const r = [];
+    this.data = t.map(({ start: o, end: l, insetionArr: c, isDoor: a = !1 }, h) => {
+      r.push(o.z ?? 0, l.z ?? 0);
       const d = this.lineSegments[h];
       return [
         d.points[0],
@@ -1621,7 +1626,7 @@ class z extends V {
         a,
         h
       ];
-    }), this.originalZAverage = o.reduce((r, l) => r + l, 0) / o.length, this.computedOriginalSize(t, this.originalBox), this.dispatchEvent({
+    }), this.originalZAverage = r.reduce((o, l) => o + l, 0) / r.length, this.computedOriginalSize(t, this.originalBox), this.dispatchEvent({
       type: "setDta",
       originalData: this.originalData,
       data: this.data
@@ -1635,18 +1640,18 @@ class z extends V {
    * @returns 
    */
   createGroups() {
-    const t = [], e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Map(), s = (o, r, l = -1) => {
-      const [c, a, h, d] = this.data[o];
-      if (e.add(o), d)
-        return i.has(o) || i.set(o, []), i.get(o)?.push(l), n.add(this.data[o]);
-      r.push([c, a]), h.forEach((u) => {
-        e.has(u) || s(u, r, o);
+    const t = [], e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Map(), s = (r, o, l = -1) => {
+      const [c, a, h, d] = this.data[r];
+      if (e.add(r), d)
+        return i.has(r) || i.set(r, []), i.get(r)?.push(l), n.add(this.data[r]);
+      o.push([c, a]), h.forEach((u) => {
+        e.has(u) || s(u, o, r);
       });
     };
-    return this.data.forEach((o, r) => {
-      if (!e.has(r)) {
+    return this.data.forEach((r, o) => {
+      if (!e.has(o)) {
         const l = [];
-        s(r, l), t.push(l);
+        s(o, l), t.push(l);
       }
     }), this.doors = [...n], this.pointsGroups = t, t;
   }
@@ -1656,8 +1661,8 @@ class z extends V {
    * @returns 
    */
   computedSize() {
-    const t = this.pointsGroups.flatMap((r) => r.flatMap((l) => [l[0].x, l[1].x])), e = this.pointsGroups.flatMap((r) => r.flatMap((l) => [l[0].y, l[1].y])), n = Math.min(...t), i = Math.min(...e), s = Math.max(...t), o = Math.max(...e);
-    return this.box.set(n, i, s, o), this.box;
+    const t = this.pointsGroups.flatMap((o) => o.flatMap((l) => [l[0].x, l[1].x])), e = this.pointsGroups.flatMap((o) => o.flatMap((l) => [l[0].y, l[1].y])), n = Math.min(...t), i = Math.min(...e), s = Math.max(...t), r = Math.max(...e);
+    return this.box.set(n, i, s, r), this.box;
   }
   /** 线路拓扑
    * @description 处理线路拓扑，使线路有序链接，形成长路径
@@ -1665,20 +1670,20 @@ class z extends V {
    */
   lineTopology(t) {
     const e = [];
-    function n(s, o) {
-      const [r, l] = t[s];
-      e[s] = !0, o.push(l);
+    function n(s, r) {
+      const [o, l] = t[s];
+      e[s] = !0, r.push(l);
       for (let c = 0; c < t.length; c++) {
         const [a, h] = t[c];
         if (!e[c] && Math.abs(l.x - a.x) < 1e-6 && Math.abs(l.y - a.y) < 1e-6)
-          return n(c, o);
+          return n(c, r);
       }
     }
     const i = [];
     for (let s = 0; s < t.length; s++)
       if (!e[s]) {
-        const o = [t[s][0]];
-        n(s, o), i.push(o);
+        const r = [t[s][0]];
+        n(s, r), i.push(r);
       }
     return i;
   }
@@ -1693,8 +1698,8 @@ class z extends V {
     }
     const n = [t[0]];
     for (let i = 1; i < t.length; i++) {
-      const s = t[i], o = t[i - 1];
-      o.includedAngle(s) < e ? o.end.copy(s.end) : n.push(s);
+      const s = t[i], r = t[i - 1];
+      r.includedAngle(s) < e ? r.end.copy(s.end) : n.push(s);
     }
     return n;
   }
@@ -1707,13 +1712,13 @@ class z extends V {
     for (let n = 1; n < t.length; n++) {
       const i = t[n - 1], s = t[n];
       if (i.distance(s) < this.width * 0.5) {
-        let r = 0;
+        let o = 0;
         for (let l = n + 1; l < t.length; l++) {
           const c = t[l - 1], a = t[l];
-          if (c.distance(a) < this.width * 0.8) r++;
+          if (c.distance(a) < this.width * 0.8) o++;
           else break;
         }
-        r === 0 && n + r === t.length - 1 || n == 1 && r === 1 || (r === 3 ? (e.push(t[n + 1]), n += r) : r === 5 ? (e.push(t[n + 2]), n += r) : e.push(s));
+        o === 0 && n + o === t.length - 1 || n == 1 && o === 1 || (o === 3 ? (e.push(t[n + 1]), n += o) : o === 5 ? (e.push(t[n + 2]), n += o) : e.push(s));
       } else
         e.push(s);
     }
@@ -1726,28 +1731,28 @@ class z extends V {
    */
   lineSegmentStraightening(t) {
     for (let i = 0; i < t.length; i++) {
-      const s = t[i], o = t[(i + 1) % t.length];
-      if (s.distance(o) > this.shortLine) {
+      const s = t[i], r = t[(i + 1) % t.length];
+      if (s.distance(r) > this.shortLine) {
         t.push(...t.slice(0, i + 1)), t.splice(0, i + 1);
         break;
       }
     }
-    const e = this.mergeSameDirectionLine(_(t)), n = [e[0]];
+    const e = this.mergeSameDirectionLine(K(t)), n = [e[0]];
     for (let i = 1; i < e.length; i++) {
-      const s = e[i], o = e[(e.length + i - 1) % e.length];
+      const s = e[i], r = e[(e.length + i - 1) % e.length];
       if (s.length() > this.width * 0.9) {
         n.push(s);
         continue;
       }
-      const r = e[i + 1];
-      if (r && r.length() > this.width * 0.9) {
-        n.push(s), n.push(r), i = i + 1;
+      const o = e[i + 1];
+      if (o && o.length() > this.width * 0.9) {
+        n.push(s), n.push(o), i = i + 1;
         continue;
       }
       const l = e[i + 2];
-      l && o.includedAngle(l) < 2 ? (i = i + 2, n.push(l)) : n.push(s);
+      l && r.includedAngle(l) < 2 ? (i = i + 2, n.push(l)) : n.push(s);
     }
-    return n.length > 3 ? K(this.mergeSameDirectionLine(n)) : [];
+    return n.length > 3 ? Q(this.mergeSameDirectionLine(n)) : [];
   }
   /**
    * 移除短线段
@@ -1755,35 +1760,35 @@ class z extends V {
    * @param path 
    */
   removeShortLine(t, e = this.shortLine) {
-    const n = _(t), i = [], s = Math.PI / 180;
-    for (let o = 0; o < n.length; o++) {
-      const r = n[o], l = r.length(), c = o;
+    const n = K(t), i = [], s = Math.PI / 180;
+    for (let r = 0; r < n.length; r++) {
+      const o = n[r], l = o.length(), c = r;
       if (l > e || i.length === 0) {
-        i.push(r);
+        i.push(o);
         continue;
       }
-      let a = n[++o];
+      let a = n[++r];
       const h = i[i.length - 1], d = h.direction();
-      for (; o < n.length; ) {
+      for (; r < n.length; ) {
         const f = d.angleBetween(a.direction()) / s;
         if (a.length() <= e || f < 4 || f > 176)
-          a = n[++o];
+          a = n[++r];
         else break;
       }
       if (!a) continue;
-      const u = n[o - 1];
+      const u = n[r - 1];
       if (h.length() > u.length()) {
         const f = h.getIntersection(a);
         if (f) {
-          const y = h.points[1].clone(), p = a.points[0].clone();
-          h.points[1].copy(f), a.points[0].copy(f), h.length() < this.width ? (h.points[1].copy(y), a.points[0].copy(y)) : a.length() < this.width && (h.points[1].copy(p), a.points[0].copy(p));
+          const y = h.points[1].clone(), m = a.points[0].clone();
+          h.points[1].copy(f), a.points[0].copy(f), h.length() < this.width ? (h.points[1].copy(y), a.points[0].copy(y)) : a.length() < this.width && (h.points[1].copy(m), a.points[0].copy(m));
         } else
           h.points[1].copy(a.points[0]);
         i.push(a);
       } else
-        o = c;
+        r = c;
     }
-    return i.length > 3 ? K(i) : [];
+    return i.length > 3 ? Q(i) : [];
   }
   /** 线偏移
    * @description 使用 ClipperLib 对每个点组进行线偏移处理，生成具有指定宽度的墙体路径
@@ -1791,12 +1796,12 @@ class z extends V {
   lineOffset(t = z.EndType.etOpenSquare, e = z.JoinType.jtMiter, n = 1e4) {
     let i = new Z.Paths();
     const s = new Z.ClipperOffset(20, 0.25);
-    return this.pointsGroups.forEach((o) => {
-      const r = this.lineTopology(o).map((l) => l.map((c) => c.clone().mutiplyScalar(n)));
-      s.AddPaths(r, e, t);
-    }), s.Execute(i, this.width / 2 * n), this.wallsGroup = i.map((o) => {
-      let r = o.map((l) => g.from(l).divisionScalar(n));
-      return r = this.lineSegmentStraightening(r), t == z.EndType.etOpenSquare && (r = this.squareRemoveBurr(r)), r;
+    return this.pointsGroups.forEach((r) => {
+      const o = this.lineTopology(r).map((l) => l.map((c) => c.clone().mutiplyScalar(n)));
+      s.AddPaths(o, e, t);
+    }), s.Execute(i, this.width / 2 * n), this.wallsGroup = i.map((r) => {
+      let o = r.map((l) => g.from(l).divisionScalar(n));
+      return o = this.lineSegmentStraightening(o), t == z.EndType.etOpenSquare && (o = this.squareRemoveBurr(o)), o;
     }), this.dispatchEvent({
       type: "lineOffset",
       wallsGroup: this.wallsGroup
@@ -1809,8 +1814,8 @@ class z extends V {
     const n = [];
     return this.wallsGroup.forEach((i) => {
       for (let s = 0; s < i.length; s++) {
-        const o = i[s], r = s === i.length - 1 ? 0 : s + 1, l = i[r];
-        n.push(o.X * t, o.Y * t, e, l.X * t, l.Y * t, e);
+        const r = i[s], o = s === i.length - 1 ? 0 : s + 1, l = i[o];
+        n.push(r.X * t, r.Y * t, e, l.X * t, l.Y * t, e);
       }
     }), new Float32Array(n);
   }
@@ -1821,8 +1826,8 @@ class z extends V {
    * @returns 
    */
   getArcAngleRange(t, e, n) {
-    const i = e.x - t.x, s = e.y - t.y, o = n.x - t.x, r = n.y - t.y;
-    let l = Math.atan2(s, i), c = Math.atan2(r, o);
+    const i = e.x - t.x, s = e.y - t.y, r = n.x - t.x, o = n.y - t.y;
+    let l = Math.atan2(s, i), c = Math.atan2(o, r);
     l = l < 0 ? l + 2 * Math.PI : l, c = c < 0 ? c + 2 * Math.PI : c;
     let a, h;
     return Math.abs(c - l) <= Math.PI ? (a = Math.min(l, c), h = Math.max(l, c)) : (a = Math.max(l, c), h = Math.min(l, c) + 2 * Math.PI), [a / (Math.PI / 180), h / (Math.PI / 180)];
@@ -1831,24 +1836,22 @@ class z extends V {
    * 线段数据转为原始json数据
    */
   lineDataToOriginalData(t, e) {
-    return t.map((n) => {
-      const i = n.userData, s = i.drawWindow;
-      e = e ?? new T(C.fromByLineSegment(...t));
-      const o = e.queryLineSegment(n).filter((r) => r.line !== n && !r.userData?.isDoor).map((r) => ({ index: this.lines.indexOf(r.line) }));
+    return e || (e = new T(C.fromByLineSegment(...t)), t.forEach((n) => e?.insert({ line: n, userData: void 0 }))), t.map((n) => {
+      const i = n.userData, s = i.drawWindow, r = e.queryLineSegment(n).filter((o) => o.line !== n && !o.userData?.isDoor).map((o) => ({ index: this.lines.indexOf(o.line) }));
       return {
         start: n.start.toJson(this.originalZAverage),
         end: n.end.toJson(this.originalZAverage),
-        insetionArr: o,
+        insetionArr: r,
         isDoor: i.isDoor,
         doorDirectConnection: i.isDoor,
         length: n.length(),
         isWindow: i.isWindow,
         isVerticalReferenceLine: i.isVerticalReferenceLine,
         wallWidth: n.userData.wallWidth,
-        drawWindow: s && s.map((r) => ({
-          p: { x: r.p.x, y: r.p.y, z: r.p.z },
-          width: r.width,
-          full: r.full
+        drawWindow: s && s.map((o) => ({
+          p: { x: o.p.x, y: o.p.y, z: o.p.z },
+          width: o.width,
+          full: o.full
         }))
       };
     });
@@ -1871,7 +1874,7 @@ class z extends V {
     function s(c, a) {
       n.line.push([c.X * e, c.Y * e, a.X * e, a.Y * e, i]);
     }
-    function o(c, a, h, d) {
+    function r(c, a, h, d) {
       n.arc.push([
         c.x * e,
         c.y * e,
@@ -1894,36 +1897,36 @@ class z extends V {
         s(h, u);
       }
     });
-    const r = this.width * 0.2, l = [];
+    const o = this.width * 0.2, l = [];
     return this.doorLineSegment.forEach((c) => {
       if (c.length() < 0.4) return;
       const a = c.clone().expansion(-this.width * 0.5);
       if (i = "cyan", a.length() < 1.2) {
-        a.expansion(-r * 0.5);
+        a.expansion(-o * 0.5);
         const h = c.normal();
         let d = new I(
           a.start.clone(),
           a.start.clone().add(h.clone().multiplyScalar(a.length()))
         );
         const u = d.clone().directionMove(d.normal(), a.length() * -0.5).expandToRectangle(a.length(), "bothSides");
-        for (let b = 0; b < l.length; b++)
-          if (l[b].intersectRectangle(u)) {
+        for (let P = 0; P < l.length; P++)
+          if (l[P].intersectRectangle(u)) {
             d = new I(
               a.start.clone(),
               a.start.clone().add(h.clone().multiplyScalar(-a.length()))
             );
             break;
           }
-        d.expansion(-r * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((b, P) => s(b, P));
-        const f = a.length(), y = d.length(), p = (f ** 2 + y ** 2) / (2 * y), x = d.end.clone().add(d.direction().multiplyScalar(-p)), [D, w] = this.getArcAngleRange(x, a.end, d.end);
-        o(x, p, Math.min(D, w), Math.max(D, w)), l.push(u);
+        d.expansion(-o * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((P, b) => s(P, b));
+        const f = a.length(), y = d.length(), m = (f ** 2 + y ** 2) / (2 * y), x = d.end.clone().add(d.direction().multiplyScalar(-m)), [D, w] = this.getArcAngleRange(x, a.end, d.end);
+        r(x, m, Math.min(D, w), Math.max(D, w)), l.push(u);
       } else
-        a.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((h, d) => s(h, d)), a.clone().directionMove(a.normal(), r * 0.5).directionMove(a.direction(), r * 0.5).expansion(-a.length() * 0.45, "end").forward(r * 0.5).expandToRectangle(r).path2D((h, d) => s(h, d)), a.clone().directionMove(a.normal(), -r * 0.5).directionMove(a.direction(), -r * 0.5).expansion(-a.length() * 0.45, "start").forward(-r * 0.5).expandToRectangle(r).path2D((h, d) => s(h, d));
+        a.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((h, d) => s(h, d)), a.clone().directionMove(a.normal(), o * 0.5).directionMove(a.direction(), o * 0.5).expansion(-a.length() * 0.45, "end").forward(o * 0.5).expandToRectangle(o).path2D((h, d) => s(h, d)), a.clone().directionMove(a.normal(), -o * 0.5).directionMove(a.direction(), -o * 0.5).expansion(-a.length() * 0.45, "start").forward(-o * 0.5).expandToRectangle(o).path2D((h, d) => s(h, d));
     }), i = "yellow", this.lineSegments.forEach((c) => {
       if (!c.userData.isWindow) return !1;
       Array.isArray(c.userData.drawWindow) && c.userData.drawWindow.forEach((a) => {
-        const { p: h, width: d } = a, u = g.from(h), f = u.clone().add(c.direction().multiplyScalar(d * 0.5)), y = u.clone().add(c.direction().multiplyScalar(-d * 0.5)), p = new I(f, y);
-        s(p.start, p.end), p.expandToRectangle(this.width, "bothSides").path2D((x, D) => s(x, D));
+        const { p: h, width: d } = a, u = g.from(h), f = u.clone().add(c.direction().multiplyScalar(d * 0.5)), y = u.clone().add(c.direction().multiplyScalar(-d * 0.5)), m = new I(f, y);
+        s(m.start, m.end), m.expandToRectangle(this.width, "bothSides").path2D((x, D) => s(x, D));
       });
     }), n;
   }
@@ -1941,21 +1944,21 @@ class z extends V {
       s = c();
     } else
       throw new Error("创建画布失败");
-    const o = 2 * i.scale, r = {
+    const r = 2 * i.scale, o = {
       cyan: "cyan",
       yellow: "yellow",
       white: "white"
     };
-    s.width = i.width + o * 2, s.height = i.height + o * 2;
+    s.width = i.width + r * 2, s.height = i.height + r * 2;
     const l = s.getContext("2d");
-    return n && (l.fillStyle = n, l.fillRect(0, 0, s.width, s.height)), l.translate(i.width * 0.5 + o, i.height * 0.5 + o), i.line.forEach(([c, a, h, d, u]) => {
-      l.strokeStyle = r[u], l.beginPath(), l.moveTo(c, a), l.lineTo(h, d), l.closePath(), l.stroke();
+    return n && (l.fillStyle = n, l.fillRect(0, 0, s.width, s.height)), l.translate(i.width * 0.5 + r, i.height * 0.5 + r), i.line.forEach(([c, a, h, d, u]) => {
+      l.strokeStyle = o[u], l.beginPath(), l.moveTo(c, a), l.lineTo(h, d), l.closePath(), l.stroke();
     }), i.arc.forEach(([c, a, h, d, u, f]) => {
-      l.strokeStyle = r[f], l.beginPath(), l.arc(c, a, h, d * (Math.PI / 180), u * (Math.PI / 180)), l.stroke();
+      l.strokeStyle = o[f], l.beginPath(), l.arc(c, a, h, d * (Math.PI / 180), u * (Math.PI / 180)), l.stroke();
     }), l.beginPath(), i.dimensionLine.forEach((c) => {
       let [a, h, d, u] = c;
-      const f = Math.min(h, u), y = Math.max(h, u), p = (s.width * 0.5 - 0.4 * i.scale) * (a < 0 ? -1 : 1), x = (y - f) * 0.45;
-      l.fillStyle = "#fff", l.font = `${0.15 * i.scale}px Arial`, l.textAlign = "center", l.textBaseline = "middle", l.fillText((y - f).toFixed(2) + "cm", p, f + (y - f) * 0.5), l.moveTo(p - 0.1 * i.scale, f), l.lineTo(p + 0.1 * i.scale, f), l.moveTo(p, f), l.lineTo(p, x + f), l.moveTo(p, y), l.lineTo(p, y - x), l.moveTo(p - 0.1 * i.scale, y), l.lineTo(p + 0.1 * i.scale, y);
+      const f = Math.min(h, u), y = Math.max(h, u), m = (s.width * 0.5 - 0.4 * i.scale) * (a < 0 ? -1 : 1), x = (y - f) * 0.45;
+      l.fillStyle = "#fff", l.font = `${0.15 * i.scale}px Arial`, l.textAlign = "center", l.textBaseline = "middle", l.fillText((y - f).toFixed(2) + "cm", m, f + (y - f) * 0.5), l.moveTo(m - 0.1 * i.scale, f), l.lineTo(m + 0.1 * i.scale, f), l.moveTo(m, f), l.lineTo(m, x + f), l.moveTo(m, y), l.lineTo(m, y - x), l.moveTo(m - 0.1 * i.scale, y), l.lineTo(m + 0.1 * i.scale, y);
     }), l.closePath(), l.strokeStyle = "#fff", l.stroke(), "toBlob" in s ? new Promise((c) => {
       s.toBlob((a) => {
         c(a);
@@ -1970,11 +1973,11 @@ class z extends V {
     e.setUnits(t), e.addLayer("cyan", W.ACI.CYAN, "DOTTED"), e.addLayer("yellow", W.ACI.YELLOW, "DOTTED"), e.addLayer("white", W.ACI.WHITE, "DOTTED");
     const n = this.toDrawDataJson();
     return n.line.forEach((i) => {
-      let [s, o, r, l, c] = i;
-      e.setActiveLayer(c), e.drawLine(s, o, r, l);
+      let [s, r, o, l, c] = i;
+      e.setActiveLayer(c), e.drawLine(s, r, o, l);
     }), n.arc.forEach((i) => {
-      const [s, o, r, l, c, a] = i;
-      e.setActiveLayer(a), e.drawArc(s, o, r, l, c);
+      const [s, r, o, l, c, a] = i;
+      e.setActiveLayer(a), e.drawArc(s, r, o, l, c);
     }), e.toDxfString();
   }
   /**
@@ -2024,8 +2027,8 @@ class z extends V {
    * @returns 
    */
   computedOriginalSize(t, e = new C(0, 0, 0, 0)) {
-    const n = t.flatMap((c) => [c.start.x, c.end.x]), i = t.flatMap((c) => [c.start.y, c.end.y]), s = Math.min(...n), o = Math.min(...i), r = Math.max(...n), l = Math.max(...i);
-    return e.set(s, o, r, l), e;
+    const n = t.flatMap((c) => [c.start.x, c.end.x]), i = t.flatMap((c) => [c.start.y, c.end.y]), s = Math.min(...n), r = Math.min(...i), o = Math.max(...n), l = Math.max(...i);
+    return e.set(s, r, o, l), e;
   }
   /**
    * 创建数据
@@ -2035,10 +2038,10 @@ class z extends V {
   static createData(t, e = !0) {
     let n = 0;
     return t.flatMap((s) => {
-      const o = s.map((r, l) => {
+      const r = s.map((o, l) => {
         const c = l === s.length - 1 ? 0 : l + 1, a = s[c];
         return {
-          start: { x: r.x, y: r.y },
+          start: { x: o.x, y: o.y },
           end: { x: a.x, y: a.y },
           insetionArr: [
             {
@@ -2047,7 +2050,7 @@ class z extends V {
           ]
         };
       });
-      return n += s.length, e || (o.pop(), o[o.length - 1].insetionArr.length = 0, n--), o;
+      return n += s.length, e || (r.pop(), r[r.length - 1].insetionArr.length = 0, n--), r;
     });
   }
 }
@@ -2084,15 +2087,15 @@ class ht extends z {
       const [c, a] = s.start.y < s.end.y ? [s.start, s.end] : [s.end, s.start];
       i = -new I(c, a).direction().angleBetween(new g(0, 1), "angle", "360");
     }
-    const o = e.originalBox.center, r = g.zero(), l = e.originalData.map((c) => {
-      const a = r.copy(c.start).division(o).rotate(g.zero(), i * (Math.PI / 180)).toJson(c.start.z), h = r.copy(c.end).division(o).rotate(g.zero(), i * (Math.PI / 180)).toJson(c.end.z), d = Object.assign($(c), { start: a, end: h });
+    const r = e.originalBox.center, o = g.zero(), l = e.originalData.map((c) => {
+      const a = o.copy(c.start).division(r).rotate(g.zero(), i * (Math.PI / 180)).toJson(c.start.z), h = o.copy(c.end).division(r).rotate(g.zero(), i * (Math.PI / 180)).toJson(c.end.z), d = Object.assign($(c), { start: a, end: h });
       return d.drawWindow && d.drawWindow.forEach((u) => {
-        u.p = r.copy(u.p).division(o).rotate(g.zero(), i * (Math.PI / 180)).toJson(u.p.z);
+        u.p = o.copy(u.p).division(r).rotate(g.zero(), i * (Math.PI / 180)).toJson(u.p.z);
       }), d;
     });
     n.appendLineSegmentList.forEach((c) => {
       const a = c.clone();
-      a.start.division(o).rotate(g.zero(), i * (Math.PI / 180)), a.end.division(o).rotate(g.zero(), i * (Math.PI / 180)), l.push({
+      a.start.division(r).rotate(g.zero(), i * (Math.PI / 180)), a.end.division(r).rotate(g.zero(), i * (Math.PI / 180)), l.push({
         start: a.start.toJson(e.originalZAverage),
         end: a.end.toJson(e.originalZAverage),
         insetionArr: [],
@@ -2100,7 +2103,7 @@ class ht extends z {
       });
     }), await this.set(l, e.width, e.scale), this.lineOffset(), this.doorLineSegment = e.doorLineSegment.map((c) => {
       const a = c.clone();
-      return a.start.division(o).rotate(g.zero(), i * (Math.PI / 180)), a.end.division(o).rotate(g.zero(), i * (Math.PI / 180)), a;
+      return a.start.division(r).rotate(g.zero(), i * (Math.PI / 180)), a.end.division(r).rotate(g.zero(), i * (Math.PI / 180)), a;
     }), this.angle = i, this.dispatchEvent({
       type: "updateData"
     });
@@ -2157,16 +2160,16 @@ class dt {
     }), this.doorPoint = this.getDoorPoint(), !this.continueFind) return;
     const e = this.searchDoubleLinePoint();
     this.addPointsExcludeRule((n, i, s) => {
-      const o = this.lineSegments.indexOf(n), r = e.get(o);
-      return typeof r == "number" ? r === -1 || r === s : !1;
+      const r = this.lineSegments.indexOf(n), o = e.get(r);
+      return typeof o == "number" ? o === -1 || o === s : !1;
     }), this.addPointsExcludeRule((n, i) => !!this.doorPoint.find((s) => s.point.equal(i))), this.possibleDoorPoints = this.getPossiblePoints(), this.possibleDoorPoints.forEach((n) => this.findPointVirtualGrid.insert(n.point, n.line)), this.handle();
   }
   handle() {
     this.dxf.doorLineSegment.push(...this.search(this.doorPoint, this.possibleDoorPoints, 0.5)), this.doorPoint.length < 2 && this.dxf.doorLineSegment.push(...this.search(this.possibleDoorPoints, this.possibleDoorPoints, 0.6));
   }
   search(t, e = [], n = 0.6, i = this.doorSearchDistance, s = this.doorSearchNearAngle) {
-    const o = this.dxf, r = this.searchNearby(t, e, i, s);
-    r.push(
+    const r = this.dxf, o = this.searchNearby(t, e, i, s);
+    o.push(
       ...t.map((c) => {
         const a = this.searchAlongDirection(c, i);
         if (a) return {
@@ -2181,14 +2184,14 @@ class dt {
       }).filter((c) => !!c && c.start.distance(c.end) < i)
     );
     const l = [];
-    return r.forEach((c) => {
+    return o.forEach((c) => {
       const a = new I(c?.start, c?.end), h = a.length();
       if (h < n) return;
-      const d = a.normal(), u = a.direction(), f = (h - o.width * 2) / 2;
+      const d = a.normal(), u = a.direction(), f = (h - r.width * 2) / 2;
       for (let y = 0; y < 3; y++) {
-        const p = a.start.clone().add(u.clone().multiplyScalar(o.width + f * y)), x = new I(
-          p,
-          p.clone().add(d.clone().multiplyScalar(1))
+        const m = a.start.clone().add(u.clone().multiplyScalar(r.width + f * y)), x = new I(
+          m,
+          m.clone().add(d.clone().multiplyScalar(1))
         );
         if (x.directionMove(d, -0.5), this.quadtree.queryLineSegment(x).length) return;
       }
@@ -2209,8 +2212,8 @@ class dt {
     const t = [];
     return this.lineSegments.forEach((e) => {
       e.points.forEach((n, i) => {
-        for (let o = 0; o < this._pointsExcludeRule.length; o++) if (this._pointsExcludeRule[o](e, n, i)) return;
-        this.pointVirtualGrid.queryPoint(n).filter((o) => o.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: k() });
+        for (let r = 0; r < this._pointsExcludeRule.length; r++) if (this._pointsExcludeRule[r](e, n, i)) return;
+        this.pointVirtualGrid.queryPoint(n).filter((r) => r.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: k() });
       });
     }), t;
   }
@@ -2220,27 +2223,27 @@ class dt {
   getDoorPoint() {
     const t = [], e = this.dxf, n = this.pointVirtualGrid;
     return e.doors.forEach((i) => {
-      const s = e.lineSegments[i[4]], o = e.originalData[i[4]];
-      if (o.drawDoorData) {
-        const r = g.from(o.drawDoorData.start), l = g.from(o.drawDoorData.n), c = n.queryPoint(r).filter((a) => {
+      const s = e.lineSegments[i[4]], r = e.originalData[i[4]];
+      if (r.drawDoorData) {
+        const o = g.from(r.drawDoorData.start), l = g.from(r.drawDoorData.n), c = n.queryPoint(o).filter((a) => {
           if (a.userData === s) return !1;
           const h = a.userData, d = h.direction();
-          h.start.equal(r) && d.multiplyScalar(-1);
+          h.start.equal(o) && d.multiplyScalar(-1);
           const u = l.angleBetween(d, "angle");
           return u > 80 || u < 10;
         });
         c.length && t.push({
           line: c[0].userData,
-          point: r,
+          point: o,
           uuid: k()
         });
-      } else if (o.doorDirectConnection) {
+      } else if (r.doorDirectConnection) {
         this.continueFind = !1;
-        const r = new I(g.from(o.start), g.from(o.end));
-        r.userData = {
+        const o = new I(g.from(r.start), g.from(r.end));
+        o.userData = {
           doorDirectConnection: !0,
           isDoor: !0
-        }, this.dxf.doorLineSegment.push(r);
+        }, this.dxf.doorLineSegment.push(o);
       } else
         console.warn(`门的线段顺序${i[4]} 没有drawDoorData属性`);
     }), t;
@@ -2252,7 +2255,7 @@ class dt {
   searchDoubleLinePoint() {
     const t = /* @__PURE__ */ new Map();
     return this.resultList.flatMap((e) => {
-      const n = this.lineSegments[e.sourceIndex], i = this.lineSegments[e.targetIndex], s = i.projectPoint(n.start), o = i.projectPoint(n.end), r = n.projectPoint(i.start), l = n.projectPoint(i.end), c = s && o ? -1 : s ? 0 : o ? 1 : -1, a = r && l ? -1 : r ? 0 : l ? 1 : -1;
+      const n = this.lineSegments[e.sourceIndex], i = this.lineSegments[e.targetIndex], s = i.projectPoint(n.start), r = i.projectPoint(n.end), o = n.projectPoint(i.start), l = n.projectPoint(i.end), c = s && r ? -1 : s ? 0 : r ? 1 : -1, a = o && l ? -1 : o ? 0 : l ? 1 : -1;
       t.has(e.sourceIndex) ? t.get(e.sourceIndex) != c && t.set(e.sourceIndex, -1) : t.set(e.sourceIndex, c), t.has(e.targetIndex) ? t.get(e.targetIndex) != a && t.set(e.targetIndex, -1) : t.set(e.targetIndex, a);
     }), t;
   }
@@ -2265,94 +2268,94 @@ class dt {
    * @returns 
    */
   searchNearby(t, e = [], n = this.doorSearchDistance, i = this.doorSearchNearAngle) {
-    const s = this.findPointVirtualGrid, o = this.quadtree;
-    function r({ point: p, line: x }, D, w) {
-      const b = x.direction();
-      x.start === p && b.multiplyScalar(-1);
-      const P = s.queryCircle(p, n).filter((m) => m.userData !== x).sort((m, A) => m.point.distance(p) - A.point.distance(p)), S = [];
-      for (let m = 0; m < P.length; m++) {
-        const A = e.findIndex((j) => j.point === P[m].point), E = t[D].uuid, L = e[A].uuid;
-        if (w.has(`${E}.${L}`)) continue;
-        w.add(`${E}.${L}`), w.add(`${L}.${E}`);
-        const v = P[m].point, B = new I(p.clone(), v.clone());
-        if (B.direction().angleBetween(b, "angle") < i) {
+    const s = this.findPointVirtualGrid, r = this.quadtree;
+    function o({ point: m, line: x }, D, w) {
+      const P = x.direction();
+      x.start === m && P.multiplyScalar(-1);
+      const b = s.queryCircle(m, n).filter((p) => p.userData !== x).sort((p, A) => p.point.distance(m) - A.point.distance(m)), L = [];
+      for (let p = 0; p < b.length; p++) {
+        const A = e.findIndex((j) => j.point === b[p].point), E = t[D].uuid, S = e[A].uuid;
+        if (w.has(`${E}.${S}`)) continue;
+        w.add(`${E}.${S}`), w.add(`${S}.${E}`);
+        const v = b[p].point, B = new I(m.clone(), v.clone());
+        if (B.direction().angleBetween(P, "angle") < i) {
           const j = t[A].line.direction();
-          P[m].userData.start.equal(P[m].point) && j.multiplyScalar(-1), B.direction().multiplyScalar(-1).angleBetween(j, "angle") < i && (o.queryLineSegment(B).length || S.push({
-            findData: P[m],
-            findUuid: L,
+          b[p].userData.start.equal(b[p].point) && j.multiplyScalar(-1), B.direction().multiplyScalar(-1).angleBetween(j, "angle") < i && (r.queryLineSegment(B).length || L.push({
+            findData: b[p],
+            findUuid: S,
             doorLine: B,
             doorUuid: E
           }));
         }
       }
-      return S;
+      return L;
     }
-    function l(p, x, D, w, b) {
-      w.add(p);
-      const P = [];
-      b && P.push(b);
-      for (let S = 0; S < D.length; S++) {
-        const m = D[S];
-        if (x.has(m.findUuid)) {
-          const A = x.get(m.findUuid);
-          l(m.findUuid, x, A, w, m) && P.push(m);
-        } else P.push(m);
+    function l(m, x, D, w, P) {
+      w.add(m);
+      const b = [];
+      P && b.push(P);
+      for (let L = 0; L < D.length; L++) {
+        const p = D[L];
+        if (x.has(p.findUuid)) {
+          const A = x.get(p.findUuid);
+          l(p.findUuid, x, A, w, p) && b.push(p);
+        } else b.push(p);
       }
-      return P.sort((S, m) => S.doorLine.length() - m.doorLine.length()), b && P[0] === b ? (D.splice(0), !0) : (D.splice(1), !1);
+      return b.sort((L, p) => L.doorLine.length() - p.doorLine.length()), P && b[0] === P ? (D.splice(0), !0) : (D.splice(1), !1);
     }
     const c = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Map();
-    t.map((p, x) => {
-      const D = r(p, x, c);
-      D.length && a.set(p.uuid, D);
+    t.map((m, x) => {
+      const D = o(m, x, c);
+      D.length && a.set(m.uuid, D);
     }), c.clear();
     const h = /* @__PURE__ */ new Map();
-    a.forEach((p, x) => {
-      if (!c.has(x) && p.length && l(x, a, p, c), p.length) {
-        const D = p[0];
+    a.forEach((m, x) => {
+      if (!c.has(x) && m.length && l(x, a, m, c), m.length) {
+        const D = m[0];
         h.has(D.doorUuid) || h.set(D.doorUuid, []), h.get(D.doorUuid)?.push(D), h.has(D.findUuid) || h.set(D.findUuid, []), h.get(D.findUuid)?.push(D);
       }
     });
     const d = /* @__PURE__ */ new Set();
-    h.forEach((p) => {
-      if (p.length > 1) {
-        p.sort((x, D) => x.doorLine.length() - D.doorLine.length());
-        for (let x = 1; x < p.length; x++) d.add(p[x]);
+    h.forEach((m) => {
+      if (m.length > 1) {
+        m.sort((x, D) => x.doorLine.length() - D.doorLine.length());
+        for (let x = 1; x < m.length; x++) d.add(m[x]);
       }
     });
     const u = [], f = [];
-    a.forEach((p) => {
-      if (p.length) {
-        const x = p[0];
+    a.forEach((m) => {
+      if (m.length) {
+        const x = m[0];
         d.has(x) || (u.push(x), f.push(x.doorUuid, x.findUuid));
       }
     });
     const y = [];
-    return u.forEach((p) => {
-      const x = t.findIndex((A) => A.uuid === p.doorUuid), D = e.findIndex((A) => A.uuid === p.findUuid), w = t[x].point.clone(), b = e[D].point.clone(), P = this.findLongLineSegment(t[x].line), S = this.findLongLineSegment(e[D].line), m = P.projectPoint(b);
-      if (m) {
-        w.copy(m);
-        const A = new I(w, b), E = S.includedAngle(A);
+    return u.forEach((m) => {
+      const x = t.findIndex((A) => A.uuid === m.doorUuid), D = e.findIndex((A) => A.uuid === m.findUuid), w = t[x].point.clone(), P = e[D].point.clone(), b = this.findLongLineSegment(t[x].line), L = this.findLongLineSegment(e[D].line), p = b.projectPoint(P);
+      if (p) {
+        w.copy(p);
+        const A = new I(w, P), E = L.includedAngle(A);
         (E < 10 || E > 170 || Math.abs(90 - E) < 10) && y.push({
           start: w,
-          end: b
+          end: P
         });
       } else {
-        const A = S.projectPoint(w);
-        A && b.copy(A);
-        const E = new I(w, b), L = P.includedAngle(E);
-        (L < 10 || L > 170 || Math.abs(90 - L) < 10) && y.push({
+        const A = L.projectPoint(w);
+        A && P.copy(A);
+        const E = new I(w, P), S = b.includedAngle(E);
+        (S < 10 || S > 170 || Math.abs(90 - S) < 10) && y.push({
           start: w,
-          end: b
+          end: P
         });
       }
     }), e.splice(
       0,
       e.length,
-      ...e.filter((p) => f.indexOf(p.uuid) === -1)
+      ...e.filter((m) => f.indexOf(m.uuid) === -1)
     ), t.splice(
       0,
       t.length,
-      ...t.filter((p) => f.indexOf(p.uuid) === -1)
+      ...t.filter((m) => f.indexOf(m.uuid) === -1)
     ), y;
   }
   /** 方案二： 沿方向查找
@@ -2363,8 +2366,8 @@ class dt {
   searchAlongDirection({ point: t, line: e }, n = this.doorSearchDistance) {
     const i = this.quadtree, s = e.direction();
     e.start === t && s.multiplyScalar(-1);
-    const o = t.clone().add(s.clone().multiplyScalar(n)), r = new I(t.clone(), o), l = i.queryLineSegment(r).map((c) => ({
-      point: c.line.getIntersection(r),
+    const r = t.clone().add(s.clone().multiplyScalar(n)), o = new I(t.clone(), r), l = i.queryLineSegment(o).map((c) => ({
+      point: c.line.getIntersection(o),
       line: c.line
     })).filter((c) => c.point).sort((c, a) => t.distance(c.point) - t.distance(a.point));
     if (l.length) {
@@ -2380,23 +2383,23 @@ class dt {
    * @returns 
    */
   searchAlongNormalDirection({ point: t, line: e }, n = this.doorSearchDistance) {
-    const i = this.pointVirtualGrid, s = this.quadtree, o = e.direction(), r = e.start.normal(e.end), l = e.start.clone();
-    e.start === t && o.multiplyScalar(-1), e.start === t && l.copy(e.end);
+    const i = this.pointVirtualGrid, s = this.quadtree, r = e.direction(), o = e.start.normal(e.end), l = e.start.clone();
+    e.start === t && r.multiplyScalar(-1), e.start === t && l.copy(e.end);
     const c = i.queryPoint(l).filter((d) => d.userData !== e);
     for (let d = 0; d < c.length; d++) {
       const u = c[d], f = u.userData, y = f.direction();
-      if (f.start === u.point && o.multiplyScalar(-1), y.angleBetween(r) / (Math.PI / 180) > 90) {
-        r.multiplyScalar(-1);
+      if (f.start === u.point && r.multiplyScalar(-1), y.angleBetween(o) / (Math.PI / 180) > 90) {
+        o.multiplyScalar(-1);
         break;
       }
     }
-    const a = new I(t.clone(), t.clone().add(r.multiplyScalar(n))), h = s.queryLineSegment(a).map((d) => ({
+    const a = new I(t.clone(), t.clone().add(o.multiplyScalar(n))), h = s.queryLineSegment(a).map((d) => ({
       point: d.line.getIntersection(a),
       line: d.line
     })).filter((d) => d.point).sort((d, u) => t.distance(d.point) - t.distance(u.point));
     if (h.length) {
       const d = h[0];
-      if (Math.abs(90 - d.line.direction().angleBetween(r, "angle")) < 5)
+      if (Math.abs(90 - d.line.direction().angleBetween(o, "angle")) < 5)
         return d;
     }
   }
@@ -2408,16 +2411,16 @@ class dt {
   findLongLineSegment(t) {
     const e = t.clone(), n = this.pointVirtualGrid.queryPoint(t.start), i = this.pointVirtualGrid.queryPoint(t.end);
     for (let s = 0; s < n.length; s++) {
-      const { userData: o } = n[s];
-      if (o !== t && o && o.directionEqual(t)) {
-        o.start.equal(t.start) ? e.start.copy(o.end) : e.start.copy(o.start);
+      const { userData: r } = n[s];
+      if (r !== t && r && r.directionEqual(t)) {
+        r.start.equal(t.start) ? e.start.copy(r.end) : e.start.copy(r.start);
         break;
       }
     }
     for (let s = 0; s < i.length; s++) {
-      const { userData: o } = i[s];
-      if (o !== t && o && o.directionEqual(t)) {
-        o.end.equal(t.end) ? e.end.copy(o.start) : e.end.copy(o.end);
+      const { userData: r } = i[s];
+      if (r !== t && r && r.directionEqual(t)) {
+        r.end.equal(t.end) ? e.end.copy(r.start) : e.end.copy(r.end);
         break;
       }
     }
@@ -2448,15 +2451,15 @@ class ut extends V {
    * @returns 
    */
   expandLineSegment(t, e, n = 0.1) {
-    const i = e.normal(t), s = e.direction(t).mutiplyScalar(n * 0.5), o = t.direction(e).mutiplyScalar(n * 0.5), r = i.x * n * 0.5, l = i.y * n * 0.5;
+    const i = e.normal(t), s = e.direction(t).mutiplyScalar(n * 0.5), r = t.direction(e).mutiplyScalar(n * 0.5), o = i.x * n * 0.5, l = i.y * n * 0.5;
     return {
       points: [
         // 第一条线
-        new g(t.x + r, t.y + l).add(o),
-        new g(e.x + r, e.y + l).add(s),
+        new g(t.x + o, t.y + l).add(r),
+        new g(e.x + o, e.y + l).add(s),
         // 第二条线
-        new g(t.x - r, t.y - l).add(o),
-        new g(e.x - r, e.y - l).add(s)
+        new g(t.x - o, t.y - l).add(r),
+        new g(e.x - o, e.y - l).add(s)
       ],
       indices: [0, 1, 1, 3, 3, 2, 2, 0],
       rectIndices: [0, 1, 3, 2, 0]
@@ -2478,14 +2481,14 @@ class ut extends V {
   createRectangle(t) {
     const e = this.Dxf, n = t.project, i = t.project2;
     n.includedAngle(i) > 135 && (i.points = [i.points[1], i.points[0]]), this.addData(n.points[0], i.points[0]), this.addData(n.points[1], i.points[1]);
-    const s = n.points[0].distance(i.points[0]), o = n.points[1].distance(i.points[1]), r = Math.ceil(Math.max(s, o) / e.width), l = s / r, c = o / r, a = i.points[0].direction(n.points[0]), h = i.points[1].direction(n.points[1]), d = n.points[0].clone(), u = n.points[1].clone(), f = u.direction(d);
+    const s = n.points[0].distance(i.points[0]), r = n.points[1].distance(i.points[1]), o = Math.ceil(Math.max(s, r) / e.width), l = s / o, c = r / o, a = i.points[0].direction(n.points[0]), h = i.points[1].direction(n.points[1]), d = n.points[0].clone(), u = n.points[1].clone(), f = u.direction(d);
     f.multiplyScalar(e.width * 0.5);
-    const y = d.clone().add(f), p = u.clone().add(f.multiplyScalar(-1)), x = d.direction(u), D = y.direction(p);
+    const y = d.clone().add(f), m = u.clone().add(f.multiplyScalar(-1)), x = d.direction(u), D = y.direction(m);
     if (!(x.x > 0 && D.x < 0 || x.x < 0 && D.x > 0 || x.y > 0 && D.y < 0 || x.y < 0 && D.y > 0)) {
-      d.set(y.x, y.y), u.set(p.x, p.y);
-      for (let w = 1; w < r; w++) {
-        const b = a.clone().multiplyScalar(l * w), P = h.clone().multiplyScalar(c * w), S = d.clone().add(b), m = u.clone().add(P);
-        this.addData(S, m);
+      d.set(y.x, y.y), u.set(m.x, m.y);
+      for (let w = 1; w < o; w++) {
+        const P = a.clone().multiplyScalar(l * w), b = h.clone().multiplyScalar(c * w), L = d.clone().add(P), p = u.clone().add(b);
+        this.addData(L, p);
       }
     }
   }
@@ -2511,13 +2514,13 @@ class ut extends V {
   lineAnalysis() {
     this.buildQuadtree();
     const t = this.quadtree, e = this.lineSegmentList, n = /* @__PURE__ */ new Set(), i = [];
-    e.forEach((s, o) => {
-      const r = e[o], l = J.fromByLineSegment(r, this.width * 2, !1, -0.01);
-      t.queryRect(l).map((a) => a.userData).filter((a) => a !== o).forEach((a) => {
+    e.forEach((s, r) => {
+      const o = e[r], l = J.fromByLineSegment(o, this.width * 2, !1, -0.01);
+      t.queryRect(l).map((a) => a.userData).filter((a) => a !== r).forEach((a) => {
         try {
-          if (n.has(`${o}-${a}`) || n.has(`${a}-${o}`)) return;
-          const h = this.projectionAnalysis(a, o, r, e);
-          h && i.push(h), n.add(`${o}-${a}`);
+          if (n.has(`${r}-${a}`) || n.has(`${a}-${r}`)) return;
+          const h = this.projectionAnalysis(a, r, o, e);
+          h && i.push(h), n.add(`${r}-${a}`);
         } catch {
         }
       });
@@ -2530,7 +2533,7 @@ class ut extends V {
    * @returns 
    */
   projectionAnalysis(t, e, n, i) {
-    const s = i[t], o = n.direction(), r = s.direction(), l = o.angleBetween(r) / (Math.PI / 180);
+    const s = i[t], r = n.direction(), o = s.direction(), l = r.angleBetween(o) / (Math.PI / 180);
     if (l < this.errorAngle || l > 180 - this.errorAngle) {
       let c;
       const a = s.projectLineSegment(n), h = n.projectLineSegment(s);
@@ -2571,22 +2574,22 @@ class ft extends V {
     const t = this.parent?.findComponentByName("LineAnalysis"), e = this.parent?.findComponentByName("Dxf");
     this.parent?.findComponentByName("Renderer");
     const n = this.parent?.findComponentByName("AngleCorrectionDxf"), i = /* @__PURE__ */ new Map();
-    let s = [...e.lineSegments], o = [], r = [];
+    let s = [...e.lineSegments], r = [], o = [];
     t.resultList.forEach((a) => {
       const h = i.get(a.target) ?? [], d = i.get(a.source) ?? [], u = a.project.clone(), f = a.project2.clone();
       u.includedAngle(f) > 135 && (f.points = [f.points[1], f.points[0]]), h.push(...u.points), d.push(...f.points), i.set(a.target, h), i.set(a.source, d);
-      const y = new I(u.start, f.start), p = new I(u.end, f.end), x = new I(y.center, p.center);
-      x.userData.wallWidth = Math.max(y.length(), p.length()), o.push(x);
+      const y = new I(u.start, f.start), m = new I(u.end, f.end), x = new I(y.center, m.center);
+      x.userData.wallWidth = Math.max(y.length(), m.length()), r.push(x);
     });
     const l = [];
     s = s.filter((a) => {
-      if (r.indexOf(a) > -1) return !1;
+      if (o.indexOf(a) > -1) return !1;
       if (i.has(a)) {
         const h = i.get(a), d = a.clone();
         if (h) {
           for (let f = 0; f < h.length; f += 2) {
-            const y = h[f], p = h[f + 1];
-            y.userData.length = y.distance(d.start), p.userData.length = p.distance(d.start), y.userData.type = "start", p.userData.type = "end", d.start.distance(y) > d.start.distance(p) && (h[f] = p, h[f + 1] = y, y.userData.type = "end", p.userData.type = "start");
+            const y = h[f], m = h[f + 1];
+            y.userData.length = y.distance(d.start), m.userData.length = m.distance(d.start), y.userData.type = "start", m.userData.type = "end", d.start.distance(y) > d.start.distance(m) && (h[f] = m, h[f + 1] = y, y.userData.type = "end", m.userData.type = "start");
           }
           h.sort((f, y) => f.userData.length - y.userData.length);
           const u = [];
@@ -2599,7 +2602,7 @@ class ft extends V {
         return !1;
       }
       return !0;
-    }), s.push(...o), s.push(...l.filter((a) => a.length() > 0.05));
+    }), s.push(...r), s.push(...l.filter((a) => a.length() > 0.05));
     const c = e.box.center;
     s = s.map((a) => {
       const h = a.clone();
@@ -2650,17 +2653,17 @@ class ft extends V {
           };
         if (i.userData.isWindow)
           return i.userData.drawWindow.map((s) => {
-            const o = g.from(s.p), r = o.clone().add(
+            const r = g.from(s.p), o = r.clone().add(
               i.direction().multiplyScalar(s.width * 0.5)
-            ), l = o.clone().add(
+            ), l = r.clone().add(
               i.direction().multiplyScalar(-s.width * 0.5)
             );
             return {
               id: n++,
               type: "WINDOW",
               start: {
-                x: r.x * 1,
-                y: r.y * 1
+                x: o.x * 1,
+                y: o.y * 1
               },
               end: {
                 x: l.x * 1,
@@ -2710,17 +2713,17 @@ class pt extends ct {
     });
   }
 }
-const mt = new rt(), xt = new at();
+const mt = new ot(), xt = new at();
 function yt(M, t, e = 0.1) {
-  const n = t.normal(M), i = t.direction(M).mutiplyScalar(e * 0.5), s = M.direction(t).mutiplyScalar(e * 0.5), o = n.x * e * 0.5, r = n.y * e * 0.5;
+  const n = t.normal(M), i = t.direction(M).mutiplyScalar(e * 0.5), s = M.direction(t).mutiplyScalar(e * 0.5), r = n.x * e * 0.5, o = n.y * e * 0.5;
   return {
     points: [
       // 第一条线
-      new g(M.x + o, M.y + r).add(s),
-      new g(t.x + o, t.y + r).add(i),
+      new g(M.x + r, M.y + o).add(s),
+      new g(t.x + r, t.y + o).add(i),
       // 第二条线
-      new g(M.x - o, M.y - r).add(s),
-      new g(t.x - o, t.y - r).add(i)
+      new g(M.x - r, M.y - o).add(s),
+      new g(t.x - r, t.y - o).add(i)
     ],
     indices: [0, 1, 1, 3, 3, 2, 2, 0],
     rectIndices: [0, 1, 3, 2, 0]
@@ -2747,16 +2750,16 @@ class nt extends V {
     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 i = new q.Shape();
-      n.forEach((r, l) => l === 0 ? i.moveTo(r.x / t.scale, r.y / t.scale) : i.lineTo(r.x / t.scale, r.y / t.scale));
+      n.forEach((o, l) => l === 0 ? i.moveTo(o.x / t.scale, o.y / t.scale) : i.lineTo(o.x / t.scale, o.y / t.scale));
       const s = new q.ExtrudeGeometry(i, {
         depth: 2.8,
         bevelSize: 0
-      }), o = new q.Mesh(s, this.material);
-      this.whiteModelGroup.add(o), this.whiteModelLineGroup.add(
+      }), r = new q.Mesh(s, this.material);
+      this.whiteModelGroup.add(r), this.whiteModelLineGroup.add(
         new q.LineSegments(new q.EdgesGeometry(s), new q.LineBasicMaterial({ color: 0 }))
       );
     }), t.originalData.map(({ start: n, end: i, insetionArr: s }) => {
-      const o = new g(n.x, n.y).mutiplyScalar(t.scale), r = new g(i.x, i.y).mutiplyScalar(t.scale), { points: l, indices: c, rectIndices: a } = yt(o, r, t.width);
+      const r = new g(n.x, n.y).mutiplyScalar(t.scale), o = new g(i.x, i.y).mutiplyScalar(t.scale), { points: l, indices: c, rectIndices: a } = yt(r, o, t.width);
       return {
         points: l,
         indices: c,
@@ -2765,17 +2768,17 @@ class nt extends V {
       };
     }).forEach((n) => {
       const i = new q.Shape();
-      n.rectIndices.forEach((r, l) => {
-        const c = n.points[r];
+      n.rectIndices.forEach((o, l) => {
+        const c = n.points[o];
         l === 0 ? i.moveTo(c.x, c.y) : i.lineTo(c.x, c.y);
       });
       const s = new q.ExtrudeGeometry(i, {
         depth: 2.8,
         bevelSize: 0
       });
-      if (s.attributes.position.array.filter((r) => Number.isNaN(r)).length) return;
-      const o = new q.Mesh(s);
-      this.originalWhiteMode?.add(o);
+      if (s.attributes.position.array.filter((o) => Number.isNaN(o)).length) return;
+      const r = new q.Mesh(s);
+      this.originalWhiteMode?.add(r);
     }), this.dispatchEvent({
       type: "updateModel",
       originalWhiteMode: this.originalWhiteMode,
@@ -2811,12 +2814,12 @@ class nt extends V {
           });
         else if (typeof global != "function")
           try {
-            const n = await O("obj2gltf", !0), i = await O("fs", !1), s = await this.toOBJ(), o = Date.now().toString(16) + "-" + Math.floor(Math.random() * 16777215).toString(16);
-            i.writeFileSync(o, s ?? "存贮失败");
-            const r = await n(o, {
+            const n = await O("obj2gltf", !0), i = await O("fs", !1), s = await this.toOBJ(), r = Date.now().toString(16) + "-" + Math.floor(Math.random() * 16777215).toString(16);
+            i.writeFileSync(r, s ?? "存贮失败");
+            const o = await n(r, {
               binary: t
             });
-            i.unlinkSync(o), e(t ? r : JSON.stringify(r));
+            i.unlinkSync(r), e(t ? o : JSON.stringify(o));
           } catch (n) {
             e(void 0), console.log(n);
           }
@@ -2935,9 +2938,9 @@ class it extends V {
           e.direction.z
         ), s = 100;
         this.racasterHelper(n, i, s), i.z = 0;
-        const r = new q.Raycaster(n, i, 0, s).intersectObject(t.originalWhiteMode);
-        if (r.length) {
-          const { point: l } = r[0];
+        const o = new q.Raycaster(n, i, 0, s).intersectObject(t.originalWhiteMode);
+        if (o.length) {
+          const { point: l } = o[0];
           this.desPoints.push({
             message: e.desc,
             position: n,
@@ -2966,7 +2969,7 @@ class st extends V {
     const e = t.to3DArray(1 / t.scale, 0);
     this.dxfLineModel.geometry = new q.BufferGeometry().setAttribute("position", new q.BufferAttribute(e, 3, !0));
     const n = new Float32Array(
-      t.doorLineSegment.flatMap(({ start: s, end: o }) => [s.x, s.y, 0, o.x, o.y, 0])
+      t.doorLineSegment.flatMap(({ start: s, end: r }) => [s.x, s.y, 0, r.x, r.y, 0])
     ).map((s) => s / t.scale), i = new Float32Array(t.doorLineSegment.flatMap(() => [1, 0, 0, 0, 1, 0]));
     this.dxfDoorsLineModel.geometry = new q.BufferGeometry().setAttribute("position", new q.BufferAttribute(n, 3, !0)).setAttribute("color", new q.BufferAttribute(i, 3)), this.dxfModelGroup.position.z = t.originalZAverage, this.dispatchEvent({
       type: "modelUpdate",
@@ -2980,7 +2983,7 @@ const gt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   DxfLineModel: st,
   WhiteModel: nt
 }, Symbol.toStringTag, { value: "Module" }));
-function Q(M, t = {}) {
+function _(M, t = {}) {
   const {
     detailsPoint: e = !0,
     whiteModel: n = !0,
@@ -2988,9 +2991,9 @@ function Q(M, t = {}) {
   } = t;
   i && M.addComponent(new st()), n && M.addComponent(new nt()), e && M.addComponent(new it());
 }
-const wt = Object.assign(Q, {
+const wt = Object.assign(_, {
   create(M = {}) {
-    return (t) => Q(t, M);
+    return (t) => _(t, M);
   }
 }), Mt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
@@ -3005,7 +3008,7 @@ function St() {
 }
 let H = null;
 async function It(M, t, e = !1, n) {
-  const i = await Promise.resolve().then(() => Mt), s = await Dt(), o = await St(), r = new pt().usePlugin(i.ModelDataPlugin.create({
+  const i = await Promise.resolve().then(() => Mt), s = await Dt(), r = await St(), o = new pt().usePlugin(i.ModelDataPlugin.create({
     detailsPoint: !1,
     whiteModel: !0
   })).usePlugin(s.RenderPlugin.create({
@@ -3014,19 +3017,19 @@ async function It(M, t, e = !1, n) {
     detailsPoint: !1,
     orbitControls: e,
     camera: t
-  })).usePlugin(o.Editor.create({ viewPermission: n })), l = r.findComponentByType(s.components.DomContainer);
-  return l && M.appendChild(l.domElement), H = r, {
-    dxfSystem: r,
-    getFileAll: () => Lt(r)
+  })).usePlugin(r.Editor.create({ viewPermission: n })), l = o.findComponentByType(s.components.DomContainer);
+  return l && M.appendChild(l.domElement), H = o, {
+    dxfSystem: o,
+    getFileAll: () => Lt(o)
   };
 }
 async function Lt(M = H) {
-  const t = M.findComponentByName("WhiteModel"), e = new File([await M.AngleCorrectionDxf.toDxfImageBlob()], "img.jpg", { type: "image/jpeg" }), n = new File([M.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), i = new File([M.AngleCorrectionDxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), s = new File([await t.toOBJBlob()], "model.obj", { type: "application/octet-stream" }), o = new File([await t.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), r = new File([await t.toGltfBlob(!1)], "model.gltf", { type: "application/json" }), l = new File([JSON.stringify(M.Dxf.originalData)], "json.json", { type: "application/json" });
+  const t = M.findComponentByName("WhiteModel"), e = new File([await M.AngleCorrectionDxf.toDxfImageBlob()], "img.jpg", { type: "image/jpeg" }), n = new File([M.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), i = new File([M.AngleCorrectionDxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), s = 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" }), l = new File([JSON.stringify(M.Dxf.originalData)], "json.json", { type: "application/json" });
   return {
     dxf: n,
     obj: s,
-    glb: o,
-    gltf: r,
+    glb: r,
+    gltf: o,
     json: l,
     jpg: e,
     correctionDxf: i