build-dxf 0.0.22 → 0.0.24

package/src/build.js

@@ -1,17 +1,17 @@
-import * as M from "three";
-import { EventDispatcher as tt } from "three";
-import F from "clipper-lib";
-import R from "dxf-writer";
-import { OBJExporter as et } from "three/examples/jsm/exporters/OBJExporter.js";
-import { GLTFExporter as nt } from "three/examples/jsm/exporters/GLTFExporter.js";
-function N() {
-  return "xxxx-xxxx-4xxx-yxxx-xxxx".replace(/[xy]/g, function(g) {
-    var t = Math.random() * 16 | 0, e = g == "x" ? t : t & 3 | 8;
+import * as q from "three";
+import { EventDispatcher as ot } from "three";
+import Z from "clipper-lib";
+import W from "dxf-writer";
+import { OBJExporter as rt } 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) {
+    var t = Math.random() * 16 | 0, e = M == "x" ? t : t & 3 | 8;
     return e.toString(16);
   });
 }
-class $ extends tt {
-  uuid = N();
+class tt extends ot {
+  uuid = k();
   addEventListener(t, e, n) {
     const { once: i = !1 } = n ?? {}, s = (r) => {
       e(r), i && o();
@@ -31,7 +31,7 @@ class $ extends tt {
     e && (e.forEach((n) => n()), this.eventRecordStack.delete(t));
   }
 }
-class q extends $ {
+class V extends tt {
   parent;
   destroyed = !1;
   constructor(...t) {
@@ -49,7 +49,7 @@ class q extends $ {
     this.destroyed = !0;
   }
 }
-class it extends $ {
+class ct extends tt {
   static EventType = {
     ADD_COMPONENT: "addComponent"
   };
@@ -72,7 +72,7 @@ class it extends $ {
    * @param component 
    */
   removeComponent(t) {
-    if (t instanceof q) {
+    if (t instanceof V) {
       const e = this.components.indexOf(t);
       e > -1 && (this.components.splice(e, 1), this.dispatchEvent({
         type: "removeComponent",
@@ -117,7 +117,7 @@ class it extends $ {
     return e || null;
   }
 }
-class p {
+class g {
   x;
   y;
   get X() {
@@ -150,7 +150,7 @@ class p {
    * @returns 
    */
   equal(t) {
-    return t.x === this.x && t.y === this.y;
+    return Math.abs(t.x - this.x) < 1e-9 && Math.abs(t.y - this.y) < 1e-9;
   }
   /**
    * 
@@ -207,8 +207,8 @@ class p {
    * @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, a = n * o + i * s;
-    return this.x = r + t.x, this.y = a + t.y, this;
+    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;
   }
   /**
    * 保留小数位数
@@ -234,7 +234,7 @@ class p {
    */
   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 p(s, o);
+    return new g(s, o);
   }
   /**
    * 获取由传入的点到该点的单位方向向量
@@ -244,7 +244,7 @@ class p {
    */
   direction(t) {
     const e = this.x - t.x, n = this.y - t.y, i = Math.sqrt(e * e + n * n);
-    return i === 0 ? new p(0, 0) : new p(e / i, n / i);
+    return i === 0 ? new g(0, 0) : new g(e / i, n / i);
   }
   /**
    * 计算模长
@@ -279,8 +279,8 @@ class p {
   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), a = Math.max(-1, Math.min(1, r));
-    return e === "radian" ? Math.acos(a) : e === "cos" ? a : n === "180" || this.cross(t) < 0 ? Math.acos(a) / (Math.PI / 180) : 360 - Math.acos(a) / (Math.PI / 180);
+    const r = i / (s * o), l = Math.max(-1, Math.min(1, r));
+    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);
   }
   /** 获取向量长度
    */
@@ -302,7 +302,7 @@ class p {
    * @returns 
    */
   clone() {
-    return new p(this.x, this.y);
+    return new g(this.x, this.y);
   }
   /**
    * 克隆
@@ -319,23 +319,23 @@ class p {
     };
   }
   static from(t) {
-    return Array.isArray(t) ? new p(t[0], t[1]) : "x" in t && "y" in t ? new p(t.x, t.y) : "X" in t && "Y" in t ? new p(t.X, t.Y) : this.zero();
+    return Array.isArray(t) ? new g(t[0], t[1]) : "x" in t && "y" in t ? new g(t.x, t.y) : "X" in t && "Y" in t ? new g(t.X, t.Y) : this.zero();
   }
   static zero() {
-    return new p(0, 0);
+    return new g(0, 0);
   }
 }
-class v {
+class C {
   minX = 0;
   maxX = 0;
   minY = 0;
   maxY = 0;
   get points() {
     return [
-      new p(this.minX, this.minY),
-      new p(this.maxX, this.minY),
-      new p(this.maxX, this.maxY),
-      new p(this.minX, this.maxY)
+      new g(this.minX, this.minY),
+      new g(this.maxX, this.minY),
+      new g(this.maxX, this.maxY),
+      new g(this.minX, this.maxY)
     ];
   }
   get width() {
@@ -345,7 +345,7 @@ class v {
     return this.maxY - this.minY;
   }
   get center() {
-    return new p(
+    return new g(
       this.minX + (this.maxX - this.minX) * 0.5,
       this.minY + (this.maxY - this.minY) * 0.5
     );
@@ -376,13 +376,13 @@ class v {
       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;
     if (i !== 0) {
-      const a = (this.minX - e.x) / i, c = (this.maxX - e.x) / i;
-      o = Math.max(o, Math.min(a, c)), r = Math.min(r, Math.max(a, c));
+      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));
     } else if (e.x < this.minX || e.x > this.maxX)
       return !1;
     if (s !== 0) {
-      const a = (this.minY - e.y) / s, c = (this.maxY - e.y) / s;
-      o = Math.max(o, Math.min(a, c)), r = Math.min(r, Math.max(a, c));
+      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));
     } else if (e.y < this.minY || e.y > this.maxY)
       return !1;
     return o <= r && o <= 1 && r >= 0;
@@ -400,37 +400,45 @@ class v {
    * @param rectangle 
    */
   intersectRectangle(t) {
-    const e = (o) => this.minX <= o.x && o.x <= this.maxX && this.minY <= o.y && o.y <= this.maxY, n = (o) => {
-      let r = 0;
-      for (let a = 0; a < 4; a++) {
-        const c = t.points[a], h = t.points[(a + 1) % 4], l = { x: h.x - c.x, y: h.y - c.y }, d = { x: o.x - c.x, y: o.y - c.y }, f = l.x * d.y - l.y * d.x;
+    const e = t.points;
+    let n = e[0].x, i = e[0].y, s = e[0].x, o = 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);
+    }
+    if (this.maxX < n || this.minX > s || this.maxY < i || this.minY > o)
+      return !1;
+    const r = this.points;
+    for (let c = 0; c < 4; c++) {
+      const a = r[c], h = r[(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))
+          return !0;
+      }
+    }
+    for (let c = 0; c < 4; c++) {
+      const a = e[c];
+      if (a.x >= this.minX && a.x <= this.maxX && a.y >= this.minY && a.y <= this.maxY)
+        return !0;
+    }
+    const l = (c) => {
+      let a = 0;
+      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 m = l.x !== 0 ? (o.x - c.x) / l.x : (o.y - c.y) / l.y;
-          if (m >= 0 && m <= 1) return !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;
         } else {
-          const m = f > 0 ? 1 : -1;
-          if (r === 0 && (r = m), r !== m) return !1;
+          const y = f > 0 ? 1 : -1;
+          if (a === 0) a = y;
+          else if (a !== y) return !1;
         }
       }
       return !0;
-    }, i = (o, r, a, c) => {
-      const h = (u, x, w) => {
-        const S = (x.y - u.y) * (w.x - x.x) - (x.x - u.x) * (w.y - x.y);
-        return S === 0 ? 0 : S > 0 ? 1 : 2;
-      }, l = (u, x, w) => Math.min(u.x, w.x) <= x.x && x.x <= Math.max(u.x, w.x) && Math.min(u.y, w.y) <= x.y && x.y <= Math.max(u.y, w.y), d = h(o, r, a), f = h(o, r, c), m = h(a, c, o), y = h(a, c, r);
-      return !!(d !== f && m !== y || d === 0 && l(o, a, r) || f === 0 && l(o, c, r) || m === 0 && l(a, o, c) || y === 0 && l(a, r, c));
-    }, s = this.points;
-    for (let o = 0; o < 4; o++) {
-      const r = s[o], a = s[(o + 1) % 4];
-      for (let c = 0; c < 4; c++) {
-        const h = t.points[c], l = t.points[(c + 1) % 4];
-        if (i(r, a, h, l)) return !0;
-      }
-    }
-    for (let o of t.points)
-      if (e(o)) return !0;
-    for (let o of s)
-      if (n(o)) return !0;
+    };
+    for (let c = 0; c < 4; c++)
+      if (l(r[c])) return !0;
     return !1;
   }
   /**
@@ -500,7 +508,7 @@ class v {
    * @returns 
    */
   clone() {
-    return new v(this.minX, this.maxX, this.minY, this.maxY);
+    return new C(this.minX, this.maxX, this.minY, this.maxY);
   }
   /**
    * 
@@ -511,7 +519,25 @@ class v {
     const e = [], n = [];
     return t.forEach((i) => {
       e.push(i.x), n.push(i.y);
-    }), new v(
+    }), new C(
+      Math.min(...e),
+      Math.max(...e),
+      Math.min(...n),
+      Math.max(...n)
+    );
+  }
+  /**
+   * 
+   * @param points 
+   * @returns 
+   */
+  static fromByLineSegment(...t) {
+    const e = [], n = [];
+    return t.forEach((i) => {
+      i?.points?.forEach((s) => {
+        e.push(s.x), n.push(s.y);
+      });
+    }), new C(
       Math.min(...e),
       Math.max(...e),
       Math.min(...n),
@@ -519,7 +545,128 @@ class v {
     );
   }
 }
-class O {
+class U {
+  map = /* @__PURE__ */ new Map();
+  gridSize;
+  constructor(t = 2) {
+    this.gridSize = t;
+  }
+  /**
+   * 插入
+   * @param point 
+   * @param userData 
+   */
+  insert(t, e) {
+    if (!t || isNaN(t.x) || isNaN(t.y))
+      throw new Error("无效的点坐标");
+    const n = this.getGridId(t);
+    this.map.has(n) || this.map.set(n, /* @__PURE__ */ new Set());
+    const i = this.map.get(n), s = { point: t, userData: e };
+    i.add(s), t.userData.pointVirtualGrid = { set: i, target: s };
+  }
+  /**
+   * 批量加入
+   * @param points 
+   */
+  insertBatch(t) {
+    for (const { point: e, userData: n } of t)
+      this.insert(e, n);
+  }
+  /** 移除点
+   * @param point 
+   */
+  remove(t) {
+    const { set: e, target: n } = t?.userData?.pointVirtualGrid ?? {};
+    e && (e.delete(n), delete t?.userData?.pointVirtualGridMap);
+  }
+  /**
+   * 获取通过坐标，获取唯一网格索引
+   * @param point 
+   * @returns 
+   */
+  getGridId(t) {
+    const e = Math.ceil(t.x / this.gridSize), n = Math.ceil(t.y / this.gridSize);
+    return `${e}.${n}`;
+  }
+  /**
+   * 
+   * @param gridId 
+   * @returns 
+   */
+  decodeGridId(t) {
+    const [e, n] = t.split(".").map(Number);
+    return new g(e, n);
+  }
+  /**
+   * 查询与矩形相交的点
+   * @param rectangle 矩形
+   * @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}`;
+        if (!this.map.has(c)) continue;
+        this.map.get(c)?.forEach((h) => {
+          t.containsPoint(h.point);
+        });
+      }
+  }
+  /**
+   * 查询与圆形区域相交的点
+   * @param pos 圆心
+   * @param radius 半径
+   * @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 = [];
+    for (let c = i; c <= s; c++)
+      for (let a = o; a <= r; a++) {
+        const h = `${c}.${a}`;
+        if (!this.map.has(h)) continue;
+        this.map.get(h)?.forEach((u) => {
+          t.distance(u.point) <= e && l.push(u);
+        });
+      }
+    return l;
+  }
+  /**
+   * 查询与包围盒相交的点
+   * @param box2 包围盒
+   * @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++)
+      for (let l = i; l <= s; l++) {
+        const c = `${r}.${l}`;
+        if (!this.map.has(c)) continue;
+        this.map.get(c)?.forEach((h) => {
+          t.containsPoint(h.point) && o.push(h);
+        });
+      }
+    return o;
+  }
+  /**
+   * 查找相同点
+   * @param point 
+   */
+  queryPoint(t) {
+    const e = this.getGridId(t), n = [];
+    return this.map.has(e) && this.map.get(e)?.forEach((s) => {
+      t.equal(s.point) && n.push(s);
+    }), n;
+  }
+  /**
+   * 查找点自己
+   * @param point 
+   */
+  queryPointSelf(t) {
+    return t.userData.pointVirtualGrid && t.userData.pointVirtualGrid.target ? t.userData.pointVirtualGrid.target : null;
+  }
+}
+class J {
   points;
   get p0() {
     return this.points[0];
@@ -542,7 +689,7 @@ class O {
   path2D(t) {
     return this.points.flatMap((e, n) => {
       const i = this.points[(n + 1) % this.points.length];
-      return t && t(new p(e.x, e.y), new p(i.x, i.y)), [e.x, e.y, i.x, i.y];
+      return t && t(new g(e.x, e.y), new g(i.x, i.y)), [e.x, e.y, i.x, i.y];
     });
   }
   createGeometry() {
@@ -568,17 +715,19 @@ class O {
   intersectLineSegment(t) {
     if (t.points.length !== 2)
       throw new Error("LineSegment must have exactly 2 points");
-    const [e, n] = t.points, i = (s, o, r, a) => {
-      const c = (y, u, x) => {
-        const w = (u.y - y.y) * (x.x - u.x) - (u.x - y.x) * (x.y - u.y);
-        return w === 0 ? 0 : w > 0 ? 1 : 2;
-      }, h = (y, u, x) => Math.min(y.x, x.x) <= u.x && u.x <= Math.max(y.x, x.x) && Math.min(y.y, x.y) <= u.y && u.y <= Math.max(y.y, x.y), l = c(s, o, r), d = c(s, o, a), f = c(r, a, s), m = c(r, a, o);
-      return !!(l !== d && f !== m || l === 0 && h(s, r, o) || d === 0 && h(s, a, o) || f === 0 && h(r, s, a) || m === 0 && h(r, o, a));
-    };
-    for (let s = 0; s < 4; s++) {
-      const o = this.points[s], r = this.points[(s + 1) % 4];
-      if (i(e, n, o, r))
-        return !0;
+    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;
+      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 (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;
+        if (d >= 0 && d <= 1 && u >= 0 && u <= 1)
+          return !0;
+      }
     }
     return !!this.containsLineSegment(t);
   }
@@ -593,13 +742,13 @@ class O {
     const e = (n) => {
       let i = 0;
       for (let s = 0; s < 4; s++) {
-        const o = this.points[s], r = this.points[(s + 1) % 4], a = { x: r.x - o.x, y: r.y - o.y }, c = { x: n.x - o.x, y: n.y - o.y }, h = a.x * c.y - a.y * c.x;
-        if (h === 0) {
-          const l = a.x !== 0 ? (n.x - o.x) / a.x : (n.y - o.y) / a.y;
-          if (l >= 0 && l <= 1) return !0;
+        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;
+        if (a === 0) {
+          const h = l.x !== 0 ? (n.x - o.x) / l.x : (n.y - o.y) / l.y;
+          if (h >= 0 && h <= 1) return !0;
         } else {
-          const l = h > 0 ? 1 : -1;
-          if (i === 0 && (i = l), i !== l) return !1;
+          const h = a > 0 ? 1 : -1;
+          if (i === 0 && (i = h), i !== h) return !1;
         }
       }
       return !0;
@@ -623,7 +772,7 @@ class O {
       e.push(o.normal(r));
     }
     function n(s, o) {
-      const r = s.points.map((a) => a.dot(o));
+      const r = s.points.map((l) => l.dot(o));
       return [Math.min(...r), Math.max(...r)];
     }
     function i(s, o) {
@@ -658,7 +807,7 @@ class O {
     let t = 1 / 0, e = -1 / 0, n = 1 / 0, i = -1 / 0;
     return this.points.forEach((s) => {
       e = Math.max(s.x, e), t = Math.min(s.x, t), i = Math.max(s.x, i), n = Math.min(s.x, n);
-    }), new v(t, e, n, i);
+    }), new C(t, e, n, i);
   }
   /**
    * 
@@ -667,67 +816,243 @@ class O {
    * @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), a = n ? o.direction(s).mutiplyScalar(e * i) : p.zero(), c = n ? s.direction(o).mutiplyScalar(e * i) : p.zero(), h = r.x * e * 0.5, l = r.y * e * 0.5;
-    return new O([
-      new p(s.x + h, s.y + l).add(c),
-      new p(o.x + h, o.y + l).add(a),
-      new p(o.x - h, o.y - l).add(a),
-      new p(s.x - h, s.y - l).add(c)
+    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;
+    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(s.x - a, s.y - h).add(c)
     ]);
   }
 }
-class L {
-  points = [new p(), new p()];
-  userData = {};
-  // line: any
-  get center() {
-    return new p(
-      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
-    );
-  }
-  get start() {
-    return this.points[0];
-  }
-  get end() {
-    return this.points[1];
+class T {
+  bounds;
+  // 包围盒
+  capacity;
+  // 节点容量
+  maxDepth;
+  // 最大深度
+  depth;
+  // 当前深度
+  isLeaf = !0;
+  // 是否为叶子节点
+  children = null;
+  // 子节点数组
+  nodes = [];
+  // 存储的节点
+  color = [Math.random(), Math.random(), Math.random()];
+  // 颜色
+  constructor(t, e = 8, n = 10, i = 1) {
+    this.bounds = t, this.capacity = e, this.depth = i, this.maxDepth = n;
   }
-  constructor(t = new p(), e = new p()) {
-    this.points = [t, e];
+  /**
+   * 插入线段节点
+   * @param node 线段节点
+   */
+  insert(t) {
+    if (!this.isLeaf) {
+      const e = this.getQuadrant(t.line);
+      if (e !== -1) {
+        this.children[e].insert(t);
+        return;
+      }
+    }
+    if (this.nodes.push(t), t.parent = this, this.isLeaf && this.nodes.length > this.capacity && this.depth < this.maxDepth) {
+      this.subdivide();
+      const e = this.nodes;
+      this.nodes = [];
+      for (const n of e) {
+        const i = this.getQuadrant(n.line);
+        i !== -1 ? this.children[i].insert(n) : (n.parent = this, this.nodes.push(n));
+      }
+    }
   }
-  set(t, e) {
-    return this.start.copy(t), this.end.copy(e), this;
+  /** 移除
+   * @param node 
+   */
+  remove(t) {
+    const e = t.parent?.nodes.indexOf(t);
+    e > -1 && t.parent?.nodes.splice(e, 1);
   }
   /**
-   * 是否有相同端点
-   * @param line 
-   * @returns 
+   * 获取线段所属的象限
+   * @param line 线段
+   * @returns 象限索引（0:西北,1:东北,2:西南,3:东南）或-1（跨多个象限）
    */
-  sameEndpoint(t) {
-    return this.start.equal(t.start) || this.start.equal(t.end) || this.end.equal(t.start) || this.end.equal(t.end);
+  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;
   }
   /**
-   * 相同端点是否为开始
-   * @param line 
-   * @returns 
+   * 细分当前节点为四个子节点
    */
-  sameEndpointAsStart(t) {
-    return this.start.equal(t.start) || this.start.equal(t.end);
+  subdivide() {
+    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 T(
+      new C(this.bounds.minX, t, this.bounds.minY, e),
+      this.capacity,
+      this.maxDepth,
+      this.depth + 1
+    ), this.children[1] = new T(
+      new C(t, this.bounds.maxX, this.bounds.minY, e),
+      this.capacity,
+      this.maxDepth,
+      this.depth + 1
+    ), this.children[2] = new T(
+      new C(this.bounds.minX, t, e, this.bounds.maxY),
+      this.capacity,
+      this.maxDepth,
+      this.depth + 1
+    ), this.children[3] = new T(
+      new C(t, this.bounds.maxX, e, this.bounds.maxY),
+      this.capacity,
+      this.maxDepth,
+      this.depth + 1
+    );
   }
   /**
-   * 获取共线点
-   * @param line 
-   * @returns 
+   * 查询与包围盒相交的线段节点
+   * @param box2 包围盒
+   * @returns 相交的节点数组
    */
-  getSameEndpoint(t) {
-    return this.start.equal(t.start) ? [this.start, t.start] : this.start.equal(t.end) ? [this.start, t.end] : this.end.equal(t.start) ? [this.end, t.start] : this.end.equal(t.end) ? [this.end, t.end] : null;
+  queryBox(t) {
+    const e = [];
+    if (!this.bounds.intersectBox(t))
+      return e;
+    for (const n of this.nodes)
+      t.intersectLineSegment(n.line) && e.push(n);
+    if (!this.isLeaf)
+      for (const n of this.children)
+        e.push(...n.queryBox(t));
+    return e;
   }
   /**
-   * 相同端点是否为结束
-   * @param line 
-   * @returns 
+   * 查询与圆形区域相交的线段节点
+   * @param pos 圆心
+   * @param radius 半径
+   * @returns 相交的节点数组
    */
-  sameEndpointAsEnd(t) {
+  queryCircle(t, e) {
+    const n = [], i = new C(
+      t.x - e,
+      t.x + e,
+      t.y - e,
+      t.y + e
+    );
+    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;
+      h = Math.max(0, Math.min(1, h));
+      const d = o.x + h * l, u = o.y + h * c;
+      t.distance(new g(d, u)) <= e && n.push(s);
+    }
+    if (!this.isLeaf)
+      for (const s of this.children)
+        n.push(...s.queryCircle(t, e));
+    return n.sort((s) => s.line.length()), n;
+  }
+  /**
+   * 查询与矩形相交的线段节点
+   * @param rectangle 矩形
+   * @returns 相交的节点数组
+   */
+  queryRect(t) {
+    const e = [];
+    if (!this.bounds.intersectRectangle(t))
+      return e;
+    for (const n of this.nodes)
+      t.intersectLineSegment(n.line) && e.push(n);
+    if (!this.isLeaf)
+      for (const n of this.children)
+        e.push(...n.queryRect(t));
+    return e;
+  }
+  /**
+   * 查询与线段相交的线段节点
+   * @param lineSegment 线段
+   * @returns 相交的节点数组
+   */
+  queryLineSegment(t, e = !0) {
+    const n = [];
+    if (!this.bounds.intersectLineSegment(t))
+      return n;
+    for (const i of this.nodes)
+      t.intersectLineSegment(i.line, e) && n.push(i);
+    if (!this.isLeaf)
+      for (const i of this.children)
+        n.push(...i.queryLineSegment(t));
+    return n;
+  }
+  /**
+   * 包围盒转换为数组
+   * @param array 
+   * @param colors 
+   * @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];
+    })), t;
+  }
+}
+class I {
+  points = [new g(), new g()];
+  userData = {};
+  // line: any
+  get center() {
+    return new g(
+      this.points[0].x + (this.points[1].x - this.points[0].x) * 0.5,
+      this.points[0].y + (this.points[1].y - this.points[0].y) * 0.5
+    );
+  }
+  get start() {
+    return this.points[0];
+  }
+  get end() {
+    return this.points[1];
+  }
+  constructor(t = new g(), e = new g()) {
+    this.points = [t, e];
+  }
+  set(t, e) {
+    return this.start.copy(t), this.end.copy(e), this;
+  }
+  /**
+   * 是否有相同端点
+   * @param line 
+   * @returns 
+   */
+  sameEndpoint(t) {
+    return this.start.equal(t.start) || this.start.equal(t.end) || this.end.equal(t.start) || this.end.equal(t.end);
+  }
+  /**
+   * 相同端点是否为开始
+   * @param line 
+   * @returns 
+   */
+  sameEndpointAsStart(t) {
+    return this.start.equal(t.start) || this.start.equal(t.end);
+  }
+  /**
+   * 获取共线点
+   * @param line 
+   * @returns 
+   */
+  getSameEndpoint(t) {
+    return this.start.equal(t.start) ? [this.start, t.start] : this.start.equal(t.end) ? [this.start, t.end] : this.end.equal(t.start) ? [this.end, t.start] : this.end.equal(t.end) ? [this.end, t.end] : null;
+  }
+  /**
+   * 相同端点是否为结束
+   * @param line 
+   * @returns 
+   */
+  sameEndpointAsEnd(t) {
     return this.end.equal(t.start) || this.end.equal(t.end);
   }
   /** 膨胀
@@ -769,15 +1094,15 @@ class L {
    * @returns {Rectangle}
    */
   expandToRectangle(t = 0.1, e = "all") {
-    const n = this.start, i = this.end, s = i.normal(n), o = e === "bothSides" ? p.zero() : i.direction(n).mutiplyScalar(t * 0.5), r = e === "bothSides" ? p.zero() : n.direction(i).mutiplyScalar(t * 0.5), a = s.x * t * 0.5, c = s.y * t * 0.5, h = [
+    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 = [
       // 第一条线
-      new p(n.x + a, n.y + c).add(r),
-      new p(i.x + a, i.y + c).add(o),
+      new g(n.x + l, n.y + c).add(r),
+      new g(i.x + l, i.y + c).add(o),
       // 第二条线
-      new p(n.x - a, n.y - c).add(r),
-      new p(i.x - a, i.y - c).add(o)
+      new g(n.x - l, n.y - c).add(r),
+      new g(i.x - l, i.y - c).add(o)
     ];
-    return new O([0, 1, 3, 2].map((l) => h[l]));
+    return new J([0, 1, 3, 2].map((h) => a[h]));
   }
   /**
    * 计算线段的长度
@@ -814,24 +1139,24 @@ class L {
   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 p(s.x - i.x, s.y - i.y);
+    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)
       throw new Error("投影目标线段的两个点不能重合");
-    const r = (m) => {
-      const y = new p(m.x - i.x, m.y - i.y), u = o.x * o.x + o.y * o.y, w = (y.x * o.x + y.y * o.y) / u, S = i.x + w * o.x, b = i.y + w * o.y;
-      return new p(S, b);
+    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);
     };
-    let a = r(e), c = r(n);
-    const h = (m) => {
-      const y = new p(m.x - i.x, m.y - i.y), u = o.x * o.x + o.y * o.y;
-      return (y.x * o.x + y.y * o.y) / u;
+    let l = r(e), c = r(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;
     };
-    let l = h(a), d = h(c);
-    const f = (m) => {
-      const y = Math.max(0, Math.min(1, m)), u = i.x + y * o.x, x = i.y + y * o.y;
-      return new p(u, x);
+    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);
     };
-    return (l < 0 || l > 1) && (a = f(l)), (d < 0 || d > 1) && (c = f(d)), a.x === c.x && a.y === c.y ? new L(a, a) : new L(a, c);
+    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);
   }
   /**
    * 计算一条线段在另一条直线上的投影
@@ -840,17 +1165,17 @@ class L {
    * @returns 投影并裁剪后的线段
    */
   projectPoint(t, e = !0) {
-    const [n, i] = this.points, s = new p(i.x - n.x, i.y - n.y);
+    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 = ((h) => {
-      const l = new p(h.x - n.x, h.y - n.y), d = s.x * s.x + s.y * s.y, m = (l.x * s.x + l.y * s.y) / d, y = n.x + m * s.x, u = n.y + m * s.y;
-      return new p(y, u);
+    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);
     })(t);
     if (!e) return r;
-    let c = ((h) => {
-      const l = new p(h.x - n.x, h.y - n.y), d = s.x * s.x + s.y * s.y;
-      return (l.x * s.x + l.y * s.y) / d;
+    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;
   }
@@ -862,14 +1187,14 @@ class L {
    */
   intersectLineSegment(t, e = !0) {
     const n = this.start, i = this.end, s = t.start, o = t.end;
-    function r(f, m, y) {
-      return (m.x - f.x) * (y.y - f.y) - (m.y - f.y) * (y.x - f.x);
+    function r(u, f, y) {
+      return (f.x - u.x) * (y.y - u.y) - (f.y - u.y) * (y.x - u.x);
     }
-    function a(f, m, y) {
-      return Math.min(m.x, y.x) - 1e-10 <= f.x && f.x <= Math.max(m.x, y.x) + 1e-10 && Math.min(m.y, y.y) - 1e-10 <= f.y && f.y <= Math.max(m.y, y.y) + 1e-10;
+    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), h = r(n, i, o), l = r(s, o, n), d = r(s, o, i);
-    return !!(c * h < 0 && l * d < 0 || e && (Math.abs(c) < 1e-10 && a(s, n, i) || Math.abs(h) < 1e-10 && a(o, n, i) || Math.abs(l) < 1e-10 && a(n, s, o) || Math.abs(d) < 1e-10 && a(i, s, o)));
+    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)));
   }
   /**
    * 判断一个点是否在线段上（含端点）
@@ -889,8 +1214,8 @@ class L {
     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)
       return null;
-    const r = ((e.x - i.x) * (i.y - s.y) - (e.y - i.y) * (i.x - s.x)) / o, a = e.x + r * (n.x - e.x), c = e.y + r * (n.y - e.y);
-    return new p(a, c);
+    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);
+    return new g(l, c);
   }
   /**
    * 获取两条线段夹角
@@ -907,6 +1232,14 @@ class L {
   directionEqual(t, e = 0.1) {
     return this.includedAngle(t) < e;
   }
+  /**
+   * 两条线段是否平行
+   * @param line 
+   */
+  parallel(t, e = 1) {
+    const n = this.includedAngle(t);
+    return n < e || n > 180 - e;
+  }
   /**
    * 两条线段方向相反否一致
    * @param line 
@@ -928,29 +1261,214 @@ class L {
    * @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, a = (s.y - i.y) / (s.x - i.x), c = i.y - a * i.x;
-    return !isFinite(o) && !isFinite(a) ? e.x === i.x && n.x === i.x : Math.abs(o - a) < 1e-3 && Math.abs(r - c) < 1e-3;
+    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;
   }
   clone() {
-    const t = new L(
+    const t = new I(
       this.points[0].clone(),
       this.points[1].clone()
     );
     return t.userData = { ...this.userData }, t;
   }
+  /**
+   * 轴对齐垂直修正
+   * @param lines 待调整线段组
+   * @param targettLine 轴线段
+   * @returns 
+   */
+  static axisAlignmentCorrection(t, e) {
+    function n(x) {
+      const D = new U();
+      x.forEach((b) => b.points.forEach((P) => D.insert(P, b)));
+      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);
+            return v - B;
+          });
+          A.length !== 0 && w.push(new I(m.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);
+            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);
+          } 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;
+            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);
+          }
+        }
+      }
+      return { parallelLines: w, verticalLines: b, doorLines: P };
+    }
+    function s(x, D, w, b = 0.3, P = 0.06) {
+      const S = [];
+      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];
+        if (E === 0) {
+          A.push(L);
+          continue;
+        }
+        S[E - 1].distance(L) < P || (m.push([...A]), A.length = 0), A.push(L), E === S.length - 1 && m.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;
+          });
+        });
+        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);
+          for (const R of v.values()) if (R !== 2) return;
+          X.push(...v.keys()), v.clear();
+        }), B.push([...X]), B;
+      });
+    }
+    function o(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[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 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 R = m - S;
+        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));
+      });
+      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;
+          });
+          return X.length ? B.get(X[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);
+          } 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));
+      }
+      return x.filter((S) => S.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;
+        }), w]) : w;
+      }).filter((w) => w.length() > 0.1);
+    }
+    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(
+      d.clone().add(h.clone().multiplyScalar(-1e3)),
+      d.clone().add(h.clone().multiplyScalar(1e3))
+    ), y = new I(
+      d.clone().add(u.clone().multiplyScalar(-1e3)),
+      d.clone().add(u.clone().multiplyScalar(1e3))
+    );
+    let p = o([
+      ...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;
+  }
+  /**
+   * 获取最长线段
+   * @param lines 
+   */
+  static maxLengthLineIndex(t) {
+    let e = 0, n = -1;
+    for (let i = 0; i < t.length; i++) {
+      const s = t[i].length();
+      s > e && (e = s, n = i);
+    }
+    return n;
+  }
 }
-async function G(g, t = !0) {
+async function O(M, t = !0) {
   if (typeof global < "u" && typeof require < "u")
-    return require(g);
+    return require(M);
   {
     let e = await import(
       /* @vite-ignore */
-      g
+      M
     );
     return t && (e = e.default), e;
   }
 }
-const st = {
+const lt = {
   Unitless: 1,
   // 无单位，1米 = 1（无单位）
   Inches: 39.37007874015748,
@@ -994,27 +1512,27 @@ const st = {
   Parsecs: 3240779289666404e-32
   // 秒差距，1米 ≈ 0.00000000000000003240779289666404秒差距
 };
-function k(g) {
+function _(M) {
   const t = [];
-  for (let e = 0; e < g.length; e++)
-    t.push(new L(
-      g[e].clone(),
-      g[(e + 1) % g.length].clone()
+  for (let e = 0; e < M.length; e++)
+    t.push(new I(
+      M[e].clone(),
+      M[(e + 1) % M.length].clone()
     ));
   return t;
 }
-function J(g) {
-  return g.flatMap((t, e) => (e === g.length - 1 && [...t.points, g[0].points[0]], [t.points[0]]));
+function K(M) {
+  return M.flatMap((t, e) => (e === M.length - 1 && [...t.points, M[0].points[0]], [t.points[0]]));
 }
-class X extends q {
+class z extends V {
   static name = "Dxf";
   shortLine = 0.04;
   width = 0.04;
   scale = 1;
   originalData = [];
   data = [];
-  originalBox = new v(0, 0, 0, 0);
-  box = new v(0, 0, 0, 0);
+  originalBox = new C(0, 0, 0, 0);
+  box = new C(0, 0, 0, 0);
   pointsGroups = [];
   wallsGroup = [];
   doors = [];
@@ -1046,38 +1564,64 @@ class X extends q {
   constructor(t = 0.04, e = 1) {
     super(), this.width = t, this.scale = e, this.shortLine = t * 0.4;
   }
+  /**
+   * 预处理数据
+   * @param data 
+   */
+  preprocessing(t, e = !1) {
+    const n = [];
+    let i = -1;
+    t.forEach(({ start: o, end: r, ...l }, c) => {
+      const a = new I(
+        g.from(o),
+        g.from(r)
+      );
+      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)
+      };
+    }
+    return {
+      lineSegments: n,
+      data: t
+    };
+  }
   /**
    * 设置
    * @param data 
    * @param width 
    * @param scale 
    */
-  async set(t, e = this.width, n = this.scale) {
+  async set(t, e = this.width, n = this.scale, i = !1) {
     if (typeof t == "string")
       if (typeof global < "u") {
-        const { default: o } = await import(
+        const { default: l } = await import(
           /* @vite-ignore */
           "fs"
-        ), r = o.readFileSync(t), a = JSON.parse(r.toString("utf-8"));
+        ), c = l.readFileSync(t), a = JSON.parse(c.toString("utf-8"));
         return this.set(a, e, n);
       } else
         throw new Error("非node环境不允许使用路径");
     this.scale = n, this.width = e, this.originalData = t, this.lineSegments.length = 0;
-    const i = [];
-    this.data = t.map(({ start: s, end: o, insetionArr: r, isDoor: a = !1, ...c }, h) => {
-      i.push(s.z ?? 0, o.z ?? 0);
-      const l = new L(
-        p.from(s).mutiplyScalar(n),
-        p.from(o).mutiplyScalar(n)
-      );
-      return l.userData = { isDoor: a, ...c }, this.lineSegments.push(l), [
-        l.points[0],
-        l.points[1],
-        (r ?? []).map((d) => d.index),
+    const s = this.preprocessing(t, i);
+    t = s.data, this.lineSegments = s.lineSegments;
+    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 d = this.lineSegments[h];
+      return [
+        d.points[0],
+        d.points[1],
+        (c ?? []).map((u) => u.index),
         a,
         h
       ];
-    }), this.originalZAverage = i.reduce((s, o) => s + o, 0) / i.length, this.computedOriginalSize(t, this.originalBox), this.dispatchEvent({
+    }), this.originalZAverage = o.reduce((r, l) => r + l, 0) / o.length, this.computedOriginalSize(t, this.originalBox), this.dispatchEvent({
       type: "setDta",
       originalData: this.originalData,
       data: this.data
@@ -1091,18 +1635,18 @@ class X extends q {
    * @returns 
    */
   createGroups() {
-    const t = [], e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Map(), s = (o, r, a = -1) => {
-      const [c, h, l, d] = this.data[o];
+    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(a), n.add(this.data[o]);
-      r.push([c, h]), l.forEach((f) => {
-        e.has(f) || s(f, r, o);
+        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);
       });
     };
     return this.data.forEach((o, r) => {
       if (!e.has(r)) {
-        const a = [];
-        s(r, a), t.push(a);
+        const l = [];
+        s(r, l), t.push(l);
       }
     }), this.doors = [...n], this.pointsGroups = t, t;
   }
@@ -1112,7 +1656,7 @@ class X extends q {
    * @returns 
    */
   computedSize() {
-    const t = this.pointsGroups.flatMap((r) => r.flatMap((a) => [a[0].x, a[1].x])), e = this.pointsGroups.flatMap((r) => r.flatMap((a) => [a[0].y, a[1].y])), n = Math.min(...t), i = Math.min(...e), s = Math.max(...t), o = Math.max(...e);
+    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;
   }
   /** 线路拓扑
@@ -1122,11 +1666,11 @@ class X extends q {
   lineTopology(t) {
     const e = [];
     function n(s, o) {
-      const [r, a] = t[s];
-      e[s] = !0, o.push(a);
+      const [r, l] = t[s];
+      e[s] = !0, o.push(l);
       for (let c = 0; c < t.length; c++) {
-        const [h, l] = t[c];
-        if (!e[c] && Math.abs(a.x - h.x) < 1e-6 && Math.abs(a.y - h.y) < 1e-6)
+        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);
       }
     }
@@ -1164,9 +1708,9 @@ class X extends q {
       const i = t[n - 1], s = t[n];
       if (i.distance(s) < this.width * 0.5) {
         let r = 0;
-        for (let a = n + 1; a < t.length; a++) {
-          const c = t[a - 1], h = t[a];
-          if (c.distance(h) < this.width * 0.8) r++;
+        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++;
           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));
@@ -1188,7 +1732,7 @@ class X extends q {
         break;
       }
     }
-    const e = this.mergeSameDirectionLine(k(t)), n = [e[0]];
+    const e = this.mergeSameDirectionLine(_(t)), n = [e[0]];
     for (let i = 1; i < e.length; i++) {
       const s = e[i], o = e[(e.length + i - 1) % e.length];
       if (s.length() > this.width * 0.9) {
@@ -1200,10 +1744,10 @@ class X extends q {
         n.push(s), n.push(r), i = i + 1;
         continue;
       }
-      const a = e[i + 2];
-      a && o.includedAngle(a) < 2 ? (i = i + 2, n.push(a)) : n.push(s);
+      const l = e[i + 2];
+      l && o.includedAngle(l) < 2 ? (i = i + 2, n.push(l)) : n.push(s);
     }
-    return n.length > 3 ? J(this.mergeSameDirectionLine(n)) : [];
+    return n.length > 3 ? K(this.mergeSameDirectionLine(n)) : [];
   }
   /**
    * 移除短线段
@@ -1211,48 +1755,48 @@ class X extends q {
    * @param path 
    */
   removeShortLine(t, e = this.shortLine) {
-    const n = k(t), i = [], s = Math.PI / 180;
+    const n = _(t), i = [], s = Math.PI / 180;
     for (let o = 0; o < n.length; o++) {
-      const r = n[o], a = r.length(), c = o;
-      if (a > e || i.length === 0) {
+      const r = n[o], l = r.length(), c = o;
+      if (l > e || i.length === 0) {
         i.push(r);
         continue;
       }
-      let h = n[++o];
-      const l = i[i.length - 1], d = l.direction();
+      let a = n[++o];
+      const h = i[i.length - 1], d = h.direction();
       for (; o < n.length; ) {
-        const m = d.angleBetween(h.direction()) / s;
-        if (h.length() <= e || m < 4 || m > 176)
-          h = n[++o];
+        const f = d.angleBetween(a.direction()) / s;
+        if (a.length() <= e || f < 4 || f > 176)
+          a = n[++o];
         else break;
       }
-      if (!h) continue;
-      const f = n[o - 1];
-      if (l.length() > f.length()) {
-        const m = l.getIntersection(h);
-        if (m) {
-          const y = l.points[1].clone(), u = h.points[0].clone();
-          l.points[1].copy(m), h.points[0].copy(m), l.length() < this.width ? (l.points[1].copy(y), h.points[0].copy(y)) : h.length() < this.width && (l.points[1].copy(u), h.points[0].copy(u));
+      if (!a) continue;
+      const u = n[o - 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));
         } else
-          l.points[1].copy(h.points[0]);
-        i.push(h);
+          h.points[1].copy(a.points[0]);
+        i.push(a);
       } else
         o = c;
     }
-    return i.length > 3 ? J(i) : [];
+    return i.length > 3 ? K(i) : [];
   }
   /** 线偏移
    * @description 使用 ClipperLib 对每个点组进行线偏移处理，生成具有指定宽度的墙体路径
    */
-  lineOffset(t = X.EndType.etOpenSquare, e = X.JoinType.jtMiter, n = 1e4) {
-    let i = new F.Paths();
-    const s = new F.ClipperOffset(20, 0.25);
+  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((a) => a.map((c) => c.clone().mutiplyScalar(n)));
+      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((a) => p.from(a).divisionScalar(n));
-      return r = this.lineSegmentStraightening(r), t == X.EndType.etOpenSquare && (r = this.squareRemoveBurr(r)), r;
+      let r = o.map((l) => g.from(l).divisionScalar(n));
+      return r = this.lineSegmentStraightening(r), t == z.EndType.etOpenSquare && (r = this.squareRemoveBurr(r)), r;
     }), this.dispatchEvent({
       type: "lineOffset",
       wallsGroup: this.wallsGroup
@@ -1265,8 +1809,8 @@ class X extends q {
     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, a = i[r];
-        n.push(o.X * t, o.Y * t, e, a.X * t, a.Y * t, e);
+        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);
       }
     }), new Float32Array(n);
   }
@@ -1278,16 +1822,42 @@ class X extends q {
    */
   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 a = Math.atan2(s, i), c = Math.atan2(r, o);
-    a = a < 0 ? a + 2 * Math.PI : a, c = c < 0 ? c + 2 * Math.PI : c;
-    let h, l;
-    return Math.abs(c - a) <= Math.PI ? (h = Math.min(a, c), l = Math.max(a, c)) : (h = Math.max(a, c), l = Math.min(a, c) + 2 * Math.PI), [h / (Math.PI / 180), l / (Math.PI / 180)];
+    let l = Math.atan2(s, i), c = Math.atan2(r, o);
+    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)];
+  }
+  /**
+   * 线段数据转为原始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 {
+        start: n.start.toJson(this.originalZAverage),
+        end: n.end.toJson(this.originalZAverage),
+        insetionArr: o,
+        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
+        }))
+      };
+    });
   }
   /**
    * 转为绘制数据
    */
   toDrawDataJson(t = "Millimeters") {
-    const e = st[t], n = {
+    const e = lt[t], n = {
       unit: t,
       line: [],
       arc: [],
@@ -1298,584 +1868,272 @@ class X extends q {
       scale: e
     };
     let i = "white";
-    function s(c, h) {
-      n.line.push([c.X * e, c.Y * e, h.X * e, h.Y * e, i]);
+    function s(c, a) {
+      n.line.push([c.X * e, c.Y * e, a.X * e, a.Y * e, i]);
     }
-    function o(c, h, l, d) {
+    function o(c, a, h, d) {
       n.arc.push([
         c.x * e,
         c.y * e,
-        h * e,
-        l,
+        a * e,
+        h,
         d,
         i
       ]);
     }
     for (let c = 0; c < this.originalData.length; c++) {
-      const h = this.originalData[c];
-      if (h.isVerticalReferenceLine) {
-        n.dimensionLine.push([h.start.x * e, h.start.y * e, h.end.x * e, h.end.y * e]);
+      const a = this.originalData[c];
+      if (a.isVerticalReferenceLine) {
+        n.dimensionLine.push([a.start.x * e, a.start.y * e, a.end.x * e, a.end.y * e]);
         break;
       }
     }
     this.wallsGroup.forEach((c) => {
-      for (let h = 0; h < c.length; h++) {
-        const l = c[h], d = h === c.length - 1 ? 0 : h + 1, f = c[d];
-        s(l, f);
+      for (let a = 0; a < c.length; a++) {
+        const h = c[a], d = a === c.length - 1 ? 0 : a + 1, u = c[d];
+        s(h, u);
       }
     });
-    const r = this.width * 0.2, a = [];
+    const r = this.width * 0.2, l = [];
     return this.doorLineSegment.forEach((c) => {
       if (c.length() < 0.4) return;
-      const h = c.clone().expansion(-this.width * 0.5);
-      if (i = "cyan", h.length() < 1.2) {
-        h.expansion(-r * 0.5);
-        const l = c.normal();
-        let d = new L(
-          h.start.clone(),
-          h.start.clone().add(l.clone().multiplyScalar(h.length()))
+      const a = c.clone().expansion(-this.width * 0.5);
+      if (i = "cyan", a.length() < 1.2) {
+        a.expansion(-r * 0.5);
+        const h = c.normal();
+        let d = new I(
+          a.start.clone(),
+          a.start.clone().add(h.clone().multiplyScalar(a.length()))
         );
-        const f = d.clone().directionMove(d.normal(), h.length() * -0.5).expandToRectangle(h.length(), "bothSides");
-        for (let b = 0; b < a.length; b++)
-          if (a[b].intersectRectangle(f)) {
-            d = new L(
-              h.start.clone(),
-              h.start.clone().add(l.clone().multiplyScalar(-h.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)) {
+            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 m = h.length(), y = d.length(), u = (m ** 2 + y ** 2) / (2 * y), x = d.end.clone().add(d.direction().multiplyScalar(-u)), [w, S] = this.getArcAngleRange(x, h.end, d.end);
-        o(x, u, Math.min(w, S), Math.max(w, S)), a.push(f);
-      } else
-        h.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((l, d) => s(l, d)), h.clone().directionMove(h.normal(), r * 0.5).directionMove(h.direction(), r * 0.5).expansion(-h.length() * 0.45, "end").forward(r * 0.5).expandToRectangle(r).path2D((l, d) => s(l, d)), h.clone().directionMove(h.normal(), -r * 0.5).directionMove(h.direction(), -r * 0.5).expansion(-h.length() * 0.45, "start").forward(-r * 0.5).expandToRectangle(r).path2D((l, d) => s(l, d));
-    }), i = "yellow", this.lineSegments.forEach((c) => {
-      if (!c.userData.isWindow) return !1;
-      Array.isArray(c.userData.drawWindow) && c.userData.drawWindow.forEach((h) => {
-        const { p: l, width: d } = h, f = p.from(l), m = f.clone().add(c.direction().multiplyScalar(d * 0.5)), y = f.clone().add(c.direction().multiplyScalar(-d * 0.5)), u = new L(m, y);
-        s(u.start, u.end), u.expandToRectangle(this.width, "bothSides").path2D((x, w) => s(x, w));
-      });
-    }), n;
-  }
-  /**
-   * 
-   * @param type 
-   */
-  async toDxfImageBlob(t = "Centimeters", e = "image/jpeg", n = "#000") {
-    const i = this.toDrawDataJson(t);
-    let s;
-    if (typeof window < "u")
-      s = document.createElement("canvas");
-    else if (typeof global < "u") {
-      const { createCanvas: c } = await G("canvas");
-      s = c();
-    } else
-      throw new Error("创建画布失败");
-    const o = 2 * i.scale, r = {
-      cyan: "cyan",
-      yellow: "yellow",
-      white: "white"
-    };
-    s.width = i.width + o * 2, s.height = i.height + o * 2;
-    const a = s.getContext("2d");
-    return n && (a.fillStyle = n, a.fillRect(0, 0, s.width, s.height)), a.translate(i.width * 0.5 + o, i.height * 0.5 + o), i.line.forEach(([c, h, l, d, f]) => {
-      a.strokeStyle = r[f], a.beginPath(), a.moveTo(c, h), a.lineTo(l, d), a.closePath(), a.stroke();
-    }), i.arc.forEach(([c, h, l, d, f, m]) => {
-      a.strokeStyle = r[m], a.beginPath(), a.arc(c, h, l, d * (Math.PI / 180), f * (Math.PI / 180)), a.stroke();
-    }), a.beginPath(), i.dimensionLine.forEach((c) => {
-      let [h, l, d, f] = c;
-      const m = Math.min(l, f), y = Math.max(l, f), u = (s.width * 0.5 - 0.4 * i.scale) * (h < 0 ? -1 : 1), x = (y - m) * 0.45;
-      a.fillStyle = "#fff", a.font = `${0.15 * i.scale}px Arial`, a.textAlign = "center", a.textBaseline = "middle", a.fillText((y - m).toFixed(2) + "cm", u, m + (y - m) * 0.5), a.moveTo(u - 0.1 * i.scale, m), a.lineTo(u + 0.1 * i.scale, m), a.moveTo(u, m), a.lineTo(u, x + m), a.moveTo(u, y), a.lineTo(u, y - x), a.moveTo(u - 0.1 * i.scale, y), a.lineTo(u + 0.1 * i.scale, y);
-    }), a.closePath(), a.strokeStyle = "#fff", a.stroke(), "toBlob" in s ? new Promise((c) => {
-      s.toBlob((h) => {
-        c(h);
-      }, e, 1);
-    }) : s.toBuffer(e, { quality: 1 });
-  }
-  /**
-   * 将点json结构转换为Dxf string
-   */
-  toDxfString(t = "Millimeters") {
-    const e = new R();
-    e.setUnits(t), e.addLayer("cyan", R.ACI.CYAN, "DOTTED"), e.addLayer("yellow", R.ACI.YELLOW, "DOTTED"), e.addLayer("white", R.ACI.WHITE, "DOTTED");
-    const n = this.toDrawDataJson();
-    return n.line.forEach((i) => {
-      let [s, o, r, a, c] = i;
-      e.setActiveLayer(c), e.drawLine(s, o, r, a);
-    }), n.arc.forEach((i) => {
-      const [s, o, r, a, c, h] = i;
-      e.setActiveLayer(h), e.drawArc(s, o, r, a, c);
-    }), e.toDxfString();
-  }
-  /**
-   * 将点云结构转换为DXF格式
-   * @returns 
-   */
-  toDxfBlob(t = "Millimeters") {
-    return new Blob([this.toDxfString(t)]);
-  }
-  /**
-   * 下载
-   * @param filename 
-   */
-  async download(t, e = "Millimeters") {
-    if (typeof window < "u") {
-      const n = this.toDxfBlob(e), i = document.createElement("a");
-      i.href = URL.createObjectURL(n), i.download = t + ".dxf", i.click();
-    } else typeof global < "u" && (await G("fs", !1)).writeFileSync(t, this.toDxfString(e));
-  }
-  /**
-   * 下载
-   * @param filename 
-   */
-  async downloadImage(t, e = "Centimeters", n = "image/jpeg") {
-    const i = await this.toDxfImageBlob(e, n);
-    if (!i) return !1;
-    if (typeof window < "u") {
-      const s = document.createElement("a");
-      s.href = URL.createObjectURL(i), s.download = t, s.click();
-    } else typeof global < "u" ? (await G("fs", !1)).writeFileSync(t, i) : console.error("图片下载失败");
-    return !0;
-  }
-  /**
-   * 计算原始数据的边界框
-   * @description 计算所有线段的起点和终点的最小最大值，形成一个边界框
-   * @returns 
-   */
-  computedOriginalSize(t, e = new v(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), a = Math.max(...i);
-    return e.set(s, o, r, a), e;
-  }
-  /**
-   * 创建数据
-   * @param pointsGroups 
-   * @returns 
-   */
-  static createData(t, e = !0) {
-    let n = 0;
-    return t.flatMap((s) => {
-      const o = s.map((r, a) => {
-        const c = a === s.length - 1 ? 0 : a + 1, h = s[c];
-        return {
-          start: { x: r.x, y: r.y },
-          end: { x: h.x, y: h.y },
-          insetionArr: [
-            {
-              index: c + n
-            }
-          ]
-        };
-      });
-      return n += s.length, e || (o.pop(), o[o.length - 1].insetionArr.length = 0, n--), o;
-    });
-  }
-}
-function V(g) {
-  if (g === null || typeof g != "object") return g;
-  if (g instanceof Date) return new Date(g.getTime());
-  if (Array.isArray(g)) return g.map(V);
-  const t = {};
-  for (const e in g)
-    Object.prototype.hasOwnProperty.call(g, e) && (t[e] = V(g[e]));
-  return t;
-}
-const I = new L();
-class ot extends X {
-  static name = "AngleCorrectionDxf";
-  angle = 0;
-  onAddFromParent(t) {
-    t.findComponentByName("LineAnalysis").addEventListener("analysisCompleted", async () => this.update());
-  }
-  async update() {
-    const t = this.parent, e = t.findComponentByName("Dxf"), n = t.findComponentByName("LineAnalysis");
-    let i = 0, s = null;
-    for (let c = 0; c < e.originalData.length; c++) {
-      const h = e.originalData[c];
-      if (I.start.copy(h.start), I.end.copy(h.end), h.isVerticalReferenceLine) {
-        const [l, d] = h.start.y < h.end.y ? [I.start, I.end] : [I.end, I.start];
-        i = -new L(l, d).direction().angleBetween(new p(0, 1), "angle", "360"), s = null;
-        break;
-      }
-      (!s || I.length() > s.length()) && (s = I.clone(), s.userData.index = c);
-    }
-    if (s) {
-      e.originalData[s.userData.index].isVerticalReferenceLine = !0;
-      const [c, h] = s.start.y < s.end.y ? [s.start, s.end] : [s.end, s.start];
-      i = -new L(c, h).direction().angleBetween(new p(0, 1), "angle", "360");
-    }
-    const o = e.originalBox.center, r = p.zero(), a = e.originalData.map((c) => {
-      const h = r.copy(c.start).division(o).rotate(p.zero(), i * (Math.PI / 180)).toJson(c.start.z), l = r.copy(c.end).division(o).rotate(p.zero(), i * (Math.PI / 180)).toJson(c.end.z), d = Object.assign(V(c), { start: h, end: l });
-      return d.drawWindow && d.drawWindow.forEach((f) => {
-        f.p = r.copy(f.p).division(o).rotate(p.zero(), i * (Math.PI / 180)).toJson(f.p.z), f.p.y = -f.p.y;
-      }), d;
-    });
-    n.appendLineSegmentList.forEach((c) => {
-      const h = c.clone();
-      h.start.division(o).rotate(p.zero(), i * (Math.PI / 180)), h.end.division(o).rotate(p.zero(), i * (Math.PI / 180)), a.push({
-        start: h.start.toJson(e.originalZAverage),
-        end: h.end.toJson(e.originalZAverage),
-        insetionArr: [],
-        length: h.length()
-      });
-    }), a.forEach((c) => {
-      c.start.y = -c.start.y, c.end.y = -c.end.y;
-    }), await this.set(a, e.width, e.scale), this.lineOffset(), this.doorLineSegment = e.doorLineSegment.map((c) => {
-      const h = c.clone();
-      return h.start.division(o).rotate(p.zero(), i * (Math.PI / 180)), h.end.division(o).rotate(p.zero(), i * (Math.PI / 180)), h.start.y = -h.start.y, h.end.y = -h.end.y, h;
-    }), this.angle = i, this.dispatchEvent({
-      type: "updateData"
-    });
-  }
-  // async set(data: OriginalDataItem[], width?: number, scale?: number): Promise<any> {
-  //     await super.set(data, width, scale)
-  //     const quadtree = new Quadtree(this.box)
-  //     this.lineSegments.forEach(line => {
-  //         if(line.userData.isDoor) return
-  //         quadtree.insert({
-  //             line,
-  //             userData: undefined
-  //         })
-  //     })
-  //     this.lineSegments.forEach(line => {
-  //         if(line.userData.isDoor) return
-  //         const lines = quadtree.queryLineSegment(line)
-  //             .filter(l => l.line !== line)
-  //             .map(l => l.line)
-  //         const offset = new ClipperLib.ClipperOffset(20, 0.25)
-  //         offset.AddPaths(lines.map( line => line.points.map(p => p.clone().multiplyScalar(1000)) ), ClipperLib.JoinType.jtMiter, ClipperLib.EndType.etOpenSquare)
-  //         const result = new ClipperLib.Paths()
-  //         offset.Execute(result, this.width / 2 * 1000)
-  //         console.log( result )
-  //         // const cpr = new ClipperLib.Clipper()
-  //         // offset.AddPath(linePaths, joinType, endType)
-  //     })
-  // }
-}
-class _ extends q {
-  static name = "Variable";
-  originalLineVisible = !0;
-  dxfVisible = !0;
-  whiteModelVisible = !0;
-  isLook = !1;
-  currentWheel = 0;
-  pointerMove = { x: 0, y: 0 };
-  currentKeyUp = "";
-  currentKeyDown = "";
-  currentMouseUp = "";
-  currentMouseDown = "";
-  focus = !1;
-  set(t, e) {
-    if (t in this) {
-      const n = this[t];
-      this[t] = e, this.dispatchEvent({
-        type: t,
-        value: e,
-        oldValue: n
-      });
-    }
-  }
-  get(t) {
-    if (t in this) return this[t];
-  }
-}
-class j {
-  bounds;
-  // 包围盒
-  capacity;
-  // 节点容量
-  maxDepth;
-  // 最大深度
-  depth;
-  // 当前深度
-  isLeaf = !0;
-  // 是否为叶子节点
-  children = null;
-  // 子节点数组
-  nodes = [];
-  // 存储的节点
-  color = [Math.random(), Math.random(), Math.random()];
-  // 颜色
-  constructor(t, e = 8, n = 10, i = 1) {
-    this.bounds = t, this.capacity = e, this.depth = i, this.maxDepth = n;
-  }
-  /**
-   * 插入线段节点
-   * @param node 线段节点
-   */
-  insert(t) {
-    if (!this.isLeaf) {
-      const e = this.getQuadrant(t.line);
-      if (e !== -1) {
-        this.children[e].insert(t);
-        return;
-      }
-    }
-    if (this.nodes.push(t), t.parent = this, this.isLeaf && this.nodes.length > this.capacity && this.depth < this.maxDepth) {
-      this.subdivide();
-      const e = this.nodes;
-      this.nodes = [];
-      for (const n of e) {
-        const i = this.getQuadrant(n.line);
-        i !== -1 ? this.children[i].insert(n) : (n.parent = this, this.nodes.push(n));
-      }
-    }
-  }
-  /** 移除
-   * @param node 
-   */
-  remove(t) {
-    const e = t.parent?.nodes.indexOf(t);
-    e > -1 && t.parent?.nodes.splice(e, 1);
-  }
-  /**
-   * 获取线段所属的象限
-   * @param line 线段
-   * @returns 象限索引（0:西北,1:东北,2:西南,3:东南）或-1（跨多个象限）
-   */
-  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;
-  }
-  /**
-   * 细分当前节点为四个子节点
-   */
-  subdivide() {
-    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 j(
-      new v(this.bounds.minX, t, this.bounds.minY, e),
-      this.capacity,
-      this.maxDepth,
-      this.depth + 1
-    ), this.children[1] = new j(
-      new v(t, this.bounds.maxX, this.bounds.minY, e),
-      this.capacity,
-      this.maxDepth,
-      this.depth + 1
-    ), this.children[2] = new j(
-      new v(this.bounds.minX, t, e, this.bounds.maxY),
-      this.capacity,
-      this.maxDepth,
-      this.depth + 1
-    ), this.children[3] = new j(
-      new v(t, this.bounds.maxX, e, this.bounds.maxY),
-      this.capacity,
-      this.maxDepth,
-      this.depth + 1
-    );
-  }
-  /**
-   * 查询与包围盒相交的线段节点
-   * @param box2 包围盒
-   * @returns 相交的节点数组
-   */
-  queryBox(t) {
-    const e = [];
-    if (!this.bounds.intersectBox(t))
-      return e;
-    for (const n of this.nodes)
-      t.intersectLineSegment(n.line) && e.push(n);
-    if (!this.isLeaf)
-      for (const n of this.children)
-        e.push(...n.queryBox(t));
-    return e;
-  }
-  /**
-   * 查询与圆形区域相交的线段节点
-   * @param pos 圆心
-   * @param radius 半径
-   * @returns 相交的节点数组
-   */
-  queryCircle(t, e) {
-    const n = [], i = new v(
-      t.x - e,
-      t.x + e,
-      t.y - e,
-      t.y + e
-    );
-    if (!this.bounds.intersectBox(i))
-      return n;
-    for (const s of this.nodes) {
-      const [o, r] = s.line.points, a = r.x - o.x, c = r.y - o.y, h = a * a + c * c;
-      let l = ((t.x - o.x) * a + (t.y - o.y) * c) / h;
-      l = Math.max(0, Math.min(1, l));
-      const d = o.x + l * a, f = o.y + l * c;
-      t.distance(new p(d, f)) <= e && n.push(s);
-    }
-    if (!this.isLeaf)
-      for (const s of this.children)
-        n.push(...s.queryCircle(t, e));
-    return n.sort((s) => s.line.length()), n;
-  }
-  /**
-   * 查询与矩形相交的线段节点
-   * @param rectangle 矩形
-   * @returns 相交的节点数组
-   */
-  queryRect(t) {
-    const e = [];
-    if (!this.bounds.intersectRectangle(t))
-      return e;
-    for (const n of this.nodes)
-      t.intersectLineSegment(n.line) && e.push(n);
-    if (!this.isLeaf)
-      for (const n of this.children)
-        e.push(...n.queryRect(t));
-    return e;
+        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);
+      } 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));
+    }), 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));
+      });
+    }), n;
   }
   /**
-   * 查询与线段相交的线段节点
-   * @param lineSegment 线段
-   * @returns 相交的节点数组
+   * 
+   * @param type 
    */
-  queryLineSegment(t, e = !0) {
-    const n = [];
-    if (!this.bounds.intersectLineSegment(t))
-      return n;
-    for (const i of this.nodes)
-      t.intersectLineSegment(i.line, e) && n.push(i);
-    if (!this.isLeaf)
-      for (const i of this.children)
-        n.push(...i.queryLineSegment(t));
-    return n;
+  async toDxfImageBlob(t = "Centimeters", e = "image/jpeg", n = "#000") {
+    const i = this.toDrawDataJson(t);
+    let s;
+    if (typeof window < "u")
+      s = document.createElement("canvas");
+    else if (typeof global < "u") {
+      const { createCanvas: c } = await O("canvas");
+      s = c();
+    } else
+      throw new Error("创建画布失败");
+    const o = 2 * i.scale, r = {
+      cyan: "cyan",
+      yellow: "yellow",
+      white: "white"
+    };
+    s.width = i.width + o * 2, s.height = i.height + o * 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();
+    }), 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.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);
+    }), l.closePath(), l.strokeStyle = "#fff", l.stroke(), "toBlob" in s ? new Promise((c) => {
+      s.toBlob((a) => {
+        c(a);
+      }, e, 1);
+    }) : s.toBuffer(e, { quality: 1 });
   }
   /**
-   * 包围盒转换为数组
-   * @param array 
-   * @param colors 
-   * @returns 
+   * 将点json结构转换为Dxf string
    */
-  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];
-    })), t;
-  }
-}
-class U {
-  map = /* @__PURE__ */ new Map();
-  gridSize;
-  constructor(t = 2) {
-    this.gridSize = t;
+  toDxfString(t = "Millimeters") {
+    const e = new W();
+    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);
+    }), n.arc.forEach((i) => {
+      const [s, o, r, l, c, a] = i;
+      e.setActiveLayer(a), e.drawArc(s, o, r, l, c);
+    }), e.toDxfString();
   }
   /**
-   * 插入
-   * @param point 
-   * @param userData 
+   * 将点云结构转换为DXF格式
+   * @returns 
    */
-  insert(t, e) {
-    if (!t || isNaN(t.x) || isNaN(t.y))
-      throw new Error("无效的点坐标");
-    const n = this.getGridId(t);
-    this.map.has(n) || this.map.set(n, /* @__PURE__ */ new Set());
-    const i = this.map.get(n), s = { point: t, userData: e };
-    i.add(s), t.userData.pointVirtualGrid = { set: i, target: s };
+  toDxfBlob(t = "Millimeters") {
+    return new Blob([this.toDxfString(t)]);
   }
   /**
-   * 批量加入
-   * @param points 
-   */
-  insertBatch(t) {
-    for (const { point: e, userData: n } of t)
-      this.insert(e, n);
+  * 下载原始json
+  * @param filename 
+  */
+  async downloadOriginalData(t) {
+    const e = JSON.stringify(this.originalData, null, 2);
+    if (typeof window < "u") {
+      const n = new Blob([e], { type: "application/json" }), i = document.createElement("a");
+      i.href = URL.createObjectURL(n), i.download = t, i.click();
+    } else typeof global < "u" && (await O("fs", !1)).writeFileSync(t, e);
   }
-  /** 移除点
-   * @param point 
+  /**
+   * 下载
+   * @param filename 
    */
-  remove(t) {
-    const { set: e, target: n } = t?.userData?.pointVirtualGrid;
-    e && (e.delete(n), delete t?.userData?.pointVirtualGridMap);
+  async download(t, e = "Millimeters") {
+    if (typeof window < "u") {
+      const n = this.toDxfBlob(e), i = document.createElement("a");
+      i.href = URL.createObjectURL(n), i.download = t + ".dxf", i.click();
+    } else typeof global < "u" && (await O("fs", !1)).writeFileSync(t, this.toDxfString(e));
   }
   /**
-   * 获取通过坐标，获取唯一网格索引
-   * @param point 
-   * @returns 
+   * 下载
+   * @param filename 
    */
-  getGridId(t) {
-    const e = Math.ceil(t.x / this.gridSize), n = Math.ceil(t.y / this.gridSize);
-    return `${e}.${n}`;
+  async downloadImage(t, e = "Centimeters", n = "image/jpeg") {
+    const i = await this.toDxfImageBlob(e, n);
+    if (!i) return !1;
+    if (typeof window < "u") {
+      const s = document.createElement("a");
+      s.href = URL.createObjectURL(i), s.download = t, s.click();
+    } else typeof global < "u" ? (await O("fs", !1)).writeFileSync(t, i) : console.error("图片下载失败");
+    return !0;
   }
   /**
-   * 
-   * @param gridId 
+   * 计算原始数据的边界框
+   * @description 计算所有线段的起点和终点的最小最大值，形成一个边界框
    * @returns 
    */
-  decodeGridId(t) {
-    const [e, n] = t.split(".").map(Number);
-    return new p(e, n);
+  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;
   }
   /**
-   * 查询与矩形相交的点
-   * @param rectangle 矩形
-   * @returns 相交的节点数组
+   * 创建数据
+   * @param pointsGroups 
+   * @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 a = s; a <= o; a++) {
-        const c = `${r}.${a}`;
-        if (!this.map.has(c)) continue;
-        this.map.get(c)?.forEach((l) => {
-          t.containsPoint(l.point);
-        });
-      }
+  static createData(t, e = !0) {
+    let n = 0;
+    return t.flatMap((s) => {
+      const o = s.map((r, l) => {
+        const c = l === s.length - 1 ? 0 : l + 1, a = s[c];
+        return {
+          start: { x: r.x, y: r.y },
+          end: { x: a.x, y: a.y },
+          insetionArr: [
+            {
+              index: c + n
+            }
+          ]
+        };
+      });
+      return n += s.length, e || (o.pop(), o[o.length - 1].insetionArr.length = 0, n--), o;
+    });
   }
-  /**
-   * 查询与圆形区域相交的点
-   * @param pos 圆心
-   * @param radius 半径
-   * @returns 相交的节点数组
-   */
-  queryCircle(t, e) {
-    const n = new v(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), a = [];
-    for (let c = i; c <= s; c++)
-      for (let h = o; h <= r; h++) {
-        const l = `${c}.${h}`;
-        if (!this.map.has(l)) continue;
-        this.map.get(l)?.forEach((f) => {
-          t.distance(f.point) <= e && a.push(f);
-        });
-      }
-    return a;
+}
+function $(M) {
+  if (M === null || typeof M != "object") return M;
+  if (M instanceof Date) return new Date(M.getTime());
+  if (Array.isArray(M)) return M.map($);
+  const t = {};
+  for (const e in M)
+    Object.prototype.hasOwnProperty.call(M, e) && (t[e] = $(M[e]));
+  return t;
+}
+const N = new I();
+class ht extends z {
+  static name = "AngleCorrectionDxf";
+  angle = 0;
+  onAddFromParent(t) {
+    t.findComponentByName("LineAnalysis").addEventListener("analysisCompleted", async () => this.update());
   }
-  /**
-   * 查询与包围盒相交的点
-   * @param box2 包围盒
-   * @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++)
-      for (let a = i; a <= s; a++) {
-        const c = `${r}.${a}`;
-        if (!this.map.has(c)) continue;
-        this.map.get(c)?.forEach((l) => {
-          t.containsPoint(l.point) && o.push(l);
-        });
+  async update() {
+    const t = this.parent, e = t.findComponentByName("Dxf"), n = t.findComponentByName("LineAnalysis");
+    let i = 0, s = null;
+    for (let c = 0; c < e.originalData.length; c++) {
+      const a = e.originalData[c];
+      if (N.start.copy(a.start), N.end.copy(a.end), a.isVerticalReferenceLine) {
+        const [h, d] = a.start.y < a.end.y ? [N.start, N.end] : [N.end, N.start];
+        i = -new I(h, d).direction().angleBetween(new g(0, 1), "angle", "360"), s = null;
+        break;
       }
-    return o;
+      (!s || N.length() > s.length()) && (s = N.clone(), s.userData.index = c);
+    }
+    if (s) {
+      e.originalData[s.userData.index].isVerticalReferenceLine = !0;
+      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 });
+      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);
+      }), 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({
+        start: a.start.toJson(e.originalZAverage),
+        end: a.end.toJson(e.originalZAverage),
+        insetionArr: [],
+        length: a.length()
+      });
+    }), 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;
+    }), this.angle = i, this.dispatchEvent({
+      type: "updateData"
+    });
   }
-  /**
-   * 查找相同点
-   * @param point 
-   */
-  queryPoint(t) {
-    const e = this.getGridId(t), n = [];
-    return this.map.has(e) && this.map.get(e)?.forEach((s) => {
-      t.equal(s.point) && n.push(s);
-    }), n;
+}
+class et extends V {
+  static name = "Variable";
+  originalLineVisible = !0;
+  dxfVisible = !0;
+  whiteModelVisible = !0;
+  isLook = !1;
+  currentWheel = 0;
+  pointerMove = { x: 0, y: 0 };
+  currentKeyUp = "";
+  currentKeyDown = "";
+  currentMouseUp = "";
+  currentMouseDown = "";
+  focus = !1;
+  set(t, e) {
+    if (t in this) {
+      const n = this[t];
+      this[t] = e, this.dispatchEvent({
+        type: t,
+        value: e,
+        oldValue: n
+      });
+    }
   }
-  /**
-   * 查找点自己
-   * @param point 
-   */
-  queryPointSelf(t) {
-    return t.userData.pointVirtualGrid && t.userData.pointVirtualGrid.target ? t.userData.pointVirtualGrid.target : null;
+  get(t) {
+    if (t in this) return this[t];
   }
 }
-class rt {
+class dt {
   // 所有可查找的点位
   possibleDoorPoints = [];
   doorPoint = [];
@@ -1910,32 +2168,32 @@ class rt {
     const o = this.dxf, r = this.searchNearby(t, e, i, s);
     r.push(
       ...t.map((c) => {
-        const h = this.searchAlongDirection(c, i);
-        if (h) return {
+        const a = this.searchAlongDirection(c, i);
+        if (a) return {
           start: c.point,
-          end: h.point
+          end: a.point
         };
-        const l = this.searchAlongNormalDirection(c, i);
-        if (l) return {
+        const h = this.searchAlongNormalDirection(c, i);
+        if (h) return {
           start: c.point,
-          end: l.point
+          end: h.point
         };
       }).filter((c) => !!c && c.start.distance(c.end) < i)
     );
-    const a = [];
+    const l = [];
     return r.forEach((c) => {
-      const h = new L(c?.start, c?.end), l = h.length();
-      if (l < n) return;
-      const d = h.normal(), f = h.direction(), m = (l - o.width * 2) / 2;
+      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;
       for (let y = 0; y < 3; y++) {
-        const u = h.start.clone().add(f.clone().multiplyScalar(o.width + m * y)), x = new L(
-          u,
-          u.clone().add(d.clone().multiplyScalar(1))
+        const p = a.start.clone().add(u.clone().multiplyScalar(o.width + f * y)), x = new I(
+          p,
+          p.clone().add(d.clone().multiplyScalar(1))
         );
         if (x.directionMove(d, -0.5), this.quadtree.queryLineSegment(x).length) return;
       }
-      a.push(h);
-    }), a;
+      l.push(a);
+    }), l;
   }
   /** 添加可查找点的过滤规则
    * @param rule 
@@ -1952,7 +2210,7 @@ class rt {
     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: N() });
+        this.pointVirtualGrid.queryPoint(n).filter((o) => o.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: k() });
       });
     }), t;
   }
@@ -1964,21 +2222,21 @@ class rt {
     return e.doors.forEach((i) => {
       const s = e.lineSegments[i[4]], o = e.originalData[i[4]];
       if (o.drawDoorData) {
-        const r = p.from(o.drawDoorData.start), a = p.from(o.drawDoorData.n), c = n.queryPoint(r).filter((h) => {
-          if (h.userData === s) return !1;
-          const l = h.userData, d = l.direction();
-          l.start.equal(r) && d.multiplyScalar(-1);
-          const f = a.angleBetween(d, "angle");
-          return f > 80 || f < 10;
+        const r = g.from(o.drawDoorData.start), l = g.from(o.drawDoorData.n), c = n.queryPoint(r).filter((a) => {
+          if (a.userData === s) return !1;
+          const h = a.userData, d = h.direction();
+          h.start.equal(r) && d.multiplyScalar(-1);
+          const u = l.angleBetween(d, "angle");
+          return u > 80 || u < 10;
         });
         c.length && t.push({
           line: c[0].userData,
           point: r,
-          uuid: N()
+          uuid: k()
         });
       } else if (o.doorDirectConnection) {
         this.continueFind = !1;
-        const r = new L(p.from(o.start), p.from(o.end));
+        const r = new I(g.from(o.start), g.from(o.end));
         r.userData = {
           doorDirectConnection: !0,
           isDoor: !0
@@ -1994,8 +2252,8 @@ class rt {
   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), a = n.projectPoint(i.end), c = s && o ? -1 : s ? 0 : o ? 1 : -1, h = r && a ? -1 : r ? 0 : a ? 1 : -1;
-      t.has(e.sourceIndex) ? t.get(e.sourceIndex) != c && t.set(e.sourceIndex, -1) : t.set(e.sourceIndex, c), t.has(e.targetIndex) ? t.get(e.targetIndex) != h && t.set(e.targetIndex, -1) : t.set(e.targetIndex, h);
+      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;
+      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;
   }
   /** 查找方案一：最近点查找
@@ -2008,93 +2266,93 @@ class rt {
    */
   searchNearby(t, e = [], n = this.doorSearchDistance, i = this.doorSearchNearAngle) {
     const s = this.findPointVirtualGrid, o = this.quadtree;
-    function r({ point: u, line: x }, w, S) {
+    function r({ point: p, line: x }, D, w) {
       const b = x.direction();
-      x.start === u && b.multiplyScalar(-1);
-      const P = s.queryCircle(u, n).filter((D) => D.userData !== x).sort((D, E) => D.point.distance(u) - E.point.distance(u)), A = [];
-      for (let D = 0; D < P.length; D++) {
-        const E = e.findIndex((T) => T.point === P[D].point), B = t[w].uuid, Y = e[E].uuid;
-        if (S.has(`${B}.${Y}`)) continue;
-        S.add(`${B}.${Y}`), S.add(`${Y}.${B}`);
-        const Q = P[D].point, C = new L(u.clone(), Q.clone());
-        if (C.direction().angleBetween(b, "angle") < i) {
-          const T = t[E].line.direction();
-          P[D].userData.start.equal(P[D].point) && T.multiplyScalar(-1), C.direction().multiplyScalar(-1).angleBetween(T, "angle") < i && (o.queryLineSegment(C).length || A.push({
-            findData: P[D],
-            findUuid: Y,
-            doorLine: C,
-            doorUuid: B
+      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 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,
+            doorLine: B,
+            doorUuid: E
           }));
         }
       }
-      return A;
+      return S;
     }
-    function a(u, x, w, S, b) {
-      S.add(u);
+    function l(p, x, D, w, b) {
+      w.add(p);
       const P = [];
       b && P.push(b);
-      for (let A = 0; A < w.length; A++) {
-        const D = w[A];
-        if (x.has(D.findUuid)) {
-          const E = x.get(D.findUuid);
-          a(D.findUuid, x, E, S, D) && P.push(D);
-        } else P.push(D);
+      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);
       }
-      return P.sort((A, D) => A.doorLine.length() - D.doorLine.length()), b && P[0] === b ? (w.splice(0), !0) : (w.splice(1), !1);
+      return P.sort((S, m) => S.doorLine.length() - m.doorLine.length()), b && P[0] === b ? (D.splice(0), !0) : (D.splice(1), !1);
     }
-    const c = /* @__PURE__ */ new Set(), h = /* @__PURE__ */ new Map();
-    t.map((u, x) => {
-      const w = r(u, x, c);
-      w.length && h.set(u.uuid, w);
+    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);
     }), c.clear();
-    const l = /* @__PURE__ */ new Map();
-    h.forEach((u, x) => {
-      if (!c.has(x) && u.length && a(x, h, u, c), u.length) {
-        const w = u[0];
-        l.has(w.doorUuid) || l.set(w.doorUuid, []), l.get(w.doorUuid)?.push(w), l.has(w.findUuid) || l.set(w.findUuid, []), l.get(w.findUuid)?.push(w);
+    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];
+        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();
-    l.forEach((u) => {
-      if (u.length > 1) {
-        u.sort((x, w) => x.doorLine.length() - w.doorLine.length());
-        for (let x = 1; x < u.length; x++) d.add(u[x]);
+    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]);
       }
     });
-    const f = [], m = [];
-    h.forEach((u) => {
-      if (u.length) {
-        const x = u[0];
-        d.has(x) || (f.push(x), m.push(x.doorUuid, x.findUuid));
+    const u = [], f = [];
+    a.forEach((p) => {
+      if (p.length) {
+        const x = p[0];
+        d.has(x) || (u.push(x), f.push(x.doorUuid, x.findUuid));
       }
     });
     const y = [];
-    return f.forEach((u) => {
-      const x = t.findIndex((E) => E.uuid === u.doorUuid), w = e.findIndex((E) => E.uuid === u.findUuid), S = t[x].point.clone(), b = e[w].point.clone(), P = this.findLongLineSegment(t[x].line), A = this.findLongLineSegment(e[w].line), D = P.projectPoint(b);
-      if (D) {
-        S.copy(D);
-        const E = new L(S, b), B = A.includedAngle(E);
-        (B < 10 || B > 170 || Math.abs(90 - B) < 10) && y.push({
-          start: S,
+    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);
+        (E < 10 || E > 170 || Math.abs(90 - E) < 10) && y.push({
+          start: w,
           end: b
         });
       } else {
-        const E = A.projectPoint(S);
-        E && b.copy(E);
-        const B = new L(S, b), Y = P.includedAngle(B);
-        (Y < 10 || Y > 170 || Math.abs(90 - Y) < 10) && y.push({
-          start: S,
+        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({
+          start: w,
           end: b
         });
       }
     }), e.splice(
       0,
       e.length,
-      ...e.filter((u) => m.indexOf(u.uuid) === -1)
+      ...e.filter((p) => f.indexOf(p.uuid) === -1)
     ), t.splice(
       0,
       t.length,
-      ...t.filter((u) => m.indexOf(u.uuid) === -1)
+      ...t.filter((p) => f.indexOf(p.uuid) === -1)
     ), y;
   }
   /** 方案二： 沿方向查找
@@ -2105,12 +2363,12 @@ class rt {
   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 L(t.clone(), o), a = i.queryLineSegment(r).map((c) => ({
+    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),
       line: c.line
-    })).filter((c) => c.point).sort((c, h) => t.distance(c.point) - t.distance(h.point));
-    if (a.length) {
-      const c = a[0];
+    })).filter((c) => c.point).sort((c, a) => t.distance(c.point) - t.distance(a.point));
+    if (l.length) {
+      const c = l[0];
       if (Math.abs(90 - c.line.direction().angleBetween(s, "angle")) < 5)
         return c;
     }
@@ -2122,22 +2380,22 @@ class rt {
    * @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), a = e.start.clone();
-    e.start === t && o.multiplyScalar(-1), e.start === t && a.copy(e.end);
-    const c = i.queryPoint(a).filter((d) => d.userData !== e);
+    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 c = i.queryPoint(l).filter((d) => d.userData !== e);
     for (let d = 0; d < c.length; d++) {
-      const f = c[d], m = f.userData, y = m.direction();
-      if (m.start === f.point && o.multiplyScalar(-1), y.angleBetween(r) / (Math.PI / 180) > 90) {
+      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);
         break;
       }
     }
-    const h = new L(t.clone(), t.clone().add(r.multiplyScalar(n))), l = s.queryLineSegment(h).map((d) => ({
-      point: d.line.getIntersection(h),
+    const a = new I(t.clone(), t.clone().add(r.multiplyScalar(n))), h = s.queryLineSegment(a).map((d) => ({
+      point: d.line.getIntersection(a),
       line: d.line
-    })).filter((d) => d.point).sort((d, f) => t.distance(d.point) - t.distance(f.point));
-    if (l.length) {
-      const d = l[0];
+    })).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)
         return d;
     }
@@ -2166,12 +2424,12 @@ class rt {
     return e;
   }
 }
-class at extends q {
+class ut extends V {
   static name = "LineAnalysis";
   Dxf = null;
   Variable = null;
   lineSegmentList = [];
-  container = new M.Group();
+  container = new q.Group();
   // 误差角度
   errorAngle = 4;
   width = 0.4;
@@ -2180,7 +2438,7 @@ class at extends q {
    * @param parent 
    */
   onAddFromParent(t) {
-    this.Dxf = t.findComponentByType(X), this.Variable = this.parent?.findComponentByType(_), this.Dxf.addEventListener("setDta", this.lineAnalysis.bind(this)), this.Dxf.addEventListener("createGroup", this.doorsAnalysis.bind(this));
+    this.Dxf = t.findComponentByType(z), this.Variable = this.parent?.findComponentByType(et), this.Dxf.addEventListener("setDta", this.lineAnalysis.bind(this)), this.Dxf.addEventListener("createGroup", this.doorsAnalysis.bind(this));
   }
   /**
    * 
@@ -2190,15 +2448,15 @@ class at extends q {
    * @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, a = i.y * n * 0.5;
+    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;
     return {
       points: [
         // 第一条线
-        new p(t.x + r, t.y + a).add(o),
-        new p(e.x + r, e.y + a).add(s),
+        new g(t.x + r, t.y + l).add(o),
+        new g(e.x + r, e.y + l).add(s),
         // 第二条线
-        new p(t.x - r, t.y - a).add(o),
-        new p(e.x - r, e.y - a).add(s)
+        new g(t.x - r, t.y - l).add(o),
+        new g(e.x - r, e.y - l).add(s)
       ],
       indices: [0, 1, 1, 3, 3, 2, 2, 0],
       rectIndices: [0, 1, 3, 2, 0]
@@ -2212,7 +2470,7 @@ class at extends q {
    */
   addData(t, e) {
     const n = this.Dxf;
-    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new L(t.clone(), e.clone()));
+    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new I(t.clone(), e.clone()));
   }
   /** 结果分析创建矩形
    * @param result 
@@ -2220,14 +2478,14 @@ class at extends q {
   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), a = s / r, c = o / r, h = i.points[0].direction(n.points[0]), l = i.points[1].direction(n.points[1]), d = n.points[0].clone(), f = n.points[1].clone(), m = f.direction(d);
-    m.multiplyScalar(e.width * 0.5);
-    const y = d.clone().add(m), u = f.clone().add(m.multiplyScalar(-1)), x = d.direction(f), w = y.direction(u);
-    if (!(x.x > 0 && w.x < 0 || x.x < 0 && w.x > 0 || x.y > 0 && w.y < 0 || x.y < 0 && w.y > 0)) {
-      d.set(y.x, y.y), f.set(u.x, u.y);
-      for (let S = 1; S < r; S++) {
-        const b = h.clone().multiplyScalar(a * S), P = l.clone().multiplyScalar(c * S), A = d.clone().add(b), D = f.clone().add(P);
-        this.addData(A, D);
+    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);
+    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);
+    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);
       }
     }
   }
@@ -2237,7 +2495,7 @@ class at extends q {
    */
   buildQuadtree() {
     const t = this.Dxf, e = [];
-    this.quadtree = new j(t.originalBox, 2), t.lineSegments.forEach((n) => {
+    this.quadtree = new T(t.originalBox, 2), t.lineSegments.forEach((n) => {
       n.userData?.isDoor || (this.quadtree?.insert({
         line: n,
         userData: e.length
@@ -2254,12 +2512,12 @@ class at extends q {
     this.buildQuadtree();
     const t = this.quadtree, e = this.lineSegmentList, n = /* @__PURE__ */ new Set(), i = [];
     e.forEach((s, o) => {
-      const r = e[o], a = O.fromByLineSegment(r, this.width * 2, !1, -0.01);
-      t.queryRect(a).map((h) => h.userData).filter((h) => h !== o).forEach((h) => {
+      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) => {
         try {
-          if (n.has(`${o}-${h}`) || n.has(`${h}-${o}`)) return;
-          const l = this.projectionAnalysis(h, o, r, e);
-          l && i.push(l), n.add(`${o}-${h}`);
+          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}`);
         } catch {
         }
       });
@@ -2272,37 +2530,163 @@ class at extends q {
    * @returns 
    */
   projectionAnalysis(t, e, n, i) {
-    const s = i[t], o = n.direction(), r = s.direction(), a = o.angleBetween(r) / (Math.PI / 180);
-    if (a < this.errorAngle || a > 180 - this.errorAngle) {
+    const s = i[t], o = n.direction(), r = s.direction(), l = o.angleBetween(r) / (Math.PI / 180);
+    if (l < this.errorAngle || l > 180 - this.errorAngle) {
       let c;
-      const h = s.projectLineSegment(n), l = n.projectLineSegment(s);
-      return h.getLength() > l.getLength() ? c = {
+      const a = s.projectLineSegment(n), h = n.projectLineSegment(s);
+      return a.getLength() > h.getLength() ? c = {
         target: s,
         targetIndex: t,
         source: n,
         sourceIndex: e,
-        project: h,
-        project2: l
+        project: a,
+        project2: h
       } : c = {
         target: n,
         targetIndex: e,
         source: s,
         sourceIndex: t,
-        project: l,
-        project2: h
+        project: h,
+        project2: a
       }, !c || c.project.getLength() < 0.2 || c.project2.getLength() < 0.2 ? void 0 : c;
     }
   }
   doorSearchNearAngle = 110;
   doorSearchDistance = 2;
   doors = [];
+  DoorsAnalysis;
   doorsAnalysis() {
-    new rt(this), this.dispatchEvent({
+    this.DoorsAnalysis = new dt(this), this.dispatchEvent({
       type: "analysisCompleted"
     });
   }
 }
-class ct extends it {
+class ft extends V {
+  static name = "ThreeVJia";
+  lineSegments = [];
+  onAddFromParent() {
+    (this.parent?.findComponentByName("AngleCorrectionDxf")).addEventListener("updateData", async () => this.updateData());
+  }
+  updateData() {
+    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 = [];
+    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 l = [];
+    s = s.filter((a) => {
+      if (r.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");
+          }
+          h.sort((f, y) => f.userData.length - y.userData.length);
+          const u = [];
+          for (let f = 0; f < h.length; f++) {
+            const y = h[f];
+            y.userData.type === "start" ? (u.length === 0 && (l.push(new I(d.start.clone(), y.clone())), d.start.copy(y)), u.push("start")) : (u.pop(), u.length === 0 && d.start.copy(y));
+          }
+          l.push(d);
+        }
+        return !1;
+      }
+      return !0;
+    }), s.push(...o), s.push(...l.filter((a) => a.length() > 0.05));
+    const c = e.box.center;
+    s = s.map((a) => {
+      const h = a.clone();
+      return h.start.rotate(c, n.angle * (Math.PI / 180)), h.end.rotate(c, n.angle * (Math.PI / 180)), h;
+    }), this.lineSegments = s;
+  }
+  toJson() {
+    const e = /* @__PURE__ */ new Map();
+    let n = 0;
+    return {
+      version: "2",
+      name: "测试",
+      communityName: "测试",
+      city: "",
+      province: "",
+      height: 2.8,
+      walls: this.lineSegments.map((i) => {
+        if (!(i.userData.isDoor && !i.userData.doorDirectConnection))
+          return e.set(i, n), {
+            ID: n++,
+            start: { x: i.start.x * 1, y: i.start.y * 1 },
+            end: { x: i.end.x * 1, y: i.end.y * 1 },
+            thickness: (i.userData.wallWidth ? i.userData.wallWidth : 0.12) * 1,
+            type: "LINE",
+            loadBearingWall: !1,
+            height: 2.8 * 1
+          };
+      }).filter((i) => !!i),
+      pillars: [],
+      beams: [],
+      holes: this.lineSegments.flatMap((i) => {
+        if (i.userData.isDoor && i.userData.doorDirectConnection)
+          return {
+            id: n++,
+            type: "DOOR",
+            openSide: "RIGHT",
+            start: {
+              x: i.start.x * 1,
+              y: i.start.y * 1
+            },
+            end: {
+              x: i.end.x * 1,
+              y: i.end.y * 1
+            },
+            height: 2.1 * 1,
+            qroundClearance: 0,
+            sillHeight: 0
+          };
+        if (i.userData.isWindow)
+          return i.userData.drawWindow.map((s) => {
+            const o = g.from(s.p), r = o.clone().add(
+              i.direction().multiplyScalar(s.width * 0.5)
+            ), l = o.clone().add(
+              i.direction().multiplyScalar(-s.width * 0.5)
+            );
+            return {
+              id: n++,
+              type: "WINDOW",
+              start: {
+                x: r.x * 1,
+                y: r.y * 1
+              },
+              end: {
+                x: l.x * 1,
+                y: l.y * 1
+              },
+              height: 1.6 * 1,
+              groundClearance: 0.9 * 1,
+              sillHeiqht: 0.9 * 1
+            };
+          });
+      }).filter((i) => !!i),
+      rooms: []
+    };
+  }
+  /**
+   * 下载
+   * @param filename 
+   */
+  async download(t = "download.json") {
+    if (typeof window < "u") {
+      const e = new Blob([JSON.stringify(this.toJson())]), n = document.createElement("a");
+      n.href = URL.createObjectURL(e), n.download = t, n.click();
+    } else typeof global < "u" && (await O("fs", !1)).writeFileSync(t, JSON.stringify(this.toJson()));
+  }
+}
+class pt extends ct {
   Dxf;
   AngleCorrectionDxf;
   Variable;
@@ -2313,7 +2697,7 @@ class ct extends it {
    * @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 X(this.wallWidth, e), this.AngleCorrectionDxf = new ot(), this.Variable = new _(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(new at()), this.addComponent(this.AngleCorrectionDxf);
+    super(), this.environment = typeof window < "u" ? "browser" : typeof global < "u" ? "node" : "unknown", this.wallWidth = t, this.Dxf = new z(this.wallWidth, e), this.AngleCorrectionDxf = new ht(), this.Variable = new et(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(new ut()), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new ft());
   }
   usePlugin(t) {
     return typeof t == "function" && t.call(this, this), this;
@@ -2326,33 +2710,33 @@ class ct extends it {
     });
   }
 }
-const ht = new et(), lt = new nt();
-function dt(g, t, e = 0.1) {
-  const n = t.normal(g), i = t.direction(g).mutiplyScalar(e * 0.5), s = g.direction(t).mutiplyScalar(e * 0.5), o = n.x * e * 0.5, r = n.y * e * 0.5;
+const mt = new rt(), 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;
   return {
     points: [
       // 第一条线
-      new p(g.x + o, g.y + r).add(s),
-      new p(t.x + o, t.y + r).add(i),
+      new g(M.x + o, M.y + r).add(s),
+      new g(t.x + o, t.y + r).add(i),
       // 第二条线
-      new p(g.x - o, g.y - r).add(s),
-      new p(t.x - o, t.y - r).add(i)
+      new g(M.x - o, M.y - r).add(s),
+      new g(t.x - o, t.y - r).add(i)
     ],
     indices: [0, 1, 1, 3, 3, 2, 2, 0],
     rectIndices: [0, 1, 3, 2, 0]
   };
 }
-class H extends q {
+class nt extends V {
   static name = "WhiteModel";
   Dxf = null;
   Variable = null;
   // dxf数据白模
-  whiteModelGroup = new M.Group();
+  whiteModelGroup = new q.Group();
   // dxf数据白模边缘线
-  whiteModelLineGroup = new M.Group();
+  whiteModelLineGroup = new q.Group();
   // 原始数据白模
-  originalWhiteMode = new M.Group();
-  material = new M.MeshBasicMaterial({ color: 16777215, transparent: !0, opacity: 0.8, side: M.DoubleSide });
+  originalWhiteMode = new q.Group();
+  material = new q.MeshBasicMaterial({ color: 16777215, transparent: !0, opacity: 0.8, side: q.DoubleSide });
   onAddFromParent(t) {
     this.Dxf = t.findComponentByName("Dxf"), this.Variable = t.findComponentByName("Variable"), this.originalWhiteMode.visible = !1, this.Dxf?.addEventListener("lineOffset", () => {
       this.updateModel();
@@ -2362,35 +2746,35 @@ class H extends q {
     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 i = new M.Shape();
-      n.forEach((r, a) => a === 0 ? i.moveTo(r.x / t.scale, r.y / t.scale) : i.lineTo(r.x / t.scale, r.y / t.scale));
-      const s = new M.ExtrudeGeometry(i, {
+      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));
+      const s = new q.ExtrudeGeometry(i, {
         depth: 2.8,
         bevelSize: 0
-      }), o = new M.Mesh(s, this.material);
+      }), o = new q.Mesh(s, this.material);
       this.whiteModelGroup.add(o), this.whiteModelLineGroup.add(
-        new M.LineSegments(new M.EdgesGeometry(s), new M.LineBasicMaterial({ color: 0 }))
+        new q.LineSegments(new q.EdgesGeometry(s), new q.LineBasicMaterial({ color: 0 }))
       );
     }), t.originalData.map(({ start: n, end: i, insetionArr: s }) => {
-      const o = new p(n.x, n.y).mutiplyScalar(t.scale), r = new p(i.x, i.y).mutiplyScalar(t.scale), { points: a, indices: c, rectIndices: h } = dt(o, r, t.width);
+      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);
       return {
-        points: a,
+        points: l,
         indices: c,
-        rectIndices: h,
-        insetions: (s ?? []).map((l) => l.index)
+        rectIndices: a,
+        insetions: (s ?? []).map((h) => h.index)
       };
     }).forEach((n) => {
-      const i = new M.Shape();
-      n.rectIndices.forEach((r, a) => {
+      const i = new q.Shape();
+      n.rectIndices.forEach((r, l) => {
         const c = n.points[r];
-        a === 0 ? i.moveTo(c.x, c.y) : i.lineTo(c.x, c.y);
+        l === 0 ? i.moveTo(c.x, c.y) : i.lineTo(c.x, c.y);
       });
-      const s = new M.ExtrudeGeometry(i, {
+      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 M.Mesh(s);
+      const o = new q.Mesh(s);
       this.originalWhiteMode?.add(o);
     }), this.dispatchEvent({
       type: "updateModel",
@@ -2405,7 +2789,7 @@ class H extends q {
   toOBJ() {
     return new Promise((t) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(() => {
-        t(ht.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
+        t(mt.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
       }, 20);
     });
   }
@@ -2418,7 +2802,7 @@ class H extends q {
     return new Promise((e) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(async () => {
         if (typeof window == "object")
-          lt.parse(this.whiteModelGroup.children, (n) => {
+          xt.parse(this.whiteModelGroup.children, (n) => {
             e(n), this.material.opacity = 0.8, this.material.transparent = !0;
           }, () => {
             e(void 0);
@@ -2427,7 +2811,7 @@ class H extends q {
           });
         else if (typeof global != "function")
           try {
-            const n = await G("obj2gltf", !0), i = await G("fs", !1), s = await this.toOBJ(), o = Date.now().toString(16) + "-" + Math.floor(Math.random() * 16777215).toString(16);
+            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, {
               binary: t
@@ -2470,7 +2854,7 @@ class H extends q {
       n.href = URL.createObjectURL(e), n.download = t, n.click();
     } else if (typeof global < "u") {
       const e = await this.toOBJ();
-      e && (await G("fs", !1)).writeFileSync(t, e);
+      e && (await O("fs", !1)).writeFileSync(t, e);
     }
   }
   /**
@@ -2486,11 +2870,11 @@ class H extends q {
       i.href = URL.createObjectURL(n), i.download = t, i.click();
     } else if (typeof global < "u") {
       const n = await this.toGltf(e);
-      n && (await G("fs", !1)).writeFileSync(t, e ? n : Buffer.from(n));
+      n && (await O("fs", !1)).writeFileSync(t, e ? n : Buffer.from(n));
     }
   }
 }
-class Z extends q {
+class it extends V {
   static name = "DetailsPoint";
   Dxf = null;
   WhiteModel = null;
@@ -2541,23 +2925,23 @@ class Z extends q {
       this._timer = null;
       const t = this.parent?.findComponentByName("WhiteModel");
       this.raylines.length = 0, this.desPoints.length = 0, this.data.forEach((e) => {
-        const n = new M.Vector3(
+        const n = new q.Vector3(
           e.position.x,
           e.position.y,
           e.position.z
-        ), i = new M.Vector3(
+        ), i = new q.Vector3(
           e.direction.x,
           e.direction.y,
           e.direction.z
         ), s = 100;
         this.racasterHelper(n, i, s), i.z = 0;
-        const r = new M.Raycaster(n, i, 0, s).intersectObject(t.originalWhiteMode);
+        const r = new q.Raycaster(n, i, 0, s).intersectObject(t.originalWhiteMode);
         if (r.length) {
-          const { point: a } = r[0];
+          const { point: l } = r[0];
           this.desPoints.push({
             message: e.desc,
             position: n,
-            intersection: a
+            intersection: l
           });
         }
       }), this.dispatchEvent({
@@ -2567,61 +2951,61 @@ class Z extends q {
     }, 50);
   }
 }
-class K extends q {
+class st extends V {
   static name = "DxfLineModel";
-  dxfLineModel = new M.LineSegments();
-  dxfDoorsLineModel = new M.LineSegments();
-  dxfModelGroup = new M.Group();
+  dxfLineModel = new q.LineSegments();
+  dxfDoorsLineModel = new q.LineSegments();
+  dxfModelGroup = new q.Group();
   onAddFromParent(t) {
     const e = t.findComponentByName("Dxf");
-    this.dxfModelGroup.add(this.dxfLineModel), this.dxfModelGroup.add(this.dxfDoorsLineModel), this.dxfDoorsLineModel.material = new M.LineBasicMaterial({ color: 16776960, vertexColors: !0 }), e?.addEventListener("lineOffset", () => this.updateMode());
+    this.dxfModelGroup.add(this.dxfLineModel), this.dxfModelGroup.add(this.dxfDoorsLineModel), this.dxfDoorsLineModel.material = new q.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 M.BufferGeometry().setAttribute("position", new M.BufferAttribute(e, 3, !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])
     ).map((s) => s / t.scale), i = new Float32Array(t.doorLineSegment.flatMap(() => [1, 0, 0, 0, 1, 0]));
-    this.dxfDoorsLineModel.geometry = new M.BufferGeometry().setAttribute("position", new M.BufferAttribute(n, 3, !0)).setAttribute("color", new M.BufferAttribute(i, 3)), this.dxfModelGroup.position.z = t.originalZAverage, this.dispatchEvent({
+    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",
       model: this.dxfModelGroup
     });
   }
 }
-const ut = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const gt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  DetailsPoint: Z,
-  DxfLineModel: K,
-  WhiteModel: H
+  DetailsPoint: it,
+  DxfLineModel: st,
+  WhiteModel: nt
 }, Symbol.toStringTag, { value: "Module" }));
-function W(g, t = {}) {
+function Q(M, t = {}) {
   const {
     detailsPoint: e = !0,
     whiteModel: n = !0,
     dxfLineModel: i = !0
   } = t;
-  i && g.addComponent(new K()), n && g.addComponent(new H()), e && g.addComponent(new Z());
+  i && M.addComponent(new st()), n && M.addComponent(new nt()), e && M.addComponent(new it());
 }
-const ft = Object.assign(W, {
-  create(g = {}) {
-    return (t) => W(t, g);
+const wt = Object.assign(Q, {
+  create(M = {}) {
+    return (t) => Q(t, M);
   }
-}), pt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}), Mt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  ModelDataPlugin: ft,
-  components: ut
+  ModelDataPlugin: wt,
+  components: gt
 }, Symbol.toStringTag, { value: "Module" }));
-function mt() {
+function Dt() {
   return import("./index2.js");
 }
-function xt() {
+function St() {
   return import("./index3.js");
 }
-let z = null;
-async function Et(g, t, e = !1, n) {
-  const i = await Promise.resolve().then(() => pt), s = await mt(), o = await xt(), r = new ct().usePlugin(i.ModelDataPlugin.create({
+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({
     detailsPoint: !1,
     whiteModel: !0
   })).usePlugin(s.RenderPlugin.create({
@@ -2630,43 +3014,44 @@ async function Et(g, t, e = !1, n) {
     detailsPoint: !1,
     orbitControls: e,
     camera: t
-  })).usePlugin(o.Editor.create({ viewPermission: n })), a = r.findComponentByType(s.components.DomContainer);
-  return a && g.appendChild(a.domElement), z = r, {
+  })).usePlugin(o.Editor.create({ viewPermission: n })), l = r.findComponentByType(s.components.DomContainer);
+  return l && M.appendChild(l.domElement), H = r, {
     dxfSystem: r,
-    getFileAll: () => yt(r)
+    getFileAll: () => Lt(r)
   };
 }
-async function yt(g = z) {
-  const t = g.findComponentByName("WhiteModel"), e = new File([await g.AngleCorrectionDxf.toDxfImageBlob()], "img.jpg", { type: "image/jpeg" }), n = new File([g.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), i = new File([g.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" }), a = new File([JSON.stringify(g.Dxf.originalData)], "json.json", { type: "application/json" });
+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" });
   return {
     dxf: n,
     obj: s,
     glb: o,
     gltf: r,
-    json: a,
+    json: l,
     jpg: e,
     correctionDxf: i
   };
 }
-function At() {
-  return z;
+function qt() {
+  return H;
 }
 export {
-  v as B,
-  q as C,
-  ct as D,
-  $ as E,
-  L,
-  ft as M,
-  p as P,
-  j as Q,
-  _ as V,
-  H as W,
-  Z as a,
+  C as B,
+  V as C,
+  pt as D,
+  tt as E,
+  I as L,
+  wt as M,
+  g as P,
+  T as Q,
+  ft as T,
+  et as V,
+  nt as W,
+  it as a,
   U as b,
-  Et as c,
-  At as d,
-  yt as g,
-  ut as i,
-  N as u
+  It as c,
+  qt as d,
+  Lt as g,
+  gt as i,
+  k as u
 };