rm-graphical-computing 1.0.69 → 1.0.70

package/dist/index.js

@@ -2,7 +2,7 @@ var Qn = Object.defineProperty;
 var Jn = (n, t, e) => t in n ? Qn(n, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : n[t] = e;
 var Oe = (n, t, e) => Jn(n, typeof t != "symbol" ? t + "" : t, e);
 import * as y from "three";
-import { BufferGeometry as to, BufferAttribute as eo, Plane as no, Vector3 as zt, Matrix3 as En, MathUtils as Ne, Box3 as oo, Matrix4 as Tn, Ray as ro } from "three";
+import { BufferGeometry as to, BufferAttribute as eo, Plane as no, Vector3 as Vt, Matrix3 as En, MathUtils as Ne, Box3 as oo, Matrix4 as Tn, Ray as ro } from "three";
 function io(n, t = !1) {
   const e = n[0].index !== null, o = new Set(Object.keys(n[0].attributes)), i = new Set(Object.keys(n[0].morphAttributes)), r = {}, s = {}, a = n[0].morphTargetsRelative, l = new to();
   let u = 0;
@@ -167,24 +167,24 @@ const oe = (n, t, e = 0.01) => {
 }, co = (n, t, e, o) => {
   const i = n;
   let r = [];
-  if (o && o.length && (r = o.map((z) => z.clone())), !i || i.length < 4) return {};
+  if (o && o.length && (r = o.map((V) => V.clone())), !i || i.length < 4) return {};
   const s = new y.Vector3().subVectors(i[1], i[0]).normalize(), a = new y.Vector3().subVectors(i[3], i[0]).normalize(), l = s.clone().cross(a).normalize();
   let u = 1 / 0, h = -1 / 0, d = 1 / 0, c = -1 / 0;
-  for (const z of i) {
-    const S = z.dot(s), v = z.dot(a);
-    S < u && (u = S), S > h && (h = S), v < d && (d = v), v > c && (c = v);
+  for (const V of i) {
+    const v = V.dot(s), S = V.dot(a);
+    v < u && (u = v), v > h && (h = v), S < d && (d = S), S > c && (c = S);
   }
   const f = i[0].dot(l), w = s.clone().multiplyScalar(u).add(a.clone().multiplyScalar(d)).add(l.clone().multiplyScalar(f)), x = s.clone().multiplyScalar(h).add(a.clone().multiplyScalar(d)).add(l.clone().multiplyScalar(f)), b = s.clone().multiplyScalar(h).add(a.clone().multiplyScalar(c)).add(l.clone().multiplyScalar(f)), M = s.clone().multiplyScalar(u).add(a.clone().multiplyScalar(c)).add(l.clone().multiplyScalar(f));
   let g = [w, x, b, M], m = oe(new y.Vector3().subVectors(w, x), new y.Vector3(0, 0, 1));
   m && m.parallel && (g = [w, M, b, x]);
   let p = 0;
   if (o.length > 0) {
-    const z = new y.Vector3().subVectors(g[1], g[0]).normalize(), S = z.clone().negate(), v = new y.Vector3().subVectors(g[3], g[0]).normalize(), V = v.clone().negate();
+    const V = new y.Vector3().subVectors(g[1], g[0]).normalize(), v = V.clone().negate(), S = new y.Vector3().subVectors(g[3], g[0]).normalize(), z = S.clone().negate();
     let D = g[0].distanceTo(g[1]), _ = g[0].distanceTo(g[3]), E = D / t, T = _ / e, A = 1e-3;
     for (let O = 0; O < E; O++) {
       let I = g[0], B = 0;
       for (let R = 0; R < T; R++) {
-        let N = I.clone().addScaledVector(z, t), C = N.clone().addScaledVector(v, e), L = I.clone().addScaledVector(v, e), $ = new y.Vector3().add(I).add(N).add(C).add(L).multiplyScalar(0.25);
+        let N = I.clone().addScaledVector(V, t), C = N.clone().addScaledVector(S, e), L = I.clone().addScaledVector(S, e), $ = new y.Vector3().add(I).add(N).add(C).add(L).multiplyScalar(0.25);
         for (let X = 0; X < r.length; X++)
           if (r[X].distanceTo($) < A) {
             B++;
@@ -194,13 +194,13 @@ const oe = (n, t, e = 0.01) => {
       }
       if (B >= T / 2)
         break;
-      p += B, g[0] = g[0].addScaledVector(z, t), g[3] = g[3].addScaledVector(z, t);
+      p += B, g[0] = g[0].addScaledVector(V, t), g[3] = g[3].addScaledVector(V, t);
     }
     D = g[0].distanceTo(g[1]), E = D / t;
     for (let O = 0; O < E; O++) {
       let I = g[1], B = 0;
       for (let R = 0; R < T; R++) {
-        let N = I.clone().addScaledVector(S, t), C = N.clone().addScaledVector(v, e), L = I.clone().addScaledVector(v, e), $ = new y.Vector3().add(I).add(N).add(C).add(L).multiplyScalar(0.25);
+        let N = I.clone().addScaledVector(v, t), C = N.clone().addScaledVector(S, e), L = I.clone().addScaledVector(S, e), $ = new y.Vector3().add(I).add(N).add(C).add(L).multiplyScalar(0.25);
         for (let X = 0; X < r.length; X++)
           if (r[X].distanceTo($) < A) {
             B++;
@@ -210,13 +210,13 @@ const oe = (n, t, e = 0.01) => {
       }
       if (B >= T / 2)
         break;
-      p += B, g[1] = g[1].addScaledVector(S, t), g[2] = g[2].addScaledVector(S, t);
+      p += B, g[1] = g[1].addScaledVector(v, t), g[2] = g[2].addScaledVector(v, t);
     }
     D = g[0].distanceTo(g[1]), E = D / t;
     for (let O = 0; O < T; O++) {
       let I = g[3], B = 0;
       for (let R = 0; R < E; R++) {
-        let N = I.clone().addScaledVector(z, t), C = N.clone().addScaledVector(V, e), L = I.clone().addScaledVector(V, e), $ = new y.Vector3().add(I).add(N).add(C).add(L).multiplyScalar(0.25);
+        let N = I.clone().addScaledVector(V, t), C = N.clone().addScaledVector(z, e), L = I.clone().addScaledVector(z, e), $ = new y.Vector3().add(I).add(N).add(C).add(L).multiplyScalar(0.25);
         for (let X = 0; X < r.length; X++)
           if (r[X].distanceTo($) < A) {
             B++;
@@ -226,7 +226,7 @@ const oe = (n, t, e = 0.01) => {
       }
       if (B >= E / 2)
         break;
-      p += B, g[2] = g[2].addScaledVector(V, e), g[3] = g[3].addScaledVector(V, e);
+      p += B, g[2] = g[2].addScaledVector(z, e), g[3] = g[3].addScaledVector(z, e);
     }
   }
   const P = g[0].distanceTo(g[1]) * g[0].distanceTo(g[3]);
@@ -298,7 +298,7 @@ const oe = (n, t, e = 0.01) => {
       closestDistance: null
     };
   f < 0 && c.negate();
-  const b = new y.Vector3().addVectors(d, c).normalize(), M = new y.Vector3().addVectors(n, t).multiplyScalar(0.5), g = Je(e, M, d), m = Je(o, M, d), p = (g + m) / 2, P = Math.max(g, m), z = n.dot(b), S = t.dot(b), v = e.dot(b), V = o.dot(b), D = Math.min(z, S), _ = Math.max(z, S), E = Math.min(v, V), T = Math.max(v, V), A = _ - D, O = T - E, I = Math.min(A, O), B = Math.min(_, T) - Math.max(D, E), R = B < 0 ? -B : 0, N = B > 0 ? B : 0, C = I > 0 ? N / I : 0, L = uo(
+  const b = new y.Vector3().addVectors(d, c).normalize(), M = new y.Vector3().addVectors(n, t).multiplyScalar(0.5), g = Je(e, M, d), m = Je(o, M, d), p = (g + m) / 2, P = Math.max(g, m), V = n.dot(b), v = t.dot(b), S = e.dot(b), z = o.dot(b), D = Math.min(V, v), _ = Math.max(V, v), E = Math.min(S, z), T = Math.max(S, z), A = _ - D, O = T - E, I = Math.min(A, O), B = Math.min(_, T) - Math.max(D, E), R = B < 0 ? -B : 0, N = B > 0 ? B : 0, C = I > 0 ? N / I : 0, L = uo(
     n,
     t,
     e,
@@ -353,7 +353,7 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
       break;
     }
   return { minZ: c, maxZ: f };
-}, ze = (n, t, e) => {
+}, Ve = (n, t, e) => {
   let o = new y.Plane();
   const i = new y.Vector3(n.x, n.y, n.z), r = new y.Vector3(t.x, t.y, t.z), s = new y.Vector3(t.x, t.y, t.z + 5);
   o.setFromCoplanarPoints(i, r, s);
@@ -379,10 +379,10 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
           for (let P = 0; P < h.checkResults[m].allCenterPoints.length; P++) {
             if (c.has(m) && c.get(m).removePtsIndex.includes(P))
               continue;
-            let z = h.checkResults[m].allCenterPoints[P];
-            z = new y.Vector3(z.x, z.y, z.z);
-            let S = d.closestPointToPoint(z, !0, f), v = z.distanceTo(S);
-            Math.abs(v - s) < 0.01 && (g++, M.has(m) ? M.get(m).removePtsIndex.push(P) : M.set(m, {
+            let V = h.checkResults[m].allCenterPoints[P];
+            V = new y.Vector3(V.x, V.y, V.z);
+            let v = d.closestPointToPoint(V, !0, f), S = V.distanceTo(v);
+            Math.abs(S - s) < 0.01 && (g++, M.has(m) ? M.get(m).removePtsIndex.push(P) : M.set(m, {
               index: m,
               removePtsIndex: [P]
             }));
@@ -417,10 +417,10 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
     if (!o.checkResults || o.checkResults.length <= 0)
       continue;
     if (o.checkResults[0].originalVertices && o.checkResults[0].originalVertices.length > 0) {
-      const v = o.checkResults[0].originalVertices[0];
-      let [V, D, _, E] = v;
-      V = new y.Vector3(V.x, V.y, V.z), D = new y.Vector3(D.x, D.y, D.z), _ = new y.Vector3(_.x, _.y, _.z), E = new y.Vector3(E.x, E.y, E.z), i = V.distanceTo(D), r = V.distanceTo(E);
-      let T = new y.Vector3().subVectors(V, D).normalize(), A = oe(T, new y.Vector3(0, 0, 1));
+      const S = o.checkResults[0].originalVertices[0];
+      let [z, D, _, E] = S;
+      z = new y.Vector3(z.x, z.y, z.z), D = new y.Vector3(D.x, D.y, D.z), _ = new y.Vector3(_.x, _.y, _.z), E = new y.Vector3(E.x, E.y, E.z), i = z.distanceTo(D), r = z.distanceTo(E);
+      let T = new y.Vector3().subVectors(z, D).normalize(), A = oe(T, new y.Vector3(0, 0, 1));
       A && A.parallel && ([r, i] = [i, r]);
     }
     if (i < 0 || r < 0)
@@ -429,15 +429,15 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
     const l = s.distanceTo(a), u = o.rooftopPz - o.start.z, h = Math.ceil(l / i), d = Math.ceil(u / r);
     let c = s.clone(), f = a.clone(), w = f.clone().add(new y.Vector3(0, 0, u)), x = c.clone().add(new y.Vector3(0, 0, u)), b = new y.Vector3().subVectors(f, c).normalize(), M = b.clone().negate();
     new y.Vector3().subVectors(w, c).normalize().clone().negate();
-    let m = i / 2, p = l * u, P = i * r, z = p / P;
-    t(c, x, b, i, m, d, h, z, o), t(f, w, M, i, m, d, h, z, o), o.start = c, o.end = f;
-    const { newOriginalPoints: S } = ze(c, f, o.originalPoints);
-    o.originalPoints = S;
+    let m = i / 2, p = l * u, P = i * r, V = p / P;
+    t(c, x, b, i, m, d, h, V, o), t(f, w, M, i, m, d, h, V, o), o.start = c, o.end = f;
+    const { newOriginalPoints: v } = Ve(c, f, o.originalPoints);
+    o.originalPoints = v;
   }
 }, Rt = (n, t) => new y.Vector3(n.x, n.y, 0).distanceTo(new y.Vector3(t.x, t.y, 0)), mo = (n, t, e = 1e-6) => {
   const o = new y.Vector3();
   return n.closestPointToPoint(t, !0, o), o.distanceTo(t) < e;
-}, ve = (n) => {
+}, Se = (n) => {
   let t = 0, e = [];
   for (let o = 0; o < n.length; o++)
     for (let i = o + 1; i < n.length; i++) {
@@ -560,18 +560,18 @@ class yo {
     for (let g = 0; g < e; g++)
       for (let m = 0; m < o; m++)
         try {
-          const p = new y.Vector3().copy(a).add(b.clone().multiplyScalar(m * w)).add(M.clone().multiplyScalar(g * x)), P = new y.Vector3().copy(a).add(b.clone().multiplyScalar((m + 1) * w)).add(M.clone().multiplyScalar(g * x)), z = new y.Vector3().copy(a).add(b.clone().multiplyScalar((m + 1) * w)).add(M.clone().multiplyScalar((g + 1) * x)), S = new y.Vector3().copy(a).add(b.clone().multiplyScalar(m * w)).add(M.clone().multiplyScalar((g + 1) * x)), v = {
-            points: [p, P, z, S],
+          const p = new y.Vector3().copy(a).add(b.clone().multiplyScalar(m * w)).add(M.clone().multiplyScalar(g * x)), P = new y.Vector3().copy(a).add(b.clone().multiplyScalar((m + 1) * w)).add(M.clone().multiplyScalar(g * x)), V = new y.Vector3().copy(a).add(b.clone().multiplyScalar((m + 1) * w)).add(M.clone().multiplyScalar((g + 1) * x)), v = new y.Vector3().copy(a).add(b.clone().multiplyScalar(m * w)).add(M.clone().multiplyScalar((g + 1) * x)), S = {
+            points: [p, P, V, v],
             userData: {}
           };
-          v.userData = {
+          S.userData = {
             type: "wallSegment",
             row: g,
             col: m,
             originalMaterial: i,
             width: w,
             height: x
-          }, s.push(v);
+          }, s.push(S);
         } catch (p) {
           console.error(`创建墙体小平面(${g}, ${m})时出错:`, p);
         }
@@ -1046,10 +1046,10 @@ class yo {
           const [M, g] = b.shift(), m = `row${M}_col${g}`;
           r.has(m) && x.push(r.get(m));
           for (const [p, P] of l) {
-            const z = M + p, S = g + P;
-            if (s.has(z) && s.get(z).has(S)) {
-              const v = s.get(z).get(S);
-              !v.visited && v.isEmpty && (v.visited = !0, b.push([z, S]));
+            const V = M + p, v = g + P;
+            if (s.has(V) && s.get(V).has(v)) {
+              const S = s.get(V).get(v);
+              !S.visited && S.isEmpty && (S.visited = !0, b.push([V, v]));
             }
           }
         }
@@ -1225,12 +1225,12 @@ const xo = (n) => {
     o.push(...r.vertices), i.push(r.center), e.push(r.vertices);
   }), t.originalVertices = e, t.allCenterPoints = i, t;
 }, wo = (n) => {
-  const t = new zt().copy(n.start).add(n.end).multiplyScalar(0.5), e = new zt().subVectors(
-    new zt(t.x, t.y, t.z + 1),
+  const t = new Vt().copy(n.start).add(n.end).multiplyScalar(0.5), e = new Vt().subVectors(
+    new Vt(t.x, t.y, t.z + 1),
     t
-  ).normalize(), o = new zt(n.direction.x, n.direction.y, 0);
+  ).normalize(), o = new Vt(n.direction.x, n.direction.y, 0);
   o.applyAxisAngle(e, Math.PI / 2);
-  const i = new zt().copy(t).add(o.clone().multiplyScalar(n.length)), r = new zt().copy(t).sub(o.clone().multiplyScalar(n.length));
+  const i = new Vt().copy(t).add(o.clone().multiplyScalar(n.length)), r = new Vt().copy(t).sub(o.clone().multiplyScalar(n.length));
   return t.z = n.start.z, i.z = n.start.z, r.z = n.start.z, { start: i, end: r, center: t, direction: o };
 }, yi = (n, t, e = !0) => {
   let o = [];
@@ -1243,12 +1243,12 @@ const xo = (n) => {
     s.applyEuler(new y.Euler(-Math.PI / 2, 0, 0));
     let a = new y.Vector3(r.end.x, r.end.y, r.end.z);
     if (a.applyEuler(new y.Euler(-Math.PI / 2, 0, 0)), t.add(ao(String(i), new y.Vector3((s.x + a.x) / 2, (s.y + a.y) / 2, (s.z + a.z) / 2))), (r.isBayWindow || r.isWindow) && e) continue;
-    const l = new no().setFromCoplanarPoints(new zt(r.start.x, r.start.y, r.start.z), new zt(r.end.x, r.end.y, r.end.z), new zt(r.start.x, r.start.y, r.rooftopPz)), u = [];
-    r.originalPoints.forEach((S, v) => {
-      const V = new zt();
-      l.projectPoint(S, V), u.push(V);
+    const l = new no().setFromCoplanarPoints(new Vt(r.start.x, r.start.y, r.start.z), new Vt(r.end.x, r.end.y, r.end.z), new Vt(r.start.x, r.start.y, r.rooftopPz)), u = [];
+    r.originalPoints.forEach((v, S) => {
+      const z = new Vt();
+      l.projectPoint(v, z), u.push(z);
     });
-    const h = new zt(r.start.x, r.start.y, r.start.z).distanceTo(new zt(r.end.x, r.end.y, r.end.z)), d = Math.abs(r.rooftopPz - r.start.z), c = new y.MeshBasicMaterial({
+    const h = new Vt(r.start.x, r.start.y, r.start.z).distanceTo(new Vt(r.end.x, r.end.y, r.end.z)), d = Math.abs(r.rooftopPz - r.start.z), c = new y.MeshBasicMaterial({
       color: "red",
       side: y.DoubleSide,
       wireframe: !1,
@@ -1262,12 +1262,12 @@ const xo = (n) => {
       opacity: 0.8,
       side: y.DoubleSide
     }), m = w.highlightEmptySegments(M, g, f), p = [];
-    for (const S of m.clusters) {
-      const v = xo(S);
-      v && p.push(v);
+    for (const v of m.clusters) {
+      const S = xo(v);
+      S && p.push(S);
     }
-    const z = wo(r).direction;
-    r.checkResults = p, r.verticalDirection = z, r.originaIndex = i, o.push(r);
+    const V = wo(r).direction;
+    r.checkResults = p, r.verticalDirection = V, r.originaIndex = i, o.push(r);
   }
   return o;
 }, xi = (n, t) => {
@@ -1276,8 +1276,8 @@ const xo = (n) => {
     const o = n[e], i = [];
     o.originalPoints.forEach((m) => {
       let p = new y.Vector3(m.x, m.y, 0), P = !1;
-      for (let z = 0; z < i.length; z++)
-        if (kt(p, i[z], 0.01)) {
+      for (let V = 0; V < i.length; V++)
+        if (kt(p, i[V], 0.01)) {
           P = !0;
           break;
         }
@@ -1292,8 +1292,8 @@ const xo = (n) => {
       const p = [];
       p.push(a.clone().addScaledVector(h, s)), p.push(p[0].clone().addScaledVector(u, w)), p.push(p[1].clone().addScaledVector(d, s * 2)), p.push(a.clone().addScaledVector(d, w));
       let P = [];
-      for (let z = 0; z < i.length; z++)
-        c.includes(z) || Po(i[z], p) && (c.push(z), P.push(i[z]));
+      for (let V = 0; V < i.length; V++)
+        c.includes(V) || Po(i[V], p) && (c.push(V), P.push(i[V]));
       P.length > 0 && f.push(Mo(P)), a = a.addScaledVector(u, w);
     }
     const x = new Float32Array(i.length * 3);
@@ -1302,7 +1302,7 @@ const xo = (n) => {
     });
     const b = new y.BufferGeometry();
     b.setAttribute("position", new y.BufferAttribute(x, 3)), b.rotateX(-Math.PI / 2), t.add(new y.Points(b, new y.PointsMaterial({ color: go(), size: 0.02 })));
-    const [M, g] = So(f, {
+    const [M, g] = vo(f, {
       plane: "xy",
       trimRatio: 0
     });
@@ -1342,11 +1342,11 @@ function Mo(n) {
     Array.isArray(e) ? (t.x += e[0], t.y += e[1], t.z += e[2]) : (t.x += e.x, t.y += e.y, t.z += e.z);
   return t.divideScalar(n.length), t;
 }
-function zo(n) {
+function Vo(n) {
   return n instanceof y.Vector3 ? n.clone() : Array.isArray(n) ? new y.Vector3(n[0], n[1], n[2]) : new y.Vector3(n.x, n.y, n.z);
 }
-function Vo(n, t = "xy") {
-  const e = zo(n);
+function zo(n, t = "xy") {
+  const e = Vo(n);
   if (t === "xy")
     return {
       x: e.x,
@@ -1376,7 +1376,7 @@ function nn(n, t, e, o = "xy") {
     return new y.Vector3(e, n, t);
   throw new Error(`Unsupported plane: ${o}`);
 }
-function vo(n, t, e) {
+function So(n, t, e) {
   if (Math.abs(t) < 1e-12)
     return n >= e ? { x: 1, y: 0 } : { x: 0, y: 1 };
   const i = n + e, r = n * e - t * t, s = Math.sqrt(Math.max(0, i * i * 0.25 - r)), a = i * 0.5 + s;
@@ -1387,7 +1387,7 @@ function vo(n, t, e) {
     y: u / h
   };
 }
-function So(n, t = {}) {
+function vo(n, t = {}) {
   const {
     plane: e = "xy",
     // 0 表示完全取最远两端
@@ -1396,7 +1396,7 @@ function So(n, t = {}) {
   } = t;
   if (!n || n.length < 2)
     return null;
-  const i = n.map((B) => Vo(B, e));
+  const i = n.map((B) => zo(B, e));
   let r = 0, s = 0, a = 0;
   for (const B of i)
     r += B.x, s += B.y, a += B.up;
@@ -1407,7 +1407,7 @@ function So(n, t = {}) {
     l += R * R, u += R * N, h += N * N;
   }
   l /= i.length, u /= i.length, h /= i.length;
-  const d = vo(l, u, h), c = {
+  const d = So(l, u, h), c = {
     x: -d.y,
     y: d.x
   }, f = [];
@@ -1429,7 +1429,7 @@ function So(n, t = {}) {
   })(), p = (() => {
     const B = f.map((N) => N.up).sort((N, C) => N - C), R = Math.floor(B.length / 2);
     return B.length % 2 === 0 ? (B[R - 1] + B[R]) * 0.5 : B[R];
-  })(), P = M.s, z = g.s, S = m, v = m, V = p, D = p, _ = r + d.x * P + c.x * S, E = s + d.y * P + c.y * S, T = r + d.x * z + c.x * v, A = s + d.y * z + c.y * v, O = nn(_, E, V, e), I = nn(T, A, D, e);
+  })(), P = M.s, V = g.s, v = m, S = m, z = p, D = p, _ = r + d.x * P + c.x * v, E = s + d.y * P + c.y * v, T = r + d.x * V + c.x * S, A = s + d.y * V + c.y * S, O = nn(_, E, z, e), I = nn(T, A, D, e);
   return [O, I];
 }
 const wi = async (n, t, e, o, i) => {
@@ -1446,32 +1446,32 @@ const wi = async (n, t, e, o, i) => {
     if (!(!m.checkResults || m.checkResults.length <= 0)) {
       for (let P = 0; P < m.checkResults.length; P++) {
         let D = function(A) {
-          for (; V[A] !== A; )
-            V[A] = V[V[A]], A = V[A];
+          for (; z[A] !== A; )
+            z[A] = z[z[A]], A = z[A];
           return A;
         };
-        const z = m.checkResults[P];
-        if (z.isDoor = !1, !z.originalVertices || z.originalVertices.length == 0)
+        const V = m.checkResults[P];
+        if (V.isDoor = !1, !V.originalVertices || V.originalVertices.length == 0)
           continue;
-        const S = [];
-        z.originalVertices.forEach((A) => {
+        const v = [];
+        V.originalVertices.forEach((A) => {
           let O = [];
           A.forEach((I) => {
             O.push(new y.Vector3(I.x, I.y, I.z));
-          }), S.push(O);
+          }), v.push(O);
         });
-        const v = S.length, V = Array.from({ length: v }, (A, O) => O);
-        for (let A = 0; A < v; A++)
-          for (let O = A + 1; O < v; O++) {
-            const I = S[A], B = S[O];
+        const S = v.length, z = Array.from({ length: S }, (A, O) => O);
+        for (let A = 0; A < S; A++)
+          for (let O = A + 1; O < S; O++) {
+            const I = v[A], B = v[O];
             if (I.some((N) => B.some((C) => N.equals(C)))) {
               const N = D(A), C = D(O);
-              N !== C && (V[N] = C);
+              N !== C && (z[N] = C);
             }
           }
         const _ = /* @__PURE__ */ new Map();
         let E = -1, T = -1;
-        for (let A = 0; A < v; A++) {
+        for (let A = 0; A < S; A++) {
           const O = D(A);
           _.has(O) || _.set(O, {
             points: [],
@@ -1483,9 +1483,9 @@ const wi = async (n, t, e, o, i) => {
             centerPts: []
           });
           const I = _.get(O);
-          let [B, R, N, C] = S[A];
+          let [B, R, N, C] = v[A];
           const L = new y.Vector3().add(B).add(R).add(N).add(C).multiplyScalar(0.25);
-          if (I.points.push(...S[A]), I.area += B.distanceTo(R) * B.distanceTo(C), I.originalVertices.push(S[A]), I.index = P, I.centerPts.push(L), E == -1 || T == -1) {
+          if (I.points.push(...v[A]), I.area += B.distanceTo(R) * B.distanceTo(C), I.originalVertices.push(v[A]), I.index = P, I.centerPts.push(L), E == -1 || T == -1) {
             let $ = new y.Vector3().subVectors(B, R).normalize();
             T = B.distanceTo(C), E = B.distanceTo(R);
             let X = oe($, new y.Vector3(0, 0, 1));
@@ -1522,12 +1522,12 @@ const wi = async (n, t, e, o, i) => {
       p.coordinatesByArea.coordinates.forEach((D) => {
         P.push(new y.Vector3(D.x, D.y, D.z));
       }), P[0].equals(P[P.length - 1]) && P.pop();
-      let z = P[0].distanceTo(P[1]), S = P[0].distanceTo(P[3]);
-      S > z && ([z, S] = [S, z], P = [P[0], P[3], P[2], P[1]]);
-      let v = ee(P[0], P[3], !0), V = ee(P[1], P[2], !0);
+      let V = P[0].distanceTo(P[1]), v = P[0].distanceTo(P[3]);
+      v > V && ([V, v] = [v, V], P = [P[0], P[3], P[2], P[1]]);
+      let S = ee(P[0], P[3], !0), z = ee(P[1], P[2], !0);
       a.push({
-        doorStartPt: v,
-        doorEndPt: V,
+        doorStartPt: S,
+        doorEndPt: z,
         boxPoints: P,
         minZ: p.coordinatesByArea.heightData.minZ,
         maxZ: p.coordinatesByArea.heightData.maxZ,
@@ -1542,20 +1542,20 @@ const wi = async (n, t, e, o, i) => {
     const p = a[m];
     for (let P = 0; P < n.length; P++) {
       if (n[P].length < 0.5) continue;
-      let z = [];
-      const S = ee(n[P].start, n[P].end, !0);
-      z.push(S), z.push(ee(S, n[P].start, !0)), z.push(ee(S, n[P].end, !0));
-      let v = !1;
-      const V = p.boxPoints.length;
-      for (let D = 0; D < z.length; D++) {
-        const _ = z[D].x, E = z[D].y;
-        for (let T = 0, A = V - 1; T < V; A = T++) {
+      let V = [];
+      const v = ee(n[P].start, n[P].end, !0);
+      V.push(v), V.push(ee(v, n[P].start, !0)), V.push(ee(v, n[P].end, !0));
+      let S = !1;
+      const z = p.boxPoints.length;
+      for (let D = 0; D < V.length; D++) {
+        const _ = V[D].x, E = V[D].y;
+        for (let T = 0, A = z - 1; T < z; A = T++) {
           const O = p.boxPoints[T].x, I = p.boxPoints[T].y, B = p.boxPoints[A].x, R = p.boxPoints[A].y;
-          I > E != R > E && _ < (B - O) * (E - I) / (R - I) + O && (v = !v);
+          I > E != R > E && _ < (B - O) * (E - I) / (R - I) + O && (S = !S);
         }
-        if (v) break;
+        if (S) break;
       }
-      if (v) {
+      if (S) {
         let D = new y.Vector3(n[P].start.x, n[P].start.y, 0), _ = new y.Vector3(n[P].end.x, n[P].end.y, 0), E = p.doorStartPt.distanceTo(p.doorEndPt), T = D.distanceTo(_), A = Jt(p.doorStartPt, p.doorEndPt, D, _);
         if (Math.abs(T - E) < 0.5 && A && A.angleDeg < 15) {
           p.doorStartPt = new y.Vector3(n[P].start.x, n[P].start.y, 0), p.doorEndPt = new y.Vector3(n[P].end.x, n[P].end.y, 0);
@@ -1587,10 +1587,10 @@ const wi = async (n, t, e, o, i) => {
     p.completePointAreaPercentage = -1;
     let P = new y.Box3();
     P.setFromPoints(p.originalPoints);
-    let z = P.max.z;
+    let V = P.max.z;
     P.min.z;
-    const S = new y.Vector3(p.start.x, p.start.y, p.start.z), v = new y.Vector3(p.end.x, p.end.y, p.end.z);
-    let V = p.rooftopPz - p.start.z, D = 0;
+    const v = new y.Vector3(p.start.x, p.start.y, p.start.z), S = new y.Vector3(p.end.x, p.end.y, p.end.z);
+    let z = p.rooftopPz - p.start.z, D = 0;
     for (const E of p.mergeCheckRegion) {
       const { facePoints: T, boxArea: A, totalInPlaneNum: O } = co(
         E.points,
@@ -1633,7 +1633,7 @@ const wi = async (n, t, e, o, i) => {
           lineEd: new y.Vector3(),
           facePoints: []
         };
-        let H = ve(X[rt]);
+        let H = Se(X[rt]);
         Array.isArray(H) && H.length == 2 && (F.lineSt = H[0], F.lineEd = H[1], F.facePoints.push(new y.Vector3(H[0].x, H[0].y, T[0].z)), F.facePoints.push(new y.Vector3(H[1].x, H[1].y, T[0].z)), F.facePoints.push(new y.Vector3(H[1].x, H[1].y, T[2].z)), F.facePoints.push(new y.Vector3(H[0].x, H[0].y, T[2].z)), K.push(F));
       }
       D += E.area;
@@ -1642,15 +1642,15 @@ const wi = async (n, t, e, o, i) => {
         for (let rt = 0; rt < K.length; rt++) {
           const F = K[rt];
           let H = F.facePoints[0].distanceTo(F.facePoints[1]), Mt = F.facePoints[0].distanceTo(F.facePoints[3]), Zt = H / p.length * 100, qt = p.rooftopPz - F.facePoints[2].z;
-          if (Mt < 1.5 || z < F.facePoints[2].z || qt > V / 3 * 2)
+          if (Mt < 1.5 || V < F.facePoints[2].z || qt > z / 3 * 2)
             continue;
           let Lt = !1, _t = !1, Et = !1, Ft = [], tt = F.facePoints[2].clone(), lt = F.facePoints[3].clone(), W = F.facePoints[0].clone(), j = F.facePoints[1].clone(), Nt = !1, Tt = -1;
           if (Math.abs(F.facePoints[0].z - p.start.z) < 0.25) {
             if (H > 0.17 && p.length > 0.5) {
-              let Wt = Rt(S, W), J = Rt(S, j), ct = Rt(v, W), q = Rt(v, j);
-              const bt = 0.1, Vt = 10;
+              let Wt = Rt(v, W), J = Rt(v, j), ct = Rt(S, W), q = Rt(S, j);
+              const bt = 0.1, zt = 10;
               if (Wt < bt || J < bt) {
-                const { newOriginalPoints: Ut } = ze(W, j, p.originalPoints), at = [];
+                const { newOriginalPoints: Ut } = Ve(W, j, p.originalPoints), at = [];
                 if (Ut.forEach((Q) => {
                   Q.z >= tt.z ? at.push(Q) : Q.z <= W.z;
                 }), at.length > 10) {
@@ -1659,9 +1659,9 @@ const wi = async (n, t, e, o, i) => {
                   for (let U = 0; U < n.length; U++) {
                     if (U == m) continue;
                     const it = new y.Vector3(n[U].start.x, n[U].start.y, 0), dt = new y.Vector3(n[U].end.x, n[U].end.y, 0), Ct = te(Q, gt, it, dt);
-                    let vt = re(Q, gt, it, dt);
+                    let St = re(Q, gt, it, dt);
                     if (Ct != null) {
-                      if (vt && vt.angle > 85) {
+                      if (St && St.angle > 85) {
                         let At = Ct.point.distanceTo(Q);
                         if (Ct.point.distanceTo(gt), At < 0.3) {
                           ft = !0, ht = 1 / 0, Z = -1;
@@ -1670,19 +1670,19 @@ const wi = async (n, t, e, o, i) => {
                       }
                       continue;
                     }
-                    if (vt && vt.angle > 85) {
+                    if (St && St.angle > 85) {
                       const Y = new y.Line3(it, dt).closestPointToPoint(Q, !0, Gt);
                       let pt = Jt(Q, gt, Y, Q);
                       if (!pt || pt.direction != "same") continue;
-                      const et = Q.clone().addScaledVector(Pt, Vt), st = gt.clone().addScaledVector(Pt.clone().negate(), Vt);
-                      let xt = new y.Vector3().subVectors(dt, it).normalize(), St = it.clone().addScaledVector(xt.clone().negate(), 0.03), Bt = dt.clone().addScaledVector(xt, 0.03);
-                      const wt = te(et, st, St, Bt);
+                      const et = Q.clone().addScaledVector(Pt, zt), st = gt.clone().addScaledVector(Pt.clone().negate(), zt);
+                      let xt = new y.Vector3().subVectors(dt, it).normalize(), vt = it.clone().addScaledVector(xt.clone().negate(), 0.03), Bt = dt.clone().addScaledVector(xt, 0.03);
+                      const wt = te(et, st, vt, Bt);
                       if (wt == null) continue;
                       let Xt = Q.distanceTo(wt.point);
                       Xt < ht && (ht = Xt, Z = U);
-                    } else if (vt && vt.angle < 5) {
+                    } else if (St && St.angle < 5) {
                       const At = new y.Vector3(W.x, W.y, 0), Y = new y.Vector3(j.x, j.y, 0);
-                      let pt = Rt(At, it), et = Rt(At, dt), st = Rt(Y, it), xt = Rt(Y, dt), St = Jt(Q, gt, it, At), Bt = !1;
+                      let pt = Rt(At, it), et = Rt(At, dt), st = Rt(Y, it), xt = Rt(Y, dt), vt = Jt(Q, gt, it, At), Bt = !1;
                       for (let wt = 0; wt < n[U].checkResults.length; wt++) {
                         let Xt = [];
                         for (let Kt = 0; Kt < n[U].checkResults[wt].allCenterPoints.length; Kt++)
@@ -1691,7 +1691,7 @@ const wi = async (n, t, e, o, i) => {
                             n[U].checkResults[wt].allCenterPoints[Kt].y,
                             0
                           ));
-                        let $t = ve(Xt);
+                        let $t = Se(Xt);
                         if ($t.length == 2) {
                           let Kt = Rt(At, $t[0]), Re = Rt(At, $t[1]), Le = Rt(Y, $t[0]), Fe = Rt(Y, $t[1]);
                           if (Kt < 0.2 || Re < 0.2 || Le < 0.2 || Fe < 0.2) {
@@ -1700,7 +1700,7 @@ const wi = async (n, t, e, o, i) => {
                           }
                         }
                       }
-                      if (St && St.direction == "same" && !Bt && (pt < 0.1 || et < 0.1 || st < 0.1 || xt < 0.1)) {
+                      if (vt && vt.direction == "same" && !Bt && (pt < 0.1 || et < 0.1 || st < 0.1 || xt < 0.1)) {
                         k = !0, ht = 1 / 0, Z = -1;
                         break;
                       }
@@ -1718,7 +1718,7 @@ const wi = async (n, t, e, o, i) => {
                   continue;
               }
               if (ct < bt || q < bt) {
-                const { newOriginalPoints: Ut } = ze(W, j, p.originalPoints), at = [];
+                const { newOriginalPoints: Ut } = Ve(W, j, p.originalPoints), at = [];
                 if (Ut.forEach((Q) => {
                   Q.z >= tt.z ? at.push(Q) : Q.z <= W.z;
                 }), at.length > 10) {
@@ -1727,27 +1727,27 @@ const wi = async (n, t, e, o, i) => {
                   for (let U = 0; U < n.length; U++) {
                     if (U == m) continue;
                     const it = new y.Vector3(n[U].start.x, n[U].start.y, 0), dt = new y.Vector3(n[U].end.x, n[U].end.y, 0), Ct = te(Q, gt, it, dt);
-                    let vt = re(Q, gt, it, dt);
+                    let St = re(Q, gt, it, dt);
                     if (Ct != null) {
-                      if (vt && vt.angle > 85 && (Ct.point.distanceTo(Q), Ct.point.distanceTo(gt) < 0.3)) {
+                      if (St && St.angle > 85 && (Ct.point.distanceTo(Q), Ct.point.distanceTo(gt) < 0.3)) {
                         ft = !0, ht = 1 / 0, Z = -1;
                         break;
                       }
                       continue;
                     }
-                    if (vt && vt.angle > 85) {
+                    if (St && St.angle > 85) {
                       const Y = new y.Line3(it, dt).closestPointToPoint(gt, !0, Gt);
                       let pt = Jt(gt, Q, Y, gt);
                       if (!pt || pt.direction != "same") continue;
-                      const et = Q.clone().addScaledVector(Pt.clone().negate(), Vt), st = gt.clone().addScaledVector(Pt, Vt);
-                      let xt = new y.Vector3().subVectors(dt, it).normalize(), St = it.clone().addScaledVector(xt.clone().negate(), 0.03), Bt = dt.clone().addScaledVector(xt, 0.03);
-                      const wt = te(et, st, St, Bt);
+                      const et = Q.clone().addScaledVector(Pt.clone().negate(), zt), st = gt.clone().addScaledVector(Pt, zt);
+                      let xt = new y.Vector3().subVectors(dt, it).normalize(), vt = it.clone().addScaledVector(xt.clone().negate(), 0.03), Bt = dt.clone().addScaledVector(xt, 0.03);
+                      const wt = te(et, st, vt, Bt);
                       if (wt == null) continue;
                       let Xt = gt.distanceTo(wt.point);
                       Xt < ht && (ht = Xt, Z = U);
-                    } else if (vt && vt.angle < 5) {
+                    } else if (St && St.angle < 5) {
                       const At = new y.Vector3(W.x, W.y, 0), Y = new y.Vector3(j.x, j.y, 0);
-                      let pt = Rt(At, it), et = Rt(At, dt), st = Rt(Y, it), xt = Rt(Y, dt), St = Jt(gt, Q, it, At), Bt = !1;
+                      let pt = Rt(At, it), et = Rt(At, dt), st = Rt(Y, it), xt = Rt(Y, dt), vt = Jt(gt, Q, it, At), Bt = !1;
                       for (let wt = 0; wt < n[U].checkResults.length; wt++) {
                         let Xt = [];
                         for (let Kt = 0; Kt < n[U].checkResults[wt].allCenterPoints.length; Kt++)
@@ -1756,7 +1756,7 @@ const wi = async (n, t, e, o, i) => {
                             n[U].checkResults[wt].allCenterPoints[Kt].y,
                             0
                           ));
-                        let $t = ve(Xt);
+                        let $t = Se(Xt);
                         if ($t.length == 2) {
                           let Kt = Rt(At, $t[0]), Re = Rt(At, $t[1]), Le = Rt(Y, $t[0]), Fe = Rt(Y, $t[1]);
                           if (Kt < 0.2 || Re < 0.2 || Le < 0.2 || Fe < 0.2) {
@@ -1765,7 +1765,7 @@ const wi = async (n, t, e, o, i) => {
                           }
                         }
                       }
-                      if (St && St.direction == "same" && !Bt && (pt < 0.1 || et < 0.1 || st < 0.1 || xt < 0.1)) {
+                      if (vt && vt.direction == "same" && !Bt && (pt < 0.1 || et < 0.1 || st < 0.1 || xt < 0.1)) {
                         k = !0, ht = 1 / 0, Z = -1;
                         break;
                       }
@@ -1784,7 +1784,7 @@ const wi = async (n, t, e, o, i) => {
               }
               H = lt.distanceTo(tt);
             }
-            if (Zt < 85 && H > 0.3 || H > 0.7 && Mt > V - V / 3) {
+            if (Zt < 85 && H > 0.3 || H > 0.7 && Mt > z - z / 3) {
               let Wt = !1;
               for (let J = 0; J < t.length; J++) {
                 let ct = J + 1;
@@ -1803,29 +1803,29 @@ const wi = async (n, t, e, o, i) => {
                 }
               }
               for (let J = 0; J < a.length; J++) {
-                let ct = new y.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), q = new y.Vector3(a[J].doorEndPt.x, a[J].doorEndPt.y, 0), bt = new y.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0), Vt = new y.Vector3(F.facePoints[1].x, F.facePoints[1].y, 0), Ut = F.facePoints[2].z < a[J].maxZ || Math.abs(F.facePoints[2].z - a[J].maxZ) < 0.3;
+                let ct = new y.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), q = new y.Vector3(a[J].doorEndPt.x, a[J].doorEndPt.y, 0), bt = new y.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0), zt = new y.Vector3(F.facePoints[1].x, F.facePoints[1].y, 0), Ut = F.facePoints[2].z < a[J].maxZ || Math.abs(F.facePoints[2].z - a[J].maxZ) < 0.3;
                 if (Math.abs(F.facePoints[2].z - a[J].maxZ) > 0.2, Ut) {
-                  let at = ne(ct.clone(), q.clone(), bt.clone(), Vt.clone(), {
+                  let at = ne(ct.clone(), q.clone(), bt.clone(), zt.clone(), {
                     distanceThreshold: 2
                   });
                   if (at && at.type == "collinear_gap") {
                     let Q = ee(ct, q), gt = new y.Line3(new y.Vector3(p.start.x, p.start.y, 0), new y.Vector3(p.end.x, p.end.y, 0)), Pt = new y.Vector3(), Gt = gt.closestPointToPoint(Q, !0, Pt);
                     if (Q.distanceTo(Gt) < 0.15) {
-                      let Z = bt.distanceTo(ct), k = Vt.distanceTo(ct);
+                      let Z = bt.distanceTo(ct), k = zt.distanceTo(ct);
                       if (Z > 0.25 && k > 0.25) {
-                        let it = bt.distanceTo(q), dt = Vt.distanceTo(q);
+                        let it = bt.distanceTo(q), dt = zt.distanceTo(q);
                         if (it > 0.2 && dt > 0.2)
                           continue;
                       }
                       _t = !0, Et = !0, Ft.push(a[J].index), a[J].isFind = !0, Tt = J, e[a[J].index].isFindBeam = !0;
-                      let ft = new y.Vector3().subVectors(bt, Vt).normalize(), U = ct.distanceTo(q) - at.overlap;
+                      let ft = new y.Vector3().subVectors(bt, zt).normalize(), U = ct.distanceTo(q) - at.overlap;
                       k < Z && ft.negate(), Z > k ? (tt = F.facePoints[2].clone().addScaledVector(ft, U), lt = F.facePoints[3].clone(), W = lt.clone(), j = tt.clone(), W.z = j.z = F.facePoints[0].z) : (tt = F.facePoints[2].clone(), lt = F.facePoints[3].clone().addScaledVector(ft, U), W = lt.clone(), j = tt.clone(), W.z = j.z = F.facePoints[0].z);
                     }
                   } else if (at && at.type == "collinear_overlap" && at.maxPerpendicularDistance < 0.35) {
-                    let Q = bt.distanceTo(Vt), gt = q.distanceTo(ct);
+                    let Q = bt.distanceTo(zt), gt = q.distanceTo(ct);
                     if (Math.abs(Q - at.overlap) < 0.25 || Math.abs(gt - at.overlap) < 0.25) {
                       if (gt > Q && Math.abs(gt - at.overlap) > 1) {
-                        let Pt = bt.distanceTo(ct), Gt = bt.distanceTo(q), ht = Vt.distanceTo(ct), Z = Vt.distanceTo(q), k = Pt < Gt ? Pt : Gt, ft = ht < Z ? ht : Z, U = new y.Vector3().subVectors(bt, Vt).normalize(), it = gt - at.overlap;
+                        let Pt = bt.distanceTo(ct), Gt = bt.distanceTo(q), ht = zt.distanceTo(ct), Z = zt.distanceTo(q), k = Pt < Gt ? Pt : Gt, ft = ht < Z ? ht : Z, U = new y.Vector3().subVectors(bt, zt).normalize(), it = gt - at.overlap;
                         k < ft ? (U.negate(), tt = F.facePoints[2].clone().addScaledVector(U, it), lt = F.facePoints[3].clone(), W = lt.clone(), j = tt.clone(), W.z = j.z = F.facePoints[0].z) : (tt = F.facePoints[2].clone(), lt = F.facePoints[3].clone().addScaledVector(U, it), W = lt.clone(), j = tt.clone(), W.z = j.z = F.facePoints[0].z);
                       }
                       _t = !0, Et = !0, Ft.push(a[J].index), a[J].isFind = !0, e[a[J].index].isFindBeam = !0, Tt = J;
@@ -1836,10 +1836,10 @@ const wi = async (n, t, e, o, i) => {
               if (!Et && H < 1.5)
                 for (let J = 0; J < a.length; J++) {
                   if (a[J].inWall) continue;
-                  let ct = new y.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), q = new y.Vector3(a[J].doorEndPt.x, a[J].doorEndPt.y, 0), bt = new y.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0), Vt = new y.Vector3(F.facePoints[1].x, F.facePoints[1].y, 0), Ut = new y.Vector3().subVectors(ct, q).normalize(), at = new y.Vector3().subVectors(bt, Vt).normalize(), Q = 0.25, gt = ct.clone().addScaledVector(Ut, Q), Pt = q.clone().addScaledVector(Ut.clone().negate(), Q), Gt = bt.clone().addScaledVector(at, Q), ht = Vt.clone().addScaledVector(at.clone().negate(), Q), Z = te(gt, Pt, Gt, ht), k = !0, ft = ct.distanceTo(bt), U = ct.distanceTo(Vt), it = q.distanceTo(bt), dt = q.distanceTo(Vt);
+                  let ct = new y.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), q = new y.Vector3(a[J].doorEndPt.x, a[J].doorEndPt.y, 0), bt = new y.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0), zt = new y.Vector3(F.facePoints[1].x, F.facePoints[1].y, 0), Ut = new y.Vector3().subVectors(ct, q).normalize(), at = new y.Vector3().subVectors(bt, zt).normalize(), Q = 0.25, gt = ct.clone().addScaledVector(Ut, Q), Pt = q.clone().addScaledVector(Ut.clone().negate(), Q), Gt = bt.clone().addScaledVector(at, Q), ht = zt.clone().addScaledVector(at.clone().negate(), Q), Z = te(gt, Pt, Gt, ht), k = !0, ft = ct.distanceTo(bt), U = ct.distanceTo(zt), it = q.distanceTo(bt), dt = q.distanceTo(zt);
                   (ft < f || U < f || it < f || dt < f || Z) && k && (e[a[J].index].isFindBeam = !0, _t = !0, a[J].isFind = !0, Tt = J);
                 }
-              (_t || Wt || Math.abs(Mt - V) > 0.1 && Mt > V / 2 && H > 0.3) && (Lt = !0);
+              (_t || Wt || Math.abs(Mt - z) > 0.1 && Mt > z / 2 && H > 0.3) && (Lt = !0);
             }
           }
           if (Lt) {
@@ -1862,19 +1862,19 @@ const wi = async (n, t, e, o, i) => {
             {
               new y.PointsMaterial({ color: 65535, size: 0.01 });
               let Z = new y.Vector3().subVectors(W, j), k = new y.Vector3().subVectors(j, W), ft = 1 / 0, U = 1 / 0, it = W.clone(), dt = j.clone();
-              const Ct = [], vt = [];
+              const Ct = [], St = [];
               let At = new y.Line3(tt, lt), Y = new y.Vector3(), pt = 999999;
               if (p.originalPoints.forEach((et) => {
                 if (et.z - W.z < Mt / 2 + 0.1 && et.z - W.z > Mt / 2 - 0.1 && Ct.push(et), et.z > tt.z) {
-                  let st = At.closestPointToPoint(et, !0, Y), xt = new y.Vector3().subVectors(st, tt), St = new y.Vector3().subVectors(st, lt), Bt = oe(Z, St), wt = oe(k, xt);
-                  Bt && Bt.parallel && !Bt.sameDirection && wt && wt.parallel && !wt.sameDirection && vt.push(et);
+                  let st = At.closestPointToPoint(et, !0, Y), xt = new y.Vector3().subVectors(st, tt), vt = new y.Vector3().subVectors(st, lt), Bt = oe(Z, vt), wt = oe(k, xt);
+                  Bt && Bt.parallel && !Bt.sameDirection && wt && wt.parallel && !wt.sameDirection && St.push(et);
                 }
               }), Ct.length > 0) {
-                const { newProjectPoints: et } = ze(W, j, Ct);
+                const { newProjectPoints: et } = Ve(W, j, Ct);
                 for (const st of et)
                   st.z = W.z;
                 et.forEach((st) => {
-                  let xt = new y.Vector3(st.x, st.y, W.z), St = new y.Vector3().subVectors(xt, j), Bt = new y.Vector3().subVectors(xt, W), wt = oe(Z, Bt), Xt = oe(k, St);
+                  let xt = new y.Vector3(st.x, st.y, W.z), vt = new y.Vector3().subVectors(xt, j), Bt = new y.Vector3().subVectors(xt, W), wt = oe(Z, Bt), Xt = oe(k, vt);
                   if (wt && wt.parallel && wt.sameDirection) {
                     let $t = xt.distanceTo(W);
                     $t < ft && (ft = $t, it = xt);
@@ -1884,11 +1884,11 @@ const wi = async (n, t, e, o, i) => {
                   }
                 });
               }
-              if (it.equals(W) || (W = it, lt = new y.Vector3(W.x, W.y, lt.z)), dt.equals(j) || (j = dt, tt = new y.Vector3(j.x, j.y, tt.z)), vt.length > 10) {
-                const { newOnLinePoints: et } = ze(lt, tt, vt);
+              if (it.equals(W) || (W = it, lt = new y.Vector3(W.x, W.y, lt.z)), dt.equals(j) || (j = dt, tt = new y.Vector3(j.x, j.y, tt.z)), St.length > 10) {
+                const { newOnLinePoints: et } = Ve(lt, tt, St);
                 for (let st = 0; st < et.length; st++) {
-                  let St = At.closestPointToPoint(et[st], !0, Y).distanceTo(et[st]);
-                  St > 0.02 && pt > St && (pt = St);
+                  let vt = At.closestPointToPoint(et[st], !0, Y).distanceTo(et[st]);
+                  vt > 0.02 && pt > vt && (pt = vt);
                 }
                 tt.z += pt, lt.z += pt, Mt += pt;
               }
@@ -1913,7 +1913,7 @@ const wi = async (n, t, e, o, i) => {
               isPullOutDoor: Et,
               pcbDoorIndexs: Ft,
               beamNearWallVec: new y.Vector3(0, 0, 0)
-            }, bt = !1, Vt = new y.Vector3(), Ut = new y.Vector3(), at = -1, Q = -1, gt = -1;
+            }, bt = !1, zt = new y.Vector3(), Ut = new y.Vector3(), at = -1, Q = -1, gt = -1;
             for (let Z = 0; Z < u.length; Z++) {
               const k = n[u[Z].linesIndex].doorAndBeamData[u[Z].doorIndex];
               if (k.nearId != -1)
@@ -1929,13 +1929,13 @@ const wi = async (n, t, e, o, i) => {
                 dt.start.z = 0, dt.end.z = 0;
                 let Ct = ee(k.beamStart, k.beamEnd, !0);
                 it > U && (dt.start = new y.Vector3(k.beamStart.x, k.beamStart.y, 0), dt.end = new y.Vector3(k.beamEnd.x, k.beamEnd.y, 0), Ct = ee(tt, lt, !0));
-                let vt = new y.Vector3(), At = dt.closestPointToPoint(Ct, !0, vt), Y = At.distanceTo(Ct), pt = new y.Vector3().subVectors(Ct, At).normalize(), et = pt.clone().negate(), st = Ct.clone().addScaledVector(et, Y + 0.1), xt = te(dt.start, dt.end, Ct, st), St = !_t && !k.isDoor && (U > it * 2 || it > U * 2);
-                if (Y < 0.4 && xt != null && !St) {
+                let St = new y.Vector3(), At = dt.closestPointToPoint(Ct, !0, St), Y = At.distanceTo(Ct), pt = new y.Vector3().subVectors(Ct, At).normalize(), et = pt.clone().negate(), st = Ct.clone().addScaledVector(et, Y + 0.1), xt = te(dt.start, dt.end, Ct, st), vt = !_t && !k.isDoor && (U > it * 2 || it > U * 2);
+                if (Y < 0.4 && xt != null && !vt) {
                   k.nearId = l, q.nearId = k.id;
                   let Bt = 0.8;
                   (k.isDoor || q.isDoor) && (k.isDoor = !0, q.isDoor = !0);
                   const wt = Ft.some((Xt) => k.pcbDoorIndexs.includes(Xt));
-                  U < it ? U > Bt && !k.isPullOutDoor ? (k.beamStart = tt.clone().addScaledVector(et, Y), k.beamEnd = lt.clone().addScaledVector(et, Y), k.doorStart = W.clone().addScaledVector(et, Y), k.doorEnd = j.clone().addScaledVector(et, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : !Et || Et && k.isPullOutDoor && wt ? (q.beamStart = k.beamStart.clone().addScaledVector(pt, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(pt, Y), q.doorStart = k.doorStart.clone().addScaledVector(pt, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(pt, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight) : (k.beamStart = tt.clone().addScaledVector(et, Y), k.beamEnd = lt.clone().addScaledVector(et, Y), k.doorStart = W.clone().addScaledVector(et, Y), k.doorEnd = j.clone().addScaledVector(et, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : U > it && (it > Bt && !Et ? (q.beamStart = k.beamStart.clone().addScaledVector(et, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(et, Y), q.doorStart = k.doorStart.clone().addScaledVector(et, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(et, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight) : !k.isPullOutDoor || Et && k.isPullOutDoor && wt ? (k.beamStart = tt.clone().addScaledVector(pt, Y), k.beamEnd = lt.clone().addScaledVector(pt, Y), k.doorStart = W.clone().addScaledVector(pt, Y), k.doorEnd = j.clone().addScaledVector(pt, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : (q.beamStart = k.beamStart.clone().addScaledVector(et, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(et, Y), q.doorStart = k.doorStart.clone().addScaledVector(et, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(et, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight)), at = q.nearId, Vt = k.beamStart.clone(), Ut = k.beamEnd.clone(), bt = !0, Q = u[Z].linesIndex, gt = u[Z].doorIndex;
+                  U < it ? U > Bt && !k.isPullOutDoor ? (k.beamStart = tt.clone().addScaledVector(et, Y), k.beamEnd = lt.clone().addScaledVector(et, Y), k.doorStart = W.clone().addScaledVector(et, Y), k.doorEnd = j.clone().addScaledVector(et, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : !Et || Et && k.isPullOutDoor && wt ? (q.beamStart = k.beamStart.clone().addScaledVector(pt, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(pt, Y), q.doorStart = k.doorStart.clone().addScaledVector(pt, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(pt, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight) : (k.beamStart = tt.clone().addScaledVector(et, Y), k.beamEnd = lt.clone().addScaledVector(et, Y), k.doorStart = W.clone().addScaledVector(et, Y), k.doorEnd = j.clone().addScaledVector(et, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : U > it && (it > Bt && !Et ? (q.beamStart = k.beamStart.clone().addScaledVector(et, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(et, Y), q.doorStart = k.doorStart.clone().addScaledVector(et, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(et, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight) : !k.isPullOutDoor || Et && k.isPullOutDoor && wt ? (k.beamStart = tt.clone().addScaledVector(pt, Y), k.beamEnd = lt.clone().addScaledVector(pt, Y), k.doorStart = W.clone().addScaledVector(pt, Y), k.doorEnd = j.clone().addScaledVector(pt, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : (q.beamStart = k.beamStart.clone().addScaledVector(et, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(et, Y), q.doorStart = k.doorStart.clone().addScaledVector(et, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(et, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight)), at = q.nearId, zt = k.beamStart.clone(), Ut = k.beamEnd.clone(), bt = !0, Q = u[Z].linesIndex, gt = u[Z].doorIndex;
                   break;
                 }
               }
@@ -1949,28 +1949,28 @@ const wi = async (n, t, e, o, i) => {
                 const Ct = ho(n[k]);
                 if (it && it.maxPerpendicularDistance < 0.5) {
                   if (dt && dt.isParallel) {
-                    let st = new y.Line3(ft, U), xt = new y.Vector3(W.x, W.y, ft.z), St = st.closestPointToPoint(xt, !0, new y.Vector3()), Bt = re(St, xt, W, j);
-                    Bt && Bt.angle > 85 && (q.beamNearWallVec = new y.Vector3().subVectors(St, xt).normalize());
+                    let st = new y.Line3(ft, U), xt = new y.Vector3(W.x, W.y, ft.z), vt = st.closestPointToPoint(xt, !0, new y.Vector3()), Bt = re(vt, xt, W, j);
+                    Bt && Bt.angle > 85 && (q.beamNearWallVec = new y.Vector3().subVectors(vt, xt).normalize());
                   }
-                  const vt = [];
+                  const St = [];
                   n[k].originalPoints.forEach((st) => {
-                    st.z > W.z + 0.2 && st.z < W.z + Mt / 2 && vt.push(new y.Vector3(st.x, st.y, W.z));
+                    st.z > W.z + 0.2 && st.z < W.z + Mt / 2 && St.push(new y.Vector3(st.x, st.y, W.z));
                   });
                   const At = new y.Vector3();
                   let Y = [], pt = [];
-                  for (let st = 0; st < vt.length; st++) {
-                    let xt = Z.closestPointToPoint(vt[st], !0, At);
-                    xt.distanceTo(vt[st]) < 0.15 && (Y.push(vt[st]), pt.push(xt.clone()));
+                  for (let st = 0; st < St.length; st++) {
+                    let xt = Z.closestPointToPoint(St[st], !0, At);
+                    xt.distanceTo(St[st]) < 0.15 && (Y.push(St[st]), pt.push(xt.clone()));
                   }
                   for (let st = 0; st < pt.length; st++)
                     mo(Z, pt[st]) && Y.push(pt[st]);
                   if (Y = pt, Y = po(Y), Y.length < 150) continue;
-                  let et = ve(Y);
+                  let et = Se(Y);
                   if (et.length == 2) {
                     let st = et[0].distanceTo(et[1]);
                     if (Math.abs(st - Z.distance()) < 0.3) {
-                      let xt = new y.Line3(ft, U), St = new y.Vector3(W.x, W.y, ft.z), Bt = xt.closestPointToPoint(St, !0, new y.Vector3());
-                      if (q.beamNearWallVec = new y.Vector3().subVectors(Bt, St).normalize(), q.beamStart.z > Ct.maxZ - 0.03 && H > 1)
+                      let xt = new y.Line3(ft, U), vt = new y.Vector3(W.x, W.y, ft.z), Bt = xt.closestPointToPoint(vt, !0, new y.Vector3());
+                      if (q.beamNearWallVec = new y.Vector3().subVectors(Bt, vt).normalize(), q.beamStart.z > Ct.maxZ - 0.03 && H > 1)
                         Pt = !0;
                       else if (Wt = !0, Tt != -1 && (e[a[Tt].index].isFindBeam = !1, a[Tt].isFind = !1), Q != -1 && gt != -1) {
                         const wt = n[Q].doorAndBeamData[gt];
@@ -1991,7 +1991,7 @@ const wi = async (n, t, e, o, i) => {
             }
             let Gt = !1;
             if (at != -1)
-              for (let Z = 0; Z < c.length && !(c[Z].length == 1 && (c[Z][0].id == l ? (c[Z].push({ id: at, beamStart: Vt, beamEnd: Ut }), Gt = !0) : c[Z][0].id == at && (c[Z].push({ id: l, beamStart: tt, beamEnd: lt }), Gt = !0), Gt)); Z++)
+              for (let Z = 0; Z < c.length && !(c[Z].length == 1 && (c[Z][0].id == l ? (c[Z].push({ id: at, beamStart: zt, beamEnd: Ut }), Gt = !0) : c[Z][0].id == at && (c[Z].push({ id: l, beamStart: tt, beamEnd: lt }), Gt = !0), Gt)); Z++)
                 ;
             Gt || c.push([{ id: l, beamStart: tt, beamEnd: lt }]);
             const ht = q.doorStart.distanceTo(q.doorEnd);
@@ -2021,27 +2021,27 @@ const wi = async (n, t, e, o, i) => {
     for (let m = 0; m < h.length; m++) {
       let p = [];
       for (let P = 0; P < n[h[m]].doorAndBeamData.length; P++) {
-        let z = !1;
-        if (n[h[m]].doorAndBeamData[P].type === "beam" && n[h[m]].doorAndBeamData[P].beamNearWallVec.x == 0 && n[h[m]].doorAndBeamData[P].beamNearWallVec.y == 0 && n[h[m]].doorAndBeamData[P].beamNearWallVec.z == 0 && n[h[m]].doorAndBeamData[P].nearId == -1 && (z = !0), !z) {
-          let S = n[h[m]].doorAndBeamData[P].doorStart.clone(), v = n[h[m]].doorAndBeamData[P].doorEnd.clone();
-          S.z = v.z = 0;
-          let V = S.distanceTo(v);
+        let V = !1;
+        if (n[h[m]].doorAndBeamData[P].type === "beam" && n[h[m]].doorAndBeamData[P].beamNearWallVec.x == 0 && n[h[m]].doorAndBeamData[P].beamNearWallVec.y == 0 && n[h[m]].doorAndBeamData[P].beamNearWallVec.z == 0 && n[h[m]].doorAndBeamData[P].nearId == -1 && (V = !0), !V) {
+          let v = n[h[m]].doorAndBeamData[P].doorStart.clone(), S = n[h[m]].doorAndBeamData[P].doorEnd.clone();
+          v.z = S.z = 0;
+          let z = v.distanceTo(S);
           for (let D = 0; D < h.length; D++)
             if (m != D)
               for (let _ = 0; _ < n[h[D]].doorAndBeamData.length; _++) {
                 let E = n[h[D]].doorAndBeamData[_].doorStart.clone(), T = n[h[D]].doorAndBeamData[_].doorEnd.clone();
                 E.z = T.z = 0, E.distanceTo(T);
-                let A = ne(S, v, E, T);
+                let A = ne(v, S, E, T);
                 if (A.type == "collinear_overlap" && A.maxPerpendicularDistance < 0.2) {
-                  let O = new y.Line3(E, T), I = ee(S, v), B = O.closestPointToPoint(I, !0, new y.Vector3()), R = I.distanceTo(B);
-                  if (Math.abs(V - A.overlap) < 0.1 && R < 0.04) {
-                    n[h[D]].doorAndBeamData[_].nearId == n[h[m]].doorAndBeamData[P].id && (n[h[D]].doorAndBeamData[_].nearId = -1), z = !0;
+                  let O = new y.Line3(E, T), I = ee(v, S), B = O.closestPointToPoint(I, !0, new y.Vector3()), R = I.distanceTo(B);
+                  if (Math.abs(z - A.overlap) < 0.1 && R < 0.04) {
+                    n[h[D]].doorAndBeamData[_].nearId == n[h[m]].doorAndBeamData[P].id && (n[h[D]].doorAndBeamData[_].nearId = -1), V = !0;
                     break;
                   }
                 }
               }
         }
-        z || p.push(n[h[m]].doorAndBeamData[P]);
+        V || p.push(n[h[m]].doorAndBeamData[P]);
       }
       p.length != n[h[m]].doorAndBeamData.length && (n[h[m]].doorAndBeamData = p);
     }
@@ -2049,26 +2049,26 @@ const wi = async (n, t, e, o, i) => {
   for (let m = 0; m < a.length; m++) {
     if (a[m].isFind || a[m].inWall)
       continue;
-    let p = new y.Vector3(a[m].doorStartPt.x, a[m].doorStartPt.y, 0), P = new y.Vector3(a[m].doorEndPt.x, a[m].doorEndPt.y, 0), z = new y.Vector3().subVectors(p, P).normalize();
-    for (let S = 0; S < n.length; S++) {
-      if (n[S].length < 0.7 || n[S].completePointAreaPercentage > 60)
+    let p = new y.Vector3(a[m].doorStartPt.x, a[m].doorStartPt.y, 0), P = new y.Vector3(a[m].doorEndPt.x, a[m].doorEndPt.y, 0), V = new y.Vector3().subVectors(p, P).normalize();
+    for (let v = 0; v < n.length; v++) {
+      if (n[v].length < 0.7 || n[v].completePointAreaPercentage > 60)
         continue;
-      let v = new y.Vector3(n[S].start.x, n[S].start.y, 0), V = new y.Vector3(n[S].end.x, n[S].end.y, 0), D = new y.Vector3().subVectors(v, V).normalize(), _ = 0.3, E = p.clone().addScaledVector(z, _), T = P.clone().addScaledVector(z.clone().negate(), _), A = v.clone().addScaledVector(D, _), O = V.clone().addScaledVector(D.clone().negate(), _);
+      let S = new y.Vector3(n[v].start.x, n[v].start.y, 0), z = new y.Vector3(n[v].end.x, n[v].end.y, 0), D = new y.Vector3().subVectors(S, z).normalize(), _ = 0.3, E = p.clone().addScaledVector(V, _), T = P.clone().addScaledVector(V.clone().negate(), _), A = S.clone().addScaledVector(D, _), O = z.clone().addScaledVector(D.clone().negate(), _);
       te(E, T, A, O);
       let I = Jt(
         E,
         T,
         A,
         O
-      ), B = p.distanceTo(v) > P.distanceTo(v) ? P : p, R = B.distanceTo(v), N = B.distanceTo(V);
+      ), B = p.distanceTo(S) > P.distanceTo(S) ? P : p, R = B.distanceTo(S), N = B.distanceTo(z);
       if ((R < f || N < f) && I && !I.isParallel) {
-        let L = p.distanceTo(v), $ = p.distanceTo(V), X = L < $ ? v : V, ot = !1;
+        let L = p.distanceTo(S), $ = p.distanceTo(z), X = L < $ ? S : z, ot = !1;
         for (let K = 0; K < n.length; K++) {
-          if (K == S || b.includes(K) || n[K].length < 0.7)
+          if (K == v || b.includes(K) || n[K].length < 0.7)
             continue;
-          let G = new y.Vector3(n[K].start.x, n[K].start.y, 0), ut = new y.Vector3(n[K].end.x, n[K].end.y, 0), rt = new y.Vector3().subVectors(G, ut).normalize(), F = rt.clone().negate(), H = G.clone().addScaledVector(rt, 5), Mt = ut.clone().addScaledVector(F, 5), Zt = re(v, V, G, ut), qt = ne(v, V, G, ut), Lt = te(v, V, H, Mt), _t = !0;
-          if (Lt != null && (_t = Lt.point.distanceTo(v) < f || Lt.point.distanceTo(V) < f), (Zt && Zt.angle > 85 || qt && qt.type == "collinear_gap") && _t) {
-            let Et = new y.Line3(v, V), Ft = new y.Vector3(), tt = Et.closestPointToPoint(G, !0, Ft), lt = Et.closestPointToPoint(ut, !0, Ft), W = tt.distanceTo(G), j = lt.distanceTo(ut), Nt, Tt;
+          let G = new y.Vector3(n[K].start.x, n[K].start.y, 0), ut = new y.Vector3(n[K].end.x, n[K].end.y, 0), rt = new y.Vector3().subVectors(G, ut).normalize(), F = rt.clone().negate(), H = G.clone().addScaledVector(rt, 5), Mt = ut.clone().addScaledVector(F, 5), Zt = re(S, z, G, ut), qt = ne(S, z, G, ut), Lt = te(S, z, H, Mt), _t = !0;
+          if (Lt != null && (_t = Lt.point.distanceTo(S) < f || Lt.point.distanceTo(z) < f), (Zt && Zt.angle > 85 || qt && qt.type == "collinear_gap") && _t) {
+            let Et = new y.Line3(S, z), Ft = new y.Vector3(), tt = Et.closestPointToPoint(G, !0, Ft), lt = Et.closestPointToPoint(ut, !0, Ft), W = tt.distanceTo(G), j = lt.distanceTo(ut), Nt, Tt;
             if (W > j && j > w)
               Nt = ut, Tt = lt;
             else if (W < j && W > w)
@@ -2108,7 +2108,7 @@ const wi = async (n, t, e, o, i) => {
               start: Nt,
               end: Tt
             }), b.push(K);
-            let bt = n[K].rooftopPz - n[K].start.z, Vt = n[S].rooftopPz - n[S].start.z, Ut = bt < Vt ? bt : Vt;
+            let bt = n[K].rooftopPz - n[K].start.z, zt = n[v].rooftopPz - n[v].start.z, Ut = bt < zt ? bt : zt;
             n[K].doorAndBeamData || (n[K].doorAndBeamData = []), n[K].doorAndBeamData.push({
               id: l,
               beamStart: Nt,
@@ -2154,12 +2154,12 @@ const wi = async (n, t, e, o, i) => {
       let m = n[g].length;
       if (g == l || m < i || m > r)
         continue;
-      let p = new y.Vector3(n[g].start.x, n[g].start.y, n[g].start.z), P = new y.Vector3(n[g].end.x, n[g].end.y, n[g].end.z), z = re(d, c, p, P);
-      if (!z || z.angle < 85)
+      let p = new y.Vector3(n[g].start.x, n[g].start.y, n[g].start.z), P = new y.Vector3(n[g].end.x, n[g].end.y, n[g].end.z), V = re(d, c, p, P);
+      if (!V || V.angle < 85)
         continue;
-      let S = kt(p, d), v = kt(p, c), V = kt(P, d), D = kt(P, c);
-      if (!(!S && !v && !V && !D)) {
-        S || v ? (x = p.clone(), b = P.clone()) : (x = P.clone(), b = p.clone()), M = new y.Vector3().subVectors(b, x).normalize(), M.clone().negate();
+      let v = kt(p, d), S = kt(p, c), z = kt(P, d), D = kt(P, c);
+      if (!(!v && !S && !z && !D)) {
+        v || S ? (x = p.clone(), b = P.clone()) : (x = P.clone(), b = p.clone()), M = new y.Vector3().subVectors(b, x).normalize(), M.clone().negate();
         for (let _ = 0; _ < n.length; _++) {
           let E = n[_].length;
           if (_ == l || _ == g || E < i || E > r)
@@ -2218,8 +2218,8 @@ const wi = async (n, t, e, o, i) => {
     for (let M = 0; M < n.length; M++) {
       if (M == l || n[M].length < i)
         continue;
-      let g = new y.Vector3(n[M].start.x, n[M].start.y, n[M].start.z), m = new y.Vector3(n[M].end.x, n[M].end.y, n[M].end.z), p = kt(g, d), P = kt(m, d), z = kt(g, c), S = kt(m, c);
-      if (p || P ? f = !1 : (z || S) && (w = !1), !f && !w) break;
+      let g = new y.Vector3(n[M].start.x, n[M].start.y, n[M].start.z), m = new y.Vector3(n[M].end.x, n[M].end.y, n[M].end.z), p = kt(g, d), P = kt(m, d), V = kt(g, c), v = kt(m, c);
+      if (p || P ? f = !1 : (V || v) && (w = !1), !f && !w) break;
     }
     if (!f && !w) continue;
     let x = new y.Vector3();
@@ -2232,19 +2232,19 @@ const wi = async (n, t, e, o, i) => {
       let m = new y.Vector3(n[M].start.x, n[M].start.y, n[M].start.z), p = new y.Vector3(n[M].end.x, n[M].end.y, n[M].end.z), P = re(d, c, m, p);
       if (!P || P.angle < 85)
         continue;
-      let z = kt(m, c), S = kt(p, c);
-      if (!z && !S) continue;
+      let V = kt(m, c), v = kt(p, c);
+      if (!V && !v) continue;
       new y.Vector3();
-      let v = new y.Vector3();
-      z ? (m.clone(), v = p.clone()) : (p.clone(), v = m.clone());
-      for (let V = 0; V < n.length; V++) {
-        let D = n[V].length;
-        if (V == l || V == M || o.has(V) || D < i || D > r)
+      let S = new y.Vector3();
+      V ? (m.clone(), S = p.clone()) : (p.clone(), S = m.clone());
+      for (let z = 0; z < n.length; z++) {
+        let D = n[z].length;
+        if (z == l || z == M || o.has(z) || D < i || D > r)
           continue;
-        let _ = new y.Vector3(n[V].start.x, n[V].start.y, n[V].start.z), E = new y.Vector3(n[V].end.x, n[V].end.y, n[V].end.z), T = re(m, p, _, E);
+        let _ = new y.Vector3(n[z].start.x, n[z].start.y, n[z].start.z), E = new y.Vector3(n[z].end.x, n[z].end.y, n[z].end.z), T = re(m, p, _, E);
         if (!T || T.angle < 85)
           continue;
-        let A = kt(_, v), O = kt(E, v);
+        let A = kt(_, S), O = kt(E, S);
         if (!A && !O) continue;
         let I = new y.Vector3(), B = new y.Vector3();
         A ? (I = _.clone(), B = E.clone()) : (I = E.clone(), B = _.clone());
@@ -2252,14 +2252,14 @@ const wi = async (n, t, e, o, i) => {
         if (!N || !N.parallel || !N.sameDirection) continue;
         let C = !0, L = !0;
         for (let X = 0; X < n.length; X++) {
-          if (X == V || n[X].length < i) continue;
+          if (X == z || n[X].length < i) continue;
           let ot = new y.Vector3(n[X].start.x, n[X].start.y, n[X].start.z), K = new y.Vector3(n[X].end.x, n[X].end.y, n[X].end.z), G = kt(ot, _), ut = kt(K, _), rt = kt(ot, E), F = kt(K, E);
           if (G || ut ? C = !1 : (rt || F) && (L = !1), !C && !L) break;
         }
         if (!C && !L) continue;
         let $ = u * g;
         if (!($ < s || $ > a)) {
-          h.uuids = [n[l].uuid, n[M].uuid, n[V].uuid], h.missingEdge.start = B, h.missingEdge.end = d;
+          h.uuids = [n[l].uuid, n[M].uuid, n[z].uuid], h.missingEdge.start = B, h.missingEdge.end = d;
           break;
         }
       }
@@ -2287,25 +2287,25 @@ function _o(n, t) {
   for (let o = 1; o < n; o++) e += t[o];
   return e;
 }
-function Ve(n) {
+function ze(n) {
   return new Float64Array(n);
 }
-const Eo = (3 + 16 * ae) * ae, To = (2 + 12 * ae) * ae, Ao = (9 + 64 * ae) * ae * ae, me = Ve(4), on = Ve(8), rn = Ve(12), sn = Ve(16), jt = Ve(4);
+const Eo = (3 + 16 * ae) * ae, To = (2 + 12 * ae) * ae, Ao = (9 + 64 * ae) * ae * ae, me = ze(4), on = ze(8), rn = ze(12), sn = ze(16), jt = ze(4);
 function Bo(n, t, e, o, i, r, s) {
-  let a, l, u, h, d, c, f, w, x, b, M, g, m, p, P, z, S, v;
-  const V = n - i, D = e - i, _ = t - r, E = o - r;
-  p = V * E, c = Yt * V, f = c - (c - V), w = V - f, c = Yt * E, x = c - (c - E), b = E - x, P = w * b - (p - f * x - w * x - f * b), z = _ * D, c = Yt * _, f = c - (c - _), w = _ - f, c = Yt * D, x = c - (c - D), b = D - x, S = w * b - (z - f * x - w * x - f * b), M = P - S, d = P - M, me[0] = P - (M + d) + (d - S), g = p + M, d = g - p, m = p - (g - d) + (M - d), M = m - z, d = m - M, me[1] = m - (M + d) + (d - z), v = g + M, d = v - g, me[2] = g - (v - d) + (M - d), me[3] = v;
+  let a, l, u, h, d, c, f, w, x, b, M, g, m, p, P, V, v, S;
+  const z = n - i, D = e - i, _ = t - r, E = o - r;
+  p = z * E, c = Yt * z, f = c - (c - z), w = z - f, c = Yt * E, x = c - (c - E), b = E - x, P = w * b - (p - f * x - w * x - f * b), V = _ * D, c = Yt * _, f = c - (c - _), w = _ - f, c = Yt * D, x = c - (c - D), b = D - x, v = w * b - (V - f * x - w * x - f * b), M = P - v, d = P - M, me[0] = P - (M + d) + (d - v), g = p + M, d = g - p, m = p - (g - d) + (M - d), M = m - V, d = m - M, me[1] = m - (M + d) + (d - V), S = g + M, d = S - g, me[2] = g - (S - d) + (M - d), me[3] = S;
   let T = _o(4, me), A = To * s;
-  if (T >= A || -T >= A || (d = n - V, a = n - (V + d) + (d - i), d = e - D, u = e - (D + d) + (d - i), d = t - _, l = t - (_ + d) + (d - r), d = o - E, h = o - (E + d) + (d - r), a === 0 && l === 0 && u === 0 && h === 0) || (A = Ao * s + Do * Math.abs(T), T += V * h + E * a - (_ * u + D * l), T >= A || -T >= A)) return T;
-  p = a * E, c = Yt * a, f = c - (c - a), w = a - f, c = Yt * E, x = c - (c - E), b = E - x, P = w * b - (p - f * x - w * x - f * b), z = l * D, c = Yt * l, f = c - (c - l), w = l - f, c = Yt * D, x = c - (c - D), b = D - x, S = w * b - (z - f * x - w * x - f * b), M = P - S, d = P - M, jt[0] = P - (M + d) + (d - S), g = p + M, d = g - p, m = p - (g - d) + (M - d), M = m - z, d = m - M, jt[1] = m - (M + d) + (d - z), v = g + M, d = v - g, jt[2] = g - (v - d) + (M - d), jt[3] = v;
+  if (T >= A || -T >= A || (d = n - z, a = n - (z + d) + (d - i), d = e - D, u = e - (D + d) + (d - i), d = t - _, l = t - (_ + d) + (d - r), d = o - E, h = o - (E + d) + (d - r), a === 0 && l === 0 && u === 0 && h === 0) || (A = Ao * s + Do * Math.abs(T), T += z * h + E * a - (_ * u + D * l), T >= A || -T >= A)) return T;
+  p = a * E, c = Yt * a, f = c - (c - a), w = a - f, c = Yt * E, x = c - (c - E), b = E - x, P = w * b - (p - f * x - w * x - f * b), V = l * D, c = Yt * l, f = c - (c - l), w = l - f, c = Yt * D, x = c - (c - D), b = D - x, v = w * b - (V - f * x - w * x - f * b), M = P - v, d = P - M, jt[0] = P - (M + d) + (d - v), g = p + M, d = g - p, m = p - (g - d) + (M - d), M = m - V, d = m - M, jt[1] = m - (M + d) + (d - V), S = g + M, d = S - g, jt[2] = g - (S - d) + (M - d), jt[3] = S;
   const O = qe(4, me, 4, jt, on);
-  p = V * h, c = Yt * V, f = c - (c - V), w = V - f, c = Yt * h, x = c - (c - h), b = h - x, P = w * b - (p - f * x - w * x - f * b), z = _ * u, c = Yt * _, f = c - (c - _), w = _ - f, c = Yt * u, x = c - (c - u), b = u - x, S = w * b - (z - f * x - w * x - f * b), M = P - S, d = P - M, jt[0] = P - (M + d) + (d - S), g = p + M, d = g - p, m = p - (g - d) + (M - d), M = m - z, d = m - M, jt[1] = m - (M + d) + (d - z), v = g + M, d = v - g, jt[2] = g - (v - d) + (M - d), jt[3] = v;
+  p = z * h, c = Yt * z, f = c - (c - z), w = z - f, c = Yt * h, x = c - (c - h), b = h - x, P = w * b - (p - f * x - w * x - f * b), V = _ * u, c = Yt * _, f = c - (c - _), w = _ - f, c = Yt * u, x = c - (c - u), b = u - x, v = w * b - (V - f * x - w * x - f * b), M = P - v, d = P - M, jt[0] = P - (M + d) + (d - v), g = p + M, d = g - p, m = p - (g - d) + (M - d), M = m - V, d = m - M, jt[1] = m - (M + d) + (d - V), S = g + M, d = S - g, jt[2] = g - (S - d) + (M - d), jt[3] = S;
   const I = qe(O, on, 4, jt, rn);
-  p = a * h, c = Yt * a, f = c - (c - a), w = a - f, c = Yt * h, x = c - (c - h), b = h - x, P = w * b - (p - f * x - w * x - f * b), z = l * u, c = Yt * l, f = c - (c - l), w = l - f, c = Yt * u, x = c - (c - u), b = u - x, S = w * b - (z - f * x - w * x - f * b), M = P - S, d = P - M, jt[0] = P - (M + d) + (d - S), g = p + M, d = g - p, m = p - (g - d) + (M - d), M = m - z, d = m - M, jt[1] = m - (M + d) + (d - z), v = g + M, d = v - g, jt[2] = g - (v - d) + (M - d), jt[3] = v;
+  p = a * h, c = Yt * a, f = c - (c - a), w = a - f, c = Yt * h, x = c - (c - h), b = h - x, P = w * b - (p - f * x - w * x - f * b), V = l * u, c = Yt * l, f = c - (c - l), w = l - f, c = Yt * u, x = c - (c - u), b = u - x, v = w * b - (V - f * x - w * x - f * b), M = P - v, d = P - M, jt[0] = P - (M + d) + (d - v), g = p + M, d = g - p, m = p - (g - d) + (M - d), M = m - V, d = m - M, jt[1] = m - (M + d) + (d - V), S = g + M, d = S - g, jt[2] = g - (S - d) + (M - d), jt[3] = S;
   const B = qe(I, rn, 4, jt, sn);
   return sn[B - 1];
 }
-function Se(n, t, e, o, i, r) {
+function ve(n, t, e, o, i, r) {
   const s = (t - r) * (e - i), a = (n - i) * (o - r), l = s - a, u = Math.abs(s + a);
   return Math.abs(l) >= Eo * u ? l : -Bo(n, t, e, o, i, r, u);
 }
@@ -2349,80 +2349,80 @@ class Be {
   update() {
     const { coords: t, _hullPrev: e, _hullNext: o, _hullTri: i, _hullHash: r } = this, s = t.length >> 1;
     let a = 1 / 0, l = 1 / 0, u = -1 / 0, h = -1 / 0;
-    for (let V = 0; V < s; V++) {
-      const D = t[2 * V], _ = t[2 * V + 1];
-      D < a && (a = D), _ < l && (l = _), D > u && (u = D), _ > h && (h = _), this._ids[V] = V;
+    for (let z = 0; z < s; z++) {
+      const D = t[2 * z], _ = t[2 * z + 1];
+      D < a && (a = D), _ < l && (l = _), D > u && (u = D), _ > h && (h = _), this._ids[z] = z;
     }
     const d = (a + u) / 2, c = (l + h) / 2;
     let f = 0, w = 0, x = 0;
-    for (let V = 0, D = 1 / 0; V < s; V++) {
-      const _ = We(d, c, t[2 * V], t[2 * V + 1]);
-      _ < D && (f = V, D = _);
+    for (let z = 0, D = 1 / 0; z < s; z++) {
+      const _ = We(d, c, t[2 * z], t[2 * z + 1]);
+      _ < D && (f = z, D = _);
     }
     const b = t[2 * f], M = t[2 * f + 1];
-    for (let V = 0, D = 1 / 0; V < s; V++) {
-      if (V === f) continue;
-      const _ = We(b, M, t[2 * V], t[2 * V + 1]);
-      _ < D && _ > 0 && (w = V, D = _);
+    for (let z = 0, D = 1 / 0; z < s; z++) {
+      if (z === f) continue;
+      const _ = We(b, M, t[2 * z], t[2 * z + 1]);
+      _ < D && _ > 0 && (w = z, D = _);
     }
     let g = t[2 * w], m = t[2 * w + 1], p = 1 / 0;
-    for (let V = 0; V < s; V++) {
-      if (V === f || V === w) continue;
-      const D = Co(b, M, g, m, t[2 * V], t[2 * V + 1]);
-      D < p && (x = V, p = D);
+    for (let z = 0; z < s; z++) {
+      if (z === f || z === w) continue;
+      const D = Co(b, M, g, m, t[2 * z], t[2 * z + 1]);
+      D < p && (x = z, p = D);
     }
-    let P = t[2 * x], z = t[2 * x + 1];
+    let P = t[2 * x], V = t[2 * x + 1];
     if (p === 1 / 0) {
       for (let _ = 0; _ < s; _++)
         this._dists[_] = t[2 * _] - t[0] || t[2 * _ + 1] - t[1];
       ye(this._ids, this._dists, 0, s - 1);
-      const V = new Uint32Array(s);
+      const z = new Uint32Array(s);
       let D = 0;
       for (let _ = 0, E = -1 / 0; _ < s; _++) {
         const T = this._ids[_], A = this._dists[T];
-        A > E && (V[D++] = T, E = A);
+        A > E && (z[D++] = T, E = A);
       }
-      this.hull = V.subarray(0, D), this.triangles = new Uint32Array(0), this.halfedges = new Int32Array(0);
+      this.hull = z.subarray(0, D), this.triangles = new Uint32Array(0), this.halfedges = new Int32Array(0);
       return;
     }
-    if (Se(b, M, g, m, P, z) < 0) {
-      const V = w, D = g, _ = m;
-      w = x, g = P, m = z, x = V, P = D, z = _;
+    if (ve(b, M, g, m, P, V) < 0) {
+      const z = w, D = g, _ = m;
+      w = x, g = P, m = V, x = z, P = D, V = _;
     }
-    const S = Ro(b, M, g, m, P, z);
-    this._cx = S.x, this._cy = S.y;
-    for (let V = 0; V < s; V++)
-      this._dists[V] = We(t[2 * V], t[2 * V + 1], S.x, S.y);
+    const v = Ro(b, M, g, m, P, V);
+    this._cx = v.x, this._cy = v.y;
+    for (let z = 0; z < s; z++)
+      this._dists[z] = We(t[2 * z], t[2 * z + 1], v.x, v.y);
     ye(this._ids, this._dists, 0, s - 1), this._hullStart = f;
-    let v = 3;
-    o[f] = e[x] = w, o[w] = e[f] = x, o[x] = e[w] = f, i[f] = 0, i[w] = 1, i[x] = 2, r.fill(-1), r[this._hashKey(b, M)] = f, r[this._hashKey(g, m)] = w, r[this._hashKey(P, z)] = x, this.trianglesLen = 0, this._addTriangle(f, w, x, -1, -1, -1);
-    for (let V = 0, D = 0, _ = 0; V < this._ids.length; V++) {
-      const E = this._ids[V], T = t[2 * E], A = t[2 * E + 1];
-      if (V > 0 && Math.abs(T - D) <= an && Math.abs(A - _) <= an || (D = T, _ = A, E === f || E === w || E === x)) continue;
+    let S = 3;
+    o[f] = e[x] = w, o[w] = e[f] = x, o[x] = e[w] = f, i[f] = 0, i[w] = 1, i[x] = 2, r.fill(-1), r[this._hashKey(b, M)] = f, r[this._hashKey(g, m)] = w, r[this._hashKey(P, V)] = x, this.trianglesLen = 0, this._addTriangle(f, w, x, -1, -1, -1);
+    for (let z = 0, D = 0, _ = 0; z < this._ids.length; z++) {
+      const E = this._ids[z], T = t[2 * E], A = t[2 * E + 1];
+      if (z > 0 && Math.abs(T - D) <= an && Math.abs(A - _) <= an || (D = T, _ = A, E === f || E === w || E === x)) continue;
       let O = 0;
       for (let C = 0, L = this._hashKey(T, A); C < this._hashSize && (O = r[(L + C) % this._hashSize], !(O !== -1 && O !== o[O])); C++)
         ;
       O = e[O];
       let I = O, B;
-      for (; B = o[I], Se(T, A, t[2 * I], t[2 * I + 1], t[2 * B], t[2 * B + 1]) >= 0; )
+      for (; B = o[I], ve(T, A, t[2 * I], t[2 * I + 1], t[2 * B], t[2 * B + 1]) >= 0; )
         if (I = B, I === O) {
           I = -1;
           break;
         }
       if (I === -1) continue;
       let R = this._addTriangle(I, E, o[I], -1, -1, i[I]);
-      i[E] = this._legalize(R + 2), i[I] = R, v++;
+      i[E] = this._legalize(R + 2), i[I] = R, S++;
       let N = o[I];
-      for (; B = o[N], Se(T, A, t[2 * N], t[2 * N + 1], t[2 * B], t[2 * B + 1]) < 0; )
-        R = this._addTriangle(N, E, B, i[E], -1, i[N]), i[E] = this._legalize(R + 2), o[N] = N, v--, N = B;
+      for (; B = o[N], ve(T, A, t[2 * N], t[2 * N + 1], t[2 * B], t[2 * B + 1]) < 0; )
+        R = this._addTriangle(N, E, B, i[E], -1, i[N]), i[E] = this._legalize(R + 2), o[N] = N, S--, N = B;
       if (I === O)
-        for (; B = e[I], Se(T, A, t[2 * B], t[2 * B + 1], t[2 * I], t[2 * I + 1]) < 0; )
-          R = this._addTriangle(B, E, I, -1, i[I], i[B]), this._legalize(R + 2), i[B] = R, o[I] = I, v--, I = B;
+        for (; B = e[I], ve(T, A, t[2 * B], t[2 * B + 1], t[2 * I], t[2 * I + 1]) < 0; )
+          R = this._addTriangle(B, E, I, -1, i[I], i[B]), this._legalize(R + 2), i[B] = R, o[I] = I, S--, I = B;
       this._hullStart = e[E] = I, o[I] = e[N] = E, o[E] = N, r[this._hashKey(T, A)] = E, r[this._hashKey(t[2 * I], t[2 * I + 1])] = I;
     }
-    this.hull = new Uint32Array(v);
-    for (let V = 0, D = this._hullStart; V < v; V++)
-      this.hull[V] = D, D = o[D];
+    this.hull = new Uint32Array(S);
+    for (let z = 0, D = this._hullStart; z < S; z++)
+      this.hull[z] = D, D = o[D];
     this.triangles = this._triangles.subarray(0, this.trianglesLen), this.halfedges = this._halfedges.subarray(0, this.trianglesLen);
   }
   /**
@@ -2623,18 +2623,18 @@ class Oo {
     let r, s;
     const a = this.circumcenters = this._circumcenters.subarray(0, o.length / 3 * 2);
     for (let x = 0, b = 0, M = o.length, g, m; x < M; x += 3, b += 2) {
-      const p = o[x] * 2, P = o[x + 1] * 2, z = o[x + 2] * 2, S = t[p], v = t[p + 1], V = t[P], D = t[P + 1], _ = t[z], E = t[z + 1], T = V - S, A = D - v, O = _ - S, I = E - v, B = (T * I - A * O) * 2;
+      const p = o[x] * 2, P = o[x + 1] * 2, V = o[x + 2] * 2, v = t[p], S = t[p + 1], z = t[P], D = t[P + 1], _ = t[V], E = t[V + 1], T = z - v, A = D - S, O = _ - v, I = E - S, B = (T * I - A * O) * 2;
       if (Math.abs(B) < 1e-9) {
         if (r === void 0) {
           r = s = 0;
           for (const N of e) r += t[N * 2], s += t[N * 2 + 1];
           r /= e.length, s /= e.length;
         }
-        const R = 1e9 * Math.sign((r - S) * I - (s - v) * O);
-        g = (S + _) / 2 - R * I, m = (v + E) / 2 + R * O;
+        const R = 1e9 * Math.sign((r - v) * I - (s - S) * O);
+        g = (v + _) / 2 - R * I, m = (S + E) / 2 + R * O;
       } else {
         const R = 1 / B, N = T * T + A * A, C = O * O + I * I;
-        g = S + (I * N - A * C) * R, m = v + (T * C - O * N) * R;
+        g = v + (I * N - A * C) * R, m = S + (T * C - O * N) * R;
       }
       a[b] = g, a[b + 1] = m;
     }
@@ -3009,8 +3009,8 @@ function cn(n) {
   if (!i.length) return [];
   const r = /* @__PURE__ */ new Map(), s = (w, x) => w < x ? `${w}_${x}` : `${x}_${w}`;
   for (let w = 0; w < i.length; w += 3) {
-    const x = i[w], b = i[w + 1], M = i[w + 2], [g, m] = e[x], [p, P] = e[b], [z, S] = e[M], v = jo(g, m, p, P, z, S), V = Go(e, x, b, M);
-    if (v <= 1 / V)
+    const x = i[w], b = i[w + 1], M = i[w + 2], [g, m] = e[x], [p, P] = e[b], [V, v] = e[M], S = jo(g, m, p, P, V, v), z = Go(e, x, b, M);
+    if (S <= 1 / z)
       for (const [D, _] of [[x, b], [b, M], [M, x]]) {
         const E = s(D, _);
         r.set(E, (r.get(E) || 0) + 1);
@@ -3036,18 +3036,18 @@ function cn(n) {
 const mt = {
   c: null,
   // center
-  u: [new zt(), new zt(), new zt()],
+  u: [new Vt(), new Vt(), new Vt()],
   // basis vectors
   e: []
   // half width
 }, yt = {
   c: null,
   // center
-  u: [new zt(), new zt(), new zt()],
+  u: [new Vt(), new Vt(), new Vt()],
   // basis vectors
   e: []
   // half width
-}, It = [[], [], []], nt = [[], [], []], Dt = [], ce = new zt(), ue = new zt(), he = new zt(), Ot = new zt(), un = new zt(), hn = new zt(), Qt = new En(), fn = new oo(), _e = new Tn(), dn = new Tn(), mn = new ro();
+}, It = [[], [], []], nt = [[], [], []], Dt = [], ce = new Vt(), ue = new Vt(), he = new Vt(), Ot = new Vt(), un = new Vt(), hn = new Vt(), Qt = new En(), fn = new oo(), _e = new Tn(), dn = new Tn(), mn = new ro();
 let An = class {
   /**
    * Constructs a new OBB.
@@ -3056,7 +3056,7 @@ let An = class {
    * @param {Vector3} [halfSize] - Positive halfwidth extents of the OBB along each axis.
    * @param {Matrix3} [rotation] - The rotation of the OBB.
    */
-  constructor(t = new zt(), e = new zt(), o = new En()) {
+  constructor(t = new Vt(), e = new Vt(), o = new En()) {
     this.center = t, this.halfSize = e, this.rotation = o;
   }
   /**
@@ -3555,21 +3555,21 @@ var Ze = { exports: {} }, On = { exports: {} };
   (function(e, o) {
     n.exports = o();
   })(Fn, function() {
-    function e(g, m, p, P, z) {
-      (function S(v, V, D, _, E) {
+    function e(g, m, p, P, V) {
+      (function v(S, z, D, _, E) {
         for (; _ > D; ) {
           if (_ - D > 600) {
-            var T = _ - D + 1, A = V - D + 1, O = Math.log(T), I = 0.5 * Math.exp(2 * O / 3), B = 0.5 * Math.sqrt(O * I * (T - I) / T) * (A - T / 2 < 0 ? -1 : 1), R = Math.max(D, Math.floor(V - A * I / T + B)), N = Math.min(_, Math.floor(V + (T - A) * I / T + B));
-            S(v, V, R, N, E);
+            var T = _ - D + 1, A = z - D + 1, O = Math.log(T), I = 0.5 * Math.exp(2 * O / 3), B = 0.5 * Math.sqrt(O * I * (T - I) / T) * (A - T / 2 < 0 ? -1 : 1), R = Math.max(D, Math.floor(z - A * I / T + B)), N = Math.min(_, Math.floor(z + (T - A) * I / T + B));
+            v(S, z, R, N, E);
           }
-          var C = v[V], L = D, $ = _;
-          for (o(v, D, V), E(v[_], C) > 0 && o(v, D, _); L < $; ) {
-            for (o(v, L, $), L++, $--; E(v[L], C) < 0; ) L++;
-            for (; E(v[$], C) > 0; ) $--;
+          var C = S[z], L = D, $ = _;
+          for (o(S, D, z), E(S[_], C) > 0 && o(S, D, _); L < $; ) {
+            for (o(S, L, $), L++, $--; E(S[L], C) < 0; ) L++;
+            for (; E(S[$], C) > 0; ) $--;
           }
-          E(v[D], C) === 0 ? o(v, D, $) : o(v, ++$, _), $ <= V && (D = $ + 1), V <= $ && (_ = $ - 1);
+          E(S[D], C) === 0 ? o(S, D, $) : o(S, ++$, _), $ <= z && (D = $ + 1), z <= $ && (_ = $ - 1);
         }
-      })(g, m, p || 0, P || g.length - 1, z || i);
+      })(g, m, p || 0, P || g.length - 1, V || i);
     }
     function o(g, m, p) {
       var P = g[m];
@@ -3589,13 +3589,13 @@ var Ze = { exports: {} }, On = { exports: {} };
     function a(g, m) {
       l(g, 0, g.children.length, m, g);
     }
-    function l(g, m, p, P, z) {
-      z || (z = b(null)), z.minX = 1 / 0, z.minY = 1 / 0, z.maxX = -1 / 0, z.maxY = -1 / 0;
-      for (var S = m; S < p; S++) {
-        var v = g.children[S];
-        u(z, g.leaf ? P(v) : v);
+    function l(g, m, p, P, V) {
+      V || (V = b(null)), V.minX = 1 / 0, V.minY = 1 / 0, V.maxX = -1 / 0, V.maxY = -1 / 0;
+      for (var v = m; v < p; v++) {
+        var S = g.children[v];
+        u(V, g.leaf ? P(S) : S);
       }
-      return z;
+      return V;
     }
     function u(g, m) {
       return g.minX = Math.min(g.minX, m.minX), g.minY = Math.min(g.minY, m.minY), g.maxX = Math.max(g.maxX, m.maxX), g.maxY = Math.max(g.maxY, m.maxY), g;
@@ -3621,10 +3621,10 @@ var Ze = { exports: {} }, On = { exports: {} };
     function b(g) {
       return { children: g, height: 1, leaf: !0, minX: 1 / 0, minY: 1 / 0, maxX: -1 / 0, maxY: -1 / 0 };
     }
-    function M(g, m, p, P, z) {
-      for (var S = [m, p]; S.length; ) if (!((p = S.pop()) - (m = S.pop()) <= P)) {
-        var v = m + Math.ceil((p - m) / P / 2) * P;
-        e(g, v, m, p, z), S.push(m, v, v, p);
+    function M(g, m, p, P, V) {
+      for (var v = [m, p]; v.length; ) if (!((p = v.pop()) - (m = v.pop()) <= P)) {
+        var S = m + Math.ceil((p - m) / P / 2) * P;
+        e(g, S, m, p, V), v.push(m, S, S, p);
       }
     }
     return r.prototype.all = function() {
@@ -3632,12 +3632,12 @@ var Ze = { exports: {} }, On = { exports: {} };
     }, r.prototype.search = function(g) {
       var m = this.data, p = [];
       if (!x(g, m)) return p;
-      for (var P = this.toBBox, z = []; m; ) {
-        for (var S = 0; S < m.children.length; S++) {
-          var v = m.children[S], V = m.leaf ? P(v) : v;
-          x(g, V) && (m.leaf ? p.push(v) : w(g, V) ? this._all(v, p) : z.push(v));
+      for (var P = this.toBBox, V = []; m; ) {
+        for (var v = 0; v < m.children.length; v++) {
+          var S = m.children[v], z = m.leaf ? P(S) : S;
+          x(g, z) && (m.leaf ? p.push(S) : w(g, z) ? this._all(S, p) : V.push(S));
         }
-        m = z.pop();
+        m = V.pop();
       }
       return p;
     }, r.prototype.collides = function(g) {
@@ -3645,10 +3645,10 @@ var Ze = { exports: {} }, On = { exports: {} };
       if (!x(g, m)) return !1;
       for (var p = []; m; ) {
         for (var P = 0; P < m.children.length; P++) {
-          var z = m.children[P], S = m.leaf ? this.toBBox(z) : z;
-          if (x(g, S)) {
-            if (m.leaf || w(g, S)) return !0;
-            p.push(z);
+          var V = m.children[P], v = m.leaf ? this.toBBox(V) : V;
+          if (x(g, v)) {
+            if (m.leaf || w(g, v)) return !0;
+            p.push(V);
           }
         }
         m = p.pop();
@@ -3677,12 +3677,12 @@ var Ze = { exports: {} }, On = { exports: {} };
       return this.data = b([]), this;
     }, r.prototype.remove = function(g, m) {
       if (!g) return this;
-      for (var p, P, z, S = this.data, v = this.toBBox(g), V = [], D = []; S || V.length; ) {
-        if (S || (S = V.pop(), P = V[V.length - 1], p = D.pop(), z = !0), S.leaf) {
-          var _ = s(g, S.children, m);
-          if (_ !== -1) return S.children.splice(_, 1), V.push(S), this._condense(V), this;
+      for (var p, P, V, v = this.data, S = this.toBBox(g), z = [], D = []; v || z.length; ) {
+        if (v || (v = z.pop(), P = z[z.length - 1], p = D.pop(), V = !0), v.leaf) {
+          var _ = s(g, v.children, m);
+          if (_ !== -1) return v.children.splice(_, 1), z.push(v), this._condense(z), this;
         }
-        z || S.leaf || !w(S, v) ? P ? (p++, S = P.children[p], z = !1) : S = null : (V.push(S), D.push(p), p = 0, P = S, S = S.children[0]);
+        V || v.leaf || !w(v, S) ? P ? (p++, v = P.children[p], V = !1) : v = null : (z.push(v), D.push(p), p = 0, P = v, v = v.children[0]);
       }
       return this;
     }, r.prototype.toBBox = function(g) {
@@ -3699,61 +3699,61 @@ var Ze = { exports: {} }, On = { exports: {} };
       for (var p = []; g; ) g.leaf ? m.push.apply(m, g.children) : p.push.apply(p, g.children), g = p.pop();
       return m;
     }, r.prototype._build = function(g, m, p, P) {
-      var z, S = p - m + 1, v = this._maxEntries;
-      if (S <= v) return a(z = b(g.slice(m, p + 1)), this.toBBox), z;
-      P || (P = Math.ceil(Math.log(S) / Math.log(v)), v = Math.ceil(S / Math.pow(v, P - 1))), (z = b([])).leaf = !1, z.height = P;
-      var V = Math.ceil(S / v), D = V * Math.ceil(Math.sqrt(v));
+      var V, v = p - m + 1, S = this._maxEntries;
+      if (v <= S) return a(V = b(g.slice(m, p + 1)), this.toBBox), V;
+      P || (P = Math.ceil(Math.log(v) / Math.log(S)), S = Math.ceil(v / Math.pow(S, P - 1))), (V = b([])).leaf = !1, V.height = P;
+      var z = Math.ceil(v / S), D = z * Math.ceil(Math.sqrt(S));
       M(g, m, p, D, this.compareMinX);
       for (var _ = m; _ <= p; _ += D) {
         var E = Math.min(_ + D - 1, p);
-        M(g, _, E, V, this.compareMinY);
-        for (var T = _; T <= E; T += V) {
-          var A = Math.min(T + V - 1, E);
-          z.children.push(this._build(g, T, A, P - 1));
+        M(g, _, E, z, this.compareMinY);
+        for (var T = _; T <= E; T += z) {
+          var A = Math.min(T + z - 1, E);
+          V.children.push(this._build(g, T, A, P - 1));
         }
       }
-      return a(z, this.toBBox), z;
+      return a(V, this.toBBox), V;
     }, r.prototype._chooseSubtree = function(g, m, p, P) {
       for (; P.push(m), !m.leaf && P.length - 1 !== p; ) {
-        for (var z = 1 / 0, S = 1 / 0, v = void 0, V = 0; V < m.children.length; V++) {
-          var D = m.children[V], _ = c(D), E = (T = g, A = D, (Math.max(A.maxX, T.maxX) - Math.min(A.minX, T.minX)) * (Math.max(A.maxY, T.maxY) - Math.min(A.minY, T.minY)) - _);
-          E < S ? (S = E, z = _ < z ? _ : z, v = D) : E === S && _ < z && (z = _, v = D);
+        for (var V = 1 / 0, v = 1 / 0, S = void 0, z = 0; z < m.children.length; z++) {
+          var D = m.children[z], _ = c(D), E = (T = g, A = D, (Math.max(A.maxX, T.maxX) - Math.min(A.minX, T.minX)) * (Math.max(A.maxY, T.maxY) - Math.min(A.minY, T.minY)) - _);
+          E < v ? (v = E, V = _ < V ? _ : V, S = D) : E === v && _ < V && (V = _, S = D);
         }
-        m = v || m.children[0];
+        m = S || m.children[0];
       }
       var T, A;
       return m;
     }, r.prototype._insert = function(g, m, p) {
-      var P = p ? g : this.toBBox(g), z = [], S = this._chooseSubtree(P, this.data, m, z);
-      for (S.children.push(g), u(S, P); m >= 0 && z[m].children.length > this._maxEntries; ) this._split(z, m), m--;
-      this._adjustParentBBoxes(P, z, m);
+      var P = p ? g : this.toBBox(g), V = [], v = this._chooseSubtree(P, this.data, m, V);
+      for (v.children.push(g), u(v, P); m >= 0 && V[m].children.length > this._maxEntries; ) this._split(V, m), m--;
+      this._adjustParentBBoxes(P, V, m);
     }, r.prototype._split = function(g, m) {
-      var p = g[m], P = p.children.length, z = this._minEntries;
-      this._chooseSplitAxis(p, z, P);
-      var S = this._chooseSplitIndex(p, z, P), v = b(p.children.splice(S, p.children.length - S));
-      v.height = p.height, v.leaf = p.leaf, a(p, this.toBBox), a(v, this.toBBox), m ? g[m - 1].children.push(v) : this._splitRoot(p, v);
+      var p = g[m], P = p.children.length, V = this._minEntries;
+      this._chooseSplitAxis(p, V, P);
+      var v = this._chooseSplitIndex(p, V, P), S = b(p.children.splice(v, p.children.length - v));
+      S.height = p.height, S.leaf = p.leaf, a(p, this.toBBox), a(S, this.toBBox), m ? g[m - 1].children.push(S) : this._splitRoot(p, S);
     }, r.prototype._splitRoot = function(g, m) {
       this.data = b([g, m]), this.data.height = g.height + 1, this.data.leaf = !1, a(this.data, this.toBBox);
     }, r.prototype._chooseSplitIndex = function(g, m, p) {
-      for (var P, z, S, v, V, D, _, E = 1 / 0, T = 1 / 0, A = m; A <= p - m; A++) {
-        var O = l(g, 0, A, this.toBBox), I = l(g, A, p, this.toBBox), B = (z = O, S = I, v = void 0, V = void 0, D = void 0, _ = void 0, v = Math.max(z.minX, S.minX), V = Math.max(z.minY, S.minY), D = Math.min(z.maxX, S.maxX), _ = Math.min(z.maxY, S.maxY), Math.max(0, D - v) * Math.max(0, _ - V)), R = c(O) + c(I);
+      for (var P, V, v, S, z, D, _, E = 1 / 0, T = 1 / 0, A = m; A <= p - m; A++) {
+        var O = l(g, 0, A, this.toBBox), I = l(g, A, p, this.toBBox), B = (V = O, v = I, S = void 0, z = void 0, D = void 0, _ = void 0, S = Math.max(V.minX, v.minX), z = Math.max(V.minY, v.minY), D = Math.min(V.maxX, v.maxX), _ = Math.min(V.maxY, v.maxY), Math.max(0, D - S) * Math.max(0, _ - z)), R = c(O) + c(I);
         B < E ? (E = B, P = A, T = R < T ? R : T) : B === E && R < T && (T = R, P = A);
       }
       return P || p - m;
     }, r.prototype._chooseSplitAxis = function(g, m, p) {
-      var P = g.leaf ? this.compareMinX : h, z = g.leaf ? this.compareMinY : d;
-      this._allDistMargin(g, m, p, P) < this._allDistMargin(g, m, p, z) && g.children.sort(P);
+      var P = g.leaf ? this.compareMinX : h, V = g.leaf ? this.compareMinY : d;
+      this._allDistMargin(g, m, p, P) < this._allDistMargin(g, m, p, V) && g.children.sort(P);
     }, r.prototype._allDistMargin = function(g, m, p, P) {
       g.children.sort(P);
-      for (var z = this.toBBox, S = l(g, 0, m, z), v = l(g, p - m, p, z), V = f(S) + f(v), D = m; D < p - m; D++) {
+      for (var V = this.toBBox, v = l(g, 0, m, V), S = l(g, p - m, p, V), z = f(v) + f(S), D = m; D < p - m; D++) {
         var _ = g.children[D];
-        u(S, g.leaf ? z(_) : _), V += f(S);
+        u(v, g.leaf ? V(_) : _), z += f(v);
       }
       for (var E = p - m - 1; E >= m; E--) {
         var T = g.children[E];
-        u(v, g.leaf ? z(T) : T), V += f(v);
+        u(S, g.leaf ? V(T) : T), z += f(S);
       }
-      return V;
+      return z;
     }, r.prototype._adjustParentBBoxes = function(g, m, p) {
       for (var P = p; P >= 0; P--) u(m[P], g);
     }, r.prototype._condense = function(g) {
@@ -3834,12 +3834,12 @@ var hr = Ce.exports, Ue = { exports: {} };
   })(Fn, function(e) {
     const i = 33306690738754706e-32;
     function r(x, b, M, g, m) {
-      let p, P, z, S, v = b[0], V = g[0], D = 0, _ = 0;
-      V > v == V > -v ? (p = v, v = b[++D]) : (p = V, V = g[++_]);
+      let p, P, V, v, S = b[0], z = g[0], D = 0, _ = 0;
+      z > S == z > -S ? (p = S, S = b[++D]) : (p = z, z = g[++_]);
       let E = 0;
-      if (D < x && _ < M) for (V > v == V > -v ? (z = p - ((P = v + p) - v), v = b[++D]) : (z = p - ((P = V + p) - V), V = g[++_]), p = P, z !== 0 && (m[E++] = z); D < x && _ < M; ) V > v == V > -v ? (z = p - ((P = p + v) - (S = P - p)) + (v - S), v = b[++D]) : (z = p - ((P = p + V) - (S = P - p)) + (V - S), V = g[++_]), p = P, z !== 0 && (m[E++] = z);
-      for (; D < x; ) z = p - ((P = p + v) - (S = P - p)) + (v - S), v = b[++D], p = P, z !== 0 && (m[E++] = z);
-      for (; _ < M; ) z = p - ((P = p + V) - (S = P - p)) + (V - S), V = g[++_], p = P, z !== 0 && (m[E++] = z);
+      if (D < x && _ < M) for (z > S == z > -S ? (V = p - ((P = S + p) - S), S = b[++D]) : (V = p - ((P = z + p) - z), z = g[++_]), p = P, V !== 0 && (m[E++] = V); D < x && _ < M; ) z > S == z > -S ? (V = p - ((P = p + S) - (v = P - p)) + (S - v), S = b[++D]) : (V = p - ((P = p + z) - (v = P - p)) + (z - v), z = g[++_]), p = P, V !== 0 && (m[E++] = V);
+      for (; D < x; ) V = p - ((P = p + S) - (v = P - p)) + (S - v), S = b[++D], p = P, V !== 0 && (m[E++] = V);
+      for (; _ < M; ) V = p - ((P = p + z) - (v = P - p)) + (z - v), z = g[++_], p = P, V !== 0 && (m[E++] = V);
       return p === 0 && E !== 0 || (m[E++] = p), E;
     }
     function s(x) {
@@ -3847,19 +3847,19 @@ var hr = Ce.exports, Ue = { exports: {} };
     }
     const a = 33306690738754716e-32, l = 22204460492503146e-32, u = 11093356479670487e-47, h = s(4), d = s(8), c = s(12), f = s(16), w = s(4);
     e.orient2d = function(x, b, M, g, m, p) {
-      const P = (b - p) * (M - m), z = (x - m) * (g - p), S = P - z;
-      if (P === 0 || z === 0 || P > 0 != z > 0) return S;
-      const v = Math.abs(P + z);
-      return Math.abs(S) >= a * v ? S : -function(V, D, _, E, T, A, O) {
+      const P = (b - p) * (M - m), V = (x - m) * (g - p), v = P - V;
+      if (P === 0 || V === 0 || P > 0 != V > 0) return v;
+      const S = Math.abs(P + V);
+      return Math.abs(v) >= a * S ? v : -function(z, D, _, E, T, A, O) {
         let I, B, R, N, C, L, $, X, ot, K, G, ut, rt, F, H, Mt, Zt, qt;
-        const Lt = V - T, _t = _ - T, Et = D - A, Ft = E - A;
+        const Lt = z - T, _t = _ - T, Et = D - A, Ft = E - A;
         C = (H = (X = Lt - ($ = (L = 134217729 * Lt) - (L - Lt))) * (K = Ft - (ot = (L = 134217729 * Ft) - (L - Ft))) - ((F = Lt * Ft) - $ * ot - X * ot - $ * K)) - (G = H - (Zt = (X = Et - ($ = (L = 134217729 * Et) - (L - Et))) * (K = _t - (ot = (L = 134217729 * _t) - (L - _t))) - ((Mt = Et * _t) - $ * ot - X * ot - $ * K))), h[0] = H - (G + C) + (C - Zt), C = (rt = F - ((ut = F + G) - (C = ut - F)) + (G - C)) - (G = rt - Mt), h[1] = rt - (G + C) + (C - Mt), C = (qt = ut + G) - ut, h[2] = ut - (qt - C) + (G - C), h[3] = qt;
         let tt = function(Tt, Wt) {
           let J = Wt[0];
           for (let ct = 1; ct < Tt; ct++) J += Wt[ct];
           return J;
         }(4, h), lt = l * O;
-        if (tt >= lt || -tt >= lt || (I = V - (Lt + (C = V - Lt)) + (C - T), R = _ - (_t + (C = _ - _t)) + (C - T), B = D - (Et + (C = D - Et)) + (C - A), N = E - (Ft + (C = E - Ft)) + (C - A), I === 0 && B === 0 && R === 0 && N === 0) || (lt = u * O + i * Math.abs(tt), (tt += Lt * N + Ft * I - (Et * R + _t * B)) >= lt || -tt >= lt)) return tt;
+        if (tt >= lt || -tt >= lt || (I = z - (Lt + (C = z - Lt)) + (C - T), R = _ - (_t + (C = _ - _t)) + (C - T), B = D - (Et + (C = D - Et)) + (C - A), N = E - (Ft + (C = E - Ft)) + (C - A), I === 0 && B === 0 && R === 0 && N === 0) || (lt = u * O + i * Math.abs(tt), (tt += Lt * N + Ft * I - (Et * R + _t * B)) >= lt || -tt >= lt)) return tt;
         C = (H = (X = I - ($ = (L = 134217729 * I) - (L - I))) * (K = Ft - (ot = (L = 134217729 * Ft) - (L - Ft))) - ((F = I * Ft) - $ * ot - X * ot - $ * K)) - (G = H - (Zt = (X = B - ($ = (L = 134217729 * B) - (L - B))) * (K = _t - (ot = (L = 134217729 * _t) - (L - _t))) - ((Mt = B * _t) - $ * ot - X * ot - $ * K))), w[0] = H - (G + C) + (C - Zt), C = (rt = F - ((ut = F + G) - (C = ut - F)) + (G - C)) - (G = rt - Mt), w[1] = rt - (G + C) + (C - Mt), C = (qt = ut + G) - ut, w[2] = ut - (qt - C) + (G - C), w[3] = qt;
         const W = r(4, h, 4, w, d);
         C = (H = (X = Lt - ($ = (L = 134217729 * Lt) - (L - Lt))) * (K = N - (ot = (L = 134217729 * N) - (L - N))) - ((F = Lt * N) - $ * ot - X * ot - $ * K)) - (G = H - (Zt = (X = Et - ($ = (L = 134217729 * Et) - (L - Et))) * (K = R - (ot = (L = 134217729 * R) - (L - R))) - ((Mt = Et * R) - $ * ot - X * ot - $ * K))), w[0] = H - (G + C) + (C - Zt), C = (rt = F - ((ut = F + G) - (C = ut - F)) + (G - C)) - (G = rt - Mt), w[1] = rt - (G + C) + (C - Mt), C = (qt = ut + G) - ut, w[2] = ut - (qt - C) + (G - C), w[3] = qt;
@@ -3867,7 +3867,7 @@ var hr = Ce.exports, Ue = { exports: {} };
         C = (H = (X = I - ($ = (L = 134217729 * I) - (L - I))) * (K = N - (ot = (L = 134217729 * N) - (L - N))) - ((F = I * N) - $ * ot - X * ot - $ * K)) - (G = H - (Zt = (X = B - ($ = (L = 134217729 * B) - (L - B))) * (K = R - (ot = (L = 134217729 * R) - (L - R))) - ((Mt = B * R) - $ * ot - X * ot - $ * K))), w[0] = H - (G + C) + (C - Zt), C = (rt = F - ((ut = F + G) - (C = ut - F)) + (G - C)) - (G = rt - Mt), w[1] = rt - (G + C) + (C - Mt), C = (qt = ut + G) - ut, w[2] = ut - (qt - C) + (G - C), w[3] = qt;
         const Nt = r(j, c, 4, w, f);
         return f[Nt - 1];
-      }(x, b, M, g, m, p, v);
+      }(x, b, M, g, m, p, S);
     }, e.orient2dfast = function(x, b, M, g, m, p) {
       return (b - p) * (M - m) - (x - m) * (g - p);
     }, Object.defineProperty(e, "__esModule", { value: !0 });
@@ -3996,9 +3996,9 @@ function He(n, t, e) {
   return r = n[0] - o, s = n[1] - i, r * r + s * s;
 }
 function Ee(n, t, e, o, i, r, s, a) {
-  var l = e - n, u = o - t, h = s - i, d = a - r, c = n - i, f = t - r, w = l * l + u * u, x = l * h + u * d, b = h * h + d * d, M = l * c + u * f, g = h * c + d * f, m = w * b - x * x, p, P, z, S, v = m, V = m;
-  m === 0 ? (P = 0, v = 1, S = g, V = b) : (P = x * g - b * M, S = w * g - x * M, P < 0 ? (P = 0, S = g, V = b) : P > v && (P = v, S = g + x, V = b)), S < 0 ? (S = 0, -M < 0 ? P = 0 : -M > w ? P = v : (P = -M, v = w)) : S > V && (S = V, -M + x < 0 ? P = 0 : -M + x > w ? P = v : (P = -M + x, v = w)), p = P === 0 ? 0 : P / v, z = S === 0 ? 0 : S / V;
-  var D = (1 - p) * n + p * e, _ = (1 - p) * t + p * o, E = (1 - z) * i + z * s, T = (1 - z) * r + z * a, A = E - D, O = T - _;
+  var l = e - n, u = o - t, h = s - i, d = a - r, c = n - i, f = t - r, w = l * l + u * u, x = l * h + u * d, b = h * h + d * d, M = l * c + u * f, g = h * c + d * f, m = w * b - x * x, p, P, V, v, S = m, z = m;
+  m === 0 ? (P = 0, S = 1, v = g, z = b) : (P = x * g - b * M, v = w * g - x * M, P < 0 ? (P = 0, v = g, z = b) : P > S && (P = S, v = g + x, z = b)), v < 0 ? (v = 0, -M < 0 ? P = 0 : -M > w ? P = S : (P = -M, S = w)) : v > z && (v = z, -M + x < 0 ? P = 0 : -M + x > w ? P = S : (P = -M + x, S = w)), p = P === 0 ? 0 : P / S, V = v === 0 ? 0 : v / z;
+  var D = (1 - p) * n + p * e, _ = (1 - p) * t + p * o, E = (1 - V) * i + V * s, T = (1 - V) * r + V * a, A = E - D, O = T - _;
   return A * A + O * O;
 }
 function br(n, t) {
@@ -4019,15 +4019,15 @@ function Pr(n) {
   return o.pop(), t.pop(), t.concat(o);
 }
 var Mr = Ze.exports;
-const zr = /* @__PURE__ */ nr(Mr);
-function Vr(n, t = {}) {
+const Vr = /* @__PURE__ */ nr(Mr);
+function zr(n, t = {}) {
   t.concavity = t.concavity || 1 / 0;
   const e = [];
   if (Pe(n, (i) => {
     e.push([i[0], i[1]]);
   }), !e.length)
     return null;
-  const o = zr(e, t.concavity);
+  const o = Vr(e, t.concavity);
   return o.length > 3 ? Cn([o]) : null;
 }
 function Xn(n, t = {}) {
@@ -4053,7 +4053,7 @@ function se(n) {
     return [...n];
   throw new Error("coord must be GeoJSON Point or an Array of numbers");
 }
-function vr(n) {
+function Sr(n) {
   if (Array.isArray(n))
     return n;
   if (n.type === "Feature") {
@@ -4065,7 +4065,7 @@ function vr(n) {
     "coords must be GeoJSON Feature, Geometry Object or an Array"
   );
 }
-function Sr(n, t, e = {}) {
+function vr(n, t, e = {}) {
   let o;
   return e.final ? o = bn(se(t), se(n)) : o = bn(se(n), se(t)), o > 180 ? -(360 - o) : o;
 }
@@ -4193,7 +4193,7 @@ function Pn(n, t, e) {
   if (t === 0) return n;
   const r = o ?? Xn(n);
   return (i === !1 || i === void 0) && (n = Ar(n)), Pe(n, function(s) {
-    const l = Sr(r, s) + t, u = Dr(r, s), h = vr(
+    const l = vr(r, s) + t, u = Dr(r, s), h = Sr(
       Er(r, u, l)
     );
     s[0] = h[0], s[1] = h[1];
@@ -4260,14 +4260,14 @@ function Fr(n) {
 function Mn(n) {
   let t = 0;
   if (n && n.length > 0) {
-    t += Math.abs(zn(n[0]));
+    t += Math.abs(Vn(n[0]));
     for (let e = 1; e < n.length; e++)
-      t -= Math.abs(zn(n[e]));
+      t -= Math.abs(Vn(n[e]));
   }
   return t;
 }
 var Or = Ht * Ht / 2, Ye = Math.PI / 180;
-function zn(n) {
+function Vn(n) {
   const t = n.length - 1;
   if (t <= 2) return 0;
   let e = 0, o = 0;
@@ -4278,7 +4278,7 @@ function zn(n) {
   return e * Or;
 }
 function Nr(n) {
-  const t = Vr(n);
+  const t = zr(n);
   if (!t)
     throw new Error("Can't calculate smallestSurroundingRectangleByArea for given geometry");
   const e = Xn(t), o = Jo(t);
@@ -4293,7 +4293,7 @@ function Nr(n) {
   }
   return r;
 }
-function Vn(n, t) {
+function zn(n, t) {
   const e = t[0] - n[0], o = t[1] - n[1];
   return Math.sqrt(e * e + o * o);
 }
@@ -4348,13 +4348,13 @@ class Ie extends An {
       coordinates: [t.map((f) => [f.x, f.y])]
     });
     if (!r) throw new Error("2d obb 获取失败");
-    const s = r.geometry.coordinates[0], a = Vn(s[0], s[1]), l = Vn(s[1], s[2]), u = Math.atan2(s[1][1] - s[0][1], s[1][0] - s[0][0]);
-    Te.set(a, l, o), vn.set(0, 0, u);
+    const s = r.geometry.coordinates[0], a = zn(s[0], s[1]), l = zn(s[1], s[2]), u = Math.atan2(s[1][1] - s[0][1], s[1][0] - s[0][0]);
+    Te.set(a, l, o), Sn.set(0, 0, u);
     const [h, d] = qr(s);
-    return e.x = h, e.y = d, this.from(Te, e, vn, i);
+    return e.x = h, e.y = d, this.from(Te, e, Sn, i);
   }
 }
-const le = new y.Matrix4(), fe = new y.Quaternion(), vn = new y.Euler(), Wr = new y.Vector3(1, 1, 1), Te = new y.Vector3(), Xr = new y.Box3();
+const le = new y.Matrix4(), fe = new y.Quaternion(), Sn = new y.Euler(), Wr = new y.Vector3(1, 1, 1), Te = new y.Vector3(), Xr = new y.Box3();
 function $r(n, t, e = 5e-3, o = 0.2) {
   if (!n.length || !t.length) return 0;
   const i = Math.max(e, 0.03), r = e * e, s = /* @__PURE__ */ new Map(), a = (d, c, f) => `${Math.floor(d / i)},${Math.floor(c / i)},${Math.floor(f / i)}`;
@@ -4404,7 +4404,7 @@ function Ge(n, t, e, o) {
   }
   return !1;
 }
-function Sn(n, t) {
+function vn(n, t) {
   const e = new y.Vector3(), o = new y.Vector3();
   n.getSize(e), t.getSize(o);
   const i = e.x * e.y * e.z, r = o.x * o.y * o.z;
@@ -4447,9 +4447,10 @@ function _n(n, t, e, o) {
   const r = Ie.fromByPath2D(i, t, e);
   return r.center.z = o, r;
 }
-const Mi = (n) => {
+const Mi = (n, t) => {
   if (n.length == 0) return [];
-  const t = [], e = /* @__PURE__ */ new Map();
+  t || (t = n[0].averagePz);
+  const e = [], o = /* @__PURE__ */ new Map();
   for (let r = 0; r < n.length; r++) {
     let s = n[r].points.map((b) => [b.x, b.y]), a = n[r].obj_id;
     a = a.replace(/calcony railing/g, "balcony railing").replace(/glass balcony railing/g, "balcony railing").replace(/metal balcony railing/g, "balcony railing").replace(/temporary construction guardrail/g, "balcony railing").replace(/the floor of the house/g, "floor").replace(/the outdoor floor/g, "floor"), a.split("_").slice(1, 3).join("_").split(".")[0].split("_")[0];
@@ -4488,7 +4489,7 @@ const Mi = (n) => {
       center: { x: f.x, y: f.y, z: f.z },
       obj_id: n[r].obj_id,
       type: h,
-      averagePz: n[r].averagePz,
+      averagePz: t,
       obb: null,
       isDel: !1,
       obj_id: a,
@@ -4496,36 +4497,35 @@ const Mi = (n) => {
     };
     if (w.obb = _n(w.path, w.center, w.h, (w.maxz + w.minz) / 2), w.obb == null) continue;
     let x = -1;
-    for (let b = 0; b < t.length; b++)
-      if (t[b].type == h) {
+    for (let b = 0; b < e.length; b++)
+      if (e[b].type == h) {
         x = b;
         break;
       }
-    if (x != -1 ? t[x].array.push(w) : t.push({
+    if (x != -1 ? e[x].array.push(w) : e.push({
       type: h,
       array: [w]
     }), h == "floor" && c != -99999)
-      if (e.has(c)) {
-        const b = e.get(c);
-        b.num += w.points.length, b.datas.push(w), e.set(c, b);
+      if (o.has(c)) {
+        const b = o.get(c);
+        b.num += w.points.length, b.datas.push(w), o.set(c, b);
       } else
-        e.set(c, { num: w.points.length, datas: [w] });
+        o.set(c, { num: w.points.length, datas: [w] });
   }
-  let o = -1 / 0;
-  if (e.size > 0) {
+  if (o.size > 0) {
     let r = [];
-    for (const [s, a] of e.entries()) {
+    for (const [s, a] of o.entries()) {
       const { num: l, datas: u } = a;
-      l > 3e3 && (s > o && (o = s), r.push(...u));
+      l > 3e3 && r.push(...u);
     }
-    for (let s = 0; s < t.length; s++)
-      if (t[s].type == "floor") {
-        t[s].array = r;
+    for (let s = 0; s < e.length; s++)
+      if (e[s].type == "floor") {
+        e[s].array = r;
         break;
       }
   }
-  for (let r = 0; r < t.length; r++) {
-    const s = t[r].array, a = [], l = [];
+  for (let r = 0; r < e.length; r++) {
+    const s = e[r].array, a = [], l = [];
     for (let h = 0; h < s.length; h++) {
       if (s[h].obb == null || a.includes(h))
         continue;
@@ -4539,7 +4539,7 @@ const Mi = (n) => {
         if (d.obb.intersectsOBB(s[c].obb)) {
           a.push(c);
           for (let b = 0; b < s[c].points.length; b++)
-            (s[c].points[b].z > o && s[c].points[b].z - o > 0.1 || d.type == "floor") && d.points.push(s[c].points[b]);
+            (s[c].points[b].z > t && s[c].points[b].z - t > 0.1 || d.type == "floor") && d.points.push(s[c].points[b]);
           const w = d.points.map((b) => [b.x, b.y]);
           d.path = cn(w);
           const x = Dn(d.points);
@@ -4551,13 +4551,13 @@ const Mi = (n) => {
     const u = [];
     for (let h = 0; h < s.length; h++)
       a.includes(h) || u.push(s[h]);
-    u.push(...l), t[r].array = u;
+    u.push(...l), e[r].array = u;
   }
-  for (let r = 0; r < t.length; r++) {
-    const s = t[r].type;
+  for (let r = 0; r < e.length; r++) {
+    const s = e[r].type;
     if (s === "people" || s === "floor")
       continue;
-    const a = t[r].array;
+    const a = e[r].array;
     for (let l = 0; l < a.length; l++) {
       const u = a[l].obb, h = a[l].minz;
       a[l].maxz;
@@ -4574,17 +4574,17 @@ const Mi = (n) => {
           }
       }
       if (!a[l].isDel)
-        for (let c = r + 1; c < t.length; c++) {
-          const f = t[c].type;
+        for (let c = r + 1; c < e.length; c++) {
+          const f = e[c].type;
           if (f === "people" || f === "floor")
             continue;
-          const w = t[c].array;
+          const w = e[c].array;
           for (let x = 0; x < w.length; x++) {
             if (w[x].isDel) continue;
             const b = w[x].obb, M = w[x].minz;
             if (w[x].maxz, u.intersectsOBB(b)) {
               pe(w[x].points, u);
-              const g = pe(a[l].points, b), m = Sn(u, b);
+              const g = pe(a[l].points, b), m = vn(u, b);
               if (g >= 0.3 && m == -1) {
                 a[l].isDel = !0;
                 break;
@@ -4617,9 +4617,9 @@ const Mi = (n) => {
                     break;
                   }
                 }
-                let p = !1, P = [], z = [];
-                const S = a[l].points, v = w[x].points;
-                if (S.length > v.length ? (p = !0, P = S, z = v) : (P = v, z = S), $r(z, P, 0.03, 0.5) > 0.5)
+                let p = !1, P = [], V = [];
+                const v = a[l].points, S = w[x].points;
+                if (v.length > S.length ? (p = !0, P = v, V = S) : (P = S, V = v), $r(V, P, 0.03, 0.5) > 0.5)
                   if (p)
                     w[x].isDel = !0;
                   else {
@@ -4627,18 +4627,18 @@ const Mi = (n) => {
                     break;
                   }
                 else if (Ge(u, b)) {
-                  const D = Sn(u, b);
+                  const D = vn(u, b);
                   if (D === 1 || D === 0) {
                     if (f === "switch") continue;
-                    S.length > v.length ? pe(z, u) >= 0.5 && (w[x].isDel = !0) : pe(P, u) >= 0.5 && (w[x].isDel = !0);
+                    v.length > S.length ? pe(V, u) >= 0.5 && (w[x].isDel = !0) : pe(P, u) >= 0.5 && (w[x].isDel = !0);
                   } else {
                     if (s === "switch") continue;
-                    if (S.length > v.length) {
+                    if (v.length > S.length) {
                       if (pe(P, b) >= 0.5) {
                         a[l].isDel = !0;
                         break;
                       }
-                    } else if (pe(z, b) >= 0.5) {
+                    } else if (pe(V, b) >= 0.5) {
                       a[l].isDel = !0;
                       break;
                     }
@@ -4651,31 +4651,30 @@ const Mi = (n) => {
         }
     }
   }
-  for (let r = 0; r < t.length; r++) {
-    const s = t[r].type, a = t[r].array;
+  for (let r = 0; r < e.length; r++) {
+    const s = e[r].type, a = e[r].array;
     for (let l = 0; l < a.length; l++) {
       let u = a[l].maxz, h = a[l].minz, d = s === "switch" ? 0.1 : 0.3;
-      const c = a[l].averagePz;
-      if (Math.abs(u - c) < d) {
+      if (Math.abs(u - t) < d) {
         a[l].isDel = !0;
         continue;
       }
       if (s === "window" || s === "door" || s === "tv") {
-        const f = Math.abs(u - c), w = Math.abs(h - c);
-        (s === "tv" && w < 1.6 || s !== "window" && f < 1.6) && (a[l].isDel = !0), s === "window" && f < 1 && (a[l].isDel = !0);
+        const c = Math.abs(u - t), f = Math.abs(h - t);
+        (s === "tv" && f < 1.6 || s !== "window" && c < 1.6) && (a[l].isDel = !0), s === "window" && c < 1 && (a[l].isDel = !0);
       }
       if (s === "chair") {
-        const f = new y.Vector3();
-        a[l].obb.getSize(f), (f.x < 0.1 || f.y < 0.1 || f.z < 0.2) && (a[l].isDel = !0);
+        const c = new y.Vector3();
+        a[l].obb.getSize(c), (c.x < 0.1 || c.y < 0.1 || c.z < 0.2) && (a[l].isDel = !0);
       }
-      s === "balcony railing" && (Math.abs(u - h) < 0.4 && (a[l].isDel = !0), (h < c && Math.abs(h - c) > 1 || h > c && Math.abs(h - c) > 1) && (a[l].isDel = !0), u < c && (a[l].isDel = !0)), s === "people" && (Math.abs(u - h) < 1 && (a[l].isDel = !0), h > c && h - c > 0.3 && (a[l].isDel = !0), u < c && (a[l].isDel = !0)), s === "floor" && a[l].points.length < 500 && (a[l].isDel = !0);
+      s === "balcony railing" && (Math.abs(u - h) < 0.4 && (a[l].isDel = !0), (h < t && Math.abs(h - t) > 1 || h > t && Math.abs(h - t) > 1) && (a[l].isDel = !0), u < t && (a[l].isDel = !0)), s === "people" && (Math.abs(u - h) < 1 && (a[l].isDel = !0), h > t && h - t > 0.3 && (a[l].isDel = !0), u < t && (a[l].isDel = !0)), s === "floor" && a[l].points.length < 500 && (a[l].isDel = !0);
     }
   }
-  for (let r = 0; r < t.length; r++)
-    t[r].array = t[r].array.filter((s) => !s.isDel);
+  for (let r = 0; r < e.length; r++)
+    e[r].array = e[r].array.filter((s) => !s.isDel);
   const i = [];
-  for (let r = 0; r < t.length; r++) {
-    const s = t[r].array;
+  for (let r = 0; r < e.length; r++) {
+    const s = e[r].array;
     for (let a = 0; a < s.length; a++)
       i.push({
         obbBox: s[a].obb,
@@ -4759,7 +4758,7 @@ function Kr(n, t) {
   } while (s !== o && i.length <= t.length + 1);
   return i;
 }
-function zi(n, t = {}) {
+function Vi(n, t = {}) {
   const {
     edgeFactor: e = 20,
     alphaScale: o = 2
@@ -4774,15 +4773,15 @@ function zi(n, t = {}) {
     return [];
   const l = a * e, u = /* @__PURE__ */ new Map(), h = (f, w) => f < w ? `${f}_${w}` : `${w}_${f}`;
   for (let f = 0; f < s.length; f += 3) {
-    const w = s[f], x = s[f + 1], b = s[f + 2], [M, g] = i[w], [m, p] = i[x], [P, z] = i[b], { radius: S, maxEdge: v } = Gr(
+    const w = s[f], x = s[f + 1], b = s[f + 2], [M, g] = i[w], [m, p] = i[x], [P, V] = i[b], { radius: v, maxEdge: S } = Gr(
       M,
       g,
       m,
       p,
       P,
-      z
-    ), V = Hr(i, w, x, b) * o;
-    if (S <= 1 / V && v <= l) {
+      V
+    ), z = Hr(i, w, x, b) * o;
+    if (v <= 1 / z && S <= l) {
       const D = [
         [w, x],
         [x, b],
@@ -4970,7 +4969,7 @@ function Zn(n, t = 5, e = 0.05) {
         E.seg.length > g.length && (g = E.seg);
       const m = g.end.x - g.start.x, p = g.end.y - g.start.y, P = Math.sqrt(m * m + p * p);
       if (P < 1e-12) continue;
-      const z = m / P, S = p / P, v = M.map((E) => E.seg.rooftopPz ?? 0), V = Math.max(...v), D = [...new Set(v.map((E) => E.toFixed(3)))];
+      const V = m / P, v = p / P, S = M.map((E) => E.seg.rooftopPz ?? 0), z = Math.max(...S), D = [...new Set(S.map((E) => E.toFixed(3)))];
       if (D.length > 1) {
         const E = M.map((T) => ({
           idx: T.idx,
@@ -4982,10 +4981,10 @@ function Zn(n, t = 5, e = 0.05) {
         a.push({ values: [...D], segments: E });
       }
       [...new Set(M.map((E) => String(E.seg.buildRosource)))];
-      const _ = si(M, g, z, S, e);
+      const _ = si(M, g, V, v, e);
       for (const { l: E, r: T, srcIdxs: A } of _) {
         if (T - E < 0.01) continue;
-        const O = ai(g, E, T, z, S, V, g.buildRosource);
+        const O = ai(g, E, T, V, v, z, g.buildRosource);
         r.push(O), s.push(A);
       }
     }
@@ -5028,9 +5027,9 @@ function hi(n, t, e, o, i, r, s) {
         continue;
       const { start: c, end: f } = h;
       let w = !1, x = 1 / 0;
-      for (const v of i) {
-        const { dist: V, t: D } = Un(v.x, v.y, c.x, c.y, f.x, f.y);
-        D >= -u.margin && D <= 1 + u.margin && V <= u.maxDist && (w = !0, x = Math.min(x, V));
+      for (const S of i) {
+        const { dist: z, t: D } = Un(S.x, S.y, c.x, c.y, f.x, f.y);
+        D >= -u.margin && D <= 1 + u.margin && z <= u.maxDist && (w = !0, x = Math.min(x, z));
       }
       if (!w) {
         `${u.maxDist}${(-u.margin).toFixed(1)}${(1 + u.margin).toFixed(1)}`;
@@ -5038,25 +5037,25 @@ function hi(n, t, e, o, i, r, s) {
       }
       const b = Math.sqrt((f.x - c.x) ** 2 + (f.y - c.y) ** 2);
       if (b < 1e-12) continue;
-      const M = (f.x - c.x) / b, g = (f.y - c.y) / b, m = Math.abs(e * M + o * g), p = Math.abs(-o * M + e * g), P = Math.max(m, p), z = Math.acos(Math.min(P, 1)) * (180 / Math.PI);
-      if (z > r.angleThreshold) {
-        `${z.toFixed(1)}${r.angleThreshold}`;
+      const M = (f.x - c.x) / b, g = (f.y - c.y) / b, m = Math.abs(e * M + o * g), p = Math.abs(-o * M + e * g), P = Math.max(m, p), V = Math.acos(Math.min(P, 1)) * (180 / Math.PI);
+      if (V > r.angleThreshold) {
+        `${V.toFixed(1)}${r.angleThreshold}`;
         continue;
       }
-      let S = 0;
+      let v = 0;
       if (b > 0.01) {
-        const v = [];
+        const S = [];
         for (let _ = 1; _ <= 4; _++) {
           const E = i[_], T = E.x - c.x, A = E.y - c.y, O = (T * M + A * g) / b;
-          v.push(O);
+          S.push(O);
         }
-        const V = Math.min(...v), D = Math.max(...v);
-        D > V && (S = Math.max(0, Math.min(1, D) - Math.max(0, V)) / (D - V));
+        const z = Math.min(...S), D = Math.max(...S);
+        D > z && (v = Math.max(0, Math.min(1, D) - Math.max(0, z)) / (D - z));
       }
       l.push({
         seg: h,
         minDist: x,
-        embedRatio: S,
+        embedRatio: v,
         ratio: h.length / t,
         score: 0,
         details: { conn: 0, variance: 0, sameSide: 0 }
@@ -5075,12 +5074,12 @@ function fi(n, t, e, o) {
   return n.sort((i, r) => r.embedRatio - i.embedRatio || r.score - i.score || i.minDist - r.minDist), n;
 }
 function di(n, t, e, o) {
-  const i = n.end.x - n.start.x, r = n.end.y - n.start.y, s = Math.sqrt(i * i + r * r), a = i / s, l = r / s, u = t.map((S) => {
-    const v = S.x - n.start.x, V = S.y - n.start.y;
-    return (v * a + V * l) / s;
-  }), h = Math.min(...u), d = Math.max(...u), c = (d - h) * s, f = (h + d) / 2, w = n.start.x + f * i, x = n.start.y + f * r, b = e.box.min.z, M = e.box.max.z, g = Math.abs(M - b), m = jn(o, n.start.x, n.start.y), p = Math.max(0, b - m), P = h <= 0 && d >= 1, z = n.start.z + f * (n.end.z - n.start.z);
+  const i = n.end.x - n.start.x, r = n.end.y - n.start.y, s = Math.sqrt(i * i + r * r), a = i / s, l = r / s, u = t.map((v) => {
+    const S = v.x - n.start.x, z = v.y - n.start.y;
+    return (S * a + z * l) / s;
+  }), h = Math.min(...u), d = Math.max(...u), c = (d - h) * s, f = (h + d) / 2, w = n.start.x + f * i, x = n.start.y + f * r, b = e.box.min.z, M = e.box.max.z, g = Math.abs(M - b), m = jn(o, n.start.x, n.start.y), p = Math.max(0, b - m), P = h <= 0 && d >= 1, V = n.start.z + f * (n.end.z - n.start.z);
   return {
-    p: { x: w, y: x, z },
+    p: { x: w, y: x, z: V },
     width: c,
     full: P,
     height: g,
@@ -5118,24 +5117,24 @@ function mi(n, t, e, o) {
     h.name;
     let P = hi(l, x, b, M, p, i, h.name);
     P = fi(P, p, t, h.name);
-    let z = null, S = 1 / 0, v = 0;
+    let V = null, v = 1 / 0, S = 0;
     if (P.length > 0) {
       const D = P[0];
-      z = D.seg, S = D.minDist, v = D.ratio;
+      V = D.seg, v = D.minDist, S = D.ratio;
     }
-    let V;
-    if (z && (V = di(z, c, h, s), !i.printOnly)) {
-      const D = z;
-      D.drawWindow || (D.drawWindow = []), D.drawWindow.push(V);
+    let z;
+    if (V && (z = di(V, c, h, s), !i.printOnly)) {
+      const D = V;
+      D.drawWindow || (D.drawWindow = []), D.drawWindow.push(z);
     }
-    z && r.push({
+    V && r.push({
       windowName: h.name,
       windowCategory: h.category,
       windowCenter: h.center,
-      wallSegment: z,
-      distance: S,
-      wallLengthRatio: v,
-      drawWindow: V
+      wallSegment: V,
+      distance: v,
+      wallLengthRatio: S,
+      drawWindow: z
     });
   }
   for (const h of r) {
@@ -5146,7 +5145,7 @@ function mi(n, t, e, o) {
   }
   return r;
 }
-function Vi(n, t, e) {
+function zi(n, t, e) {
   const o = {
     printOnly: !1,
     ...e
@@ -5175,7 +5174,7 @@ function Vi(n, t, e) {
 }
 export {
   cn as computeContour,
-  zi as computeContourNew,
+  Vi as computeContourNew,
   jn as computeLocalFloorZ,
   mi as findWindowWalls,
   yi as getAllGeometry,
@@ -5183,6 +5182,6 @@ export {
   bi as getColLine,
   Mi as getMergeMeaning,
   Zn as mergeCollinearSegments,
-  Vi as processData,
+  zi as processData,
   xi as updateStEdPoint
 };