build-dxf 0.0.20-14 → 0.0.20-16

package/src/build.js

@@ -1,17 +1,17 @@
 import * as M from "three";
-import { EventDispatcher as K } from "three";
-import V from "clipper-lib";
-import N from "dxf-writer";
-import { OBJExporter as Q } from "three/examples/jsm/exporters/OBJExporter.js";
-import { GLTFExporter as tt } from "three/examples/jsm/exporters/GLTFExporter.js";
-function T() {
-  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 { 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 z() {
+  return "xxxx-xxxx-4xxx-yxxx-xxxx".replace(/[xy]/g, function(y) {
+    var t = Math.random() * 16 | 0, e = y == "x" ? t : t & 3 | 8;
     return e.toString(16);
   });
 }
-class $ extends K {
-  uuid = T();
+class $ extends tt {
+  uuid = z();
   addEventListener(t, e, n) {
     const { once: i = !1 } = n ?? {}, o = (r) => {
       e(r), i && s();
@@ -31,7 +31,7 @@ class $ extends K {
     e && (e.forEach((n) => n()), this.eventRecordStack.delete(t));
   }
 }
-class X extends $ {
+class j extends $ {
   parent;
   destroyed = !1;
   constructor(...t) {
@@ -49,7 +49,7 @@ class X extends $ {
     this.destroyed = !0;
   }
 }
-class et extends $ {
+class it extends $ {
   static EventType = {
     ADD_COMPONENT: "addComponent"
   };
@@ -72,7 +72,7 @@ class et extends $ {
    * @param component 
    */
   removeComponent(t) {
-    if (t instanceof X) {
+    if (t instanceof j) {
       const e = this.components.indexOf(t);
       e > -1 && (this.components.splice(e, 1), this.dispatchEvent({
         type: "removeComponent",
@@ -117,7 +117,7 @@ class et extends $ {
     return e || null;
   }
 }
-class f {
+class p {
   x;
   y;
   get X() {
@@ -201,6 +201,15 @@ class f {
   add(t) {
     return this.x += t.x, this.y += t.y, this;
   }
+  /**
+   * 绕point旋转angle
+   * @param point 
+   * @param angle 旋转角度，单位为弧度
+   */
+  rotate(t, e) {
+    const n = this.x - t.x, i = this.y - t.y, o = Math.cos(e), s = Math.sin(e), r = n * o - i * s, c = n * s + i * o;
+    return this.x = r + t.x, this.y = c + t.y, this;
+  }
   /**
    * 保留小数位数
    * @param count 
@@ -225,7 +234,7 @@ class f {
    */
   normal(t) {
     const e = this.x - t.x, n = this.y - t.y, i = Math.sqrt(e * e + n * n), o = -n / i, s = e / i;
-    return new f(o, s);
+    return new p(o, s);
   }
   /**
    * 获取由传入的点到该点的单位方向向量
@@ -235,7 +244,7 @@ class f {
    */
   direction(t) {
     const e = this.x - t.x, n = this.y - t.y, i = Math.sqrt(e * e + n * n);
-    return i === 0 ? new f(0, 0) : new f(e / i, n / i);
+    return i === 0 ? new p(0, 0) : new p(e / i, n / i);
   }
   /**
    * 计算模长
@@ -270,8 +279,8 @@ class f {
   angleBetween(t, e = "radian", n = "180") {
     const i = this.dot(t), o = this.magnitude(), s = t.magnitude();
     if (o === 0 || s === 0) return 0;
-    const r = i / (o * s), 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 / (o * s), c = Math.max(-1, Math.min(1, r));
+    return e === "radian" ? Math.acos(c) : e === "cos" ? c : n === "180" || this.cross(t) < 0 ? Math.acos(c) / (Math.PI / 180) : 360 - Math.acos(c) / (Math.PI / 180);
   }
   /** 获取向量长度
    */
@@ -293,14 +302,14 @@ class f {
    * @returns 
    */
   clone() {
-    return new f(this.x, this.y);
+    return new p(this.x, this.y);
   }
   /**
    * 克隆
    * @returns 
    */
   copy(t) {
-    this.x = t.x ?? 0, this.y = t.y ?? 0;
+    return this.x = t.x ?? 0, this.y = t.y ?? 0, this;
   }
   toJson(t = 0) {
     return {
@@ -310,23 +319,23 @@ class f {
     };
   }
   static from(t) {
-    return Array.isArray(t) ? new f(t[0], t[1]) : "x" in t && "y" in t ? new f(t.x, t.y) : "X" in t && "Y" in t ? new f(t.X, t.Y) : this.zero();
+    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();
   }
   static zero() {
-    return new f(0, 0);
+    return new p(0, 0);
   }
 }
-class A {
+class v {
   minX = 0;
   maxX = 0;
   minY = 0;
   maxY = 0;
   get points() {
     return [
-      new f(this.minX, this.minY),
-      new f(this.maxX, this.minY),
-      new f(this.maxX, this.maxY),
-      new f(this.minX, this.maxY)
+      new p(this.minX, this.minY),
+      new p(this.maxX, this.minY),
+      new p(this.maxX, this.maxY),
+      new p(this.minX, this.maxY)
     ];
   }
   get width() {
@@ -336,7 +345,7 @@ class A {
     return this.maxY - this.minY;
   }
   get center() {
-    return new f(
+    return new p(
       this.minX + (this.maxX - this.minX) * 0.5,
       this.minY + (this.maxY - this.minY) * 0.5
     );
@@ -367,13 +376,13 @@ class A {
       return this.minX <= e.x && e.x <= this.maxX && this.minY <= e.y && e.y <= this.maxY;
     let s = Number.NEGATIVE_INFINITY, r = Number.POSITIVE_INFINITY;
     if (i !== 0) {
-      const a = (this.minX - e.x) / i, c = (this.maxX - e.x) / i;
-      s = Math.max(s, Math.min(a, c)), r = Math.min(r, Math.max(a, c));
+      const c = (this.minX - e.x) / i, a = (this.maxX - e.x) / i;
+      s = Math.max(s, Math.min(c, a)), r = Math.min(r, Math.max(c, a));
     } else if (e.x < this.minX || e.x > this.maxX)
       return !1;
     if (o !== 0) {
-      const a = (this.minY - e.y) / o, c = (this.maxY - e.y) / o;
-      s = Math.max(s, Math.min(a, c)), r = Math.min(r, Math.max(a, c));
+      const c = (this.minY - e.y) / o, a = (this.maxY - e.y) / o;
+      s = Math.max(s, Math.min(c, a)), r = Math.min(r, Math.max(c, a));
     } else if (e.y < this.minY || e.y > this.maxY)
       return !1;
     return s <= r && s <= 1 && r >= 0;
@@ -393,29 +402,29 @@ class A {
   intersectRectangle(t) {
     const e = (s) => this.minX <= s.x && s.x <= this.maxX && this.minY <= s.y && s.y <= this.maxY, n = (s) => {
       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: s.x - c.x, y: s.y - c.y }, x = l.x * d.y - l.y * d.x;
-        if (x === 0) {
-          const p = l.x !== 0 ? (s.x - c.x) / l.x : (s.y - c.y) / l.y;
-          if (p >= 0 && p <= 1) return !0;
+      for (let c = 0; c < 4; c++) {
+        const a = t.points[c], h = t.points[(c + 1) % 4], l = { x: h.x - a.x, y: h.y - a.y }, d = { x: s.x - a.x, y: s.y - a.y }, f = l.x * d.y - l.y * d.x;
+        if (f === 0) {
+          const m = l.x !== 0 ? (s.x - a.x) / l.x : (s.y - a.y) / l.y;
+          if (m >= 0 && m <= 1) return !0;
         } else {
-          const p = x > 0 ? 1 : -1;
-          if (r === 0 && (r = p), r !== p) return !1;
+          const m = f > 0 ? 1 : -1;
+          if (r === 0 && (r = m), r !== m) return !1;
         }
       }
       return !0;
-    }, i = (s, r, a, c) => {
-      const h = (u, m, y) => {
-        const S = (m.y - u.y) * (y.x - m.x) - (m.x - u.x) * (y.y - m.y);
+    }, i = (s, r, c, a) => {
+      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, m, y) => Math.min(u.x, y.x) <= m.x && m.x <= Math.max(u.x, y.x) && Math.min(u.y, y.y) <= m.y && m.y <= Math.max(u.y, y.y), d = h(s, r, a), x = h(s, r, c), p = h(a, c, s), w = h(a, c, r);
-      return !!(d !== x && p !== w || d === 0 && l(s, a, r) || x === 0 && l(s, c, r) || p === 0 && l(a, s, c) || w === 0 && l(a, r, c));
+      }, 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(s, r, c), f = h(s, r, a), m = h(c, a, s), g = h(c, a, r);
+      return !!(d !== f && m !== g || d === 0 && l(s, c, r) || f === 0 && l(s, a, r) || m === 0 && l(c, s, a) || g === 0 && l(c, r, a));
     }, o = this.points;
     for (let s = 0; s < 4; s++) {
-      const r = o[s], a = o[(s + 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;
+      const r = o[s], c = o[(s + 1) % 4];
+      for (let a = 0; a < 4; a++) {
+        const h = t.points[a], l = t.points[(a + 1) % 4];
+        if (i(r, c, h, l)) return !0;
       }
     }
     for (let s of t.points)
@@ -491,7 +500,7 @@ class A {
    * @returns 
    */
   clone() {
-    return new A(this.minX, this.maxX, this.minY, this.maxY);
+    return new v(this.minX, this.maxX, this.minY, this.maxY);
   }
   /**
    * 
@@ -502,7 +511,7 @@ class A {
     const e = [], n = [];
     return t.forEach((i) => {
       e.push(i.x), n.push(i.y);
-    }), new A(
+    }), new v(
       Math.min(...e),
       Math.max(...e),
       Math.min(...n),
@@ -510,7 +519,16 @@ class A {
     );
   }
 }
-class C {
+function O(y) {
+  if (y === null || typeof y != "object") return y;
+  if (y instanceof Date) return new Date(y.getTime());
+  if (Array.isArray(y)) return y.map(O);
+  const t = {};
+  for (const e in y)
+    Object.prototype.hasOwnProperty.call(y, e) && (t[e] = O(y[e]));
+  return t;
+}
+class N {
   points;
   get p0() {
     return this.points[0];
@@ -533,7 +551,7 @@ class C {
   path2D(t) {
     return this.points.flatMap((e, n) => {
       const i = this.points[(n + 1) % this.points.length];
-      return t && t(new f(e.x, e.y), new f(i.x, i.y)), [e.x, e.y, i.x, i.y];
+      return t && t(new p(e.x, e.y), new p(i.x, i.y)), [e.x, e.y, i.x, i.y];
     });
   }
   createGeometry() {
@@ -559,12 +577,12 @@ class C {
   intersectLineSegment(t) {
     if (t.points.length !== 2)
       throw new Error("LineSegment must have exactly 2 points");
-    const [e, n] = t.points, i = (o, s, r, a) => {
-      const c = (w, u, m) => {
-        const y = (u.y - w.y) * (m.x - u.x) - (u.x - w.x) * (m.y - u.y);
-        return y === 0 ? 0 : y > 0 ? 1 : 2;
-      }, h = (w, u, m) => Math.min(w.x, m.x) <= u.x && u.x <= Math.max(w.x, m.x) && Math.min(w.y, m.y) <= u.y && u.y <= Math.max(w.y, m.y), l = c(o, s, r), d = c(o, s, a), x = c(r, a, o), p = c(r, a, s);
-      return !!(l !== d && x !== p || l === 0 && h(o, r, s) || d === 0 && h(o, a, s) || x === 0 && h(r, o, a) || p === 0 && h(r, s, a));
+    const [e, n] = t.points, i = (o, s, r, c) => {
+      const a = (g, u, x) => {
+        const w = (u.y - g.y) * (x.x - u.x) - (u.x - g.x) * (x.y - u.y);
+        return w === 0 ? 0 : w > 0 ? 1 : 2;
+      }, h = (g, u, x) => Math.min(g.x, x.x) <= u.x && u.x <= Math.max(g.x, x.x) && Math.min(g.y, x.y) <= u.y && u.y <= Math.max(g.y, x.y), l = a(o, s, r), d = a(o, s, c), f = a(r, c, o), m = a(r, c, s);
+      return !!(l !== d && f !== m || l === 0 && h(o, r, s) || d === 0 && h(o, c, s) || f === 0 && h(r, o, c) || m === 0 && h(r, s, c));
     };
     for (let o = 0; o < 4; o++) {
       const s = this.points[o], r = this.points[(o + 1) % 4];
@@ -584,9 +602,9 @@ class C {
     const e = (n) => {
       let i = 0;
       for (let o = 0; o < 4; o++) {
-        const s = this.points[o], r = this.points[(o + 1) % 4], a = { x: r.x - s.x, y: r.y - s.y }, c = { x: n.x - s.x, y: n.y - s.y }, h = a.x * c.y - a.y * c.x;
+        const s = this.points[o], r = this.points[(o + 1) % 4], c = { x: r.x - s.x, y: r.y - s.y }, a = { x: n.x - s.x, y: n.y - s.y }, h = c.x * a.y - c.y * a.x;
         if (h === 0) {
-          const l = a.x !== 0 ? (n.x - s.x) / a.x : (n.y - s.y) / a.y;
+          const l = c.x !== 0 ? (n.x - s.x) / c.x : (n.y - s.y) / c.y;
           if (l >= 0 && l <= 1) return !0;
         } else {
           const l = h > 0 ? 1 : -1;
@@ -614,7 +632,7 @@ class C {
       e.push(s.normal(r));
     }
     function n(o, s) {
-      const r = o.points.map((a) => a.dot(s));
+      const r = o.points.map((c) => c.dot(s));
       return [Math.min(...r), Math.max(...r)];
     }
     function i(o, s) {
@@ -649,7 +667,7 @@ class C {
     let t = 1 / 0, e = -1 / 0, n = 1 / 0, i = -1 / 0;
     return this.points.forEach((o) => {
       e = Math.max(o.x, e), t = Math.min(o.x, t), i = Math.max(o.x, i), n = Math.min(o.x, n);
-    }), new A(t, e, n, i);
+    }), new v(t, e, n, i);
   }
   /**
    * 
@@ -658,21 +676,21 @@ class C {
    * @returns 
    */
   static fromByLineSegment(t, e = 0.1, n = !1, i = 0.5) {
-    const o = t.points[0], s = t.points[1], r = s.normal(o), a = n ? s.direction(o).mutiplyScalar(e * i) : f.zero(), c = n ? o.direction(s).mutiplyScalar(e * i) : f.zero(), h = r.x * e * 0.5, l = r.y * e * 0.5;
-    return new C([
-      new f(o.x + h, o.y + l).add(c),
-      new f(s.x + h, s.y + l).add(a),
-      new f(s.x - h, s.y - l).add(a),
-      new f(o.x - h, o.y - l).add(c)
+    const o = t.points[0], s = t.points[1], r = s.normal(o), c = n ? s.direction(o).mutiplyScalar(e * i) : p.zero(), a = n ? o.direction(s).mutiplyScalar(e * i) : p.zero(), h = r.x * e * 0.5, l = r.y * e * 0.5;
+    return new N([
+      new p(o.x + h, o.y + l).add(a),
+      new p(s.x + h, s.y + l).add(c),
+      new p(s.x - h, s.y - l).add(c),
+      new p(o.x - h, o.y - l).add(a)
     ]);
   }
 }
 class b {
-  points = [new f(), new f()];
+  points = [new p(), new p()];
   userData = {};
   line;
   get center() {
-    return new f(
+    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
     );
@@ -683,11 +701,35 @@ class b {
   get end() {
     return this.points[1];
   }
-  constructor(t = new f(), e = new f()) {
+  constructor(t = new p(), e = new p()) {
     this.points = [t, e];
   }
   set(t, e) {
-    this.start.copy(t), this.end.copy(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 
+   */
+  sameEndpointAsEnd(t) {
+    return this.end.equal(t.start) || this.end.equal(t.end);
   }
   /** 膨胀
    * @description 向线段的两个端点分别膨胀 width
@@ -728,15 +770,15 @@ class b {
    * @returns {Rectangle}
    */
   expandToRectangle(t = 0.1, e = "all") {
-    const n = this.start, i = this.end, o = i.normal(n), s = e === "bothSides" ? f.zero() : i.direction(n).mutiplyScalar(t * 0.5), r = e === "bothSides" ? f.zero() : n.direction(i).mutiplyScalar(t * 0.5), a = o.x * t * 0.5, c = o.y * t * 0.5, h = [
+    const n = this.start, i = this.end, o = i.normal(n), s = e === "bothSides" ? p.zero() : i.direction(n).mutiplyScalar(t * 0.5), r = e === "bothSides" ? p.zero() : n.direction(i).mutiplyScalar(t * 0.5), c = o.x * t * 0.5, a = o.y * t * 0.5, h = [
       // 第一条线
-      new f(n.x + a, n.y + c).add(r),
-      new f(i.x + a, i.y + c).add(s),
+      new p(n.x + c, n.y + a).add(r),
+      new p(i.x + c, i.y + a).add(s),
       // 第二条线
-      new f(n.x - a, n.y - c).add(r),
-      new f(i.x - a, i.y - c).add(s)
+      new p(n.x - c, n.y - a).add(r),
+      new p(i.x - c, i.y - a).add(s)
     ];
-    return new C([0, 1, 3, 2].map((l) => h[l]));
+    return new N([0, 1, 3, 2].map((l) => h[l]));
   }
   /**
    * 计算线段的长度
@@ -773,24 +815,24 @@ class b {
   projectLineSegment(t) {
     if (t.points.length !== 2 || this.points.length !== 2)
       throw new Error("每条线段必须由两个点定义");
-    const [e, n] = t.points, [i, o] = this.points, s = new f(o.x - i.x, o.y - i.y);
+    const [e, n] = t.points, [i, o] = this.points, s = new p(o.x - i.x, o.y - i.y);
     if (s.x === 0 && s.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
-    const r = (p) => {
-      const w = new f(p.x - i.x, p.y - i.y), u = s.x * s.x + s.y * s.y, y = (w.x * s.x + w.y * s.y) / u, S = i.x + y * s.x, D = i.y + y * s.y;
-      return new f(S, D);
+    const r = (m) => {
+      const g = new p(m.x - i.x, m.y - i.y), u = s.x * s.x + s.y * s.y, w = (g.x * s.x + g.y * s.y) / u, S = i.x + w * s.x, L = i.y + w * s.y;
+      return new p(S, L);
     };
-    let a = r(e), c = r(n);
-    const h = (p) => {
-      const w = new f(p.x - i.x, p.y - i.y), u = s.x * s.x + s.y * s.y;
-      return (w.x * s.x + w.y * s.y) / u;
+    let c = r(e), a = r(n);
+    const h = (m) => {
+      const g = new p(m.x - i.x, m.y - i.y), u = s.x * s.x + s.y * s.y;
+      return (g.x * s.x + g.y * s.y) / u;
     };
-    let l = h(a), d = h(c);
-    const x = (p) => {
-      const w = Math.max(0, Math.min(1, p)), u = i.x + w * s.x, m = i.y + w * s.y;
-      return new f(u, m);
+    let l = h(c), d = h(a);
+    const f = (m) => {
+      const g = Math.max(0, Math.min(1, m)), u = i.x + g * s.x, x = i.y + g * s.y;
+      return new p(u, x);
     };
-    return (l < 0 || l > 1) && (a = x(l)), (d < 0 || d > 1) && (c = x(d)), a.x === c.x && a.y === c.y ? new b(a, a) : new b(a, c);
+    return (l < 0 || l > 1) && (c = f(l)), (d < 0 || d > 1) && (a = f(d)), c.x === a.x && c.y === a.y ? new b(c, c) : new b(c, a);
   }
   /**
    * 计算一条线段在另一条直线上的投影
@@ -799,19 +841,19 @@ class b {
    * @returns 投影并裁剪后的线段
    */
   projectPoint(t, e = !0) {
-    const [n, i] = this.points, o = new f(i.x - n.x, i.y - n.y);
+    const [n, i] = this.points, o = new p(i.x - n.x, i.y - n.y);
     if (o.x === 0 && o.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
     let r = ((h) => {
-      const l = new f(h.x - n.x, h.y - n.y), d = o.x * o.x + o.y * o.y, p = (l.x * o.x + l.y * o.y) / d, w = n.x + p * o.x, u = n.y + p * o.y;
-      return new f(w, u);
+      const l = new p(h.x - n.x, h.y - n.y), d = o.x * o.x + o.y * o.y, m = (l.x * o.x + l.y * o.y) / d, g = n.x + m * o.x, u = n.y + m * o.y;
+      return new p(g, u);
     })(t);
     if (!e) return r;
-    let c = ((h) => {
-      const l = new f(h.x - n.x, h.y - n.y), d = o.x * o.x + o.y * o.y;
+    let a = ((h) => {
+      const l = new p(h.x - n.x, h.y - n.y), d = o.x * o.x + o.y * o.y;
       return (l.x * o.x + l.y * o.y) / d;
     })(r);
-    return c < 0 || c > 1 ? null : r;
+    return a < 0 || a > 1 ? null : r;
   }
   /**
    * 判断线段是否与另一条线段相交（包含共用端点或部分重合的情况）
@@ -819,14 +861,14 @@ class b {
    */
   intersectLineSegment(t) {
     const e = this.start, n = this.end, i = t.start, o = t.end;
-    function s(d, x, p) {
-      return (x.x - d.x) * (p.y - d.y) - (x.y - d.y) * (p.x - d.x);
+    function s(d, f, m) {
+      return (f.x - d.x) * (m.y - d.y) - (f.y - d.y) * (m.x - d.x);
     }
-    function r(d, x, p) {
-      return Math.min(x.x, p.x) - 1e-10 <= d.x && d.x <= Math.max(x.x, p.x) + 1e-10 && Math.min(x.y, p.y) - 1e-10 <= d.y && d.y <= Math.max(x.y, p.y) + 1e-10;
+    function r(d, f, m) {
+      return Math.min(f.x, m.x) - 1e-10 <= d.x && d.x <= Math.max(f.x, m.x) + 1e-10 && Math.min(f.y, m.y) - 1e-10 <= d.y && d.y <= Math.max(f.y, m.y) + 1e-10;
     }
-    const a = s(e, n, i), c = s(e, n, o), h = s(i, o, e), l = s(i, o, n);
-    return !!(a * c < 0 && h * l < 0 || Math.abs(a) < 1e-10 && r(i, e, n) || Math.abs(c) < 1e-10 && r(o, e, n) || Math.abs(h) < 1e-10 && r(e, i, o) || Math.abs(l) < 1e-10 && r(n, i, o));
+    const c = s(e, n, i), a = s(e, n, o), h = s(i, o, e), l = s(i, o, n);
+    return !!(c * a < 0 && h * l < 0 || Math.abs(c) < 1e-10 && r(i, e, n) || Math.abs(a) < 1e-10 && r(o, e, n) || Math.abs(h) < 1e-10 && r(e, i, o) || Math.abs(l) < 1e-10 && r(n, i, o));
   }
   /**
    * 获取交点
@@ -837,8 +879,8 @@ class b {
     const e = this.start, n = this.end, i = t.start, o = t.end, s = (e.x - n.x) * (i.y - o.y) - (e.y - n.y) * (i.x - o.x);
     if (Math.abs(s) < 1e-10)
       return null;
-    const r = ((e.x - i.x) * (i.y - o.y) - (e.y - i.y) * (i.x - o.x)) / s, a = e.x + r * (n.x - e.x), c = e.y + r * (n.y - e.y);
-    return new f(a, c);
+    const r = ((e.x - i.x) * (i.y - o.y) - (e.y - i.y) * (i.x - o.x)) / s, c = e.x + r * (n.x - e.x), a = e.y + r * (n.y - e.y);
+    return new p(c, a);
   }
   /**
    * 获取两条线段夹角
@@ -876,28 +918,29 @@ class b {
    * @returns 
    */
   areLinesCoincident(t) {
-    const e = this.start, n = this.end, i = t.start, o = t.end, s = (n.y - e.y) / (n.x - e.x), r = e.y - s * e.x, a = (o.y - i.y) / (o.x - i.x), c = i.y - a * i.x;
-    return !isFinite(s) && !isFinite(a) ? e.x === i.x && n.x === i.x : Math.abs(s - a) < 1e-3 && Math.abs(r - c) < 1e-3;
+    const e = this.start, n = this.end, i = t.start, o = t.end, s = (n.y - e.y) / (n.x - e.x), r = e.y - s * e.x, c = (o.y - i.y) / (o.x - i.x), a = i.y - c * i.x;
+    return !isFinite(s) && !isFinite(c) ? e.x === i.x && n.x === i.x : Math.abs(s - c) < 1e-3 && Math.abs(r - a) < 1e-3;
   }
   clone() {
-    return new b(
+    const t = new b(
       this.points[0].clone(),
       this.points[1].clone()
     );
+    return t.userData = O(this.userData), t;
   }
 }
-async function j(g, t = !0) {
+async function G(y, t = !0) {
   if (typeof global < "u" && typeof require < "u")
-    return require(g);
+    return require(y);
   {
     let e = await import(
       /* @vite-ignore */
-      g
+      y
     );
     return t && (e = e.default), e;
   }
 }
-const nt = {
+const st = {
   Unitless: 1,
   // 无单位，1米 = 1（无单位）
   Inches: 39.37007874015748,
@@ -941,27 +984,27 @@ const nt = {
   Parsecs: 3240779289666404e-32
   // 秒差距，1米 ≈ 0.00000000000000003240779289666404秒差距
 };
-function F(g) {
+function k(y) {
   const t = [];
-  for (let e = 0; e < g.length; e++)
+  for (let e = 0; e < y.length; e++)
     t.push(new b(
-      g[e].clone(),
-      g[(e + 1) % g.length].clone()
+      y[e].clone(),
+      y[(e + 1) % y.length].clone()
     ));
   return t;
 }
-function z(g) {
-  return g.flatMap((t, e) => (e === g.length - 1 && [...t.points, g[0].points[0]], [t.points[0]]));
+function J(y) {
+  return y.flatMap((t, e) => (e === y.length - 1 && [...t.points, y[0].points[0]], [t.points[0]]));
 }
-class I extends X {
+class X extends j {
   static name = "Dxf";
   shortLine = 0.04;
   width = 0.04;
   scale = 1;
   originalData = [];
   data = [];
-  originalBox = new A(0, 0, 0, 0);
-  box = new A(0, 0, 0, 0);
+  originalBox = new v(0, 0, 0, 0);
+  box = new v(0, 0, 0, 0);
   pointsGroups = [];
   wallsGroup = [];
   doors = [];
@@ -1005,24 +1048,24 @@ class I extends X {
         const { default: s } = await import(
           /* @vite-ignore */
           "fs"
-        ), r = s.readFileSync(t), a = JSON.parse(r.toString("utf-8"));
-        return this.set(a, e, n);
+        ), r = s.readFileSync(t), c = JSON.parse(r.toString("utf-8"));
+        return this.set(c, 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: o, end: s, insetionArr: r, isDoor: a = !1, isWindow: c, drawDoorData: h }, l) => {
+    this.data = t.map(({ start: o, end: s, insetionArr: r, isDoor: c = !1, ...a }, h) => {
       i.push(o.z ?? 0, s.z ?? 0);
-      const d = new b(
-        f.from(o).mutiplyScalar(n),
-        f.from(s).mutiplyScalar(n)
+      const l = new b(
+        p.from(o).mutiplyScalar(n),
+        p.from(s).mutiplyScalar(n)
       );
-      return d.userData = { isDoor: a, isWindow: c, drawDoorData: h }, this.lineSegments.push(d), [
-        d.points[0],
-        d.points[1],
-        (r ?? []).map((x) => x.index),
-        a,
-        l
+      return l.userData = { isDoor: c, ...a }, this.lineSegments.push(l), [
+        l.points[0],
+        l.points[1],
+        (r ?? []).map((d) => d.index),
+        c,
+        h
       ];
     }), this.originalZAverage = i.reduce((o, s) => o + s, 0) / i.length, this.computedOriginalSize(t, this.originalBox), this.dispatchEvent({
       type: "setDta",
@@ -1038,18 +1081,18 @@ class I extends X {
    * @returns 
    */
   createGroups() {
-    const t = [], e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Map(), o = (s, r, a = -1) => {
-      const [c, h, l, d] = this.data[s];
+    const t = [], e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Map(), o = (s, r, c = -1) => {
+      const [a, h, l, d] = this.data[s];
       if (e.add(s), d)
-        return i.has(s) || i.set(s, []), i.get(s)?.push(a), n.add(this.data[s]);
-      r.push([c, h]), l.forEach((x) => {
-        e.has(x) || o(x, r, s);
+        return i.has(s) || i.set(s, []), i.get(s)?.push(c), n.add(this.data[s]);
+      r.push([a, h]), l.forEach((f) => {
+        e.has(f) || o(f, r, s);
       });
     };
     return this.data.forEach((s, r) => {
       if (!e.has(r)) {
-        const a = [];
-        o(r, a), t.push(a);
+        const c = [];
+        o(r, c), t.push(c);
       }
     }), this.doors = [...n], this.pointsGroups = t, t;
   }
@@ -1059,7 +1102,7 @@ class I extends X {
    * @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), o = Math.max(...t), s = Math.max(...e);
+    const t = this.pointsGroups.flatMap((r) => r.flatMap((c) => [c[0].x, c[1].x])), e = this.pointsGroups.flatMap((r) => r.flatMap((c) => [c[0].y, c[1].y])), n = Math.min(...t), i = Math.min(...e), o = Math.max(...t), s = Math.max(...e);
     return this.box.set(n, i, o, s), this.box;
   }
   /** 线路拓扑
@@ -1069,12 +1112,12 @@ class I extends X {
   lineTopology(t) {
     const e = [];
     function n(o, s) {
-      const [r, a] = t[o];
-      e[o] = !0, s.push(a);
-      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)
-          return n(c, s);
+      const [r, c] = t[o];
+      e[o] = !0, s.push(c);
+      for (let a = 0; a < t.length; a++) {
+        const [h, l] = t[a];
+        if (!e[a] && Math.abs(c.x - h.x) < 1e-6 && Math.abs(c.y - h.y) < 1e-6)
+          return n(a, s);
       }
     }
     const i = [];
@@ -1111,9 +1154,9 @@ class I extends X {
       const i = t[n - 1], o = t[n];
       if (i.distance(o) < 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 c = n + 1; c < t.length; c++) {
+          const a = t[c - 1], h = t[c];
+          if (a.distance(h) < 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(o));
@@ -1135,7 +1178,7 @@ class I extends X {
         break;
       }
     }
-    const e = this.mergeSameDirectionLine(F(t)), n = [e[0]];
+    const e = this.mergeSameDirectionLine(k(t)), n = [e[0]];
     for (let i = 1; i < e.length; i++) {
       const o = e[i], s = e[(e.length + i - 1) % e.length];
       if (o.length() > this.width * 0.9) {
@@ -1147,10 +1190,10 @@ class I extends X {
         n.push(o), n.push(r), i = i + 1;
         continue;
       }
-      const a = e[i + 2];
-      a && s.includedAngle(a) < 2 ? (i = i + 2, n.push(a)) : n.push(o);
+      const c = e[i + 2];
+      c && s.includedAngle(c) < 2 ? (i = i + 2, n.push(c)) : n.push(o);
     }
-    return n.length > 3 ? z(this.mergeSameDirectionLine(n)) : [];
+    return n.length > 3 ? J(this.mergeSameDirectionLine(n)) : [];
   }
   /**
    * 移除短线段
@@ -1158,48 +1201,48 @@ class I extends X {
    * @param path 
    */
   removeShortLine(t, e = this.shortLine) {
-    const n = F(t), i = [], o = Math.PI / 180;
+    const n = k(t), i = [], o = Math.PI / 180;
     for (let s = 0; s < n.length; s++) {
-      const r = n[s], a = r.length(), c = s;
-      if (a > e || i.length === 0) {
+      const r = n[s], c = r.length(), a = s;
+      if (c > e || i.length === 0) {
         i.push(r);
         continue;
       }
       let h = n[++s];
       const l = i[i.length - 1], d = l.direction();
       for (; s < n.length; ) {
-        const p = d.angleBetween(h.direction()) / o;
-        if (h.length() <= e || p < 4 || p > 176)
+        const m = d.angleBetween(h.direction()) / o;
+        if (h.length() <= e || m < 4 || m > 176)
           h = n[++s];
         else break;
       }
       if (!h) continue;
-      const x = n[s - 1];
-      if (l.length() > x.length()) {
-        const p = l.getIntersection(h);
-        if (p) {
-          const w = l.points[1].clone(), u = h.points[0].clone();
-          l.points[1].copy(p), h.points[0].copy(p), l.length() < this.width ? (l.points[1].copy(w), h.points[0].copy(w)) : h.length() < this.width && (l.points[1].copy(u), h.points[0].copy(u));
+      const f = n[s - 1];
+      if (l.length() > f.length()) {
+        const m = l.getIntersection(h);
+        if (m) {
+          const g = 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(g), h.points[0].copy(g)) : 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
-        s = c;
+        s = a;
     }
-    return i.length > 3 ? z(i) : [];
+    return i.length > 3 ? J(i) : [];
   }
   /** 线偏移
    * @description 使用 ClipperLib 对每个点组进行线偏移处理，生成具有指定宽度的墙体路径
    */
-  lineOffset(t = I.EndType.etOpenSquare, e = I.JoinType.jtMiter, n = 1e4) {
-    let i = new V.Paths();
-    const o = new V.ClipperOffset(20, 0.25);
+  lineOffset(t = X.EndType.etOpenSquare, e = X.JoinType.jtMiter, n = 1e4) {
+    let i = new F.Paths();
+    const o = new F.ClipperOffset(20, 0.25);
     return this.pointsGroups.forEach((s) => {
-      const r = this.lineTopology(s).map((a) => a.map((c) => c.clone().mutiplyScalar(n)));
+      const r = this.lineTopology(s).map((c) => c.map((a) => a.clone().mutiplyScalar(n)));
       o.AddPaths(r, e, t);
     }), o.Execute(i, this.width / 2 * n), this.wallsGroup = i.map((s) => {
-      let r = s.map((a) => f.from(a).divisionScalar(n));
-      return r = this.lineSegmentStraightening(r), t == I.EndType.etOpenSquare && (r = this.squareRemoveBurr(r)), r = this.removeShortLine(r), r;
+      let r = s.map((c) => p.from(c).divisionScalar(n));
+      return r = this.lineSegmentStraightening(r), t == X.EndType.etOpenSquare && (r = this.squareRemoveBurr(r)), r = this.removeShortLine(r), r;
     }), this.dispatchEvent({
       type: "lineOffset",
       wallsGroup: this.wallsGroup
@@ -1212,8 +1255,8 @@ class I extends X {
     const n = [];
     return this.wallsGroup.forEach((i) => {
       for (let o = 0; o < i.length; o++) {
-        const s = i[o], r = o === i.length - 1 ? 0 : o + 1, a = i[r];
-        n.push(s.X * t, s.Y * t, e, a.X * t, a.Y * t, e);
+        const s = i[o], r = o === i.length - 1 ? 0 : o + 1, c = i[r];
+        n.push(s.X * t, s.Y * t, e, c.X * t, c.Y * t, e);
       }
     }), new Float32Array(n);
   }
@@ -1225,58 +1268,133 @@ class I extends X {
    */
   getArcAngleRange(t, e, n) {
     const i = e.x - t.x, o = e.y - t.y, s = n.x - t.x, r = n.y - t.y;
-    let a = Math.atan2(o, i), c = Math.atan2(r, s);
-    a = a < 0 ? a + 2 * Math.PI : a, c = c < 0 ? c + 2 * Math.PI : c;
+    let c = Math.atan2(o, i), a = Math.atan2(r, s);
+    c = c < 0 ? c + 2 * Math.PI : c, a = a < 0 ? a + 2 * Math.PI : a;
     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)];
+    return Math.abs(a - c) <= Math.PI ? (h = Math.min(c, a), l = Math.max(c, a)) : (h = Math.max(c, a), l = Math.min(c, a) + 2 * Math.PI), [h / (Math.PI / 180), l / (Math.PI / 180)];
   }
   /**
-   * 将点云结构转换为string
+   * 转为绘制数据
    */
-  toDxfString(t = "Millimeters") {
-    const e = new N();
-    e.setUnits("Millimeters");
-    const n = nt[t];
-    function i(r, a) {
-      e.drawLine(r.X * n, r.Y * n, a.X * n, a.Y * n);
+  toDrawDataJson(t = "Millimeters") {
+    const e = st[t], n = {
+      unit: t,
+      line: [],
+      arc: [],
+      dimensionLine: [],
+      center: this.box.center.toJson(),
+      width: this.box.width * e,
+      height: this.box.height * e,
+      scale: e
+    };
+    let i = "white";
+    function o(a, h) {
+      n.line.push([a.X * e, a.Y * e, h.X * e, h.Y * e, i]);
+    }
+    function s(a, h, l, d) {
+      n.arc.push([
+        a.x * e,
+        a.y * e,
+        h * e,
+        l,
+        d,
+        i
+      ]);
+    }
+    for (let a = 0; a < this.originalData.length; a++) {
+      const h = this.originalData[a];
+      if (h.isVerticalReferenceLine) {
+        n.dimensionLine.push([h.start.x * e, h.start.y * e, h.end.x * e, h.end.y * e]);
+        break;
+      }
     }
-    this.wallsGroup.forEach((r) => {
-      for (let a = 0; a < r.length; a++) {
-        const c = r[a], h = a === r.length - 1 ? 0 : a + 1, l = r[h];
-        i(c, l);
+    this.wallsGroup.forEach((a) => {
+      for (let h = 0; h < a.length; h++) {
+        const l = a[h], d = h === a.length - 1 ? 0 : h + 1, f = a[d];
+        o(l, f);
       }
     });
-    const o = this.width * 0.2, s = [];
-    return e.addLayer("l_cyan", N.ACI.CYAN, "DOTTED"), this.doorLineSegment.forEach((r) => {
-      if (r.length() < 0.4) return;
-      const a = r.clone().expansion(-this.width * 0.5);
-      if (e.setActiveLayer("l_cyan"), a.length() < 1.2) {
-        a.expansion(-o * 0.5);
-        const c = r.normal();
-        let h = new b(
-          a.start.clone(),
-          a.start.clone().add(c.clone().multiplyScalar(a.length()))
+    const r = this.width * 0.2, c = [];
+    return this.doorLineSegment.forEach((a) => {
+      if (a.length() < 0.4) return;
+      const h = a.clone().expansion(-this.width * 0.5);
+      if (i = "cyan", h.length() < 1.2) {
+        h.expansion(-r * 0.5);
+        const l = a.normal();
+        let d = new b(
+          h.start.clone(),
+          h.start.clone().add(l.clone().multiplyScalar(h.length()))
         );
-        const l = h.clone().directionMove(h.normal(), a.length() * -0.5).expandToRectangle(a.length(), "bothSides");
-        for (let y = 0; y < s.length; y++)
-          if (s[y].intersectRectangle(l)) {
-            h = new b(
-              a.start.clone(),
-              a.start.clone().add(c.clone().multiplyScalar(-a.length()))
+        const f = d.clone().directionMove(d.normal(), h.length() * -0.5).expandToRectangle(h.length(), "bothSides");
+        for (let L = 0; L < c.length; L++)
+          if (c[L].intersectRectangle(f)) {
+            d = new b(
+              h.start.clone(),
+              h.start.clone().add(l.clone().multiplyScalar(-h.length()))
             );
             break;
           }
-        h.expansion(-o * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((y, S) => i(y, S));
-        const d = a.length(), x = h.length(), p = (d ** 2 + x ** 2) / (2 * x), w = h.end.clone().add(h.direction().multiplyScalar(-p)), [u, m] = this.getArcAngleRange(w, a.end, h.end);
-        e.drawArc(w.x * n, w.y * n, p * n, Math.min(u, m), Math.max(u, m)), s.push(l);
+        d.expansion(-r * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((L, P) => o(L, P));
+        const m = h.length(), g = d.length(), u = (m ** 2 + g ** 2) / (2 * g), x = d.end.clone().add(d.direction().multiplyScalar(-u)), [w, S] = this.getArcAngleRange(x, h.end, d.end);
+        s(x, u, Math.min(w, S), Math.max(w, S)), c.push(f);
       } else
-        a.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((c, h) => i(c, h)), a.clone().directionMove(a.normal(), o * 0.5).directionMove(a.direction(), o * 0.5).expansion(-a.length() * 0.45, "end").forward(o * 0.5).expandToRectangle(o).path2D((c, h) => i(c, h)), a.clone().directionMove(a.normal(), -o * 0.5).directionMove(a.direction(), -o * 0.5).expansion(-a.length() * 0.45, "start").forward(-o * 0.5).expandToRectangle(o).path2D((c, h) => i(c, h));
-    }), e.addLayer("l_yellow", N.ACI.YELLOW, "DOTTED"), e.setActiveLayer("l_yellow"), this.lineSegments.forEach((r) => {
-      if (!r.userData.isWindow) return !1;
-      Array.isArray(r.userData.drawDoorData) && r.userData.drawDoorData.forEach((a) => {
-        const { p: c, width: h } = a, l = f.from(c), d = l.clone().add(r.direction().multiplyScalar(h * 0.5)), x = l.clone().add(r.direction().multiplyScalar(-h * 0.5)), p = new b(d, x);
-        i(p.start, p.end), p.expandToRectangle(this.width, "bothSides").path2D((w, u) => i(w, u));
+        h.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((l, d) => o(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) => o(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) => o(l, d));
+    }), i = "yellow", this.lineSegments.forEach((a) => {
+      if (!a.userData.isWindow) return !1;
+      Array.isArray(a.userData.drawWindow) && a.userData.drawWindow.forEach((h) => {
+        const { p: l, width: d } = h, f = p.from(l), m = f.clone().add(a.direction().multiplyScalar(d * 0.5)), g = f.clone().add(a.direction().multiplyScalar(-d * 0.5)), u = new b(m, g);
+        o(u.start, u.end), u.expandToRectangle(this.width, "bothSides").path2D((x, w) => o(x, w));
       });
+    }), n;
+  }
+  /**
+   * 
+   * @param type 
+   */
+  async toDxfImageBlob(t = "Centimeters", e = "image/jpeg") {
+    const n = this.toDrawDataJson(t);
+    let i;
+    if (typeof window < "u")
+      i = document.createElement("canvas");
+    else if (typeof global < "u") {
+      const { createCanvas: c } = await G("canvas");
+      i = c();
+    } else
+      throw new Error("创建画布失败");
+    const o = 2 * n.scale, s = {
+      cyan: "cyan",
+      yellow: "yellow",
+      white: "white"
+    };
+    i.width = n.width + o * 2, i.height = n.height + o * 2;
+    const r = i.getContext("2d");
+    return r.fillRect(0, 0, i.width, i.height), r.translate(n.width * 0.5 + o, n.height * 0.5 + o), n.line.forEach(([c, a, h, l, d]) => {
+      r.strokeStyle = s[d], r.beginPath(), r.moveTo(c, a), r.lineTo(h, l), r.closePath(), r.stroke();
+    }), n.arc.forEach(([c, a, h, l, d, f]) => {
+      r.strokeStyle = s[f], r.beginPath(), r.arc(c, a, h, l * (Math.PI / 180), d * (Math.PI / 180)), r.stroke();
+    }), r.beginPath(), n.dimensionLine.forEach((c) => {
+      let [a, h, l, d] = c;
+      const f = Math.min(h, d), m = Math.max(h, d), g = (i.width * 0.5 - 0.4 * n.scale) * (a < 0 ? -1 : 1), u = (m - f) * 0.45;
+      r.fillStyle = "#fff", r.font = `${0.15 * n.scale}px Arial`, r.textAlign = "center", r.textBaseline = "middle", r.fillText((m - f).toFixed(2) + "cm", g, f + (m - f) * 0.5), r.moveTo(g - 0.1 * n.scale, f), r.lineTo(g + 0.1 * n.scale, f), r.moveTo(g, f), r.lineTo(g, u + f), r.moveTo(g, m), r.lineTo(g, m - u), r.moveTo(g - 0.1 * n.scale, m), r.lineTo(g + 0.1 * n.scale, m);
+    }), r.closePath(), r.strokeStyle = "#fff", r.stroke(), i instanceof HTMLCanvasElement ? new Promise((c) => {
+      i.toBlob((a) => {
+        c(a);
+      }, e, 1);
+    }) : i.toBuffer(e);
+  }
+  /**
+   * 将点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 [o, s, r, c, a] = i;
+      e.setActiveLayer(a), e.drawLine(o, s, r, c);
+    }), n.arc.forEach((i) => {
+      const [o, s, r, c, a, h] = i;
+      e.setActiveLayer(h), e.drawArc(o, s, r, c, a);
     }), e.toDxfString();
   }
   /**
@@ -1294,16 +1412,29 @@ class I extends X {
     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 j("fs", !1)).writeFileSync(t, this.toDxfString(e));
+    } else typeof global < "u" && (await G("fs", !1)).writeFileSync(t, this.toDxfString(e));
+  }
+  /**
+   * 下载
+   * @param filename 
+   */
+  async downloadImage(t, e = "Centimeters", n = "image/jpg") {
+    const i = await this.toDxfImageBlob(e, n);
+    if (!i) return !1;
+    if (typeof window < "u") {
+      const o = document.createElement("a");
+      o.href = URL.createObjectURL(i), o.download = t, o.click();
+    } else typeof global < "u" && (await G("fs", !1)).writeFileSync(t, i);
+    return !0;
   }
   /**
    * 计算原始数据的边界框
    * @description 计算所有线段的起点和终点的最小最大值，形成一个边界框
    * @returns 
    */
-  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]), o = Math.min(...n), s = Math.min(...i), r = Math.max(...n), a = Math.max(...i);
-    return e.set(o, s, r, a), e;
+  computedOriginalSize(t, e = new v(0, 0, 0, 0)) {
+    const n = t.flatMap((a) => [a.start.x, a.end.x]), i = t.flatMap((a) => [a.start.y, a.end.y]), o = Math.min(...n), s = Math.min(...i), r = Math.max(...n), c = Math.max(...i);
+    return e.set(o, s, r, c), e;
   }
   /**
    * 创建数据
@@ -1313,14 +1444,14 @@ class I extends X {
   static createData(t, e = !0) {
     let n = 0;
     return t.flatMap((o) => {
-      const s = o.map((r, a) => {
-        const c = a === o.length - 1 ? 0 : a + 1, h = o[c];
+      const s = o.map((r, c) => {
+        const a = c === o.length - 1 ? 0 : c + 1, h = o[a];
         return {
           start: { x: r.x, y: r.y },
           end: { x: h.x, y: h.y },
           insetionArr: [
             {
-              index: c + n
+              index: a + n
             }
           ]
         };
@@ -1329,7 +1460,51 @@ class I extends X {
     });
   }
 }
-class k extends X {
+const I = new b();
+class ot extends X {
+  static name = "AngleCorrectionDxf";
+  onAddFromParent(t) {
+    const e = t.findComponentByName("Dxf"), n = t.findComponentByName("LineAnalysis");
+    n.addEventListener("analysisCompleted", async () => {
+      let i = 0, o = null;
+      for (let a = 0; a < e.originalData.length; a++) {
+        const h = e.originalData[a];
+        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 b(l, d).direction().angleBetween(new p(0, 1), "angle", "360"), o = null;
+          break;
+        }
+        (!o || I.length() > o.length()) && (o = I.clone(), o.userData.index = a);
+      }
+      if (o) {
+        e.originalData[o.userData.index].isVerticalReferenceLine = !0;
+        const [a, h] = o.start.y < o.end.y ? [o.start, o.end] : [o.end, o.start];
+        i = -new b(a, h).direction().angleBetween(new p(0, 1), "angle", "360");
+      }
+      const s = e.originalBox.center, r = p.zero(), c = e.originalData.map((a) => {
+        const h = r.copy(a.start).division(s).rotate(p.zero(), i * (Math.PI / 180)).toJson(a.start.z), l = r.copy(a.end).division(s).rotate(p.zero(), i * (Math.PI / 180)).toJson(a.end.z), d = Object.assign(O(a), { start: h, end: l });
+        return d.drawWindow && d.drawWindow.forEach((f) => {
+          f.p = r.copy(f.p).division(s).rotate(p.zero(), i * (Math.PI / 180)).toJson(f.p.z), f.p.y = -f.p.y;
+        }), d;
+      });
+      n.appendLineSegmentList.forEach((a) => {
+        const h = a.clone();
+        h.start.division(s).rotate(p.zero(), i * (Math.PI / 180)), h.end.division(s).rotate(p.zero(), i * (Math.PI / 180)), c.push({
+          start: h.start.toJson(e.originalZAverage),
+          end: h.end.toJson(e.originalZAverage),
+          insetionArr: [],
+          length: h.length()
+        });
+      }), c.forEach((a) => {
+        a.start.y = -a.start.y, a.end.y = -a.end.y;
+      }), await this.set(c, e.width, e.scale), this.lineOffset(), this.doorLineSegment = e.doorLineSegment.map((a) => {
+        const h = a.clone();
+        return h.start.division(s).rotate(p.zero(), i * (Math.PI / 180)), h.end.division(s).rotate(p.zero(), i * (Math.PI / 180)), h.start.y = -h.start.y, h.end.y = -h.end.y, h;
+      });
+    });
+  }
+}
+class _ extends j {
   static name = "Variable";
   originalLineVisible = !0;
   dxfVisible = !0;
@@ -1356,7 +1531,7 @@ class k extends X {
     if (t in this) return this[t];
   }
 }
-class B {
+class q {
   bounds;
   // 包围盒
   capacity;
@@ -1422,23 +1597,23 @@ class B {
     if (!this.isLeaf) return;
     this.isLeaf = !1, this.children = [];
     const t = (this.bounds.minX + this.bounds.maxX) / 2, e = (this.bounds.minY + this.bounds.maxY) / 2;
-    this.children[0] = new B(
-      new A(this.bounds.minX, t, this.bounds.minY, e),
+    this.children[0] = new q(
+      new v(this.bounds.minX, t, this.bounds.minY, e),
       this.capacity,
       this.maxDepth,
       this.depth + 1
-    ), this.children[1] = new B(
-      new A(t, this.bounds.maxX, this.bounds.minY, e),
+    ), this.children[1] = new q(
+      new v(t, this.bounds.maxX, this.bounds.minY, e),
       this.capacity,
       this.maxDepth,
       this.depth + 1
-    ), this.children[2] = new B(
-      new A(this.bounds.minX, t, e, this.bounds.maxY),
+    ), this.children[2] = new q(
+      new v(this.bounds.minX, t, e, this.bounds.maxY),
       this.capacity,
       this.maxDepth,
       this.depth + 1
-    ), this.children[3] = new B(
-      new A(t, this.bounds.maxX, e, this.bounds.maxY),
+    ), this.children[3] = new q(
+      new v(t, this.bounds.maxX, e, this.bounds.maxY),
       this.capacity,
       this.maxDepth,
       this.depth + 1
@@ -1467,7 +1642,7 @@ class B {
    * @returns 相交的节点数组
    */
   queryCircle(t, e) {
-    const n = [], i = new A(
+    const n = [], i = new v(
       t.x - e,
       t.x + e,
       t.y - e,
@@ -1476,11 +1651,11 @@ class B {
     if (!this.bounds.intersectBox(i))
       return n;
     for (const o of this.nodes) {
-      const [s, r] = o.line.points, a = r.x - s.x, c = r.y - s.y, h = a * a + c * c;
-      let l = ((t.x - s.x) * a + (t.y - s.y) * c) / h;
+      const [s, r] = o.line.points, c = r.x - s.x, a = r.y - s.y, h = c * c + a * a;
+      let l = ((t.x - s.x) * c + (t.y - s.y) * a) / h;
       l = Math.max(0, Math.min(1, l));
-      const d = s.x + l * a, x = s.y + l * c;
-      t.distance(new f(d, x)) <= e && n.push(o);
+      const d = s.x + l * c, f = s.y + l * a;
+      t.distance(new p(d, f)) <= e && n.push(o);
     }
     if (!this.isLeaf)
       for (const o of this.children)
@@ -1582,7 +1757,7 @@ class U {
    */
   decodeGridId(t) {
     const [e, n] = t.split(".").map(Number);
-    return new f(e, n);
+    return new p(e, n);
   }
   /**
    * 查询与矩形相交的点
@@ -1592,10 +1767,10 @@ class U {
   queryRect(t) {
     const e = t.toBox(), n = Math.ceil(e.minX / this.gridSize), i = Math.ceil(e.maxX / this.gridSize), o = Math.ceil(e.minY / this.gridSize), s = Math.ceil(e.maxY / this.gridSize);
     for (let r = n; r <= i; r++)
-      for (let a = o; a <= s; a++) {
-        const c = `${r}.${a}`;
-        if (!this.map.has(c)) continue;
-        this.map.get(c)?.forEach((l) => {
+      for (let c = o; c <= s; c++) {
+        const a = `${r}.${c}`;
+        if (!this.map.has(a)) continue;
+        this.map.get(a)?.forEach((l) => {
           t.containsPoint(l.point);
         });
       }
@@ -1607,16 +1782,16 @@ class U {
    * @returns 相交的节点数组
    */
   queryCircle(t, e) {
-    const n = new A(t.x - e, t.x + e, t.y - e, t.y + e), i = Math.ceil(n.minX / this.gridSize), o = Math.ceil(n.maxX / this.gridSize), s = Math.ceil(n.minY / this.gridSize), r = Math.ceil(n.maxY / this.gridSize), a = [];
-    for (let c = i; c <= o; c++)
+    const n = new v(t.x - e, t.x + e, t.y - e, t.y + e), i = Math.ceil(n.minX / this.gridSize), o = Math.ceil(n.maxX / this.gridSize), s = Math.ceil(n.minY / this.gridSize), r = Math.ceil(n.maxY / this.gridSize), c = [];
+    for (let a = i; a <= o; a++)
       for (let h = s; h <= r; h++) {
-        const l = `${c}.${h}`;
+        const l = `${a}.${h}`;
         if (!this.map.has(l)) continue;
-        this.map.get(l)?.forEach((x) => {
-          t.distance(x.point) <= e && a.push(x);
+        this.map.get(l)?.forEach((f) => {
+          t.distance(f.point) <= e && c.push(f);
         });
       }
-    return a;
+    return c;
   }
   /**
    * 查询与包围盒相交的点
@@ -1626,10 +1801,10 @@ class U {
   queryBox(t) {
     const e = Math.ceil(t.minX / this.gridSize), n = Math.ceil(t.maxX / this.gridSize), i = Math.ceil(t.minY / this.gridSize), o = Math.ceil(t.maxY / this.gridSize), s = [];
     for (let r = e; r <= n; r++)
-      for (let a = i; a <= o; a++) {
-        const c = `${r}.${a}`;
-        if (!this.map.has(c)) continue;
-        this.map.get(c)?.forEach((l) => {
+      for (let c = i; c <= o; c++) {
+        const a = `${r}.${c}`;
+        if (!this.map.has(a)) continue;
+        this.map.get(a)?.forEach((l) => {
           t.containsPoint(l.point) && s.push(l);
         });
       }
@@ -1646,7 +1821,7 @@ class U {
     }), n;
   }
 }
-class it {
+class rt {
   // 所有可查找的点位
   possibleDoorPoints = [];
   doorPoint = [];
@@ -1680,33 +1855,33 @@ class it {
   search(t, e = [], n = 0.6, i = this.doorSearchDistance, o = this.doorSearchNearAngle) {
     const s = this.dxf, r = this.searchNearby(t, e, i, o);
     r.push(
-      ...t.map((c) => {
-        const h = this.searchAlongDirection(c, i);
+      ...t.map((a) => {
+        const h = this.searchAlongDirection(a, i);
         if (h) return {
-          start: c.point,
+          start: a.point,
           end: h.point
         };
-        const l = this.searchAlongNormalDirection(c, i);
+        const l = this.searchAlongNormalDirection(a, i);
         if (l) return {
-          start: c.point,
+          start: a.point,
           end: l.point
         };
-      }).filter((c) => !!c && c.start.distance(c.end) < i)
+      }).filter((a) => !!a && a.start.distance(a.end) < i)
     );
-    const a = [];
-    return r.forEach((c) => {
-      const h = new b(c?.start, c?.end), l = h.length();
+    const c = [];
+    return r.forEach((a) => {
+      const h = new b(a?.start, a?.end), l = h.length();
       if (l < n) return;
-      const d = h.normal(), x = h.direction(), p = (l - s.width * 2) / 2;
-      for (let w = 0; w < 3; w++) {
-        const u = h.start.clone().add(x.clone().multiplyScalar(s.width + p * w)), m = new b(
+      const d = h.normal(), f = h.direction(), m = (l - s.width * 2) / 2;
+      for (let g = 0; g < 3; g++) {
+        const u = h.start.clone().add(f.clone().multiplyScalar(s.width + m * g)), x = new b(
           u,
           u.clone().add(d.clone().multiplyScalar(1))
         );
-        if (m.directionMove(d, -0.5), this.quadtree.queryLineSegment(m).length) return;
+        if (x.directionMove(d, -0.5), this.quadtree.queryLineSegment(x).length) return;
       }
-      a.push(h);
-    }), a;
+      c.push(h);
+    }), c;
   }
   /** 添加可查找点的过滤规则
    * @param rule 
@@ -1723,7 +1898,7 @@ class it {
     return this.lineSegments.forEach((e) => {
       e.points.forEach((n, i) => {
         for (let s = 0; s < this._pointsExcludeRule.length; s++) if (this._pointsExcludeRule[s](e, n, i)) return;
-        this.pointVirtualGrid.queryPoint(n).filter((s) => s.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: T() });
+        this.pointVirtualGrid.queryPoint(n).filter((s) => s.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: z() });
       });
     }), t;
   }
@@ -1735,21 +1910,21 @@ class it {
     return e.doors.forEach((i) => {
       const o = e.lineSegments[i[4]], s = e.originalData[i[4]];
       if (s.drawDoorData) {
-        const r = f.from(s.drawDoorData.start), a = f.from(s.drawDoorData.n), c = n.queryPoint(r).filter((h) => {
+        const r = p.from(s.drawDoorData.start), c = p.from(s.drawDoorData.n), a = n.queryPoint(r).filter((h) => {
           if (h.userData === o) return !1;
           const l = h.userData, d = l.direction();
           l.start.equal(r) && d.multiplyScalar(-1);
-          const x = a.angleBetween(d, "angle");
-          return x > 80 || x < 10;
+          const f = c.angleBetween(d, "angle");
+          return f > 80 || f < 10;
         });
-        c.length && t.push({
-          line: c[0].userData,
+        a.length && t.push({
+          line: a[0].userData,
           point: r,
-          uuid: T()
+          uuid: z()
         });
       } else if (s.doorDirectConnection) {
         this.continueFind = !1;
-        const r = new b(f.from(s.start), f.from(s.end));
+        const r = new b(p.from(s.start), p.from(s.end));
         r.userData = {
           doorDirectConnection: !0,
           isDoor: !0
@@ -1765,8 +1940,8 @@ class it {
   searchDoubleLinePoint() {
     const t = /* @__PURE__ */ new Map();
     return this.resultList.flatMap((e) => {
-      const n = this.lineSegments[e.sourceIndex], i = this.lineSegments[e.targetIndex], o = i.projectPoint(n.start), s = i.projectPoint(n.end), r = n.projectPoint(i.start), a = n.projectPoint(i.end), c = o && s ? -1 : o ? 0 : s ? 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], o = i.projectPoint(n.start), s = i.projectPoint(n.end), r = n.projectPoint(i.start), c = n.projectPoint(i.end), a = o && s ? -1 : o ? 0 : s ? 1 : -1, h = r && c ? -1 : r ? 0 : c ? 1 : -1;
+      t.has(e.sourceIndex) ? t.get(e.sourceIndex) != a && t.set(e.sourceIndex, -1) : t.set(e.sourceIndex, a), t.has(e.targetIndex) ? t.get(e.targetIndex) != h && t.set(e.targetIndex, -1) : t.set(e.targetIndex, h);
     }), t;
   }
   /** 查找方案一：最近点查找
@@ -1779,94 +1954,94 @@ class it {
    */
   searchNearby(t, e = [], n = this.doorSearchDistance, i = this.doorSearchNearAngle) {
     const o = this.findPointVirtualGrid, s = this.quadtree;
-    function r({ point: u, line: m }, y, S) {
-      const D = m.direction();
-      m.start === u && D.multiplyScalar(-1);
-      const P = o.queryCircle(u, n).filter((L) => L.userData !== m).sort((L, E) => L.point.distance(u) - E.point.distance(u)), v = [];
-      for (let L = 0; L < P.length; L++) {
-        const E = e.findIndex((R) => R.point === P[L].point), Y = t[y].uuid, G = e[E].uuid;
-        if (S.has(`${Y}.${G}`)) continue;
-        S.add(`${Y}.${G}`), S.add(`${G}.${Y}`);
-        const Z = P[L].point, q = new b(u.clone(), Z.clone());
-        if (q.direction().angleBetween(D, "angle") < i) {
-          const R = t[E].line.direction();
-          P[L].userData.start.equal(P[L].point) && R.multiplyScalar(-1), q.direction().multiplyScalar(-1).angleBetween(R, "angle") < i && (s.queryLineSegment(q).length || v.push({
-            findData: P[L],
-            findUuid: G,
-            doorLine: q,
+    function r({ point: u, line: x }, w, S) {
+      const L = x.direction();
+      x.start === u && L.multiplyScalar(-1);
+      const P = o.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), Y = t[w].uuid, B = e[E].uuid;
+        if (S.has(`${Y}.${B}`)) continue;
+        S.add(`${Y}.${B}`), S.add(`${B}.${Y}`);
+        const Q = P[D].point, C = new b(u.clone(), Q.clone());
+        if (C.direction().angleBetween(L, "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 && (s.queryLineSegment(C).length || A.push({
+            findData: P[D],
+            findUuid: B,
+            doorLine: C,
             doorUuid: Y
           }));
         }
       }
-      return v;
+      return A;
     }
-    function a(u, m, y, S, D) {
+    function c(u, x, w, S, L) {
       S.add(u);
       const P = [];
-      D && P.push(D);
-      for (let v = 0; v < y.length; v++) {
-        const L = y[v];
-        if (m.has(L.findUuid)) {
-          const E = m.get(L.findUuid);
-          a(L.findUuid, m, E, S, L) && P.push(L);
-        } else P.push(L);
+      L && P.push(L);
+      for (let A = 0; A < w.length; A++) {
+        const D = w[A];
+        if (x.has(D.findUuid)) {
+          const E = x.get(D.findUuid);
+          c(D.findUuid, x, E, S, D) && P.push(D);
+        } else P.push(D);
       }
-      return P.sort((v, L) => v.doorLine.length() - L.doorLine.length()), D && P[0] === D ? (y.splice(0), !0) : (y.splice(1), !1);
+      return P.sort((A, D) => A.doorLine.length() - D.doorLine.length()), L && P[0] === L ? (w.splice(0), !0) : (w.splice(1), !1);
     }
-    const c = /* @__PURE__ */ new Set(), h = /* @__PURE__ */ new Map();
-    t.map((u, m) => {
-      const y = r(u, m, c);
-      y.length && h.set(u.uuid, y);
-    }), c.clear();
+    const a = /* @__PURE__ */ new Set(), h = /* @__PURE__ */ new Map();
+    t.map((u, x) => {
+      const w = r(u, x, a);
+      w.length && h.set(u.uuid, w);
+    }), a.clear();
     const l = /* @__PURE__ */ new Map();
-    h.forEach((u, m) => {
-      if (!c.has(m) && u.length && a(m, h, u, c), u.length) {
-        const y = u[0];
-        l.has(y.doorUuid) || l.set(y.doorUuid, []), l.get(y.doorUuid)?.push(y), l.has(y.findUuid) || l.set(y.findUuid, []), l.get(y.findUuid)?.push(y);
+    h.forEach((u, x) => {
+      if (!a.has(x) && u.length && c(x, h, u, a), 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 d = /* @__PURE__ */ new Set();
     l.forEach((u) => {
       if (u.length > 1) {
-        u.sort((m, y) => m.doorLine.length() - y.doorLine.length());
-        for (let m = 1; m < u.length; m++) d.add(u[m]);
+        u.sort((x, w) => x.doorLine.length() - w.doorLine.length());
+        for (let x = 1; x < u.length; x++) d.add(u[x]);
       }
     });
-    const x = [], p = [];
+    const f = [], m = [];
     h.forEach((u) => {
       if (u.length) {
-        const m = u[0];
-        d.has(m) || (x.push(m), p.push(m.doorUuid, m.findUuid));
+        const x = u[0];
+        d.has(x) || (f.push(x), m.push(x.doorUuid, x.findUuid));
       }
     });
-    const w = [];
-    return x.forEach((u) => {
-      const m = t.findIndex((E) => E.uuid === u.doorUuid), y = e.findIndex((E) => E.uuid === u.findUuid), S = t[m].point.clone(), D = e[y].point.clone(), P = this.findLongLineSegment(t[m].line), v = this.findLongLineSegment(e[y].line), L = P.projectPoint(D);
-      if (L) {
-        S.copy(L);
-        const E = new b(S, D), Y = v.includedAngle(E);
-        (Y < 10 || Y > 170 || Math.abs(90 - Y) < 10) && w.push({
+    const g = [];
+    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(), L = e[w].point.clone(), P = this.findLongLineSegment(t[x].line), A = this.findLongLineSegment(e[w].line), D = P.projectPoint(L);
+      if (D) {
+        S.copy(D);
+        const E = new b(S, L), Y = A.includedAngle(E);
+        (Y < 10 || Y > 170 || Math.abs(90 - Y) < 10) && g.push({
           start: S,
-          end: D
+          end: L
         });
       } else {
-        const E = v.projectPoint(S);
-        E && D.copy(E);
-        const Y = new b(S, D), G = P.includedAngle(Y);
-        (G < 10 || G > 170 || Math.abs(90 - G) < 10) && w.push({
+        const E = A.projectPoint(S);
+        E && L.copy(E);
+        const Y = new b(S, L), B = P.includedAngle(Y);
+        (B < 10 || B > 170 || Math.abs(90 - B) < 10) && g.push({
           start: S,
-          end: D
+          end: L
         });
       }
     }), e.splice(
       0,
       e.length,
-      ...e.filter((u) => p.indexOf(u.uuid) === -1)
+      ...e.filter((u) => m.indexOf(u.uuid) === -1)
     ), t.splice(
       0,
       t.length,
-      ...t.filter((u) => p.indexOf(u.uuid) === -1)
-    ), w;
+      ...t.filter((u) => m.indexOf(u.uuid) === -1)
+    ), g;
   }
   /** 方案二： 沿方向查找
    * @description 
@@ -1876,14 +2051,14 @@ class it {
   searchAlongDirection({ point: t, line: e }, n = this.doorSearchDistance) {
     const i = this.quadtree, o = e.direction();
     e.start === t && o.multiplyScalar(-1);
-    const s = t.clone().add(o.clone().multiplyScalar(n)), r = new b(t.clone(), s), a = 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];
-      if (Math.abs(90 - c.line.direction().angleBetween(o, "angle")) < 5)
-        return c;
+    const s = t.clone().add(o.clone().multiplyScalar(n)), r = new b(t.clone(), s), c = i.queryLineSegment(r).map((a) => ({
+      point: a.line.getIntersection(r),
+      line: a.line
+    })).filter((a) => a.point).sort((a, h) => t.distance(a.point) - t.distance(h.point));
+    if (c.length) {
+      const a = c[0];
+      if (Math.abs(90 - a.line.direction().angleBetween(o, "angle")) < 5)
+        return a;
     }
   }
   /** 方案三： 沿法线方向查找
@@ -1893,12 +2068,12 @@ class it {
    * @returns 
    */
   searchAlongNormalDirection({ point: t, line: e }, n = this.doorSearchDistance) {
-    const i = this.pointVirtualGrid, o = this.quadtree, s = e.direction(), r = e.start.normal(e.end), a = e.start.clone();
-    e.start === t && s.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 x = c[d], p = x.userData, w = p.direction();
-      if (p.start === x.point && s.multiplyScalar(-1), w.angleBetween(r) / (Math.PI / 180) > 90) {
+    const i = this.pointVirtualGrid, o = this.quadtree, s = e.direction(), r = e.start.normal(e.end), c = e.start.clone();
+    e.start === t && s.multiplyScalar(-1), e.start === t && c.copy(e.end);
+    const a = i.queryPoint(c).filter((d) => d.userData !== e);
+    for (let d = 0; d < a.length; d++) {
+      const f = a[d], m = f.userData, g = m.direction();
+      if (m.start === f.point && s.multiplyScalar(-1), g.angleBetween(r) / (Math.PI / 180) > 90) {
         r.multiplyScalar(-1);
         break;
       }
@@ -1906,7 +2081,7 @@ class it {
     const h = new b(t.clone(), t.clone().add(r.multiplyScalar(n))), l = o.queryLineSegment(h).map((d) => ({
       point: d.line.getIntersection(h),
       line: d.line
-    })).filter((d) => d.point).sort((d, x) => t.distance(d.point) - t.distance(x.point));
+    })).filter((d) => d.point).sort((d, f) => t.distance(d.point) - t.distance(f.point));
     if (l.length) {
       const d = l[0];
       if (Math.abs(90 - d.line.direction().angleBetween(r, "angle")) < 5)
@@ -1937,7 +2112,7 @@ class it {
     return e;
   }
 }
-class st extends X {
+class at extends j {
   static name = "LineAnalysis";
   Dxf = null;
   Variable = null;
@@ -1951,7 +2126,7 @@ class st extends X {
    * @param parent 
    */
   onAddFromParent(t) {
-    this.Dxf = t.findComponentByType(I), this.Variable = this.parent?.findComponentByType(k), this.Dxf.addEventListener("setDta", this.lineAnalysis.bind(this)), this.Dxf.addEventListener("createGroup", this.doorsAnalysis.bind(this));
+    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));
   }
   /**
    * 
@@ -1961,15 +2136,15 @@ class st extends X {
    * @returns 
    */
   expandLineSegment(t, e, n = 0.1) {
-    const i = e.normal(t), o = e.direction(t).mutiplyScalar(n * 0.5), s = t.direction(e).mutiplyScalar(n * 0.5), r = i.x * n * 0.5, a = i.y * n * 0.5;
+    const i = e.normal(t), o = e.direction(t).mutiplyScalar(n * 0.5), s = t.direction(e).mutiplyScalar(n * 0.5), r = i.x * n * 0.5, c = i.y * n * 0.5;
     return {
       points: [
         // 第一条线
-        new f(t.x + r, t.y + a).add(s),
-        new f(e.x + r, e.y + a).add(o),
+        new p(t.x + r, t.y + c).add(s),
+        new p(e.x + r, e.y + c).add(o),
         // 第二条线
-        new f(t.x - r, t.y - a).add(s),
-        new f(e.x - r, e.y - a).add(o)
+        new p(t.x - r, t.y - c).add(s),
+        new p(e.x - r, e.y - c).add(o)
       ],
       indices: [0, 1, 1, 3, 3, 2, 2, 0],
       rectIndices: [0, 1, 3, 2, 0]
@@ -1991,14 +2166,14 @@ class st extends X {
   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 o = n.points[0].distance(i.points[0]), s = n.points[1].distance(i.points[1]), r = Math.ceil(Math.max(o, s) / e.width), a = o / r, c = s / r, h = i.points[0].direction(n.points[0]), l = i.points[1].direction(n.points[1]), d = n.points[0].clone(), x = n.points[1].clone(), p = x.direction(d);
-    p.multiplyScalar(e.width * 0.5);
-    const w = d.clone().add(p), u = x.clone().add(p.multiplyScalar(-1)), m = d.direction(x), y = w.direction(u);
-    if (!(m.x > 0 && y.x < 0 || m.x < 0 && y.x > 0 || m.y > 0 && y.y < 0 || m.y < 0 && y.y > 0)) {
-      d.set(w.x, w.y), x.set(u.x, u.y);
+    const o = n.points[0].distance(i.points[0]), s = n.points[1].distance(i.points[1]), r = Math.ceil(Math.max(o, s) / e.width), c = o / r, a = s / 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 g = d.clone().add(m), u = f.clone().add(m.multiplyScalar(-1)), x = d.direction(f), w = g.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(g.x, g.y), f.set(u.x, u.y);
       for (let S = 1; S < r; S++) {
-        const D = h.clone().multiplyScalar(a * S), P = l.clone().multiplyScalar(c * S), v = d.clone().add(D), L = x.clone().add(P);
-        this.addData(v, L);
+        const L = h.clone().multiplyScalar(c * S), P = l.clone().multiplyScalar(a * S), A = d.clone().add(L), D = f.clone().add(P);
+        this.addData(A, D);
       }
     }
   }
@@ -2008,7 +2183,7 @@ class st extends X {
    */
   buildQuadtree() {
     const t = this.Dxf, e = [];
-    this.quadtree = new B(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
@@ -2025,8 +2200,8 @@ class st extends X {
     this.buildQuadtree();
     const t = this.quadtree, e = this.lineSegmentList, n = /* @__PURE__ */ new Set(), i = [];
     e.forEach((o, s) => {
-      const r = e[s], a = C.fromByLineSegment(r, this.width * 2, !1, -0.01);
-      t.queryRect(a).map((h) => h.userData).filter((h) => h !== s).forEach((h) => {
+      const r = e[s], c = N.fromByLineSegment(r, this.width * 2, !1, -0.01);
+      t.queryRect(c).map((h) => h.userData).filter((h) => h !== s).forEach((h) => {
         try {
           if (n.has(`${s}-${h}`) || n.has(`${h}-${s}`)) return;
           const l = this.projectionAnalysis(h, s, r, e);
@@ -2043,36 +2218,39 @@ class st extends X {
    * @returns 
    */
   projectionAnalysis(t, e, n, i) {
-    const o = i[t], s = n.direction(), r = o.direction(), a = s.angleBetween(r) / (Math.PI / 180);
-    if (a < this.errorAngle || a > 180 - this.errorAngle) {
-      let c;
+    const o = i[t], s = n.direction(), r = o.direction(), c = s.angleBetween(r) / (Math.PI / 180);
+    if (c < this.errorAngle || c > 180 - this.errorAngle) {
+      let a;
       const h = o.projectLineSegment(n), l = n.projectLineSegment(o);
-      return h.getLength() > l.getLength() ? c = {
+      return h.getLength() > l.getLength() ? a = {
         target: o,
         targetIndex: t,
         source: n,
         sourceIndex: e,
         project: h,
         project2: l
-      } : c = {
+      } : a = {
         target: n,
         targetIndex: e,
         source: o,
         sourceIndex: t,
         project: l,
         project2: h
-      }, !c || c.project.getLength() < 0.2 || c.project2.getLength() < 0.2 ? void 0 : c;
+      }, !a || a.project.getLength() < 0.2 || a.project2.getLength() < 0.2 ? void 0 : a;
     }
   }
   doorSearchNearAngle = 110;
   doorSearchDistance = 2;
   doors = [];
   doorsAnalysis() {
-    new it(this);
+    new rt(this), this.dispatchEvent({
+      type: "analysisCompleted"
+    });
   }
 }
-class ot extends et {
+class ct extends it {
   Dxf;
+  AngleCorrectionDxf;
   Variable;
   wallWidth;
   environment;
@@ -2081,7 +2259,7 @@ class ot extends et {
    * @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 I(this.wallWidth, e), this.Variable = new k(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(new st());
+    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);
   }
   usePlugin(t) {
     return typeof t == "function" && t.call(this, this), this;
@@ -2094,23 +2272,23 @@ class ot extends et {
     });
   }
 }
-const rt = new Q(), at = new tt();
-function ct(g, t, e = 0.1) {
-  const n = t.normal(g), i = t.direction(g).mutiplyScalar(e * 0.5), o = g.direction(t).mutiplyScalar(e * 0.5), s = n.x * e * 0.5, r = n.y * e * 0.5;
+const ht = new et(), lt = new nt();
+function dt(y, t, e = 0.1) {
+  const n = t.normal(y), i = t.direction(y).mutiplyScalar(e * 0.5), o = y.direction(t).mutiplyScalar(e * 0.5), s = n.x * e * 0.5, r = n.y * e * 0.5;
   return {
     points: [
       // 第一条线
-      new f(g.x + s, g.y + r).add(o),
-      new f(t.x + s, t.y + r).add(i),
+      new p(y.x + s, y.y + r).add(o),
+      new p(t.x + s, t.y + r).add(i),
       // 第二条线
-      new f(g.x - s, g.y - r).add(o),
-      new f(t.x - s, t.y - r).add(i)
+      new p(y.x - s, y.y - r).add(o),
+      new p(t.x - s, t.y - r).add(i)
     ],
     indices: [0, 1, 1, 3, 3, 2, 2, 0],
     rectIndices: [0, 1, 3, 2, 0]
   };
 }
-class J extends X {
+class H extends j {
   static name = "WhiteModel";
   Dxf = null;
   Variable = null;
@@ -2131,7 +2309,7 @@ class J extends X {
     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));
+      n.forEach((r, c) => c === 0 ? i.moveTo(r.x / t.scale, r.y / t.scale) : i.lineTo(r.x / t.scale, r.y / t.scale));
       const o = new M.ExtrudeGeometry(i, {
         depth: 2.8,
         bevelSize: 0
@@ -2140,18 +2318,18 @@ class J extends X {
         new M.LineSegments(new M.EdgesGeometry(o), new M.LineBasicMaterial({ color: 0 }))
       );
     }), t.originalData.map(({ start: n, end: i, insetionArr: o }) => {
-      const s = new f(n.x, n.y).mutiplyScalar(t.scale), r = new f(i.x, i.y).mutiplyScalar(t.scale), { points: a, indices: c, rectIndices: h } = ct(s, r, t.width);
+      const s = new p(n.x, n.y).mutiplyScalar(t.scale), r = new p(i.x, i.y).mutiplyScalar(t.scale), { points: c, indices: a, rectIndices: h } = dt(s, r, t.width);
       return {
-        points: a,
-        indices: c,
+        points: c,
+        indices: a,
         rectIndices: h,
         insetions: (o ?? []).map((l) => l.index)
       };
     }).forEach((n) => {
       const i = new M.Shape();
-      n.rectIndices.forEach((r, a) => {
-        const c = n.points[r];
-        a === 0 ? i.moveTo(c.x, c.y) : i.lineTo(c.x, c.y);
+      n.rectIndices.forEach((r, c) => {
+        const a = n.points[r];
+        c === 0 ? i.moveTo(a.x, a.y) : i.lineTo(a.x, a.y);
       });
       const o = new M.ExtrudeGeometry(i, {
         depth: 2.8,
@@ -2173,7 +2351,7 @@ class J extends X {
   toOBJ() {
     return new Promise((t) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(() => {
-        t(rt.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
+        t(ht.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
       }, 20);
     });
   }
@@ -2186,7 +2364,7 @@ class J extends X {
     return new Promise((e) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(async () => {
         if (typeof window == "object")
-          at.parse(this.whiteModelGroup.children, (n) => {
+          lt.parse(this.whiteModelGroup.children, (n) => {
             e(n), this.material.opacity = 0.8, this.material.transparent = !0;
           }, () => {
             e(void 0);
@@ -2195,7 +2373,7 @@ class J extends X {
           });
         else if (typeof global != "function")
           try {
-            const n = await j("obj2gltf", !0), i = await j("fs", !1), o = await this.toOBJ();
+            const n = await G("obj2gltf", !0), i = await G("fs", !1), o = await this.toOBJ();
             i.writeFileSync(this.uuid, o);
             const s = await n(this.uuid, {
               binary: t
@@ -2238,7 +2416,7 @@ class J extends X {
       n.href = URL.createObjectURL(e), n.download = t, n.click();
     } else if (typeof global < "u") {
       const e = await this.toOBJ();
-      e && (await j("fs", !1)).writeFileSync(t, e);
+      e && (await G("fs", !1)).writeFileSync(t, e);
     }
   }
   /**
@@ -2254,11 +2432,11 @@ class J extends X {
       i.href = URL.createObjectURL(n), i.download = t, i.click();
     } else if (typeof global < "u") {
       const n = await this.toGltf(e);
-      n && (await j("fs", !1)).writeFileSync(t, e ? n : Buffer.from(n));
+      n && (await G("fs", !1)).writeFileSync(t, e ? n : Buffer.from(n));
     }
   }
 }
-class _ extends X {
+class Z extends j {
   static name = "DetailsPoint";
   Dxf = null;
   WhiteModel = null;
@@ -2321,11 +2499,11 @@ class _ extends X {
         this.racasterHelper(n, i, o), i.z = 0;
         const r = new M.Raycaster(n, i, 0, o).intersectObject(t.originalWhiteMode);
         if (r.length) {
-          const { point: a } = r[0];
+          const { point: c } = r[0];
           this.desPoints.push({
             message: e.desc,
             position: n,
-            intersection: a
+            intersection: c
           });
         }
       }), this.dispatchEvent({
@@ -2335,7 +2513,7 @@ class _ extends X {
     }, 50);
   }
 }
-class H extends X {
+class K extends j {
   static name = "DxfLineModel";
   dxfLineModel = new M.LineSegments();
   dxfDoorsLineModel = new M.LineSegments();
@@ -2358,38 +2536,38 @@ class H extends X {
     });
   }
 }
-const ht = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const ut = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  DetailsPoint: _,
-  DxfLineModel: H,
-  WhiteModel: J
+  DetailsPoint: Z,
+  DxfLineModel: K,
+  WhiteModel: H
 }, Symbol.toStringTag, { value: "Module" }));
-function W(g, t = {}) {
+function W(y, t = {}) {
   const {
     detailsPoint: e = !0,
     whiteModel: n = !0,
     dxfLineModel: i = !0
   } = t;
-  i && g.addComponent(new H()), n && g.addComponent(new J()), e && g.addComponent(new _());
+  i && y.addComponent(new K()), n && y.addComponent(new H()), e && y.addComponent(new Z());
 }
-const lt = Object.assign(W, {
-  create(g = {}) {
-    return (t) => W(t, g);
+const ft = Object.assign(W, {
+  create(y = {}) {
+    return (t) => W(t, y);
   }
-}), dt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}), pt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  ModelDataPlugin: lt,
-  components: ht
+  ModelDataPlugin: ft,
+  components: ut
 }, Symbol.toStringTag, { value: "Module" }));
-function ut() {
+function mt() {
   return import("./index2.js");
 }
-function ft() {
+function xt() {
   return import("./index3.js");
 }
-let O = null;
-async function Dt(g, t, e = !1, n) {
-  const i = await Promise.resolve().then(() => dt), o = await ut(), s = await ft(), r = new ot().usePlugin(i.ModelDataPlugin.create({
+let V = null;
+async function Et(y, t, e = !1, n) {
+  const i = await Promise.resolve().then(() => pt), o = await mt(), s = await xt(), r = new ct().usePlugin(i.ModelDataPlugin.create({
     detailsPoint: !1,
     whiteModel: !0
   })).usePlugin(o.RenderPlugin.create({
@@ -2398,14 +2576,14 @@ async function Dt(g, t, e = !1, n) {
     detailsPoint: !1,
     orbitControls: e,
     camera: t
-  })).usePlugin(s.Editor.create({ viewPermission: n })), a = r.findComponentByType(o.components.DomContainer);
-  return a && g.appendChild(a.domElement), O = r, {
+  })).usePlugin(s.Editor.create({ viewPermission: n })), c = r.findComponentByType(o.components.DomContainer);
+  return c && y.appendChild(c.domElement), V = r, {
     dxfSystem: r,
-    getFileAll: () => pt(r)
+    getFileAll: () => yt(r)
   };
 }
-async function pt(g = O) {
-  const t = g.findComponentByName("WhiteModel"), e = new File([g.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), n = new File([await t.toOBJBlob()], "model.obj", { type: "application/octet-stream" }), i = new File([await t.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), o = new File([await t.toGltfBlob(!1)], "model.gltf", { type: "application/json" }), s = new File([JSON.stringify(g.Dxf.originalData)], "json.json", { type: "application/json" });
+async function yt(y = V) {
+  const t = y.findComponentByName("WhiteModel"), e = new File([y.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), n = new File([await t.toOBJBlob()], "model.obj", { type: "application/octet-stream" }), i = new File([await t.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), o = new File([await t.toGltfBlob(!1)], "model.gltf", { type: "application/json" }), s = new File([JSON.stringify(y.Dxf.originalData)], "json.json", { type: "application/json" });
   return {
     dxf: e,
     obj: n,
@@ -2414,24 +2592,24 @@ async function pt(g = O) {
     json: s
   };
 }
-function bt() {
-  return O;
+function At() {
+  return V;
 }
 export {
-  A as B,
-  X as C,
-  ot as D,
+  v as B,
+  j as C,
+  ct as D,
   $ as E,
   b as L,
-  lt as M,
-  f as P,
-  B as Q,
-  k as V,
-  J as W,
-  _ as a,
+  ft as M,
+  p as P,
+  q as Q,
+  _ as V,
+  H as W,
+  Z as a,
   U as b,
-  Dt as c,
-  bt as d,
-  pt as g,
-  ht as i
+  Et as c,
+  At as d,
+  yt as g,
+  ut as i
 };