build-dxf 0.0.38 → 0.0.39

package/README.md

@@ -22,6 +22,8 @@ const whiteModel = dxfSystem.findComponentByType(components.WhiteModel)
 // 获取详情点数据生成组件
 const detailsPoint = dxfSystem.findComponentByType(components.DetailsPoint)
 
+const threeVJia = dxfSystem.findComponentByName("ThreeVJia")
+
 // trajectory222为轨迹文件数据
 dxfSystem.Dxf.addEventListener("preprocessing", ({ setData, data }) => {
     setData( utils.BoundExt.boundExtbyTraj.call(dxfSystem.Dxf, data, trajectory222 ) )
@@ -36,6 +38,9 @@ detailsPoint.addEventListener("handleSuccess", () => {
     // 下载白模，gltf或glb格式, 第二个参数为true时是glb，默认为true
     whiteModel.downloadGltf("001.glb", true)
 
+    // 下载三维家 json 
+    threeVJia.download("json.json")
+
     // 下载为图片
     dxfSystem.AngleCorrectionDxf.downloadImage("001.jpg")
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "build-dxf",
-  "version": "0.0.38",
+  "version": "0.0.39",
   "description": "线段构建双线墙壁的dxf版本",
   "main": "./src/index.js",
   "types": "./src/index.d.ts",

package/src/build.js

@@ -1,5 +1,5 @@
 import * as I from "three";
-import { EventDispatcher as Bt, Color as Ot, Matrix4 as Dt, Vector3 as J, Quaternion as Ft, BufferAttribute as _, REVISION as Ut, CompressedTexture as tt, Source as Gt, NoColorSpace as zt, MathUtils as it, RGBAFormat as jt, ImageUtils as _t, DoubleSide as qt, PropertyBinding as $, InterpolateDiscrete as Yt, Scene as ut, SRGBColorSpace as kt, NearestFilter as Xt, NearestMipmapNearestFilter as Vt, NearestMipmapLinearFilter as Wt, LinearFilter as Ht, LinearMipmapNearestFilter as Jt, LinearMipmapLinearFilter as $t, ClampToEdgeWrapping as Kt, RepeatWrapping as Zt, MirroredRepeatWrapping as Qt, InterpolateLinear as te } from "three";
+import { EventDispatcher as Bt, Color as Ot, Matrix4 as Lt, Vector3 as J, Quaternion as Ft, BufferAttribute as _, REVISION as Ut, CompressedTexture as tt, Source as Gt, NoColorSpace as jt, MathUtils as it, RGBAFormat as zt, ImageUtils as _t, DoubleSide as qt, PropertyBinding as $, InterpolateDiscrete as Yt, Scene as ut, SRGBColorSpace as kt, NearestFilter as Xt, NearestMipmapNearestFilter as Vt, NearestMipmapLinearFilter as Wt, LinearFilter as Ht, LinearMipmapNearestFilter as Jt, LinearMipmapLinearFilter as $t, ClampToEdgeWrapping as Kt, RepeatWrapping as Zt, MirroredRepeatWrapping as Qt, InterpolateLinear as te } from "three";
 import dt from "clipper-lib";
 import H from "dxf-writer";
 import { OBJExporter as ee } from "three/examples/jsm/exporters/OBJExporter.js";
@@ -336,7 +336,7 @@ class R {
     );
   }
 }
-class W {
+class X {
   map = /* @__PURE__ */ new Map();
   targetMap = /* @__PURE__ */ new Map();
   gridSize;
@@ -624,7 +624,7 @@ class Q {
     ]);
   }
 }
-class L {
+class D {
   points = [new M(), new M()];
   userData = {};
   // line: any
@@ -788,7 +788,7 @@ class L {
       const y = Math.max(0, Math.min(1, p)), x = s.x + y * r.x, g = s.y + y * r.y;
       return new M(x, g);
     };
-    return (h < 0 || h > 1) && (a = f(h)), (u < 0 || u > 1) && (c = f(u)), a.x === c.x && a.y === c.y ? new L(a, a) : new L(a, c);
+    return (h < 0 || h > 1) && (a = f(h)), (u < 0 || u > 1) && (c = f(u)), a.x === c.x && a.y === c.y ? new D(a, a) : new D(a, c);
   }
   /**
    * 计算一条线段在另一条直线上的投影
@@ -869,7 +869,7 @@ class L {
    * @param line 
    */
   parallel(t, e = 1) {
-    return t instanceof L ? this.parallel(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), t < e || t > 180 - e);
+    return t instanceof D ? this.parallel(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), t < e || t > 180 - e);
   }
   /** 两条线段或角度是否 垂直
    * @param line 
@@ -877,7 +877,7 @@ class L {
    * @returns 
    */
   vertical(t, e = 0.1) {
-    return t instanceof L ? this.vertical(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), Math.abs(t - 90) < e);
+    return t instanceof D ? this.vertical(this.includedAngle(t), e) : (typeof t != "number" && (t = Number(t)), Math.abs(t - 90) < e);
   }
   /**
    * 两条线段方向相反否一致
@@ -952,7 +952,7 @@ class L {
    * @returns 
    */
   clone() {
-    const t = new L(
+    const t = new D(
       this.points[0].clone(),
       this.points[1].clone()
     );
@@ -975,7 +975,7 @@ class L {
    * @param selectLines 
    */
   static groupBySamePointAndParallel(t) {
-    const e = new W();
+    const e = new X();
     t.forEach((r) => r.points.forEach((o) => e.insert(o, r)));
     const n = /* @__PURE__ */ new Set();
     function s(r, o, a) {
@@ -1007,7 +1007,7 @@ class L {
         const f = o(u);
         f < a && (a = f, i = n.projectPoint(u, !1)), f > c && (c = f, r = n.projectPoint(u, !1));
       }
-    const l = new L(i, r);
+    const l = new D(i, r);
     return t.forEach((h) => h.userData.fittedLine = l), l;
   }
   /** 合并平行线段
@@ -1026,7 +1026,7 @@ class L {
       const y = p.x * s.x + p.y * s.y;
       i = Math.min(i, y), r = Math.max(r, y), o += p.x, a += p.y;
     });
-    const c = new M(o / n.length, a / n.length), l = c.x * s.x + c.y * s.y, h = new M(c.x + (i - l) * s.x, c.y + (i - l) * s.y), u = new M(c.x + (r - l) * s.x, c.y + (r - l) * s.y), f = new L(h, u);
+    const c = new M(o / n.length, a / n.length), l = c.x * s.x + c.y * s.y, h = new M(c.x + (i - l) * s.x, c.y + (i - l) * s.y), u = new M(c.x + (r - l) * s.x, c.y + (r - l) * s.y), f = new D(h, u);
     return t.forEach((p) => p.userData.fittedLine = f), f;
   }
   /** 合并满足平行的线段
@@ -1191,7 +1191,7 @@ class M {
    * @param length 
    */
   expandAsLine(t, e, n) {
-    const s = new L(
+    const s = new D(
       this.clone(),
       this.clone().add(t.clone().multiplyScalar(e))
     );
@@ -1313,7 +1313,7 @@ class F {
    * @param node 线段节点
    */
   insert(t) {
-    if (t instanceof L) {
+    if (t instanceof D) {
       this.insert({ line: t, userData: {} });
       return;
     }
@@ -1338,7 +1338,7 @@ class F {
    * @param node 
    */
   remove(t) {
-    if (t instanceof L) {
+    if (t instanceof D) {
       t = this.targetMap.get(t), t && this.remove(t);
       return;
     }
@@ -1542,7 +1542,7 @@ function at(d, t = 0.03) {
   }).filter((n) => n.length() >= t);
 }
 function se(d, t) {
-  t || (t = new W(), d.forEach((n) => {
+  t || (t = new X(), d.forEach((n) => {
     n.userData.isDoor || n.points.forEach((s) => t?.insert(s, n));
   }));
   const e = [];
@@ -1554,7 +1554,7 @@ function se(d, t) {
         const l = c.userData;
         if (l === s || !s.parallel(l, 25)) return !1;
         if (t.queryPoint(c.point).length > 1) return;
-        const h = new L(r, c.point), u = new L(s.start === r ? s.end : s.start, l.start === c.point ? l.end : l.start);
+        const h = new D(r, c.point), u = new D(s.start === r ? s.end : s.start, l.start === c.point ? l.end : l.start);
         if (!h.intersectLineSegment(u)) return !1;
         const f = r.distance(c.point);
         return f < 1e-3 ? !1 : (i.set(c.point, f), !0);
@@ -1564,13 +1564,13 @@ function se(d, t) {
       });
       if (o.length === 0) return;
       const a = o[0].userData;
-      e.push(new L(s.projectLineSegment(a).center, a.projectLineSegment(s).center));
+      e.push(new D(s.projectLineSegment(a).center, a.projectLineSegment(s).center));
     });
   }
   return [...d, ...e];
 }
 function ie(d) {
-  const t = new W(), e = new F(R.fromByLineSegment(...d)), n = [];
+  const t = new X(), e = new F(R.fromByLineSegment(...d)), n = [];
   return d.forEach((s) => {
     s.userData.isDoor ? n.push(s) : (s.points.forEach((i) => t.insert(i, s)), e.insert({ line: s, userData: void 0 }));
   }), n.forEach((s) => {
@@ -1691,7 +1691,7 @@ function pt(d, t, e, n) {
     });
   }), o.sort((u, f) => f.distance(e.start) - u.distance(e.start));
   const a = o.map((u) => {
-    const f = u.userData, p = i.get(f), y = r.get(f), x = new L(p, y), g = [];
+    const f = u.userData, p = i.get(f), y = r.get(f), x = new D(p, y), g = [];
     for (let w = 0; w < o.length; w++) {
       const E = o[w];
       if (u !== E && u.distance(E) < n) {
@@ -1722,14 +1722,14 @@ function pt(d, t, e, n) {
       y.sort((E, m) => m.distance(e.start) - E.distance(e.start));
       const x = y[0], g = y[y.length - 1];
       if (x.distance(g) > n) {
-        const E = [...p].sort((C, G) => G.length() - C.length()), m = E[0], S = E[1], T = s.get(m), D = s.get(S), A = m.length(), P = S.length(), N = m.projectLineSegment(S), O = N.length();
-        if (T.distance(D) || P / A > 0.5 && O / P < 0.5) {
+        const E = [...p].sort((C, G) => G.length() - C.length()), m = E[0], S = E[1], T = s.get(m), L = s.get(S), A = m.length(), P = S.length(), N = m.projectLineSegment(S), O = N.length();
+        if (T.distance(L) || P / A > 0.5 && O / P < 0.5) {
           const C = [m], G = [S];
           for (let B = 0; B < y.length; B++) {
-            const v = y[B], X = v.userData;
-            if (v === T || v === D) continue;
-            const z = S.projectLineSegment(X), Ct = z.length();
-            D.distance(v) <= n && Ct / P > 0 ? G.push(X) : C.push(X);
+            const v = y[B], V = v.userData;
+            if (v === T || v === L) continue;
+            const j = S.projectLineSegment(V), Ct = j.length();
+            L.distance(v) <= n && Ct / P > 0 ? G.push(V) : C.push(V);
           }
           h.push(C, G);
         } else {
@@ -1803,7 +1803,7 @@ function le(d, t = 0.1, e) {
     if (s.length === 1) return s[0];
     const i = [];
     s.forEach((h) => i.push(h.start.clone(), h.end.clone()));
-    const r = n === "average" ? L.mergeLines(...s) : L.mergeLinesByMaxlength(...s);
+    const r = n === "average" ? D.mergeLines(...s) : D.mergeLinesByMaxlength(...s);
     r.userData.rooftopPz = Math.min(
       ...s.map((h) => {
         const { drawDoorData: u, drawWindow: f, rooftopPz: p, ...y } = h.userData;
@@ -1823,7 +1823,7 @@ function le(d, t = 0.1, e) {
 function he(d, t = 0.4) {
   const e = new F(R.fromByLineSegment(...d));
   d.forEach((s) => e.insert(s));
-  const n = new L();
+  const n = new D();
   for (let s = 0; s < d.length; s++) {
     const i = d[s];
     if (i.userData.isAdsorbed) continue;
@@ -1851,10 +1851,35 @@ function he(d, t = 0.4) {
   return d.filter((s) => s.length() > 1e-3);
 }
 function ue(d, t) {
+  const e = new X();
+  d.forEach((i) => i.points.forEach((r) => e.insert(r, i)));
+  const n = /* @__PURE__ */ new Map();
+  function s(i, r) {
+    n.has(i) || n.set(i, []), n.get(i)?.push(r);
+  }
+  for (let i = 0; i < d.length; i++) {
+    const r = d[i];
+    r.points.forEach((o) => {
+      if (e.queryPoint(o).filter((h) => h.userData !== r).length !== 0) return;
+      const a = e.queryCircle(o, t).filter((h) => h.userData !== r && h.userData?.vertical(r));
+      if (!a.length) return;
+      const c = a.sort((h, u) => h.userData.length() - u.userData.length())[0], l = c.userData?.projectPoint(o, !1);
+      if (l) {
+        const h = c.userData;
+        s(r, new D(o.clone(), l.clone())), s(h, new D(c.point.clone(), l.clone()));
+      }
+    });
+  }
+  return n.forEach((i, r) => {
+    const o = D.mergeLines(r, ...i);
+    r.set(o.start, o.end);
+  }), d;
+}
+function de(d, t) {
   const { snapThreshold: e = 0.2 } = t ?? {};
-  return d = he(d, e), d;
+  return d = he(d, e), d = ue(d, e), d;
 }
-function de(d) {
+function fe(d) {
   for (let t = 0; t < d.length; t++) {
     const e = d[t], n = e.userData.fittedLine;
     if (n) {
@@ -1864,7 +1889,7 @@ function de(d) {
           r.clone().add(s.clone().multiplyScalar(i.width * 0.5))
         ), a = n.projectPoint(
           r.clone().add(s.clone().multiplyScalar(i.width * -0.5))
-        ), c = new L(o, a), l = c.center;
+        ), c = new D(o, a), l = c.center;
         n.userData.drawWindow?.push({
           p: new I.Vector3(l?.x ?? 0, l?.y ?? 0, i.p.z),
           width: c.length(),
@@ -1874,7 +1899,7 @@ function de(d) {
     }
   }
 }
-function fe(d) {
+function pe(d) {
   for (let t = 0; t < d.length; t++) {
     const e = d[t];
     let { endIntersection: n, startIntersection: s } = e.userData;
@@ -1895,6 +1920,16 @@ function fe(d) {
   }
   return d;
 }
+function ye(d, t = 0.01) {
+  const e = new X();
+  return d.forEach((n) => n.points.forEach((s) => e.insert(s, n))), d.filter((n) => {
+    if (n.length() <= t) {
+      const s = e.queryPoint(n.start).filter((r) => r.userData !== n).length === 0, i = e.queryPoint(n.end).filter((r) => r.userData !== n).length === 0;
+      if (s || i) return !1;
+    }
+    return !0;
+  });
+}
 class Tt {
   /**
    * 轴对齐垂直修正
@@ -1904,33 +1939,33 @@ class Tt {
    */
   static correction(t, e, n) {
     t = ie(t.map((x) => x.clone()));
-    const s = re(t), { parallelLines: i, verticalLines: r, doorLines: o, windowLines: a } = oe(e, t, s, 25), c = e.normal(), l = e.center, h = e.direction(), u = new L(
+    const s = re(t), { parallelLines: i, verticalLines: r, doorLines: o, windowLines: a } = oe(e, t, s, 25), c = e.normal(), l = e.center, h = e.direction(), u = new D(
       l.clone().add(c.clone().multiplyScalar(-1e3)),
       l.clone().add(c.clone().multiplyScalar(1e3))
-    ), f = new L(
+    ), f = new D(
       l.clone().add(h.clone().multiplyScalar(-1e3)),
       l.clone().add(h.clone().multiplyScalar(1e3))
     );
     let p = ae(i, r, u, f, s, n);
     p = ce(p, s);
     let y = le(p, 0.1, n);
-    return y = ue(y, n), de(a), fe(o), y = at(y, 0.04), y.push(...o), y;
+    return y = de(y, n), fe(a), pe(o), y = at(y, 1e-9), y.push(...o), y = ye(y, 0.08), y;
   }
 }
-const pe = new L(
+const xe = new D(
   new M(0, 0),
   new M(0, 1)
 );
-function ye(d) {
+function ge(d) {
   const t = [...d].sort((i, r) => r.length() - i.length()).slice(0, 20), e = t.map((i) => {
-    let r = parseInt(pe.includedAngle(i) + "");
+    let r = parseInt(xe.includedAngle(i) + "");
     return r > 90 && (r = 180 - r), r;
   }), n = /* @__PURE__ */ new Map();
   return e.forEach((i, r) => {
     n.has(i) || n.set(i, []), n.get(i)?.push(t[r]);
   }), [...n.values()].sort((i, r) => r.length - i.length)[0].sort((i, r) => r.length() - i.length())[0];
 }
-const xe = {
+const me = {
   Unitless: 1,
   // 无单位，1米 = 1（无单位）
   Inches: 39.37007874015748,
@@ -1977,7 +2012,7 @@ const xe = {
 function xt(d) {
   const t = [];
   for (let e = 0; e < d.length; e++)
-    t.push(new L(
+    t.push(new D(
       d[e].clone(),
       d[(e + 1) % d.length].clone()
     ));
@@ -2034,13 +2069,13 @@ class k extends q {
     const r = [];
     if (t.forEach(({ start: a, end: c, ...l }, h) => {
       r.push(a.z ?? 0, c.z ?? 0);
-      const u = new L(
+      const u = new D(
         M.from(a),
         M.from(c)
       );
       u.userData = l, s.push(u), l.isVerticalReferenceLine && (i = h);
     }), this.originalZAverage = r.reduce((a, c) => a + c, 0) / r.length, i === -1) {
-      const a = ye(s);
+      const a = ge(s);
       i = s.indexOf(a);
     }
     const o = s[i];
@@ -2049,7 +2084,7 @@ class k extends q {
       data: t,
       setData(a) {
         s = a.map(({ start: c, end: l, ...h }) => {
-          const u = new L(M.from(c), M.from(l));
+          const u = new D(M.from(c), M.from(l));
           return u.userData = h, u;
         }), t = a;
       }
@@ -2307,7 +2342,7 @@ class k extends q {
    * 转为绘制数据
    */
   toDrawDataJson(t = "Millimeters") {
-    const e = xe[t], n = {
+    const e = me[t], n = {
       unit: t,
       line: [],
       arc: [],
@@ -2351,14 +2386,14 @@ class k extends q {
       if (s = "cyan", l.length() < 1.2) {
         l.expansion(-o * 0.5);
         const h = c.normal();
-        let u = new L(
+        let u = new D(
           l.start.clone(),
           l.start.clone().add(h.clone().multiplyScalar(l.length()))
         );
         const f = u.clone().directionMove(u.normal(), l.length() * -0.5).expandToRectangle(l.length(), "bothSides");
         for (let m = 0; m < a.length; m++)
           if (a[m].intersectRectangle(f)) {
-            u = new L(
+            u = new D(
               l.start.clone(),
               l.start.clone().add(h.clone().multiplyScalar(-l.length()))
             );
@@ -2372,7 +2407,7 @@ class k extends q {
     }), s = "yellow", this.lineSegments.forEach((c) => {
       if (!c.userData.isWindow) return !1;
       Array.isArray(c.userData.drawWindow) && c.userData.drawWindow.forEach((l) => {
-        const { p: h, width: u } = l, f = M.from(h), p = f.clone().add(c.direction().multiplyScalar(u * 0.5)), y = f.clone().add(c.direction().multiplyScalar(-u * 0.5)), x = new L(p, y);
+        const { p: h, width: u } = l, f = M.from(h), p = f.clone().add(c.direction().multiplyScalar(u * 0.5)), y = f.clone().add(c.direction().multiplyScalar(-u * 0.5)), x = new D(p, y);
         i(x.start, x.end), x.expandToRectangle(this.width, "bothSides").path2D((g, w) => i(g, w));
       });
     }), n;
@@ -2510,8 +2545,8 @@ function ot(d) {
     Object.prototype.hasOwnProperty.call(d, e) && (t[e] = ot(d[e]));
   return t;
 }
-const j = new L();
-class ge extends k {
+const z = new D();
+class we extends k {
   static name = "AngleCorrectionDxf";
   angle = 0;
   onAddFromParent(t) {
@@ -2522,17 +2557,17 @@ class ge extends k {
     let s = 0, i = null;
     for (let c = 0; c < e.originalData.length; c++) {
       const l = e.originalData[c];
-      if (j.start.copy(l.start), j.end.copy(l.end), l.isVerticalReferenceLine) {
-        const [h, u] = l.start.y < l.end.y ? [j.start, j.end] : [j.end, j.start];
-        s = -new L(h, u).direction().angleBetween(new M(0, 1), "angle", "360"), i = null;
+      if (z.start.copy(l.start), z.end.copy(l.end), l.isVerticalReferenceLine) {
+        const [h, u] = l.start.y < l.end.y ? [z.start, z.end] : [z.end, z.start];
+        s = -new D(h, u).direction().angleBetween(new M(0, 1), "angle", "360"), i = null;
         break;
       }
-      (!i || j.length() > i.length()) && (i = j.clone(), i.userData.index = c);
+      (!i || z.length() > i.length()) && (i = z.clone(), i.userData.index = c);
     }
     if (i) {
       e.originalData[i.userData.index].isVerticalReferenceLine = !0;
       const [c, l] = i.start.y < i.end.y ? [i.start, i.end] : [i.end, i.start];
-      s = -new L(c, l).direction().angleBetween(new M(0, 1), "angle", "360");
+      s = -new D(c, l).direction().angleBetween(new M(0, 1), "angle", "360");
     }
     const r = e.originalBox.center, o = M.zero(), a = e.originalData.map((c) => {
       const l = o.copy(c.start).division(r).rotate(M.zero(), s * (Math.PI / 180)).toJson(c.start.z), h = o.copy(c.end).division(r).rotate(M.zero(), s * (Math.PI / 180)).toJson(c.end.z), u = Object.assign(ot(c), { start: l, end: h });
@@ -2583,13 +2618,13 @@ class bt extends q {
     if (t in this) return this[t];
   }
 }
-class me {
+class Me {
   // 所有可查找的点位
   possibleDoorPoints = [];
   doorPoint = [];
   dxf;
   // 包含所有点的虚拟网格
-  pointVirtualGrid = new W();
+  pointVirtualGrid = new X();
   // 只包含可查找点的虚拟网格
   findPointVirtualGrid;
   quadtree;
@@ -2602,7 +2637,7 @@ class me {
   lineAnalysis;
   continueFind = !0;
   constructor(t) {
-    if (this.lineAnalysis = t, this.dxf = t.Dxf, this.findPointVirtualGrid = new W(), 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 X(), 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();
@@ -2632,11 +2667,11 @@ class me {
     );
     const a = [];
     return o.forEach((c) => {
-      const l = new L(c?.start, c?.end), h = l.length();
+      const l = new D(c?.start, c?.end), h = l.length();
       if (h < n) return;
       const u = l.normal(), f = l.direction(), p = (h - r.width * 2) / 2;
       for (let y = 0; y < 3; y++) {
-        const x = l.start.clone().add(f.clone().multiplyScalar(r.width + p * y)), g = new L(
+        const x = l.start.clone().add(f.clone().multiplyScalar(r.width + p * y)), g = new D(
           x,
           x.clone().add(u.clone().multiplyScalar(1))
         );
@@ -2686,7 +2721,7 @@ class me {
         });
       } else if (r.doorDirectConnection) {
         this.continueFind = !1;
-        const o = new L(M.from(r.start), M.from(r.end));
+        const o = new D(M.from(r.start), M.from(r.end));
         o.userData = {
           doorDirectConnection: !0,
           isDoor: !0
@@ -2719,16 +2754,16 @@ class me {
     function o({ point: x, line: g }, w, E) {
       const m = g.direction();
       g.start === x && m.multiplyScalar(-1);
-      const S = i.queryCircle(x, n).filter((D) => D.userData !== g).sort((D, A) => D.point.distance(x) - A.point.distance(x)), T = [];
-      for (let D = 0; D < S.length; D++) {
-        const A = e.findIndex((B) => B.point === S[D].point), P = t[w].uuid, N = e[A].uuid;
+      const S = i.queryCircle(x, n).filter((L) => L.userData !== g).sort((L, A) => L.point.distance(x) - A.point.distance(x)), T = [];
+      for (let L = 0; L < S.length; L++) {
+        const A = e.findIndex((B) => B.point === S[L].point), P = t[w].uuid, N = e[A].uuid;
         if (E.has(`${P}.${N}`)) continue;
         E.add(`${P}.${N}`), E.add(`${N}.${P}`);
-        const O = S[D].point, C = new L(x.clone(), O.clone());
+        const O = S[L].point, C = new D(x.clone(), O.clone());
         if (C.direction().angleBetween(m, "angle") < s) {
           const B = t[A].line.direction();
-          S[D].userData.start.equal(S[D].point) && B.multiplyScalar(-1), C.direction().multiplyScalar(-1).angleBetween(B, "angle") < s && (r.queryLineSegment(C).length || T.push({
-            findData: S[D],
+          S[L].userData.start.equal(S[L].point) && B.multiplyScalar(-1), C.direction().multiplyScalar(-1).angleBetween(B, "angle") < s && (r.queryLineSegment(C).length || T.push({
+            findData: S[L],
             findUuid: N,
             doorLine: C,
             doorUuid: P
@@ -2742,13 +2777,13 @@ class me {
       const S = [];
       m && S.push(m);
       for (let T = 0; T < w.length; T++) {
-        const D = w[T];
-        if (g.has(D.findUuid)) {
-          const A = g.get(D.findUuid);
-          a(D.findUuid, g, A, E, D) && S.push(D);
-        } else S.push(D);
+        const L = w[T];
+        if (g.has(L.findUuid)) {
+          const A = g.get(L.findUuid);
+          a(L.findUuid, g, A, E, L) && S.push(L);
+        } else S.push(L);
       }
-      return S.sort((T, D) => T.doorLine.length() - D.doorLine.length()), m && S[0] === m ? (w.splice(0), !0) : (w.splice(1), !1);
+      return S.sort((T, L) => T.doorLine.length() - L.doorLine.length()), m && S[0] === m ? (w.splice(0), !0) : (w.splice(1), !1);
     }
     const c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Map();
     t.map((x, g) => {
@@ -2778,10 +2813,10 @@ class me {
     });
     const y = [];
     return f.forEach((x) => {
-      const g = t.findIndex((A) => A.uuid === x.doorUuid), w = e.findIndex((A) => A.uuid === x.findUuid), E = t[g].point.clone(), m = e[w].point.clone(), S = this.findLongLineSegment(t[g].line), T = this.findLongLineSegment(e[w].line), D = S.projectPoint(m);
-      if (D) {
-        E.copy(D);
-        const A = new L(E, m), P = T.includedAngle(A);
+      const g = t.findIndex((A) => A.uuid === x.doorUuid), w = e.findIndex((A) => A.uuid === x.findUuid), E = t[g].point.clone(), m = e[w].point.clone(), S = this.findLongLineSegment(t[g].line), T = this.findLongLineSegment(e[w].line), L = S.projectPoint(m);
+      if (L) {
+        E.copy(L);
+        const A = new D(E, m), P = T.includedAngle(A);
         (P < 10 || P > 170 || Math.abs(90 - P) < 10) && y.push({
           start: E,
           end: m
@@ -2789,7 +2824,7 @@ class me {
       } else {
         const A = T.projectPoint(E);
         A && m.copy(A);
-        const P = new L(E, m), N = S.includedAngle(P);
+        const P = new D(E, m), N = S.includedAngle(P);
         (N < 10 || N > 170 || Math.abs(90 - N) < 10) && y.push({
           start: E,
           end: m
@@ -2813,7 +2848,7 @@ class me {
   searchAlongDirection({ point: t, line: e }, n = this.doorSearchDistance) {
     const s = this.quadtree, i = e.direction();
     e.start === t && i.multiplyScalar(-1);
-    const r = t.clone().add(i.clone().multiplyScalar(n)), o = new L(t.clone(), r), a = s.queryLineSegment(o).map((c) => ({
+    const r = t.clone().add(i.clone().multiplyScalar(n)), o = new D(t.clone(), r), a = s.queryLineSegment(o).map((c) => ({
       point: c.line.getIntersection(o),
       line: c.line
     })).filter((c) => c.point).sort((c, l) => t.distance(c.point) - t.distance(l.point));
@@ -2840,7 +2875,7 @@ class me {
         break;
       }
     }
-    const l = new L(t.clone(), t.clone().add(o.multiplyScalar(n))), h = i.queryLineSegment(l).map((u) => ({
+    const l = new D(t.clone(), t.clone().add(o.multiplyScalar(n))), h = i.queryLineSegment(l).map((u) => ({
       point: u.line.getIntersection(l),
       line: u.line
     })).filter((u) => u.point).sort((u, f) => t.distance(u.point) - t.distance(f.point));
@@ -2874,7 +2909,7 @@ class me {
     return e;
   }
 }
-class we extends q {
+class Se extends q {
   static name = "LineAnalysis";
   Dxf = null;
   Variable = null;
@@ -2920,7 +2955,7 @@ class we extends q {
    */
   addData(t, e) {
     const n = this.Dxf;
-    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new L(t.clone(), e.clone()));
+    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new D(t.clone(), e.clone()));
   }
   /** 结果分析创建矩形
    * @param result 
@@ -2934,8 +2969,8 @@ class we extends q {
     if (!(g.x > 0 && w.x < 0 || g.x < 0 && w.x > 0 || g.y > 0 && w.y < 0 || g.y < 0 && w.y > 0)) {
       u.set(y.x, y.y), f.set(x.x, x.y);
       for (let E = 1; E < o; E++) {
-        const m = l.clone().multiplyScalar(a * E), S = h.clone().multiplyScalar(c * E), T = u.clone().add(m), D = f.clone().add(S);
-        this.addData(T, D);
+        const m = l.clone().multiplyScalar(a * E), S = h.clone().multiplyScalar(c * E), T = u.clone().add(m), L = f.clone().add(S);
+        this.addData(T, L);
       }
     }
   }
@@ -3006,12 +3041,12 @@ class we extends q {
   doors = [];
   DoorsAnalysis;
   doorsAnalysis() {
-    this.DoorsAnalysis = new me(this), this.dispatchEvent({
+    this.DoorsAnalysis = new Me(this), this.dispatchEvent({
       type: "analysisCompleted"
     });
   }
 }
-class Me extends q {
+class Ee extends q {
   static name = "ThreeVJia";
   lineSegments = [];
   onAddFromParent() {
@@ -3023,7 +3058,7 @@ class Me extends q {
     t.resultList.forEach((l) => {
       const h = s.get(l.target) ?? [], u = s.get(l.source) ?? [], f = l.project.clone(), p = l.project2.clone();
       f.includedAngle(p) > 135 && (p.points = [p.points[1], p.points[0]]), h.push(...f.points), u.push(...p.points), s.set(l.target, h), s.set(l.source, u);
-      const y = new L(f.start, p.start), x = new L(f.end, p.end), g = new L(y.center, x.center);
+      const y = new D(f.start, p.start), x = new D(f.end, p.end), g = new D(y.center, x.center);
       g.userData.wallWidth = Math.max(y.length(), x.length()), r.push(g);
     });
     const a = [];
@@ -3040,7 +3075,7 @@ class Me extends q {
           const f = [];
           for (let p = 0; p < h.length; p++) {
             const y = h[p];
-            y.userData.type === "start" ? (f.length === 0 && (a.push(new L(u.start.clone(), y.clone())), u.start.copy(y)), f.push("start")) : (f.pop(), f.length === 0 && u.start.copy(y));
+            y.userData.type === "start" ? (f.length === 0 && (a.push(new D(u.start.clone(), y.clone())), u.start.copy(y)), f.push("start")) : (f.pop(), f.length === 0 && u.start.copy(y));
           }
           a.push(u);
         }
@@ -3146,7 +3181,7 @@ class ct extends ne {
    * @param scale 原始数据缩放比例
    */
   constructor(t = 0.1, e = 1) {
-    super(), this.environment = typeof window < "u" ? "browser" : typeof global < "u" ? "node" : "unknown", this.wallWidth = t, this.Dxf = new k(this.wallWidth, e), this.AngleCorrectionDxf = new ge(), this.Variable = new bt(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(new we()), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new Me()), ct.finalInstance = this;
+    super(), this.environment = typeof window < "u" ? "browser" : typeof global < "u" ? "node" : "unknown", this.wallWidth = t, this.Dxf = new k(this.wallWidth, e), this.AngleCorrectionDxf = new we(), this.Variable = new bt(), this.addComponent(this.Variable), this.addComponent(this.Dxf), this.addComponent(new Se()), this.addComponent(this.AngleCorrectionDxf), this.addComponent(new Ee()), ct.finalInstance = this;
   }
   usePlugin(t) {
     return typeof t == "function" && t.call(this, this), this;
@@ -3163,12 +3198,17 @@ function It(...d) {
   d.forEach((t) => {
     const e = t.direction();
     t.userData.drawWindow?.forEach((n) => {
-      const s = M.from(n.p), i = t.projectPoint(
-        s.clone().add(e.clone().multiplyScalar(n.width * 0.5))
-      ), r = t.projectPoint(
-        s.clone().add(e.clone().multiplyScalar(n.width * -0.5))
-      ), o = new L(i, r), a = o.center;
-      n.p = new I.Vector3(a?.x ?? 0, a?.y ?? 0, n.p.z);
+      try {
+        const s = M.from(n.p), i = t.projectPoint(
+          s.clone().add(e.clone().multiplyScalar(n.width * 0.5)),
+          !1
+        ), r = t.projectPoint(
+          s.clone().add(e.clone().multiplyScalar(n.width * -0.5)),
+          !1
+        ), o = t.projectLineSegment(new D(i, r)), a = o.center;
+        n.p = new I.Vector3(a?.x ?? 0, a?.y ?? 0, n.p.z);
+      } catch {
+      }
     });
   });
 }
@@ -3184,7 +3224,7 @@ class lt {
       const r = i.center, o = /* @__PURE__ */ new Set();
       for (const a of e) {
         if (o.size === 2) break;
-        const c = new L(r, a);
+        const c = new D(r, a);
         if (!s.queryLineSegment(c).filter((h) => !(h.line === i || h.line.parallel(i) && i.getMinLength(h.line) < n && h.line.projectLineSegment(i).length() / i.length() > 0.6)).length) {
           const h = i.pointPosition(a);
           h !== "on" && o.add(h);
@@ -3221,33 +3261,33 @@ class lt {
         g.directionMove(E, n * 0.5);
       }
     }
-    function r({ resultLine: g, type: w, direction: E, point: m }, S, T, D) {
+    function r({ resultLine: g, type: w, direction: E, point: m }, S, T, L) {
       if (w === "intersect")
         m && m.copy(S.projectPoint(m) ?? m);
       else if (E === "vertical") {
         if (m) {
           const A = S.projectPoint(m, !1);
-          m.copy(A), S.isPointOnSegment(A) || (S.start.distance(A) < S.end.distance(A) ? D.push(new L(A.clone(), S.start.clone())) : D.push(new L(A.clone(), S.end.clone())));
+          m.copy(A), S.isPointOnSegment(A) || (S.start.distance(A) < S.end.distance(A) ? L.push(new D(A.clone(), S.start.clone())) : L.push(new D(A.clone(), S.end.clone())));
         }
       } else if (!u.includes(g) && m) {
         let A = S.projectPoint(m, !1), P;
         if (S.start.distance(m) < S.end.distance(m) ? P = S.start : P = S.end, A) {
-          D.push(new L(m.clone(), A.clone()));
-          const N = new L(A.clone(), P.clone());
-          N.length() && D.push(N);
+          L.push(new D(m.clone(), A.clone()));
+          const N = new D(A.clone(), P.clone());
+          N.length() && L.push(N);
         }
       }
       T.update(g);
     }
     const o = Object.keys(e).map((g) => M.from(e[g])), a = [];
     let c = t.map(({ start: g, end: w, ...E }) => {
-      const m = new L(M.from(g), M.from(w));
+      const m = new D(M.from(g), M.from(w));
       return m.userData = E, a.push(g.z ?? 0, w.z ?? 0), m;
     });
-    const l = a.reduce((g, w) => g + w, 0) / a.length, h = lt.findExtWallByTraj(c, o);
-    let u = h.filter((g) => g.userData.expandDirect);
-    c = c.filter((g) => !h.includes(g)), c.push(...u);
-    const f = L.groupBySamePointAndParallel(u), p = new F(R.fromByLineSegment(...c));
+    const l = a.reduce((g, w) => g + w, 0) / a.length;
+    let u = lt.findExtWallByTraj(c, o).filter((g) => g.userData.expandDirect);
+    c = c.filter((g) => !u.includes(g)), c.push(...u);
+    const f = D.groupBySamePointAndParallel(u), p = new F(R.fromByLineSegment(...c));
     c.forEach((g) => g.userData.isDoor || p.insert(g));
     const y = f.map((g) => g.flatMap((w) => s(w, p))), x = [];
     return f.flatMap((g, w) => (g.forEach((m) => (i(m), p.update(m))), y[w].filter((m) => {
@@ -3255,11 +3295,11 @@ class lt {
         let S;
         return Object.defineProperty(m, "newLine", {
           get() {
-            return S || (S = L.mergeLines(...g)), S;
+            return S || (S = D.mergeLines(...g)), S;
           }
         }), !0;
       }
-      r(m, L.mergeLines(...g), p, x);
+      r(m, D.mergeLines(...g), p, x);
     }))).reduce((g, w) => (g.has(w.resultLine) || g.set(w.resultLine, []), g.get(w.resultLine)?.push(w), g), /* @__PURE__ */ new Map()).forEach((g) => {
       g.reduce((w, E) => (w.has(E.point) || w.set(E.point, []), w.get(E.point)?.push(E), w), /* @__PURE__ */ new Map()).forEach((w) => {
         const E = /* @__PURE__ */ new Set();
@@ -3268,10 +3308,10 @@ class lt {
           E.has(S.point) || (r(S, S.newLine, p, x), E.add(S.point));
         }
       });
-    }), c.push(...L.deduplication(x)), c.forEach((g) => g.userData.isWindow && It(g)), c = at(c), c = L.deduplication(c), K(c, l);
+    }), c.push(...D.deduplication(x)), c.forEach((g) => g.userData.isWindow && It(g)), c = at(c), c = D.deduplication(c), K(c, l);
   }
 }
-const on = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const cn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   AxisAlignCorr: Tt,
   BoundExt: lt,
@@ -3309,33 +3349,33 @@ const on = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
 class Z {
   constructor() {
     this.textureUtils = null, this.pluginCallbacks = [], this.register(function(t) {
-      return new ve(t);
-    }), this.register(function(t) {
-      return new Ne(t);
-    }), this.register(function(t) {
-      return new Fe(t);
+      return new Ce(t);
     }), this.register(function(t) {
-      return new Ue(t);
+      return new Be(t);
     }), this.register(function(t) {
       return new Ge(t);
     }), this.register(function(t) {
-      return new ze(t);
+      return new je(t);
     }), this.register(function(t) {
-      return new Ce(t);
+      return new ze(t);
     }), this.register(function(t) {
-      return new Be(t);
+      return new _e(t);
     }), this.register(function(t) {
       return new Oe(t);
     }), this.register(function(t) {
-      return new je(t);
+      return new Fe(t);
     }), this.register(function(t) {
-      return new _e(t);
+      return new Ue(t);
     }), this.register(function(t) {
       return new qe(t);
     }), this.register(function(t) {
       return new Ye(t);
     }), this.register(function(t) {
       return new ke(t);
+    }), this.register(function(t) {
+      return new Xe(t);
+    }), this.register(function(t) {
+      return new Ve(t);
     });
   }
   register(t) {
@@ -3348,7 +3388,7 @@ class Z {
     return this.textureUtils = t, this;
   }
   parse(t, e, n, s) {
-    const i = new Re(), r = [];
+    const i = new Ne(), r = [];
     for (let o = 0, a = this.pluginCallbacks.length; o < a; o++)
       r.push(this.pluginCallbacks[o](i));
     i.setPlugins(r), i.setTextureUtils(this.textureUtils), i.writeAsync(t, e, s).catch(n);
@@ -3399,19 +3439,19 @@ const wt = {
   position: "translation",
   quaternion: "rotation",
   morphTargetInfluences: "weights"
-}, Se = new Ot(), Mt = 12, Ee = 1179937895, Le = 2, St = 8, De = 1313821514, Ae = 5130562;
-function V(d, t) {
+}, De = new Ot(), Mt = 12, Le = 1179937895, Ae = 2, St = 8, Te = 1313821514, be = 5130562;
+function W(d, t) {
   return d.length === t.length && d.every(function(e, n) {
     return e === t[n];
   });
 }
-function Te(d) {
+function Ie(d) {
   return new TextEncoder().encode(d).buffer;
 }
-function be(d) {
-  return V(d.elements, [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]);
+function Pe(d) {
+  return W(d.elements, [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]);
 }
-function Ie(d, t, e) {
+function Re(d, t, e) {
   const n = {
     min: new Array(d.itemSize).fill(Number.POSITIVE_INFINITY),
     max: new Array(d.itemSize).fill(Number.NEGATIVE_INFINITY)
@@ -3440,7 +3480,7 @@ function nt(d, t = 0) {
 function Et() {
   return typeof document > "u" && typeof OffscreenCanvas < "u" ? new OffscreenCanvas(1, 1) : document.createElement("canvas");
 }
-function Pe(d, t) {
+function ve(d, t) {
   if (typeof OffscreenCanvas < "u" && d instanceof OffscreenCanvas) {
     let e;
     return t === "image/jpeg" ? e = 0.92 : t === "image/webp" && (e = 0.8), d.convertToBlob({
@@ -3450,7 +3490,7 @@ function Pe(d, t) {
   } else
     return new Promise((e) => d.toBlob(e, t));
 }
-class Re {
+class Ne {
   constructor() {
     this.plugins = [], this.options = {}, this.pending = [], this.buffers = [], this.byteOffset = 0, this.buffers = [], this.nodeMap = /* @__PURE__ */ new Map(), this.skins = [], this.extensionsUsed = {}, this.extensionsRequired = {}, this.uids = /* @__PURE__ */ new Map(), this.uid = 0, this.json = {
       asset: {
@@ -3494,11 +3534,11 @@ class Re {
     const o = s.extensionsUsed, a = s.extensionsRequired, c = new Blob(i, { type: "application/octet-stream" }), l = Object.keys(o), h = Object.keys(a);
     l.length > 0 && (r.extensionsUsed = l), h.length > 0 && (r.extensionsRequired = h), r.buffers && r.buffers.length > 0 && (r.buffers[0].byteLength = c.size), n.binary === !0 ? st(c).then(function(u) {
       const f = nt(u), p = new DataView(new ArrayBuffer(St));
-      p.setUint32(0, f.byteLength, !0), p.setUint32(4, Ae, !0);
-      const y = nt(Te(JSON.stringify(r)), 32), x = new DataView(new ArrayBuffer(St));
-      x.setUint32(0, y.byteLength, !0), x.setUint32(4, De, !0);
+      p.setUint32(0, f.byteLength, !0), p.setUint32(4, be, !0);
+      const y = nt(Ie(JSON.stringify(r)), 32), x = new DataView(new ArrayBuffer(St));
+      x.setUint32(0, y.byteLength, !0), x.setUint32(4, Te, !0);
       const g = new ArrayBuffer(Mt), w = new DataView(g);
-      w.setUint32(0, Ee, !0), w.setUint32(4, Le, !0);
+      w.setUint32(0, Le, !0), w.setUint32(4, Ae, !0);
       const E = Mt + x.byteLength + y.byteLength + p.byteLength + f.byteLength;
       w.setUint32(8, E, !0);
       const m = new Blob([
@@ -3511,7 +3551,7 @@ class Re {
       st(m).then((S) => {
         e(S);
       });
-    }) : r.buffers && r.buffers.length > 0 ? Xe(c).then((u) => {
+    }) : r.buffers && r.buffers.length > 0 ? We(c).then((u) => {
       r.buffers[0].uri = u, e(r);
     }) : e(r);
   }
@@ -3622,7 +3662,7 @@ class Re {
     }
     c.putImageData(l, 0, 0);
     const u = (t || e).clone();
-    return u.source = new Gt(a), u.colorSpace = zt, u.channel = (t || e).channel, t && e && t.channel !== e.channel && console.warn("THREE.GLTFExporter: UV channels for metalnessMap and roughnessMap textures must match."), console.warn("THREE.GLTFExporter: Merged metalnessMap and roughnessMap textures."), u;
+    return u.source = new Gt(a), u.colorSpace = jt, u.channel = (t || e).channel, t && e && t.channel !== e.channel && console.warn("THREE.GLTFExporter: UV channels for metalnessMap and roughnessMap textures must match."), console.warn("THREE.GLTFExporter: Merged metalnessMap and roughnessMap textures."), u;
   }
   async decompressTextureAsync(t, e = 1 / 0) {
     if (this.textureUtils === null)
@@ -3737,7 +3777,7 @@ class Re {
     else
       throw new Error("THREE.GLTFExporter: Unsupported bufferAttribute component type: " + t.array.constructor.name);
     if (n === void 0 && (n = 0), (s === void 0 || s === 1 / 0) && (s = t.count), s === 0) return null;
-    const a = Ie(t, n, s);
+    const a = Re(t, n, s);
     let c;
     e !== void 0 && (c = t === e.index ? b.ELEMENT_ARRAY_BUFFER : b.ARRAY_BUFFER);
     const l = this.processBufferView(t, o, n, s, c), h = {
@@ -3772,7 +3812,7 @@ class Re {
         willReadFrequently: !0
       });
       if (n === !0 && (p.translate(0, f.height), p.scale(1, -1)), t.data !== void 0) {
-        e !== jt && console.error("GLTFExporter: Only RGBAFormat is supported.", e), (t.width > a.maxTextureSize || t.height > a.maxTextureSize) && console.warn("GLTFExporter: Image size is bigger than maxTextureSize", t);
+        e !== zt && console.error("GLTFExporter: Only RGBAFormat is supported.", e), (t.width > a.maxTextureSize || t.height > a.maxTextureSize) && console.warn("GLTFExporter: Image size is bigger than maxTextureSize", t);
         const x = new Uint8ClampedArray(t.height * t.width * 4);
         for (let g = 0; g < x.length; g += 4)
           x[g + 0] = t.data[g + 0], x[g + 1] = t.data[g + 1], x[g + 2] = t.data[g + 2], x[g + 3] = t.data[g + 3];
@@ -3782,7 +3822,7 @@ class Re {
       else
         throw new Error("THREE.GLTFExporter: Invalid image type. Use HTMLImageElement, HTMLCanvasElement, ImageBitmap or OffscreenCanvas.");
       a.binary === !0 ? c.push(
-        Pe(f, s).then((x) => i.processBufferViewImage(x)).then((x) => {
+        ve(f, s).then((x) => i.processBufferViewImage(x)).then((x) => {
           u.bufferView = x;
         })
       ) : u.uri = _t.getDataURL(f, s);
@@ -3842,7 +3882,7 @@ class Re {
     const s = { pbrMetallicRoughness: {} };
     t.isMeshStandardMaterial !== !0 && t.isMeshBasicMaterial !== !0 && console.warn("GLTFExporter: Use MeshStandardMaterial or MeshBasicMaterial for best results.");
     const i = t.color.toArray().concat([t.opacity]);
-    if (V(i, [1, 1, 1, 1]) || (s.pbrMetallicRoughness.baseColorFactor = i), t.isMeshStandardMaterial ? (s.pbrMetallicRoughness.metallicFactor = t.metalness, s.pbrMetallicRoughness.roughnessFactor = t.roughness) : (s.pbrMetallicRoughness.metallicFactor = 0, s.pbrMetallicRoughness.roughnessFactor = 1), t.metalnessMap || t.roughnessMap) {
+    if (W(i, [1, 1, 1, 1]) || (s.pbrMetallicRoughness.baseColorFactor = i), t.isMeshStandardMaterial ? (s.pbrMetallicRoughness.metallicFactor = t.metalness, s.pbrMetallicRoughness.roughnessFactor = t.roughness) : (s.pbrMetallicRoughness.metallicFactor = 0, s.pbrMetallicRoughness.roughnessFactor = 1), t.metalnessMap || t.roughnessMap) {
       const o = await this.buildMetalRoughTextureAsync(t.metalnessMap, t.roughnessMap), a = {
         index: await this.processTextureAsync(o),
         texCoord: o.channel
@@ -3922,8 +3962,8 @@ class Re {
         continue;
       }
       p = null;
-      const D = S.array;
-      m === "JOINTS_0" && !(D instanceof Uint16Array) && !(D instanceof Uint8Array) ? (console.warn('GLTFExporter: Attribute "skinIndex" converted to type UNSIGNED_SHORT.'), p = new _(new Uint16Array(D), S.itemSize, S.normalized)) : (D instanceof Uint32Array || D instanceof Int32Array) && !m.startsWith("_") && (console.warn(`GLTFExporter: Attribute "${m}" converted to type FLOAT.`), p = Z.Utils.toFloat32BufferAttribute(S));
+      const L = S.array;
+      m === "JOINTS_0" && !(L instanceof Uint16Array) && !(L instanceof Uint8Array) ? (console.warn('GLTFExporter: Attribute "skinIndex" converted to type UNSIGNED_SHORT.'), p = new _(new Uint16Array(L), S.itemSize, S.normalized)) : (L instanceof Uint32Array || L instanceof Int32Array) && !m.startsWith("_") && (console.warn(`GLTFExporter: Attribute "${m}" converted to type FLOAT.`), p = Z.Utils.toFloat32BufferAttribute(S));
       const A = this.processAccessor(p || S, r);
       A !== null && (m.startsWith("_") || this.detectMeshQuantization(m, S), c[m] = A, e.attributes.set(this.getUID(S), A));
     }
@@ -3931,9 +3971,9 @@ class Re {
     if (t.morphTargetInfluences !== void 0 && t.morphTargetInfluences.length > 0) {
       const m = [], S = [], T = {};
       if (t.morphTargetDictionary !== void 0)
-        for (const D in t.morphTargetDictionary)
-          T[t.morphTargetDictionary[D]] = D;
-      for (let D = 0; D < t.morphTargetInfluences.length; ++D) {
+        for (const L in t.morphTargetDictionary)
+          T[t.morphTargetDictionary[L]] = L;
+      for (let L = 0; L < t.morphTargetInfluences.length; ++L) {
         const A = {};
         let P = !1;
         for (const N in r.morphAttributes) {
@@ -3941,19 +3981,19 @@ class Re {
             P || (console.warn("GLTFExporter: Only POSITION and NORMAL morph are supported."), P = !0);
             continue;
           }
-          const O = r.morphAttributes[N][D], C = N.toUpperCase(), G = r.attributes[N];
+          const O = r.morphAttributes[N][L], C = N.toUpperCase(), G = r.attributes[N];
           if (e.attributes.has(this.getUID(O, !0))) {
             A[C] = e.attributes.get(this.getUID(O, !0));
             continue;
           }
           const B = O.clone();
           if (!r.morphTargetsRelative)
-            for (let v = 0, X = O.count; v < X; v++)
-              for (let z = 0; z < O.itemSize; z++)
-                z === 0 && B.setX(v, O.getX(v) - G.getX(v)), z === 1 && B.setY(v, O.getY(v) - G.getY(v)), z === 2 && B.setZ(v, O.getZ(v) - G.getZ(v)), z === 3 && B.setW(v, O.getW(v) - G.getW(v));
+            for (let v = 0, V = O.count; v < V; v++)
+              for (let j = 0; j < O.itemSize; j++)
+                j === 0 && B.setX(v, O.getX(v) - G.getX(v)), j === 1 && B.setY(v, O.getY(v) - G.getY(v)), j === 2 && B.setZ(v, O.getZ(v) - G.getZ(v)), j === 3 && B.setW(v, O.getW(v) - G.getW(v));
           A[C] = this.processAccessor(B, r), e.attributes.set(this.getUID(G, !0), A[C]);
         }
-        h.push(A), m.push(t.morphTargetInfluences[D]), t.morphTargetDictionary !== void 0 && S.push(T[D]);
+        h.push(A), m.push(t.morphTargetInfluences[L]), t.morphTargetDictionary !== void 0 && S.push(T[L]);
       }
       a.weights = m, S.length > 0 && (a.extras = {}, a.extras.targetNames = S);
     }
@@ -3976,8 +4016,8 @@ class Re {
         let A = this.getUID(r.index);
         (w[m].start !== void 0 || w[m].count !== void 0) && (A += ":" + w[m].start + ":" + w[m].count), e.attributes.has(A) ? T.indices = e.attributes.get(A) : (T.indices = this.processAccessor(r.index, r, w[m].start, w[m].count), e.attributes.set(A, T.indices)), T.indices === null && delete T.indices;
       }
-      const D = await this.processMaterialAsync(g[w[m].materialIndex]);
-      D !== null && (T.material = D), l.push(T);
+      const L = await this.processMaterialAsync(g[w[m].materialIndex]);
+      L !== null && (T.material = L), l.push(T);
     }
     x === !0 && r.setIndex(null), a.primitives = l, n.meshes || (n.meshes = []), await this._invokeAllAsync(function(m) {
       m.writeMesh && m.writeMesh(t, a);
@@ -4096,7 +4136,7 @@ class Re {
     if (i === void 0) return null;
     const r = t.skeleton.bones[0];
     if (r === void 0) return null;
-    const o = [], a = new Float32Array(i.bones.length * 16), c = new Dt();
+    const o = [], a = new Float32Array(i.bones.length * 16), c = new Lt();
     for (let h = 0; h < i.bones.length; ++h)
       o.push(n.get(i.bones[h])), c.copy(i.boneInverses[h]), c.multiply(t.bindMatrix).toArray(a, h * 16);
     return e.skins === void 0 && (e.skins = []), e.skins.push({
@@ -4116,9 +4156,9 @@ class Re {
     const i = {};
     if (n.trs) {
       const o = t.quaternion.toArray(), a = t.position.toArray(), c = t.scale.toArray();
-      V(o, [0, 0, 0, 1]) || (i.rotation = o), V(a, [0, 0, 0]) || (i.translation = a), V(c, [1, 1, 1]) || (i.scale = c);
+      W(o, [0, 0, 0, 1]) || (i.rotation = o), W(a, [0, 0, 0]) || (i.translation = a), W(c, [1, 1, 1]) || (i.scale = c);
     } else
-      t.matrixAutoUpdate && t.updateMatrix(), be(t.matrix) === !1 && (i.matrix = t.matrix.elements);
+      t.matrixAutoUpdate && t.updateMatrix(), Pe(t.matrix) === !1 && (i.matrix = t.matrix.elements);
     if (t.name !== "" && (i.name = String(t.name)), this.serializeUserData(t, i), t.isMesh || t.isLine || t.isPoints) {
       const o = await this.processMeshAsync(t);
       o !== null && (i.mesh = o);
@@ -4195,7 +4235,7 @@ class Re {
       await t(this.plugins[e]);
   }
 }
-class ve {
+class Ce {
   constructor(t) {
     this.writer = t, this.name = "KHR_lights_punctual";
   }
@@ -4211,7 +4251,7 @@ class ve {
     o.push(r), e.extensions = e.extensions || {}, e.extensions[this.name] = { light: o.length - 1 };
   }
 }
-class Ne {
+class Be {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_unlit";
   }
@@ -4221,7 +4261,7 @@ class Ne {
     e.extensions = e.extensions || {}, e.extensions[this.name] = {}, s[this.name] = !0, e.pbrMetallicRoughness.metallicFactor = 0, e.pbrMetallicRoughness.roughnessFactor = 0.9;
   }
 }
-class Ce {
+class Oe {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_clearcoat";
   }
@@ -4252,7 +4292,7 @@ class Ce {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Be {
+class Fe {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_dispersion";
   }
@@ -4262,7 +4302,7 @@ class Be {
     i.dispersion = t.dispersion, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Oe {
+class Ue {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_iridescence";
   }
@@ -4286,7 +4326,7 @@ class Oe {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Fe {
+class Ge {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_transmission";
   }
@@ -4303,7 +4343,7 @@ class Fe {
     e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Ue {
+class je {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_volume";
   }
@@ -4320,7 +4360,7 @@ class Ue {
     t.attenuationDistance !== 1 / 0 && (i.attenuationDistance = t.attenuationDistance), i.attenuationColor = t.attenuationColor.toArray(), e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Ge {
+class ze {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_ior";
   }
@@ -4330,12 +4370,12 @@ class Ge {
     i.ior = t.ior, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class ze {
+class _e {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_specular";
   }
   async writeMaterialAsync(t, e) {
-    if (!t.isMeshPhysicalMaterial || t.specularIntensity === 1 && t.specularColor.equals(Se) && !t.specularIntensityMap && !t.specularColorMap) return;
+    if (!t.isMeshPhysicalMaterial || t.specularIntensity === 1 && t.specularColor.equals(De) && !t.specularIntensityMap && !t.specularColorMap) return;
     const n = this.writer, s = n.extensionsUsed, i = {};
     if (t.specularIntensityMap) {
       const r = {
@@ -4354,7 +4394,7 @@ class ze {
     i.specularFactor = t.specularIntensity, i.specularColorFactor = t.specularColor.toArray(), e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class je {
+class qe {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_sheen";
   }
@@ -4378,7 +4418,7 @@ class je {
     i.sheenRoughnessFactor = t.sheenRoughness, i.sheenColorFactor = t.sheenColor.toArray(), e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class _e {
+class Ye {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_anisotropy";
   }
@@ -4392,7 +4432,7 @@ class _e {
     i.anisotropyStrength = t.anisotropy, i.anisotropyRotation = t.anisotropyRotation, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class qe {
+class ke {
   constructor(t) {
     this.writer = t, this.name = "KHR_materials_emissive_strength";
   }
@@ -4402,7 +4442,7 @@ class qe {
     i.emissiveStrength = t.emissiveIntensity, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class Ye {
+class Xe {
   constructor(t) {
     this.writer = t, this.name = "EXT_materials_bump";
   }
@@ -4419,13 +4459,13 @@ class Ye {
     i.bumpFactor = t.bumpScale, e.extensions = e.extensions || {}, e.extensions[this.name] = i, s[this.name] = !0;
   }
 }
-class ke {
+class Ve {
   constructor(t) {
     this.writer = t, this.name = "EXT_mesh_gpu_instancing";
   }
   writeNode(t, e) {
     if (!t.isInstancedMesh) return;
-    const n = this.writer, s = t, i = new Float32Array(s.count * 3), r = new Float32Array(s.count * 4), o = new Float32Array(s.count * 3), a = new Dt(), c = new J(), l = new Ft(), h = new J();
+    const n = this.writer, s = t, i = new Float32Array(s.count * 3), r = new Float32Array(s.count * 4), o = new Float32Array(s.count * 3), a = new Lt(), c = new J(), l = new Ft(), h = new J();
     for (let f = 0; f < s.count; f++)
       s.getMatrixAt(f, a), a.decompose(c, l, h), c.toArray(i, f * 3), l.toArray(r, f * 4), h.toArray(o, f * 3);
     const u = {
@@ -4509,7 +4549,7 @@ Z.Utils = {
     return t;
   }
 };
-async function Xe(d) {
+async function We(d) {
   if (typeof FileReader > "u") {
     const t = await d.arrayBuffer(), n = Buffer.from(t).toString("base64");
     return `data:${d.type};base64,${n}`;
@@ -4532,8 +4572,8 @@ async function st(d) {
     return t.buffer.slice(t.byteOffset, t.byteOffset + t.byteLength);
   }
 }
-const Ve = new ee(), We = new Z();
-function He(d, t, e = 0.1) {
+const He = new ee(), Je = new Z();
+function $e(d, t, e = 0.1) {
   const n = t.normal(d), s = t.direction(d).mutiplyScalar(e * 0.5), i = d.direction(t).mutiplyScalar(e * 0.5), r = n.x * e * 0.5, o = n.y * e * 0.5;
   return {
     points: [
@@ -4578,7 +4618,7 @@ class Rt extends q {
         new I.LineSegments(new I.EdgesGeometry(i), new I.LineBasicMaterial({ color: 0 }))
       );
     }), t.originalData.map(({ start: n, end: s, insetionArr: i }) => {
-      const r = new M(n.x, n.y).mutiplyScalar(t.scale), o = new M(s.x, s.y).mutiplyScalar(t.scale), { points: a, indices: c, rectIndices: l } = He(r, o, t.width);
+      const r = new M(n.x, n.y).mutiplyScalar(t.scale), o = new M(s.x, s.y).mutiplyScalar(t.scale), { points: a, indices: c, rectIndices: l } = $e(r, o, t.width);
       return {
         points: a,
         indices: c,
@@ -4611,7 +4651,7 @@ class Rt extends q {
   toOBJ() {
     return new Promise((t) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(() => {
-        t(Ve.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
+        t(He.parse(this.whiteModelGroup)), this.material.opacity = 0.8, this.material.transparent = !0;
       }, 20);
     });
   }
@@ -4623,7 +4663,7 @@ class Rt extends q {
   toGltf(t = !0) {
     return new Promise((e) => {
       this.material.opacity = 1, this.material.needsUpdate = !0, setTimeout(async () => {
-        We.parse(this.whiteModelGroup.children, (n) => {
+        Je.parse(this.whiteModelGroup.children, (n) => {
           e(n), this.material.opacity = 0.8, this.material.transparent = !0;
         }, () => {
           e(void 0);
@@ -4784,13 +4824,13 @@ class Nt extends q {
     });
   }
 }
-const Je = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Ke = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   DetailsPoint: vt,
   DxfLineModel: Nt,
   WhiteModel: Rt
 }, Symbol.toStringTag, { value: "Module" }));
-function Lt(d, t = {}) {
+function Dt(d, t = {}) {
   const {
     detailsPoint: e = !0,
     whiteModel: n = !0,
@@ -4798,24 +4838,24 @@ function Lt(d, t = {}) {
   } = t;
   s && d.addComponent(new Nt()), n && d.addComponent(new Rt()), e && d.addComponent(new vt());
 }
-const $e = Object.assign(Lt, {
+const Ze = Object.assign(Dt, {
   create(d = {}) {
-    return (t) => Lt(t, d);
+    return (t) => Dt(t, d);
   }
-}), Ke = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}), Qe = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  ModelDataPlugin: $e,
-  components: Je
+  ModelDataPlugin: Ze,
+  components: Ke
 }, Symbol.toStringTag, { value: "Module" }));
-function Ze() {
+function tn() {
   return import("./index2.js");
 }
-function Qe() {
+function en() {
   return import("./index3.js");
 }
 let ht = null;
-async function an(d, t, e = !1, n) {
-  const s = await Promise.resolve().then(() => Ke), i = await Ze(), r = await Qe(), o = new ct().usePlugin(s.ModelDataPlugin.create({
+async function ln(d, t, e = !1, n) {
+  const s = await Promise.resolve().then(() => Qe), i = await tn(), r = await en(), o = new ct().usePlugin(s.ModelDataPlugin.create({
     detailsPoint: !1,
     whiteModel: !0
   })).usePlugin(i.RenderPlugin.create({
@@ -4827,10 +4867,10 @@ async function an(d, t, e = !1, n) {
   })).usePlugin(r.Editor.create({ viewPermission: n })), a = o.findComponentByType(i.components.DomContainer);
   return a && d.appendChild(a.domElement), ht = o, {
     dxfSystem: o,
-    getFileAll: () => tn(o)
+    getFileAll: () => nn(o)
   };
 }
-async function tn(d = ht) {
+async function nn(d = ht) {
   const t = d.findComponentByName("WhiteModel"), e = new File([await d.AngleCorrectionDxf.toDxfImageBlob()], "img.jpg", { type: "image/jpeg" }), n = new File([d.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), s = new File([d.AngleCorrectionDxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), i = new File([await t.toOBJBlob()], "model.obj", { type: "application/octet-stream" }), r = new File([await t.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), o = new File([await t.toGltfBlob(!1)], "model.gltf", { type: "application/json" }), a = new File([JSON.stringify(d.Dxf.originalData)], "json.json", { type: "application/json" });
   return {
     dxf: n,
@@ -4842,7 +4882,7 @@ async function tn(d = ht) {
     correctionDxf: s
   };
 }
-function cn() {
+function hn() {
   return ht;
 }
 export {
@@ -4851,21 +4891,21 @@ export {
   q as C,
   ct as D,
   At as E,
-  L,
-  $e as M,
+  D as L,
+  Ze as M,
   M as P,
   F as Q,
-  Me as T,
+  Ee as T,
   bt as V,
   Rt as W,
   vt as a,
-  W as b,
-  an as c,
-  cn as d,
+  X as b,
+  ln as c,
+  hn as d,
   k as e,
-  on as f,
-  tn as g,
-  Je as i,
+  cn as f,
+  nn as g,
+  Ke as i,
   It as r,
   rt as u
 };

package/src/utils/DxfSystem/plugin/RenderPlugin/pages/Dxf.vue.d.ts

@@ -1,4 +1,4 @@
-import { OriginalDataItem } from '../../../components/Dxf';
+import { OriginalDataItem } from '../../../type';
 type __VLS_Props = {
     lines?: OriginalDataItem[];
     detailsPoint?: {