rm-graphical-computing 1.0.66 → 1.0.69

package/dist/index.js

@@ -131,8 +131,8 @@ const so = (n, t, e) => {
   let f = Math.min(c + a * 2, l), w = o + a * 2;
   const x = document.createElement("canvas");
   x.width = f, x.height = w;
-  const P = x.getContext("2d");
-  P.fillStyle = r, P.fillRect(0, 0, f, w), P.fillStyle = s, P.font = `bold ${o}px ${i}`, P.textAlign = "center", P.textBaseline = "middle", c > l - a * 2 ? lo(P, n, f / 2, w / 2, l, o) : P.fillText(n, f / 2, w / 2);
+  const b = x.getContext("2d");
+  b.fillStyle = r, b.fillRect(0, 0, f, w), b.fillStyle = s, b.font = `bold ${o}px ${i}`, b.textAlign = "center", b.textBaseline = "middle", c > l - a * 2 ? lo(b, n, f / 2, w / 2, l, o) : b.fillText(n, f / 2, w / 2);
   const M = new y.CanvasTexture(x), g = new y.SpriteMaterial({
     map: M,
     depthTest: !1,
@@ -171,26 +171,26 @@ const oe = (n, t, e = 0.01) => {
   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 v = z.dot(s), S = z.dot(a);
-    v < u && (u = v), v > h && (h = v), S < d && (d = S), S > c && (c = S);
+    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);
   }
-  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)), P = 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, P, M], m = oe(new y.Vector3().subVectors(w, x), new y.Vector3(0, 0, 1));
-  m && m.parallel && (g = [w, M, P, x]);
+  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(), v = z.clone().negate(), S = new y.Vector3().subVectors(g[3], g[0]).normalize(), V = S.clone().negate();
+    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();
     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 L = 0; L < T; L++) {
-        let N = I.clone().addScaledVector(z, t), C = N.clone().addScaledVector(S, e), R = I.clone().addScaledVector(S, e), $ = new y.Vector3().add(I).add(N).add(C).add(R).multiplyScalar(0.25);
+      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);
         for (let X = 0; X < r.length; X++)
           if (r[X].distanceTo($) < A) {
             B++;
             break;
           }
-        I = R;
+        I = L;
       }
       if (B >= T / 2)
         break;
@@ -199,24 +199,24 @@ const oe = (n, t, e = 0.01) => {
     D = g[0].distanceTo(g[1]), E = D / t;
     for (let O = 0; O < E; O++) {
       let I = g[1], B = 0;
-      for (let L = 0; L < T; L++) {
-        let N = I.clone().addScaledVector(v, t), C = N.clone().addScaledVector(S, e), R = I.clone().addScaledVector(S, e), $ = new y.Vector3().add(I).add(N).add(C).add(R).multiplyScalar(0.25);
+      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);
         for (let X = 0; X < r.length; X++)
           if (r[X].distanceTo($) < A) {
             B++;
             break;
           }
-        I = R;
+        I = L;
       }
       if (B >= T / 2)
         break;
-      p += B, g[1] = g[1].addScaledVector(v, t), g[2] = g[2].addScaledVector(v, t);
+      p += B, g[1] = g[1].addScaledVector(S, t), g[2] = g[2].addScaledVector(S, 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 L = 0; L < E; L++) {
-        let N = I.clone().addScaledVector(z, t), C = N.clone().addScaledVector(V, e), R = I.clone().addScaledVector(V, e), $ = new y.Vector3().add(I).add(N).add(C).add(R).multiplyScalar(0.25);
+      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);
         for (let X = 0; X < r.length; X++)
           if (r[X].distanceTo($) < A) {
             B++;
@@ -229,10 +229,10 @@ const oe = (n, t, e = 0.01) => {
       p += B, g[2] = g[2].addScaledVector(V, e), g[3] = g[3].addScaledVector(V, e);
     }
   }
-  const b = g[0].distanceTo(g[1]) * g[0].distanceTo(g[3]);
+  const P = g[0].distanceTo(g[1]) * g[0].distanceTo(g[3]);
   return {
     facePoints: g,
-    boxArea: b,
+    boxArea: P,
     totalInPlaneNum: p
   };
 }, Jt = (n, t, e, o, i = y.MathUtils.degToRad(8)) => {
@@ -298,7 +298,7 @@ const oe = (n, t, e = 0.01) => {
       closestDistance: null
     };
   f < 0 && c.negate();
-  const P = 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, b = Math.max(g, m), z = n.dot(P), v = t.dot(P), S = e.dot(P), V = o.dot(P), D = Math.min(z, v), _ = Math.max(z, v), E = Math.min(S, V), T = Math.max(S, V), A = _ - D, O = T - E, I = Math.min(A, O), B = Math.min(_, T) - Math.max(D, E), L = B < 0 ? -B : 0, N = B > 0 ? B : 0, C = I > 0 ? N / I : 0, R = 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), 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(
     n,
     t,
     e,
@@ -309,10 +309,10 @@ const oe = (n, t, e = 0.01) => {
     type: X,
     angleDeg: x,
     avgPerpendicularDistance: p,
-    maxPerpendicularDistance: b,
-    gap: L,
+    maxPerpendicularDistance: P,
+    gap: R,
     overlap: N,
-    closestDistance: R
+    closestDistance: L
   };
 };
 function Je(n, t, e) {
@@ -323,8 +323,8 @@ function uo(n, t, e, o) {
   const i = new y.Vector3().subVectors(t, n), r = new y.Vector3().subVectors(o, e), s = new y.Vector3().subVectors(e, n), a = i.dot(i), l = i.dot(r), u = r.dot(r), h = i.dot(s), d = r.dot(s), c = a * u - l * l;
   let f, w;
   c < 1e-10 ? (f = 0, w = u !== 0 ? d / u : 0) : (f = (l * d - u * h) / c, w = (a * d - l * h) / c), f = y.MathUtils.clamp(f, 0, 1), w = u !== 0 ? y.MathUtils.clamp((l * f + d) / u, 0, 1) : 0, f = a !== 0 ? y.MathUtils.clamp((l * w - h) / a, 0, 1) : 0;
-  const x = n.clone().add(i.clone().multiplyScalar(f)), P = e.clone().add(r.clone().multiplyScalar(w));
-  return x.distanceTo(P);
+  const x = n.clone().add(i.clone().multiplyScalar(f)), b = e.clone().add(r.clone().multiplyScalar(w));
+  return x.distanceTo(b);
 }
 const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), ho = (n) => {
   let t = new y.Vector3(n.start.x, n.start.y, n.start.z), e = new y.Vector3(n.end.x, n.end.y, n.end.z), o = t.distanceTo(e), i = n.rooftopPz - n.start.z, r = tn(o, 100), s = tn(i, 70), a = i / s, l = /* @__PURE__ */ new Map();
@@ -333,23 +333,23 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
   let u = new y.Line3(t, e);
   const h = n.originalPoints, d = new y.Vector3();
   for (let x = 0; x < h.length; x++) {
-    const P = h[x];
-    let g = u.closestPointToPoint(P, !0, d).distanceTo(P);
+    const b = h[x];
+    let g = u.closestPointToPoint(b, !0, d).distanceTo(b);
     const m = Math.floor(g / a);
     if (m < s) {
       const p = l.get((m + 1) * a);
-      p.count++, P.z < p.minZ && (p.minZ = P.z), P.z > p.maxZ && (p.maxZ = P.z);
+      p.count++, b.z < p.minZ && (p.minZ = b.z), b.z > p.maxZ && (p.maxZ = b.z);
     }
   }
   let c, f, w = r / 2;
-  for (const [x, P] of l)
-    if (P.count >= w) {
-      c = P.minZ;
+  for (const [x, b] of l)
+    if (b.count >= w) {
+      c = b.minZ;
       break;
     }
-  for (const [x, P] of [...l.entries()].reverse())
-    if (P.count >= w) {
-      f = P.maxZ;
+  for (const [x, b] of [...l.entries()].reverse())
+    if (b.count >= w) {
+      f = b.maxZ;
       break;
     }
   return { minZ: c, maxZ: f };
@@ -358,54 +358,54 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
   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);
   const a = [], l = [];
-  e.forEach((P) => {
+  e.forEach((b) => {
     const M = new y.Vector3();
-    o.projectPoint(P, M), l.push(M.clone()), M.z = i.z, a.push(M);
+    o.projectPoint(b, M), l.push(M.clone()), M.z = i.z, a.push(M);
   });
   let u = new y.Vector3(), h = new y.Vector3();
   o.projectPoint(i, u), o.projectPoint(r, h);
   const d = new y.Line3(u, h), c = [], f = [], w = [];
   let x = new y.Vector3();
-  return a.forEach((P, M) => {
-    d.closestPointToPoint(P, !0, x).distanceTo(P) < 1e-3 ? (c.push(e[M]), f.push(l[M])) : w.push(P);
+  return a.forEach((b, M) => {
+    d.closestPointToPoint(b, !0, x).distanceTo(b) < 1e-3 ? (c.push(e[M]), f.push(l[M])) : w.push(b);
   }), { newOriginalPoints: c, newProjectPoints: w, newOnLinePoints: f };
 }, fo = (n) => {
   function t(e, o, i, r, s, a, l, u, h) {
-    let d = new y.Line3(e, o), c = /* @__PURE__ */ new Map(), f = new y.Vector3(), w = e.clone(), x = o.clone(), P = 0;
+    let d = new y.Line3(e, o), c = /* @__PURE__ */ new Map(), f = new y.Vector3(), w = e.clone(), x = o.clone(), b = 0;
     for (; ; ) {
       let M = /* @__PURE__ */ new Map(), g = 0;
       for (let m = 0; m < h.checkResults.length; m++)
         if (!(h.checkResults[m].allCenterPoints.length / u * 100 < 1))
-          for (let b = 0; b < h.checkResults[m].allCenterPoints.length; b++) {
-            if (c.has(m) && c.get(m).removePtsIndex.includes(b))
+          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[b];
+            let z = h.checkResults[m].allCenterPoints[P];
             z = new y.Vector3(z.x, z.y, z.z);
-            let v = d.closestPointToPoint(z, !0, f), S = z.distanceTo(v);
-            Math.abs(S - s) < 0.01 && (g++, M.has(m) ? M.get(m).removePtsIndex.push(b) : M.set(m, {
+            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, {
               index: m,
-              removePtsIndex: [b]
+              removePtsIndex: [P]
             }));
           }
-      if (P == l) {
+      if (b == l) {
         e = w, o = x;
         break;
       }
       if (g < a / 20 * 18 || g == 0) {
-        M.clear(), l - P < 5 && (e = w, o = x, c.clear());
+        M.clear(), l - b < 5 && (e = w, o = x, c.clear());
         break;
       } else {
-        P++;
+        b++;
         for (const [m, p] of M)
           c.has(m) ? c.get(m).removePtsIndex.push(...p.removePtsIndex) : c.set(m, p);
         M.clear(), e = e.addScaledVector(i, r), o = o.addScaledVector(i, r), d.set(e, o);
       }
     }
-    if (c.size > 0 && P != l)
+    if (c.size > 0 && b != l)
       for (const [M, g] of c) {
         let m = [], p = [];
-        for (let b = 0; b < h.checkResults[M].allCenterPoints.length; b++)
-          g.removePtsIndex.includes(b) || (m.push(h.checkResults[M].allCenterPoints[b]), p.push(h.checkResults[M].originalVertices[b]));
+        for (let P = 0; P < h.checkResults[M].allCenterPoints.length; P++)
+          g.removePtsIndex.includes(P) || (m.push(h.checkResults[M].allCenterPoints[P]), p.push(h.checkResults[M].originalVertices[P]));
         h.checkResults[M].allCenterPoints = m, h.checkResults[M].originalVertices = p;
       }
   }
@@ -417,8 +417,8 @@ 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 S = o.checkResults[0].originalVertices[0];
-      let [V, D, _, E] = S;
+      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));
       A && A.parallel && ([r, i] = [i, r]);
@@ -427,17 +427,17 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
       continue;
     let s = new y.Vector3(o.start.x, o.start.y, o.start.z), a = new y.Vector3(o.end.x, o.end.y, o.end.z);
     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)), P = new y.Vector3().subVectors(f, c).normalize(), M = P.clone().negate();
+    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, b = i * r, z = p / b;
-    t(c, x, P, i, m, d, h, z, o), t(f, w, M, i, m, d, h, z, o), o.start = c, o.end = f;
-    const { newOriginalPoints: v } = ze(c, f, o.originalPoints);
-    o.originalPoints = v;
+    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;
   }
-}, Lt = (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) => {
+}, 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;
-}, Se = (n) => {
+}, ve = (n) => {
   let t = 0, e = [];
   for (let o = 0; o < n.length; o++)
     for (let i = o + 1; i < n.length; i++) {
@@ -501,8 +501,8 @@ class yo {
    */
   createWallPlaneMeshFromFourPoints(t, e, o, i, r, s, a = 16777215) {
     const l = [t, e, o, i];
-    for (let P = 0; P < l.length; P++)
-      this.isValidVector3(l[P]) || (console.error(`点${P + 1}包含无效数据:`, l[P]), l[P] = new y.Vector3(P, 0, P));
+    for (let b = 0; b < l.length; b++)
+      this.isValidVector3(l[b]) || (console.error(`点${b + 1}包含无效数据:`, l[b]), l[b] = new y.Vector3(b, 0, b));
     const u = new y.BufferGeometry(), h = new Float32Array([
       l[0].x,
       l[0].y,
@@ -556,22 +556,22 @@ class yo {
     const c = a.distanceTo(l), f = Math.abs(t.rooftopPz - t.start.z);
     if (c === 0 || f === 0)
       return console.error("墙体宽度或高度为0"), console.log("line.rooftopPz", t.rooftopPz), console.log("bottomLeft", a), console.log("bottomRight", l), console.log(t.length), s;
-    const w = c / o, x = f / e, P = new y.Vector3().subVectors(l, a).normalize(), M = new y.Vector3(0, 0, 1);
+    const w = c / o, x = f / e, b = new y.Vector3().subVectors(l, a).normalize(), M = new y.Vector3(0, 0, 1);
     for (let g = 0; g < e; g++)
       for (let m = 0; m < o; m++)
         try {
-          const p = new y.Vector3().copy(a).add(P.clone().multiplyScalar(m * w)).add(M.clone().multiplyScalar(g * x)), b = new y.Vector3().copy(a).add(P.clone().multiplyScalar((m + 1) * w)).add(M.clone().multiplyScalar(g * x)), z = new y.Vector3().copy(a).add(P.clone().multiplyScalar((m + 1) * w)).add(M.clone().multiplyScalar((g + 1) * x)), v = new y.Vector3().copy(a).add(P.clone().multiplyScalar(m * w)).add(M.clone().multiplyScalar((g + 1) * x)), S = {
-            points: [p, b, z, v],
+          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],
             userData: {}
           };
-          S.userData = {
+          v.userData = {
             type: "wallSegment",
             row: g,
             col: m,
             originalMaterial: i,
             width: w,
             height: x
-          }, s.push(S);
+          }, s.push(v);
         } catch (p) {
           console.error(`创建墙体小平面(${g}, ${m})时出错:`, p);
         }
@@ -873,9 +873,9 @@ class yo {
     }), this.results.totalSegments = r.length;
     for (const s of r) {
       if (s.vertices.length < 4) continue;
-      const a = s.userData.center, l = `row${s.userData.row}_col${s.userData.col}`, [u, h, d, c] = s.vertices, f = new y.Vector3().subVectors(h, u).normalize(), w = new y.Vector3().subVectors(c, u).normalize(), x = u.distanceTo(h), P = u.distanceTo(c), M = new y.Plane();
+      const a = s.userData.center, l = `row${s.userData.row}_col${s.userData.col}`, [u, h, d, c] = s.vertices, f = new y.Vector3().subVectors(h, u).normalize(), w = new y.Vector3().subVectors(c, u).normalize(), x = u.distanceTo(h), b = u.distanceTo(c), M = new y.Plane();
       M.setFromCoplanarPoints(u, h, c);
-      const g = x / 2, m = P / 2;
+      const g = x / 2, m = b / 2;
       for (let p = 0; p < e.length; p++)
         this.isPointInWallSegmentOptimized(
           e[p],
@@ -885,7 +885,7 @@ class yo {
           f,
           w,
           x,
-          P,
+          b,
           g,
           m,
           o
@@ -917,7 +917,7 @@ class yo {
     const f = new y.Vector3().subVectors(t, e), w = Math.abs(f.dot(r)), x = Math.abs(f.dot(s));
     if (w > u && x > h)
       return !1;
-    const P = new y.Vector3().subVectors(t, i), M = P.dot(r), g = P.dot(s), m = M >= -d && M <= a + d, p = g >= -d && g <= l + d;
+    const b = new y.Vector3().subVectors(t, i), M = b.dot(r), g = b.dot(s), m = M >= -d && M <= a + d, p = g >= -d && g <= l + d;
     return m && p;
   }
   // 判断点是否在细分墙体平面内
@@ -937,8 +937,8 @@ class yo {
       return !1;
     const d = new y.Vector3().subVectors(s, r).normalize(), c = new y.Vector3().subVectors(l, r).normalize();
     new y.Vector3().crossVectors(d, c).normalize();
-    const f = new y.Vector3().subVectors(e, r), w = f.dot(d), x = f.dot(c), P = r.distanceTo(s), M = r.distanceTo(l), g = w >= -i && w <= P + i, m = x >= -i && x <= M + i;
-    return g && m && o.distanceTo(e) < P / 2 && o.distanceTo(e) < M / 2;
+    const f = new y.Vector3().subVectors(e, r), w = f.dot(d), x = f.dot(c), b = r.distanceTo(s), M = r.distanceTo(l), g = w >= -i && w <= b + i, m = x >= -i && x <= M + i;
+    return g && m && o.distanceTo(e) < b / 2 && o.distanceTo(e) < M / 2;
   }
   // 优化顶点获取（添加缓存）
   getWorldVertices(t) {
@@ -1041,15 +1041,15 @@ class yo {
     for (const [c, f] of r) {
       const w = (d = s.get(f.row)) == null ? void 0 : d.get(f.col);
       if (w && !w.visited) {
-        const x = [], P = [[f.row, f.col]];
-        for (w.visited = !0; P.length > 0; ) {
-          const [M, g] = P.shift(), m = `row${M}_col${g}`;
+        const x = [], b = [[f.row, f.col]];
+        for (w.visited = !0; b.length > 0; ) {
+          const [M, g] = b.shift(), m = `row${M}_col${g}`;
           r.has(m) && x.push(r.get(m));
-          for (const [p, b] of l) {
-            const z = M + p, v = g + b;
-            if (s.has(z) && s.get(z).has(v)) {
-              const S = s.get(z).get(v);
-              !S.visited && S.isEmpty && (S.visited = !0, P.push([z, v]));
+          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]));
             }
           }
         }
@@ -1244,9 +1244,9 @@ const xo = (n) => {
     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((v, S) => {
+    r.originalPoints.forEach((S, v) => {
       const V = new zt();
-      l.projectPoint(v, V), u.push(V);
+      l.projectPoint(S, V), u.push(V);
     });
     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({
       color: "red",
@@ -1254,7 +1254,7 @@ const xo = (n) => {
       wireframe: !1,
       transparent: !0,
       opacity: 0.5
-    }), f = new y.Group(), w = new yo(), { horizontalSubdivisions: x, verticalSubdivisions: P } = w.initLimits4(h, d), M = w.createSubdividedWallPlane(r, P, x, c, f);
+    }), f = new y.Group(), w = new yo(), { horizontalSubdivisions: x, verticalSubdivisions: b } = w.initLimits4(h, d), M = w.createSubdividedWallPlane(r, b, x, c, f);
     w.analyzePointDistribution(M, u, 0.01);
     const g = new y.MeshBasicMaterial({
       color: "black",
@@ -1262,9 +1262,9 @@ const xo = (n) => {
       opacity: 0.8,
       side: y.DoubleSide
     }), m = w.highlightEmptySegments(M, g, f), p = [];
-    for (const v of m.clusters) {
-      const S = xo(v);
-      S && p.push(S);
+    for (const S of m.clusters) {
+      const v = xo(S);
+      v && p.push(v);
     }
     const z = wo(r).direction;
     r.checkResults = p, r.verticalDirection = z, r.originaIndex = i, o.push(r);
@@ -1275,13 +1275,13 @@ const xo = (n) => {
   for (let e = 0; e < n.length; e++) {
     const o = n[e], i = [];
     o.originalPoints.forEach((m) => {
-      let p = new y.Vector3(m.x, m.y, 0), b = !1;
+      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)) {
-          b = !0;
+          P = !0;
           break;
         }
-      b || i.push(p);
+      P || i.push(p);
     });
     const r = Math.round(Math.max(5, Math.min(350, 20 * Math.sqrt(o.length)))), s = 1;
     let a = new y.Vector3(o.start.x, o.start.y, o.start.z), l = new y.Vector3(o.end.x, o.end.y, o.end.z), u = new y.Vector3().subVectors(l, a).normalize(), h = u.clone().cross(new y.Vector3(0, 0, 1)).normalize(), d = h.clone().negate(), c = [];
@@ -1291,18 +1291,18 @@ const xo = (n) => {
     for (let m = 0; m < r; m++) {
       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 b = [];
+      let P = [];
       for (let z = 0; z < i.length; z++)
-        c.includes(z) || Po(i[z], p) && (c.push(z), b.push(i[z]));
-      b.length > 0 && f.push(Mo(b)), a = a.addScaledVector(u, w);
+        c.includes(z) || Po(i[z], p) && (c.push(z), P.push(i[z]));
+      P.length > 0 && f.push(Mo(P)), a = a.addScaledVector(u, w);
     }
     const x = new Float32Array(i.length * 3);
     i.forEach((m, p) => {
       x[p * 3] = m.x, x[p * 3 + 1] = m.y, x[p * 3 + 2] = m.z;
     });
-    const P = new y.BufferGeometry();
-    P.setAttribute("position", new y.BufferAttribute(x, 3)), P.rotateX(-Math.PI / 2), t.add(new y.Points(P, new y.PointsMaterial({ color: go(), size: 0.02 })));
-    const [M, g] = vo(f, {
+    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, {
       plane: "xy",
       trimRatio: 0
     });
@@ -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 So(n, t, e) {
+function vo(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 So(n, t, e) {
     y: u / h
   };
 }
-function vo(n, t = {}) {
+function So(n, t = {}) {
   const {
     plane: e = "xy",
     // 0 表示完全取最远两端
@@ -1403,33 +1403,33 @@ function vo(n, t = {}) {
   r /= i.length, s /= i.length, a /= i.length;
   let l = 0, u = 0, h = 0;
   for (const B of i) {
-    const L = B.x - r, N = B.y - s;
-    l += L * L, u += L * N, h += N * N;
+    const R = B.x - r, N = B.y - s;
+    l += R * R, u += R * N, h += N * N;
   }
   l /= i.length, u /= i.length, h /= i.length;
-  const d = So(l, u, h), c = {
+  const d = vo(l, u, h), c = {
     x: -d.y,
     y: d.x
   }, f = [];
   for (const B of i) {
-    const L = B.x - r, N = B.y - s, C = L * d.x + N * d.y, R = L * c.x + N * c.y;
+    const R = B.x - r, N = B.y - s, C = R * d.x + N * d.y, L = R * c.x + N * c.y;
     f.push({
       s: C,
-      t: R,
+      t: L,
       up: B.up
     });
   }
-  f.sort((B, L) => B.s - L.s);
+  f.sort((B, R) => B.s - R.s);
   const w = f.length;
-  let x = Math.floor(w * o), P = Math.ceil(w * (1 - o)) - 1;
-  x = Math.max(0, Math.min(w - 1, x)), P = Math.max(0, Math.min(w - 1, P));
-  const M = f[x], g = f[P], m = (() => {
-    const B = f.map((N) => N.t).sort((N, C) => N - C), L = Math.floor(B.length / 2);
-    return B.length % 2 === 0 ? (B[L - 1] + B[L]) * 0.5 : B[L];
+  let x = Math.floor(w * o), b = Math.ceil(w * (1 - o)) - 1;
+  x = Math.max(0, Math.min(w - 1, x)), b = Math.max(0, Math.min(w - 1, b));
+  const M = f[x], g = f[b], m = (() => {
+    const B = f.map((N) => N.t).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 = (() => {
-    const B = f.map((N) => N.up).sort((N, C) => N - C), L = Math.floor(B.length / 2);
-    return B.length % 2 === 0 ? (B[L - 1] + B[L]) * 0.5 : B[L];
-  })(), b = M.s, z = g.s, v = m, S = m, V = p, D = p, _ = r + d.x * b + c.x * v, E = s + d.y * b + c.y * v, T = r + d.x * z + c.x * S, A = s + d.y * z + c.y * S, O = nn(_, E, V, e), I = nn(T, A, D, e);
+    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);
   return [O, I];
 }
 const wi = async (n, t, e, o, i) => {
@@ -1444,26 +1444,26 @@ const wi = async (n, t, e, o, i) => {
   for (const m of n) {
     let p = [];
     if (!(!m.checkResults || m.checkResults.length <= 0)) {
-      for (let b = 0; b < m.checkResults.length; b++) {
+      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];
           return A;
         };
-        const z = m.checkResults[b];
+        const z = m.checkResults[P];
         if (z.isDoor = !1, !z.originalVertices || z.originalVertices.length == 0)
           continue;
-        const v = [];
+        const S = [];
         z.originalVertices.forEach((A) => {
           let O = [];
           A.forEach((I) => {
             O.push(new y.Vector3(I.x, I.y, I.z));
-          }), v.push(O);
+          }), S.push(O);
         });
-        const S = v.length, V = 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];
+        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];
             if (I.some((N) => B.some((C) => N.equals(C)))) {
               const N = D(A), C = D(O);
               N !== C && (V[N] = C);
@@ -1471,7 +1471,7 @@ const wi = async (n, t, e, o, i) => {
           }
         const _ = /* @__PURE__ */ new Map();
         let E = -1, T = -1;
-        for (let A = 0; A < S; A++) {
+        for (let A = 0; A < v; A++) {
           const O = D(A);
           _.has(O) || _.set(O, {
             points: [],
@@ -1483,11 +1483,11 @@ const wi = async (n, t, e, o, i) => {
             centerPts: []
           });
           const I = _.get(O);
-          let [B, L, N, C] = v[A];
-          const R = new y.Vector3().add(B).add(L).add(N).add(C).multiplyScalar(0.25);
-          if (I.points.push(...v[A]), I.area += B.distanceTo(L) * B.distanceTo(C), I.originalVertices.push(v[A]), I.index = b, I.centerPts.push(R), E == -1 || T == -1) {
-            let $ = new y.Vector3().subVectors(B, L).normalize();
-            T = B.distanceTo(C), E = B.distanceTo(L);
+          let [B, R, N, C] = S[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) {
+            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));
             X && X.parallel && ([T, E] = [E, T]);
           }
@@ -1501,11 +1501,11 @@ const wi = async (n, t, e, o, i) => {
   let r = /* @__PURE__ */ new Map();
   for (const m of n) {
     if (m.length < 0.3) continue;
-    let p = m.rooftopPz - m.start.z, b = Math.floor(m.rooftopPz - m.start.z);
-    r.has(b) ? r.set(b, {
-      num: r.get(b).num + 1,
-      totalHeight: r.get(b).totalHeight + p
-    }) : r.set(b, {
+    let p = m.rooftopPz - m.start.z, P = Math.floor(m.rooftopPz - m.start.z);
+    r.has(P) ? r.set(P, {
+      num: r.get(P).num + 1,
+      totalHeight: r.get(P).totalHeight + p
+    }) : r.set(P, {
       num: 1,
       totalHeight: p
     });
@@ -1518,17 +1518,17 @@ const wi = async (n, t, e, o, i) => {
   for (let m = 0; m < e.length; m++) {
     const p = e[m];
     if (p.isFindBeam = !1, p.category == "door") {
-      let b = [];
+      let P = [];
       p.coordinatesByArea.coordinates.forEach((D) => {
-        b.push(new y.Vector3(D.x, D.y, D.z));
-      }), b[0].equals(b[b.length - 1]) && b.pop();
-      let z = b[0].distanceTo(b[1]), v = b[0].distanceTo(b[3]);
-      v > z && ([z, v] = [v, z], b = [b[0], b[3], b[2], b[1]]);
-      let S = ee(b[0], b[3], !0), V = ee(b[1], b[2], !0);
+        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);
       a.push({
-        doorStartPt: S,
+        doorStartPt: v,
         doorEndPt: V,
-        boxPoints: b,
+        boxPoints: P,
         minZ: p.coordinatesByArea.heightData.minZ,
         maxZ: p.coordinatesByArea.heightData.maxZ,
         index: m,
@@ -1540,33 +1540,33 @@ const wi = async (n, t, e, o, i) => {
   }
   for (let m = 0; m < a.length; m++) {
     const p = a[m];
-    for (let b = 0; b < n.length; b++) {
-      if (n[b].length < 0.5) continue;
+    for (let P = 0; P < n.length; P++) {
+      if (n[P].length < 0.5) continue;
       let z = [];
-      const v = ee(n[b].start, n[b].end, !0);
-      z.push(v), z.push(ee(v, n[b].start, !0)), z.push(ee(v, n[b].end, !0));
-      let S = !1;
+      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++) {
-          const O = p.boxPoints[T].x, I = p.boxPoints[T].y, B = p.boxPoints[A].x, L = p.boxPoints[A].y;
-          I > E != L > E && _ < (B - O) * (E - I) / (L - I) + O && (S = !S);
+          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);
         }
-        if (S) break;
+        if (v) break;
       }
-      if (S) {
-        let D = new y.Vector3(n[b].start.x, n[b].start.y, 0), _ = new y.Vector3(n[b].end.x, n[b].end.y, 0), E = p.doorStartPt.distanceTo(p.doorEndPt), T = D.distanceTo(_), A = Jt(p.doorStartPt, p.doorEndPt, D, _);
+      if (v) {
+        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[b].start.x, n[b].start.y, 0), p.doorEndPt = new y.Vector3(n[b].end.x, n[b].end.y, 0);
+          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);
           break;
         } else if (Math.abs(T - E) > 1.3 && A && A.angleDeg < 15) {
-          let O = ne(p.doorStartPt, p.doorEndPt, D, _, { parallelAngleMax: y.MathUtils.degToRad(15) }), I = p.doorStartPt.distanceTo(D), B = p.doorStartPt.distanceTo(_), L = p.doorEndPt.distanceTo(D), N = p.doorEndPt.distanceTo(_), C = I < 0.2 || B < 0.2 || L < 0.2 || N < 0.2;
+          let O = ne(p.doorStartPt, p.doorEndPt, D, _, { parallelAngleMax: y.MathUtils.degToRad(15) }), I = p.doorStartPt.distanceTo(D), B = p.doorStartPt.distanceTo(_), R = p.doorEndPt.distanceTo(D), N = p.doorEndPt.distanceTo(_), C = I < 0.2 || B < 0.2 || R < 0.2 || N < 0.2;
           if (O && O.type == "collinear_overlap" && O.maxPerpendicularDistance < 0.1 && !C) {
             p.inWall = !0;
             break;
           } else {
-            let R = new y.Line3(D, _), $ = R.closestPointToPoint(p.doorStartPt, !0, new y.Vector3()), X = R.closestPointToPoint(p.doorEndPt, !0, new y.Vector3()), ot = $.distanceTo(p.doorStartPt), K = X.distanceTo(p.doorEndPt);
+            let L = new y.Line3(D, _), $ = L.closestPointToPoint(p.doorStartPt, !0, new y.Vector3()), X = L.closestPointToPoint(p.doorEndPt, !0, new y.Vector3()), ot = $.distanceTo(p.doorStartPt), K = X.distanceTo(p.doorEndPt);
             if (ot < 0.1 || K < 0.1) {
               p.inWall = !0;
               break;
@@ -1585,11 +1585,11 @@ const wi = async (n, t, e, o, i) => {
     if (p.noDetection || (p.doorAndBeamData = [], !p.mergeCheckRegion || p.mergeCheckRegion.length == 0))
       continue;
     p.completePointAreaPercentage = -1;
-    let b = new y.Box3();
-    b.setFromPoints(p.originalPoints);
-    let z = b.max.z;
-    b.min.z;
-    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 P = new y.Box3();
+    P.setFromPoints(p.originalPoints);
+    let z = 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;
     for (const E of p.mergeCheckRegion) {
       const { facePoints: T, boxArea: A, totalInPlaneNum: O } = co(
@@ -1603,22 +1603,22 @@ const wi = async (n, t, e, o, i) => {
       T[0].distanceTo(T[1]);
       let I = T[0].distanceTo(T[3]);
       const B = E.gridHeight * (I / E.gridHeight / 3 * 2) + E.gridHeight / 2;
-      let L = new y.Vector3(T[0].x, T[0].y, T[0].z + B), N = new y.Vector3(T[1].x, T[1].y, T[1].z + B);
-      const C = new y.Line3(L, N), R = [];
+      let R = new y.Vector3(T[0].x, T[0].y, T[0].z + B), N = new y.Vector3(T[1].x, T[1].y, T[1].z + B);
+      const C = new y.Line3(R, N), L = [];
       let $ = new y.Vector3();
       E.points.forEach((rt) => {
-        C.closestPointToPoint(rt, !0, $).distanceTo(rt) < E.gridHeight + 0.01 && R.push(rt);
+        C.closestPointToPoint(rt, !0, $).distanceTo(rt) < E.gridHeight + 0.01 && L.push(rt);
       });
       let X = [], ot = [];
       for (; ; ) {
         let rt = [];
-        for (let F = 0; F < R.length; F++)
-          ot.includes(F) || rt.length == 0 && (rt.push(R[F]), ot.push(F));
-        for (let F = 0; F < R.length; F++)
+        for (let F = 0; F < L.length; F++)
+          ot.includes(F) || rt.length == 0 && (rt.push(L[F]), ot.push(F));
+        for (let F = 0; F < L.length; F++)
           if (!ot.includes(F)) {
             for (let H = 0; H < rt.length; H++)
-              if (R[F].distanceTo(rt[H]) < E.gridWidth + 0.01) {
-                rt.push(R[F]), ot.push(F), F = -1;
+              if (L[F].distanceTo(rt[H]) < E.gridWidth + 0.01) {
+                rt.push(L[F]), ot.push(F), F = -1;
                 break;
               }
           }
@@ -1633,7 +1633,7 @@ const wi = async (n, t, e, o, i) => {
           lineEd: new y.Vector3(),
           facePoints: []
         };
-        let H = Se(X[rt]);
+        let H = ve(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;
@@ -1644,10 +1644,10 @@ const wi = async (n, t, e, o, i) => {
           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)
             continue;
-          let Rt = !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;
+          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 = Lt(v, W), J = Lt(v, j), ct = Lt(S, W), q = Lt(S, j);
+              let Wt = Rt(S, W), J = Rt(S, j), ct = Rt(v, W), q = Rt(v, j);
               const bt = 0.1, Vt = 10;
               if (Wt < bt || J < bt) {
                 const { newOriginalPoints: Ut } = ze(W, j, p.originalPoints), at = [];
@@ -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 St = re(Q, gt, it, dt);
+                    let vt = re(Q, gt, it, dt);
                     if (Ct != null) {
-                      if (St && St.angle > 85) {
+                      if (vt && vt.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 (St && St.angle > 85) {
+                    if (vt && vt.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(), vt = it.clone().addScaledVector(xt.clone().negate(), 0.03), Bt = dt.clone().addScaledVector(xt, 0.03);
-                      const wt = te(et, st, vt, Bt);
+                      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);
                       if (wt == null) continue;
                       let Xt = Q.distanceTo(wt.point);
                       Xt < ht && (ht = Xt, Z = U);
-                    } else if (St && St.angle < 5) {
+                    } else if (vt && vt.angle < 5) {
                       const At = new y.Vector3(W.x, W.y, 0), Y = new y.Vector3(j.x, j.y, 0);
-                      let pt = Lt(At, it), et = Lt(At, dt), st = Lt(Y, it), xt = Lt(Y, dt), vt = Jt(Q, gt, it, At), Bt = !1;
+                      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;
                       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,16 +1691,16 @@ const wi = async (n, t, e, o, i) => {
                             n[U].checkResults[wt].allCenterPoints[Kt].y,
                             0
                           ));
-                        let $t = Se(Xt);
+                        let $t = ve(Xt);
                         if ($t.length == 2) {
-                          let Kt = Lt(At, $t[0]), Le = Lt(At, $t[1]), Re = Lt(Y, $t[0]), Fe = Lt(Y, $t[1]);
-                          if (Kt < 0.2 || Le < 0.2 || Re < 0.2 || Fe < 0.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) {
                             Bt = !0;
                             break;
                           }
                         }
                       }
-                      if (vt && vt.direction == "same" && !Bt && (pt < 0.1 || et < 0.1 || st < 0.1 || xt < 0.1)) {
+                      if (St && St.direction == "same" && !Bt && (pt < 0.1 || et < 0.1 || st < 0.1 || xt < 0.1)) {
                         k = !0, ht = 1 / 0, Z = -1;
                         break;
                       }
@@ -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 St = re(Q, gt, it, dt);
+                    let vt = re(Q, gt, it, dt);
                     if (Ct != null) {
-                      if (St && St.angle > 85 && (Ct.point.distanceTo(Q), Ct.point.distanceTo(gt) < 0.3)) {
+                      if (vt && vt.angle > 85 && (Ct.point.distanceTo(Q), Ct.point.distanceTo(gt) < 0.3)) {
                         ft = !0, ht = 1 / 0, Z = -1;
                         break;
                       }
                       continue;
                     }
-                    if (St && St.angle > 85) {
+                    if (vt && vt.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(), vt = it.clone().addScaledVector(xt.clone().negate(), 0.03), Bt = dt.clone().addScaledVector(xt, 0.03);
-                      const wt = te(et, st, vt, Bt);
+                      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);
                       if (wt == null) continue;
                       let Xt = gt.distanceTo(wt.point);
                       Xt < ht && (ht = Xt, Z = U);
-                    } else if (St && St.angle < 5) {
+                    } else if (vt && vt.angle < 5) {
                       const At = new y.Vector3(W.x, W.y, 0), Y = new y.Vector3(j.x, j.y, 0);
-                      let pt = Lt(At, it), et = Lt(At, dt), st = Lt(Y, it), xt = Lt(Y, dt), vt = Jt(gt, Q, it, At), Bt = !1;
+                      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;
                       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,16 +1756,16 @@ const wi = async (n, t, e, o, i) => {
                             n[U].checkResults[wt].allCenterPoints[Kt].y,
                             0
                           ));
-                        let $t = Se(Xt);
+                        let $t = ve(Xt);
                         if ($t.length == 2) {
-                          let Kt = Lt(At, $t[0]), Le = Lt(At, $t[1]), Re = Lt(Y, $t[0]), Fe = Lt(Y, $t[1]);
-                          if (Kt < 0.2 || Le < 0.2 || Re < 0.2 || Fe < 0.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) {
                             Bt = !0;
                             break;
                           }
                         }
                       }
-                      if (vt && vt.direction == "same" && !Bt && (pt < 0.1 || et < 0.1 || st < 0.1 || xt < 0.1)) {
+                      if (St && St.direction == "same" && !Bt && (pt < 0.1 || et < 0.1 || st < 0.1 || xt < 0.1)) {
                         k = !0, ht = 1 / 0, Z = -1;
                         break;
                       }
@@ -1839,10 +1839,10 @@ const wi = async (n, t, e, o, i) => {
                   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);
                   (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) && (Rt = !0);
+              (_t || Wt || Math.abs(Mt - V) > 0.1 && Mt > V / 2 && H > 0.3) && (Lt = !0);
             }
           }
-          if (Rt) {
+          if (Lt) {
             let Wt = !1;
             for (let Z = 0; Z < d.length; Z++) {
               let k = ne(d[Z].start, d[Z].end, W, j);
@@ -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 = [], St = [];
+              const Ct = [], vt = [];
               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), 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);
+                  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);
                 }
               }), Ct.length > 0) {
                 const { newProjectPoints: et } = ze(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), vt = new y.Vector3().subVectors(xt, j), Bt = new y.Vector3().subVectors(xt, W), wt = oe(Z, Bt), Xt = oe(k, vt);
+                  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);
                   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)), St.length > 10) {
-                const { newOnLinePoints: et } = ze(lt, tt, St);
+              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);
                 for (let st = 0; st < et.length; st++) {
-                  let vt = At.closestPointToPoint(et[st], !0, Y).distanceTo(et[st]);
-                  vt > 0.02 && pt > vt && (pt = vt);
+                  let St = At.closestPointToPoint(et[st], !0, Y).distanceTo(et[st]);
+                  St > 0.02 && pt > St && (pt = St);
                 }
                 tt.z += pt, lt.z += pt, Mt += pt;
               }
@@ -1929,8 +1929,8 @@ 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 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) {
+                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) {
                   k.nearId = l, q.nearId = k.id;
                   let Bt = 0.8;
                   (k.isDoor || q.isDoor) && (k.isDoor = !0, q.isDoor = !0);
@@ -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), 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());
+                    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());
                   }
-                  const St = [];
+                  const vt = [];
                   n[k].originalPoints.forEach((st) => {
-                    st.z > W.z + 0.2 && st.z < W.z + Mt / 2 && St.push(new y.Vector3(st.x, st.y, W.z));
+                    st.z > W.z + 0.2 && st.z < W.z + Mt / 2 && vt.push(new y.Vector3(st.x, st.y, W.z));
                   });
                   const At = new y.Vector3();
                   let Y = [], pt = [];
-                  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 < 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 < pt.length; st++)
                     mo(Z, pt[st]) && Y.push(pt[st]);
                   if (Y = pt, Y = po(Y), Y.length < 150) continue;
-                  let et = Se(Y);
+                  let et = ve(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), 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)
+                      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)
                         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];
@@ -2020,55 +2020,55 @@ const wi = async (n, t, e, o, i) => {
   if (h.length > 1)
     for (let m = 0; m < h.length; m++) {
       let p = [];
-      for (let b = 0; b < n[h[m]].doorAndBeamData.length; b++) {
+      for (let P = 0; P < n[h[m]].doorAndBeamData.length; P++) {
         let z = !1;
-        if (n[h[m]].doorAndBeamData[b].type === "beam" && n[h[m]].doorAndBeamData[b].beamNearWallVec.x == 0 && n[h[m]].doorAndBeamData[b].beamNearWallVec.y == 0 && n[h[m]].doorAndBeamData[b].beamNearWallVec.z == 0 && n[h[m]].doorAndBeamData[b].nearId == -1 && (z = !0), !z) {
-          let v = n[h[m]].doorAndBeamData[b].doorStart.clone(), S = n[h[m]].doorAndBeamData[b].doorEnd.clone();
-          v.z = S.z = 0;
-          let V = v.distanceTo(S);
+        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);
           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(v, S, E, T);
+                let A = ne(S, v, E, T);
                 if (A.type == "collinear_overlap" && A.maxPerpendicularDistance < 0.2) {
-                  let O = new y.Line3(E, T), I = ee(v, S), B = O.closestPointToPoint(I, !0, new y.Vector3()), L = I.distanceTo(B);
-                  if (Math.abs(V - A.overlap) < 0.1 && L < 0.04) {
-                    n[h[D]].doorAndBeamData[_].nearId == n[h[m]].doorAndBeamData[b].id && (n[h[D]].doorAndBeamData[_].nearId = -1), z = !0;
+                  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;
                     break;
                   }
                 }
               }
         }
-        z || p.push(n[h[m]].doorAndBeamData[b]);
+        z || p.push(n[h[m]].doorAndBeamData[P]);
       }
       p.length != n[h[m]].doorAndBeamData.length && (n[h[m]].doorAndBeamData = p);
     }
-  let w = 0.65, x = 2, P = [], M = [];
+  let w = 0.65, x = 2, b = [], M = [];
   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), b = new y.Vector3(a[m].doorEndPt.x, a[m].doorEndPt.y, 0), z = new y.Vector3().subVectors(p, b).normalize();
-    for (let v = 0; v < n.length; v++) {
-      if (n[v].length < 0.7 || n[v].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), 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)
         continue;
-      let S = new y.Vector3(n[v].start.x, n[v].start.y, 0), V = new y.Vector3(n[v].end.x, n[v].end.y, 0), D = new y.Vector3().subVectors(S, V).normalize(), _ = 0.3, E = p.clone().addScaledVector(z, _), T = b.clone().addScaledVector(z.clone().negate(), _), A = S.clone().addScaledVector(D, _), O = V.clone().addScaledVector(D.clone().negate(), _);
+      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(), _);
       te(E, T, A, O);
       let I = Jt(
         E,
         T,
         A,
         O
-      ), B = p.distanceTo(S) > b.distanceTo(S) ? b : p, L = B.distanceTo(S), N = B.distanceTo(V);
-      if ((L < f || N < f) && I && !I.isParallel) {
-        let R = p.distanceTo(S), $ = p.distanceTo(V), X = R < $ ? S : V, ot = !1;
+      ), B = p.distanceTo(v) > P.distanceTo(v) ? P : p, R = B.distanceTo(v), N = B.distanceTo(V);
+      if ((R < f || N < f) && I && !I.isParallel) {
+        let L = p.distanceTo(v), $ = p.distanceTo(V), X = L < $ ? v : V, ot = !1;
         for (let K = 0; K < n.length; K++) {
-          if (K == v || P.includes(K) || n[K].length < 0.7)
+          if (K == S || 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(S, V, G, ut), qt = ne(S, V, G, ut), Rt = te(S, V, H, Mt), _t = !0;
-          if (Rt != null && (_t = Rt.point.distanceTo(S) < f || Rt.point.distanceTo(V) < f), (Zt && Zt.angle > 85 || qt && qt.type == "collinear_gap") && _t) {
-            let Et = new y.Line3(S, 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(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;
             if (W > j && j > w)
               Nt = ut, Tt = lt;
             else if (W < j && W > w)
@@ -2080,7 +2080,7 @@ const wi = async (n, t, e, o, i) => {
             let Wt = Jt(Nt, Tt, G, ut), J = Jt(Nt, Tt, E, T);
             if (J && J.isParallel || !Wt || !Wt.isParallel)
               continue;
-            let ct = ne(p, b, Nt, Tt);
+            let ct = ne(p, P, Nt, Tt);
             if (ct && ct.type == "collinear_overlap" && ct.maxPerpendicularDistance < 0.2)
               continue;
             Nt.z = Tt.z = n[K].start.z;
@@ -2107,8 +2107,8 @@ const wi = async (n, t, e, o, i) => {
             M.push({
               start: Nt,
               end: Tt
-            }), P.push(K);
-            let bt = n[K].rooftopPz - n[K].start.z, Vt = n[v].rooftopPz - n[v].start.z, Ut = bt < Vt ? bt : Vt;
+            }), 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;
             n[K].doorAndBeamData || (n[K].doorAndBeamData = []), n[K].doorAndBeamData.push({
               id: l,
               beamStart: Nt,
@@ -2148,40 +2148,40 @@ const wi = async (n, t, e, o, i) => {
     let u = n[l].length;
     if (o.has(n[l].uuid) || u < i || u > r)
       continue;
-    let h = [], d = new y.Vector3(n[l].start.x, n[l].start.y, n[l].start.z), c = new y.Vector3(n[l].end.x, n[l].end.y, n[l].end.z), w = new y.Vector3().subVectors(c, d).normalize().clone().negate(), x = new y.Vector3(), P = new y.Vector3(), M = new y.Vector3();
+    let h = [], d = new y.Vector3(n[l].start.x, n[l].start.y, n[l].start.z), c = new y.Vector3(n[l].end.x, n[l].end.y, n[l].end.z), w = new y.Vector3().subVectors(c, d).normalize().clone().negate(), x = new y.Vector3(), b = new y.Vector3(), M = new y.Vector3();
     new y.Vector3();
     for (let g = 0; g < n.length; g++) {
       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), b = new y.Vector3(n[g].end.x, n[g].end.y, n[g].end.z), z = re(d, c, p, b);
+      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)
         continue;
-      let v = kt(p, d), S = kt(p, c), V = kt(b, d), D = kt(b, c);
-      if (!(!v && !S && !V && !D)) {
-        v || S ? (x = p.clone(), P = b.clone()) : (x = b.clone(), P = p.clone()), M = new y.Vector3().subVectors(P, x).normalize(), M.clone().negate();
+      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();
         for (let _ = 0; _ < n.length; _++) {
           let E = n[_].length;
           if (_ == l || _ == g || E < i || E > r)
             continue;
-          let T = new y.Vector3(n[_].start.x, n[_].start.y, n[_].start.z), A = new y.Vector3(n[_].end.x, n[_].end.y, n[_].end.z), O = re(p, b, T, A);
+          let T = new y.Vector3(n[_].start.x, n[_].start.y, n[_].start.z), A = new y.Vector3(n[_].end.x, n[_].end.y, n[_].end.z), O = re(p, P, T, A);
           if (!O || O.angle < 85)
             continue;
-          let I = kt(T, P), B = kt(A, P);
+          let I = kt(T, b), B = kt(A, b);
           if (!I && !B) continue;
           new y.Vector3();
-          let L = new y.Vector3(), N = new y.Vector3();
-          I ? (N = new y.Vector3().subVectors(A, T).normalize(), T.clone(), L = A.clone()) : (N = new y.Vector3().subVectors(T, A).normalize(), A.clone(), L = T.clone());
+          let R = new y.Vector3(), N = new y.Vector3();
+          I ? (N = new y.Vector3().subVectors(A, T).normalize(), T.clone(), R = A.clone()) : (N = new y.Vector3().subVectors(T, A).normalize(), A.clone(), R = T.clone());
           let C = oe(w, N, 0.1);
           if (!(!C || !C.parallel || !C.sameDirection)) {
-            for (let R = 0; R < n.length; R++) {
-              let $ = n[R].length;
-              if (R == l || R == g || R == _ || $ < i || $ > r)
+            for (let L = 0; L < n.length; L++) {
+              let $ = n[L].length;
+              if (L == l || L == g || L == _ || $ < i || $ > r)
                 continue;
-              let X = new y.Vector3(n[R].start.x, n[R].start.y, n[R].start.z), ot = new y.Vector3(n[R].end.x, n[R].end.y, n[R].end.z), K = re(X, ot, T, A);
+              let X = new y.Vector3(n[L].start.x, n[L].start.y, n[L].start.z), ot = new y.Vector3(n[L].end.x, n[L].end.y, n[L].end.z), K = re(X, ot, T, A);
               if (!K || K.angle < 85)
                 continue;
-              let G = kt(X, L), ut = kt(ot, L);
+              let G = kt(X, R), ut = kt(ot, R);
               if (!G && !ut) continue;
               new y.Vector3();
               let rt = new y.Vector3();
@@ -2190,7 +2190,7 @@ const wi = async (n, t, e, o, i) => {
               if (!F && !H) continue;
               let Mt = u * m;
               if (!(Mt < s || Mt > a)) {
-                h = [n[l].uuid, n[g].uuid, n[_].uuid, n[R].uuid];
+                h = [n[l].uuid, n[g].uuid, n[_].uuid, n[L].uuid];
                 break;
               }
             }
@@ -2209,7 +2209,7 @@ const wi = async (n, t, e, o, i) => {
     if (o.has(n[l].uuid) || u < i || u > r)
       continue;
     let h = {
-      indexs: [],
+      uuids: [],
       missingEdge: {
         start: new y.Vector3(),
         end: new y.Vector3()
@@ -2218,25 +2218,25 @@ 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), b = kt(m, d), z = kt(g, c), v = kt(m, c);
-      if (p || b ? f = !1 : (z || v) && (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), z = kt(g, c), S = kt(m, c);
+      if (p || P ? f = !1 : (z || S) && (w = !1), !f && !w) break;
     }
     if (!f && !w) continue;
     let x = new y.Vector3();
     f || ([d, c] = [c, d]), x = new y.Vector3().subVectors(c, d).normalize();
-    let P = x.clone().negate();
+    let b = x.clone().negate();
     for (let M = 0; M < n.length; M++) {
       let g = n[M].length;
       if (M == l || o.has(M) || g < i || g > r)
         continue;
-      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), b = re(d, c, m, p);
-      if (!b || b.angle < 85)
+      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), v = kt(p, c);
-      if (!z && !v) continue;
+      let z = kt(m, c), S = kt(p, c);
+      if (!z && !S) continue;
       new y.Vector3();
-      let S = new y.Vector3();
-      z ? (m.clone(), S = p.clone()) : (p.clone(), S = m.clone());
+      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)
@@ -2244,28 +2244,28 @@ const wi = async (n, t, e, o, i) => {
         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);
         if (!T || T.angle < 85)
           continue;
-        let A = kt(_, S), O = kt(E, S);
+        let A = kt(_, v), O = kt(E, v);
         if (!A && !O) continue;
         let I = new y.Vector3(), B = new y.Vector3();
         A ? (I = _.clone(), B = E.clone()) : (I = E.clone(), B = _.clone());
-        let L = new y.Vector3().subVectors(B, I).normalize(), N = oe(P, L, 0.1);
+        let R = new y.Vector3().subVectors(B, I).normalize(), N = oe(b, R, 0.1);
         if (!N || !N.parallel || !N.sameDirection) continue;
-        let C = !0, R = !0;
+        let C = !0, L = !0;
         for (let X = 0; X < n.length; X++) {
           if (X == V || 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) && (R = !1), !C && !R) break;
+          if (G || ut ? C = !1 : (rt || F) && (L = !1), !C && !L) break;
         }
-        if (!C && !R) continue;
+        if (!C && !L) continue;
         let $ = u * g;
         if (!($ < s || $ > a)) {
-          h.indexs = [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[V].uuid], h.missingEdge.start = B, h.missingEdge.end = d;
           break;
         }
       }
-      if (h.indexs.length == 3) break;
+      if (h.uuids.length == 3) break;
     }
-    h.indexs.length == 3 && (h.indexs.forEach((M) => o.add(M)), e.threeEdgeRect.push(h));
+    h.uuids.length == 3 && (h.uuids.forEach((M) => o.add(M)), e.threeEdgeRect.push(h));
   }
   return e;
 }, ae = 11102230246251565e-32, Yt = 134217729, Do = (3 + 8 * ae) * ae;
@@ -2292,20 +2292,20 @@ function Ve(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);
 function Bo(n, t, e, o, i, r, s) {
-  let a, l, u, h, d, c, f, w, x, P, M, g, m, p, b, z, v, 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), P = E - x, b = w * P - (p - f * x - w * x - f * P), z = _ * D, c = Yt * _, f = c - (c - _), w = _ - f, c = Yt * D, x = c - (c - D), P = D - x, v = w * P - (z - f * x - w * x - f * P), M = b - v, d = b - M, me[0] = b - (M + d) + (d - v), 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), S = g + M, d = S - g, me[2] = g - (S - d) + (M - d), me[3] = S;
+  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 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), P = E - x, b = w * P - (p - f * x - w * x - f * P), z = l * D, c = Yt * l, f = c - (c - l), w = l - f, c = Yt * D, x = c - (c - D), P = D - x, v = w * P - (z - f * x - w * x - f * P), M = b - v, d = b - M, jt[0] = b - (M + d) + (d - v), 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), S = g + M, d = S - g, jt[2] = g - (S - d) + (M - d), jt[3] = S;
+  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;
   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), P = h - x, b = w * P - (p - f * x - w * x - f * P), z = _ * u, c = Yt * _, f = c - (c - _), w = _ - f, c = Yt * u, x = c - (c - u), P = u - x, v = w * P - (z - f * x - w * x - f * P), M = b - v, d = b - M, jt[0] = b - (M + d) + (d - v), 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), S = g + M, d = S - g, jt[2] = g - (S - d) + (M - d), jt[3] = S;
+  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;
   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), P = h - x, b = w * P - (p - f * x - w * x - f * P), z = l * u, c = Yt * l, f = c - (c - l), w = l - f, c = Yt * u, x = c - (c - u), P = u - x, v = w * P - (z - f * x - w * x - f * P), M = b - v, d = b - M, jt[0] = b - (M + d) + (d - v), 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), S = g + M, d = S - g, jt[2] = g - (S - d) + (M - d), jt[3] = S;
+  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;
   const B = qe(I, rn, 4, jt, sn);
   return sn[B - 1];
 }
-function ve(n, t, e, o, i, r) {
+function Se(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);
 }
@@ -2321,7 +2321,7 @@ class Be {
    * @param {(p: P) => number} [getY]
    */
   // @ts-expect-error TS2322
-  static from(t, e = Ro, o = Fo) {
+  static from(t, e = Lo, o = Fo) {
     const i = t.length, r = new Float64Array(i * 2);
     for (let s = 0; s < i; s++) {
       const a = t[s];
@@ -2359,19 +2359,19 @@ class Be {
       const _ = We(d, c, t[2 * V], t[2 * V + 1]);
       _ < D && (f = V, D = _);
     }
-    const P = t[2 * f], M = t[2 * f + 1];
+    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(P, M, t[2 * V], t[2 * V + 1]);
+      const _ = We(b, M, t[2 * V], t[2 * V + 1]);
       _ < D && _ > 0 && (w = V, 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(P, M, g, m, t[2 * V], t[2 * V + 1]);
+      const D = Co(b, M, g, m, t[2 * V], t[2 * V + 1]);
       D < p && (x = V, p = D);
     }
-    let b = t[2 * x], z = t[2 * x + 1];
+    let P = t[2 * x], z = t[2 * x + 1];
     if (p === 1 / 0) {
       for (let _ = 0; _ < s; _++)
         this._dists[_] = t[2 * _] - t[0] || t[2 * _ + 1] - t[1];
@@ -2385,43 +2385,43 @@ class Be {
       this.hull = V.subarray(0, D), this.triangles = new Uint32Array(0), this.halfedges = new Int32Array(0);
       return;
     }
-    if (ve(P, M, g, m, b, z) < 0) {
+    if (Se(b, M, g, m, P, z) < 0) {
       const V = w, D = g, _ = m;
-      w = x, g = b, m = z, x = V, b = D, z = _;
+      w = x, g = P, m = z, x = V, P = D, z = _;
     }
-    const v = Lo(P, M, g, m, b, z);
-    this._cx = v.x, this._cy = v.y;
+    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], v.x, v.y);
+      this._dists[V] = We(t[2 * V], t[2 * V + 1], S.x, S.y);
     ye(this._ids, this._dists, 0, s - 1), this._hullStart = f;
-    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(P, M)] = f, r[this._hashKey(g, m)] = w, r[this._hashKey(b, z)] = x, this.trianglesLen = 0, this._addTriangle(f, w, x, -1, -1, -1);
+    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 O = 0;
-      for (let C = 0, R = this._hashKey(T, A); C < this._hashSize && (O = r[(R + C) % this._hashSize], !(O !== -1 && O !== o[O])); C++)
+      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], ve(T, A, t[2 * I], t[2 * I + 1], t[2 * B], t[2 * B + 1]) >= 0; )
+      for (; B = o[I], Se(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 L = this._addTriangle(I, E, o[I], -1, -1, i[I]);
-      i[E] = this._legalize(L + 2), i[I] = L, S++;
+      let R = this._addTriangle(I, E, o[I], -1, -1, i[I]);
+      i[E] = this._legalize(R + 2), i[I] = R, v++;
       let N = o[I];
-      for (; B = o[N], ve(T, A, t[2 * N], t[2 * N + 1], t[2 * B], t[2 * B + 1]) < 0; )
-        L = this._addTriangle(N, E, B, i[E], -1, i[N]), i[E] = this._legalize(L + 2), o[N] = N, S--, N = B;
+      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;
       if (I === O)
-        for (; B = e[I], ve(T, A, t[2 * B], t[2 * B + 1], t[2 * I], t[2 * I + 1]) < 0; )
-          L = this._addTriangle(B, E, I, -1, i[I], i[B]), this._legalize(L + 2), i[B] = L, o[I] = I, S--, I = B;
+        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;
       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(S);
-    for (let V = 0, D = this._hullStart; V < S; V++)
+    this.hull = new Uint32Array(v);
+    for (let V = 0, D = this._hullStart; V < v; V++)
       this.hull[V] = D, D = o[D];
     this.triangles = this._triangles.subarray(0, this.trianglesLen), this.halfedges = this._halfedges.subarray(0, this.trianglesLen);
   }
@@ -2518,14 +2518,14 @@ function We(n, t, e, o) {
   return i * i + r * r;
 }
 function ko(n, t, e, o, i, r, s, a) {
-  const l = n - s, u = t - a, h = e - s, d = o - a, c = i - s, f = r - a, w = l * l + u * u, x = h * h + d * d, P = c * c + f * f;
-  return l * (d * P - x * f) - u * (h * P - x * c) + w * (h * f - d * c) < 0;
+  const l = n - s, u = t - a, h = e - s, d = o - a, c = i - s, f = r - a, w = l * l + u * u, x = h * h + d * d, b = c * c + f * f;
+  return l * (d * b - x * f) - u * (h * b - x * c) + w * (h * f - d * c) < 0;
 }
 function Co(n, t, e, o, i, r) {
   const s = e - n, a = o - t, l = i - n, u = r - t, h = s * s + a * a, d = l * l + u * u, c = 0.5 / (s * u - a * l), f = (u * h - a * d) * c, w = (s * d - l * h) * c;
   return f * f + w * w;
 }
-function Lo(n, t, e, o, i, r) {
+function Ro(n, t, e, o, i, r) {
   const s = e - n, a = o - t, l = i - n, u = r - t, h = s * s + a * a, d = l * l + u * u, c = 0.5 / (s * u - a * l), f = n + (u * h - a * d) * c, w = t + (s * d - l * h) * c;
   return { x: f, y: w };
 }
@@ -2559,7 +2559,7 @@ function Me(n, t, e) {
   const o = n[t];
   n[t] = n[e], n[e] = o;
 }
-function Ro(n) {
+function Lo(n) {
   return n[0];
 }
 function Fo(n) {
@@ -2622,21 +2622,21 @@ class Oo {
     const { delaunay: { points: t, hull: e, triangles: o }, vectors: i } = this;
     let r, s;
     const a = this.circumcenters = this._circumcenters.subarray(0, o.length / 3 * 2);
-    for (let x = 0, P = 0, M = o.length, g, m; x < M; x += 3, P += 2) {
-      const p = o[x] * 2, b = o[x + 1] * 2, z = o[x + 2] * 2, v = t[p], S = t[p + 1], V = t[b], D = t[b + 1], _ = t[z], E = t[z + 1], T = V - v, A = D - S, O = _ - v, I = E - S, B = (T * I - A * O) * 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;
       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 L = 1e9 * Math.sign((r - v) * I - (s - S) * O);
-        g = (v + _) / 2 - L * I, m = (S + E) / 2 + L * O;
+        const R = 1e9 * Math.sign((r - S) * I - (s - v) * O);
+        g = (S + _) / 2 - R * I, m = (v + E) / 2 + R * O;
       } else {
-        const L = 1 / B, N = T * T + A * A, C = O * O + I * I;
-        g = v + (I * N - A * C) * L, m = S + (T * C - O * N) * L;
+        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;
       }
-      a[P] = g, a[P + 1] = m;
+      a[b] = g, a[b + 1] = m;
     }
     let l = e[e.length - 1], u, h = l * 4, d, c = t[2 * l], f, w = t[2 * l + 1];
     i.fill(0);
@@ -2649,8 +2649,8 @@ class Oo {
     for (let h = 0, d = o.length; h < d; ++h) {
       const c = o[h];
       if (c < h) continue;
-      const f = Math.floor(h / 3) * 2, w = Math.floor(c / 3) * 2, x = s[f], P = s[f + 1], M = s[w], g = s[w + 1];
-      this._renderSegment(x, P, M, g, t);
+      const f = Math.floor(h / 3) * 2, w = Math.floor(c / 3) * 2, x = s[f], b = s[f + 1], M = s[w], g = s[w + 1];
+      this._renderSegment(x, b, M, g, t);
     }
     let l, u = r[r.length - 1];
     for (let h = 0; h < r.length; ++h) {
@@ -2734,13 +2734,13 @@ class Oo {
       if (r = a, s = l, a = e[f], l = e[f + 1], u = h, h = this._regioncode(a, l), u === 0 && h === 0)
         d = c, c = 0, i ? i.push(a, l) : i = [a, l];
       else {
-        let w, x, P, M, g;
+        let w, x, b, M, g;
         if (u === 0) {
           if ((w = this._clipSegment(r, s, a, l, u, h)) === null) continue;
-          [x, P, M, g] = w;
+          [x, b, M, g] = w;
         } else {
           if ((w = this._clipSegment(a, l, r, s, h, u)) === null) continue;
-          [M, g, x, P] = w, d = c, c = this._edgecode(x, P), d && c && this._edge(t, d, c, i, i.length), i ? i.push(x, P) : i = [x, P];
+          [M, g, x, b] = w, d = c, c = this._edgecode(x, b), d && c && this._edge(t, d, c, i, i.length), i ? i.push(x, b) : i = [x, b];
         }
         d = c, c = this._edgecode(M, g), d && c && this._edge(t, d, c, i, i.length), i ? i.push(M, g) : i = [M, g];
       }
@@ -3009,9 +3009,9 @@ 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], P = i[w + 1], M = i[w + 2], [g, m] = e[x], [p, b] = e[P], [z, v] = e[M], S = jo(g, m, p, b, z, v), V = Go(e, x, P, M);
-    if (S <= 1 / V)
-      for (const [D, _] of [[x, P], [P, M], [M, x]]) {
+    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)
+      for (const [D, _] of [[x, b], [b, M], [M, x]]) {
         const E = s(D, _);
         r.set(E, (r.get(E) || 0) + 1);
       }
@@ -3027,8 +3027,8 @@ function cn(n) {
   do {
     h.push(e[c]), d.add(c);
     const w = l.get(c) || [];
-    let x = w.find((P) => P !== f && !d.has(P));
-    if (x === void 0 && (x = w.find((P) => P !== f)), x === void 0) break;
+    let x = w.find((b) => b !== f && !d.has(b));
+    if (x === void 0 && (x = w.find((b) => b !== f)), x === void 0) break;
     f = c, c = x;
   } while (c !== u && h.length <= a.length + 1);
   return h;
@@ -3294,13 +3294,13 @@ function Ko(n, t = "kilometers") {
     throw new Error(t + " units is invalid");
   return n / e;
 }
-function Ln(n) {
+function Rn(n) {
   return n % (2 * Math.PI) * 180 / Math.PI;
 }
 function ie(n) {
   return n % 360 * Math.PI / 180;
 }
-function Rn(n, t = "kilometers", e = "kilometers") {
+function Ln(n, t = "kilometers", e = "kilometers") {
   if (!(n >= 0))
     throw new Error("length must be a positive number");
   return Zo(Ko(n, t), e);
@@ -3313,7 +3313,7 @@ function Qo(n) {
 }
 function Pe(n, t, e) {
   if (n !== null)
-    for (var o, i, r, s, a, l, u, h = 0, d = 0, c, f = n.type, w = f === "FeatureCollection", x = f === "Feature", P = w ? n.features.length : 1, M = 0; M < P; M++) {
+    for (var o, i, r, s, a, l, u, h = 0, d = 0, c, f = n.type, w = f === "FeatureCollection", x = f === "Feature", b = w ? n.features.length : 1, M = 0; M < b; M++) {
       u = w ? (
         // @ts-expect-error: Known type conflict
         n.features[M].geometry
@@ -3325,8 +3325,8 @@ function Pe(n, t, e) {
         var m = 0, p = 0;
         if (s = c ? u.geometries[g] : u, s !== null) {
           l = s.coordinates;
-          var b = s.type;
-          switch (h = e && (b === "Polygon" || b === "MultiPolygon") ? 1 : 0, b) {
+          var P = s.type;
+          switch (h = e && (P === "Polygon" || P === "MultiPolygon") ? 1 : 0, P) {
             case null:
               break;
             case "Point":
@@ -3357,9 +3357,9 @@ function Pe(n, t, e) {
                   ) === !1
                 )
                   return !1;
-                d++, b === "MultiPoint" && m++;
+                d++, P === "MultiPoint" && m++;
               }
-              b === "LineString" && m++;
+              P === "LineString" && m++;
               break;
             case "Polygon":
             case "MultiLineString":
@@ -3378,9 +3378,9 @@ function Pe(n, t, e) {
                     return !1;
                   d++;
                 }
-                b === "MultiLineString" && m++, b === "Polygon" && p++;
+                P === "MultiLineString" && m++, P === "Polygon" && p++;
               }
-              b === "Polygon" && m++;
+              P === "Polygon" && m++;
               break;
             case "MultiPolygon":
               for (o = 0; o < l.length; o++) {
@@ -3555,25 +3555,25 @@ var Ze = { exports: {} }, On = { exports: {} };
   (function(e, o) {
     n.exports = o();
   })(Fn, function() {
-    function e(g, m, p, b, z) {
-      (function v(S, V, D, _, E) {
+    function e(g, m, p, P, z) {
+      (function S(v, V, 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), L = Math.max(D, Math.floor(V - A * I / T + B)), N = Math.min(_, Math.floor(V + (T - A) * I / T + B));
-            v(S, V, L, N, E);
+            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 C = S[V], R = D, $ = _;
-          for (o(S, D, V), E(S[_], C) > 0 && o(S, D, _); R < $; ) {
-            for (o(S, R, $), R++, $--; E(S[R], C) < 0; ) R++;
-            for (; E(S[$], C) > 0; ) $--;
+          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; ) $--;
           }
-          E(S[D], C) === 0 ? o(S, D, $) : o(S, ++$, _), $ <= V && (D = $ + 1), V <= $ && (_ = $ - 1);
+          E(v[D], C) === 0 ? o(v, D, $) : o(v, ++$, _), $ <= V && (D = $ + 1), V <= $ && (_ = $ - 1);
         }
-      })(g, m, p || 0, b || g.length - 1, z || i);
+      })(g, m, p || 0, P || g.length - 1, z || i);
     }
     function o(g, m, p) {
-      var b = g[m];
-      g[m] = g[p], g[p] = b;
+      var P = g[m];
+      g[m] = g[p], g[p] = P;
     }
     function i(g, m) {
       return g < m ? -1 : g > m ? 1 : 0;
@@ -3583,17 +3583,17 @@ var Ze = { exports: {} }, On = { exports: {} };
     };
     function s(g, m, p) {
       if (!p) return m.indexOf(g);
-      for (var b = 0; b < m.length; b++) if (p(g, m[b])) return b;
+      for (var P = 0; P < m.length; P++) if (p(g, m[P])) return P;
       return -1;
     }
     function a(g, m) {
       l(g, 0, g.children.length, m, g);
     }
-    function l(g, m, p, b, z) {
-      z || (z = P(null)), z.minX = 1 / 0, z.minY = 1 / 0, z.maxX = -1 / 0, z.maxY = -1 / 0;
-      for (var v = m; v < p; v++) {
-        var S = g.children[v];
-        u(z, g.leaf ? b(S) : S);
+    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);
       }
       return z;
     }
@@ -3618,13 +3618,13 @@ var Ze = { exports: {} }, On = { exports: {} };
     function x(g, m) {
       return m.minX <= g.maxX && m.minY <= g.maxY && m.maxX >= g.minX && m.maxY >= g.minY;
     }
-    function P(g) {
+    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, b, z) {
-      for (var v = [m, p]; v.length; ) if (!((p = v.pop()) - (m = v.pop()) <= b)) {
-        var S = m + Math.ceil((p - m) / b / 2) * b;
-        e(g, S, m, p, z), v.push(m, S, S, p);
+    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);
       }
     }
     return r.prototype.all = function() {
@@ -3632,10 +3632,10 @@ var Ze = { exports: {} }, On = { exports: {} };
     }, r.prototype.search = function(g) {
       var m = this.data, p = [];
       if (!x(g, m)) return p;
-      for (var b = this.toBBox, z = []; m; ) {
-        for (var v = 0; v < m.children.length; v++) {
-          var S = m.children[v], V = m.leaf ? b(S) : S;
-          x(g, V) && (m.leaf ? p.push(S) : w(g, V) ? this._all(S, p) : z.push(S));
+      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));
         }
         m = z.pop();
       }
@@ -3644,10 +3644,10 @@ var Ze = { exports: {} }, On = { exports: {} };
       var m = this.data;
       if (!x(g, m)) return !1;
       for (var p = []; m; ) {
-        for (var b = 0; b < m.children.length; b++) {
-          var z = m.children[b], v = m.leaf ? this.toBBox(z) : z;
-          if (x(g, v)) {
-            if (m.leaf || w(g, v)) return !0;
+        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);
           }
         }
@@ -3664,8 +3664,8 @@ var Ze = { exports: {} }, On = { exports: {} };
       if (this.data.children.length) if (this.data.height === p.height) this._splitRoot(this.data, p);
       else {
         if (this.data.height < p.height) {
-          var b = this.data;
-          this.data = p, p = b;
+          var P = this.data;
+          this.data = p, p = P;
         }
         this._insert(p, this.data.height - p.height - 1, !0);
       }
@@ -3674,15 +3674,15 @@ var Ze = { exports: {} }, On = { exports: {} };
     }, r.prototype.insert = function(g) {
       return g && this._insert(g, this.data.height - 1), this;
     }, r.prototype.clear = function() {
-      return this.data = P([]), this;
+      return this.data = b([]), this;
     }, r.prototype.remove = function(g, m) {
       if (!g) return this;
-      for (var p, b, z, v = this.data, S = this.toBBox(g), V = [], D = []; v || V.length; ) {
-        if (v || (v = V.pop(), b = V[V.length - 1], p = D.pop(), z = !0), v.leaf) {
-          var _ = s(g, v.children, m);
-          if (_ !== -1) return v.children.splice(_, 1), V.push(v), this._condense(V), 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;
         }
-        z || v.leaf || !w(v, S) ? b ? (p++, v = b.children[p], z = !1) : v = null : (V.push(v), D.push(p), p = 0, b = v, v = v.children[0]);
+        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]);
       }
       return this;
     }, r.prototype.toBBox = function(g) {
@@ -3698,64 +3698,64 @@ var Ze = { exports: {} }, On = { exports: {} };
     }, r.prototype._all = function(g, m) {
       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, b) {
-      var z, v = p - m + 1, S = this._maxEntries;
-      if (v <= S) return a(z = P(g.slice(m, p + 1)), this.toBBox), z;
-      b || (b = Math.ceil(Math.log(v) / Math.log(S)), S = Math.ceil(v / Math.pow(S, b - 1))), (z = P([])).leaf = !1, z.height = b;
-      var V = Math.ceil(v / S), D = V * Math.ceil(Math.sqrt(S));
+    }, 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));
       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, b - 1));
+          z.children.push(this._build(g, T, A, P - 1));
         }
       }
       return a(z, this.toBBox), z;
-    }, r.prototype._chooseSubtree = function(g, m, p, b) {
-      for (; b.push(m), !m.leaf && b.length - 1 !== p; ) {
-        for (var z = 1 / 0, v = 1 / 0, S = void 0, V = 0; V < m.children.length; 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 < v ? (v = E, z = _ < z ? _ : z, S = D) : E === v && _ < z && (z = _, S = D);
+          E < S ? (S = E, z = _ < z ? _ : z, v = D) : E === S && _ < z && (z = _, v = D);
         }
-        m = S || m.children[0];
+        m = v || m.children[0];
       }
       var T, A;
       return m;
     }, r.prototype._insert = function(g, m, p) {
-      var b = p ? g : this.toBBox(g), z = [], v = this._chooseSubtree(b, this.data, m, z);
-      for (v.children.push(g), u(v, b); m >= 0 && z[m].children.length > this._maxEntries; ) this._split(z, m), m--;
-      this._adjustParentBBoxes(b, z, m);
+      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);
     }, r.prototype._split = function(g, m) {
-      var p = g[m], b = p.children.length, z = this._minEntries;
-      this._chooseSplitAxis(p, z, b);
-      var v = this._chooseSplitIndex(p, z, b), S = P(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);
+      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);
     }, r.prototype._splitRoot = function(g, m) {
-      this.data = P([g, m]), this.data.height = g.height + 1, this.data.leaf = !1, a(this.data, this.toBBox);
+      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 b, z, v, S, 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, v = I, S = void 0, V = void 0, D = void 0, _ = void 0, S = Math.max(z.minX, v.minX), V = Math.max(z.minY, v.minY), D = Math.min(z.maxX, v.maxX), _ = Math.min(z.maxY, v.maxY), Math.max(0, D - S) * Math.max(0, _ - V)), L = c(O) + c(I);
-        B < E ? (E = B, b = A, T = L < T ? L : T) : B === E && L < T && (T = L, b = A);
+      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);
+        B < E ? (E = B, P = A, T = R < T ? R : T) : B === E && R < T && (T = R, P = A);
       }
-      return b || p - m;
+      return P || p - m;
     }, r.prototype._chooseSplitAxis = function(g, m, p) {
-      var b = g.leaf ? this.compareMinX : h, z = g.leaf ? this.compareMinY : d;
-      this._allDistMargin(g, m, p, b) < this._allDistMargin(g, m, p, z) && g.children.sort(b);
-    }, r.prototype._allDistMargin = function(g, m, p, b) {
-      g.children.sort(b);
-      for (var z = this.toBBox, v = l(g, 0, m, z), S = l(g, p - m, p, z), V = f(v) + f(S), D = m; D < p - m; D++) {
+      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);
+    }, 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++) {
         var _ = g.children[D];
-        u(v, g.leaf ? z(_) : _), V += f(v);
+        u(S, g.leaf ? z(_) : _), V += f(S);
       }
       for (var E = p - m - 1; E >= m; E--) {
         var T = g.children[E];
-        u(S, g.leaf ? z(T) : T), V += f(S);
+        u(v, g.leaf ? z(T) : T), V += f(v);
       }
       return V;
     }, r.prototype._adjustParentBBoxes = function(g, m, p) {
-      for (var b = p; b >= 0; b--) u(m[b], g);
+      for (var P = p; P >= 0; P--) u(m[P], g);
     }, r.prototype._condense = function(g) {
       for (var m = g.length - 1, p = void 0; m >= 0; m--) g[m].children.length === 0 ? m > 0 ? (p = g[m - 1].children).splice(p.indexOf(g[m]), 1) : this.clear() : a(g[m], this.toBBox);
     }, r;
@@ -3833,43 +3833,43 @@ var hr = Ce.exports, Ue = { exports: {} };
     o(t);
   })(Fn, function(e) {
     const i = 33306690738754706e-32;
-    function r(x, P, M, g, m) {
-      let p, b, z, v, S = P[0], V = g[0], D = 0, _ = 0;
-      V > S == V > -S ? (p = S, S = P[++D]) : (p = V, V = g[++_]);
+    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 E = 0;
-      if (D < x && _ < M) for (V > S == V > -S ? (z = p - ((b = S + p) - S), S = P[++D]) : (z = p - ((b = V + p) - V), V = g[++_]), p = b, z !== 0 && (m[E++] = z); D < x && _ < M; ) V > S == V > -S ? (z = p - ((b = p + S) - (v = b - p)) + (S - v), S = P[++D]) : (z = p - ((b = p + V) - (v = b - p)) + (V - v), V = g[++_]), p = b, z !== 0 && (m[E++] = z);
-      for (; D < x; ) z = p - ((b = p + S) - (v = b - p)) + (S - v), S = P[++D], p = b, z !== 0 && (m[E++] = z);
-      for (; _ < M; ) z = p - ((b = p + V) - (v = b - p)) + (V - v), V = g[++_], p = b, z !== 0 && (m[E++] = z);
+      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);
       return p === 0 && E !== 0 || (m[E++] = p), E;
     }
     function s(x) {
       return new Float64Array(x);
     }
     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, P, M, g, m, p) {
-      const b = (P - p) * (M - m), z = (x - m) * (g - p), v = b - z;
-      if (b === 0 || z === 0 || b > 0 != z > 0) return v;
-      const S = Math.abs(b + z);
-      return Math.abs(v) >= a * S ? v : -function(V, D, _, E, T, A, O) {
-        let I, B, L, N, C, R, $, X, ot, K, G, ut, rt, F, H, Mt, Zt, qt;
-        const Rt = V - T, _t = _ - T, Et = D - A, Ft = E - A;
-        C = (H = (X = Rt - ($ = (R = 134217729 * Rt) - (R - Rt))) * (K = Ft - (ot = (R = 134217729 * Ft) - (R - Ft))) - ((F = Rt * Ft) - $ * ot - X * ot - $ * K)) - (G = H - (Zt = (X = Et - ($ = (R = 134217729 * Et) - (R - Et))) * (K = _t - (ot = (R = 134217729 * _t) - (R - _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;
+    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) {
+        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;
+        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 - (Rt + (C = V - Rt)) + (C - T), L = _ - (_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 && L === 0 && N === 0) || (lt = u * O + i * Math.abs(tt), (tt += Rt * N + Ft * I - (Et * L + _t * B)) >= lt || -tt >= lt)) return tt;
-        C = (H = (X = I - ($ = (R = 134217729 * I) - (R - I))) * (K = Ft - (ot = (R = 134217729 * Ft) - (R - Ft))) - ((F = I * Ft) - $ * ot - X * ot - $ * K)) - (G = H - (Zt = (X = B - ($ = (R = 134217729 * B) - (R - B))) * (K = _t - (ot = (R = 134217729 * _t) - (R - _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;
+        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;
+        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 = Rt - ($ = (R = 134217729 * Rt) - (R - Rt))) * (K = N - (ot = (R = 134217729 * N) - (R - N))) - ((F = Rt * N) - $ * ot - X * ot - $ * K)) - (G = H - (Zt = (X = Et - ($ = (R = 134217729 * Et) - (R - Et))) * (K = L - (ot = (R = 134217729 * L) - (R - L))) - ((Mt = Et * L) - $ * 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;
+        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;
         const j = r(W, d, 4, w, c);
-        C = (H = (X = I - ($ = (R = 134217729 * I) - (R - I))) * (K = N - (ot = (R = 134217729 * N) - (R - N))) - ((F = I * N) - $ * ot - X * ot - $ * K)) - (G = H - (Zt = (X = B - ($ = (R = 134217729 * B) - (R - B))) * (K = L - (ot = (R = 134217729 * L) - (R - L))) - ((Mt = B * L) - $ * 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;
+        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, P, M, g, m, p, S);
-    }, e.orient2dfast = function(x, P, M, g, m, p) {
-      return (P - p) * (M - m) - (x - m) * (g - p);
+      }(x, b, M, g, m, p, v);
+    }, e.orient2dfast = function(x, b, M, g, m, p) {
+      return (b - p) * (M - m) - (x - m) * (g - p);
     }, Object.defineProperty(e, "__esModule", { value: !0 });
   });
 })(Ue, Ue.exports);
@@ -3901,8 +3901,8 @@ function Wn(n, t, e) {
   for (var h = t * t, d = e * e; r.length; ) {
     var c = r.shift(), f = c.p, w = c.next.p, x = $e(f, w);
     if (!(x < d)) {
-      var P = x / h;
-      l = gr(i, c.prev.p, f, w, c.next.next.p, P, u), l && Math.min($e(l, f), $e(l, w)) <= P && (r.push(c), r.push(wn(l, c)), i.remove(l), u.remove(c), u.insert(Xe(c)), u.insert(Xe(c.next)));
+      var b = x / h;
+      l = gr(i, c.prev.p, f, w, c.next.next.p, b, u), l && Math.min($e(l, f), $e(l, w)) <= b && (r.push(c), r.push(wn(l, c)), i.remove(l), u.remove(c), u.insert(Xe(c)), u.insert(Xe(c.next)));
     }
   }
   c = a;
@@ -3996,8 +3996,8 @@ 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, P = h * h + d * d, M = l * c + u * f, g = h * c + d * f, m = w * P - x * x, p, b, z, v, S = m, V = m;
-  m === 0 ? (b = 0, S = 1, v = g, V = P) : (b = x * g - P * M, v = w * g - x * M, b < 0 ? (b = 0, v = g, V = P) : b > S && (b = S, v = g + x, V = P)), v < 0 ? (v = 0, -M < 0 ? b = 0 : -M > w ? b = S : (b = -M, S = w)) : v > V && (v = V, -M + x < 0 ? b = 0 : -M + x > w ? b = S : (b = -M + x, S = w)), p = b === 0 ? 0 : b / S, z = v === 0 ? 0 : v / V;
+  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 - _;
   return A * A + O * O;
 }
@@ -4053,7 +4053,7 @@ function se(n) {
     return [...n];
   throw new Error("coord must be GeoJSON Point or an Array of numbers");
 }
-function Sr(n) {
+function vr(n) {
   if (Array.isArray(n))
     return n;
   if (n.type === "Feature") {
@@ -4065,7 +4065,7 @@ function Sr(n) {
     "coords must be GeoJSON Feature, Geometry Object or an Array"
   );
 }
-function vr(n, t, e = {}) {
+function Sr(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;
 }
@@ -4076,13 +4076,13 @@ function bn(n, t) {
   const r = Math.log(
     Math.tan(o / 2 + Math.PI / 4) / Math.tan(e / 2 + Math.PI / 4)
   ), s = Math.atan2(i, r);
-  return (Ln(s) + 360) % 360;
+  return (Rn(s) + 360) % 360;
 }
 function Dr(n, t, e = {}) {
   const o = se(n), i = se(t);
   i[0] += i[0] - o[0] > 180 ? -360 : o[0] - i[0] > 180 ? 360 : 0;
   const r = _r(o, i);
-  return Rn(r, "meters", e.units);
+  return Ln(r, "meters", e.units);
 }
 function _r(n, t, e) {
   e = e === void 0 ? Ht : Number(e);
@@ -4098,7 +4098,7 @@ function _r(n, t, e) {
 }
 function Er(n, t, e, o = {}) {
   const i = t < 0;
-  let r = Rn(
+  let r = Ln(
     Math.abs(t),
     o.units,
     "meters"
@@ -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 = vr(r, s) + t, u = Dr(r, s), h = Sr(
+    const l = Sr(r, s) + t, u = Dr(r, s), h = vr(
       Er(r, u, l)
     );
     s[0] = h[0], s[1] = h[1];
@@ -4203,7 +4203,7 @@ function Gn(n, t, e = {}) {
   if (e.final === !0)
     return Ir(n, t);
   const o = se(n), i = se(t), r = ie(o[0]), s = ie(i[0]), a = ie(o[1]), l = ie(i[1]), u = Math.sin(s - r) * Math.cos(l), h = Math.cos(a) * Math.sin(l) - Math.sin(a) * Math.cos(l) * Math.cos(s - r);
-  return Ln(Math.atan2(u, h));
+  return Rn(Math.atan2(u, h));
 }
 function Ir(n, t) {
   let e = Gn(t, n);
@@ -4230,10 +4230,10 @@ function Cr(n, t = {}) {
     { bbox: n, id: t.id }
   );
 }
-function Lr(n) {
+function Rr(n) {
   return Cr(kr(n));
 }
-function Rr(n) {
+function Lr(n) {
   return er(
     n,
     (t, e) => t + Fr(e),
@@ -4286,7 +4286,7 @@ function Nr(n) {
   for (let s = 0; s < o.length - 1; s++) {
     let a = Gn(o[s], o[s + 1]), l = Pn(t, -1 * a, {
       pivot: e
-    }), u = Lr(l), h = Rr(u);
+    }), u = Rr(l), h = Lr(u);
     h < i && (i = h, r = Pn(u, a, {
       pivot: e
     }));
@@ -4349,12 +4349,12 @@ class Ie extends An {
     });
     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), Sn.set(0, 0, u);
+    Te.set(a, l, o), vn.set(0, 0, u);
     const [h, d] = qr(s);
-    return e.x = h, e.y = d, this.from(Te, e, Sn, i);
+    return e.x = h, e.y = d, this.from(Te, e, vn, i);
   }
 }
-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();
+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();
 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)}`;
@@ -4371,8 +4371,8 @@ function $r(n, t, e = 5e-3, o = 0.2) {
   for (const d of n) {
     const c = Math.floor(d.x / i), f = Math.floor(d.y / i), w = Math.floor(d.z / i);
     let x = !1;
-    for (const [P, M, g] of h) {
-      const m = `${c + P},${f + M},${w + g}`;
+    for (const [b, M, g] of h) {
+      const m = `${c + b},${f + M},${w + g}`;
       if (s.has(m)) {
         for (const p of s.get(m))
           if (d.distanceToSquared(p) < r) {
@@ -4404,7 +4404,7 @@ function Ge(n, t, e, o) {
   }
   return !1;
 }
-function vn(n, t) {
+function Sn(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;
@@ -4451,30 +4451,30 @@ const Mi = (n) => {
   if (n.length == 0) return [];
   const t = [], e = /* @__PURE__ */ new Map();
   for (let r = 0; r < n.length; r++) {
-    let s = n[r].points.map((P) => [P.x, P.y]), a = n[r].obj_id;
+    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];
     const l = a.indexOf("_") + 1, u = a.lastIndexOf("_"), h = a.substring(l, u);
     if (h === "wall")
       continue;
     let d = [];
-    for (let P = 0; P < n[r].points.length; P++)
+    for (let b = 0; b < n[r].points.length; b++)
       d.push(new y.Vector3(
-        n[r].points[P].x,
-        n[r].points[P].y,
-        n[r].points[P].z
+        n[r].points[b].x,
+        n[r].points[b].y,
+        n[r].points[b].z
       ));
     let c = -99999;
     if (h === "floor") {
-      let P = /* @__PURE__ */ new Map();
+      let b = /* @__PURE__ */ new Map();
       for (let g = 0; g < n[r].points.length; g++) {
         let m = n[r].points[g].z;
-        if (m = Math.floor(m * 10) / 10, P.has(m)) {
-          const p = P.get(m);
-          p.num += 1, p.points.push(n[r].points[g]), P.set(m, p);
+        if (m = Math.floor(m * 10) / 10, b.has(m)) {
+          const p = b.get(m);
+          p.num += 1, p.points.push(n[r].points[g]), b.set(m, p);
         } else
-          P.set(m, { num: 1, points: [n[r].points[g]] });
+          b.set(m, { num: 1, points: [n[r].points[g]] });
       }
-      let M = [...P.entries()].reduce(
+      let M = [...b.entries()].reduce(
         (g, m) => m[1].num > g[1].num ? m : g
       );
       s = [], s = M[1].points.map((g) => [g.x, g.y]), d = [], d = M[1].points.map((g) => new y.Vector3(g.x, g.y, g.z)), c = M[0];
@@ -4496,9 +4496,9 @@ 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 P = 0; P < t.length; P++)
-      if (t[P].type == h) {
-        x = P;
+    for (let b = 0; b < t.length; b++)
+      if (t[b].type == h) {
+        x = b;
         break;
       }
     if (x != -1 ? t[x].array.push(w) : t.push({
@@ -4506,8 +4506,8 @@ const Mi = (n) => {
       array: [w]
     }), h == "floor" && c != -99999)
       if (e.has(c)) {
-        const P = e.get(c);
-        P.num += w.points.length, P.datas.push(w), e.set(c, P);
+        const b = e.get(c);
+        b.num += w.points.length, b.datas.push(w), e.set(c, b);
       } else
         e.set(c, { num: w.points.length, datas: [w] });
   }
@@ -4538,9 +4538,9 @@ const Mi = (n) => {
           continue;
         if (d.obb.intersectsOBB(s[c].obb)) {
           a.push(c);
-          for (let P = 0; P < s[c].points.length; P++)
-            (s[c].points[P].z > o && s[c].points[P].z - o > 0.1 || d.type == "floor") && d.points.push(s[c].points[P]);
-          const w = d.points.map((P) => [P.x, P.y]);
+          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]);
+          const w = d.points.map((b) => [b.x, b.y]);
           d.path = cn(w);
           const x = Dn(d.points);
           d.h = x.h, d.minz = x.minz, d.maxz = x.maxz, d.center = { x: x.x, y: x.y, z: x.z }, d.obb = _n(d.path, d.center, d.h, (d.maxz + d.minz) / 2), d.positionArr.push(...s[c].positionArr), c = h;
@@ -4581,10 +4581,10 @@ const Mi = (n) => {
           const w = t[c].array;
           for (let x = 0; x < w.length; x++) {
             if (w[x].isDel) continue;
-            const P = w[x].obb, M = w[x].minz;
-            if (w[x].maxz, u.intersectsOBB(P)) {
+            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, P), m = vn(u, P);
+              const g = pe(a[l].points, b), m = Sn(u, b);
               if (g >= 0.3 && m == -1) {
                 a[l].isDel = !0;
                 break;
@@ -4595,11 +4595,11 @@ const Mi = (n) => {
                     w[x].isDel = !0;
                     continue;
                   }
-                  if (f === "balcony railing" && we(P, a[l].points)) {
+                  if (f === "balcony railing" && we(b, a[l].points)) {
                     a[l].isDel = !0;
                     break;
                   }
-                  if (f === "balcony railing" && Ge(u, P, a[l].points, w[x].points) && (Math.abs(h - M) < 0.1 || Math.abs(M - d) > 0.3)) {
+                  if (f === "balcony railing" && Ge(u, b, a[l].points, w[x].points) && (Math.abs(h - M) < 0.1 || Math.abs(M - d) > 0.3)) {
                     w[x].isDel = !0;
                     continue;
                   }
@@ -4608,37 +4608,37 @@ const Mi = (n) => {
                     w[x].isDel = !0;
                     continue;
                   }
-                  if (f === "window" && we(P, a[l].points)) {
+                  if (f === "window" && we(b, a[l].points)) {
                     a[l].isDel = !0;
                     break;
                   }
-                  if (f === "window" && Ge(u, P, a[l].points, w[x].points) && (Math.abs(h - M) < 0.1 || Math.abs(h - d) > 0.3)) {
+                  if (f === "window" && Ge(u, b, a[l].points, w[x].points) && (Math.abs(h - M) < 0.1 || Math.abs(h - d) > 0.3)) {
                     a[l].isDel = !0;
                     break;
                   }
                 }
-                let p = !1, b = [], z = [];
-                const v = a[l].points, S = w[x].points;
-                if (v.length > S.length ? (p = !0, b = v, z = S) : (b = S, z = v), $r(z, b, 0.03, 0.5) > 0.5)
+                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)
                   if (p)
                     w[x].isDel = !0;
                   else {
                     a[l].isDel = !0;
                     break;
                   }
-                else if (Ge(u, P)) {
-                  const D = vn(u, P);
+                else if (Ge(u, b)) {
+                  const D = Sn(u, b);
                   if (D === 1 || D === 0) {
                     if (f === "switch") continue;
-                    v.length > S.length ? pe(z, u) >= 0.5 && (w[x].isDel = !0) : pe(b, u) >= 0.5 && (w[x].isDel = !0);
+                    S.length > v.length ? pe(z, u) >= 0.5 && (w[x].isDel = !0) : pe(P, u) >= 0.5 && (w[x].isDel = !0);
                   } else {
                     if (s === "switch") continue;
-                    if (v.length > S.length) {
-                      if (pe(b, P) >= 0.5) {
+                    if (S.length > v.length) {
+                      if (pe(P, b) >= 0.5) {
                         a[l].isDel = !0;
                         break;
                       }
-                    } else if (pe(z, P) >= 0.5) {
+                    } else if (pe(z, b) >= 0.5) {
                       a[l].isDel = !0;
                       break;
                     }
@@ -4722,7 +4722,7 @@ function jr(n, t) {
       const c = i(h, d);
       if (o.has(c)) continue;
       o.add(c);
-      const [f, w] = n[h], [x, P] = n[d], M = Math.hypot(x - f, P - w);
+      const [f, w] = n[h], [x, b] = n[d], M = Math.hypot(x - f, b - w);
       Number.isFinite(M) && M > 0 && e.push(M);
     }
   }
@@ -4774,19 +4774,19 @@ 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], P = s[f + 2], [M, g] = i[w], [m, p] = i[x], [b, z] = i[P], { radius: v, maxEdge: S } = Gr(
+    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(
       M,
       g,
       m,
       p,
-      b,
+      P,
       z
-    ), V = Hr(i, w, x, P) * o;
-    if (v <= 1 / V && S <= l) {
+    ), V = Hr(i, w, x, b) * o;
+    if (S <= 1 / V && v <= l) {
       const D = [
         [w, x],
-        [x, P],
-        [P, w]
+        [x, b],
+        [b, w]
       ];
       for (const [_, E] of D) {
         const T = h(_, E);
@@ -4856,12 +4856,12 @@ function ei(n, t, e = 0.15) {
     for (const f of t) {
       if (f === n) continue;
       const w = be(c, f.start), x = be(c, f.end);
-      let P = null;
-      if (w <= e ? P = f.end : x <= e && (P = f.start), !P) continue;
+      let b = null;
+      if (w <= e ? b = f.end : x <= e && (b = f.start), !b) continue;
       const M = f.end.x - f.start.x, g = f.end.y - f.start.y, m = Math.sqrt(M * M + g * g);
       if (m < 1e-12 || Math.abs(o * M + i * g) / (r * m) >= 0.342) continue;
-      const b = (P.x - c.x) * s + (P.y - c.y) * a;
-      l[d].push(b > 0 ? 1 : -1);
+      const P = (b.x - c.x) * s + (b.y - c.y) * a;
+      l[d].push(P > 0 ? 1 : -1);
     }
   }
   if (l[0].length === 0 || l[1].length === 0) return 0;
@@ -4941,7 +4941,7 @@ function li(n, t) {
         let c = r.start, f = r.end;
         a ? f = s.end : l ? c = s.start : u ? f = s.start : h && (c = s.end);
         const w = Math.hypot(f.x - c.x, f.y - c.y), x = { ...r };
-        x.start = c, x.end = f, x.length = w, x.direction = { x: (f.x - c.x) / w, y: (f.y - c.y) / w, z: 0 }, x.rooftopPz = r.rooftopPz !== void 0 ? r.rooftopPz : s.rooftopPz, x.buildRosource = r.buildRosource || s.buildRosource, x.isRebuild = !1, x.doorAndBeamData || (x.doorAndBeamData = []), x.insetionArr || (x.insetionArr = []), n[o] = x, t[o] = [.../* @__PURE__ */ new Set([...t[o], ...t[i]])], n.splice(i, 1), t.splice(i, 1), i--, e = !0;
+        x.start = c, x.end = f, x.length = w, x.direction = { x: (f.x - c.x) / w, y: (f.y - c.y) / w, z: 0 }, r.rooftopPz !== void 0 && s.rooftopPz !== void 0 ? x.rooftopPz = Math.max(r.rooftopPz, s.rooftopPz) : x.rooftopPz = r.rooftopPz !== void 0 ? r.rooftopPz : s.rooftopPz, x.buildRosource = r.buildRosource || s.buildRosource, x.isRebuild = !1, x.doorAndBeamData || (x.doorAndBeamData = []), x.insetionArr || (x.insetionArr = []), n[o] = x, t[o] = [.../* @__PURE__ */ new Set([...t[o], ...t[i]])], n.splice(i, 1), t.splice(i, 1), i--, e = !0;
       }
   }
   return { segments: n, sourceMap: t };
@@ -4963,14 +4963,14 @@ function Zn(n, t = 5, e = 0.05) {
       return { seg: M.seg, offset: Math.abs(g * f + m * w), idx: M.idx };
     });
     x.sort((M, g) => M.offset - g.offset);
-    const P = ii(x);
-    for (const M of P) {
+    const b = ii(x);
+    for (const M of b) {
       let g = M[0].seg;
       for (const E of M)
         E.seg.length > g.length && (g = E.seg);
-      const m = g.end.x - g.start.x, p = g.end.y - g.start.y, b = Math.sqrt(m * m + p * p);
-      if (b < 1e-12) continue;
-      const z = m / b, v = p / b, S = M.map((E) => E.seg.rooftopPz ?? 0), V = Math.max(...S), D = [...new Set(S.map((E) => E.toFixed(3)))];
+      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)))];
       if (D.length > 1) {
         const E = M.map((T) => ({
           idx: T.idx,
@@ -4982,10 +4982,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, v, e);
+      const _ = si(M, g, z, S, e);
       for (const { l: E, r: T, srcIdxs: A } of _) {
         if (T - E < 0.01) continue;
-        const O = ai(g, E, T, z, v, V, g.buildRosource);
+        const O = ai(g, E, T, z, S, V, g.buildRosource);
         r.push(O), s.push(A);
       }
     }
@@ -5028,35 +5028,35 @@ function hi(n, t, e, o, i, r, s) {
         continue;
       const { start: c, end: f } = h;
       let w = !1, x = 1 / 0;
-      for (const S of i) {
-        const { dist: V, t: D } = Un(S.x, S.y, c.x, c.y, f.x, f.y);
+      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));
       }
       if (!w) {
         `${u.maxDist}${(-u.margin).toFixed(1)}${(1 + u.margin).toFixed(1)}`;
         continue;
       }
-      const P = Math.sqrt((f.x - c.x) ** 2 + (f.y - c.y) ** 2);
-      if (P < 1e-12) continue;
-      const M = (f.x - c.x) / P, g = (f.y - c.y) / P, m = Math.abs(e * M + o * g), p = Math.abs(-o * M + e * g), b = Math.max(m, p), z = Math.acos(Math.min(b, 1)) * (180 / Math.PI);
+      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}`;
         continue;
       }
-      let v = 0;
-      if (P > 0.01) {
-        const S = [];
+      let S = 0;
+      if (b > 0.01) {
+        const v = [];
         for (let _ = 1; _ <= 4; _++) {
-          const E = i[_], T = E.x - c.x, A = E.y - c.y, O = (T * M + A * g) / P;
-          S.push(O);
+          const E = i[_], T = E.x - c.x, A = E.y - c.y, O = (T * M + A * g) / b;
+          v.push(O);
         }
-        const V = Math.min(...S), D = Math.max(...S);
-        D > V && (v = Math.max(0, Math.min(1, D) - Math.max(0, V)) / (D - V));
+        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));
       }
       l.push({
         seg: h,
         minDist: x,
-        embedRatio: v,
+        embedRatio: S,
         ratio: h.length / t,
         score: 0,
         details: { conn: 0, variance: 0, sameSide: 0 }
@@ -5075,31 +5075,31 @@ 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((v) => {
-    const S = v.x - n.start.x, V = v.y - n.start.y;
-    return (S * 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, P = e.box.min.z, M = e.box.max.z, g = Math.abs(M - P), m = jn(o, n.start.x, n.start.y), p = Math.max(0, P - m), b = 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((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);
   return {
     p: { x: w, y: x, z },
     width: c,
-    full: b,
+    full: P,
     height: g,
     groundClearance: p
   };
 }
 function Kn(n, t, e) {
-  var h, d, c, f, w;
-  const o = t.map((x) => e[x]), i = [], r = [], s = [], a = [], l = [];
-  let u;
-  for (const x of o) {
-    if ((h = x.points) != null && h.length) for (const P of x.points) i.push(P);
-    if ((d = x.originalPoints) != null && d.length) for (const P of x.originalPoints) r.push(P);
-    if ((c = x.doorAndBeamData) != null && c.length) for (const P of x.doorAndBeamData) s.push(P);
-    if ((f = x.insetionArr) != null && f.length) for (const P of x.insetionArr) a.push(P);
-    if ((w = x.drawWindow) != null && w.length) for (const P of x.drawWindow) l.push(P);
-    x.boxData && !u && (u = x.boxData);
-  }
-  i.length && (n.points = i), r.length && (n.originalPoints = r), s.length && (n.doorAndBeamData = s), a.length && (n.insetionArr = a), l.length && (n.drawWindow = l), u && (n.boxData = u);
+  var d, c, f, w, x;
+  const o = t.map((b) => e[b]), i = [], r = [], s = [], a = [], l = [];
+  let u, h;
+  for (const b of o) {
+    if ((d = b.points) != null && d.length) for (const M of b.points) i.push(M);
+    if ((c = b.originalPoints) != null && c.length) for (const M of b.originalPoints) r.push(M);
+    if ((f = b.doorAndBeamData) != null && f.length) for (const M of b.doorAndBeamData) s.push(M);
+    if ((w = b.insetionArr) != null && w.length) for (const M of b.insetionArr) a.push(M);
+    if ((x = b.drawWindow) != null && x.length) for (const M of b.drawWindow) l.push(M);
+    b.boxData && !u && (u = b.boxData), b.rooftopPz !== void 0 && (h === void 0 || b.rooftopPz > h) && (h = b.rooftopPz);
+  }
+  i.length && (n.points = i), r.length && (n.originalPoints = r), s.length && (n.doorAndBeamData = s), a.length && (n.insetionArr = a), l.length && (n.drawWindow = l), u && (n.boxData = u), h !== void 0 && (n.rooftopPz = h);
 }
 function mi(n, t, e, o) {
   var u;
@@ -5108,7 +5108,7 @@ function mi(n, t, e, o) {
     const d = (u = h.coordinatesByArea) == null ? void 0 : u.coordinates;
     if (!d || d.length < 4)
       continue;
-    const c = d.slice(0, 4), f = c.reduce((D, _) => D + _.x, 0) / 4, w = c.reduce((D, _) => D + _.y, 0) / 4, { longSide: x, dirX: P, dirY: M } = Qr(c);
+    const c = d.slice(0, 4), f = c.reduce((D, _) => D + _.x, 0) / 4, w = c.reduce((D, _) => D + _.y, 0) / 4, { longSide: x, dirX: b, dirY: M } = Qr(c);
     if (x < 0.01)
       continue;
     const g = c.reduce((D, _) => D + _.z, 0) / 4, m = jn(t, f, w);
@@ -5116,12 +5116,12 @@ function mi(n, t, e, o) {
       continue;
     const p = ui(c, f, w);
     h.name;
-    let b = hi(l, x, P, M, p, i, h.name);
-    b = fi(b, p, t, h.name);
-    let z = null, v = 1 / 0, S = 0;
-    if (b.length > 0) {
-      const D = b[0];
-      z = D.seg, v = D.minDist, S = D.ratio;
+    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;
+    if (P.length > 0) {
+      const D = P[0];
+      z = D.seg, S = D.minDist, v = D.ratio;
     }
     let V;
     if (z && (V = di(z, c, h, s), !i.printOnly)) {
@@ -5133,8 +5133,8 @@ function mi(n, t, e, o) {
       windowCategory: h.category,
       windowCenter: h.center,
       wallSegment: z,
-      distance: v,
-      wallLengthRatio: S,
+      distance: S,
+      wallLengthRatio: v,
       drawWindow: V
     });
   }