build-dxf 0.0.21 → 0.0.23

package/src/build.js

@@ -4,14 +4,14 @@ 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() {
+function O() {
   return "xxxx-xxxx-4xxx-yxxx-xxxx".replace(/[xy]/g, function(g) {
     var t = Math.random() * 16 | 0, e = g == "x" ? t : t & 3 | 8;
     return e.toString(16);
   });
 }
 class $ extends tt {
-  uuid = N();
+  uuid = O();
   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 G extends $ {
   parent;
   destroyed = !1;
   constructor(...t) {
@@ -72,7 +72,7 @@ class it extends $ {
    * @param component 
    */
   removeComponent(t) {
-    if (t instanceof q) {
+    if (t instanceof G) {
       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 x {
   x;
   y;
   get X() {
@@ -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 x(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 x(0, 0) : new x(e / i, n / i);
   }
   /**
    * 计算模长
@@ -302,7 +302,7 @@ class p {
    * @returns 
    */
   clone() {
-    return new p(this.x, this.y);
+    return new x(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 x(t[0], t[1]) : "x" in t && "y" in t ? new x(t.x, t.y) : "X" in t && "Y" in t ? new x(t.X, t.Y) : this.zero();
   }
   static zero() {
-    return new p(0, 0);
+    return new x(0, 0);
   }
 }
-class v {
+class A {
   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 x(this.minX, this.minY),
+      new x(this.maxX, this.minY),
+      new x(this.maxX, this.maxY),
+      new x(this.minX, this.maxY)
     ];
   }
   get width() {
@@ -345,7 +345,7 @@ class v {
     return this.maxY - this.minY;
   }
   get center() {
-    return new p(
+    return new x(
       this.minX + (this.maxX - this.minX) * 0.5,
       this.minY + (this.maxY - this.minY) * 0.5
     );
@@ -403,22 +403,22 @@ class v {
     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;
-        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 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 }, p = l.x * d.y - l.y * d.x;
+        if (p === 0) {
+          const f = l.x !== 0 ? (o.x - c.x) / l.x : (o.y - c.y) / l.y;
+          if (f >= 0 && f <= 1) return !0;
         } else {
-          const m = f > 0 ? 1 : -1;
-          if (r === 0 && (r = m), r !== m) return !1;
+          const f = p > 0 ? 1 : -1;
+          if (r === 0 && (r = f), r !== f) 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));
+      const h = (u, y, w) => {
+        const D = (y.y - u.y) * (w.x - y.x) - (y.x - u.x) * (w.y - y.y);
+        return D === 0 ? 0 : D > 0 ? 1 : 2;
+      }, l = (u, y, w) => Math.min(u.x, w.x) <= y.x && y.x <= Math.max(u.x, w.x) && Math.min(u.y, w.y) <= y.y && y.y <= Math.max(u.y, w.y), d = h(o, r, a), p = h(o, r, c), f = h(a, c, o), m = h(a, c, r);
+      return !!(d !== p && f !== m || d === 0 && l(o, a, r) || p === 0 && l(o, c, r) || f === 0 && l(a, o, c) || m === 0 && l(a, r, c));
     }, s = this.points;
     for (let o = 0; o < 4; o++) {
       const r = s[o], a = s[(o + 1) % 4];
@@ -500,7 +500,7 @@ class v {
    * @returns 
    */
   clone() {
-    return new v(this.minX, this.maxX, this.minY, this.maxY);
+    return new A(this.minX, this.maxX, this.minY, this.maxY);
   }
   /**
    * 
@@ -511,7 +511,23 @@ class v {
     const e = [], n = [];
     return t.forEach((i) => {
       e.push(i.x), n.push(i.y);
-    }), new v(
+    }), new A(
+      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 A(
       Math.min(...e),
       Math.max(...e),
       Math.min(...n),
@@ -519,7 +535,7 @@ class v {
     );
   }
 }
-class O {
+class N {
   points;
   get p0() {
     return this.points[0];
@@ -542,7 +558,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 x(e.x, e.y), new x(i.x, i.y)), [e.x, e.y, i.x, i.y];
     });
   }
   createGeometry() {
@@ -569,11 +585,11 @@ class O {
     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);
+      const c = (m, u, y) => {
+        const w = (u.y - m.y) * (y.x - u.x) - (u.x - m.x) * (y.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));
+      }, h = (m, u, y) => Math.min(m.x, y.x) <= u.x && u.x <= Math.max(m.x, y.x) && Math.min(m.y, y.y) <= u.y && u.y <= Math.max(m.y, y.y), l = c(s, o, r), d = c(s, o, a), p = c(r, a, s), f = c(r, a, o);
+      return !!(l !== d && p !== f || l === 0 && h(s, r, o) || d === 0 && h(s, a, o) || p === 0 && h(r, s, a) || f === 0 && h(r, o, a));
     };
     for (let s = 0; s < 4; s++) {
       const o = this.points[s], r = this.points[(s + 1) % 4];
@@ -658,7 +674,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 A(t, e, n, i);
   }
   /**
    * 
@@ -667,21 +683,21 @@ 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), a = n ? o.direction(s).mutiplyScalar(e * i) : x.zero(), c = n ? s.direction(o).mutiplyScalar(e * i) : x.zero(), h = r.x * e * 0.5, l = r.y * e * 0.5;
+    return new N([
+      new x(s.x + h, s.y + l).add(c),
+      new x(o.x + h, o.y + l).add(a),
+      new x(o.x - h, o.y - l).add(a),
+      new x(s.x - h, s.y - l).add(c)
     ]);
   }
 }
 class L {
-  points = [new p(), new p()];
+  points = [new x(), new x()];
   userData = {};
-  line;
+  // line: any
   get center() {
-    return new p(
+    return new x(
       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
     );
@@ -692,7 +708,7 @@ class L {
   get end() {
     return this.points[1];
   }
-  constructor(t = new p(), e = new p()) {
+  constructor(t = new x(), e = new x()) {
     this.points = [t, e];
   }
   set(t, e) {
@@ -769,15 +785,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" ? x.zero() : i.direction(n).mutiplyScalar(t * 0.5), r = e === "bothSides" ? x.zero() : n.direction(i).mutiplyScalar(t * 0.5), a = s.x * t * 0.5, c = s.y * t * 0.5, h = [
       // 第一条线
-      new p(n.x + a, n.y + c).add(r),
-      new p(i.x + a, i.y + c).add(o),
+      new x(n.x + a, n.y + c).add(r),
+      new x(i.x + a, 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 x(n.x - a, n.y - c).add(r),
+      new x(i.x - a, i.y - c).add(o)
     ];
-    return new O([0, 1, 3, 2].map((l) => h[l]));
+    return new N([0, 1, 3, 2].map((l) => h[l]));
   }
   /**
    * 计算线段的长度
@@ -814,24 +830,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 x(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 m = new x(f.x - i.x, f.y - i.y), u = o.x * o.x + o.y * o.y, w = (m.x * o.x + m.y * o.y) / u, D = i.x + w * o.x, b = i.y + w * o.y;
+      return new x(D, 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;
+    const h = (f) => {
+      const m = new x(f.x - i.x, f.y - i.y), u = o.x * o.x + o.y * o.y;
+      return (m.x * o.x + m.y * o.y) / u;
     };
     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);
+    const p = (f) => {
+      const m = Math.max(0, Math.min(1, f)), u = i.x + m * o.x, y = i.y + m * o.y;
+      return new x(u, y);
     };
-    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 (l < 0 || l > 1) && (a = p(l)), (d < 0 || d > 1) && (c = p(d)), a.x === c.x && a.y === c.y ? new L(a, a) : new L(a, c);
   }
   /**
    * 计算一条线段在另一条直线上的投影
@@ -840,16 +856,16 @@ 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 x(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);
+      const l = new x(h.x - n.x, h.y - n.y), d = s.x * s.x + s.y * s.y, f = (l.x * s.x + l.y * s.y) / d, m = n.x + f * s.x, u = n.y + f * s.y;
+      return new x(m, u);
     })(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;
+      const l = new x(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;
     })(r);
     return c < 0 || c > 1 ? null : r;
@@ -862,11 +878,11 @@ 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(p, f, m) {
+      return (f.x - p.x) * (m.y - p.y) - (f.y - p.y) * (m.x - p.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 a(p, f, m) {
+      return Math.min(f.x, m.x) - 1e-10 <= p.x && p.x <= Math.max(f.x, m.x) + 1e-10 && Math.min(f.y, m.y) - 1e-10 <= p.y && p.y <= Math.max(f.y, m.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)));
@@ -890,7 +906,7 @@ class L {
     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);
+    return new x(a, c);
   }
   /**
    * 获取两条线段夹角
@@ -907,6 +923,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 
@@ -939,7 +963,7 @@ class L {
     return t.userData = { ...this.userData }, t;
   }
 }
-async function G(g, t = !0) {
+async function Y(g, t = !0) {
   if (typeof global < "u" && typeof require < "u")
     return require(g);
   {
@@ -994,7 +1018,7 @@ const st = {
   Parsecs: 3240779289666404e-32
   // 秒差距，1米 ≈ 0.00000000000000003240779289666404秒差距
 };
-function k(g) {
+function J(g) {
   const t = [];
   for (let e = 0; e < g.length; e++)
     t.push(new L(
@@ -1003,18 +1027,18 @@ function k(g) {
     ));
   return t;
 }
-function J(g) {
+function W(g) {
   return g.flatMap((t, e) => (e === g.length - 1 && [...t.points, g[0].points[0]], [t.points[0]]));
 }
-class X extends q {
+class j extends G {
   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 A(0, 0, 0, 0);
+  box = new A(0, 0, 0, 0);
   pointsGroups = [];
   wallsGroup = [];
   doors = [];
@@ -1067,8 +1091,8 @@ class X extends q {
     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)
+        x.from(s).mutiplyScalar(n),
+        x.from(o).mutiplyScalar(n)
       );
       return l.userData = { isDoor: a, ...c }, this.lineSegments.push(l), [
         l.points[0],
@@ -1095,8 +1119,8 @@ class X extends q {
       const [c, h, l, 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);
+      r.push([c, h]), l.forEach((p) => {
+        e.has(p) || s(p, r, o);
       });
     };
     return this.data.forEach((o, r) => {
@@ -1188,7 +1212,7 @@ class X extends q {
         break;
       }
     }
-    const e = this.mergeSameDirectionLine(k(t)), n = [e[0]];
+    const e = this.mergeSameDirectionLine(J(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) {
@@ -1203,7 +1227,7 @@ class X extends q {
       const a = e[i + 2];
       a && o.includedAngle(a) < 2 ? (i = i + 2, n.push(a)) : n.push(s);
     }
-    return n.length > 3 ? J(this.mergeSameDirectionLine(n)) : [];
+    return n.length > 3 ? W(this.mergeSameDirectionLine(n)) : [];
   }
   /**
    * 移除短线段
@@ -1211,7 +1235,7 @@ class X extends q {
    * @param path 
    */
   removeShortLine(t, e = this.shortLine) {
-    const n = k(t), i = [], s = Math.PI / 180;
+    const n = J(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) {
@@ -1221,38 +1245,38 @@ class X extends q {
       let h = n[++o];
       const l = i[i.length - 1], d = l.direction();
       for (; o < n.length; ) {
-        const m = d.angleBetween(h.direction()) / s;
-        if (h.length() <= e || m < 4 || m > 176)
+        const f = d.angleBetween(h.direction()) / s;
+        if (h.length() <= e || f < 4 || f > 176)
           h = 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));
+      const p = n[o - 1];
+      if (l.length() > p.length()) {
+        const f = l.getIntersection(h);
+        if (f) {
+          const m = l.points[1].clone(), u = h.points[0].clone();
+          l.points[1].copy(f), h.points[0].copy(f), l.length() < this.width ? (l.points[1].copy(m), h.points[0].copy(m)) : h.length() < this.width && (l.points[1].copy(u), h.points[0].copy(u));
         } else
           l.points[1].copy(h.points[0]);
         i.push(h);
       } else
         o = c;
     }
-    return i.length > 3 ? J(i) : [];
+    return i.length > 3 ? W(i) : [];
   }
   /** 线偏移
    * @description 使用 ClipperLib 对每个点组进行线偏移处理，生成具有指定宽度的墙体路径
    */
-  lineOffset(t = X.EndType.etOpenSquare, e = X.JoinType.jtMiter, n = 1e4) {
+  lineOffset(t = j.EndType.etOpenSquare, e = j.JoinType.jtMiter, n = 1e4) {
     let i = new F.Paths();
     const s = new F.ClipperOffset(20, 0.25);
     return this.pointsGroups.forEach((o) => {
       const r = this.lineTopology(o).map((a) => a.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 = this.removeShortLine(r), r;
+      let r = o.map((a) => x.from(a).divisionScalar(n));
+      return r = this.lineSegmentStraightening(r), t == j.EndType.etOpenSquare && (r = this.squareRemoveBurr(r)), r;
     }), this.dispatchEvent({
       type: "lineOffset",
       wallsGroup: this.wallsGroup
@@ -1320,8 +1344,8 @@ class X extends q {
     }
     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);
+        const l = c[h], d = h === c.length - 1 ? 0 : h + 1, p = c[d];
+        s(l, p);
       }
     });
     const r = this.width * 0.2, a = [];
@@ -1335,9 +1359,9 @@ class X extends q {
           h.start.clone(),
           h.start.clone().add(l.clone().multiplyScalar(h.length()))
         );
-        const f = d.clone().directionMove(d.normal(), h.length() * -0.5).expandToRectangle(h.length(), "bothSides");
+        const p = 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)) {
+          if (a[b].intersectRectangle(p)) {
             d = new L(
               h.start.clone(),
               h.start.clone().add(l.clone().multiplyScalar(-h.length()))
@@ -1345,15 +1369,15 @@ class X extends q {
             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);
+        const f = h.length(), m = d.length(), u = (f ** 2 + m ** 2) / (2 * m), y = d.end.clone().add(d.direction().multiplyScalar(-u)), [w, D] = this.getArcAngleRange(y, h.end, d.end);
+        o(y, u, Math.min(w, D), Math.max(w, D)), a.push(p);
       } 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));
+        const { p: l, width: d } = h, p = x.from(l), f = p.clone().add(c.direction().multiplyScalar(d * 0.5)), m = p.clone().add(c.direction().multiplyScalar(-d * 0.5)), u = new L(f, m);
+        s(u.start, u.end), u.expandToRectangle(this.width, "bothSides").path2D((y, w) => s(y, w));
       });
     }), n;
   }
@@ -1367,7 +1391,7 @@ class X extends q {
     if (typeof window < "u")
       s = document.createElement("canvas");
     else if (typeof global < "u") {
-      const { createCanvas: c } = await G("canvas");
+      const { createCanvas: c } = await Y("canvas");
       s = c();
     } else
       throw new Error("创建画布失败");
@@ -1378,14 +1402,14 @@ class X extends q {
     };
     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();
+    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, p]) => {
+      a.strokeStyle = r[p], a.beginPath(), a.moveTo(c, h), a.lineTo(l, d), a.closePath(), a.stroke();
+    }), i.arc.forEach(([c, h, l, d, p, f]) => {
+      a.strokeStyle = r[f], a.beginPath(), a.arc(c, h, l, d * (Math.PI / 180), p * (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);
+      let [h, l, d, p] = c;
+      const f = Math.min(l, p), m = Math.max(l, p), u = (s.width * 0.5 - 0.4 * i.scale) * (h < 0 ? -1 : 1), y = (m - f) * 0.45;
+      a.fillStyle = "#fff", a.font = `${0.15 * i.scale}px Arial`, a.textAlign = "center", a.textBaseline = "middle", a.fillText((m - f).toFixed(2) + "cm", u, f + (m - f) * 0.5), a.moveTo(u - 0.1 * i.scale, f), a.lineTo(u + 0.1 * i.scale, f), a.moveTo(u, f), a.lineTo(u, y + f), a.moveTo(u, m), a.lineTo(u, m - y), a.moveTo(u - 0.1 * i.scale, m), a.lineTo(u + 0.1 * i.scale, m);
     }), a.closePath(), a.strokeStyle = "#fff", a.stroke(), "toBlob" in s ? new Promise((c) => {
       s.toBlob((h) => {
         c(h);
@@ -1422,7 +1446,7 @@ class X extends q {
     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));
+    } else typeof global < "u" && (await Y("fs", !1)).writeFileSync(t, this.toDxfString(e));
   }
   /**
    * 下载
@@ -1434,7 +1458,7 @@ class X extends q {
     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("图片下载失败");
+    } else typeof global < "u" ? (await Y("fs", !1)).writeFileSync(t, i) : console.error("图片下载失败");
     return !0;
   }
   /**
@@ -1442,7 +1466,7 @@ class X extends q {
    * @description 计算所有线段的起点和终点的最小最大值，形成一个边界框
    * @returns 
    */
-  computedOriginalSize(t, e = new v(0, 0, 0, 0)) {
+  computedOriginalSize(t, e = new A(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;
   }
@@ -1479,9 +1503,10 @@ function V(g) {
     Object.prototype.hasOwnProperty.call(g, e) && (t[e] = V(g[e]));
   return t;
 }
-const I = new L();
-class ot extends X {
+const C = new L();
+class ot extends j {
   static name = "AngleCorrectionDxf";
+  angle = 0;
   onAddFromParent(t) {
     t.findComponentByName("LineAnalysis").addEventListener("analysisCompleted", async () => this.update());
   }
@@ -1490,27 +1515,27 @@ class ot extends X {
     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;
+      if (C.start.copy(h.start), C.end.copy(h.end), h.isVerticalReferenceLine) {
+        const [l, d] = h.start.y < h.end.y ? [C.start, C.end] : [C.end, C.start];
+        i = -new L(l, d).direction().angleBetween(new x(0, 1), "angle", "360"), s = null;
         break;
       }
-      (!s || I.length() > s.length()) && (s = I.clone(), s.userData.index = c);
+      (!s || C.length() > s.length()) && (s = C.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");
+      i = -new L(c, h).direction().angleBetween(new x(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;
+    const o = e.originalBox.center, r = x.zero(), a = e.originalData.map((c) => {
+      const h = r.copy(c.start).division(o).rotate(x.zero(), i * (Math.PI / 180)).toJson(c.start.z), l = r.copy(c.end).division(o).rotate(x.zero(), i * (Math.PI / 180)).toJson(c.end.z), d = Object.assign(V(c), { start: h, end: l });
+      return d.drawWindow && d.drawWindow.forEach((p) => {
+        p.p = r.copy(p.p).division(o).rotate(x.zero(), i * (Math.PI / 180)).toJson(p.p.z), p.p.y = -p.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({
+      h.start.division(o).rotate(x.zero(), i * (Math.PI / 180)), h.end.division(o).rotate(x.zero(), i * (Math.PI / 180)), a.push({
         start: h.start.toJson(e.originalZAverage),
         end: h.end.toJson(e.originalZAverage),
         insetionArr: [],
@@ -1520,11 +1545,13 @@ class ot extends X {
       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;
+      return h.start.division(o).rotate(x.zero(), i * (Math.PI / 180)), h.end.division(o).rotate(x.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"
     });
   }
 }
-class _ extends q {
+class H extends G {
   static name = "Variable";
   originalLineVisible = !0;
   dxfVisible = !0;
@@ -1551,7 +1578,7 @@ class _ extends q {
     if (t in this) return this[t];
   }
 }
-class j {
+class q {
   bounds;
   // 包围盒
   capacity;
@@ -1617,23 +1644,23 @@ class j {
     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.children[0] = new q(
+      new A(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.children[1] = new q(
+      new A(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.children[2] = new q(
+      new A(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.children[3] = new q(
+      new A(t, this.bounds.maxX, e, this.bounds.maxY),
       this.capacity,
       this.maxDepth,
       this.depth + 1
@@ -1662,7 +1689,7 @@ class j {
    * @returns 相交的节点数组
    */
   queryCircle(t, e) {
-    const n = [], i = new v(
+    const n = [], i = new A(
       t.x - e,
       t.x + e,
       t.y - e,
@@ -1674,8 +1701,8 @@ class j {
       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);
+      const d = o.x + l * a, p = o.y + l * c;
+      t.distance(new x(d, p)) <= e && n.push(s);
     }
     if (!this.isLeaf)
       for (const s of this.children)
@@ -1727,7 +1754,7 @@ class j {
     })), t;
   }
 }
-class U {
+class k {
   map = /* @__PURE__ */ new Map();
   gridSize;
   constructor(t = 2) {
@@ -1758,7 +1785,7 @@ class U {
    * @param point 
    */
   remove(t) {
-    const { set: e, target: n } = t?.userData?.pointVirtualGrid;
+    const { set: e, target: n } = t?.userData?.pointVirtualGrid ?? {};
     e && (e.delete(n), delete t?.userData?.pointVirtualGridMap);
   }
   /**
@@ -1777,7 +1804,7 @@ class U {
    */
   decodeGridId(t) {
     const [e, n] = t.split(".").map(Number);
-    return new p(e, n);
+    return new x(e, n);
   }
   /**
    * 查询与矩形相交的点
@@ -1802,13 +1829,13 @@ class U {
    * @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 = [];
+    const n = new A(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);
+        this.map.get(l)?.forEach((p) => {
+          t.distance(p.point) <= e && a.push(p);
         });
       }
     return a;
@@ -1854,7 +1881,7 @@ class rt {
   doorPoint = [];
   dxf;
   // 包含所有点的虚拟网格
-  pointVirtualGrid = new U();
+  pointVirtualGrid = new k();
   // 只包含可查找点的虚拟网格
   findPointVirtualGrid;
   quadtree;
@@ -1867,7 +1894,7 @@ class rt {
   lineAnalysis;
   continueFind = !0;
   constructor(t) {
-    if (this.lineAnalysis = t, this.dxf = t.Dxf, this.findPointVirtualGrid = new U(), this.quadtree = t.quadtree, this.resultList = t.resultList, this.lineSegments = t.lineSegmentList, this.dxf.doorLineSegment.length = 0, this.lineSegments.forEach((n) => {
+    if (this.lineAnalysis = t, this.dxf = t.Dxf, this.findPointVirtualGrid = new k(), this.quadtree = t.quadtree, this.resultList = t.resultList, this.lineSegments = t.lineSegmentList, this.dxf.doorLineSegment.length = 0, this.lineSegments.forEach((n) => {
       this.pointVirtualGrid.insert(n.start, n), this.pointVirtualGrid.insert(n.end, n);
     }), this.doorPoint = this.getDoorPoint(), !this.continueFind) return;
     const e = this.searchDoubleLinePoint();
@@ -1899,13 +1926,13 @@ class rt {
     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;
-      for (let y = 0; y < 3; y++) {
-        const u = h.start.clone().add(f.clone().multiplyScalar(o.width + m * y)), x = new L(
+      const d = h.normal(), p = h.direction(), f = (l - o.width * 2) / 2;
+      for (let m = 0; m < 3; m++) {
+        const u = h.start.clone().add(p.clone().multiplyScalar(o.width + f * m)), y = new L(
           u,
           u.clone().add(d.clone().multiplyScalar(1))
         );
-        if (x.directionMove(d, -0.5), this.quadtree.queryLineSegment(x).length) return;
+        if (y.directionMove(d, -0.5), this.quadtree.queryLineSegment(y).length) return;
       }
       a.push(h);
     }), a;
@@ -1925,7 +1952,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: O() });
       });
     }), t;
   }
@@ -1937,21 +1964,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) => {
+        const r = x.from(o.drawDoorData.start), a = x.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 p = a.angleBetween(d, "angle");
+          return p > 80 || p < 10;
         });
         c.length && t.push({
           line: c[0].userData,
           point: r,
-          uuid: N()
+          uuid: O()
         });
       } else if (o.doorDirectConnection) {
         this.continueFind = !1;
-        const r = new L(p.from(o.start), p.from(o.end));
+        const r = new L(x.from(o.start), x.from(o.end));
         r.userData = {
           doorDirectConnection: !0,
           isDoor: !0
@@ -1981,48 +2008,48 @@ 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) {
-      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) {
+    function r({ point: u, line: y }, w, D) {
+      const b = y.direction();
+      y.start === u && b.multiplyScalar(-1);
+      const P = s.queryCircle(u, n).filter((S) => S.userData !== y).sort((S, E) => S.point.distance(u) - E.point.distance(u)), v = [];
+      for (let S = 0; S < P.length; S++) {
+        const E = e.findIndex((T) => T.point === P[S].point), B = t[w].uuid, I = e[E].uuid;
+        if (D.has(`${B}.${I}`)) continue;
+        D.add(`${B}.${I}`), D.add(`${I}.${B}`);
+        const Q = P[S].point, X = new L(u.clone(), Q.clone());
+        if (X.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,
+          P[S].userData.start.equal(P[S].point) && T.multiplyScalar(-1), X.direction().multiplyScalar(-1).angleBetween(T, "angle") < i && (o.queryLineSegment(X).length || v.push({
+            findData: P[S],
+            findUuid: I,
+            doorLine: X,
             doorUuid: B
           }));
         }
       }
-      return A;
+      return v;
     }
-    function a(u, x, w, S, b) {
-      S.add(u);
+    function a(u, y, w, D, b) {
+      D.add(u);
       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 v = 0; v < w.length; v++) {
+        const S = w[v];
+        if (y.has(S.findUuid)) {
+          const E = y.get(S.findUuid);
+          a(S.findUuid, y, E, D, S) && P.push(S);
+        } else P.push(S);
       }
-      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((v, S) => v.doorLine.length() - S.doorLine.length()), b && P[0] === b ? (w.splice(0), !0) : (w.splice(1), !1);
     }
     const c = /* @__PURE__ */ new Set(), h = /* @__PURE__ */ new Map();
-    t.map((u, x) => {
-      const w = r(u, x, c);
+    t.map((u, y) => {
+      const w = r(u, y, c);
       w.length && h.set(u.uuid, w);
     }), c.clear();
     const l = /* @__PURE__ */ new Map();
-    h.forEach((u, x) => {
-      if (!c.has(x) && u.length && a(x, h, u, c), u.length) {
+    h.forEach((u, y) => {
+      if (!c.has(y) && u.length && a(y, 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);
       }
@@ -2030,45 +2057,45 @@ class rt {
     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]);
+        u.sort((y, w) => y.doorLine.length() - w.doorLine.length());
+        for (let y = 1; y < u.length; y++) d.add(u[y]);
       }
     });
-    const f = [], m = [];
+    const p = [], f = [];
     h.forEach((u) => {
       if (u.length) {
-        const x = u[0];
-        d.has(x) || (f.push(x), m.push(x.doorUuid, x.findUuid));
+        const y = u[0];
+        d.has(y) || (p.push(y), f.push(y.doorUuid, y.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,
+    const m = [];
+    return p.forEach((u) => {
+      const y = t.findIndex((E) => E.uuid === u.doorUuid), w = e.findIndex((E) => E.uuid === u.findUuid), D = t[y].point.clone(), b = e[w].point.clone(), P = this.findLongLineSegment(t[y].line), v = this.findLongLineSegment(e[w].line), S = P.projectPoint(b);
+      if (S) {
+        D.copy(S);
+        const E = new L(D, b), B = v.includedAngle(E);
+        (B < 10 || B > 170 || Math.abs(90 - B) < 10) && m.push({
+          start: D,
           end: b
         });
       } else {
-        const E = A.projectPoint(S);
+        const E = v.projectPoint(D);
         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 B = new L(D, b), I = P.includedAngle(B);
+        (I < 10 || I > 170 || Math.abs(90 - I) < 10) && m.push({
+          start: D,
           end: b
         });
       }
     }), e.splice(
       0,
       e.length,
-      ...e.filter((u) => m.indexOf(u.uuid) === -1)
+      ...e.filter((u) => f.indexOf(u.uuid) === -1)
     ), t.splice(
       0,
       t.length,
-      ...t.filter((u) => m.indexOf(u.uuid) === -1)
-    ), y;
+      ...t.filter((u) => f.indexOf(u.uuid) === -1)
+    ), m;
   }
   /** 方案二： 沿方向查找
    * @description 
@@ -2099,8 +2126,8 @@ class rt {
     e.start === t && o.multiplyScalar(-1), e.start === t && a.copy(e.end);
     const c = i.queryPoint(a).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 p = c[d], f = p.userData, m = f.direction();
+      if (f.start === p.point && o.multiplyScalar(-1), m.angleBetween(r) / (Math.PI / 180) > 90) {
         r.multiplyScalar(-1);
         break;
       }
@@ -2108,7 +2135,7 @@ class rt {
     const h = new L(t.clone(), t.clone().add(r.multiplyScalar(n))), l = s.queryLineSegment(h).map((d) => ({
       point: d.line.getIntersection(h),
       line: d.line
-    })).filter((d) => d.point).sort((d, f) => t.distance(d.point) - t.distance(f.point));
+    })).filter((d) => d.point).sort((d, p) => t.distance(d.point) - t.distance(p.point));
     if (l.length) {
       const d = l[0];
       if (Math.abs(90 - d.line.direction().angleBetween(r, "angle")) < 5)
@@ -2139,7 +2166,7 @@ class rt {
     return e;
   }
 }
-class at extends q {
+class at extends G {
   static name = "LineAnalysis";
   Dxf = null;
   Variable = null;
@@ -2153,7 +2180,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(j), this.Variable = this.parent?.findComponentByType(H), this.Dxf.addEventListener("setDta", this.lineAnalysis.bind(this)), this.Dxf.addEventListener("createGroup", this.doorsAnalysis.bind(this));
   }
   /**
    * 
@@ -2167,11 +2194,11 @@ class at extends q {
     return {
       points: [
         // 第一条线
-        new p(t.x + r, t.y + a).add(o),
-        new p(e.x + r, e.y + a).add(s),
+        new x(t.x + r, t.y + a).add(o),
+        new x(e.x + r, e.y + a).add(s),
         // 第二条线
-        new p(t.x - r, t.y - a).add(o),
-        new p(e.x - r, e.y - a).add(s)
+        new x(t.x - r, t.y - a).add(o),
+        new x(e.x - r, e.y - a).add(s)
       ],
       indices: [0, 1, 1, 3, 3, 2, 2, 0],
       rectIndices: [0, 1, 3, 2, 0]
@@ -2193,14 +2220,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), 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(), p = n.points[1].clone(), f = p.direction(d);
+    f.multiplyScalar(e.width * 0.5);
+    const m = d.clone().add(f), u = p.clone().add(f.multiplyScalar(-1)), y = d.direction(p), w = m.direction(u);
+    if (!(y.x > 0 && w.x < 0 || y.x < 0 && w.x > 0 || y.y > 0 && w.y < 0 || y.y < 0 && w.y > 0)) {
+      d.set(m.x, m.y), p.set(u.x, u.y);
+      for (let D = 1; D < r; D++) {
+        const b = h.clone().multiplyScalar(a * D), P = l.clone().multiplyScalar(c * D), v = d.clone().add(b), S = p.clone().add(P);
+        this.addData(v, S);
       }
     }
   }
@@ -2210,7 +2237,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 q(t.originalBox, 2), t.lineSegments.forEach((n) => {
       n.userData?.isDoor || (this.quadtree?.insert({
         line: n,
         userData: e.length
@@ -2227,7 +2254,7 @@ 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);
+      const r = e[o], a = N.fromByLineSegment(r, this.width * 2, !1, -0.01);
       t.queryRect(a).map((h) => h.userData).filter((h) => h !== o).forEach((h) => {
         try {
           if (n.has(`${o}-${h}`) || n.has(`${h}-${o}`)) return;
@@ -2269,13 +2296,139 @@ class at extends q {
   doorSearchNearAngle = 110;
   doorSearchDistance = 2;
   doors = [];
+  DoorsAnalysis;
   doorsAnalysis() {
-    new rt(this), this.dispatchEvent({
+    this.DoorsAnalysis = new rt(this), this.dispatchEvent({
       type: "analysisCompleted"
     });
   }
 }
-class ct extends it {
+class ct extends G {
+  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((h) => {
+      const l = i.get(h.target) ?? [], d = i.get(h.source) ?? [], p = h.project.clone(), f = h.project2.clone();
+      p.includedAngle(f) > 135 && (f.points = [f.points[1], f.points[0]]), l.push(...p.points), d.push(...f.points), i.set(h.target, l), i.set(h.source, d);
+      const m = new L(p.start, f.start), u = new L(p.end, f.end), y = new L(m.center, u.center);
+      y.userData.wallWidth = Math.max(m.length(), u.length()), o.push(y);
+    });
+    const a = [];
+    s = s.filter((h) => {
+      if (r.indexOf(h) > -1) return !1;
+      if (i.has(h)) {
+        const l = i.get(h), d = h.clone();
+        if (l) {
+          for (let f = 0; f < l.length; f += 2) {
+            const m = l[f], u = l[f + 1];
+            m.userData.length = m.distance(d.start), u.userData.length = u.distance(d.start), m.userData.type = "start", u.userData.type = "end", d.start.distance(m) > d.start.distance(u) && (l[f] = u, l[f + 1] = m, m.userData.type = "end", u.userData.type = "start");
+          }
+          l.sort((f, m) => f.userData.length - m.userData.length);
+          const p = [];
+          for (let f = 0; f < l.length; f++) {
+            const m = l[f];
+            m.userData.type === "start" ? (p.length === 0 && (a.push(new L(d.start.clone(), m.clone())), d.start.copy(m)), p.push("start")) : (p.pop(), p.length === 0 && d.start.copy(m));
+          }
+          a.push(d);
+        }
+        return !1;
+      }
+      return !0;
+    }), s.push(...o), s.push(...a.filter((h) => h.length() > 0.05));
+    const c = e.box.center;
+    s = s.map((h) => {
+      const l = h.clone();
+      return l.start.rotate(c, n.angle * (Math.PI / 180)), l.end.rotate(c, n.angle * (Math.PI / 180)), l;
+    }), 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 = x.from(s.p), r = o.clone().add(
+              i.direction().multiplyScalar(s.width * 0.5)
+            ), a = 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: a.x * 1,
+                y: a.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 Y("fs", !1)).writeFileSync(t, JSON.stringify(this.toJson()));
+  }
+}
+class ht extends it {
   Dxf;
   AngleCorrectionDxf;
   Variable;
@@ -2286,7 +2439,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 j(this.wallWidth, e), this.AngleCorrectionDxf = new ot(), this.Variable = new H(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(new at()), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new ct());
   }
   usePlugin(t) {
     return typeof t == "function" && t.call(this, this), this;
@@ -2299,23 +2452,23 @@ class ct extends it {
     });
   }
 }
-const ht = new et(), lt = new nt();
-function dt(g, t, e = 0.1) {
+const lt = new et(), dt = new nt();
+function ut(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;
   return {
     points: [
       // 第一条线
-      new p(g.x + o, g.y + r).add(s),
-      new p(t.x + o, t.y + r).add(i),
+      new x(g.x + o, g.y + r).add(s),
+      new x(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 x(g.x - o, g.y - r).add(s),
+      new x(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 _ extends G {
   static name = "WhiteModel";
   Dxf = null;
   Variable = null;
@@ -2345,7 +2498,7 @@ class H extends q {
         new M.LineSegments(new M.EdgesGeometry(s), new M.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 x(n.x, n.y).mutiplyScalar(t.scale), r = new x(i.x, i.y).mutiplyScalar(t.scale), { points: a, indices: c, rectIndices: h } = ut(o, r, t.width);
       return {
         points: a,
         indices: c,
@@ -2378,7 +2531,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(lt.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
       }, 20);
     });
   }
@@ -2391,7 +2544,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) => {
+          dt.parse(this.whiteModelGroup.children, (n) => {
             e(n), this.material.opacity = 0.8, this.material.transparent = !0;
           }, () => {
             e(void 0);
@@ -2400,7 +2553,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 Y("obj2gltf", !0), i = await Y("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
@@ -2443,7 +2596,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 Y("fs", !1)).writeFileSync(t, e);
     }
   }
   /**
@@ -2459,11 +2612,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 Y("fs", !1)).writeFileSync(t, e ? n : Buffer.from(n));
     }
   }
 }
-class Z extends q {
+class Z extends G {
   static name = "DetailsPoint";
   Dxf = null;
   WhiteModel = null;
@@ -2540,7 +2693,7 @@ class Z extends q {
     }, 50);
   }
 }
-class K extends q {
+class K extends G {
   static name = "DxfLineModel";
   dxfLineModel = new M.LineSegments();
   dxfDoorsLineModel = new M.LineSegments();
@@ -2563,38 +2716,38 @@ class K extends q {
     });
   }
 }
-const ut = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const ft = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   DetailsPoint: Z,
   DxfLineModel: K,
-  WhiteModel: H
+  WhiteModel: _
 }, Symbol.toStringTag, { value: "Module" }));
-function W(g, t = {}) {
+function U(g, 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 && g.addComponent(new K()), n && g.addComponent(new _()), e && g.addComponent(new Z());
 }
-const ft = Object.assign(W, {
+const pt = Object.assign(U, {
   create(g = {}) {
-    return (t) => W(t, g);
+    return (t) => U(t, g);
   }
-}), pt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}), mt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  ModelDataPlugin: ft,
-  components: ut
+  ModelDataPlugin: pt,
+  components: ft
 }, Symbol.toStringTag, { value: "Module" }));
-function mt() {
+function xt() {
   return import("./index2.js");
 }
-function xt() {
+function yt() {
   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({
+async function At(g, t, e = !1, n) {
+  const i = await Promise.resolve().then(() => mt), s = await xt(), o = await yt(), r = new ht().usePlugin(i.ModelDataPlugin.create({
     detailsPoint: !1,
     whiteModel: !0
   })).usePlugin(s.RenderPlugin.create({
@@ -2606,10 +2759,10 @@ async function Et(g, t, e = !1, n) {
   })).usePlugin(o.Editor.create({ viewPermission: n })), a = r.findComponentByType(s.components.DomContainer);
   return a && g.appendChild(a.domElement), z = r, {
     dxfSystem: r,
-    getFileAll: () => yt(r)
+    getFileAll: () => gt(r)
   };
 }
-async function yt(g = z) {
+async function gt(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" });
   return {
     dxf: n,
@@ -2621,25 +2774,26 @@ async function yt(g = z) {
     correctionDxf: i
   };
 }
-function At() {
+function vt() {
   return z;
 }
 export {
-  v as B,
-  q as C,
-  ct as D,
+  A as B,
+  G as C,
+  ht as D,
   $ as E,
   L,
-  ft as M,
-  p as P,
-  j as Q,
-  _ as V,
-  H as W,
+  pt as M,
+  x as P,
+  q as Q,
+  ct as T,
+  H as V,
+  _ as W,
   Z as a,
-  U as b,
-  Et as c,
-  At as d,
-  yt as g,
-  ut as i,
-  N as u
+  k as b,
+  At as c,
+  vt as d,
+  gt as g,
+  ft as i,
+  O as u
 };