npm - rm-graphical-computing - Versions diffs - 1.0.64 → 1.0.66 - Mend

rm-graphical-computing 1.0.64 → 1.0.66

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (3) hide show

package/dist/index.js CHANGED Viewed

@@ -1,67 +1,67 @@
 var Qn = Object.defineProperty;
 var Jn = (n, t, e) => t in n ? Qn(n, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : n[t] = e;
-var Fe = (n, t, e) => Jn(n, typeof t != "symbol" ? t + "" : t, e);
+var Oe = (n, t, e) => Jn(n, typeof t != "symbol" ? t + "" : t, e);
 import * as y from "three";
-import { BufferGeometry as to, BufferAttribute as eo, Plane as no, Vector3 as zt, Matrix3 as Tn, MathUtils as Oe, Box3 as oo, Matrix4 as En, Ray as ro } from "three";
+import { BufferGeometry as to, BufferAttribute as eo, Plane as no, Vector3 as zt, Matrix3 as En, MathUtils as Ne, Box3 as oo, Matrix4 as Tn, Ray as ro } from "three";
 function io(n, t = !1) {
   const e = n[0].index !== null, o = new Set(Object.keys(n[0].attributes)), i = new Set(Object.keys(n[0].morphAttributes)), r = {}, s = {}, a = n[0].morphTargetsRelative, l = new to();
   let u = 0;
   for (let h = 0; h < n.length; ++h) {
-    const g = n[h];
+    const d = n[h];
     let c = 0;
-    if (e !== (g.index !== null))
+    if (e !== (d.index !== null))
       return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + ". All geometries must have compatible attributes; make sure index attribute exists among all geometries, or in none of them."), null;
-    for (const m in g.attributes) {
-      if (!o.has(m))
-        return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + '. All geometries must have compatible attributes; make sure "' + m + '" attribute exists among all geometries, or in none of them.'), null;
-      r[m] === void 0 && (r[m] = []), r[m].push(g.attributes[m]), c++;
+    for (const f in d.attributes) {
+      if (!o.has(f))
+        return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + '. All geometries must have compatible attributes; make sure "' + f + '" attribute exists among all geometries, or in none of them.'), null;
+      r[f] === void 0 && (r[f] = []), r[f].push(d.attributes[f]), c++;
     }
     if (c !== o.size)
       return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + ". Make sure all geometries have the same number of attributes."), null;
-    if (a !== g.morphTargetsRelative)
+    if (a !== d.morphTargetsRelative)
       return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + ". .morphTargetsRelative must be consistent throughout all geometries."), null;
-    for (const m in g.morphAttributes) {
-      if (!i.has(m))
+    for (const f in d.morphAttributes) {
+      if (!i.has(f))
         return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + ".  .morphAttributes must be consistent throughout all geometries."), null;
-      s[m] === void 0 && (s[m] = []), s[m].push(g.morphAttributes[m]);
+      s[f] === void 0 && (s[f] = []), s[f].push(d.morphAttributes[f]);
     }
     if (t) {
-      let m;
+      let f;
       if (e)
-        m = g.index.count;
-      else if (g.attributes.position !== void 0)
-        m = g.attributes.position.count;
+        f = d.index.count;
+      else if (d.attributes.position !== void 0)
+        f = d.attributes.position.count;
       else
         return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + ". The geometry must have either an index or a position attribute"), null;
-      l.addGroup(u, m, h), u += m;
+      l.addGroup(u, f, h), u += f;
     }
   }
   if (e) {
     let h = 0;
-    const g = [];
+    const d = [];
     for (let c = 0; c < n.length; ++c) {
-      const m = n[c].index;
-      for (let w = 0; w < m.count; ++w)
-        g.push(m.getX(w) + h);
+      const f = n[c].index;
+      for (let w = 0; w < f.count; ++w)
+        d.push(f.getX(w) + h);
       h += n[c].attributes.position.count;
     }
-    l.setIndex(g);
+    l.setIndex(d);
   }
   for (const h in r) {
-    const g = Qe(r[h]);
-    if (!g)
+    const d = Qe(r[h]);
+    if (!d)
       return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the " + h + " attribute."), null;
-    l.setAttribute(h, g);
+    l.setAttribute(h, d);
   }
   for (const h in s) {
-    const g = s[h][0].length;
-    if (g === 0) break;
+    const d = s[h][0].length;
+    if (d === 0) break;
     l.morphAttributes = l.morphAttributes || {}, l.morphAttributes[h] = [];
-    for (let c = 0; c < g; ++c) {
-      const m = [];
+    for (let c = 0; c < d; ++c) {
+      const f = [];
       for (let x = 0; x < s[h].length; ++x)
-        m.push(s[h][x][c]);
-      const w = Qe(m);
+        f.push(s[h][x][c]);
+      const w = Qe(f);
       if (!w)
         return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the " + h + " morphAttribute."), null;
       l.morphAttributes[h].push(w);
@@ -88,11 +88,11 @@ function Qe(n) {
   for (let u = 0; u < n.length; ++u) {
     const h = n[u];
     if (h.isInterleavedBufferAttribute) {
-      const g = l / e;
-      for (let c = 0, m = h.count; c < m; c++)
+      const d = l / e;
+      for (let c = 0, f = h.count; c < f; c++)
         for (let w = 0; w < e; w++) {
           const x = h.getComponent(c, w);
-          a.setComponent(c + g, w, x);
+          a.setComponent(c + d, w, x);
         }
     } else
       s.set(h.array, l);
@@ -108,8 +108,8 @@ const so = (n, t, e) => {
 }, te = (n, t, e, o, i = 1e-8) => {
   const r = t.x - n.x, s = t.y - n.y, a = o.x - e.x, l = o.y - e.y, u = r * l - s * a;
   if (Math.abs(u) < i) return null;
-  const h = ((e.x - n.x) * l - (e.y - n.y) * a) / u, g = ((e.x - n.x) * s - (e.y - n.y) * r) / u;
-  return h < -i || h > 1 + i || g < -i || g > 1 + i ? null : {
+  const h = ((e.x - n.x) * l - (e.y - n.y) * a) / u, d = ((e.x - n.x) * s - (e.y - n.y) * r) / u;
+  return h < -i || h > 1 + i || d < -i || d > 1 + i ? null : {
     point: new y.Vector3(
       n.x + h * r,
       n.y + h * s,
@@ -128,26 +128,26 @@ const so = (n, t, e) => {
   } = e, h = document.createElement("canvas").getContext("2d");
   h.font = `bold ${o}px ${i}`;
   const c = h.measureText(n).width;
-  let m = Math.min(c + a * 2, l), w = o + a * 2;
+  let f = Math.min(c + a * 2, l), w = o + a * 2;
   const x = document.createElement("canvas");
-  x.width = m, x.height = w;
+  x.width = f, x.height = w;
   const P = x.getContext("2d");
-  P.fillStyle = r, P.fillRect(0, 0, m, w), P.fillStyle = s, P.font = `bold ${o}px ${i}`, P.textAlign = "center", P.textBaseline = "middle", c > l - a * 2 ? lo(P, n, m / 2, w / 2, l, o) : P.fillText(n, m / 2, w / 2);
-  const M = new y.CanvasTexture(x), d = new y.SpriteMaterial({
+  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 M = new y.CanvasTexture(x), g = new y.SpriteMaterial({
     map: M,
     depthTest: !1,
     transparent: !0
-  }), f = new y.Sprite(d);
-  f.position.set(t.x, t.y, t.z);
+  }), m = new y.Sprite(g);
+  m.position.set(t.x, t.y, t.z);
   const p = 5e-3;
-  return f.scale.set(m * p, w * p, 1), f;
+  return m.scale.set(f * p, w * p, 1), m;
 };
 function lo(n, t, e, o, i, r) {
   const s = t.split("");
   let a = "", l = r * 1.2, u = o;
   for (let h = 0; h < s.length; h++) {
-    const g = a + s[h];
-    n.measureText(g).width > i && h > 0 ? (n.fillText(a, e, u), a = s[h], u += l) : a = g;
+    const d = a + s[h];
+    n.measureText(d).width > i && h > 0 ? (n.fillText(a, e, u), a = s[h], u += l) : a = d;
   }
   n.fillText(a, e, u);
 }
@@ -169,69 +169,69 @@ const oe = (n, t, e = 0.01) => {
   let r = [];
   if (o && o.length && (r = o.map((z) => z.clone())), !i || i.length < 4) return {};
   const s = new y.Vector3().subVectors(i[1], i[0]).normalize(), a = new y.Vector3().subVectors(i[3], i[0]).normalize(), l = s.clone().cross(a).normalize();
-  let u = 1 / 0, h = -1 / 0, g = 1 / 0, c = -1 / 0;
+  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 < g && (g = S), S > c && (c = S);
+    v < u && (u = v), v > h && (h = v), S < d && (d = S), S > c && (c = S);
   }
-  const m = i[0].dot(l), w = s.clone().multiplyScalar(u).add(a.clone().multiplyScalar(g)).add(l.clone().multiplyScalar(m)), x = s.clone().multiplyScalar(h).add(a.clone().multiplyScalar(g)).add(l.clone().multiplyScalar(m)), P = s.clone().multiplyScalar(h).add(a.clone().multiplyScalar(c)).add(l.clone().multiplyScalar(m)), M = s.clone().multiplyScalar(u).add(a.clone().multiplyScalar(c)).add(l.clone().multiplyScalar(m));
-  let d = [w, x, P, M], f = oe(new y.Vector3().subVectors(w, x), new y.Vector3(0, 0, 1));
-  f && f.parallel && (d = [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)), 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]);
   let p = 0;
   if (o.length > 0) {
-    const z = new y.Vector3().subVectors(d[1], d[0]).normalize(), v = z.clone().negate(), S = new y.Vector3().subVectors(d[3], d[0]).normalize(), V = S.clone().negate();
-    let D = d[0].distanceTo(d[1]), _ = d[0].distanceTo(d[3]), T = D / t, E = _ / e, A = 1e-3;
-    for (let O = 0; O < T; O++) {
-      let I = d[0], B = 0;
-      for (let R = 0; R < E; R++) {
-        let W = I.clone().addScaledVector(z, t), C = W.clone().addScaledVector(S, e), L = I.clone().addScaledVector(S, e), H = new y.Vector3().add(I).add(W).add(C).add(L).multiplyScalar(0.25);
+    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();
+    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 X = 0; X < r.length; X++)
-          if (r[X].distanceTo(H) < A) {
+          if (r[X].distanceTo($) < A) {
             B++;
             break;
           }
-        I = L;
+        I = R;
       }
-      if (B >= E / 2)
+      if (B >= T / 2)
         break;
-      p += B, d[0] = d[0].addScaledVector(z, t), d[3] = d[3].addScaledVector(z, t);
+      p += B, g[0] = g[0].addScaledVector(z, t), g[3] = g[3].addScaledVector(z, t);
     }
-    D = d[0].distanceTo(d[1]), T = D / t;
-    for (let O = 0; O < T; O++) {
-      let I = d[1], B = 0;
-      for (let R = 0; R < E; R++) {
-        let W = I.clone().addScaledVector(v, t), C = W.clone().addScaledVector(S, e), L = I.clone().addScaledVector(S, e), H = new y.Vector3().add(I).add(W).add(C).add(L).multiplyScalar(0.25);
+    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 X = 0; X < r.length; X++)
-          if (r[X].distanceTo(H) < A) {
+          if (r[X].distanceTo($) < A) {
             B++;
             break;
           }
-        I = L;
+        I = R;
       }
-      if (B >= E / 2)
+      if (B >= T / 2)
         break;
-      p += B, d[1] = d[1].addScaledVector(v, t), d[2] = d[2].addScaledVector(v, t);
+      p += B, g[1] = g[1].addScaledVector(v, t), g[2] = g[2].addScaledVector(v, t);
     }
-    D = d[0].distanceTo(d[1]), T = D / t;
-    for (let O = 0; O < E; O++) {
-      let I = d[3], B = 0;
-      for (let R = 0; R < T; R++) {
-        let W = I.clone().addScaledVector(z, t), C = W.clone().addScaledVector(V, e), L = I.clone().addScaledVector(V, e), H = new y.Vector3().add(I).add(W).add(C).add(L).multiplyScalar(0.25);
+    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 X = 0; X < r.length; X++)
-          if (r[X].distanceTo(H) < A) {
+          if (r[X].distanceTo($) < A) {
             B++;
             break;
           }
-        I = W;
+        I = N;
       }
-      if (B >= T / 2)
+      if (B >= E / 2)
         break;
-      p += B, d[2] = d[2].addScaledVector(V, e), d[3] = d[3].addScaledVector(V, e);
+      p += B, g[2] = g[2].addScaledVector(V, e), g[3] = g[3].addScaledVector(V, e);
     }
   }
-  const b = d[0].distanceTo(d[1]) * d[0].distanceTo(d[3]);
+  const b = g[0].distanceTo(g[1]) * g[0].distanceTo(g[3]);
   return {
-    facePoints: d,
+    facePoints: g,
     boxArea: b,
     totalInPlaneNum: p
   };
@@ -264,17 +264,17 @@ const oe = (n, t, e = 0.01) => {
   if (s === 0 || a === 0)
     return { rate: NaN, angle: NaN, isPerpendicular: !1, isParallel: !1 };
   i.normalize(), r.normalize();
-  const l = Math.abs(i.dot(r)), u = Math.min(1, Math.max(0, l)), h = Math.acos(u), g = y.MathUtils.radToDeg(h), c = 1 - u;
+  const l = Math.abs(i.dot(r)), u = Math.min(1, Math.max(0, l)), h = Math.acos(u), d = y.MathUtils.radToDeg(h), c = 1 - u;
   return {
     rate: c,
     // 垂直率 0~1
     percent: `${(c * 100).toFixed(2)}%`,
     // 垂直率百分比
-    angle: g,
+    angle: d,
     // 夹角（度，0~90）
-    isPerpendicular: Math.abs(g - 90) < 0.01,
+    isPerpendicular: Math.abs(d - 90) < 0.01,
     // 是否垂直
-    isParallel: g < 0.01
+    isParallel: d < 0.01
     // 是否平行
   };
 }, ee = (n, t, e = !1) => new y.Vector3((n.x + t.x) / 2, (n.y + t.y) / 2, e ? 0 : (n.z + t.z) / 2), ne = (n, t, e, o, i = {}) => {
@@ -284,9 +284,9 @@ const oe = (n, t, e = 0.01) => {
     distanceThreshold: a = 2,
     overlapThreshold: l = 0.01
     // 投影重叠量大于此值才算 overlap
-  } = i, u = new y.Vector3().subVectors(t, n), h = new y.Vector3().subVectors(o, e), g = u.clone().normalize(), c = h.clone().normalize();
-  let m = y.MathUtils.clamp(g.dot(c), -1, 1);
-  const w = Math.acos(Math.abs(m)), x = y.MathUtils.radToDeg(w);
+  } = i, u = new y.Vector3().subVectors(t, n), h = new y.Vector3().subVectors(o, e), d = u.clone().normalize(), c = h.clone().normalize();
+  let f = y.MathUtils.clamp(d.dot(c), -1, 1);
+  const w = Math.acos(Math.abs(f)), x = y.MathUtils.radToDeg(w);
   if (w > r)
     return {
       type: "not_parallel",
@@ -297,22 +297,22 @@ const oe = (n, t, e = 0.01) => {
       overlap: null,
       closestDistance: null
     };
-  m < 0 && c.negate();
-  const P = new y.Vector3().addVectors(g, c).normalize(), M = new y.Vector3().addVectors(n, t).multiplyScalar(0.5), d = Je(e, M, g), f = Je(o, M, g), p = (d + f) / 2, b = Math.max(d, f), 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), T = Math.min(S, V), E = Math.max(S, V), A = _ - D, O = E - T, I = Math.min(A, O), B = Math.min(_, E) - Math.max(D, T), R = B < 0 ? -B : 0, W = B > 0 ? B : 0, C = I > 0 ? W / I : 0, L = uo(
+  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(
     n,
     t,
     e,
     o
-  ), H = w <= s && p < a;
+  ), $ = w <= s && p < a;
   let X;
-  return H ? X = C > 0.5 ? "collinear_overlap" : "collinear_gap" : w <= r && (X = "parallel_offset"), {
+  return $ ? X = C > 0.5 ? "collinear_overlap" : "collinear_gap" : w <= r && (X = "parallel_offset"), {
     type: X,
     angleDeg: x,
     avgPerpendicularDistance: p,
     maxPerpendicularDistance: b,
-    gap: R,
-    overlap: W,
-    closestDistance: L
+    gap: L,
+    overlap: N,
+    closestDistance: R
   };
 };
 function Je(n, t, e) {
@@ -320,10 +320,10 @@ function Je(n, t, e) {
   return new y.Vector3().subVectors(o, r).length();
 }
 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), g = r.dot(s), c = a * u - l * l;
-  let m, w;
-  c < 1e-10 ? (m = 0, w = u !== 0 ? g / u : 0) : (m = (l * g - u * h) / c, w = (a * g - l * h) / c), m = y.MathUtils.clamp(m, 0, 1), w = u !== 0 ? y.MathUtils.clamp((l * m + g) / u, 0, 1) : 0, m = a !== 0 ? y.MathUtils.clamp((l * w - h) / a, 0, 1) : 0;
-  const x = n.clone().add(i.clone().multiplyScalar(m)), P = e.clone().add(r.clone().multiplyScalar(w));
+  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 tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), ho = (n) => {
@@ -331,17 +331,17 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
   for (let x = 0; x < s; x++)
     l.set((x + 1) * a, { count: 0, minZ: 1 / 0, maxZ: -1 / 0 });
   let u = new y.Line3(t, e);
-  const h = n.originalPoints, g = new y.Vector3();
+  const h = n.originalPoints, d = new y.Vector3();
   for (let x = 0; x < h.length; x++) {
     const P = h[x];
-    let d = u.closestPointToPoint(P, !0, g).distanceTo(P);
-    const f = Math.floor(d / a);
-    if (f < s) {
-      const p = l.get((f + 1) * a);
+    let g = u.closestPointToPoint(P, !0, d).distanceTo(P);
+    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);
     }
   }
-  let c, m, w = r / 2;
+  let c, f, w = r / 2;
   for (const [x, P] of l)
     if (P.count >= w) {
       c = P.minZ;
@@ -349,10 +349,10 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
     }
   for (const [x, P] of [...l.entries()].reverse())
     if (P.count >= w) {
-      m = P.maxZ;
+      f = P.maxZ;
       break;
     }
-  return { minZ: c, maxZ: m };
+  return { minZ: c, maxZ: f };
 }, ze = (n, t, e) => {
   let o = new y.Plane();
   const i = new y.Vector3(n.x, n.y, n.z), r = new y.Vector3(t.x, t.y, t.z), s = new y.Vector3(t.x, t.y, t.z + 5);
@@ -364,26 +364,26 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
   });
   let u = new y.Vector3(), h = new y.Vector3();
   o.projectPoint(i, u), o.projectPoint(r, h);
-  const g = new y.Line3(u, h), c = [], m = [], w = [];
+  const d = new y.Line3(u, h), c = [], f = [], w = [];
   let x = new y.Vector3();
   return a.forEach((P, M) => {
-    g.closestPointToPoint(P, !0, x).distanceTo(P) < 1e-3 ? (c.push(e[M]), m.push(l[M])) : w.push(P);
-  }), { newOriginalPoints: c, newProjectPoints: w, newOnLinePoints: m };
+    d.closestPointToPoint(P, !0, x).distanceTo(P) < 1e-3 ? (c.push(e[M]), f.push(l[M])) : w.push(P);
+  }), { newOriginalPoints: c, newProjectPoints: w, newOnLinePoints: f };
 }, fo = (n) => {
   function t(e, o, i, r, s, a, l, u, h) {
-    let g = new y.Line3(e, o), c = /* @__PURE__ */ new Map(), m = 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(), P = 0;
     for (; ; ) {
-      let M = /* @__PURE__ */ new Map(), d = 0;
-      for (let f = 0; f < h.checkResults.length; f++)
-        if (!(h.checkResults[f].allCenterPoints.length / u * 100 < 1))
-          for (let b = 0; b < h.checkResults[f].allCenterPoints.length; b++) {
-            if (c.has(f) && c.get(f).removePtsIndex.includes(b))
+      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))
               continue;
-            let z = h.checkResults[f].allCenterPoints[b];
+            let z = h.checkResults[m].allCenterPoints[b];
             z = new y.Vector3(z.x, z.y, z.z);
-            let v = g.closestPointToPoint(z, !0, m), S = z.distanceTo(v);
-            Math.abs(S - s) < 0.01 && (d++, M.has(f) ? M.get(f).removePtsIndex.push(b) : M.set(f, {
-              index: f,
+            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, {
+              index: m,
               removePtsIndex: [b]
             }));
           }
@@ -391,22 +391,22 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
         e = w, o = x;
         break;
       }
-      if (d < a / 20 * 18 || d == 0) {
+      if (g < a / 20 * 18 || g == 0) {
         M.clear(), l - P < 5 && (e = w, o = x, c.clear());
         break;
       } else {
         P++;
-        for (const [f, p] of M)
-          c.has(f) ? c.get(f).removePtsIndex.push(...p.removePtsIndex) : c.set(f, p);
-        M.clear(), e = e.addScaledVector(i, r), o = o.addScaledVector(i, r), g.set(e, o);
+        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)
-      for (const [M, d] of c) {
-        let f = [], p = [];
+      for (const [M, g] of c) {
+        let m = [], p = [];
         for (let b = 0; b < h.checkResults[M].allCenterPoints.length; b++)
-          d.removePtsIndex.includes(b) || (f.push(h.checkResults[M].allCenterPoints[b]), p.push(h.checkResults[M].originalVertices[b]));
-        h.checkResults[M].allCenterPoints = f, h.checkResults[M].originalVertices = p;
+          g.removePtsIndex.includes(b) || (m.push(h.checkResults[M].allCenterPoints[b]), p.push(h.checkResults[M].originalVertices[b]));
+        h.checkResults[M].allCenterPoints = m, h.checkResults[M].originalVertices = p;
       }
   }
   for (let e = 0; e < n.length; e++) {
@@ -418,23 +418,23 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
       continue;
     if (o.checkResults[0].originalVertices && o.checkResults[0].originalVertices.length > 0) {
       const S = o.checkResults[0].originalVertices[0];
-      let [V, D, _, T] = S;
-      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), T = new y.Vector3(T.x, T.y, T.z), i = V.distanceTo(D), r = V.distanceTo(T);
-      let E = new y.Vector3().subVectors(V, D).normalize(), A = oe(E, new y.Vector3(0, 0, 1));
+      let [V, D, _, E] = S;
+      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]);
     }
     if (i < 0 || r < 0)
       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), g = Math.ceil(u / r);
-    let c = s.clone(), m = a.clone(), w = m.clone().add(new y.Vector3(0, 0, u)), x = c.clone().add(new y.Vector3(0, 0, u)), P = new y.Vector3().subVectors(m, c).normalize(), M = P.clone().negate();
+    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();
     new y.Vector3().subVectors(w, c).normalize().clone().negate();
-    let f = i / 2, p = l * u, b = i * r, z = p / b;
-    t(c, x, P, i, f, g, h, z, o), t(m, w, M, i, f, g, h, z, o), o.start = c, o.end = m;
-    const { newOriginalPoints: v } = ze(c, m, o.originalPoints);
+    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;
   }
-}, 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) => {
+}, 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) => {
   const o = new y.Vector3();
   return n.closestPointToPoint(t, !0, o), o.distanceTo(t) < e;
 }, Se = (n) => {
@@ -459,9 +459,9 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
 class yo {
   // 空白区域聚类结果
   constructor() {
-    Fe(this, "results");
+    Oe(this, "results");
     // 点分布分析结果
-    Fe(this, "clusterResults");
+    Oe(this, "clusterResults");
     this.results = null;
   }
   /**
@@ -520,7 +520,7 @@ class yo {
       l[3].y,
       l[3].z
       // 左上
-    ]), g = [0, 1, 2, 0, 2, 3], c = new Float32Array([
+    ]), d = [0, 1, 2, 0, 2, 3], c = new Float32Array([
       0,
       0,
       // 左下
@@ -534,9 +534,9 @@ class yo {
       1
       // 左上
     ]);
-    u.setAttribute("position", new y.BufferAttribute(h, 3)), u.setAttribute("uv", new y.BufferAttribute(c, 2)), u.setIndex(g), u.computeVertexNormals();
-    const m = new y.Mesh(u, r), w = new y.EdgesGeometry(u), x = new y.LineSegments(w, new y.LineBasicMaterial({ color: a }));
-    return s.add(x), m;
+    u.setAttribute("position", new y.BufferAttribute(h, 3)), u.setAttribute("uv", new y.BufferAttribute(c, 2)), u.setIndex(d), u.computeVertexNormals();
+    const f = new y.Mesh(u, r), w = new y.EdgesGeometry(u), x = new y.LineSegments(w, new y.LineBasicMaterial({ color: a }));
+    return s.add(x), f;
   }
   /**
    * 将一面墙体按 rows×cols 细分成小格 Mesh，每格存入 wallGroup。
@@ -549,31 +549,31 @@ class yo {
     const s = [];
     if (!t || !t.start || !t.end || isNaN(t.rooftopPz))
       return s;
-    const a = new y.Vector3(t.start.x, t.start.y, t.start.z), l = new y.Vector3(t.end.x, t.end.y, t.end.z), u = new y.Vector3(t.end.x, t.end.y, t.rooftopPz), h = new y.Vector3(t.start.x, t.start.y, t.rooftopPz), g = [a, l, u, h];
-    for (let d = 0; d < g.length; d++)
-      if (!this.isValidVector3(g[d]))
-        return console.error(`墙体基础点${d}无效:`, g[d]), s;
-    const c = a.distanceTo(l), m = Math.abs(t.rooftopPz - t.start.z);
-    if (c === 0 || m === 0)
+    const a = new y.Vector3(t.start.x, t.start.y, t.start.z), l = new y.Vector3(t.end.x, t.end.y, t.end.z), u = new y.Vector3(t.end.x, t.end.y, t.rooftopPz), h = new y.Vector3(t.start.x, t.start.y, t.rooftopPz), d = [a, l, u, h];
+    for (let g = 0; g < d.length; g++)
+      if (!this.isValidVector3(d[g]))
+        return console.error(`墙体基础点${g}无效:`, d[g]), s;
+    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 = m / e, P = new y.Vector3().subVectors(l, a).normalize(), M = new y.Vector3(0, 0, 1);
-    for (let d = 0; d < e; d++)
-      for (let f = 0; f < o; f++)
+    const w = c / o, x = f / e, P = 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(f * w)).add(M.clone().multiplyScalar(d * x)), b = new y.Vector3().copy(a).add(P.clone().multiplyScalar((f + 1) * w)).add(M.clone().multiplyScalar(d * x)), z = new y.Vector3().copy(a).add(P.clone().multiplyScalar((f + 1) * w)).add(M.clone().multiplyScalar((d + 1) * x)), v = new y.Vector3().copy(a).add(P.clone().multiplyScalar(f * w)).add(M.clone().multiplyScalar((d + 1) * x)), S = {
+          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],
             userData: {}
           };
           S.userData = {
             type: "wallSegment",
-            row: d,
-            col: f,
+            row: g,
+            col: m,
             originalMaterial: i,
             width: w,
             height: x
           }, s.push(S);
         } catch (p) {
-          console.error(`创建墙体小平面(${d}, ${f})时出错:`, p);
+          console.error(`创建墙体小平面(${g}, ${m})时出错:`, p);
         }
     return s;
   }
@@ -814,8 +814,8 @@ class yo {
   evaluateSegmentByArea(t, e, o, i) {
     if (e === 0) return !1;
     const r = t.area, s = t.minRequiredPoints, a = t.expectedDensity, l = e / Math.max(r, 1e-3), u = e >= s, h = l >= a * 0.3;
-    let g = !0;
-    return r < 0.5 && e > 0 && (g = this.checkSmallAreaDistribution(t, o, i)), u && h && g;
+    let d = !0;
+    return r < 0.5 && e > 0 && (d = this.checkSmallAreaDistribution(t, o, i)), u && h && d;
   }
   checkSmallAreaDistribution(t, e, o) {
     if (e.length < 2) return !0;
@@ -873,21 +873,21 @@ 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, g, c] = s.vertices, m = 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), P = u.distanceTo(c), M = new y.Plane();
       M.setFromCoplanarPoints(u, h, c);
-      const d = x / 2, f = P / 2;
+      const g = x / 2, m = P / 2;
       for (let p = 0; p < e.length; p++)
         this.isPointInWallSegmentOptimized(
           e[p],
           a,
           M,
           u,
-          m,
+          f,
           w,
           x,
           P,
-          d,
-          f,
+          g,
+          m,
           o
         ) && (this.results.pointsInSegments.has(l) || this.results.pointsInSegments.set(l, []), this.results.pointsInSegments.get(l).push(p));
     }
@@ -911,14 +911,14 @@ class yo {
     }), this.results.analysisTime = performance.now() - i, this.printAnalysisResults(), this.results;
   }
   // 优化后的判断函数（移出重复计算）
-  isPointInWallSegmentOptimized(t, e, o, i, r, s, a, l, u, h, g) {
-    if (Math.abs(o.distanceToPoint(t)) > g)
+  isPointInWallSegmentOptimized(t, e, o, i, r, s, a, l, u, h, d) {
+    if (Math.abs(o.distanceToPoint(t)) > d)
       return !1;
-    const m = new y.Vector3().subVectors(t, e), w = Math.abs(m.dot(r)), x = Math.abs(m.dot(s));
+    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), d = P.dot(s), f = M >= -g && M <= a + g, p = d >= -g && d <= l + g;
-    return f && p;
+    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;
+    return m && p;
   }
   // 判断点是否在细分墙体平面内
   isPointInWallSegment(t, e, o, i = 0.1) {
@@ -935,10 +935,10 @@ class yo {
     const [r, s, a, l] = t, u = new y.Plane();
     if (u.setFromCoplanarPoints(r, s, l), Math.abs(u.distanceToPoint(e)) > i)
       return !1;
-    const g = new y.Vector3().subVectors(s, r).normalize(), c = new y.Vector3().subVectors(l, r).normalize();
-    new y.Vector3().crossVectors(g, c).normalize();
-    const m = new y.Vector3().subVectors(e, r), w = m.dot(g), x = m.dot(c), P = r.distanceTo(s), M = r.distanceTo(l), d = w >= -i && w <= P + i, f = x >= -i && x <= M + i;
-    return d && f && o.distanceTo(e) < P / 2 && o.distanceTo(e) < M / 2;
+    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;
   }
   // 优化顶点获取（添加缓存）
   getWorldVertices(t) {
@@ -1006,7 +1006,7 @@ class yo {
   // }
   // 高亮没有点的平面并进行聚类
   highlightEmptySegments(t, e, o, i = 1) {
-    var g;
+    var d;
     if (!this.results) {
       console.warn("请先运行分析函数");
       return;
@@ -1020,9 +1020,9 @@ class yo {
       });
     }), t.forEach((c) => {
       if (c.userData && c.userData.type === "wallSegment") {
-        const m = `row${c.userData.row}_col${c.userData.col}`, w = r.has(m);
+        const f = `row${c.userData.row}_col${c.userData.col}`, w = r.has(f);
         s.has(c.userData.row) || s.set(c.userData.row, /* @__PURE__ */ new Map()), s.get(c.userData.row).has(c.userData.col) || s.get(c.userData.row).set(c.userData.col, {
-          segmentKey: m,
+          segmentKey: f,
           isEmpty: w,
           visited: !1
         });
@@ -1038,15 +1038,15 @@ class yo {
       [-1, 0]
       // 上
     ];
-    for (const [c, m] of r) {
-      const w = (g = s.get(m.row)) == null ? void 0 : g.get(m.col);
+    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 = [[m.row, m.col]];
+        const x = [], P = [[f.row, f.col]];
         for (w.visited = !0; P.length > 0; ) {
-          const [M, d] = P.shift(), f = `row${M}_col${d}`;
-          r.has(f) && x.push(r.get(f));
+          const [M, g] = P.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 = d + b;
+            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]));
@@ -1058,7 +1058,7 @@ class yo {
     }
     const u = this.createClusterMaterials(a.length), h = [];
     return this.clusterResults = {
-      clusters: a.sort((c, m) => m.length - c.length),
+      clusters: a.sort((c, f) => f.length - c.length),
       highlightedMeshes: h,
       clusterMaterials: u,
       totalClusters: a.length,
@@ -1078,15 +1078,15 @@ class yo {
     for (let x = i; x <= r; x++)
       t.has(u) && t.get(u).has(x) || (h = !1);
     h && s++;
-    const g = i;
+    const d = i;
     let c = !0;
     for (let x = e; x <= o; x++)
-      t.has(x) && t.get(x).has(g) || (c = !1);
+      t.has(x) && t.get(x).has(d) || (c = !1);
     c && s++;
-    const m = r;
+    const f = r;
     let w = !0;
     for (let x = e; x <= o; x++)
-      t.has(x) && t.get(x).has(m) || (w = !1);
+      t.has(x) && t.get(x).has(f) || (w = !1);
     return w && s++, s / 4;
   }
   // 计算聚类质量分数
@@ -1096,19 +1096,19 @@ class yo {
   }
   // 计算严格的聚类边界尺寸（基于实际几何）
   calculateStrictClusterBounds(t) {
-    var g, c;
+    var d, c;
     if (t.length === 0) return { width: 0, height: 0 };
     const e = [];
-    if (t.forEach((m) => {
-      m.vertices && m.vertices.length > 0 && e.push(...m.vertices);
+    if (t.forEach((f) => {
+      f.vertices && f.vertices.length > 0 && e.push(...f.vertices);
     }), e.length === 0) {
-      const m = [...new Set(t.map((x) => x.row))];
+      const f = [...new Set(t.map((x) => x.row))];
       return {
-        width: [...new Set(t.map((x) => x.col))].length * (((g = t[0].bounds) == null ? void 0 : g.width) || 1),
-        height: m.length * (((c = t[0].bounds) == null ? void 0 : c.height) || 1)
+        width: [...new Set(t.map((x) => x.col))].length * (((d = t[0].bounds) == null ? void 0 : d.width) || 1),
+        height: f.length * (((c = t[0].bounds) == null ? void 0 : c.height) || 1)
       };
     }
-    const o = Math.min(...e.map((m) => m.x)), i = Math.max(...e.map((m) => m.x)), r = Math.min(...e.map((m) => m.y)), s = Math.max(...e.map((m) => m.y)), a = Math.min(...e.map((m) => m.z)), l = Math.max(...e.map((m) => m.z)), u = Math.abs(i - o), h = Math.max(Math.abs(s - r), Math.abs(l - a));
+    const o = Math.min(...e.map((f) => f.x)), i = Math.max(...e.map((f) => f.x)), r = Math.min(...e.map((f) => f.y)), s = Math.max(...e.map((f) => f.y)), a = Math.min(...e.map((f) => f.z)), l = Math.max(...e.map((f) => f.z)), u = Math.abs(i - o), h = Math.max(Math.abs(s - r), Math.abs(l - a));
     return { width: u, height: h };
   }
   // 创建不同颜色的聚类材质
@@ -1182,8 +1182,8 @@ class yo {
       if (o.userData && o.userData.type === "wallSegment") {
         const i = this.getWorldVertices(o);
         if (i.length < 4) return;
-        const r = new y.Vector3().add(i[0]).add(i[1]).add(i[2]).add(i[3]).multiplyScalar(0.25), s = new y.Vector3().subVectors(i[1], i[0]).normalize(), a = new y.Vector3().subVectors(i[3], i[0]).normalize(), l = new y.Vector3().crossVectors(s, a).normalize(), u = new y.ArrowHelper(l, r, 0.3, 16711680), h = new y.ArrowHelper(s, r, 0.2, 65280), g = new y.ArrowHelper(a, r, 0.2, 255);
-        e.add(u), e.add(h), e.add(g);
+        const r = new y.Vector3().add(i[0]).add(i[1]).add(i[2]).add(i[3]).multiplyScalar(0.25), s = new y.Vector3().subVectors(i[1], i[0]).normalize(), a = new y.Vector3().subVectors(i[3], i[0]).normalize(), l = new y.Vector3().crossVectors(s, a).normalize(), u = new y.ArrowHelper(l, r, 0.3, 16711680), h = new y.ArrowHelper(s, r, 0.2, 65280), d = new y.ArrowHelper(a, r, 0.2, 255);
+        e.add(u), e.add(h), e.add(d);
       }
     }), e;
   }
@@ -1232,7 +1232,7 @@ const xo = (n) => {
   o.applyAxisAngle(e, Math.PI / 2);
   const i = new zt().copy(t).add(o.clone().multiplyScalar(n.length)), r = new zt().copy(t).sub(o.clone().multiplyScalar(n.length));
   return t.z = n.start.z, i.z = n.start.z, r.z = n.start.z, { start: i, end: r, center: t, direction: o };
-}, ui = (n, t, e = !0) => {
+}, yi = (n, t, e = !0) => {
   let o = [];
   if (!n)
     return [];
@@ -1248,21 +1248,21 @@ const xo = (n) => {
       const V = new zt();
       l.projectPoint(v, 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)), g = Math.abs(r.rooftopPz - r.start.z), c = new y.MeshBasicMaterial({
+    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",
       side: y.DoubleSide,
       wireframe: !1,
       transparent: !0,
       opacity: 0.5
-    }), m = new y.Group(), w = new yo(), { horizontalSubdivisions: x, verticalSubdivisions: P } = w.initLimits4(h, g), M = w.createSubdividedWallPlane(r, P, x, c, m);
+    }), f = new y.Group(), w = new yo(), { horizontalSubdivisions: x, verticalSubdivisions: P } = w.initLimits4(h, d), M = w.createSubdividedWallPlane(r, P, x, c, f);
     w.analyzePointDistribution(M, u, 0.01);
-    const d = new y.MeshBasicMaterial({
+    const g = new y.MeshBasicMaterial({
       color: "black",
       transparent: !0,
       opacity: 0.8,
       side: y.DoubleSide
-    }), f = w.highlightEmptySegments(M, d, m), p = [];
-    for (const v of f.clusters) {
+    }), m = w.highlightEmptySegments(M, g, f), p = [];
+    for (const v of m.clusters) {
       const S = xo(v);
       S && p.push(S);
     }
@@ -1270,12 +1270,12 @@ const xo = (n) => {
     r.checkResults = p, r.verticalDirection = z, r.originaIndex = i, o.push(r);
   }
   return o;
-}, hi = (n, t) => {
+}, xi = (n, t) => {
   console.log("lines", n);
   for (let e = 0; e < n.length; e++) {
     const o = n[e], i = [];
-    o.originalPoints.forEach((f) => {
-      let p = new y.Vector3(f.x, f.y, 0), b = !1;
+    o.originalPoints.forEach((m) => {
+      let p = new y.Vector3(m.x, m.y, 0), b = !1;
       for (let z = 0; z < i.length; z++)
         if (kt(p, i[z], 0.01)) {
           b = !0;
@@ -1284,29 +1284,29 @@ const xo = (n) => {
       b || 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(), g = h.clone().negate(), c = [];
-    const m = [];
+    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 = [];
+    const f = [];
     let w = o.length / r;
     console.log(w);
-    for (let f = 0; f < r; f++) {
+    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(g, s * 2)), p.push(a.clone().addScaledVector(g, w));
+      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 = [];
       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 && m.push(Mo(b)), a = a.addScaledVector(u, w);
+      b.length > 0 && f.push(Mo(b)), a = a.addScaledVector(u, w);
     }
     const x = new Float32Array(i.length * 3);
-    i.forEach((f, p) => {
-      x[p * 3] = f.x, x[p * 3 + 1] = f.y, x[p * 3 + 2] = f.z;
+    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, d] = vo(m, {
+    const [M, g] = vo(f, {
       plane: "xy",
       trimRatio: 0
     });
-    so(M, d, t);
+    so(M, g, t);
   }
 };
 function en(n, t = "xy") {
@@ -1403,54 +1403,54 @@ 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 R = B.x - r, W = B.y - s;
-    l += R * R, u += R * W, h += W * W;
+    const L = B.x - r, N = B.y - s;
+    l += L * L, u += L * N, h += N * N;
   }
   l /= i.length, u /= i.length, h /= i.length;
-  const g = So(l, u, h), c = {
-    x: -g.y,
-    y: g.x
-  }, m = [];
+  const d = So(l, u, h), c = {
+    x: -d.y,
+    y: d.x
+  }, f = [];
   for (const B of i) {
-    const R = B.x - r, W = B.y - s, C = R * g.x + W * g.y, L = R * c.x + W * c.y;
-    m.push({
+    const L = B.x - r, N = B.y - s, C = L * d.x + N * d.y, R = L * c.x + N * c.y;
+    f.push({
       s: C,
-      t: L,
+      t: R,
       up: B.up
     });
   }
-  m.sort((B, R) => B.s - R.s);
-  const w = m.length;
+  f.sort((B, L) => B.s - L.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 = m[x], d = m[P], f = (() => {
-    const B = m.map((W) => W.t).sort((W, C) => W - C), R = Math.floor(B.length / 2);
-    return B.length % 2 === 0 ? (B[R - 1] + B[R]) * 0.5 : B[R];
+  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];
   })(), p = (() => {
-    const B = m.map((W) => W.up).sort((W, C) => W - C), R = Math.floor(B.length / 2);
-    return B.length % 2 === 0 ? (B[R - 1] + B[R]) * 0.5 : B[R];
-  })(), b = M.s, z = d.s, v = f, S = f, V = p, D = p, _ = r + g.x * b + c.x * v, T = s + g.y * b + c.y * v, E = r + g.x * z + c.x * S, A = s + g.y * z + c.y * S, O = nn(_, T, V, e), I = nn(E, A, D, e);
+    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);
   return [O, I];
 }
-const fi = async (n, t, e, o, i) => {
+const wi = async (n, t, e, o, i) => {
   if (o && o.length > 0)
-    for (let f = 0; f < o.length; f++) {
-      const p = o[f];
+    for (let m = 0; m < o.length; m++) {
+      const p = o[m];
       p.isLine2 = !0, n.push(p);
     }
   if (fo(n), n.length <= 0 || t.length <= 0)
     return n;
   e || (e = []);
-  for (const f of n) {
+  for (const m of n) {
     let p = [];
-    if (!(!f.checkResults || f.checkResults.length <= 0)) {
-      for (let b = 0; b < f.checkResults.length; b++) {
+    if (!(!m.checkResults || m.checkResults.length <= 0)) {
+      for (let b = 0; b < m.checkResults.length; b++) {
         let D = function(A) {
           for (; V[A] !== A; )
             V[A] = V[V[A]], A = V[A];
           return A;
         };
-        const z = f.checkResults[b];
+        const z = m.checkResults[b];
         if (z.isDoor = !1, !z.originalVertices || z.originalVertices.length == 0)
           continue;
         const v = [];
@@ -1464,13 +1464,13 @@ const fi = async (n, t, e, o, i) => {
         for (let A = 0; A < S; A++)
           for (let O = A + 1; O < S; O++) {
             const I = v[A], B = v[O];
-            if (I.some((W) => B.some((C) => W.equals(C)))) {
-              const W = D(A), C = D(O);
-              W !== C && (V[W] = C);
+            if (I.some((N) => B.some((C) => N.equals(C)))) {
+              const N = D(A), C = D(O);
+              N !== C && (V[N] = C);
             }
           }
         const _ = /* @__PURE__ */ new Map();
-        let T = -1, E = -1;
+        let E = -1, T = -1;
         for (let A = 0; A < S; A++) {
           const O = D(A);
           _.has(O) || _.set(O, {
@@ -1483,25 +1483,25 @@ const fi = async (n, t, e, o, i) => {
             centerPts: []
           });
           const I = _.get(O);
-          let [B, R, W, C] = v[A];
-          const L = new y.Vector3().add(B).add(R).add(W).add(C).multiplyScalar(0.25);
-          if (I.points.push(...v[A]), I.area += B.distanceTo(R) * B.distanceTo(C), I.originalVertices.push(v[A]), I.index = b, I.centerPts.push(L), T == -1 || E == -1) {
-            let H = new y.Vector3().subVectors(B, R).normalize();
-            E = B.distanceTo(C), T = B.distanceTo(R);
-            let X = oe(H, new y.Vector3(0, 0, 1));
-            X && X.parallel && ([E, T] = [T, E]);
+          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 X = oe($, new y.Vector3(0, 0, 1));
+            X && X.parallel && ([T, E] = [E, T]);
           }
-          I.gridWidth = T, I.gridHeight = E;
+          I.gridWidth = E, I.gridHeight = T;
         }
         p.push(..._.values());
       }
-      f.mergeCheckRegion = p;
+      m.mergeCheckRegion = p;
     }
   }
   let r = /* @__PURE__ */ new Map();
-  for (const f of n) {
-    if (f.length < 0.3) continue;
-    let p = f.rooftopPz - f.start.z, b = Math.floor(f.rooftopPz - f.start.z);
+  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
@@ -1511,12 +1511,12 @@ const fi = async (n, t, e, o, i) => {
     });
   }
   let s = [...r.entries()].reduce(
-    (f, p) => p[1].num > f[1].num ? p : f
+    (m, p) => p[1].num > m[1].num ? p : m
   );
   s[0], s[1].totalHeight / s[1].num;
   const a = [];
-  for (let f = 0; f < e.length; f++) {
-    const p = e[f];
+  for (let m = 0; m < e.length; m++) {
+    const p = e[m];
     if (p.isFindBeam = !1, p.category == "door") {
       let b = [];
       p.coordinatesByArea.coordinates.forEach((D) => {
@@ -1531,15 +1531,15 @@ const fi = async (n, t, e, o, i) => {
         boxPoints: b,
         minZ: p.coordinatesByArea.heightData.minZ,
         maxZ: p.coordinatesByArea.heightData.maxZ,
-        index: f,
+        index: m,
         isFind: !1,
         inWall: !1
         //是否在墙内
       });
     }
   }
-  for (let f = 0; f < a.length; f++) {
-    const p = a[f];
+  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;
       let z = [];
@@ -1548,25 +1548,25 @@ const fi = async (n, t, e, o, i) => {
       let S = !1;
       const V = p.boxPoints.length;
       for (let D = 0; D < z.length; D++) {
-        const _ = z[D].x, T = z[D].y;
-        for (let E = 0, A = V - 1; E < V; A = E++) {
-          const O = p.boxPoints[E].x, I = p.boxPoints[E].y, B = p.boxPoints[A].x, R = p.boxPoints[A].y;
-          I > T != R > T && _ < (B - O) * (T - I) / (R - I) + O && (S = !S);
+        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);
         }
         if (S) 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), T = p.doorStartPt.distanceTo(p.doorEndPt), E = D.distanceTo(_), A = Jt(p.doorStartPt, p.doorEndPt, D, _);
-        if (Math.abs(E - T) < 0.5 && A && A.angleDeg < 15) {
+        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 (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);
           break;
-        } else if (Math.abs(E - T) > 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(_), R = p.doorEndPt.distanceTo(D), W = p.doorEndPt.distanceTo(_), C = I < 0.2 || B < 0.2 || R < 0.2 || W < 0.2;
+        } 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;
           if (O && O.type == "collinear_overlap" && O.maxPerpendicularDistance < 0.1 && !C) {
             p.inWall = !0;
             break;
           } else {
-            let L = new y.Line3(D, _), H = L.closestPointToPoint(p.doorStartPt, !0, new y.Vector3()), X = L.closestPointToPoint(p.doorEndPt, !0, new y.Vector3()), ot = H.distanceTo(p.doorStartPt), K = X.distanceTo(p.doorEndPt);
+            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);
             if (ot < 0.1 || K < 0.1) {
               p.inWall = !0;
               break;
@@ -1577,11 +1577,11 @@ const fi = async (n, t, e, o, i) => {
         continue;
     }
   }
-  let l = 0, u = [], h = [], g = [];
+  let l = 0, u = [], h = [], d = [];
   const c = [];
-  let m = 0.15;
-  for (let f = 0; f < n.length; f++) {
-    const p = n[f];
+  let f = 0.15;
+  for (let m = 0; m < n.length; m++) {
+    const p = n[m];
     if (p.noDetection || (p.doorAndBeamData = [], !p.mergeCheckRegion || p.mergeCheckRegion.length == 0))
       continue;
     p.completePointAreaPercentage = -1;
@@ -1591,34 +1591,34 @@ const fi = async (n, t, e, o, i) => {
     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 V = p.rooftopPz - p.start.z, D = 0;
-    for (const T of p.mergeCheckRegion) {
-      const { facePoints: E, boxArea: A, totalInPlaneNum: O } = co(
-        T.points,
-        T.gridWidth,
-        T.gridHeight,
-        T.centerPts
+    for (const E of p.mergeCheckRegion) {
+      const { facePoints: T, boxArea: A, totalInPlaneNum: O } = co(
+        E.points,
+        E.gridWidth,
+        E.gridHeight,
+        E.centerPts
       );
-      if (!E || E.length <= 0)
+      if (!T || T.length <= 0)
         continue;
-      E[0].distanceTo(E[1]);
-      let I = E[0].distanceTo(E[3]);
-      const B = T.gridHeight * (I / T.gridHeight / 3 * 2) + T.gridHeight / 2;
-      let R = new y.Vector3(E[0].x, E[0].y, E[0].z + B), W = new y.Vector3(E[1].x, E[1].y, E[1].z + B);
-      const C = new y.Line3(R, W), L = [];
-      let H = new y.Vector3();
-      T.points.forEach((rt) => {
-        C.closestPointToPoint(rt, !0, H).distanceTo(rt) < T.gridHeight + 0.01 && L.push(rt);
+      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 $ = new y.Vector3();
+      E.points.forEach((rt) => {
+        C.closestPointToPoint(rt, !0, $).distanceTo(rt) < E.gridHeight + 0.01 && R.push(rt);
       });
       let X = [], ot = [];
       for (; ; ) {
         let rt = [];
-        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++)
+        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++)
           if (!ot.includes(F)) {
-            for (let Y = 0; Y < rt.length; Y++)
-              if (L[F].distanceTo(rt[Y]) < T.gridWidth + 0.01) {
-                rt.push(L[F]), ot.push(F), F = -1;
+            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;
                 break;
               }
           }
@@ -1633,31 +1633,31 @@ const fi = async (n, t, e, o, i) => {
           lineEd: new y.Vector3(),
           facePoints: []
         };
-        let Y = Se(X[rt]);
-        Array.isArray(Y) && Y.length == 2 && (F.lineSt = Y[0], F.lineEd = Y[1], F.facePoints.push(new y.Vector3(Y[0].x, Y[0].y, E[0].z)), F.facePoints.push(new y.Vector3(Y[1].x, Y[1].y, E[0].z)), F.facePoints.push(new y.Vector3(Y[1].x, Y[1].y, E[2].z)), F.facePoints.push(new y.Vector3(Y[0].x, Y[0].y, E[2].z)), K.push(F));
+        let H = Se(X[rt]);
+        Array.isArray(H) && H.length == 2 && (F.lineSt = H[0], F.lineEd = H[1], F.facePoints.push(new y.Vector3(H[0].x, H[0].y, T[0].z)), F.facePoints.push(new y.Vector3(H[1].x, H[1].y, T[0].z)), F.facePoints.push(new y.Vector3(H[1].x, H[1].y, T[2].z)), F.facePoints.push(new y.Vector3(H[0].x, H[0].y, T[2].z)), K.push(F));
       }
-      D += T.area;
+      D += E.area;
       let G = 0;
-      if (O != 0 && (G = T.gridHeight * T.gridWidth * O), (T.area - G) / A * 100 > 70 && K.length == 1 || K.length > 1)
+      if (O != 0 && (G = E.gridHeight * E.gridWidth * O), (E.area - G) / A * 100 > 70 && K.length == 1 || K.length > 1)
         for (let rt = 0; rt < K.length; rt++) {
           const F = K[rt];
-          let Y = F.facePoints[0].distanceTo(F.facePoints[1]), Mt = F.facePoints[0].distanceTo(F.facePoints[3]), Zt = Y / p.length * 100, Nt = p.rooftopPz - F.facePoints[2].z;
-          if (Mt < 1.5 || z < F.facePoints[2].z || Nt > V / 3 * 2)
+          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 Lt = !1, _t = !1, Tt = !1, Ft = [], tt = F.facePoints[2].clone(), lt = F.facePoints[3].clone(), q = F.facePoints[0].clone(), j = F.facePoints[1].clone(), Wt = !1, Et = -1;
+          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;
           if (Math.abs(F.facePoints[0].z - p.start.z) < 0.25) {
-            if (Y > 0.17 && p.length > 0.5) {
-              let qt = Rt(v, q), J = Rt(v, j), ct = Rt(S, q), N = Rt(S, j);
+            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);
               const bt = 0.1, Vt = 10;
-              if (qt < bt || J < bt) {
-                const { newOriginalPoints: Ut } = ze(q, j, p.originalPoints), at = [];
+              if (Wt < bt || J < bt) {
+                const { newOriginalPoints: Ut } = ze(W, j, p.originalPoints), at = [];
                 if (Ut.forEach((Q) => {
-                  Q.z >= tt.z ? at.push(Q) : Q.z <= q.z;
+                  Q.z >= tt.z ? at.push(Q) : Q.z <= W.z;
                 }), at.length > 10) {
                   const Q = new y.Vector3(p.start.x, p.start.y, 0), gt = new y.Vector3(p.end.x, p.end.y, 0), Pt = new y.Vector3().subVectors(Q, gt).normalize();
                   let Gt = new y.Vector3(), ht = 1 / 0, Z = -1, k = !1, ft = !1;
                   for (let U = 0; U < n.length; U++) {
-                    if (U == f) continue;
+                    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);
                     if (Ct != null) {
@@ -1671,8 +1671,8 @@ const fi = async (n, t, e, o, i) => {
                       continue;
                     }
                     if (St && St.angle > 85) {
-                      const $ = new y.Line3(it, dt).closestPointToPoint(Q, !0, Gt);
-                      let pt = Jt(Q, gt, $, Q);
+                      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);
@@ -1681,8 +1681,8 @@ const fi = async (n, t, e, o, i) => {
                       let Xt = Q.distanceTo(wt.point);
                       Xt < ht && (ht = Xt, Z = U);
                     } else if (St && St.angle < 5) {
-                      const At = new y.Vector3(q.x, q.y, 0), $ = new y.Vector3(j.x, j.y, 0);
-                      let pt = Rt(At, it), et = Rt(At, dt), st = Rt($, it), xt = Rt($, dt), vt = Jt(Q, gt, it, At), Bt = !1;
+                      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;
                       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,10 +1691,10 @@ const fi = async (n, t, e, o, i) => {
                             n[U].checkResults[wt].allCenterPoints[Kt].y,
                             0
                           ));
-                        let Ht = Se(Xt);
-                        if (Ht.length == 2) {
-                          let Kt = Rt(At, Ht[0]), Ce = Rt(At, Ht[1]), Re = Rt($, Ht[0]), Le = Rt($, Ht[1]);
-                          if (Kt < 0.2 || Ce < 0.2 || Re < 0.2 || Le < 0.2) {
+                        let $t = Se(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) {
                             Bt = !0;
                             break;
                           }
@@ -1706,26 +1706,26 @@ const fi = async (n, t, e, o, i) => {
                       }
                     }
                   }
-                  if (ht != 1 / 0 && ht < 2 && (p.length - Y > 0.2 || p.length - Y < 0.02) && ht < Y * 3)
-                    n[Z].length > 0.25 && Y + ht > 0.5 && (Wt = !0, qt < bt ? (lt = lt.addScaledVector(Pt, ht), q = q.addScaledVector(Pt, ht)) : (tt = tt.addScaledVector(Pt, ht), j = j.addScaledVector(Pt, ht)));
+                  if (ht != 1 / 0 && ht < 2 && (p.length - H > 0.2 || p.length - H < 0.02) && ht < H * 3)
+                    n[Z].length > 0.25 && H + ht > 0.5 && (Nt = !0, Wt < bt ? (lt = lt.addScaledVector(Pt, ht), W = W.addScaledVector(Pt, ht)) : (tt = tt.addScaledVector(Pt, ht), j = j.addScaledVector(Pt, ht)));
                   else {
-                    if (!k && !ft && p.length - Y > 0.1)
+                    if (!k && !ft && p.length - H > 0.1)
                       continue;
-                    if (!k && !ft && p.length - Y < 0.1 && p.length < 1.8)
+                    if (!k && !ft && p.length - H < 0.1 && p.length < 1.8)
                       continue;
                   }
                 } else
                   continue;
               }
-              if (ct < bt || N < bt) {
-                const { newOriginalPoints: Ut } = ze(q, j, p.originalPoints), at = [];
+              if (ct < bt || q < bt) {
+                const { newOriginalPoints: Ut } = ze(W, j, p.originalPoints), at = [];
                 if (Ut.forEach((Q) => {
-                  Q.z >= tt.z ? at.push(Q) : Q.z <= q.z;
+                  Q.z >= tt.z ? at.push(Q) : Q.z <= W.z;
                 }), at.length > 10) {
                   const Q = new y.Vector3(p.start.x, p.start.y, 0), gt = new y.Vector3(p.end.x, p.end.y, 0), Pt = new y.Vector3().subVectors(gt, Q).normalize();
                   let Gt = new y.Vector3(), ht = 1 / 0, Z = -1, k = !1, ft = !1;
                   for (let U = 0; U < n.length; U++) {
-                    if (U == f) continue;
+                    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);
                     if (Ct != null) {
@@ -1736,8 +1736,8 @@ const fi = async (n, t, e, o, i) => {
                       continue;
                     }
                     if (St && St.angle > 85) {
-                      const $ = new y.Line3(it, dt).closestPointToPoint(gt, !0, Gt);
-                      let pt = Jt(gt, Q, $, gt);
+                      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);
@@ -1746,8 +1746,8 @@ const fi = async (n, t, e, o, i) => {
                       let Xt = gt.distanceTo(wt.point);
                       Xt < ht && (ht = Xt, Z = U);
                     } else if (St && St.angle < 5) {
-                      const At = new y.Vector3(q.x, q.y, 0), $ = new y.Vector3(j.x, j.y, 0);
-                      let pt = Rt(At, it), et = Rt(At, dt), st = Rt($, it), xt = Rt($, dt), vt = Jt(gt, Q, it, At), Bt = !1;
+                      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;
                       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,10 +1756,10 @@ const fi = async (n, t, e, o, i) => {
                             n[U].checkResults[wt].allCenterPoints[Kt].y,
                             0
                           ));
-                        let Ht = Se(Xt);
-                        if (Ht.length == 2) {
-                          let Kt = Rt(At, Ht[0]), Ce = Rt(At, Ht[1]), Re = Rt($, Ht[0]), Le = Rt($, Ht[1]);
-                          if (Kt < 0.2 || Ce < 0.2 || Re < 0.2 || Le < 0.2) {
+                        let $t = Se(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) {
                             Bt = !0;
                             break;
                           }
@@ -1771,146 +1771,146 @@ const fi = async (n, t, e, o, i) => {
                       }
                     }
                   }
-                  if (ht != 1 / 0 && ht < 2 && (p.length - Y > 0.2 || p.length - Y < 0.02) && ht < Y * 3)
-                    n[Z].length > 0.25 && Y + ht > 0.5 && (Wt = !0, ct < bt ? (lt = lt.addScaledVector(Pt, ht), q = q.addScaledVector(Pt, ht)) : (tt = tt.addScaledVector(Pt, ht), j = j.addScaledVector(Pt, ht)));
+                  if (ht != 1 / 0 && ht < 2 && (p.length - H > 0.2 || p.length - H < 0.02) && ht < H * 3)
+                    n[Z].length > 0.25 && H + ht > 0.5 && (Nt = !0, ct < bt ? (lt = lt.addScaledVector(Pt, ht), W = W.addScaledVector(Pt, ht)) : (tt = tt.addScaledVector(Pt, ht), j = j.addScaledVector(Pt, ht)));
                   else {
-                    if (!k && !ft && p.length - Y > 0.1)
+                    if (!k && !ft && p.length - H > 0.1)
                       continue;
-                    if (!k && !ft && p.length - Y < 0.1 && p.length < 1.8)
+                    if (!k && !ft && p.length - H < 0.1 && p.length < 1.8)
                       continue;
                   }
                 } else
                   continue;
               }
-              Y = lt.distanceTo(tt);
+              H = lt.distanceTo(tt);
             }
-            if (Zt < 85 && Y > 0.3 || Y > 0.7 && Mt > V - V / 3) {
-              let qt = !1;
+            if (Zt < 85 && H > 0.3 || H > 0.7 && Mt > V - V / 3) {
+              let Wt = !1;
               for (let J = 0; J < t.length; J++) {
                 let ct = J + 1;
                 if (ct >= t.length)
                   continue;
-                let N = new y.Vector3(t[J].x, t[J].y, t[J].z), bt = new y.Vector3(t[ct].x, t[ct].y, t[ct].z);
+                let q = new y.Vector3(t[J].x, t[J].y, t[J].z), bt = new y.Vector3(t[ct].x, t[ct].y, t[ct].z);
                 if (te(
-                  new y.Vector3(N.x, N.y, 0),
+                  new y.Vector3(q.x, q.y, 0),
                   new y.Vector3(bt.x, bt.y, 0),
                   new y.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0),
                   new y.Vector3(F.facePoints[1].x, F.facePoints[1].y, 0),
                   0.1
                 ) != null) {
-                  qt = !0;
+                  Wt = !0;
                   break;
                 }
               }
               for (let J = 0; J < a.length; J++) {
-                let ct = new y.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), N = new y.Vector3(a[J].doorEndPt.x, a[J].doorEndPt.y, 0), bt = new y.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0), Vt = new y.Vector3(F.facePoints[1].x, F.facePoints[1].y, 0), Ut = F.facePoints[2].z < a[J].maxZ || Math.abs(F.facePoints[2].z - a[J].maxZ) < 0.3;
+                let ct = new y.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), q = new y.Vector3(a[J].doorEndPt.x, a[J].doorEndPt.y, 0), bt = new y.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0), Vt = new y.Vector3(F.facePoints[1].x, F.facePoints[1].y, 0), Ut = F.facePoints[2].z < a[J].maxZ || Math.abs(F.facePoints[2].z - a[J].maxZ) < 0.3;
                 if (Math.abs(F.facePoints[2].z - a[J].maxZ) > 0.2, Ut) {
-                  let at = ne(ct.clone(), N.clone(), bt.clone(), Vt.clone(), {
+                  let at = ne(ct.clone(), q.clone(), bt.clone(), Vt.clone(), {
                     distanceThreshold: 2
                   });
                   if (at && at.type == "collinear_gap") {
-                    let Q = ee(ct, N), gt = new y.Line3(new y.Vector3(p.start.x, p.start.y, 0), new y.Vector3(p.end.x, p.end.y, 0)), Pt = new y.Vector3(), Gt = gt.closestPointToPoint(Q, !0, Pt);
+                    let Q = ee(ct, q), gt = new y.Line3(new y.Vector3(p.start.x, p.start.y, 0), new y.Vector3(p.end.x, p.end.y, 0)), Pt = new y.Vector3(), Gt = gt.closestPointToPoint(Q, !0, Pt);
                     if (Q.distanceTo(Gt) < 0.15) {
                       let Z = bt.distanceTo(ct), k = Vt.distanceTo(ct);
                       if (Z > 0.25 && k > 0.25) {
-                        let it = bt.distanceTo(N), dt = Vt.distanceTo(N);
+                        let it = bt.distanceTo(q), dt = Vt.distanceTo(q);
                         if (it > 0.2 && dt > 0.2)
                           continue;
                       }
-                      _t = !0, Tt = !0, Ft.push(a[J].index), a[J].isFind = !0, Et = J, e[a[J].index].isFindBeam = !0;
-                      let ft = new y.Vector3().subVectors(bt, Vt).normalize(), U = ct.distanceTo(N) - at.overlap;
-                      k < Z && ft.negate(), Z > k ? (tt = F.facePoints[2].clone().addScaledVector(ft, U), lt = F.facePoints[3].clone(), q = lt.clone(), j = tt.clone(), q.z = j.z = F.facePoints[0].z) : (tt = F.facePoints[2].clone(), lt = F.facePoints[3].clone().addScaledVector(ft, U), q = lt.clone(), j = tt.clone(), q.z = j.z = F.facePoints[0].z);
+                      _t = !0, Et = !0, Ft.push(a[J].index), a[J].isFind = !0, Tt = J, e[a[J].index].isFindBeam = !0;
+                      let ft = new y.Vector3().subVectors(bt, Vt).normalize(), U = ct.distanceTo(q) - at.overlap;
+                      k < Z && ft.negate(), Z > k ? (tt = F.facePoints[2].clone().addScaledVector(ft, U), lt = F.facePoints[3].clone(), W = lt.clone(), j = tt.clone(), W.z = j.z = F.facePoints[0].z) : (tt = F.facePoints[2].clone(), lt = F.facePoints[3].clone().addScaledVector(ft, U), W = lt.clone(), j = tt.clone(), W.z = j.z = F.facePoints[0].z);
                     }
                   } else if (at && at.type == "collinear_overlap" && at.maxPerpendicularDistance < 0.35) {
-                    let Q = bt.distanceTo(Vt), gt = N.distanceTo(ct);
+                    let Q = bt.distanceTo(Vt), gt = q.distanceTo(ct);
                     if (Math.abs(Q - at.overlap) < 0.25 || Math.abs(gt - at.overlap) < 0.25) {
                       if (gt > Q && Math.abs(gt - at.overlap) > 1) {
-                        let Pt = bt.distanceTo(ct), Gt = bt.distanceTo(N), ht = Vt.distanceTo(ct), Z = Vt.distanceTo(N), k = Pt < Gt ? Pt : Gt, ft = ht < Z ? ht : Z, U = new y.Vector3().subVectors(bt, Vt).normalize(), it = gt - at.overlap;
-                        k < ft ? (U.negate(), tt = F.facePoints[2].clone().addScaledVector(U, it), lt = F.facePoints[3].clone(), q = lt.clone(), j = tt.clone(), q.z = j.z = F.facePoints[0].z) : (tt = F.facePoints[2].clone(), lt = F.facePoints[3].clone().addScaledVector(U, it), q = lt.clone(), j = tt.clone(), q.z = j.z = F.facePoints[0].z);
+                        let Pt = bt.distanceTo(ct), Gt = bt.distanceTo(q), ht = Vt.distanceTo(ct), Z = Vt.distanceTo(q), k = Pt < Gt ? Pt : Gt, ft = ht < Z ? ht : Z, U = new y.Vector3().subVectors(bt, Vt).normalize(), it = gt - at.overlap;
+                        k < ft ? (U.negate(), tt = F.facePoints[2].clone().addScaledVector(U, it), lt = F.facePoints[3].clone(), W = lt.clone(), j = tt.clone(), W.z = j.z = F.facePoints[0].z) : (tt = F.facePoints[2].clone(), lt = F.facePoints[3].clone().addScaledVector(U, it), W = lt.clone(), j = tt.clone(), W.z = j.z = F.facePoints[0].z);
                       }
-                      _t = !0, Tt = !0, Ft.push(a[J].index), a[J].isFind = !0, e[a[J].index].isFindBeam = !0, Et = J;
+                      _t = !0, Et = !0, Ft.push(a[J].index), a[J].isFind = !0, e[a[J].index].isFindBeam = !0, Tt = J;
                     }
                   }
                 }
               }
-              if (!Tt && Y < 1.5)
+              if (!Et && H < 1.5)
                 for (let J = 0; J < a.length; J++) {
                   if (a[J].inWall) continue;
-                  let ct = new y.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), N = 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, N).normalize(), at = new y.Vector3().subVectors(bt, Vt).normalize(), Q = 0.25, gt = ct.clone().addScaledVector(Ut, Q), Pt = N.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 = N.distanceTo(bt), dt = N.distanceTo(Vt);
-                  (ft < m || U < m || it < m || dt < m || Z) && k && (e[a[J].index].isFindBeam = !0, _t = !0, a[J].isFind = !0, Et = J);
+                  let ct = new y.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), q = new y.Vector3(a[J].doorEndPt.x, a[J].doorEndPt.y, 0), bt = new y.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0), Vt = new y.Vector3(F.facePoints[1].x, F.facePoints[1].y, 0), Ut = 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 || qt || Math.abs(Mt - V) > 0.1 && Mt > V / 2 && Y > 0.3) && (Lt = !0);
+              (_t || Wt || Math.abs(Mt - V) > 0.1 && Mt > V / 2 && H > 0.3) && (Rt = !0);
             }
           }
-          if (Lt) {
-            let qt = !1;
-            for (let Z = 0; Z < g.length; Z++) {
-              let k = ne(g[Z].start, g[Z].end, q, j);
+          if (Rt) {
+            let Wt = !1;
+            for (let Z = 0; Z < d.length; Z++) {
+              let k = ne(d[Z].start, d[Z].end, W, j);
               if (k && k.type == "collinear_overlap" && k.maxPerpendicularDistance < 0.01) {
-                qt = !0;
+                Wt = !0;
                 break;
               }
             }
-            if (qt) {
-              Et != -1 && (e[a[Et].index].isFindBeam = !1, a[Et].isFind = !1);
+            if (Wt) {
+              Tt != -1 && (e[a[Tt].index].isFindBeam = !1, a[Tt].isFind = !1);
               continue;
             }
-            g.push({
-              start: q,
+            d.push({
+              start: W,
               end: j
             });
             {
               new y.PointsMaterial({ color: 65535, size: 0.01 });
-              let Z = new y.Vector3().subVectors(q, j), k = new y.Vector3().subVectors(j, q), ft = 1 / 0, U = 1 / 0, it = q.clone(), dt = j.clone();
+              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 = [];
-              let At = new y.Line3(tt, lt), $ = new y.Vector3(), pt = 999999;
+              let At = new y.Line3(tt, lt), Y = new y.Vector3(), pt = 999999;
               if (p.originalPoints.forEach((et) => {
-                if (et.z - q.z < Mt / 2 + 0.1 && et.z - q.z > Mt / 2 - 0.1 && Ct.push(et), et.z > tt.z) {
-                  let st = At.closestPointToPoint(et, !0, $), xt = new y.Vector3().subVectors(st, tt), vt = new y.Vector3().subVectors(st, lt), Bt = oe(Z, vt), wt = oe(k, xt);
+                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);
                 }
               }), Ct.length > 0) {
-                const { newProjectPoints: et } = ze(q, j, Ct);
+                const { newProjectPoints: et } = ze(W, j, Ct);
                 for (const st of et)
-                  st.z = q.z;
+                  st.z = W.z;
                 et.forEach((st) => {
-                  let xt = new y.Vector3(st.x, st.y, q.z), vt = new y.Vector3().subVectors(xt, j), Bt = new y.Vector3().subVectors(xt, q), wt = oe(Z, Bt), Xt = oe(k, vt);
+                  let xt = new y.Vector3(st.x, st.y, W.z), vt = new y.Vector3().subVectors(xt, j), Bt = new y.Vector3().subVectors(xt, W), wt = oe(Z, Bt), Xt = oe(k, vt);
                   if (wt && wt.parallel && wt.sameDirection) {
-                    let Ht = xt.distanceTo(q);
-                    Ht < ft && (ft = Ht, it = xt);
+                    let $t = xt.distanceTo(W);
+                    $t < ft && (ft = $t, it = xt);
                   } else if (Xt && Xt.parallel && Xt.sameDirection) {
-                    let Ht = xt.distanceTo(j);
-                    Ht < U && (U = Ht, dt = xt);
+                    let $t = xt.distanceTo(j);
+                    $t < U && (U = $t, dt = xt);
                   }
                 });
               }
-              if (it.equals(q) || (q = it, lt = new y.Vector3(q.x, q.y, lt.z)), dt.equals(j) || (j = dt, tt = new y.Vector3(j.x, j.y, tt.z)), St.length > 10) {
+              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);
                 for (let st = 0; st < et.length; st++) {
-                  let vt = At.closestPointToPoint(et[st], !0, $).distanceTo(et[st]);
+                  let vt = At.closestPointToPoint(et[st], !0, Y).distanceTo(et[st]);
                   vt > 0.02 && pt > vt && (pt = vt);
                 }
                 tt.z += pt, lt.z += pt, Mt += pt;
               }
             }
-            let J = j.distanceTo(q);
+            let J = j.distanceTo(W);
             if (J < 0.4 && !_t || J < 0.3 && _t)
               continue;
-            h.includes(f) || h.push(f), p.checkResults[T.index].isDoor = !0;
-            let ct = "", N = {
+            h.includes(m) || h.push(m), p.checkResults[E.index].isDoor = !0;
+            let ct = "", q = {
               id: l,
               beamStart: tt,
               beamEnd: lt,
               beamHeight: p.rooftopPz - tt.z,
-              doorStart: q,
+              doorStart: W,
               doorEnd: j,
               doorHeight: Mt,
               nearId: -1,
               // type: isExtendBeam ? "extendBeam" : "doorBeam",
               type: ct,
-              isExtend: Wt,
+              isExtend: Nt,
               isDoor: _t,
-              isPullOutDoor: Tt,
+              isPullOutDoor: Et,
               pcbDoorIndexs: Ft,
               beamNearWallVec: new y.Vector3(0, 0, 0)
             }, bt = !1, Vt = new y.Vector3(), Ut = new y.Vector3(), at = -1, Q = -1, gt = -1;
@@ -1929,62 +1929,62 @@ const fi = 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), $ = At.distanceTo(Ct), pt = new y.Vector3().subVectors(Ct, At).normalize(), et = pt.clone().negate(), st = Ct.clone().addScaledVector(et, $ + 0.1), xt = te(dt.start, dt.end, Ct, st), vt = !_t && !k.isDoor && (U > it * 2 || it > U * 2);
-                if ($ < 0.4 && xt != null && !vt) {
-                  k.nearId = l, N.nearId = k.id;
+                let St = new y.Vector3(), At = dt.closestPointToPoint(Ct, !0, St), Y = At.distanceTo(Ct), pt = new y.Vector3().subVectors(Ct, At).normalize(), et = pt.clone().negate(), st = Ct.clone().addScaledVector(et, Y + 0.1), xt = te(dt.start, dt.end, Ct, st), vt = !_t && !k.isDoor && (U > it * 2 || it > U * 2);
+                if (Y < 0.4 && xt != null && !vt) {
+                  k.nearId = l, q.nearId = k.id;
                   let Bt = 0.8;
-                  (k.isDoor || N.isDoor) && (k.isDoor = !0, N.isDoor = !0);
+                  (k.isDoor || q.isDoor) && (k.isDoor = !0, q.isDoor = !0);
                   const wt = Ft.some((Xt) => k.pcbDoorIndexs.includes(Xt));
-                  U < it ? U > Bt && !k.isPullOutDoor ? (k.beamStart = tt.clone().addScaledVector(et, $), k.beamEnd = lt.clone().addScaledVector(et, $), k.doorStart = q.clone().addScaledVector(et, $), k.doorEnd = j.clone().addScaledVector(et, $), k.doorHeight = N.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : !Tt || Tt && k.isPullOutDoor && wt ? (N.beamStart = k.beamStart.clone().addScaledVector(pt, $), N.beamEnd = k.beamEnd.clone().addScaledVector(pt, $), N.doorStart = k.doorStart.clone().addScaledVector(pt, $), N.doorEnd = k.doorEnd.clone().addScaledVector(pt, $), N.doorHeight = k.doorHeight, N.beamStart.z = N.beamEnd.z = N.doorStart.z + N.doorHeight) : (k.beamStart = tt.clone().addScaledVector(et, $), k.beamEnd = lt.clone().addScaledVector(et, $), k.doorStart = q.clone().addScaledVector(et, $), k.doorEnd = j.clone().addScaledVector(et, $), k.doorHeight = N.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : U > it && (it > Bt && !Tt ? (N.beamStart = k.beamStart.clone().addScaledVector(et, $), N.beamEnd = k.beamEnd.clone().addScaledVector(et, $), N.doorStart = k.doorStart.clone().addScaledVector(et, $), N.doorEnd = k.doorEnd.clone().addScaledVector(et, $), N.doorHeight = k.doorHeight, N.beamStart.z = N.beamEnd.z = N.doorStart.z + N.doorHeight) : !k.isPullOutDoor || Tt && k.isPullOutDoor && wt ? (k.beamStart = tt.clone().addScaledVector(pt, $), k.beamEnd = lt.clone().addScaledVector(pt, $), k.doorStart = q.clone().addScaledVector(pt, $), k.doorEnd = j.clone().addScaledVector(pt, $), k.doorHeight = N.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : (N.beamStart = k.beamStart.clone().addScaledVector(et, $), N.beamEnd = k.beamEnd.clone().addScaledVector(et, $), N.doorStart = k.doorStart.clone().addScaledVector(et, $), N.doorEnd = k.doorEnd.clone().addScaledVector(et, $), N.doorHeight = k.doorHeight, N.beamStart.z = N.beamEnd.z = N.doorStart.z + N.doorHeight)), at = N.nearId, Vt = k.beamStart.clone(), Ut = k.beamEnd.clone(), bt = !0, Q = u[Z].linesIndex, gt = u[Z].doorIndex;
+                  U < it ? U > Bt && !k.isPullOutDoor ? (k.beamStart = tt.clone().addScaledVector(et, Y), k.beamEnd = lt.clone().addScaledVector(et, Y), k.doorStart = W.clone().addScaledVector(et, Y), k.doorEnd = j.clone().addScaledVector(et, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : !Et || Et && k.isPullOutDoor && wt ? (q.beamStart = k.beamStart.clone().addScaledVector(pt, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(pt, Y), q.doorStart = k.doorStart.clone().addScaledVector(pt, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(pt, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight) : (k.beamStart = tt.clone().addScaledVector(et, Y), k.beamEnd = lt.clone().addScaledVector(et, Y), k.doorStart = W.clone().addScaledVector(et, Y), k.doorEnd = j.clone().addScaledVector(et, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : U > it && (it > Bt && !Et ? (q.beamStart = k.beamStart.clone().addScaledVector(et, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(et, Y), q.doorStart = k.doorStart.clone().addScaledVector(et, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(et, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight) : !k.isPullOutDoor || Et && k.isPullOutDoor && wt ? (k.beamStart = tt.clone().addScaledVector(pt, Y), k.beamEnd = lt.clone().addScaledVector(pt, Y), k.doorStart = W.clone().addScaledVector(pt, Y), k.doorEnd = j.clone().addScaledVector(pt, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : (q.beamStart = k.beamStart.clone().addScaledVector(et, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(et, Y), q.doorStart = k.doorStart.clone().addScaledVector(et, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(et, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight)), at = q.nearId, Vt = k.beamStart.clone(), Ut = k.beamEnd.clone(), bt = !0, Q = u[Z].linesIndex, gt = u[Z].doorIndex;
                   break;
                 }
               }
             }
             let Pt = !1;
             if (!bt) {
-              let Z = new y.Line3(q.clone(), j.clone());
+              let Z = new y.Line3(W.clone(), j.clone());
               for (let k = 0; k < n.length; k++) {
-                if (n[k].length < 0.5 || k == f) continue;
-                let ft = new y.Vector3(n[k].start.x, n[k].start.y, n[k].start.z), U = new y.Vector3(n[k].end.x, n[k].end.y, n[k].end.z), it = ne(ft, U, q, j), dt = Jt(ft, U, q, j);
+                if (n[k].length < 0.5 || k == m) continue;
+                let ft = new y.Vector3(n[k].start.x, n[k].start.y, n[k].start.z), U = new y.Vector3(n[k].end.x, n[k].end.y, n[k].end.z), it = ne(ft, U, W, j), dt = Jt(ft, U, W, j);
                 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(q.x, q.y, ft.z), vt = st.closestPointToPoint(xt, !0, new y.Vector3()), Bt = re(vt, xt, q, j);
-                    Bt && Bt.angle > 85 && (N.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), vt = st.closestPointToPoint(xt, !0, new y.Vector3()), Bt = re(vt, xt, W, j);
+                    Bt && Bt.angle > 85 && (q.beamNearWallVec = new y.Vector3().subVectors(vt, xt).normalize());
                   }
                   const St = [];
                   n[k].originalPoints.forEach((st) => {
-                    st.z > q.z + 0.2 && st.z < q.z + Mt / 2 && St.push(new y.Vector3(st.x, st.y, q.z));
+                    st.z > W.z + 0.2 && st.z < W.z + Mt / 2 && St.push(new y.Vector3(st.x, st.y, W.z));
                   });
                   const At = new y.Vector3();
-                  let $ = [], pt = [];
+                  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 && ($.push(St[st]), pt.push(xt.clone()));
+                    xt.distanceTo(St[st]) < 0.15 && (Y.push(St[st]), pt.push(xt.clone()));
                   }
                   for (let st = 0; st < pt.length; st++)
-                    mo(Z, pt[st]) && $.push(pt[st]);
-                  if ($ = pt, $ = po($), $.length < 150) continue;
-                  let et = Se($);
+                    mo(Z, pt[st]) && Y.push(pt[st]);
+                  if (Y = pt, Y = po(Y), Y.length < 150) continue;
+                  let et = Se(Y);
                   if (et.length == 2) {
                     let st = et[0].distanceTo(et[1]);
                     if (Math.abs(st - Z.distance()) < 0.3) {
-                      let xt = new y.Line3(ft, U), vt = new y.Vector3(q.x, q.y, ft.z), Bt = xt.closestPointToPoint(vt, !0, new y.Vector3());
-                      if (N.beamNearWallVec = new y.Vector3().subVectors(Bt, vt).normalize(), N.beamStart.z > Ct.maxZ - 0.03 && Y > 1)
+                      let xt = new y.Line3(ft, U), vt = new y.Vector3(W.x, W.y, ft.z), Bt = xt.closestPointToPoint(vt, !0, new y.Vector3());
+                      if (q.beamNearWallVec = new y.Vector3().subVectors(Bt, vt).normalize(), q.beamStart.z > Ct.maxZ - 0.03 && H > 1)
                         Pt = !0;
-                      else if (qt = !0, Et != -1 && (e[a[Et].index].isFindBeam = !1, a[Et].isFind = !1), Q != -1 && gt != -1) {
+                      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];
                         wt.nearId = -1;
                       }
                       break;
                     }
                   }
-                  if (qt)
+                  if (Wt)
                     break;
                 } else it && it.type == "collinear_overlap" && it.maxPerpendicularDistance > 0.3 && it.maxPerpendicularDistance < 0.7 && (Pt = !0);
               }
-              if (qt) {
-                if (Y < 1.8)
+              if (Wt) {
+                if (H < 1.8)
                   continue;
                 Pt = !0;
               }
@@ -1994,8 +1994,8 @@ const fi = async (n, t, e, o, i) => {
               for (let Z = 0; Z < c.length && !(c[Z].length == 1 && (c[Z][0].id == l ? (c[Z].push({ id: at, beamStart: Vt, beamEnd: Ut }), Gt = !0) : c[Z][0].id == at && (c[Z].push({ id: l, beamStart: tt, beamEnd: lt }), Gt = !0), Gt)); Z++)
                 ;
             Gt || c.push([{ id: l, beamStart: tt, beamEnd: lt }]);
-            const ht = N.doorStart.distanceTo(N.doorEnd);
-            if (_t ? ct = "door" : ht > 1.8 ? ct = "beam" : ct = Pt && ht > 1 ? "beam" : "hole", N.type = ct, N.nearId != -1 && ct == "hole") {
+            const ht = q.doorStart.distanceTo(q.doorEnd);
+            if (_t ? ct = "door" : ht > 1.8 ? ct = "beam" : ct = Pt && ht > 1 ? "beam" : "hole", q.type = ct, q.nearId != -1 && ct == "hole") {
               let Z = !1;
               for (let k = 0; k < n.length; k++)
                 if (n[k].doorAndBeamData) {
@@ -2007,10 +2007,10 @@ const fi = async (n, t, e, o, i) => {
                   if (Z) break;
                 }
             }
-            if (p.doorAndBeamData.push(N), u.push({
-              linesIndex: f,
+            if (p.doorAndBeamData.push(q), u.push({
+              linesIndex: m,
               doorIndex: p.doorAndBeamData.length - 1
-            }), l++, Tt && Y < 2) break;
+            }), l++, Et && H < 2) break;
           }
         }
     }
@@ -2018,110 +2018,110 @@ const fi = async (n, t, e, o, i) => {
     p.completePointAreaPercentage = D / _ * 100;
   }
   if (h.length > 1)
-    for (let f = 0; f < h.length; f++) {
+    for (let m = 0; m < h.length; m++) {
       let p = [];
-      for (let b = 0; b < n[h[f]].doorAndBeamData.length; b++) {
+      for (let b = 0; b < n[h[m]].doorAndBeamData.length; b++) {
         let z = !1;
-        if (n[h[f]].doorAndBeamData[b].type === "beam" && n[h[f]].doorAndBeamData[b].beamNearWallVec.x == 0 && n[h[f]].doorAndBeamData[b].beamNearWallVec.y == 0 && n[h[f]].doorAndBeamData[b].beamNearWallVec.z == 0 && n[h[f]].doorAndBeamData[b].nearId == -1 && (z = !0), !z) {
-          let v = n[h[f]].doorAndBeamData[b].doorStart.clone(), S = n[h[f]].doorAndBeamData[b].doorEnd.clone();
+        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);
           for (let D = 0; D < h.length; D++)
-            if (f != D)
+            if (m != D)
               for (let _ = 0; _ < n[h[D]].doorAndBeamData.length; _++) {
-                let T = n[h[D]].doorAndBeamData[_].doorStart.clone(), E = n[h[D]].doorAndBeamData[_].doorEnd.clone();
-                T.z = E.z = 0, T.distanceTo(E);
-                let A = ne(v, S, T, E);
+                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);
                 if (A.type == "collinear_overlap" && A.maxPerpendicularDistance < 0.2) {
-                  let O = new y.Line3(T, E), I = ee(v, S), 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[f]].doorAndBeamData[b].id && (n[h[D]].doorAndBeamData[_].nearId = -1), z = !0;
+                  let O = new y.Line3(E, T), I = ee(v, S), B = O.closestPointToPoint(I, !0, new y.Vector3()), 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;
                     break;
                   }
                 }
               }
         }
-        z || p.push(n[h[f]].doorAndBeamData[b]);
+        z || p.push(n[h[m]].doorAndBeamData[b]);
       }
-      p.length != n[h[f]].doorAndBeamData.length && (n[h[f]].doorAndBeamData = p);
+      p.length != n[h[m]].doorAndBeamData.length && (n[h[m]].doorAndBeamData = p);
     }
   let w = 0.65, x = 2, P = [], M = [];
-  for (let f = 0; f < a.length; f++) {
-    if (a[f].isFind || a[f].inWall)
+  for (let m = 0; m < a.length; m++) {
+    if (a[m].isFind || a[m].inWall)
       continue;
-    let p = new y.Vector3(a[f].doorStartPt.x, a[f].doorStartPt.y, 0), b = new y.Vector3(a[f].doorEndPt.x, a[f].doorEndPt.y, 0), z = new y.Vector3().subVectors(p, b).normalize();
+    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)
         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, T = p.clone().addScaledVector(z, _), E = b.clone().addScaledVector(z.clone().negate(), _), A = S.clone().addScaledVector(D, _), O = V.clone().addScaledVector(D.clone().negate(), _);
-      te(T, E, A, O);
+      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(), _);
+      te(E, T, A, O);
       let I = Jt(
-        T,
         E,
+        T,
         A,
         O
-      ), B = p.distanceTo(S) > b.distanceTo(S) ? b : p, R = B.distanceTo(S), W = B.distanceTo(V);
-      if ((R < m || W < m) && I && !I.isParallel) {
-        let L = p.distanceTo(S), H = p.distanceTo(V), X = L < H ? S : V, ot = !1;
+      ), 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;
         for (let K = 0; K < n.length; K++) {
           if (K == v || P.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(), Y = G.clone().addScaledVector(rt, 5), Mt = ut.clone().addScaledVector(F, 5), Zt = re(S, V, G, ut), Nt = ne(S, V, G, ut), Lt = te(S, V, Y, Mt), _t = !0;
-          if (Lt != null && (_t = Lt.point.distanceTo(S) < m || Lt.point.distanceTo(V) < m), (Zt && Zt.angle > 85 || Nt && Nt.type == "collinear_gap") && _t) {
-            let Tt = new y.Line3(S, V), Ft = new y.Vector3(), tt = Tt.closestPointToPoint(G, !0, Ft), lt = Tt.closestPointToPoint(ut, !0, Ft), q = tt.distanceTo(G), j = lt.distanceTo(ut), Wt, Et;
-            if (q > j && j > w)
-              Wt = ut, Et = lt;
-            else if (q < j && q > w)
-              Wt = G, Et = tt;
+          let G = new y.Vector3(n[K].start.x, n[K].start.y, 0), ut = new y.Vector3(n[K].end.x, n[K].end.y, 0), rt = new y.Vector3().subVectors(G, ut).normalize(), F = rt.clone().negate(), H = G.clone().addScaledVector(rt, 5), Mt = ut.clone().addScaledVector(F, 5), Zt = re(S, 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;
+            if (W > j && j > w)
+              Nt = ut, Tt = lt;
+            else if (W < j && W > w)
+              Nt = G, Tt = tt;
             else
               continue;
-            if (q = X.distanceTo(G), j = X.distanceTo(ut), q > x && j > x)
+            if (W = X.distanceTo(G), j = X.distanceTo(ut), W > x && j > x)
               continue;
-            let qt = Jt(Wt, Et, G, ut), J = Jt(Wt, Et, T, E);
-            if (J && J.isParallel || !qt || !qt.isParallel)
+            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, Wt, Et);
+            let ct = ne(p, b, Nt, Tt);
             if (ct && ct.type == "collinear_overlap" && ct.maxPerpendicularDistance < 0.2)
               continue;
-            Wt.z = Et.z = n[K].start.z;
-            let N = !1;
+            Nt.z = Tt.z = n[K].start.z;
+            let q = !1;
             for (let at = 0; at < M.length; at++) {
-              let Q = ne(M[at].start, M[at].end, Wt, Et);
+              let Q = ne(M[at].start, M[at].end, Nt, Tt);
               if (Q && Q.type == "collinear_overlap" && Q.maxPerpendicularDistance < 0.2) {
-                N = !0;
+                q = !0;
                 break;
               }
             }
-            if (N)
+            if (q)
               continue;
             for (let at = 0; at < n.length; at++) {
               if (n[at].length < 0.5) continue;
-              let Q = new y.Vector3(n[at].start.x, n[at].start.y, n[at].start.z), gt = new y.Vector3(n[at].end.x, n[at].end.y, n[at].end.z), Pt = ne(Q, gt, Wt, Et);
+              let Q = new y.Vector3(n[at].start.x, n[at].start.y, n[at].start.z), gt = new y.Vector3(n[at].end.x, n[at].end.y, n[at].end.z), Pt = ne(Q, gt, Nt, Tt);
               if (Pt && Pt.type == "collinear_overlap" && Pt.maxPerpendicularDistance < 0.1) {
-                N = !0;
+                q = !0;
                 break;
               }
             }
-            if (N)
+            if (q)
               continue;
             M.push({
-              start: Wt,
-              end: Et
+              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;
             n[K].doorAndBeamData || (n[K].doorAndBeamData = []), n[K].doorAndBeamData.push({
               id: l,
-              beamStart: Wt,
-              beamEnd: Et,
+              beamStart: Nt,
+              beamEnd: Tt,
               beamHeight: Ut,
-              doorStart: Wt,
-              doorEnd: Et,
+              doorStart: Nt,
+              doorEnd: Tt,
               doorHeight: Ut,
               nearId: -1,
               type: "onlyDoor",
               isDoor: !0,
               beamNearWallVec: new y.Vector3(0, 0, 0)
-            }), e[a[f].index].isFindBeam = !0, e[a[f].index].isFindOnlyDoor = !0, c.push([{ id: l, beamStart: Wt, beamEnd: Et }]), l++, ot = !0;
+            }), e[a[m].index].isFindBeam = !0, e[a[m].index].isFindOnlyDoor = !0, c.push([{ id: l, beamStart: Nt, beamEnd: Tt }]), l++, ot = !0;
             break;
           }
         }
@@ -2129,11 +2129,11 @@ const fi = async (n, t, e, o, i) => {
       }
     }
   }
-  let d = [];
-  for (let f = 0; f < n.length; f++)
-    n[f].isLine2 || d.push(n[f]), n[f].isLine2 && n[f].doorAndBeamData.length != 0 && d.push(n[f]);
-  return n.length = 0, n.push(...d), { lines: n, beamGroup: c };
-}, di = (n, t) => {
+  let g = [];
+  for (let m = 0; m < n.length; m++)
+    n[m].isLine2 || g.push(n[m]), n[m].isLine2 && n[m].doorAndBeamData.length != 0 && g.push(n[m]);
+  return n.length = 0, n.push(...g), { lines: n, beamGroup: c };
+}, bi = (n, t) => {
   if (!n || n.length <= 0) return;
   let e = {
     rectangles: [],
@@ -2148,49 +2148,49 @@ const fi = async (n, t, e, o, i) => {
     let u = n[l].length;
     if (o.has(n[l].uuid) || u < i || u > r)
       continue;
-    let h = [], g = 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, g).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(), P = new y.Vector3(), M = new y.Vector3();
     new y.Vector3();
-    for (let d = 0; d < n.length; d++) {
-      let f = n[d].length;
-      if (d == l || f < i || f > r)
+    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[d].start.x, n[d].start.y, n[d].start.z), b = new y.Vector3(n[d].end.x, n[d].end.y, n[d].end.z), z = re(g, c, p, b);
+      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);
       if (!z || z.angle < 85)
         continue;
-      let v = kt(p, g), S = kt(p, c), V = kt(b, g), D = kt(b, c);
+      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();
         for (let _ = 0; _ < n.length; _++) {
-          let T = n[_].length;
-          if (_ == l || _ == d || T < i || T > r)
+          let E = n[_].length;
+          if (_ == l || _ == g || E < i || E > r)
             continue;
-          let E = 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, E, 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, b, T, A);
           if (!O || O.angle < 85)
             continue;
-          let I = kt(E, P), B = kt(A, P);
+          let I = kt(T, P), B = kt(A, P);
           if (!I && !B) continue;
           new y.Vector3();
-          let R = new y.Vector3(), W = new y.Vector3();
-          I ? (W = new y.Vector3().subVectors(A, E).normalize(), E.clone(), R = A.clone()) : (W = new y.Vector3().subVectors(E, A).normalize(), A.clone(), R = E.clone());
-          let C = oe(w, W, 0.1);
+          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 C = oe(w, N, 0.1);
           if (!(!C || !C.parallel || !C.sameDirection)) {
-            for (let L = 0; L < n.length; L++) {
-              let H = n[L].length;
-              if (L == l || L == d || L == _ || H < i || H > r)
+            for (let R = 0; R < n.length; R++) {
+              let $ = n[R].length;
+              if (R == l || R == g || R == _ || $ < i || $ > r)
                 continue;
-              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, E, A);
+              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);
               if (!K || K.angle < 85)
                 continue;
-              let G = kt(X, R), ut = kt(ot, R);
+              let G = kt(X, L), ut = kt(ot, L);
               if (!G && !ut) continue;
               new y.Vector3();
               let rt = new y.Vector3();
               G ? (X.clone(), rt = ot.clone()) : (ot.clone(), rt = X.clone());
-              let F = kt(rt, g), Y = kt(rt, c);
-              if (!F && !Y) continue;
-              let Mt = u * f;
+              let F = kt(rt, d), H = kt(rt, c);
+              if (!F && !H) continue;
+              let Mt = u * m;
               if (!(Mt < s || Mt > a)) {
-                h = [n[l].uuid, n[d].uuid, n[_].uuid, n[L].uuid];
+                h = [n[l].uuid, n[g].uuid, n[_].uuid, n[R].uuid];
                 break;
               }
             }
@@ -2202,7 +2202,7 @@ const fi = async (n, t, e, o, i) => {
           break;
       }
     }
-    h.length == 4 && (h.forEach((d) => o.add(d)), e.rectangles.push(h));
+    h.length == 4 && (h.forEach((g) => o.add(g)), e.rectangles.push(h));
   }
   for (let l = 0; l < n.length; l++) {
     let u = n[l].length;
@@ -2214,52 +2214,52 @@ const fi = async (n, t, e, o, i) => {
         start: new y.Vector3(),
         end: new y.Vector3()
       }
-    }, g = 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), m = !0, w = !0;
+    }, 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), f = !0, w = !0;
     for (let M = 0; M < n.length; M++) {
       if (M == l || n[M].length < i)
         continue;
-      let d = new y.Vector3(n[M].start.x, n[M].start.y, n[M].start.z), f = new y.Vector3(n[M].end.x, n[M].end.y, n[M].end.z), p = kt(d, g), b = kt(f, g), z = kt(d, c), v = kt(f, c);
-      if (p || b ? m = !1 : (z || v) && (w = !1), !m && !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), b = kt(m, d), z = kt(g, c), v = kt(m, c);
+      if (p || b ? f = !1 : (z || v) && (w = !1), !f && !w) break;
     }
-    if (!m && !w) continue;
+    if (!f && !w) continue;
     let x = new y.Vector3();
-    m || ([g, c] = [c, g]), x = new y.Vector3().subVectors(c, g).normalize();
+    f || ([d, c] = [c, d]), x = new y.Vector3().subVectors(c, d).normalize();
     let P = x.clone().negate();
     for (let M = 0; M < n.length; M++) {
-      let d = n[M].length;
-      if (M == l || o.has(M) || d < i || d > r)
+      let g = n[M].length;
+      if (M == l || o.has(M) || g < i || g > r)
         continue;
-      let f = 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(g, c, f, p);
+      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)
         continue;
-      let z = kt(f, c), v = kt(p, c);
+      let z = kt(m, c), v = kt(p, c);
       if (!z && !v) continue;
       new y.Vector3();
       let S = new y.Vector3();
-      z ? (f.clone(), S = p.clone()) : (p.clone(), S = f.clone());
+      z ? (m.clone(), S = p.clone()) : (p.clone(), S = 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)
           continue;
-        let _ = new y.Vector3(n[V].start.x, n[V].start.y, n[V].start.z), T = new y.Vector3(n[V].end.x, n[V].end.y, n[V].end.z), E = re(f, p, _, T);
-        if (!E || E.angle < 85)
+        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(T, S);
+        let A = kt(_, S), O = kt(E, S);
         if (!A && !O) continue;
         let I = new y.Vector3(), B = new y.Vector3();
-        A ? (I = _.clone(), B = T.clone()) : (I = T.clone(), B = _.clone());
-        let R = new y.Vector3().subVectors(B, I).normalize(), W = oe(P, R, 0.1);
-        if (!W || !W.parallel || !W.sameDirection) continue;
-        let C = !0, L = !0;
+        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);
+        if (!N || !N.parallel || !N.sameDirection) continue;
+        let C = !0, R = !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, T), F = kt(K, T);
-          if (G || ut ? C = !1 : (rt || F) && (L = !1), !C && !L) break;
+          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 (!C && !L) continue;
-        let H = u * d;
-        if (!(H < s || H > a)) {
-          h.indexs = [n[l].uuid, n[M].uuid, n[V].uuid], h.missingEdge.start = B, h.missingEdge.end = g;
+        if (!C && !R) 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;
           break;
         }
       }
@@ -2268,19 +2268,19 @@ const fi = async (n, t, e, o, i) => {
     h.indexs.length == 3 && (h.indexs.forEach((M) => o.add(M)), e.threeEdgeRect.push(h));
   }
   return e;
-}, ae = 11102230246251565e-32, $t = 134217729, Do = (3 + 8 * ae) * ae;
-function We(n, t, e, o, i) {
-  let r, s, a, l, u = t[0], h = o[0], g = 0, c = 0;
-  h > u == h > -u ? (r = u, u = t[++g]) : (r = h, h = o[++c]);
-  let m = 0;
-  if (g < n && c < e)
-    for (h > u == h > -u ? (s = u + r, a = r - (s - u), u = t[++g]) : (s = h + r, a = r - (s - h), h = o[++c]), r = s, a !== 0 && (i[m++] = a); g < n && c < e; )
-      h > u == h > -u ? (s = r + u, l = s - r, a = r - (s - l) + (u - l), u = t[++g]) : (s = r + h, l = s - r, a = r - (s - l) + (h - l), h = o[++c]), r = s, a !== 0 && (i[m++] = a);
-  for (; g < n; )
-    s = r + u, l = s - r, a = r - (s - l) + (u - l), u = t[++g], r = s, a !== 0 && (i[m++] = a);
+}, ae = 11102230246251565e-32, Yt = 134217729, Do = (3 + 8 * ae) * ae;
+function qe(n, t, e, o, i) {
+  let r, s, a, l, u = t[0], h = o[0], d = 0, c = 0;
+  h > u == h > -u ? (r = u, u = t[++d]) : (r = h, h = o[++c]);
+  let f = 0;
+  if (d < n && c < e)
+    for (h > u == h > -u ? (s = u + r, a = r - (s - u), u = t[++d]) : (s = h + r, a = r - (s - h), h = o[++c]), r = s, a !== 0 && (i[f++] = a); d < n && c < e; )
+      h > u == h > -u ? (s = r + u, l = s - r, a = r - (s - l) + (u - l), u = t[++d]) : (s = r + h, l = s - r, a = r - (s - l) + (h - l), h = o[++c]), r = s, a !== 0 && (i[f++] = a);
+  for (; d < n; )
+    s = r + u, l = s - r, a = r - (s - l) + (u - l), u = t[++d], r = s, a !== 0 && (i[f++] = a);
   for (; c < e; )
-    s = r + h, l = s - r, a = r - (s - l) + (h - l), h = o[++c], r = s, a !== 0 && (i[m++] = a);
-  return (r !== 0 || m === 0) && (i[m++] = r), m;
+    s = r + h, l = s - r, a = r - (s - l) + (h - l), h = o[++c], r = s, a !== 0 && (i[f++] = a);
+  return (r !== 0 || f === 0) && (i[f++] = r), f;
 }
 function _o(n, t) {
   let e = t[0];
@@ -2290,24 +2290,24 @@ function _o(n, t) {
 function Ve(n) {
   return new Float64Array(n);
 }
-const To = (3 + 16 * ae) * ae, Eo = (2 + 12 * ae) * ae, Ao = (9 + 64 * ae) * ae * ae, me = Ve(4), on = Ve(8), rn = Ve(12), sn = Ve(16), jt = Ve(4);
+const Eo = (3 + 16 * ae) * ae, To = (2 + 12 * ae) * ae, Ao = (9 + 64 * ae) * ae * ae, me = 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, g, c, m, w, x, P, M, d, f, p, b, z, v, S;
-  const V = n - i, D = e - i, _ = t - r, T = o - r;
-  p = V * T, c = $t * V, m = c - (c - V), w = V - m, c = $t * T, x = c - (c - T), P = T - x, b = w * P - (p - m * x - w * x - m * P), z = _ * D, c = $t * _, m = c - (c - _), w = _ - m, c = $t * D, x = c - (c - D), P = D - x, v = w * P - (z - m * x - w * x - m * P), M = b - v, g = b - M, me[0] = b - (M + g) + (g - v), d = p + M, g = d - p, f = p - (d - g) + (M - g), M = f - z, g = f - M, me[1] = f - (M + g) + (g - z), S = d + M, g = S - d, me[2] = d - (S - g) + (M - g), me[3] = S;
-  let E = _o(4, me), A = Eo * s;
-  if (E >= A || -E >= A || (g = n - V, a = n - (V + g) + (g - i), g = e - D, u = e - (D + g) + (g - i), g = t - _, l = t - (_ + g) + (g - r), g = o - T, h = o - (T + g) + (g - r), a === 0 && l === 0 && u === 0 && h === 0) || (A = Ao * s + Do * Math.abs(E), E += V * h + T * a - (_ * u + D * l), E >= A || -E >= A)) return E;
-  p = a * T, c = $t * a, m = c - (c - a), w = a - m, c = $t * T, x = c - (c - T), P = T - x, b = w * P - (p - m * x - w * x - m * P), z = l * D, c = $t * l, m = c - (c - l), w = l - m, c = $t * D, x = c - (c - D), P = D - x, v = w * P - (z - m * x - w * x - m * P), M = b - v, g = b - M, jt[0] = b - (M + g) + (g - v), d = p + M, g = d - p, f = p - (d - g) + (M - g), M = f - z, g = f - M, jt[1] = f - (M + g) + (g - z), S = d + M, g = S - d, jt[2] = d - (S - g) + (M - g), jt[3] = S;
-  const O = We(4, me, 4, jt, on);
-  p = V * h, c = $t * V, m = c - (c - V), w = V - m, c = $t * h, x = c - (c - h), P = h - x, b = w * P - (p - m * x - w * x - m * P), z = _ * u, c = $t * _, m = c - (c - _), w = _ - m, c = $t * u, x = c - (c - u), P = u - x, v = w * P - (z - m * x - w * x - m * P), M = b - v, g = b - M, jt[0] = b - (M + g) + (g - v), d = p + M, g = d - p, f = p - (d - g) + (M - g), M = f - z, g = f - M, jt[1] = f - (M + g) + (g - z), S = d + M, g = S - d, jt[2] = d - (S - g) + (M - g), jt[3] = S;
-  const I = We(O, on, 4, jt, rn);
-  p = a * h, c = $t * a, m = c - (c - a), w = a - m, c = $t * h, x = c - (c - h), P = h - x, b = w * P - (p - m * x - w * x - m * P), z = l * u, c = $t * l, m = c - (c - l), w = l - m, c = $t * u, x = c - (c - u), P = u - x, v = w * P - (z - m * x - w * x - m * P), M = b - v, g = b - M, jt[0] = b - (M + g) + (g - v), d = p + M, g = d - p, f = p - (d - g) + (M - g), M = f - z, g = f - M, jt[1] = f - (M + g) + (g - z), S = d + M, g = S - d, jt[2] = d - (S - g) + (M - g), jt[3] = S;
-  const B = We(I, rn, 4, jt, sn);
+  let a, l, u, h, d, c, f, w, x, P, M, g, m, p, b, z, v, S;
+  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;
+  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;
+  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;
+  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;
+  const B = qe(I, rn, 4, jt, sn);
   return sn[B - 1];
 }
 function ve(n, t, e, o, i, r) {
   const s = (t - r) * (e - i), a = (n - i) * (o - r), l = s - a, u = Math.abs(s + a);
-  return Math.abs(l) >= To * u ? l : -Bo(n, t, e, o, i, r, u);
+  return Math.abs(l) >= Eo * u ? l : -Bo(n, t, e, o, i, r, u);
 }
 const an = Math.pow(2, -52), De = new Uint32Array(512);
 class Be {
@@ -2321,7 +2321,7 @@ class Be {
    * @param {(p: P) => number} [getY]
    */
   // @ts-expect-error TS2322
-  static from(t, e = Lo, o = Fo) {
+  static from(t, e = Ro, o = Fo) {
     const i = t.length, r = new Float64Array(i * 2);
     for (let s = 0; s < i; s++) {
       const a = t[s];
@@ -2353,22 +2353,22 @@ class Be {
       const D = t[2 * V], _ = t[2 * V + 1];
       D < a && (a = D), _ < l && (l = _), D > u && (u = D), _ > h && (h = _), this._ids[V] = V;
     }
-    const g = (a + u) / 2, c = (l + h) / 2;
-    let m = 0, w = 0, x = 0;
+    const d = (a + u) / 2, c = (l + h) / 2;
+    let f = 0, w = 0, x = 0;
     for (let V = 0, D = 1 / 0; V < s; V++) {
-      const _ = Ne(g, c, t[2 * V], t[2 * V + 1]);
-      _ < D && (m = V, D = _);
+      const _ = We(d, c, t[2 * V], t[2 * V + 1]);
+      _ < D && (f = V, D = _);
     }
-    const P = t[2 * m], M = t[2 * m + 1];
+    const P = t[2 * f], M = t[2 * f + 1];
     for (let V = 0, D = 1 / 0; V < s; V++) {
-      if (V === m) continue;
-      const _ = Ne(P, M, t[2 * V], t[2 * V + 1]);
+      if (V === f) continue;
+      const _ = We(P, M, t[2 * V], t[2 * V + 1]);
       _ < D && _ > 0 && (w = V, D = _);
     }
-    let d = t[2 * w], f = t[2 * w + 1], p = 1 / 0;
+    let g = t[2 * w], m = t[2 * w + 1], p = 1 / 0;
     for (let V = 0; V < s; V++) {
-      if (V === m || V === w) continue;
-      const D = Co(P, M, d, f, t[2 * V], t[2 * V + 1]);
+      if (V === f || V === w) continue;
+      const D = Co(P, 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];
@@ -2378,47 +2378,47 @@ class Be {
       ye(this._ids, this._dists, 0, s - 1);
       const V = new Uint32Array(s);
       let D = 0;
-      for (let _ = 0, T = -1 / 0; _ < s; _++) {
-        const E = this._ids[_], A = this._dists[E];
-        A > T && (V[D++] = E, T = A);
+      for (let _ = 0, E = -1 / 0; _ < s; _++) {
+        const T = this._ids[_], A = this._dists[T];
+        A > E && (V[D++] = T, E = A);
       }
       this.hull = V.subarray(0, D), this.triangles = new Uint32Array(0), this.halfedges = new Int32Array(0);
       return;
     }
-    if (ve(P, M, d, f, b, z) < 0) {
-      const V = w, D = d, _ = f;
-      w = x, d = b, f = z, x = V, b = D, z = _;
+    if (ve(P, M, g, m, b, z) < 0) {
+      const V = w, D = g, _ = m;
+      w = x, g = b, m = z, x = V, b = D, z = _;
     }
-    const v = Ro(P, M, d, f, b, z);
+    const v = Lo(P, M, g, m, b, z);
     this._cx = v.x, this._cy = v.y;
     for (let V = 0; V < s; V++)
-      this._dists[V] = Ne(t[2 * V], t[2 * V + 1], v.x, v.y);
-    ye(this._ids, this._dists, 0, s - 1), this._hullStart = m;
+      this._dists[V] = We(t[2 * V], t[2 * V + 1], v.x, v.y);
+    ye(this._ids, this._dists, 0, s - 1), this._hullStart = f;
     let S = 3;
-    o[m] = e[x] = w, o[w] = e[m] = x, o[x] = e[w] = m, i[m] = 0, i[w] = 1, i[x] = 2, r.fill(-1), r[this._hashKey(P, M)] = m, r[this._hashKey(d, f)] = w, r[this._hashKey(b, z)] = x, this.trianglesLen = 0, this._addTriangle(m, w, x, -1, -1, -1);
+    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);
     for (let V = 0, D = 0, _ = 0; V < this._ids.length; V++) {
-      const T = this._ids[V], E = t[2 * T], A = t[2 * T + 1];
-      if (V > 0 && Math.abs(E - D) <= an && Math.abs(A - _) <= an || (D = E, _ = A, T === m || T === w || T === x)) continue;
+      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, L = this._hashKey(E, A); C < this._hashSize && (O = r[(L + C) % this._hashSize], !(O !== -1 && O !== o[O])); C++)
+      for (let C = 0, R = this._hashKey(T, A); C < this._hashSize && (O = r[(R + C) % this._hashSize], !(O !== -1 && O !== o[O])); C++)
         ;
       O = e[O];
       let I = O, B;
-      for (; B = o[I], ve(E, A, t[2 * I], t[2 * I + 1], t[2 * B], t[2 * B + 1]) >= 0; )
+      for (; B = o[I], ve(T, A, t[2 * I], t[2 * I + 1], t[2 * B], t[2 * B + 1]) >= 0; )
         if (I = B, I === O) {
           I = -1;
           break;
         }
       if (I === -1) continue;
-      let R = this._addTriangle(I, T, o[I], -1, -1, i[I]);
-      i[T] = this._legalize(R + 2), i[I] = R, S++;
-      let W = o[I];
-      for (; B = o[W], ve(E, A, t[2 * W], t[2 * W + 1], t[2 * B], t[2 * B + 1]) < 0; )
-        R = this._addTriangle(W, T, B, i[T], -1, i[W]), i[T] = this._legalize(R + 2), o[W] = W, S--, W = B;
+      let L = this._addTriangle(I, E, o[I], -1, -1, i[I]);
+      i[E] = this._legalize(L + 2), i[I] = L, S++;
+      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;
       if (I === O)
-        for (; B = e[I], ve(E, A, t[2 * B], t[2 * B + 1], t[2 * I], t[2 * I + 1]) < 0; )
-          R = this._addTriangle(B, T, I, -1, i[I], i[B]), this._legalize(R + 2), i[B] = R, o[I] = I, S--, I = B;
-      this._hullStart = e[T] = I, o[I] = e[W] = T, o[T] = W, r[this._hashKey(E, A)] = T, r[this._hashKey(t[2 * I], t[2 * I + 1])] = I;
+        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;
+      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++)
@@ -2451,32 +2451,32 @@ class Be {
         t = De[--r];
         continue;
       }
-      const u = a - a % 3, h = l + (t + 1) % 3, g = u + (a + 2) % 3, c = e[s], m = e[t], w = e[h], x = e[g];
+      const u = a - a % 3, h = l + (t + 1) % 3, d = u + (a + 2) % 3, c = e[s], f = e[t], w = e[h], x = e[d];
       if (ko(
         i[2 * c],
         i[2 * c + 1],
-        i[2 * m],
-        i[2 * m + 1],
+        i[2 * f],
+        i[2 * f + 1],
         i[2 * w],
         i[2 * w + 1],
         i[2 * x],
         i[2 * x + 1]
       )) {
         e[t] = x, e[a] = c;
-        const M = o[g];
+        const M = o[d];
         if (M === -1) {
-          let f = this._hullStart;
+          let m = this._hullStart;
           do {
-            if (this._hullTri[f] === g) {
-              this._hullTri[f] = t;
+            if (this._hullTri[m] === d) {
+              this._hullTri[m] = t;
               break;
             }
-            f = this._hullPrev[f];
-          } while (f !== this._hullStart);
+            m = this._hullPrev[m];
+          } while (m !== this._hullStart);
         }
-        this._link(t, M), this._link(a, o[s]), this._link(s, g);
-        const d = u + (a + 1) % 3;
-        r < De.length && (De[r++] = d);
+        this._link(t, M), this._link(a, o[s]), this._link(s, d);
+        const g = u + (a + 1) % 3;
+        r < De.length && (De[r++] = g);
       } else {
         if (r === 0) break;
         t = De[--r];
@@ -2513,21 +2513,21 @@ function Io(n, t) {
   const e = n / (Math.abs(n) + Math.abs(t));
   return (t > 0 ? 3 - e : 1 + e) / 4;
 }
-function Ne(n, t, e, o) {
+function We(n, t, e, o) {
   const i = n - e, r = t - 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, g = o - a, c = i - s, m = r - a, w = l * l + u * u, x = h * h + g * g, P = c * c + m * m;
-  return l * (g * P - x * m) - u * (h * P - x * c) + w * (h * m - g * 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, P = c * c + f * f;
+  return l * (d * P - x * f) - u * (h * P - 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, g = l * l + u * u, c = 0.5 / (s * u - a * l), m = (u * h - a * g) * c, w = (s * g - l * h) * c;
-  return m * m + w * w;
+  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 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, g = l * l + u * u, c = 0.5 / (s * u - a * l), m = n + (u * h - a * g) * c, w = t + (s * g - l * h) * c;
-  return { x: m, y: w };
+function Lo(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 };
 }
 function ye(n, t, e, o) {
   if (o - e <= 20)
@@ -2559,7 +2559,7 @@ function Me(n, t, e) {
   const o = n[t];
   n[t] = n[e], n[e] = o;
 }
-function Lo(n) {
+function Ro(n) {
   return n[0];
 }
 function Fo(n) {
@@ -2593,7 +2593,7 @@ class de {
     return this._ || null;
   }
 }
-class Ge {
+class je {
   constructor() {
     this._ = [];
   }
@@ -2622,41 +2622,41 @@ 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, d, f; 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], T = t[z + 1], E = V - v, A = D - S, O = _ - v, I = T - S, B = (E * I - A * O) * 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;
       if (Math.abs(B) < 1e-9) {
         if (r === void 0) {
           r = s = 0;
-          for (const W of e) r += t[W * 2], s += t[W * 2 + 1];
+          for (const N of e) r += t[N * 2], s += t[N * 2 + 1];
           r /= e.length, s /= e.length;
         }
-        const R = 1e9 * Math.sign((r - v) * I - (s - S) * O);
-        d = (v + _) / 2 - R * I, f = (S + T) / 2 + R * O;
+        const L = 1e9 * Math.sign((r - v) * I - (s - S) * O);
+        g = (v + _) / 2 - L * I, m = (S + E) / 2 + L * O;
       } else {
-        const R = 1 / B, W = E * E + A * A, C = O * O + I * I;
-        d = v + (I * W - A * C) * R, f = S + (E * C - O * W) * R;
+        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;
       }
-      a[P] = d, a[P + 1] = f;
+      a[P] = g, a[P + 1] = m;
     }
-    let l = e[e.length - 1], u, h = l * 4, g, c = t[2 * l], m, w = t[2 * l + 1];
+    let l = e[e.length - 1], u, h = l * 4, d, c = t[2 * l], f, w = t[2 * l + 1];
     i.fill(0);
     for (let x = 0; x < e.length; ++x)
-      l = e[x], u = h, g = c, m = w, h = l * 4, c = t[2 * l], w = t[2 * l + 1], i[u + 2] = i[h] = m - w, i[u + 3] = i[h + 1] = c - g;
+      l = e[x], u = h, d = c, f = w, h = l * 4, c = t[2 * l], w = t[2 * l + 1], i[u + 2] = i[h] = f - w, i[u + 3] = i[h + 1] = c - d;
   }
   render(t) {
     const e = t == null ? t = new de() : void 0, { delaunay: { halfedges: o, inedges: i, hull: r }, circumcenters: s, vectors: a } = this;
     if (r.length <= 1) return null;
-    for (let h = 0, g = o.length; h < g; ++h) {
+    for (let h = 0, d = o.length; h < d; ++h) {
       const c = o[h];
       if (c < h) continue;
-      const m = Math.floor(h / 3) * 2, w = Math.floor(c / 3) * 2, x = s[m], P = s[m + 1], M = s[w], d = s[w + 1];
-      this._renderSegment(x, P, M, d, t);
+      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);
     }
     let l, u = r[r.length - 1];
     for (let h = 0; h < r.length; ++h) {
       l = u, u = r[h];
-      const g = Math.floor(i[u] / 3) * 2, c = s[g], m = s[g + 1], w = l * 4, x = this._project(c, m, a[w + 2], a[w + 3]);
-      x && this._renderSegment(c, m, x[0], x[1], t);
+      const d = Math.floor(i[u] / 3) * 2, c = s[d], f = s[d + 1], w = l * 4, x = this._project(c, f, a[w + 2], a[w + 3]);
+      x && this._renderSegment(c, f, x[0], x[1], t);
     }
     return e && e.value();
   }
@@ -2682,7 +2682,7 @@ class Oo {
     }
   }
   cellPolygon(t) {
-    const e = new Ge();
+    const e = new je();
     return this.renderCell(t, e), e.value();
   }
   _renderSegment(t, e, o, i, r) {
@@ -2729,23 +2729,23 @@ class Oo {
   }
   _clipFinite(t, e) {
     const o = e.length;
-    let i = null, r, s, a = e[o - 2], l = e[o - 1], u, h = this._regioncode(a, l), g, c = 0;
-    for (let m = 0; m < o; m += 2)
-      if (r = a, s = l, a = e[m], l = e[m + 1], u = h, h = this._regioncode(a, l), u === 0 && h === 0)
-        g = c, c = 0, i ? i.push(a, l) : i = [a, l];
+    let i = null, r, s, a = e[o - 2], l = e[o - 1], u, h = this._regioncode(a, l), d, c = 0;
+    for (let f = 0; f < o; f += 2)
+      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, d;
+        let w, x, P, M, g;
         if (u === 0) {
           if ((w = this._clipSegment(r, s, a, l, u, h)) === null) continue;
-          [x, P, M, d] = w;
+          [x, P, M, g] = w;
         } else {
           if ((w = this._clipSegment(a, l, r, s, h, u)) === null) continue;
-          [M, d, x, P] = w, g = c, c = this._edgecode(x, P), g && c && this._edge(t, g, c, i, i.length), i ? i.push(x, P) : i = [x, P];
+          [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];
         }
-        g = c, c = this._edgecode(M, d), g && c && this._edge(t, g, c, i, i.length), i ? i.push(M, d) : i = [M, d];
+        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];
       }
     if (i)
-      g = c, c = this._edgecode(i[0], i[1]), g && c && this._edge(t, g, c, i, i.length);
+      d = c, c = this._edgecode(i[0], i[1]), d && c && this._edge(t, d, c, i, i.length);
     else if (this.contains(t, (this.xmin + this.xmax) / 2, (this.ymin + this.ymax) / 2))
       return [this.xmax, this.ymin, this.xmax, this.ymax, this.xmin, this.ymax, this.xmin, this.ymin];
     return i;
@@ -2762,8 +2762,8 @@ class Oo {
   _clipInfinite(t, e, o, i, r, s) {
     let a = Array.from(e), l;
     if ((l = this._project(a[0], a[1], o, i)) && a.unshift(l[0], l[1]), (l = this._project(a[a.length - 2], a[a.length - 1], r, s)) && a.push(l[0], l[1]), a = this._clipFinite(t, a))
-      for (let u = 0, h = a.length, g, c = this._edgecode(a[h - 2], a[h - 1]); u < h; u += 2)
-        g = c, c = this._edgecode(a[u], a[u + 1]), g && c && (u = this._edge(t, g, c, a, u), h = a.length);
+      for (let u = 0, h = a.length, d, c = this._edgecode(a[h - 2], a[h - 1]); u < h; u += 2)
+        d = c, c = this._edgecode(a[u], a[u + 1]), d && c && (u = this._edge(t, d, c, a, u), h = a.length);
     else this.contains(t, (this.xmin + this.xmax) / 2, (this.ymin + this.ymax) / 2) && (a = [this.xmin, this.ymin, this.xmax, this.ymin, this.xmax, this.ymax, this.xmin, this.ymax]);
     return a;
   }
@@ -2835,11 +2835,11 @@ class Oo {
     return t;
   }
 }
-const Wo = 2 * Math.PI, ge = Math.pow;
-function No(n) {
+const No = 2 * Math.PI, ge = Math.pow;
+function qo(n) {
   return n[0];
 }
-function qo(n) {
+function Wo(n) {
   return n[1];
 }
 function Xo(n) {
@@ -2850,12 +2850,12 @@ function Xo(n) {
   }
   return !0;
 }
-function Ho(n, t, e) {
+function $o(n, t, e) {
   return [n + Math.sin(n + t) * e, t + Math.cos(n - t) * e];
 }
-class Ue {
-  static from(t, e = No, o = qo, i) {
-    return new Ue("length" in t ? Yo(t, e, o, i) : Float64Array.from($o(t, e, o, i)));
+class ke {
+  static from(t, e = qo, o = Wo, i) {
+    return new ke("length" in t ? Ho(t, e, o, i) : Float64Array.from(Yo(t, e, o, i)));
   }
   constructor(t) {
     this._delaunator = new Be(t), this.inedges = new Int32Array(t.length / 2), this._hullIndex = new Int32Array(t.length / 2), this.points = this._delaunator.coords, this._init();
@@ -2866,10 +2866,10 @@ class Ue {
   _init() {
     const t = this._delaunator, e = this.points;
     if (t.hull && t.hull.length > 2 && Xo(t)) {
-      this.collinear = Int32Array.from({ length: e.length / 2 }, (c, m) => m).sort((c, m) => e[2 * c] - e[2 * m] || e[2 * c + 1] - e[2 * m + 1]);
-      const l = this.collinear[0], u = this.collinear[this.collinear.length - 1], h = [e[2 * l], e[2 * l + 1], e[2 * u], e[2 * u + 1]], g = 1e-8 * Math.hypot(h[3] - h[1], h[2] - h[0]);
-      for (let c = 0, m = e.length / 2; c < m; ++c) {
-        const w = Ho(e[2 * c], e[2 * c + 1], g);
+      this.collinear = Int32Array.from({ length: e.length / 2 }, (c, f) => f).sort((c, f) => e[2 * c] - e[2 * f] || e[2 * c + 1] - e[2 * f + 1]);
+      const l = this.collinear[0], u = this.collinear[this.collinear.length - 1], h = [e[2 * l], e[2 * l + 1], e[2 * u], e[2 * u + 1]], d = 1e-8 * Math.hypot(h[3] - h[1], h[2] - h[0]);
+      for (let c = 0, f = e.length / 2; c < f; ++c) {
+        const w = $o(e[2 * c], e[2 * c + 1], d);
         e[2 * c] = w[0], e[2 * c + 1] = w[1];
       }
       this._delaunator = new Be(e);
@@ -2890,8 +2890,8 @@ class Ue {
   *neighbors(t) {
     const { inedges: e, hull: o, _hullIndex: i, halfedges: r, triangles: s, collinear: a } = this;
     if (a) {
-      const g = a.indexOf(t);
-      g > 0 && (yield a[g - 1]), g < a.length - 1 && (yield a[g + 1]);
+      const d = a.indexOf(t);
+      d > 0 && (yield a[d - 1]), d < a.length - 1 && (yield a[d + 1]);
       return;
     }
     const l = e[t];
@@ -2900,8 +2900,8 @@ class Ue {
     do {
       if (yield h = s[u], u = u % 3 === 2 ? u - 2 : u + 1, s[u] !== t) return;
       if (u = r[u], u === -1) {
-        const g = o[(i[t] + 1) % o.length];
-        g !== h && (yield g);
+        const d = o[(i[t] + 1) % o.length];
+        d !== h && (yield d);
         return;
       }
     } while (u !== l);
@@ -2916,19 +2916,19 @@ class Ue {
   _step(t, e, o) {
     const { inedges: i, hull: r, _hullIndex: s, halfedges: a, triangles: l, points: u } = this;
     if (i[t] === -1 || !u.length) return (t + 1) % (u.length >> 1);
-    let h = t, g = ge(e - u[t * 2], 2) + ge(o - u[t * 2 + 1], 2);
+    let h = t, d = ge(e - u[t * 2], 2) + ge(o - u[t * 2 + 1], 2);
     const c = i[t];
-    let m = c;
+    let f = c;
     do {
-      let w = l[m];
+      let w = l[f];
       const x = ge(e - u[w * 2], 2) + ge(o - u[w * 2 + 1], 2);
-      if (x < g && (g = x, h = w), m = m % 3 === 2 ? m - 2 : m + 1, l[m] !== t) break;
-      if (m = a[m], m === -1) {
-        if (m = r[(s[t] + 1) % r.length], m !== w && ge(e - u[m * 2], 2) + ge(o - u[m * 2 + 1], 2) < g)
-          return m;
+      if (x < d && (d = x, h = w), f = f % 3 === 2 ? f - 2 : f + 1, l[f] !== t) break;
+      if (f = a[f], f === -1) {
+        if (f = r[(s[t] + 1) % r.length], f !== w && ge(e - u[f * 2], 2) + ge(o - u[f * 2 + 1], 2) < d)
+          return f;
         break;
       }
-    } while (m !== c);
+    } while (f !== c);
     return h;
   }
   render(t) {
@@ -2946,7 +2946,7 @@ class Ue {
     const o = t == null ? t = new de() : void 0, { points: i } = this;
     for (let r = 0, s = i.length; r < s; r += 2) {
       const a = i[r], l = i[r + 1];
-      t.moveTo(a + e, l), t.arc(a, l, e, 0, Wo);
+      t.moveTo(a + e, l), t.arc(a, l, e, 0, No);
     }
     return o && o.value();
   }
@@ -2960,7 +2960,7 @@ class Ue {
     return t.closePath(), e && e.value();
   }
   hullPolygon() {
-    const t = new Ge();
+    const t = new je();
     return this.renderHull(t), t.value();
   }
   renderTriangle(t, e) {
@@ -2973,11 +2973,11 @@ class Ue {
       yield this.trianglePolygon(e);
   }
   trianglePolygon(t) {
-    const e = new Ge();
+    const e = new je();
     return this.renderTriangle(t, e), e.value();
   }
 }
-function Yo(n, t, e, o) {
+function Ho(n, t, e, o) {
   const i = n.length, r = new Float64Array(i * 2);
   for (let s = 0; s < i; ++s) {
     const a = n[s];
@@ -2985,7 +2985,7 @@ function Yo(n, t, e, o) {
   }
   return r;
 }
-function* $o(n, t, e, o) {
+function* Yo(n, t, e, o) {
   let i = 0;
   for (const r of n)
     yield t.call(o, r, i, n), yield e.call(o, r, i, n), ++i;
@@ -3005,15 +3005,15 @@ function cn(n) {
     t.has(x) || (t.add(x), e.push(w));
   }
   if (e.length < 3) return [];
-  const o = new Ue(Float64Array.from(e.flat())), { triangles: i } = o;
+  const o = new ke(Float64Array.from(e.flat())), { triangles: i } = o;
   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], [d, f] = e[x], [p, b] = e[P], [z, v] = e[M], S = jo(d, f, p, b, z, v), V = Go(e, x, P, M);
+    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 T = s(D, _);
-        r.set(T, (r.get(T) || 0) + 1);
+        const E = s(D, _);
+        r.set(E, (r.get(E) || 0) + 1);
       }
   }
   const a = [];
@@ -3022,14 +3022,14 @@ function cn(n) {
   const l = /* @__PURE__ */ new Map();
   for (const [w, x] of a)
     (l.get(w) || l.set(w, []).get(w)).push(x), (l.get(x) || l.set(x, []).get(x)).push(w);
-  const u = a[0][0], h = [], g = /* @__PURE__ */ new Set();
-  let c = u, m = -1;
+  const u = a[0][0], h = [], d = /* @__PURE__ */ new Set();
+  let c = u, f = -1;
   do {
-    h.push(e[c]), g.add(c);
+    h.push(e[c]), d.add(c);
     const w = l.get(c) || [];
-    let x = w.find((P) => P !== m && !g.has(P));
-    if (x === void 0 && (x = w.find((P) => P !== m)), x === void 0) break;
-    m = c, c = x;
+    let x = w.find((P) => P !== f && !d.has(P));
+    if (x === void 0 && (x = w.find((P) => P !== f)), x === void 0) break;
+    f = c, c = x;
   } while (c !== u && h.length <= a.length + 1);
   return h;
 }
@@ -3047,7 +3047,7 @@ const mt = {
   // basis vectors
   e: []
   // half width
-}, It = [[], [], []], nt = [[], [], []], Dt = [], ce = new zt(), ue = new zt(), he = new zt(), Ot = new zt(), un = new zt(), hn = new zt(), Qt = new Tn(), fn = new oo(), _e = new En(), dn = new En(), mn = new ro();
+}, It = [[], [], []], nt = [[], [], []], Dt = [], ce = new zt(), ue = new zt(), he = new zt(), Ot = new zt(), un = new zt(), hn = new zt(), Qt = new En(), fn = new oo(), _e = new Tn(), dn = new Tn(), mn = new ro();
 let An = class {
   /**
    * Constructs a new OBB.
@@ -3056,7 +3056,7 @@ let An = class {
    * @param {Vector3} [halfSize] - Positive halfwidth extents of the OBB along each axis.
    * @param {Matrix3} [rotation] - The rotation of the OBB.
    */
-  constructor(t = new zt(), e = new zt(), o = new Tn()) {
+  constructor(t = new zt(), e = new zt(), o = new En()) {
     this.center = t, this.halfSize = e, this.rotation = o;
   }
   /**
@@ -3106,11 +3106,11 @@ let An = class {
   clampPoint(t, e) {
     const o = this.halfSize;
     Ot.subVectors(t, this.center), this.rotation.extractBasis(ce, ue, he), e.copy(this.center);
-    const i = Oe.clamp(Ot.dot(ce), -o.x, o.x);
+    const i = Ne.clamp(Ot.dot(ce), -o.x, o.x);
     e.add(ce.multiplyScalar(i));
-    const r = Oe.clamp(Ot.dot(ue), -o.y, o.y);
+    const r = Ne.clamp(Ot.dot(ue), -o.y, o.y);
     e.add(ue.multiplyScalar(r));
-    const s = Oe.clamp(Ot.dot(he), -o.z, o.z);
+    const s = Ne.clamp(Ot.dot(he), -o.z, o.z);
     return e.add(he.multiplyScalar(s)), e;
   }
   /**
@@ -3230,22 +3230,22 @@ let An = class {
   }
 };
 const Uo = new An();
-var Yt = 63710088e-1, Bn = {
-  centimeters: Yt * 100,
-  centimetres: Yt * 100,
+var Ht = 63710088e-1, Bn = {
+  centimeters: Ht * 100,
+  centimetres: Ht * 100,
   degrees: 360 / (2 * Math.PI),
-  feet: Yt * 3.28084,
-  inches: Yt * 39.37,
-  kilometers: Yt / 1e3,
-  kilometres: Yt / 1e3,
-  meters: Yt,
-  metres: Yt,
-  miles: Yt / 1609.344,
-  millimeters: Yt * 1e3,
-  millimetres: Yt * 1e3,
-  nauticalmiles: Yt / 1852,
+  feet: Ht * 3.28084,
+  inches: Ht * 39.37,
+  kilometers: Ht / 1e3,
+  kilometres: Ht / 1e3,
+  meters: Ht,
+  metres: Ht,
+  miles: Ht / 1609.344,
+  millimeters: Ht * 1e3,
+  millimetres: Ht * 1e3,
+  nauticalmiles: Ht / 1852,
   radians: 1,
-  yards: Yt * 1.0936
+  yards: Ht * 1.0936
 };
 function In(n, t, e = {}) {
   const o = { type: "Feature" };
@@ -3294,13 +3294,13 @@ function Ko(n, t = "kilometers") {
     throw new Error(t + " units is invalid");
   return n / e;
 }
-function Rn(n) {
+function Ln(n) {
   return n % (2 * Math.PI) * 180 / Math.PI;
 }
 function ie(n) {
   return n % 360 * Math.PI / 180;
 }
-function Ln(n, t = "kilometers", e = "kilometers") {
+function Rn(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, g = 0, c, m = n.type, w = m === "FeatureCollection", x = m === "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", P = w ? n.features.length : 1, M = 0; M < P; M++) {
       u = w ? (
         // @ts-expect-error: Known type conflict
         n.features[M].geometry
@@ -3321,9 +3321,9 @@ function Pe(n, t, e) {
         // @ts-expect-error: Known type conflict
         n.geometry
       ) : n, c = u ? u.type === "GeometryCollection" : !1, a = c ? u.geometries.length : 1;
-      for (var d = 0; d < a; d++) {
-        var f = 0, p = 0;
-        if (s = c ? u.geometries[d] : u, s !== null) {
+      for (var g = 0; g < a; g++) {
+        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) {
@@ -3334,14 +3334,14 @@ function Pe(n, t, e) {
                 // @ts-expect-error: Known type conflict
                 t(
                   l,
-                  g,
+                  d,
                   M,
-                  f,
+                  m,
                   p
                 ) === !1
               )
                 return !1;
-              g++, f++;
+              d++, m++;
               break;
             case "LineString":
             case "MultiPoint":
@@ -3350,16 +3350,16 @@ function Pe(n, t, e) {
                   // @ts-expect-error: Known type conflict
                   t(
                     l[o],
-                    g,
+                    d,
                     M,
-                    f,
+                    m,
                     p
                   ) === !1
                 )
                   return !1;
-                g++, b === "MultiPoint" && f++;
+                d++, b === "MultiPoint" && m++;
               }
-              b === "LineString" && f++;
+              b === "LineString" && m++;
               break;
             case "Polygon":
             case "MultiLineString":
@@ -3369,18 +3369,18 @@ function Pe(n, t, e) {
                     // @ts-expect-error: Known type conflict
                     t(
                       l[o][i],
-                      g,
+                      d,
                       M,
-                      f,
+                      m,
                       p
                     ) === !1
                   )
                     return !1;
-                  g++;
+                  d++;
                 }
-                b === "MultiLineString" && f++, b === "Polygon" && p++;
+                b === "MultiLineString" && m++, b === "Polygon" && p++;
               }
-              b === "Polygon" && f++;
+              b === "Polygon" && m++;
               break;
             case "MultiPolygon":
               for (o = 0; o < l.length; o++) {
@@ -3390,18 +3390,18 @@ function Pe(n, t, e) {
                       // @ts-expect-error: Known type conflict
                       t(
                         l[o][i][r],
-                        g,
+                        d,
                         M,
-                        f,
+                        m,
                         p
                       ) === !1
                     )
                       return !1;
-                    g++;
+                    d++;
                   }
                   p++;
                 }
-                f++;
+                m++;
               }
               break;
             case "GeometryCollection":
@@ -3426,27 +3426,27 @@ function Jo(n) {
   }), t;
 }
 function tr(n, t) {
-  var e, o, i, r, s, a, l, u, h, g, c = 0, m = n.type === "FeatureCollection", w = n.type === "Feature", x = m ? n.features.length : 1;
+  var e, o, i, r, s, a, l, u, h, d, c = 0, f = n.type === "FeatureCollection", w = n.type === "Feature", x = f ? n.features.length : 1;
   for (e = 0; e < x; e++) {
-    for (a = m ? (
+    for (a = f ? (
       // @ts-expect-error: Known type conflict
       n.features[e].geometry
     ) : w ? (
       // @ts-expect-error: Known type conflict
       n.geometry
-    ) : n, u = m ? (
+    ) : n, u = f ? (
       // @ts-expect-error: Known type conflict
       n.features[e].properties
     ) : w ? (
       // @ts-expect-error: Known type conflict
       n.properties
-    ) : {}, h = m ? (
+    ) : {}, h = f ? (
       // @ts-expect-error: Known type conflict
       n.features[e].bbox
     ) : w ? (
       // @ts-expect-error: Known type conflict
       n.bbox
-    ) : void 0, g = m ? (
+    ) : void 0, d = f ? (
       // @ts-expect-error: Known type conflict
       n.features[e].id
     ) : w ? (
@@ -3462,7 +3462,7 @@ function tr(n, t) {
             c,
             u,
             h,
-            g
+            d
           ) === !1
         )
           return !1;
@@ -3482,7 +3482,7 @@ function tr(n, t) {
               c,
               u,
               h,
-              g
+              d
             ) === !1
           )
             return !1;
@@ -3497,7 +3497,7 @@ function tr(n, t) {
                 c,
                 u,
                 h,
-                g
+                d
               ) === !1
             )
               return !1;
@@ -3555,112 +3555,112 @@ var Ze = { exports: {} }, On = { exports: {} };
   (function(e, o) {
     n.exports = o();
   })(Fn, function() {
-    function e(d, f, p, b, z) {
-      (function v(S, V, D, _, T) {
+    function e(g, m, p, b, z) {
+      (function v(S, V, D, _, E) {
         for (; _ > D; ) {
           if (_ - D > 600) {
-            var E = _ - D + 1, A = V - D + 1, O = Math.log(E), I = 0.5 * Math.exp(2 * O / 3), B = 0.5 * Math.sqrt(O * I * (E - I) / E) * (A - E / 2 < 0 ? -1 : 1), R = Math.max(D, Math.floor(V - A * I / E + B)), W = Math.min(_, Math.floor(V + (E - A) * I / E + B));
-            v(S, V, R, W, T);
+            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 C = S[V], L = D, H = _;
-          for (o(S, D, V), T(S[_], C) > 0 && o(S, D, _); L < H; ) {
-            for (o(S, L, H), L++, H--; T(S[L], C) < 0; ) L++;
-            for (; T(S[H], C) > 0; ) H--;
+          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; ) $--;
           }
-          T(S[D], C) === 0 ? o(S, D, H) : o(S, ++H, _), H <= V && (D = H + 1), V <= H && (_ = H - 1);
+          E(S[D], C) === 0 ? o(S, D, $) : o(S, ++$, _), $ <= V && (D = $ + 1), V <= $ && (_ = $ - 1);
         }
-      })(d, f, p || 0, b || d.length - 1, z || i);
+      })(g, m, p || 0, b || g.length - 1, z || i);
     }
-    function o(d, f, p) {
-      var b = d[f];
-      d[f] = d[p], d[p] = b;
+    function o(g, m, p) {
+      var b = g[m];
+      g[m] = g[p], g[p] = b;
     }
-    function i(d, f) {
-      return d < f ? -1 : d > f ? 1 : 0;
+    function i(g, m) {
+      return g < m ? -1 : g > m ? 1 : 0;
     }
-    var r = function(d) {
-      d === void 0 && (d = 9), this._maxEntries = Math.max(4, d), this._minEntries = Math.max(2, Math.ceil(0.4 * this._maxEntries)), this.clear();
+    var r = function(g) {
+      g === void 0 && (g = 9), this._maxEntries = Math.max(4, g), this._minEntries = Math.max(2, Math.ceil(0.4 * this._maxEntries)), this.clear();
     };
-    function s(d, f, p) {
-      if (!p) return f.indexOf(d);
-      for (var b = 0; b < f.length; b++) if (p(d, f[b])) return b;
+    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;
       return -1;
     }
-    function a(d, f) {
-      l(d, 0, d.children.length, f, d);
+    function a(g, m) {
+      l(g, 0, g.children.length, m, g);
     }
-    function l(d, f, p, b, z) {
+    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 = f; v < p; v++) {
-        var S = d.children[v];
-        u(z, d.leaf ? b(S) : S);
+      for (var v = m; v < p; v++) {
+        var S = g.children[v];
+        u(z, g.leaf ? b(S) : S);
       }
       return z;
     }
-    function u(d, f) {
-      return d.minX = Math.min(d.minX, f.minX), d.minY = Math.min(d.minY, f.minY), d.maxX = Math.max(d.maxX, f.maxX), d.maxY = Math.max(d.maxY, f.maxY), d;
+    function u(g, m) {
+      return g.minX = Math.min(g.minX, m.minX), g.minY = Math.min(g.minY, m.minY), g.maxX = Math.max(g.maxX, m.maxX), g.maxY = Math.max(g.maxY, m.maxY), g;
     }
-    function h(d, f) {
-      return d.minX - f.minX;
+    function h(g, m) {
+      return g.minX - m.minX;
     }
-    function g(d, f) {
-      return d.minY - f.minY;
+    function d(g, m) {
+      return g.minY - m.minY;
     }
-    function c(d) {
-      return (d.maxX - d.minX) * (d.maxY - d.minY);
+    function c(g) {
+      return (g.maxX - g.minX) * (g.maxY - g.minY);
     }
-    function m(d) {
-      return d.maxX - d.minX + (d.maxY - d.minY);
+    function f(g) {
+      return g.maxX - g.minX + (g.maxY - g.minY);
     }
-    function w(d, f) {
-      return d.minX <= f.minX && d.minY <= f.minY && f.maxX <= d.maxX && f.maxY <= d.maxY;
+    function w(g, m) {
+      return g.minX <= m.minX && g.minY <= m.minY && m.maxX <= g.maxX && m.maxY <= g.maxY;
     }
-    function x(d, f) {
-      return f.minX <= d.maxX && f.minY <= d.maxY && f.maxX >= d.minX && f.maxY >= d.minY;
+    function x(g, m) {
+      return m.minX <= g.maxX && m.minY <= g.maxY && m.maxX >= g.minX && m.maxY >= g.minY;
     }
-    function P(d) {
-      return { children: d, height: 1, leaf: !0, minX: 1 / 0, minY: 1 / 0, maxX: -1 / 0, maxY: -1 / 0 };
+    function P(g) {
+      return { children: g, height: 1, leaf: !0, minX: 1 / 0, minY: 1 / 0, maxX: -1 / 0, maxY: -1 / 0 };
     }
-    function M(d, f, p, b, z) {
-      for (var v = [f, p]; v.length; ) if (!((p = v.pop()) - (f = v.pop()) <= b)) {
-        var S = f + Math.ceil((p - f) / b / 2) * b;
-        e(d, S, f, p, z), v.push(f, S, S, p);
+    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);
       }
     }
     return r.prototype.all = function() {
       return this._all(this.data, []);
-    }, r.prototype.search = function(d) {
-      var f = this.data, p = [];
-      if (!x(d, f)) return p;
-      for (var b = this.toBBox, z = []; f; ) {
-        for (var v = 0; v < f.children.length; v++) {
-          var S = f.children[v], V = f.leaf ? b(S) : S;
-          x(d, V) && (f.leaf ? p.push(S) : w(d, V) ? this._all(S, p) : z.push(S));
+    }, 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));
         }
-        f = z.pop();
+        m = z.pop();
       }
       return p;
-    }, r.prototype.collides = function(d) {
-      var f = this.data;
-      if (!x(d, f)) return !1;
-      for (var p = []; f; ) {
-        for (var b = 0; b < f.children.length; b++) {
-          var z = f.children[b], v = f.leaf ? this.toBBox(z) : z;
-          if (x(d, v)) {
-            if (f.leaf || w(d, v)) return !0;
+    }, r.prototype.collides = function(g) {
+      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;
             p.push(z);
           }
         }
-        f = p.pop();
+        m = p.pop();
       }
       return !1;
-    }, r.prototype.load = function(d) {
-      if (!d || !d.length) return this;
-      if (d.length < this._minEntries) {
-        for (var f = 0; f < d.length; f++) this.insert(d[f]);
+    }, r.prototype.load = function(g) {
+      if (!g || !g.length) return this;
+      if (g.length < this._minEntries) {
+        for (var m = 0; m < g.length; m++) this.insert(g[m]);
         return this;
       }
-      var p = this._build(d.slice(), 0, d.length - 1, 0);
+      var p = this._build(g.slice(), 0, g.length - 1, 0);
       if (this.data.children.length) if (this.data.height === p.height) this._splitRoot(this.data, p);
       else {
         if (this.data.height < p.height) {
@@ -3671,93 +3671,93 @@ var Ze = { exports: {} }, On = { exports: {} };
       }
       else this.data = p;
       return this;
-    }, r.prototype.insert = function(d) {
-      return d && this._insert(d, this.data.height - 1), this;
+    }, r.prototype.insert = function(g) {
+      return g && this._insert(g, this.data.height - 1), this;
     }, r.prototype.clear = function() {
       return this.data = P([]), this;
-    }, r.prototype.remove = function(d, f) {
-      if (!d) return this;
-      for (var p, b, z, v = this.data, S = this.toBBox(d), V = [], D = []; v || V.length; ) {
+    }, 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(d, v.children, f);
+          var _ = s(g, v.children, m);
           if (_ !== -1) return v.children.splice(_, 1), V.push(v), 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]);
       }
       return this;
-    }, r.prototype.toBBox = function(d) {
-      return d;
-    }, r.prototype.compareMinX = function(d, f) {
-      return d.minX - f.minX;
-    }, r.prototype.compareMinY = function(d, f) {
-      return d.minY - f.minY;
+    }, r.prototype.toBBox = function(g) {
+      return g;
+    }, r.prototype.compareMinX = function(g, m) {
+      return g.minX - m.minX;
+    }, r.prototype.compareMinY = function(g, m) {
+      return g.minY - m.minY;
     }, r.prototype.toJSON = function() {
       return this.data;
-    }, r.prototype.fromJSON = function(d) {
-      return this.data = d, this;
-    }, r.prototype._all = function(d, f) {
-      for (var p = []; d; ) d.leaf ? f.push.apply(f, d.children) : p.push.apply(p, d.children), d = p.pop();
-      return f;
-    }, r.prototype._build = function(d, f, p, b) {
-      var z, v = p - f + 1, S = this._maxEntries;
-      if (v <= S) return a(z = P(d.slice(f, p + 1)), this.toBBox), z;
+    }, r.prototype.fromJSON = function(g) {
+      return this.data = g, this;
+    }, 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));
-      M(d, f, p, D, this.compareMinX);
-      for (var _ = f; _ <= p; _ += D) {
-        var T = Math.min(_ + D - 1, p);
-        M(d, _, T, V, this.compareMinY);
-        for (var E = _; E <= T; E += V) {
-          var A = Math.min(E + V - 1, T);
-          z.children.push(this._build(d, E, A, b - 1));
+      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));
         }
       }
       return a(z, this.toBBox), z;
-    }, r.prototype._chooseSubtree = function(d, f, p, b) {
-      for (; b.push(f), !f.leaf && b.length - 1 !== p; ) {
-        for (var z = 1 / 0, v = 1 / 0, S = void 0, V = 0; V < f.children.length; V++) {
-          var D = f.children[V], _ = c(D), T = (E = d, A = D, (Math.max(A.maxX, E.maxX) - Math.min(A.minX, E.minX)) * (Math.max(A.maxY, E.maxY) - Math.min(A.minY, E.minY)) - _);
-          T < v ? (v = T, z = _ < z ? _ : z, S = D) : T === v && _ < z && (z = _, S = D);
+    }, 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++) {
+          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);
         }
-        f = S || f.children[0];
+        m = S || m.children[0];
       }
-      var E, A;
-      return f;
-    }, r.prototype._insert = function(d, f, p) {
-      var b = p ? d : this.toBBox(d), z = [], v = this._chooseSubtree(b, this.data, f, z);
-      for (v.children.push(d), u(v, b); f >= 0 && z[f].children.length > this._maxEntries; ) this._split(z, f), f--;
-      this._adjustParentBBoxes(b, z, f);
-    }, r.prototype._split = function(d, f) {
-      var p = d[f], b = p.children.length, z = this._minEntries;
+      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);
+    }, 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), f ? d[f - 1].children.push(S) : this._splitRoot(p, S);
-    }, r.prototype._splitRoot = function(d, f) {
-      this.data = P([d, f]), this.data.height = d.height + 1, this.data.leaf = !1, a(this.data, this.toBBox);
-    }, r.prototype._chooseSplitIndex = function(d, f, p) {
-      for (var b, z, v, S, V, D, _, T = 1 / 0, E = 1 / 0, A = f; A <= p - f; A++) {
-        var O = l(d, 0, A, this.toBBox), I = l(d, 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)), R = c(O) + c(I);
-        B < T ? (T = B, b = A, E = R < E ? R : E) : B === T && R < E && (E = R, b = A);
+      S.height = p.height, S.leaf = p.leaf, a(p, this.toBBox), a(S, this.toBBox), m ? g[m - 1].children.push(S) : this._splitRoot(p, S);
+    }, r.prototype._splitRoot = function(g, m) {
+      this.data = P([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);
       }
-      return b || p - f;
-    }, r.prototype._chooseSplitAxis = function(d, f, p) {
-      var b = d.leaf ? this.compareMinX : h, z = d.leaf ? this.compareMinY : g;
-      this._allDistMargin(d, f, p, b) < this._allDistMargin(d, f, p, z) && d.children.sort(b);
-    }, r.prototype._allDistMargin = function(d, f, p, b) {
-      d.children.sort(b);
-      for (var z = this.toBBox, v = l(d, 0, f, z), S = l(d, p - f, p, z), V = m(v) + m(S), D = f; D < p - f; D++) {
-        var _ = d.children[D];
-        u(v, d.leaf ? z(_) : _), V += m(v);
+      return b || 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 _ = g.children[D];
+        u(v, g.leaf ? z(_) : _), V += f(v);
       }
-      for (var T = p - f - 1; T >= f; T--) {
-        var E = d.children[T];
-        u(S, d.leaf ? z(E) : E), V += m(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);
       }
       return V;
-    }, r.prototype._adjustParentBBoxes = function(d, f, p) {
-      for (var b = p; b >= 0; b--) u(f[b], d);
-    }, r.prototype._condense = function(d) {
-      for (var f = d.length - 1, p = void 0; f >= 0; f--) d[f].children.length === 0 ? f > 0 ? (p = d[f - 1].children).splice(p.indexOf(d[f]), 1) : this.clear() : a(d[f], this.toBBox);
+    }, r.prototype._adjustParentBBoxes = function(g, m, p) {
+      for (var b = p; b >= 0; b--) u(m[b], 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;
   });
 })(On);
@@ -3805,11 +3805,11 @@ const ar = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   default: ir
 }, Symbol.toStringTag, { value: "Module" })), lr = /* @__PURE__ */ or(ar);
-var ke = { exports: {} }, cr = function(t, e, o, i) {
+var Ce = { exports: {} }, cr = function(t, e, o, i) {
   var r = t[0], s = t[1], a = !1;
   o === void 0 && (o = 0), i === void 0 && (i = e.length);
   for (var l = (i - o) / 2, u = 0, h = l - 1; u < l; h = u++) {
-    var g = e[o + u * 2 + 0], c = e[o + u * 2 + 1], m = e[o + h * 2 + 0], w = e[o + h * 2 + 1], x = c > s != w > s && r < (m - g) * (s - c) / (w - c) + g;
+    var d = e[o + u * 2 + 0], c = e[o + u * 2 + 1], f = e[o + h * 2 + 0], w = e[o + h * 2 + 1], x = c > s != w > s && r < (f - d) * (s - c) / (w - c) + d;
     x && (a = !a);
   }
   return a;
@@ -3817,92 +3817,92 @@ var ke = { exports: {} }, cr = function(t, e, o, i) {
   var r = t[0], s = t[1], a = !1;
   o === void 0 && (o = 0), i === void 0 && (i = e.length);
   for (var l = i - o, u = 0, h = l - 1; u < l; h = u++) {
-    var g = e[u + o][0], c = e[u + o][1], m = e[h + o][0], w = e[h + o][1], x = c > s != w > s && r < (m - g) * (s - c) / (w - c) + g;
+    var d = e[u + o][0], c = e[u + o][1], f = e[h + o][0], w = e[h + o][1], x = c > s != w > s && r < (f - d) * (s - c) / (w - c) + d;
     x && (a = !a);
   }
   return a;
-}, Wn = cr, Nn = ur;
-ke.exports = function(t, e, o, i) {
-  return e.length > 0 && Array.isArray(e[0]) ? Nn(t, e, o, i) : Wn(t, e, o, i);
+}, Nn = cr, qn = ur;
+Ce.exports = function(t, e, o, i) {
+  return e.length > 0 && Array.isArray(e[0]) ? qn(t, e, o, i) : Nn(t, e, o, i);
 };
-ke.exports.nested = Nn;
-ke.exports.flat = Wn;
-var hr = ke.exports, je = { exports: {} };
+Ce.exports.nested = qn;
+Ce.exports.flat = Nn;
+var hr = Ce.exports, Ue = { exports: {} };
 (function(n, t) {
   (function(e, o) {
     o(t);
   })(Fn, function(e) {
     const i = 33306690738754706e-32;
-    function r(x, P, M, d, f) {
-      let p, b, z, v, S = P[0], V = d[0], D = 0, _ = 0;
-      V > S == V > -S ? (p = S, S = P[++D]) : (p = V, V = d[++_]);
-      let T = 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 = d[++_]), p = b, z !== 0 && (f[T++] = 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 = d[++_]), p = b, z !== 0 && (f[T++] = z);
-      for (; D < x; ) z = p - ((b = p + S) - (v = b - p)) + (S - v), S = P[++D], p = b, z !== 0 && (f[T++] = z);
-      for (; _ < M; ) z = p - ((b = p + V) - (v = b - p)) + (V - v), V = d[++_], p = b, z !== 0 && (f[T++] = z);
-      return p === 0 && T !== 0 || (f[T++] = p), T;
+    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[++_]);
+      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);
+      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), g = s(8), c = s(12), m = s(16), w = s(4);
-    e.orient2d = function(x, P, M, d, f, p) {
-      const b = (P - p) * (M - f), z = (x - f) * (d - p), v = b - z;
+    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, _, T, E, A, O) {
-        let I, B, R, W, C, L, H, X, ot, K, G, ut, rt, F, Y, Mt, Zt, Nt;
-        const Lt = V - E, _t = _ - E, Tt = D - A, Ft = T - A;
-        C = (Y = (X = Lt - (H = (L = 134217729 * Lt) - (L - Lt))) * (K = Ft - (ot = (L = 134217729 * Ft) - (L - Ft))) - ((F = Lt * Ft) - H * ot - X * ot - H * K)) - (G = Y - (Zt = (X = Tt - (H = (L = 134217729 * Tt) - (L - Tt))) * (K = _t - (ot = (L = 134217729 * _t) - (L - _t))) - ((Mt = Tt * _t) - H * ot - X * ot - H * K))), h[0] = Y - (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 = (Nt = ut + G) - ut, h[2] = ut - (Nt - C) + (G - C), h[3] = Nt;
-        let tt = function(Et, qt) {
-          let J = qt[0];
-          for (let ct = 1; ct < Et; ct++) J += qt[ct];
+      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;
+        let tt = function(Tt, Wt) {
+          let J = Wt[0];
+          for (let ct = 1; ct < Tt; ct++) J += Wt[ct];
           return J;
         }(4, h), lt = l * O;
-        if (tt >= lt || -tt >= lt || (I = V - (Lt + (C = V - Lt)) + (C - E), R = _ - (_t + (C = _ - _t)) + (C - E), B = D - (Tt + (C = D - Tt)) + (C - A), W = T - (Ft + (C = T - Ft)) + (C - A), I === 0 && B === 0 && R === 0 && W === 0) || (lt = u * O + i * Math.abs(tt), (tt += Lt * W + Ft * I - (Tt * R + _t * B)) >= lt || -tt >= lt)) return tt;
-        C = (Y = (X = I - (H = (L = 134217729 * I) - (L - I))) * (K = Ft - (ot = (L = 134217729 * Ft) - (L - Ft))) - ((F = I * Ft) - H * ot - X * ot - H * K)) - (G = Y - (Zt = (X = B - (H = (L = 134217729 * B) - (L - B))) * (K = _t - (ot = (L = 134217729 * _t) - (L - _t))) - ((Mt = B * _t) - H * ot - X * ot - H * K))), w[0] = Y - (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 = (Nt = ut + G) - ut, w[2] = ut - (Nt - C) + (G - C), w[3] = Nt;
-        const q = r(4, h, 4, w, g);
-        C = (Y = (X = Lt - (H = (L = 134217729 * Lt) - (L - Lt))) * (K = W - (ot = (L = 134217729 * W) - (L - W))) - ((F = Lt * W) - H * ot - X * ot - H * K)) - (G = Y - (Zt = (X = Tt - (H = (L = 134217729 * Tt) - (L - Tt))) * (K = R - (ot = (L = 134217729 * R) - (L - R))) - ((Mt = Tt * R) - H * ot - X * ot - H * K))), w[0] = Y - (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 = (Nt = ut + G) - ut, w[2] = ut - (Nt - C) + (G - C), w[3] = Nt;
-        const j = r(q, g, 4, w, c);
-        C = (Y = (X = I - (H = (L = 134217729 * I) - (L - I))) * (K = W - (ot = (L = 134217729 * W) - (L - W))) - ((F = I * W) - H * ot - X * ot - H * K)) - (G = Y - (Zt = (X = B - (H = (L = 134217729 * B) - (L - B))) * (K = R - (ot = (L = 134217729 * R) - (L - R))) - ((Mt = B * R) - H * ot - X * ot - H * K))), w[0] = Y - (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 = (Nt = ut + G) - ut, w[2] = ut - (Nt - C) + (G - C), w[3] = Nt;
-        const Wt = r(j, c, 4, w, m);
-        return m[Wt - 1];
-      }(x, P, M, d, f, p, S);
-    }, e.orient2dfast = function(x, P, M, d, f, p) {
-      return (P - p) * (M - f) - (x - f) * (d - p);
+        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;
+        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;
+        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;
+        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);
     }, Object.defineProperty(e, "__esModule", { value: !0 });
   });
-})(je, je.exports);
-var fr = je.exports, pn = rr, Ae = lr, dr = hr, mr = fr.orient2d;
+})(Ue, Ue.exports);
+var fr = Ue.exports, pn = rr, Ae = lr, dr = hr, mr = fr.orient2d;
 Ae.default && (Ae = Ae.default);
-Ze.exports = qn;
-Ze.exports.default = qn;
-function qn(n, t, e) {
+Ze.exports = Wn;
+Ze.exports.default = Wn;
+function Wn(n, t, e) {
   t = Math.max(0, t === void 0 ? 2 : t), e = e || 0;
   var o = wr(n), i = new pn(16);
-  i.toBBox = function(d) {
+  i.toBBox = function(g) {
     return {
-      minX: d[0],
-      minY: d[1],
-      maxX: d[0],
-      maxY: d[1]
+      minX: g[0],
+      minY: g[1],
+      maxX: g[0],
+      maxY: g[1]
     };
-  }, i.compareMinX = function(d, f) {
-    return d[0] - f[0];
-  }, i.compareMinY = function(d, f) {
-    return d[1] - f[1];
+  }, i.compareMinX = function(g, m) {
+    return g[0] - m[0];
+  }, i.compareMinY = function(g, m) {
+    return g[1] - m[1];
   }, i.load(n);
   for (var r = [], s = 0, a; s < o.length; s++) {
     var l = o[s];
     i.remove(l), a = wn(l, a), r.push(a);
   }
   var u = new pn(16);
-  for (s = 0; s < r.length; s++) u.insert(qe(r[s]));
-  for (var h = t * t, g = e * e; r.length; ) {
-    var c = r.shift(), m = c.p, w = c.next.p, x = Xe(m, w);
-    if (!(x < g)) {
+  for (s = 0; s < r.length; s++) u.insert(Xe(r[s]));
+  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, m, w, c.next.next.p, P, u), l && Math.min(Xe(l, m), Xe(l, w)) <= P && (r.push(c), r.push(wn(l, c)), i.remove(l), u.remove(c), u.insert(qe(c)), u.insert(qe(c.next)));
+      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)));
     }
   }
   c = a;
@@ -3915,15 +3915,15 @@ function qn(n, t, e) {
 function gr(n, t, e, o, i, r, s) {
   for (var a = new Ae([], pr), l = n.data; l; ) {
     for (var u = 0; u < l.children.length; u++) {
-      var h = l.children[u], g = l.leaf ? He(h, e, o) : yr(e, o, h);
-      g > r || a.push({
+      var h = l.children[u], d = l.leaf ? He(h, e, o) : yr(e, o, h);
+      d > r || a.push({
         node: h,
-        dist: g
+        dist: d
       });
     }
     for (; a.length && !a.peek().node.children; ) {
-      var c = a.pop(), m = c.node, w = He(m, t, e), x = He(m, o, i);
-      if (c.dist < w && c.dist < x && xn(e, m, s) && xn(o, m, s)) return m;
+      var c = a.pop(), f = c.node, w = He(f, t, e), x = He(f, o, i);
+      if (c.dist < w && c.dist < x && xn(e, f, s) && xn(o, f, s)) return f;
     }
     l = a.pop(), l && (l = l.node);
   }
@@ -3934,13 +3934,13 @@ function pr(n, t) {
 }
 function yr(n, t, e) {
   if (yn(n, e) || yn(t, e)) return 0;
-  var o = Te(n[0], n[1], t[0], t[1], e.minX, e.minY, e.maxX, e.minY);
+  var o = Ee(n[0], n[1], t[0], t[1], e.minX, e.minY, e.maxX, e.minY);
   if (o === 0) return 0;
-  var i = Te(n[0], n[1], t[0], t[1], e.minX, e.minY, e.minX, e.maxY);
+  var i = Ee(n[0], n[1], t[0], t[1], e.minX, e.minY, e.minX, e.maxY);
   if (i === 0) return 0;
-  var r = Te(n[0], n[1], t[0], t[1], e.maxX, e.minY, e.maxX, e.maxY);
+  var r = Ee(n[0], n[1], t[0], t[1], e.maxX, e.minY, e.maxX, e.maxY);
   if (r === 0) return 0;
-  var s = Te(n[0], n[1], t[0], t[1], e.minX, e.maxY, e.maxX, e.maxY);
+  var s = Ee(n[0], n[1], t[0], t[1], e.minX, e.maxY, e.maxX, e.maxY);
   return s === 0 ? 0 : Math.min(o, i, r, s);
 }
 function yn(n, t) {
@@ -3957,7 +3957,7 @@ function xe(n, t, e) {
 function xr(n, t, e, o) {
   return n !== o && t !== e && xe(n, t, e) > 0 != xe(n, t, o) > 0 && xe(e, o, n) > 0 != xe(e, o, t) > 0;
 }
-function qe(n) {
+function Xe(n) {
   var t = n.p, e = n.next.p;
   return n.minX = Math.min(t[0], e[0]), n.minY = Math.min(t[1], e[1]), n.maxX = Math.max(t[0], e[0]), n.maxY = Math.max(t[1], e[1]), n;
 }
@@ -3983,7 +3983,7 @@ function wn(n, t) {
   };
   return t ? (e.next = t.next, e.prev = t, t.next.prev = e, t.next = e) : (e.prev = e, e.next = e), e;
 }
-function Xe(n, t) {
+function $e(n, t) {
   var e = n[0] - t[0], o = n[1] - t[1];
   return e * e + o * o;
 }
@@ -3995,10 +3995,10 @@ function He(n, t, e) {
   }
   return r = n[0] - o, s = n[1] - i, r * r + s * s;
 }
-function Te(n, t, e, o, i, r, s, a) {
-  var l = e - n, u = o - t, h = s - i, g = a - r, c = n - i, m = t - r, w = l * l + u * u, x = l * h + u * g, P = h * h + g * g, M = l * c + u * m, d = h * c + g * m, f = w * P - x * x, p, b, z, v, S = f, V = f;
-  f === 0 ? (b = 0, S = 1, v = d, V = P) : (b = x * d - P * M, v = w * d - x * M, b < 0 ? (b = 0, v = d, V = P) : b > S && (b = S, v = d + 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 D = (1 - p) * n + p * e, _ = (1 - p) * t + p * o, T = (1 - z) * i + z * s, E = (1 - z) * r + z * a, A = T - D, O = E - _;
+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 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;
 }
 function br(n, t) {
@@ -4076,16 +4076,16 @@ 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 (Rn(s) + 360) % 360;
+  return (Ln(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 Ln(r, "meters", e.units);
+  return Rn(r, "meters", e.units);
 }
 function _r(n, t, e) {
-  e = e === void 0 ? Yt : Number(e);
+  e = e === void 0 ? Ht : Number(e);
   const o = e, i = n[1] * Math.PI / 180, r = t[1] * Math.PI / 180, s = r - i;
   let a = Math.abs(t[0] - n[0]) * Math.PI / 180;
   a > Math.PI && (a -= 2 * Math.PI);
@@ -4096,29 +4096,29 @@ function _r(n, t, e) {
     s * s + u * u * a * a
   ) * o;
 }
-function Tr(n, t, e, o = {}) {
+function Er(n, t, e, o = {}) {
   const i = t < 0;
-  let r = Ln(
+  let r = Rn(
     Math.abs(t),
     o.units,
     "meters"
   );
   i && (r = -Math.abs(r));
-  const s = se(n), a = Er(
+  const s = se(n), a = Tr(
     s,
     r,
     e
   );
   return a[0] += a[0] - s[0] > 180 ? -360 : s[0] - a[0] > 180 ? 360 : 0, kn(a, o.properties);
 }
-function Er(n, t, e, o) {
-  o = o === void 0 ? Yt : Number(o);
+function Tr(n, t, e, o) {
+  o = o === void 0 ? Ht : Number(o);
   const i = t / o, r = n[0] * Math.PI / 180, s = ie(n[1]), a = ie(e), l = i * Math.cos(a);
   let u = s + l;
   Math.abs(u) > Math.PI / 2 && (u = u > 0 ? Math.PI - u : -Math.PI - u);
   const h = Math.log(
     Math.tan(u / 2 + Math.PI / 4) / Math.tan(s / 2 + Math.PI / 4)
-  ), g = Math.abs(h) > 1e-11 ? l / h : Math.cos(s), c = i * Math.sin(a) / g;
+  ), d = Math.abs(h) > 1e-11 ? l / h : Math.cos(s), c = i * Math.sin(a) / d;
   return [
     ((r + c) * 180 / Math.PI + 540) % 360 - 180,
     u * 180 / Math.PI
@@ -4129,7 +4129,7 @@ function Ar(n) {
     throw new Error("geojson is required");
   switch (n.type) {
     case "Feature":
-      return Hn(n);
+      return $n(n);
     case "FeatureCollection":
       return Br(n);
     case "Point":
@@ -4144,7 +4144,7 @@ function Ar(n) {
       throw new Error("unknown GeoJSON type");
   }
 }
-function Hn(n) {
+function $n(n) {
   const t = { type: "Feature" };
   return Object.keys(n).forEach((e) => {
     switch (e) {
@@ -4155,13 +4155,13 @@ function Hn(n) {
       default:
         t[e] = n[e];
     }
-  }), t.properties = Yn(n.properties), n.geometry == null ? t.geometry = null : t.geometry = Ke(n.geometry), t;
+  }), t.properties = Hn(n.properties), n.geometry == null ? t.geometry = null : t.geometry = Ke(n.geometry), t;
 }
-function Yn(n) {
+function Hn(n) {
   const t = {};
   return n && Object.keys(n).forEach((e) => {
     const o = n[e];
-    typeof o == "object" ? o === null ? t[e] = null : Array.isArray(o) ? t[e] = o.map((i) => i) : t[e] = Yn(o) : t[e] = o;
+    typeof o == "object" ? o === null ? t[e] = null : Array.isArray(o) ? t[e] = o.map((i) => i) : t[e] = Hn(o) : t[e] = o;
   }), t;
 }
 function Br(n) {
@@ -4174,15 +4174,15 @@ function Br(n) {
       default:
         t[e] = n[e];
     }
-  }), t.features = n.features.map((e) => Hn(e)), t;
+  }), t.features = n.features.map((e) => $n(e)), t;
 }
 function Ke(n) {
   const t = { type: n.type };
-  return n.bbox && (t.bbox = n.bbox), n.type === "GeometryCollection" ? (t.geometries = n.geometries.map((e) => Ke(e)), t) : (t.coordinates = $n(n.coordinates), t);
+  return n.bbox && (t.bbox = n.bbox), n.type === "GeometryCollection" ? (t.geometries = n.geometries.map((e) => Ke(e)), t) : (t.coordinates = Yn(n.coordinates), t);
 }
-function $n(n) {
+function Yn(n) {
   const t = n;
-  return typeof t[0] != "object" ? t.slice() : t.map((e) => $n(e));
+  return typeof t[0] != "object" ? t.slice() : t.map((e) => Yn(e));
 }
 function Pn(n, t, e) {
   if (e = e || {}, !Qo(e)) throw new Error("options is invalid");
@@ -4194,7 +4194,7 @@ function Pn(n, t, e) {
   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(
-      Tr(r, u, l)
+      Er(r, u, l)
     );
     s[0] = h[0], s[1] = h[1];
   }), n;
@@ -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 Rn(Math.atan2(u, h));
+  return Ln(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 Rr(n) {
+function Lr(n) {
   return Cr(kr(n));
 }
-function Lr(n) {
+function Rr(n) {
   return er(
     n,
     (t, e) => t + Fr(e),
@@ -4266,7 +4266,7 @@ function Mn(n) {
   }
   return t;
 }
-var Or = Yt * Yt / 2, Ye = Math.PI / 180;
+var Or = Ht * Ht / 2, Ye = Math.PI / 180;
 function zn(n) {
   const t = n.length - 1;
   if (t <= 2) return 0;
@@ -4277,7 +4277,7 @@ function zn(n) {
   }
   return e * Or;
 }
-function Wr(n) {
+function Nr(n) {
   const t = Vr(n);
   if (!t)
     throw new Error("Can't calculate smallestSurroundingRectangleByArea for given geometry");
@@ -4286,7 +4286,7 @@ function Wr(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 = Rr(l), h = Lr(u);
+    }), u = Lr(l), h = Rr(u);
     h < i && (i = h, r = Pn(u, a, {
       pivot: e
     }));
@@ -4297,7 +4297,7 @@ function Vn(n, t) {
   const e = t[0] - n[0], o = t[1] - n[1];
   return Math.sqrt(e * e + o * o);
 }
-function Nr(n) {
+function qr(n) {
   let t = 1 / 0, e = -1 / 0, o = 1 / 0, i = -1 / 0;
   for (const [r, s] of n)
     r < t && (t = r), r > e && (e = r), s < o && (o = s), s > i && (i = s);
@@ -4305,7 +4305,7 @@ function Nr(n) {
 }
 class Ie extends An {
   getBoxMesh() {
-    le.identity(), le.setFromMatrix3(this.rotation), le.decompose(Ee, fe, new y.Vector3());
+    le.identity(), le.setFromMatrix3(this.rotation), le.decompose(Te, fe, new y.Vector3());
     const t = this.halfSize.clone().multiplyScalar(2), e = new y.Mesh(new y.BoxGeometry(t.x, t.y, t.z));
     return e.position.copy(this.center), e.rotation.setFromQuaternion(fe), e;
   }
@@ -4316,7 +4316,7 @@ class Ie extends An {
     return new y.LineSegments(o, new y.LineBasicMaterial({ color: t, toneMapped: !1 }));
   }
   toJson() {
-    return le.identity(), le.setFromMatrix3(this.rotation), le.decompose(Ee, fe, new y.Vector3()), {
+    return le.identity(), le.setFromMatrix3(this.rotation), le.decompose(Te, fe, new y.Vector3()), {
       size: this.halfSize.toArray(),
       center: this.center.toArray(),
       quaternion: fe.toArray()
@@ -4333,7 +4333,7 @@ class Ie extends An {
     if (o instanceof y.Euler) fe.setFromEuler(o);
     else if (o instanceof y.Quaternion) fe.copy(o);
     else throw new Error("传入的旋转不是欧拉角或者四元数");
-    return le.compose(e, fe, qr), i.center.copy(e), i.halfSize.copy(t.multiplyScalar(0.5)), i.rotation.setFromMatrix4(le), i;
+    return le.compose(e, fe, Wr), i.center.copy(e), i.halfSize.copy(t.multiplyScalar(0.5)), i.rotation.setFromMatrix4(le), i;
   }
   /** 通过2d路径创建
    * @param path
@@ -4343,39 +4343,39 @@ class Ie extends An {
    * @returns
    */
   static fromByPath2D(t, e, o, i = new Ie()) {
-    const r = Wr({
+    const r = Nr({
       type: "Polygon",
-      coordinates: [t.map((m) => [m.x, m.y])]
+      coordinates: [t.map((f) => [f.x, f.y])]
     });
     if (!r) throw new Error("2d obb 获取失败");
     const s = r.geometry.coordinates[0], a = Vn(s[0], s[1]), l = Vn(s[1], s[2]), u = Math.atan2(s[1][1] - s[0][1], s[1][0] - s[0][0]);
-    Ee.set(a, l, o), Sn.set(0, 0, u);
-    const [h, g] = Nr(s);
-    return e.x = h, e.y = g, this.from(Ee, e, Sn, i);
+    Te.set(a, l, o), Sn.set(0, 0, u);
+    const [h, d] = qr(s);
+    return e.x = h, e.y = d, this.from(Te, e, Sn, i);
   }
 }
-const le = new y.Matrix4(), fe = new y.Quaternion(), Sn = new y.Euler(), qr = new y.Vector3(1, 1, 1), Ee = new y.Vector3(), Xr = new y.Box3();
-function Hr(n, t, e = 5e-3, o = 0.2) {
+const le = new y.Matrix4(), fe = new y.Quaternion(), Sn = new y.Euler(), Wr = new y.Vector3(1, 1, 1), Te = new y.Vector3(), Xr = new y.Box3();
+function $r(n, t, e = 5e-3, o = 0.2) {
   if (!n.length || !t.length) return 0;
-  const i = Math.max(e, 0.03), r = e * e, s = /* @__PURE__ */ new Map(), a = (g, c, m) => `${Math.floor(g / i)},${Math.floor(c / i)},${Math.floor(m / i)}`;
-  for (const g of t) {
-    const c = a(g.x, g.y, g.z);
-    s.has(c) || s.set(c, []), s.get(c).push(g);
+  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)}`;
+  for (const d of t) {
+    const c = a(d.x, d.y, d.z);
+    s.has(c) || s.set(c, []), s.get(c).push(d);
   }
   let l = 0;
   const u = Math.ceil(e / i) + 1, h = [];
-  for (let g = -u; g <= u; g++)
+  for (let d = -u; d <= u; d++)
     for (let c = -u; c <= u; c++)
-      for (let m = -u; m <= u; m++)
-        g * g + c * c + m * m <= u * u && h.push([g, c, m]);
-  for (const g of n) {
-    const c = Math.floor(g.x / i), m = Math.floor(g.y / i), w = Math.floor(g.z / i);
+      for (let f = -u; f <= u; f++)
+        d * d + c * c + f * f <= u * u && h.push([d, c, f]);
+  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, d] of h) {
-      const f = `${c + P},${m + M},${w + d}`;
-      if (s.has(f)) {
-        for (const p of s.get(f))
-          if (g.distanceToSquared(p) < r) {
+    for (const [P, M, g] of h) {
+      const m = `${c + P},${f + M},${w + g}`;
+      if (s.has(m)) {
+        for (const p of s.get(m))
+          if (d.distanceToSquared(p) < r) {
             x = !0;
             break;
           }
@@ -4394,7 +4394,7 @@ function pe(n, t, e = 0.5) {
       break;
   return i;
 }
-function $e(n, t, e, o) {
+function Ge(n, t, e, o) {
   if (n.intersectsOBB(t))
     return !0;
   {
@@ -4447,7 +4447,7 @@ function _n(n, t, e, o) {
   const r = Ie.fromByPath2D(i, t, e);
   return r.center.z = o, r;
 }
-const gi = (n) => {
+const Mi = (n) => {
   if (n.length == 0) return [];
   const t = [], e = /* @__PURE__ */ new Map();
   for (let r = 0; r < n.length; r++) {
@@ -4456,9 +4456,9 @@ const gi = (n) => {
     const l = a.indexOf("_") + 1, u = a.lastIndexOf("_"), h = a.substring(l, u);
     if (h === "wall")
       continue;
-    let g = [];
+    let d = [];
     for (let P = 0; P < n[r].points.length; P++)
-      g.push(new y.Vector3(
+      d.push(new y.Vector3(
         n[r].points[P].x,
         n[r].points[P].y,
         n[r].points[P].z
@@ -4466,26 +4466,26 @@ const gi = (n) => {
     let c = -99999;
     if (h === "floor") {
       let P = /* @__PURE__ */ new Map();
-      for (let d = 0; d < n[r].points.length; d++) {
-        let f = n[r].points[d].z;
-        if (f = Math.floor(f * 10) / 10, P.has(f)) {
-          const p = P.get(f);
-          p.num += 1, p.points.push(n[r].points[d]), P.set(f, p);
+      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);
         } else
-          P.set(f, { num: 1, points: [n[r].points[d]] });
+          P.set(m, { num: 1, points: [n[r].points[g]] });
       }
       let M = [...P.entries()].reduce(
-        (d, f) => f[1].num > d[1].num ? f : d
+        (g, m) => m[1].num > g[1].num ? m : g
       );
-      s = [], s = M[1].points.map((d) => [d.x, d.y]), g = [], g = M[1].points.map((d) => new y.Vector3(d.x, d.y, d.z)), c = M[0];
+      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];
     }
-    const m = Dn(g), w = {
-      points: g,
+    const f = Dn(d), w = {
+      points: d,
       path: cn(s),
-      h: m.h,
-      minz: m.minz,
-      maxz: m.maxz,
-      center: { x: m.x, y: m.y, z: m.z },
+      h: f.h,
+      minz: f.minz,
+      maxz: f.maxz,
+      center: { x: f.x, y: f.y, z: f.z },
       obj_id: n[r].obj_id,
       type: h,
       averagePz: n[r].averagePz,
@@ -4529,24 +4529,24 @@ const gi = (n) => {
     for (let h = 0; h < s.length; h++) {
       if (s[h].obb == null || a.includes(h))
         continue;
-      const g = {
+      const d = {
         ...s[h],
         obb: s[h].obb.clone()
       };
       for (let c = h + 1; c < s.length; c++) {
         if (s[c].obb == null || a.includes(c))
           continue;
-        if (g.obb.intersectsOBB(s[c].obb)) {
+        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 || g.type == "floor") && g.points.push(s[c].points[P]);
-          const w = g.points.map((P) => [P.x, P.y]);
-          g.path = cn(w);
-          const x = Dn(g.points);
-          g.h = x.h, g.minz = x.minz, g.maxz = x.maxz, g.center = { x: x.x, y: x.y, z: x.z }, g.obb = _n(g.path, g.center, g.h, (g.maxz + g.minz) / 2), g.positionArr.push(...s[c].positionArr), c = h;
+            (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]);
+          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;
         }
       }
-      g.path.length > s[h].path.length && (a.push(h), l.push(g));
+      d.path.length > s[h].path.length && (a.push(h), l.push(d));
     }
     const u = [];
     for (let h = 0; h < s.length; h++)
@@ -4561,13 +4561,13 @@ const gi = (n) => {
     for (let l = 0; l < a.length; l++) {
       const u = a[l].obb, h = a[l].minz;
       a[l].maxz;
-      const g = a[l].averagePz;
+      const d = a[l].averagePz;
       if (s === "window" || s === "door" || s === "tv" || s === "chair" || s === "cabinet" || s === "table") {
         const c = new y.Vector3();
         u.getSize(c);
-        const m = [c.x, c.y, c.z];
+        const f = [c.x, c.y, c.z];
         let w = 0;
-        for (const x of m)
+        for (const x of f)
           if (x < 0.2 && (w++, w === 2)) {
             a[l].isDel = !0;
             break;
@@ -4575,8 +4575,8 @@ const gi = (n) => {
       }
       if (!a[l].isDel)
         for (let c = r + 1; c < t.length; c++) {
-          const m = t[c].type;
-          if (m === "people" || m === "floor")
+          const f = t[c].type;
+          if (f === "people" || f === "floor")
             continue;
           const w = t[c].array;
           for (let x = 0; x < w.length; x++) {
@@ -4584,52 +4584,52 @@ const gi = (n) => {
             const P = w[x].obb, M = w[x].minz;
             if (w[x].maxz, u.intersectsOBB(P)) {
               pe(w[x].points, u);
-              const d = pe(a[l].points, P), f = vn(u, P);
-              if (d >= 0.3 && f == -1) {
+              const g = pe(a[l].points, P), m = vn(u, P);
+              if (g >= 0.3 && m == -1) {
                 a[l].isDel = !0;
                 break;
               }
               if (s !== "wall" && s !== "floor" && s !== "roof") {
                 if (s === "window") {
-                  if (m === "balcony railing" && we(u, w[x].points)) {
+                  if (f === "balcony railing" && we(u, w[x].points)) {
                     w[x].isDel = !0;
                     continue;
                   }
-                  if (m === "balcony railing" && we(P, a[l].points)) {
+                  if (f === "balcony railing" && we(P, a[l].points)) {
                     a[l].isDel = !0;
                     break;
                   }
-                  if (m === "balcony railing" && $e(u, P, a[l].points, w[x].points) && (Math.abs(h - M) < 0.1 || Math.abs(M - g) > 0.3)) {
+                  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)) {
                     w[x].isDel = !0;
                     continue;
                   }
                 } else if (s === "balcony railing") {
-                  if (m === "window" && we(u, w[x].points)) {
+                  if (f === "window" && we(u, w[x].points)) {
                     w[x].isDel = !0;
                     continue;
                   }
-                  if (m === "window" && we(P, a[l].points)) {
+                  if (f === "window" && we(P, a[l].points)) {
                     a[l].isDel = !0;
                     break;
                   }
-                  if (m === "window" && $e(u, P, a[l].points, w[x].points) && (Math.abs(h - M) < 0.1 || Math.abs(h - g) > 0.3)) {
+                  if (f === "window" && Ge(u, P, 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), Hr(z, b, 0.03, 0.5) > 0.5)
+                if (v.length > S.length ? (p = !0, b = v, z = S) : (b = S, z = v), $r(z, b, 0.03, 0.5) > 0.5)
                   if (p)
                     w[x].isDel = !0;
                   else {
                     a[l].isDel = !0;
                     break;
                   }
-                else if ($e(u, P)) {
+                else if (Ge(u, P)) {
                   const D = vn(u, P);
                   if (D === 1 || D === 0) {
-                    if (m === "switch") continue;
+                    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);
                   } else {
                     if (s === "switch") continue;
@@ -4654,19 +4654,19 @@ const gi = (n) => {
   for (let r = 0; r < t.length; r++) {
     const s = t[r].type, a = t[r].array;
     for (let l = 0; l < a.length; l++) {
-      let u = a[l].maxz, h = a[l].minz, g = s === "switch" ? 0.1 : 0.3;
+      let u = a[l].maxz, h = a[l].minz, d = s === "switch" ? 0.1 : 0.3;
       const c = a[l].averagePz;
-      if (Math.abs(u - c) < g) {
+      if (Math.abs(u - c) < d) {
         a[l].isDel = !0;
         continue;
       }
       if (s === "window" || s === "door" || s === "tv") {
-        const m = Math.abs(u - c), w = Math.abs(h - c);
-        (s === "tv" && w < 1.6 || s !== "window" && m < 1.6) && (a[l].isDel = !0), s === "window" && m < 1 && (a[l].isDel = !0);
+        const f = Math.abs(u - c), w = Math.abs(h - c);
+        (s === "tv" && w < 1.6 || s !== "window" && f < 1.6) && (a[l].isDel = !0), s === "window" && f < 1 && (a[l].isDel = !0);
       }
       if (s === "chair") {
-        const m = new y.Vector3();
-        a[l].obb.getSize(m), (m.x < 0.1 || m.y < 0.1 || m.z < 0.2) && (a[l].isDel = !0);
+        const f = new y.Vector3();
+        a[l].obb.getSize(f), (f.x < 0.1 || f.y < 0.1 || f.z < 0.2) && (a[l].isDel = !0);
       }
       s === "balcony railing" && (Math.abs(u - h) < 0.4 && (a[l].isDel = !0), (h < c && Math.abs(h - c) > 1 || h > c && Math.abs(h - c) > 1) && (a[l].isDel = !0), u < c && (a[l].isDel = !0)), s === "people" && (Math.abs(u - h) < 1 && (a[l].isDel = !0), h > c && h - c > 0.3 && (a[l].isDel = !0), u < c && (a[l].isDel = !0)), s === "floor" && a[l].points.length < 500 && (a[l].isDel = !0);
     }
@@ -4690,11 +4690,120 @@ const gi = (n) => {
   }
   return i;
 };
+function Hr(n, t, e, o) {
+  return 1 + (n[t][0] === 0 || n[e][0] === 0 || n[o][0] === 0 ? 1 : 0);
+}
+function Yr(n) {
+  if (!n.length) return 0;
+  const t = [...n].sort((o, i) => o - i), e = Math.floor(t.length / 2);
+  return t.length % 2 ? t[e] : (t[e - 1] + t[e]) / 2;
+}
+function Gr(n, t, e, o, i, r) {
+  const s = Math.hypot(e - i, o - r), a = Math.hypot(n - i, t - r), l = Math.hypot(n - e, t - o), u = Math.abs(
+    (e - n) * (r - t) - (i - n) * (o - t)
+  ) / 2, h = Math.max(s, a, l);
+  return u === 0 ? {
+    radius: 1 / 0,
+    maxEdge: h
+  } : {
+    radius: s * a * l / (4 * u),
+    maxEdge: h
+  };
+}
+function jr(n, t) {
+  const e = [], o = /* @__PURE__ */ new Set(), i = (r, s) => r < s ? `${r}_${s}` : `${s}_${r}`;
+  for (let r = 0; r < t.length; r += 3) {
+    const s = t[r], a = t[r + 1], l = t[r + 2], u = [
+      [s, a],
+      [a, l],
+      [l, s]
+    ];
+    for (const [h, d] of u) {
+      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);
+      Number.isFinite(M) && M > 0 && e.push(M);
+    }
+  }
+  return Yr(e);
+}
+function Ur(n) {
+  const t = /* @__PURE__ */ new Set(), e = [];
+  for (const o of n) {
+    if (!o || o.length < 2) continue;
+    const i = o[0], r = o[1];
+    if (!Number.isFinite(i) || !Number.isFinite(r)) continue;
+    const s = `${i}_${r}`;
+    t.has(s) || (t.add(s), e.push([i, r]));
+  }
+  return e;
+}
+function Zr(n) {
+  const t = /* @__PURE__ */ new Map();
+  for (const [e, o] of n)
+    t.has(e) || t.set(e, []), t.has(o) || t.set(o, []), t.get(e).push(o), t.get(o).push(e);
+  return t;
+}
+function Kr(n, t) {
+  if (!t.length) return [];
+  const e = Zr(t), o = t[0][0], i = [], r = /* @__PURE__ */ new Set();
+  let s = o, a = -1;
+  do {
+    i.push(n[s]), r.add(s);
+    const l = e.get(s) || [];
+    let u = l.find((h) => h !== a && !r.has(h));
+    if (u === void 0 && (u = l.find((h) => h !== a)), u === void 0)
+      break;
+    a = s, s = u;
+  } while (s !== o && i.length <= t.length + 1);
+  return i;
+}
+function zi(n, t = {}) {
+  const {
+    edgeFactor: e = 20,
+    alphaScale: o = 2
+  } = t;
+  if (!n || n.length < 3) return [];
+  const i = Ur(n);
+  if (i.length < 3) return [];
+  const r = new ke(Float64Array.from(i.flat())), { triangles: s } = r;
+  if (!s.length) return [];
+  const a = jr(i, s);
+  if (!Number.isFinite(a) || a <= 0)
+    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(
+      M,
+      g,
+      m,
+      p,
+      b,
+      z
+    ), V = Hr(i, w, x, P) * o;
+    if (v <= 1 / V && S <= l) {
+      const D = [
+        [w, x],
+        [x, P],
+        [P, w]
+      ];
+      for (const [_, E] of D) {
+        const T = h(_, E);
+        u.set(T, (u.get(T) || 0) + 1);
+      }
+    }
+  }
+  const d = [];
+  for (const [f, w] of u)
+    w === 1 && d.push(f.split("_").map(Number));
+  return d.length ? Kr(i, d) : [];
+}
 function be(n, t) {
   const e = n.x - t.x, o = n.y - t.y;
   return Math.sqrt(e * e + o * o);
 }
-function Yr(n) {
+function Qr(n) {
   let t = 0, e = 0, o = 0;
   for (let i = 0; i < 4; i++) {
     const r = n[i], s = n[(i + 1) % 4], a = s.x - r.x, l = s.y - r.y, u = Math.sqrt(a * a + l * l);
@@ -4719,17 +4828,17 @@ function Un(n, t, e, o, i, r) {
   const s = i - e, a = r - o, l = s * s + a * a;
   if (l < 1e-12)
     return { dist: Math.sqrt((n - e) ** 2 + (t - o) ** 2), t: 0 };
-  const u = n - e, h = t - o, g = (u * s + h * a) / l, c = e + g * s, m = o + g * a;
-  return { dist: Math.sqrt((n - c) ** 2 + (t - m) ** 2), t: g };
+  const u = n - e, h = t - o, d = (u * s + h * a) / l, c = e + d * s, f = o + d * a;
+  return { dist: Math.sqrt((n - c) ** 2 + (t - f) ** 2), t: d };
 }
-function $r(n, t, e = 0.15) {
+function Jr(n, t, e = 0.15) {
   let o = 0, i = 0;
   for (const s of t)
     s !== n && ((be(n.start, s.start) <= e || be(n.start, s.end) <= e) && o++, (be(n.end, s.start) <= e || be(n.end, s.end) <= e) && i++);
   let r = 0;
   return o >= 1 && i >= 1 ? r = 5 : (o >= 1 || i >= 1) && (r = 2), { left: o, right: i, score: r };
 }
-function Gr(n, t) {
+function ti(n, t) {
   const e = [], { start: o, end: i } = n;
   for (const a of t) {
     const { dist: l } = Un(a.x, a.y, o.x, o.y, i.x, i.y);
@@ -4738,37 +4847,37 @@ function Gr(n, t) {
   const r = e.reduce((a, l) => a + l, 0) / e.length, s = e.reduce((a, l) => a + (l - r) ** 2, 0) / e.length;
   return s < 0.01 ? 3 : s < 0.05 ? 2 : s < 0.1 ? 1 : 0;
 }
-function jr(n, t, e = 0.15) {
+function ei(n, t, e = 0.15) {
   const o = n.end.x - n.start.x, i = n.end.y - n.start.y, r = Math.sqrt(o * o + i * i);
   if (r < 1e-12) return 0;
   const s = -i / r, a = o / r, l = [[], []];
-  for (let g = 0; g < 2; g++) {
-    const c = g === 0 ? n.start : n.end;
-    for (const m of t) {
-      if (m === n) continue;
-      const w = be(c, m.start), x = be(c, m.end);
+  for (let d = 0; d < 2; d++) {
+    const c = d === 0 ? n.start : n.end;
+    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 = m.end : x <= e && (P = m.start), !P) continue;
-      const M = m.end.x - m.start.x, d = m.end.y - m.start.y, f = Math.sqrt(M * M + d * d);
-      if (f < 1e-12 || Math.abs(o * M + i * d) / (r * f) >= 0.342) continue;
+      if (w <= e ? P = f.end : x <= e && (P = f.start), !P) 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[g].push(b > 0 ? 1 : -1);
+      l[d].push(b > 0 ? 1 : -1);
     }
   }
   if (l[0].length === 0 || l[1].length === 0) return 0;
   const u = [...l[0], ...l[1]];
-  return u.every((g) => g === u[0]) ? 2 : 1;
+  return u.every((d) => d === u[0]) ? 2 : 1;
 }
-function Ur(n, t, e) {
-  const o = $r(n, e), i = Gr(n, t), r = jr(n, e);
+function ni(n, t, e) {
+  const o = Jr(n, e), i = ti(n, t), r = ei(n, e);
   return { score: o.score * 3 + i * 2 + r * 2, details: { conn: o.score, variance: i, sameSide: r } };
 }
-function Zr(n) {
+function oi(n) {
   const t = n.end.x - n.start.x, e = n.end.y - n.start.y;
   let o = Math.atan2(e, t) * (180 / Math.PI);
   return o < 0 && (o += 180), o;
 }
-function Kr(n, t) {
+function ri(n, t) {
   const e = [];
   for (const o of n) {
     let i = !1;
@@ -4783,7 +4892,7 @@ function Kr(n, t) {
   }
   return e;
 }
-function Qr(n, t = 0.05) {
+function ii(n, t = 0.05) {
   const e = [];
   for (const o of n) {
     let i = !1;
@@ -4796,7 +4905,7 @@ function Qr(n, t = 0.05) {
   }
   return e;
 }
-function Jr(n, t, e, o, i) {
+function si(n, t, e, o, i) {
   const r = [];
   for (const a of n) {
     const l = a.seg, u = (l.start.x - t.start.x) * e + (l.start.y - t.start.y) * o, h = (l.end.x - t.start.x) * e + (l.end.y - t.start.y) * o;
@@ -4814,11 +4923,11 @@ function Jr(n, t, e, o, i) {
   }
   return s;
 }
-function ti(n, t, e, o, i, r, s) {
+function ai(n, t, e, o, i, r, s) {
   const a = e - t, l = { ...n };
   return l.start = { x: n.start.x + t * o, y: n.start.y + t * i, z: n.start.z }, l.end = { x: n.start.x + e * o, y: n.start.y + e * i, z: n.start.z }, l.length = a, l.direction = { x: o, y: i, z: 0 }, l.rooftopPz = r, l.buildRosource = s, l.isRebuild = !1, l.doorAndBeamData || (l.doorAndBeamData = []), l.insetionArr || (l.insetionArr = []), l;
 }
-function ei(n, t) {
+function li(n, t) {
   let e = !0;
   for (; e; ) {
     e = !1;
@@ -4829,10 +4938,10 @@ function ei(n, t) {
           continue;
         const a = Math.abs(r.end.x - s.start.x) < 1e-3 && Math.abs(r.end.y - s.start.y) < 1e-3, l = Math.abs(r.start.x - s.end.x) < 1e-3 && Math.abs(r.start.y - s.end.y) < 1e-3, u = Math.abs(r.end.x - s.end.x) < 1e-3 && Math.abs(r.end.y - s.end.y) < 1e-3, h = Math.abs(r.start.x - s.start.x) < 1e-3 && Math.abs(r.start.y - s.start.y) < 1e-3;
         if (!(a || l || u || h) || r.direction.x * s.direction.x + r.direction.y * s.direction.y < 0.98) continue;
-        let c = r.start, m = r.end;
-        a ? m = s.end : l ? c = s.start : u ? m = s.start : h && (c = s.end);
-        const w = Math.hypot(m.x - c.x, m.y - c.y), x = { ...r };
-        x.start = c, x.end = m, x.length = w, x.direction = { x: (m.x - c.x) / w, y: (m.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;
+        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;
       }
   }
   return { segments: n, sourceMap: t };
@@ -4840,53 +4949,53 @@ function ei(n, t) {
 function Zn(n, t = 5, e = 0.05) {
   if (n.length <= 1)
     return { segments: n, sourceMap: n.map((l, u) => [u]) };
-  const o = n.map((l, u) => ({ seg: l, angle: Zr(l), idx: u }));
+  const o = n.map((l, u) => ({ seg: l, angle: oi(l), idx: u }));
   o.sort((l, u) => l.angle - u.angle);
-  const i = Kr(o, t), r = [], s = [], a = [];
+  const i = ri(o, t), r = [], s = [], a = [];
   for (const l of i) {
     let u = l[0].seg;
     for (const M of l)
       M.seg.length > u.length && (u = M.seg);
-    const h = u.end.x - u.start.x, g = u.end.y - u.start.y, c = Math.sqrt(h * h + g * g);
+    const h = u.end.x - u.start.x, d = u.end.y - u.start.y, c = Math.sqrt(h * h + d * d);
     if (c < 1e-12) continue;
-    const m = -g / c, w = h / c, x = l.map((M) => {
-      const d = M.seg.start.x - u.start.x, f = M.seg.start.y - u.start.y;
-      return { seg: M.seg, offset: Math.abs(d * m + f * w), idx: M.idx };
+    const f = -d / c, w = h / c, x = l.map((M) => {
+      const g = M.seg.start.x - u.start.x, m = M.seg.start.y - u.start.y;
+      return { seg: M.seg, offset: Math.abs(g * f + m * w), idx: M.idx };
     });
-    x.sort((M, d) => M.offset - d.offset);
-    const P = Qr(x);
+    x.sort((M, g) => M.offset - g.offset);
+    const P = ii(x);
     for (const M of P) {
-      let d = M[0].seg;
-      for (const T of M)
-        T.seg.length > d.length && (d = T.seg);
-      const f = d.end.x - d.start.x, p = d.end.y - d.start.y, b = Math.sqrt(f * f + p * p);
+      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 = f / b, v = p / b, S = M.map((T) => T.seg.rooftopPz ?? 0), V = Math.max(...S), D = [...new Set(S.map((T) => T.toFixed(3)))];
+      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)))];
       if (D.length > 1) {
-        const T = M.map((E) => ({
-          idx: E.idx,
-          start: { x: E.seg.start.x, y: E.seg.start.y, z: E.seg.start.z },
-          end: { x: E.seg.end.x, y: E.seg.end.y, z: E.seg.end.z },
-          length: E.seg.length,
-          rooftopPz: E.seg.rooftopPz ?? 0
+        const E = M.map((T) => ({
+          idx: T.idx,
+          start: { x: T.seg.start.x, y: T.seg.start.y, z: T.seg.start.z },
+          end: { x: T.seg.end.x, y: T.seg.end.y, z: T.seg.end.z },
+          length: T.seg.length,
+          rooftopPz: T.seg.rooftopPz ?? 0
         }));
-        a.push({ values: [...D], segments: T });
+        a.push({ values: [...D], segments: E });
       }
-      [...new Set(M.map((T) => String(T.seg.buildRosource)))];
-      const _ = Jr(M, d, z, v, e);
-      for (const { l: T, r: E, srcIdxs: A } of _) {
-        if (E - T < 0.01) continue;
-        const O = ti(d, T, E, z, v, V, d.buildRosource);
+      [...new Set(M.map((E) => String(E.seg.buildRosource)))];
+      const _ = si(M, g, z, v, 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);
         r.push(O), s.push(A);
       }
     }
   }
   return {
-    ...ei(r, s),
+    ...li(r, s),
     debugRPZGroups: a
   };
 }
-function ni(n) {
+function ci(n) {
   return {
     minLengthRatio: 0.95,
     maxDistance: 0.5,
@@ -4896,7 +5005,7 @@ function ni(n) {
     ...n
   };
 }
-function oi(n, t, e) {
+function ui(n, t, e) {
   return [
     { x: t, y: e, z: 0 },
     { x: n[0].x, y: n[0].y, z: 0 },
@@ -4905,7 +5014,7 @@ function oi(n, t, e) {
     { x: n[3].x, y: n[3].y, z: 0 }
   ];
 }
-function ri(n, t, e, o, i, r, s) {
+function hi(n, t, e, o, i, r, s) {
   const a = [
     { margin: r.projectionMargin, maxDist: r.maxDistance, label: "严格" },
     { margin: 0.4, maxDist: 0.65, label: "宽松" }
@@ -4914,22 +5023,22 @@ function ri(n, t, e, o, i, r, s) {
   for (const u of a) {
     if (l.length > 0) break;
     for (const h of n) {
-      const g = t * r.minLengthRatio;
-      if (h.length < g)
+      const d = t * r.minLengthRatio;
+      if (h.length < d)
         continue;
-      const { start: c, end: m } = h;
+      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, m.x, m.y);
+        const { dist: V, t: D } = Un(S.x, S.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((m.x - c.x) ** 2 + (m.y - c.y) ** 2);
+      const P = Math.sqrt((f.x - c.x) ** 2 + (f.y - c.y) ** 2);
       if (P < 1e-12) continue;
-      const M = (m.x - c.x) / P, d = (m.y - c.y) / P, f = Math.abs(e * M + o * d), p = Math.abs(-o * M + e * d), b = Math.max(f, p), z = Math.acos(Math.min(b, 1)) * (180 / Math.PI);
+      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);
       if (z > r.angleThreshold) {
         `${z.toFixed(1)}${r.angleThreshold}`;
         continue;
@@ -4938,7 +5047,7 @@ function ri(n, t, e, o, i, r, s) {
       if (P > 0.01) {
         const S = [];
         for (let _ = 1; _ <= 4; _++) {
-          const T = i[_], E = T.x - c.x, A = T.y - c.y, O = (E * M + A * d) / P;
+          const E = i[_], T = E.x - c.x, A = E.y - c.y, O = (T * M + A * g) / P;
           S.push(O);
         }
         const V = Math.min(...S), D = Math.max(...S);
@@ -4956,66 +5065,66 @@ function ri(n, t, e, o, i, r, s) {
   }
   return l;
 }
-function ii(n, t, e, o) {
+function fi(n, t, e, o) {
   if (n.length <= 1)
     return n.length === 1 && (n[0].score = -1), n;
   for (const i of n) {
-    const { score: r, details: s } = Ur(i.seg, t, e);
+    const { score: r, details: s } = ni(i.seg, t, e);
     i.score = r, i.details = s;
   }
   return n.sort((i, r) => r.embedRatio - i.embedRatio || r.score - i.score || i.minDist - r.minDist), n;
 }
-function si(n, t, e, o) {
+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), g = Math.max(...u), c = (g - h) * s, m = (h + g) / 2, w = n.start.x + m * i, x = n.start.y + m * r, P = e.box.min.z, M = e.box.max.z, d = Math.abs(M - P), f = jn(o, n.start.x, n.start.y), p = Math.max(0, P - f), b = h <= 0 && g >= 1, z = n.start.z + m * (n.end.z - n.start.z);
+  }), 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);
   return {
     p: { x: w, y: x, z },
     width: c,
     full: b,
-    height: d,
+    height: g,
     groundClearance: p
   };
 }
 function Kn(n, t, e) {
-  var h, g, c, m, w;
+  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 ((g = x.originalPoints) != null && g.length) for (const P of x.originalPoints) r.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 ((m = x.insetionArr) != null && m.length) for (const P of x.insetionArr) a.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);
 }
-function ai(n, t, e, o) {
+function mi(n, t, e, o) {
   var u;
-  const i = ni(e), r = [], { segments: s, sourceMap: a } = o ?? Zn(t), l = s;
+  const i = ci(e), r = [], { segments: s, sourceMap: a } = o ?? Zn(t), l = s;
   for (const h of n) {
-    const g = (u = h.coordinatesByArea) == null ? void 0 : u.coordinates;
-    if (!g || g.length < 4)
+    const d = (u = h.coordinatesByArea) == null ? void 0 : u.coordinates;
+    if (!d || d.length < 4)
       continue;
-    const c = g.slice(0, 4), m = c.reduce((D, _) => D + _.x, 0) / 4, w = c.reduce((D, _) => D + _.y, 0) / 4, { longSide: x, dirX: P, dirY: M } = Yr(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: P, dirY: M } = Qr(c);
     if (x < 0.01)
       continue;
-    const d = c.reduce((D, _) => D + _.z, 0) / 4, f = jn(t, m, w);
-    if (d < f - 0.3)
+    const g = c.reduce((D, _) => D + _.z, 0) / 4, m = jn(t, f, w);
+    if (g < m - 0.3)
       continue;
-    const p = oi(c, m, w);
+    const p = ui(c, f, w);
     h.name;
-    let b = ri(l, x, P, M, p, i, h.name);
-    b = ii(b, p, t, 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 V;
-    if (z && (V = si(z, c, h, s), !i.printOnly)) {
+    if (z && (V = di(z, c, h, s), !i.printOnly)) {
       const D = z;
       D.drawWindow || (D.drawWindow = []), D.drawWindow.push(V);
     }
@@ -5030,49 +5139,50 @@ function ai(n, t, e, o) {
     });
   }
   for (const h of r) {
-    const g = h.wallSegment, c = s.indexOf(g);
+    const d = h.wallSegment, c = s.indexOf(d);
     if (c === -1) continue;
-    const m = a[c];
-    !m || m.length <= 1 || Kn(g, m, t);
+    const f = a[c];
+    !f || f.length <= 1 || Kn(d, f, t);
   }
   return r;
 }
-function pi(n, t, e) {
+function Vi(n, t, e) {
   const o = {
     printOnly: !1,
     ...e
-  }, i = Array.isArray(t) ? t.filter((c) => c && c.category === "window" && !c.isBayWindowObj) : [], { segments: r, sourceMap: s } = Zn(n), a = ai(i, n, o, { segments: r, sourceMap: s }), l = /* @__PURE__ */ new Set();
+  }, i = Array.isArray(t) ? t.filter((c) => c && c.category === "window" && !c.isBayWindowObj) : [], { segments: r, sourceMap: s } = Zn(n), a = mi(i, n, o, { segments: r, sourceMap: s }), l = /* @__PURE__ */ new Set();
   for (const c of a) {
-    const m = r.indexOf(c.wallSegment);
-    m >= 0 && l.add(m);
+    const f = r.indexOf(c.wallSegment);
+    f >= 0 && l.add(f);
   }
   const u = [], h = /* @__PURE__ */ new Set();
   for (const c of l) {
-    const m = s[c];
-    if (m) {
-      Kn(r[c], m, n);
-      for (const w of m) h.add(w);
+    const f = s[c];
+    if (f) {
+      Kn(r[c], f, n);
+      for (const w of f) h.add(w);
     }
     u.push(r[c]);
   }
   for (let c = 0; c < n.length; c++)
     h.has(c) || u.push(n[c]);
-  const g = new Set(a.map((c) => c.windowName));
+  const d = new Set(a.map((c) => c.windowName));
   for (const c of t)
-    c && c.category === "window" && !c.isBayWindowObj && (g.has(c.name) ? delete c.AbnormalWindow : c.AbnormalWindow = !0);
+    c && c.category === "window" && !c.isBayWindowObj && (d.has(c.name) ? delete c.AbnormalWindow : c.AbnormalWindow = !0);
   for (const c of a)
     c.drawWindow && c.wallSegment && (c.wallSegment.drawWindow || (c.wallSegment.drawWindow = []), c.wallSegment.drawWindow.push(c.drawWindow));
   return { segments: u, matches: a };
 }
 export {
   cn as computeContour,
+  zi as computeContourNew,
   jn as computeLocalFloorZ,
-  ai as findWindowWalls,
-  ui as getAllGeometry,
-  fi as getBeamLine,
-  di as getColLine,
-  gi as getMergeMeaning,
+  mi as findWindowWalls,
+  yi as getAllGeometry,
+  wi as getBeamLine,
+  bi as getColLine,
+  Mi as getMergeMeaning,
   Zn as mergeCollinearSegments,
-  pi as processData,
-  hi as updateStEdPoint
+  Vi as processData,
+  xi as updateStEdPoint
 };