rm-graphical-computing 1.0.65 → 1.0.66

package/dist/index.js

@@ -1,22 +1,22 @@
 var Qn = Object.defineProperty;
 var Jn = (n, t, e) => t in n ? Qn(n, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : n[t] = e;
 var Oe = (n, t, e) => Jn(n, typeof t != "symbol" ? t + "" : t, e);
-import * as x from "three";
+import * as y from "three";
 import { BufferGeometry as to, BufferAttribute as eo, Plane as no, Vector3 as zt, Matrix3 as En, MathUtils as Ne, Box3 as oo, Matrix4 as Tn, Ray as ro } from "three";
 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 c = 0;
+  let u = 0;
   for (let h = 0; h < n.length; ++h) {
     const d = n[h];
-    let u = 0;
+    let c = 0;
     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 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]), u++;
+      r[f] === void 0 && (r[f] = []), r[f].push(d.attributes[f]), c++;
     }
-    if (u !== o.size)
+    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 !== d.morphTargetsRelative)
       return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + ". .morphTargetsRelative must be consistent throughout all geometries."), null;
@@ -33,17 +33,17 @@ function io(n, t = !1) {
         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(c, f, h), c += f;
+      l.addGroup(u, f, h), u += f;
     }
   }
   if (e) {
     let h = 0;
     const d = [];
-    for (let u = 0; u < n.length; ++u) {
-      const f = n[u].index;
+    for (let c = 0; c < n.length; ++c) {
+      const f = n[c].index;
       for (let w = 0; w < f.count; ++w)
         d.push(f.getX(w) + h);
-      h += n[u].attributes.position.count;
+      h += n[c].attributes.position.count;
     }
     l.setIndex(d);
   }
@@ -57,10 +57,10 @@ function io(n, t = !1) {
     const d = s[h][0].length;
     if (d === 0) break;
     l.morphAttributes = l.morphAttributes || {}, l.morphAttributes[h] = [];
-    for (let u = 0; u < d; ++u) {
+    for (let c = 0; c < d; ++c) {
       const f = [];
-      for (let y = 0; y < s[h].length; ++y)
-        f.push(s[h][y][u]);
+      for (let x = 0; x < s[h].length; ++x)
+        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;
@@ -71,8 +71,8 @@ function io(n, t = !1) {
 }
 function Qe(n) {
   let t, e, o, i = -1, r = 0;
-  for (let c = 0; c < n.length; ++c) {
-    const h = n[c];
+  for (let u = 0; u < n.length; ++u) {
+    const h = n[u];
     if (t === void 0 && (t = h.array.constructor), t !== h.array.constructor)
       return console.error("THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.array must be of consistent array types across matching attributes."), null;
     if (e === void 0 && (e = h.itemSize), e !== h.itemSize)
@@ -85,14 +85,14 @@ function Qe(n) {
   }
   const s = new t(r), a = new eo(s, e, o);
   let l = 0;
-  for (let c = 0; c < n.length; ++c) {
-    const h = n[c];
+  for (let u = 0; u < n.length; ++u) {
+    const h = n[u];
     if (h.isInterleavedBufferAttribute) {
       const d = l / e;
-      for (let u = 0, f = h.count; u < f; u++)
+      for (let c = 0, f = h.count; c < f; c++)
         for (let w = 0; w < e; w++) {
-          const y = h.getComponent(u, w);
-          a.setComponent(u + d, w, y);
+          const x = h.getComponent(c, w);
+          a.setComponent(c + d, w, x);
         }
     } else
       s.set(h.array, l);
@@ -101,16 +101,16 @@ function Qe(n) {
   return i !== void 0 && (a.gpuType = i), a;
 }
 const so = (n, t, e) => {
-  let o = new x.LineBasicMaterial({ color: "#0011ff" }), i = [];
+  let o = new y.LineBasicMaterial({ color: "#0011ff" }), i = [];
   i.push(n), i.push(t);
-  let r = new x.BufferGeometry();
-  r.setFromPoints(i), r.rotateX(-Math.PI / 2), e.add(new x.Line(r, o));
+  let r = new y.BufferGeometry();
+  r.setFromPoints(i), r.rotateX(-Math.PI / 2), e.add(new y.Line(r, o));
 }, 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, c = r * l - s * a;
-  if (Math.abs(c) < i) return null;
-  const h = ((e.x - n.x) * l - (e.y - n.y) * a) / c, d = ((e.x - n.x) * s - (e.y - n.y) * r) / c;
+  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, 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 x.Vector3(
+    point: new y.Vector3(
       n.x + h * r,
       n.y + h * s,
       n.z
@@ -127,29 +127,29 @@ const so = (n, t, e) => {
     // 最大宽度限制
   } = e, h = document.createElement("canvas").getContext("2d");
   h.font = `bold ${o}px ${i}`;
-  const u = h.measureText(n).width;
-  let f = Math.min(u + a * 2, l), w = o + a * 2;
-  const y = document.createElement("canvas");
-  y.width = f, y.height = w;
-  const M = y.getContext("2d");
-  M.fillStyle = r, M.fillRect(0, 0, f, w), M.fillStyle = s, M.font = `bold ${o}px ${i}`, M.textAlign = "center", M.textBaseline = "middle", u > l - a * 2 ? lo(M, n, f / 2, w / 2, l, o) : M.fillText(n, f / 2, w / 2);
-  const P = new x.CanvasTexture(y), g = new x.SpriteMaterial({
-    map: P,
+  const c = h.measureText(n).width;
+  let f = Math.min(c + a * 2, l), w = o + a * 2;
+  const x = document.createElement("canvas");
+  x.width = f, x.height = w;
+  const P = x.getContext("2d");
+  P.fillStyle = r, P.fillRect(0, 0, f, w), P.fillStyle = s, P.font = `bold ${o}px ${i}`, P.textAlign = "center", P.textBaseline = "middle", c > l - a * 2 ? lo(P, n, f / 2, w / 2, l, o) : P.fillText(n, f / 2, w / 2);
+  const M = new y.CanvasTexture(x), g = new y.SpriteMaterial({
+    map: M,
     depthTest: !1,
     transparent: !0
-  }), m = new x.Sprite(g);
+  }), m = new y.Sprite(g);
   m.position.set(t.x, t.y, t.z);
   const p = 5e-3;
   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, c = o;
+  let a = "", l = r * 1.2, u = o;
   for (let h = 0; h < s.length; h++) {
     const d = a + s[h];
-    n.measureText(d).width > i && h > 0 ? (n.fillText(a, e, c), a = s[h], c += l) : a = d;
+    n.measureText(d).width > i && h > 0 ? (n.fillText(a, e, u), a = s[h], u += l) : a = d;
   }
-  n.fillText(a, e, c);
+  n.fillText(a, e, u);
 }
 const oe = (n, t, e = 0.01) => {
   const o = Math.sqrt(n.x * n.x + n.y * n.y + n.z * n.z), i = Math.sqrt(t.x * t.x + t.y * t.y + t.z * t.z);
@@ -158,33 +158,33 @@ const oe = (n, t, e = 0.01) => {
   const r = { x: n.x / o, y: n.y / o, z: n.z / o }, s = { x: t.x / i, y: t.y / i, z: t.z / i };
   let a = r.x * s.x + r.y * s.y + r.z * s.z;
   a = Math.max(-1, Math.min(1, a));
-  const l = Math.acos(Math.abs(a)), c = l <= e;
+  const l = Math.acos(Math.abs(a)), u = l <= e;
   return {
-    parallel: c,
-    sameDirection: c ? a > 0 : null,
+    parallel: u,
+    sameDirection: u ? a > 0 : null,
     angle: l
   };
 }, co = (n, t, e, o) => {
   const i = n;
   let r = [];
-  if (o && o.length && (r = o.map((V) => V.clone())), !i || i.length < 4) return {};
-  const s = new x.Vector3().subVectors(i[1], i[0]).normalize(), a = new x.Vector3().subVectors(i[3], i[0]).normalize(), l = s.clone().cross(a).normalize();
-  let c = 1 / 0, h = -1 / 0, d = 1 / 0, u = -1 / 0;
-  for (const V of i) {
-    const v = V.dot(s), S = V.dot(a);
-    v < c && (c = v), v > h && (h = v), S < d && (d = S), S > u && (u = S);
-  }
-  const f = i[0].dot(l), w = s.clone().multiplyScalar(c).add(a.clone().multiplyScalar(d)).add(l.clone().multiplyScalar(f)), y = s.clone().multiplyScalar(h).add(a.clone().multiplyScalar(d)).add(l.clone().multiplyScalar(f)), M = s.clone().multiplyScalar(h).add(a.clone().multiplyScalar(u)).add(l.clone().multiplyScalar(f)), P = s.clone().multiplyScalar(c).add(a.clone().multiplyScalar(u)).add(l.clone().multiplyScalar(f));
-  let g = [w, y, M, P], m = oe(new x.Vector3().subVectors(w, y), new x.Vector3(0, 0, 1));
-  m && m.parallel && (g = [w, P, M, y]);
+  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, d = 1 / 0, c = -1 / 0;
+  for (const z of i) {
+    const v = z.dot(s), S = z.dot(a);
+    v < u && (u = v), v > h && (h = v), S < d && (d = S), S > c && (c = S);
+  }
+  const 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 V = new x.Vector3().subVectors(g[1], g[0]).normalize(), v = V.clone().negate(), S = new x.Vector3().subVectors(g[3], g[0]).normalize(), z = S.clone().negate();
+    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(V, t), C = N.clone().addScaledVector(S, e), R = I.clone().addScaledVector(S, e), $ = new x.Vector3().add(I).add(N).add(C).add(R).multiplyScalar(0.25);
+        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($) < A) {
             B++;
@@ -194,13 +194,13 @@ const oe = (n, t, e = 0.01) => {
       }
       if (B >= T / 2)
         break;
-      p += B, g[0] = g[0].addScaledVector(V, t), g[3] = g[3].addScaledVector(V, t);
+      p += B, g[0] = g[0].addScaledVector(z, t), g[3] = g[3].addScaledVector(z, t);
     }
     D = g[0].distanceTo(g[1]), E = D / t;
     for (let O = 0; O < E; O++) {
       let I = g[1], B = 0;
       for (let 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 x.Vector3().add(I).add(N).add(C).add(R).multiplyScalar(0.25);
+        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($) < A) {
             B++;
@@ -216,7 +216,7 @@ const oe = (n, t, e = 0.01) => {
     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(V, t), C = N.clone().addScaledVector(z, e), R = I.clone().addScaledVector(z, e), $ = new x.Vector3().add(I).add(N).add(C).add(R).multiplyScalar(0.25);
+        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($) < A) {
             B++;
@@ -226,7 +226,7 @@ const oe = (n, t, e = 0.01) => {
       }
       if (B >= E / 2)
         break;
-      p += B, g[2] = g[2].addScaledVector(z, e), g[3] = g[3].addScaledVector(z, e);
+      p += B, g[2] = g[2].addScaledVector(V, e), g[3] = g[3].addScaledVector(V, e);
     }
   }
   const b = g[0].distanceTo(g[1]) * g[0].distanceTo(g[3]);
@@ -235,22 +235,22 @@ const oe = (n, t, e = 0.01) => {
     boxArea: b,
     totalInPlaneNum: p
   };
-}, Jt = (n, t, e, o, i = x.MathUtils.degToRad(8)) => {
-  const r = new x.Vector3(), s = new x.Vector3();
+}, Jt = (n, t, e, o, i = y.MathUtils.degToRad(8)) => {
+  const r = new y.Vector3(), s = new y.Vector3();
   r.subVectors(
-    new x.Vector3(t.x, t.y, 0),
-    new x.Vector3(n.x, n.y, 0)
+    new y.Vector3(t.x, t.y, 0),
+    new y.Vector3(n.x, n.y, 0)
   ).normalize(), s.subVectors(
-    new x.Vector3(o.x, o.y, 0),
-    new x.Vector3(e.x, e.y, 0)
+    new y.Vector3(o.x, o.y, 0),
+    new y.Vector3(e.x, e.y, 0)
   ).normalize();
-  const a = r.dot(s), l = Math.acos(Math.min(Math.abs(a), 1)), c = 1 - Math.min(l / i, 1), h = a > 0 ? "same" : "opposite";
+  const a = r.dot(s), l = Math.acos(Math.min(Math.abs(a), 1)), u = 1 - Math.min(l / i, 1), h = a > 0 ? "same" : "opposite";
   return {
-    parallelism: c,
+    parallelism: u,
     // 平行率 0-1
     angle: l,
     // 实际夹角（弧度）
-    angleDeg: x.MathUtils.radToDeg(l),
+    angleDeg: y.MathUtils.radToDeg(l),
     // 夹角（度）
     isParallel: l < i,
     // 是否平行（基于阈值）
@@ -260,15 +260,15 @@ const oe = (n, t, e = 0.01) => {
     // 方向向量
   };
 }, re = (n, t, e, o) => {
-  const i = new x.Vector3().subVectors(t, n), r = new x.Vector3().subVectors(o, e), s = i.length(), a = r.length();
+  const i = new y.Vector3().subVectors(t, n), r = new y.Vector3().subVectors(o, e), s = i.length(), a = r.length();
   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)), c = Math.min(1, Math.max(0, l)), h = Math.acos(c), d = x.MathUtils.radToDeg(h), u = 1 - c;
+  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: u,
+    rate: c,
     // 垂直率 0~1
-    percent: `${(u * 100).toFixed(2)}%`,
+    percent: `${(c * 100).toFixed(2)}%`,
     // 垂直率百分比
     angle: d,
     // 夹角（度，0~90）
@@ -277,28 +277,28 @@ const oe = (n, t, e = 0.01) => {
     isParallel: d < 0.01
     // 是否平行
   };
-}, ee = (n, t, e = !1) => new x.Vector3((n.x + t.x) / 2, (n.y + t.y) / 2, e ? 0 : (n.z + t.z) / 2), ne = (n, t, e, o, i = {}) => {
+}, 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 = {}) => {
   const {
-    parallelAngleMax: r = x.MathUtils.degToRad(10),
-    collinearAngleMax: s = x.MathUtils.degToRad(7),
+    parallelAngleMax: r = y.MathUtils.degToRad(10),
+    collinearAngleMax: s = y.MathUtils.degToRad(7),
     distanceThreshold: a = 2,
     overlapThreshold: l = 0.01
     // 投影重叠量大于此值才算 overlap
-  } = i, c = new x.Vector3().subVectors(t, n), h = new x.Vector3().subVectors(o, e), d = c.clone().normalize(), u = h.clone().normalize();
-  let f = x.MathUtils.clamp(d.dot(u), -1, 1);
-  const w = Math.acos(Math.abs(f)), y = x.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",
-      angleDeg: y,
+      angleDeg: x,
       avgPerpendicularDistance: null,
       maxPerpendicularDistance: null,
       gap: null,
       overlap: null,
       closestDistance: null
     };
-  f < 0 && u.negate();
-  const M = new x.Vector3().addVectors(d, u).normalize(), P = new x.Vector3().addVectors(n, t).multiplyScalar(0.5), g = Je(e, P, d), m = Je(o, P, d), p = (g + m) / 2, b = Math.max(g, m), V = n.dot(M), v = t.dot(M), S = e.dot(M), z = o.dot(M), D = Math.min(V, v), _ = Math.max(V, v), E = Math.min(S, z), T = Math.max(S, z), A = _ - D, O = T - E, I = Math.min(A, O), B = Math.min(_, T) - Math.max(D, E), L = B < 0 ? -B : 0, N = B > 0 ? B : 0, C = I > 0 ? N / I : 0, R = 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,
@@ -307,7 +307,7 @@ const oe = (n, t, e = 0.01) => {
   let X;
   return $ ? X = C > 0.5 ? "collinear_overlap" : "collinear_gap" : w <= r && (X = "parallel_offset"), {
     type: X,
-    angleDeg: y,
+    angleDeg: x,
     avgPerpendicularDistance: p,
     maxPerpendicularDistance: b,
     gap: L,
@@ -316,97 +316,97 @@ const oe = (n, t, e = 0.01) => {
   };
 };
 function Je(n, t, e) {
-  const o = new x.Vector3().subVectors(n, t), i = o.dot(e), r = e.clone().multiplyScalar(i);
-  return new x.Vector3().subVectors(o, r).length();
+  const o = new y.Vector3().subVectors(n, t), i = o.dot(e), r = e.clone().multiplyScalar(i);
+  return new y.Vector3().subVectors(o, r).length();
 }
 function uo(n, t, e, o) {
-  const i = new x.Vector3().subVectors(t, n), r = new x.Vector3().subVectors(o, e), s = new x.Vector3().subVectors(e, n), a = i.dot(i), l = i.dot(r), c = r.dot(r), h = i.dot(s), d = r.dot(s), u = a * c - l * l;
+  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;
-  u < 1e-10 ? (f = 0, w = c !== 0 ? d / c : 0) : (f = (l * d - c * h) / u, w = (a * d - l * h) / u), f = x.MathUtils.clamp(f, 0, 1), w = c !== 0 ? x.MathUtils.clamp((l * f + d) / c, 0, 1) : 0, f = a !== 0 ? x.MathUtils.clamp((l * w - h) / a, 0, 1) : 0;
-  const y = n.clone().add(i.clone().multiplyScalar(f)), M = e.clone().add(r.clone().multiplyScalar(w));
-  return y.distanceTo(M);
+  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) => {
-  let t = new x.Vector3(n.start.x, n.start.y, n.start.z), e = new x.Vector3(n.end.x, n.end.y, n.end.z), o = t.distanceTo(e), i = n.rooftopPz - n.start.z, r = tn(o, 100), s = tn(i, 70), a = i / s, l = /* @__PURE__ */ new Map();
-  for (let y = 0; y < s; y++)
-    l.set((y + 1) * a, { count: 0, minZ: 1 / 0, maxZ: -1 / 0 });
-  let c = new x.Line3(t, e);
-  const h = n.originalPoints, d = new x.Vector3();
-  for (let y = 0; y < h.length; y++) {
-    const M = h[y];
-    let g = c.closestPointToPoint(M, !0, d).distanceTo(M);
+  let t = new y.Vector3(n.start.x, n.start.y, n.start.z), e = new y.Vector3(n.end.x, n.end.y, n.end.z), o = t.distanceTo(e), i = n.rooftopPz - n.start.z, r = tn(o, 100), s = tn(i, 70), a = i / s, l = /* @__PURE__ */ new Map();
+  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, d = new y.Vector3();
+  for (let x = 0; x < h.length; x++) {
+    const P = h[x];
+    let g = u.closestPointToPoint(P, !0, d).distanceTo(P);
     const m = Math.floor(g / a);
     if (m < s) {
       const p = l.get((m + 1) * a);
-      p.count++, M.z < p.minZ && (p.minZ = M.z), M.z > p.maxZ && (p.maxZ = M.z);
+      p.count++, P.z < p.minZ && (p.minZ = P.z), P.z > p.maxZ && (p.maxZ = P.z);
     }
   }
-  let u, f, w = r / 2;
-  for (const [y, M] of l)
-    if (M.count >= w) {
-      u = M.minZ;
+  let c, f, w = r / 2;
+  for (const [x, P] of l)
+    if (P.count >= w) {
+      c = P.minZ;
       break;
     }
-  for (const [y, M] of [...l.entries()].reverse())
-    if (M.count >= w) {
-      f = M.maxZ;
+  for (const [x, P] of [...l.entries()].reverse())
+    if (P.count >= w) {
+      f = P.maxZ;
       break;
     }
-  return { minZ: u, maxZ: f };
+  return { minZ: c, maxZ: f };
 }, ze = (n, t, e) => {
-  let o = new x.Plane();
-  const i = new x.Vector3(n.x, n.y, n.z), r = new x.Vector3(t.x, t.y, t.z), s = new x.Vector3(t.x, t.y, t.z + 5);
+  let o = new y.Plane();
+  const i = new y.Vector3(n.x, n.y, n.z), r = new y.Vector3(t.x, t.y, t.z), s = new y.Vector3(t.x, t.y, t.z + 5);
   o.setFromCoplanarPoints(i, r, s);
   const a = [], l = [];
-  e.forEach((M) => {
-    const P = new x.Vector3();
-    o.projectPoint(M, P), l.push(P.clone()), P.z = i.z, a.push(P);
+  e.forEach((P) => {
+    const M = new y.Vector3();
+    o.projectPoint(P, M), l.push(M.clone()), M.z = i.z, a.push(M);
   });
-  let c = new x.Vector3(), h = new x.Vector3();
-  o.projectPoint(i, c), o.projectPoint(r, h);
-  const d = new x.Line3(c, h), u = [], f = [], w = [];
-  let y = new x.Vector3();
-  return a.forEach((M, P) => {
-    d.closestPointToPoint(M, !0, y).distanceTo(M) < 1e-3 ? (u.push(e[P]), f.push(l[P])) : w.push(M);
-  }), { newOriginalPoints: u, newProjectPoints: w, newOnLinePoints: f };
+  let u = new y.Vector3(), h = new y.Vector3();
+  o.projectPoint(i, u), o.projectPoint(r, h);
+  const d = new y.Line3(u, h), c = [], f = [], w = [];
+  let x = new y.Vector3();
+  return a.forEach((P, M) => {
+    d.closestPointToPoint(P, !0, x).distanceTo(P) < 1e-3 ? (c.push(e[M]), f.push(l[M])) : w.push(P);
+  }), { newOriginalPoints: c, newProjectPoints: w, newOnLinePoints: f };
 }, fo = (n) => {
-  function t(e, o, i, r, s, a, l, c, h) {
-    let d = new x.Line3(e, o), u = /* @__PURE__ */ new Map(), f = new x.Vector3(), w = e.clone(), y = o.clone(), M = 0;
+  function t(e, o, i, r, s, a, l, u, h) {
+    let d = new y.Line3(e, o), c = /* @__PURE__ */ new Map(), f = new y.Vector3(), w = e.clone(), x = o.clone(), P = 0;
     for (; ; ) {
-      let P = /* @__PURE__ */ new Map(), g = 0;
+      let M = /* @__PURE__ */ new Map(), g = 0;
       for (let m = 0; m < h.checkResults.length; m++)
-        if (!(h.checkResults[m].allCenterPoints.length / c * 100 < 1))
+        if (!(h.checkResults[m].allCenterPoints.length / u * 100 < 1))
           for (let b = 0; b < h.checkResults[m].allCenterPoints.length; b++) {
-            if (u.has(m) && u.get(m).removePtsIndex.includes(b))
+            if (c.has(m) && c.get(m).removePtsIndex.includes(b))
               continue;
-            let V = h.checkResults[m].allCenterPoints[b];
-            V = new x.Vector3(V.x, V.y, V.z);
-            let v = d.closestPointToPoint(V, !0, f), S = V.distanceTo(v);
-            Math.abs(S - s) < 0.01 && (g++, P.has(m) ? P.get(m).removePtsIndex.push(b) : P.set(m, {
+            let z = h.checkResults[m].allCenterPoints[b];
+            z = new y.Vector3(z.x, z.y, z.z);
+            let v = d.closestPointToPoint(z, !0, f), S = z.distanceTo(v);
+            Math.abs(S - s) < 0.01 && (g++, M.has(m) ? M.get(m).removePtsIndex.push(b) : M.set(m, {
               index: m,
               removePtsIndex: [b]
             }));
           }
-      if (M == l) {
-        e = w, o = y;
+      if (P == l) {
+        e = w, o = x;
         break;
       }
       if (g < a / 20 * 18 || g == 0) {
-        P.clear(), l - M < 5 && (e = w, o = y, u.clear());
+        M.clear(), l - P < 5 && (e = w, o = x, c.clear());
         break;
       } else {
-        M++;
-        for (const [m, p] of P)
-          u.has(m) ? u.get(m).removePtsIndex.push(...p.removePtsIndex) : u.set(m, p);
-        P.clear(), e = e.addScaledVector(i, r), o = o.addScaledVector(i, r), d.set(e, o);
+        P++;
+        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 (u.size > 0 && M != l)
-      for (const [P, g] of u) {
+    if (c.size > 0 && P != l)
+      for (const [M, g] of c) {
         let m = [], p = [];
-        for (let b = 0; b < h.checkResults[P].allCenterPoints.length; b++)
-          g.removePtsIndex.includes(b) || (m.push(h.checkResults[P].allCenterPoints[b]), p.push(h.checkResults[P].originalVertices[b]));
-        h.checkResults[P].allCenterPoints = m, h.checkResults[P].originalVertices = p;
+        for (let b = 0; b < h.checkResults[M].allCenterPoints.length; b++)
+          g.removePtsIndex.includes(b) || (m.push(h.checkResults[M].allCenterPoints[b]), p.push(h.checkResults[M].originalVertices[b]));
+        h.checkResults[M].allCenterPoints = m, h.checkResults[M].originalVertices = p;
       }
   }
   for (let e = 0; e < n.length; e++) {
@@ -418,24 +418,24 @@ 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 [z, D, _, E] = S;
-      z = new x.Vector3(z.x, z.y, z.z), D = new x.Vector3(D.x, D.y, D.z), _ = new x.Vector3(_.x, _.y, _.z), E = new x.Vector3(E.x, E.y, E.z), i = z.distanceTo(D), r = z.distanceTo(E);
-      let T = new x.Vector3().subVectors(z, D).normalize(), A = oe(T, new x.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 x.Vector3(o.start.x, o.start.y, o.start.z), a = new x.Vector3(o.end.x, o.end.y, o.end.z);
-    const l = s.distanceTo(a), c = o.rooftopPz - o.start.z, h = Math.ceil(l / i), d = Math.ceil(c / r);
-    let u = s.clone(), f = a.clone(), w = f.clone().add(new x.Vector3(0, 0, c)), y = u.clone().add(new x.Vector3(0, 0, c)), M = new x.Vector3().subVectors(f, u).normalize(), P = M.clone().negate();
-    new x.Vector3().subVectors(w, u).normalize().clone().negate();
-    let m = i / 2, p = l * c, b = i * r, V = p / b;
-    t(u, y, M, i, m, d, h, V, o), t(f, w, P, i, m, d, h, V, o), o.start = u, o.end = f;
-    const { newOriginalPoints: v } = ze(u, f, o.originalPoints);
+    let s = new y.Vector3(o.start.x, o.start.y, o.start.z), a = new y.Vector3(o.end.x, o.end.y, o.end.z);
+    const l = s.distanceTo(a), u = o.rooftopPz - o.start.z, h = Math.ceil(l / i), d = Math.ceil(u / r);
+    let c = s.clone(), f = a.clone(), w = f.clone().add(new y.Vector3(0, 0, u)), x = c.clone().add(new y.Vector3(0, 0, u)), P = new y.Vector3().subVectors(f, c).normalize(), M = P.clone().negate();
+    new y.Vector3().subVectors(w, c).normalize().clone().negate();
+    let m = i / 2, p = l * u, b = i * r, z = p / b;
+    t(c, x, P, i, m, d, h, z, o), t(f, w, M, i, m, d, h, z, o), o.start = c, o.end = f;
+    const { newOriginalPoints: v } = ze(c, f, o.originalPoints);
     o.originalPoints = v;
   }
-}, Lt = (n, t) => new x.Vector3(n.x, n.y, 0).distanceTo(new x.Vector3(t.x, t.y, 0)), mo = (n, t, e = 1e-6) => {
-  const o = new x.Vector3();
+}, 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) => {
   let t = 0, e = [];
@@ -501,9 +501,9 @@ class yo {
    */
   createWallPlaneMeshFromFourPoints(t, e, o, i, r, s, a = 16777215) {
     const l = [t, e, o, i];
-    for (let M = 0; M < l.length; M++)
-      this.isValidVector3(l[M]) || (console.error(`点${M + 1}包含无效数据:`, l[M]), l[M] = new x.Vector3(M, 0, M));
-    const c = new x.BufferGeometry(), h = new Float32Array([
+    for (let P = 0; P < l.length; P++)
+      this.isValidVector3(l[P]) || (console.error(`点${P + 1}包含无效数据:`, l[P]), l[P] = new y.Vector3(P, 0, P));
+    const u = new y.BufferGeometry(), h = new Float32Array([
       l[0].x,
       l[0].y,
       l[0].z,
@@ -520,7 +520,7 @@ class yo {
       l[3].y,
       l[3].z
       // 左上
-    ]), d = [0, 1, 2, 0, 2, 3], u = new Float32Array([
+    ]), d = [0, 1, 2, 0, 2, 3], c = new Float32Array([
       0,
       0,
       // 左下
@@ -534,9 +534,9 @@ class yo {
       1
       // 左上
     ]);
-    c.setAttribute("position", new x.BufferAttribute(h, 3)), c.setAttribute("uv", new x.BufferAttribute(u, 2)), c.setIndex(d), c.computeVertexNormals();
-    const f = new x.Mesh(c, r), w = new x.EdgesGeometry(c), y = new x.LineSegments(w, new x.LineBasicMaterial({ color: a }));
-    return s.add(y), f;
+    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,19 +549,19 @@ class yo {
     const s = [];
     if (!t || !t.start || !t.end || isNaN(t.rooftopPz))
       return s;
-    const a = new x.Vector3(t.start.x, t.start.y, t.start.z), l = new x.Vector3(t.end.x, t.end.y, t.end.z), c = new x.Vector3(t.end.x, t.end.y, t.rooftopPz), h = new x.Vector3(t.start.x, t.start.y, t.rooftopPz), d = [a, l, c, h];
+    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 u = a.distanceTo(l), f = Math.abs(t.rooftopPz - t.start.z);
-    if (u === 0 || f === 0)
+    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 = u / o, y = f / e, M = new x.Vector3().subVectors(l, a).normalize(), P = new x.Vector3(0, 0, 1);
+    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 x.Vector3().copy(a).add(M.clone().multiplyScalar(m * w)).add(P.clone().multiplyScalar(g * y)), b = new x.Vector3().copy(a).add(M.clone().multiplyScalar((m + 1) * w)).add(P.clone().multiplyScalar(g * y)), V = new x.Vector3().copy(a).add(M.clone().multiplyScalar((m + 1) * w)).add(P.clone().multiplyScalar((g + 1) * y)), v = new x.Vector3().copy(a).add(M.clone().multiplyScalar(m * w)).add(P.clone().multiplyScalar((g + 1) * y)), S = {
-            points: [p, b, V, v],
+          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 = {
@@ -570,7 +570,7 @@ class yo {
             col: m,
             originalMaterial: i,
             width: w,
-            height: y
+            height: x
           }, s.push(S);
         } catch (p) {
           console.error(`创建墙体小平面(${g}, ${m})时出错:`, p);
@@ -813,9 +813,9 @@ 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), c = e >= s, h = l >= a * 0.3;
+    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 d = !0;
-    return r < 0.5 && e > 0 && (d = this.checkSmallAreaDistribution(t, o, i)), c && h && d;
+    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;
@@ -845,9 +845,9 @@ class yo {
     if (!e || !e.attributes.position) return null;
     const o = e.attributes.position;
     if (o.count < 3) return null;
-    const i = new x.Vector3().fromBufferAttribute(o, 0), r = new x.Vector3().fromBufferAttribute(o, 1), s = new x.Vector3().fromBufferAttribute(o, 2);
+    const i = new y.Vector3().fromBufferAttribute(o, 0), r = new y.Vector3().fromBufferAttribute(o, 1), s = new y.Vector3().fromBufferAttribute(o, 2);
     i.applyMatrix4(t.matrixWorld), r.applyMatrix4(t.matrixWorld), s.applyMatrix4(t.matrixWorld);
-    const a = new x.Plane();
+    const a = new y.Plane();
     return a.setFromCoplanarPoints(i, r, s), a;
   }
   analyzePointDistribution(t, e, o = 0.01) {
@@ -867,25 +867,25 @@ class yo {
       if (s.userData && s.userData.type === "wallSegment") {
         const a = this.getWorldVerticesNew(s.points);
         if (a.length < 4) return;
-        const l = new x.Vector3().add(a[0]).add(a[1]).add(a[2]).add(a[3]).multiplyScalar(0.25);
+        const l = new y.Vector3().add(a[0]).add(a[1]).add(a[2]).add(a[3]).multiplyScalar(0.25);
         s.userData.center = l, s.vertices = a, r.push(s);
       }
     }), 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}`, [c, h, d, u] = s.vertices, f = new x.Vector3().subVectors(h, c).normalize(), w = new x.Vector3().subVectors(u, c).normalize(), y = c.distanceTo(h), M = c.distanceTo(u), P = new x.Plane();
-      P.setFromCoplanarPoints(c, h, u);
-      const g = y / 2, m = M / 2;
+      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 g = x / 2, m = P / 2;
       for (let p = 0; p < e.length; p++)
         this.isPointInWallSegmentOptimized(
           e[p],
           a,
-          P,
-          c,
+          M,
+          u,
           f,
           w,
-          y,
-          M,
+          x,
+          P,
           g,
           m,
           o
@@ -911,13 +911,13 @@ class yo {
     }), this.results.analysisTime = performance.now() - i, this.printAnalysisResults(), this.results;
   }
   // 优化后的判断函数（移出重复计算）
-  isPointInWallSegmentOptimized(t, e, o, i, r, s, a, l, c, h, d) {
+  isPointInWallSegmentOptimized(t, e, o, i, r, s, a, l, u, h, d) {
     if (Math.abs(o.distanceToPoint(t)) > d)
       return !1;
-    const f = new x.Vector3().subVectors(t, e), w = Math.abs(f.dot(r)), y = Math.abs(f.dot(s));
-    if (w > c && y > h)
+    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 M = new x.Vector3().subVectors(t, i), P = M.dot(r), g = M.dot(s), m = P >= -d && P <= a + d, p = g >= -d && g <= l + d;
+    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;
   }
   // 判断点是否在细分墙体平面内
@@ -932,13 +932,13 @@ class yo {
   }
   // 判断点是否在任意旋转的墙体平面内
   isPointInRotatedWall(t, e, o, i = 0.1) {
-    const [r, s, a, l] = t, c = new x.Plane();
-    if (c.setFromCoplanarPoints(r, s, l), Math.abs(c.distanceToPoint(e)) > i)
+    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 d = new x.Vector3().subVectors(s, r).normalize(), u = new x.Vector3().subVectors(l, r).normalize();
-    new x.Vector3().crossVectors(d, u).normalize();
-    const f = new x.Vector3().subVectors(e, r), w = f.dot(d), y = f.dot(u), M = r.distanceTo(s), P = r.distanceTo(l), g = w >= -i && w <= M + i, m = y >= -i && y <= P + i;
-    return g && m && o.distanceTo(e) < M / 2 && o.distanceTo(e) < P / 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) {
@@ -946,7 +946,7 @@ class yo {
       return t._cachedWorldVertices;
     const e = t.geometry.getAttribute("position"), o = [];
     for (let i = 0; i < Math.min(4, e.count); i++) {
-      const r = new x.Vector3();
+      const r = new y.Vector3();
       r.fromBufferAttribute(e, i), r.applyMatrix4(t.matrixWorld), o.push(r);
     }
     return t._cachedWorldVertices = o, t._cachedMatrixWorld = t.matrixWorld.clone(), o;
@@ -963,16 +963,16 @@ class yo {
   // 获取细分平面的边界信息
   getWallSegmentBounds(t) {
     if (!t.geometry) return null;
-    const e = t.geometry.getAttribute("position"), o = new x.Box3();
+    const e = t.geometry.getAttribute("position"), o = new y.Box3();
     for (let i = 0; i < e.count; i++) {
-      const r = new x.Vector3();
+      const r = new y.Vector3();
       r.fromBufferAttribute(e, i), r.applyMatrix4(t.matrixWorld), o.expandByPoint(r);
     }
     return {
       min: o.min.toArray(),
       max: o.max.toArray(),
-      center: o.getCenter(new x.Vector3()).toArray(),
-      size: o.getSize(new x.Vector3()).toArray()
+      center: o.getCenter(new y.Vector3()).toArray(),
+      size: o.getSize(new y.Vector3()).toArray()
     };
   }
   // 高亮没有点的平面
@@ -1012,16 +1012,16 @@ class yo {
       return;
     }
     const r = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map();
-    this.results.missingSegments.forEach((u) => {
-      r.set(u.segmentKey, u), s.has(u.row) || s.set(u.row, /* @__PURE__ */ new Map()), s.get(u.row).set(u.col, {
-        segmentKey: u.segmentKey,
+    this.results.missingSegments.forEach((c) => {
+      r.set(c.segmentKey, c), s.has(c.row) || s.set(c.row, /* @__PURE__ */ new Map()), s.get(c.row).set(c.col, {
+        segmentKey: c.segmentKey,
         isEmpty: !0,
         visited: !1
       });
-    }), t.forEach((u) => {
-      if (u.userData && u.userData.type === "wallSegment") {
-        const f = `row${u.userData.row}_col${u.userData.col}`, w = r.has(f);
-        s.has(u.userData.row) || s.set(u.userData.row, /* @__PURE__ */ new Map()), s.get(u.userData.row).has(u.userData.col) || s.get(u.userData.row).set(u.userData.col, {
+    }), t.forEach((c) => {
+      if (c.userData && c.userData.type === "wallSegment") {
+        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: f,
           isEmpty: w,
           visited: !1
@@ -1038,29 +1038,29 @@ class yo {
       [-1, 0]
       // 上
     ];
-    for (const [u, f] of r) {
+    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 y = [], M = [[f.row, f.col]];
-        for (w.visited = !0; M.length > 0; ) {
-          const [P, g] = M.shift(), m = `row${P}_col${g}`;
-          r.has(m) && y.push(r.get(m));
+        const x = [], P = [[f.row, f.col]];
+        for (w.visited = !0; P.length > 0; ) {
+          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 V = P + p, v = g + b;
-            if (s.has(V) && s.get(V).has(v)) {
-              const S = s.get(V).get(v);
-              !S.visited && S.isEmpty && (S.visited = !0, M.push([V, v]));
+            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]));
             }
           }
         }
-        y.length >= i && a.push(y);
+        x.length >= i && a.push(x);
       }
     }
-    const c = this.createClusterMaterials(a.length), h = [];
+    const u = this.createClusterMaterials(a.length), h = [];
     return this.clusterResults = {
-      clusters: a.sort((u, f) => f.length - u.length),
+      clusters: a.sort((c, f) => f.length - c.length),
       highlightedMeshes: h,
-      clusterMaterials: c,
+      clusterMaterials: u,
       totalClusters: a.length,
       totalHighlighted: h.length
     }, this.clusterResults;
@@ -1070,23 +1070,23 @@ class yo {
     let s = 0;
     const a = e;
     let l = !0;
-    for (let y = i; y <= r; y++)
-      t.has(a) && t.get(a).has(y) || (l = !1);
+    for (let x = i; x <= r; x++)
+      t.has(a) && t.get(a).has(x) || (l = !1);
     l && s++;
-    const c = o;
+    const u = o;
     let h = !0;
-    for (let y = i; y <= r; y++)
-      t.has(c) && t.get(c).has(y) || (h = !1);
+    for (let x = i; x <= r; x++)
+      t.has(u) && t.get(u).has(x) || (h = !1);
     h && s++;
     const d = i;
-    let u = !0;
-    for (let y = e; y <= o; y++)
-      t.has(y) && t.get(y).has(d) || (u = !1);
-    u && s++;
+    let c = !0;
+    for (let x = e; x <= o; x++)
+      t.has(x) && t.get(x).has(d) || (c = !1);
+    c && s++;
     const f = r;
     let w = !0;
-    for (let y = e; y <= o; y++)
-      t.has(y) && t.get(y).has(f) || (w = !1);
+    for (let x = e; x <= o; x++)
+      t.has(x) && t.get(x).has(f) || (w = !1);
     return w && s++, s / 4;
   }
   // 计算聚类质量分数
@@ -1096,20 +1096,20 @@ class yo {
   }
   // 计算严格的聚类边界尺寸（基于实际几何）
   calculateStrictClusterBounds(t) {
-    var d, u;
+    var d, c;
     if (t.length === 0) return { width: 0, height: 0 };
     const e = [];
     if (t.forEach((f) => {
       f.vertices && f.vertices.length > 0 && e.push(...f.vertices);
     }), e.length === 0) {
-      const f = [...new Set(t.map((y) => y.row))];
+      const f = [...new Set(t.map((x) => x.row))];
       return {
-        width: [...new Set(t.map((y) => y.col))].length * (((d = t[0].bounds) == null ? void 0 : d.width) || 1),
-        height: f.length * (((u = t[0].bounds) == null ? void 0 : u.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((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)), c = Math.abs(i - o), h = Math.max(Math.abs(s - r), Math.abs(l - a));
-    return { width: c, height: h };
+    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 };
   }
   // 创建不同颜色的聚类材质
   createClusterMaterials(t) {
@@ -1137,11 +1137,11 @@ class yo {
       "lightcoral"
     ];
     for (let i = 0; i < t; i++) {
-      const r = o[i % o.length], s = new x.MeshBasicMaterial({
+      const r = o[i % o.length], s = new y.MeshBasicMaterial({
         color: r,
         transparent: !0,
         opacity: 0.6,
-        side: x.DoubleSide
+        side: y.DoubleSide
       });
       e.push(s);
     }
@@ -1177,13 +1177,13 @@ class yo {
   }
   // 创建可视化调试助手
   createDebugHelpers(t) {
-    const e = new x.Group();
+    const e = new y.Group();
     return t.traverse((o) => {
       if (o.userData && o.userData.type === "wallSegment") {
         const i = this.getWorldVertices(o);
         if (i.length < 4) return;
-        const r = new x.Vector3().add(i[0]).add(i[1]).add(i[2]).add(i[3]).multiplyScalar(0.25), s = new x.Vector3().subVectors(i[1], i[0]).normalize(), a = new x.Vector3().subVectors(i[3], i[0]).normalize(), l = new x.Vector3().crossVectors(s, a).normalize(), c = new x.ArrowHelper(l, r, 0.3, 16711680), h = new x.ArrowHelper(s, r, 0.2, 65280), d = new x.ArrowHelper(a, r, 0.2, 255);
-        e.add(c), e.add(h), e.add(d);
+        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;
   }
@@ -1211,7 +1211,7 @@ class yo {
       o.forEach((a, l) => {
         a.applyMatrix4(e[l].matrixWorld);
       });
-      const i = io(o), r = e[0].material.clone(), s = new x.Mesh(i, r);
+      const i = io(o), r = e[0].material.clone(), s = new y.Mesh(i, r);
       return s.name = "mergedWalls", s;
     } catch (o) {
       return console.error("合并网格时出错:", o), null;
@@ -1239,35 +1239,35 @@ const xo = (n) => {
   for (let i = 0; i < n.length; i++) {
     const r = n[i];
     if (!r) continue;
-    let s = new x.Vector3(r.start.x, r.start.y, r.start.z);
-    s.applyEuler(new x.Euler(-Math.PI / 2, 0, 0));
-    let a = new x.Vector3(r.end.x, r.end.y, r.end.z);
-    if (a.applyEuler(new x.Euler(-Math.PI / 2, 0, 0)), t.add(ao(String(i), new x.Vector3((s.x + a.x) / 2, (s.y + a.y) / 2, (s.z + a.z) / 2))), (r.isBayWindow || r.isWindow) && e) continue;
-    const l = new no().setFromCoplanarPoints(new zt(r.start.x, r.start.y, r.start.z), new zt(r.end.x, r.end.y, r.end.z), new zt(r.start.x, r.start.y, r.rooftopPz)), c = [];
+    let s = new y.Vector3(r.start.x, r.start.y, r.start.z);
+    s.applyEuler(new y.Euler(-Math.PI / 2, 0, 0));
+    let a = new y.Vector3(r.end.x, r.end.y, r.end.z);
+    if (a.applyEuler(new y.Euler(-Math.PI / 2, 0, 0)), t.add(ao(String(i), new y.Vector3((s.x + a.x) / 2, (s.y + a.y) / 2, (s.z + a.z) / 2))), (r.isBayWindow || r.isWindow) && e) continue;
+    const l = new no().setFromCoplanarPoints(new zt(r.start.x, r.start.y, r.start.z), new zt(r.end.x, r.end.y, r.end.z), new zt(r.start.x, r.start.y, r.rooftopPz)), u = [];
     r.originalPoints.forEach((v, S) => {
-      const z = new zt();
-      l.projectPoint(v, z), c.push(z);
+      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)), d = Math.abs(r.rooftopPz - r.start.z), u = new x.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: x.DoubleSide,
+      side: y.DoubleSide,
       wireframe: !1,
       transparent: !0,
       opacity: 0.5
-    }), f = new x.Group(), w = new yo(), { horizontalSubdivisions: y, verticalSubdivisions: M } = w.initLimits4(h, d), P = w.createSubdividedWallPlane(r, M, y, u, f);
-    w.analyzePointDistribution(P, c, 0.01);
-    const g = new x.MeshBasicMaterial({
+    }), 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 g = new y.MeshBasicMaterial({
       color: "black",
       transparent: !0,
       opacity: 0.8,
-      side: x.DoubleSide
-    }), m = w.highlightEmptySegments(P, g, f), p = [];
+      side: y.DoubleSide
+    }), m = w.highlightEmptySegments(M, g, f), p = [];
     for (const v of m.clusters) {
       const S = xo(v);
       S && p.push(S);
     }
-    const V = wo(r).direction;
-    r.checkResults = p, r.verticalDirection = V, r.originaIndex = i, o.push(r);
+    const z = wo(r).direction;
+    r.checkResults = p, r.verticalDirection = z, r.originaIndex = i, o.push(r);
   }
   return o;
 }, xi = (n, t) => {
@@ -1275,38 +1275,38 @@ const xo = (n) => {
   for (let e = 0; e < n.length; e++) {
     const o = n[e], i = [];
     o.originalPoints.forEach((m) => {
-      let p = new x.Vector3(m.x, m.y, 0), b = !1;
-      for (let V = 0; V < i.length; V++)
-        if (kt(p, i[V], 0.01)) {
+      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;
           break;
         }
       b || i.push(p);
     });
     const r = Math.round(Math.max(5, Math.min(350, 20 * Math.sqrt(o.length)))), s = 1;
-    let a = new x.Vector3(o.start.x, o.start.y, o.start.z), l = new x.Vector3(o.end.x, o.end.y, o.end.z), c = new x.Vector3().subVectors(l, a).normalize(), h = c.clone().cross(new x.Vector3(0, 0, 1)).normalize(), d = h.clone().negate(), u = [];
+    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 m = 0; m < r; m++) {
       const p = [];
-      p.push(a.clone().addScaledVector(h, s)), p.push(p[0].clone().addScaledVector(c, w)), p.push(p[1].clone().addScaledVector(d, s * 2)), p.push(a.clone().addScaledVector(d, 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 V = 0; V < i.length; V++)
-        u.includes(V) || Po(i[V], p) && (u.push(V), b.push(i[V]));
-      b.length > 0 && f.push(Mo(b)), a = a.addScaledVector(c, w);
+      for (let z = 0; z < i.length; z++)
+        c.includes(z) || Po(i[z], p) && (c.push(z), b.push(i[z]));
+      b.length > 0 && f.push(Mo(b)), a = a.addScaledVector(u, w);
     }
-    const y = new Float32Array(i.length * 3);
+    const x = new Float32Array(i.length * 3);
     i.forEach((m, p) => {
-      y[p * 3] = m.x, y[p * 3 + 1] = m.y, y[p * 3 + 2] = m.z;
+      x[p * 3] = m.x, x[p * 3 + 1] = m.y, x[p * 3 + 2] = m.z;
     });
-    const M = new x.BufferGeometry();
-    M.setAttribute("position", new x.BufferAttribute(y, 3)), M.rotateX(-Math.PI / 2), t.add(new x.Points(M, new x.PointsMaterial({ color: go(), size: 0.02 })));
-    const [P, g] = vo(f, {
+    const P = new y.BufferGeometry();
+    P.setAttribute("position", new y.BufferAttribute(x, 3)), P.rotateX(-Math.PI / 2), t.add(new y.Points(P, new y.PointsMaterial({ color: go(), size: 0.02 })));
+    const [M, g] = vo(f, {
       plane: "xy",
       trimRatio: 0
     });
-    so(P, g, t);
+    so(M, g, t);
   }
 };
 function en(n, t = "xy") {
@@ -1328,7 +1328,7 @@ function Po(n, t, e = "xy") {
   const o = en(n, e), i = t.map((a) => en(a, e));
   let r = !1, s = !1;
   for (let a = 0; a < 4; a++) {
-    const l = i[a], c = i[(a + 1) % 4], h = bo(l, c, o);
+    const l = i[a], u = i[(a + 1) % 4], h = bo(l, u, o);
     if (h > 1e-9 && (r = !0), h < -1e-9 && (s = !0), r && s)
       return !1;
   }
@@ -1337,13 +1337,13 @@ function Po(n, t, e = "xy") {
 function Mo(n) {
   if (!n || n.length === 0)
     return null;
-  const t = new x.Vector3(0, 0, 0);
+  const t = new y.Vector3(0, 0, 0);
   for (const e of n)
     Array.isArray(e) ? (t.x += e[0], t.y += e[1], t.z += e[2]) : (t.x += e.x, t.y += e.y, t.z += e.z);
   return t.divideScalar(n.length), t;
 }
 function zo(n) {
-  return n instanceof x.Vector3 ? n.clone() : Array.isArray(n) ? new x.Vector3(n[0], n[1], n[2]) : new x.Vector3(n.x, n.y, n.z);
+  return n instanceof y.Vector3 ? n.clone() : Array.isArray(n) ? new y.Vector3(n[0], n[1], n[2]) : new y.Vector3(n.x, n.y, n.z);
 }
 function Vo(n, t = "xy") {
   const e = zo(n);
@@ -1369,22 +1369,22 @@ function Vo(n, t = "xy") {
 }
 function nn(n, t, e, o = "xy") {
   if (o === "xy")
-    return new x.Vector3(n, t, e);
+    return new y.Vector3(n, t, e);
   if (o === "xz")
-    return new x.Vector3(n, e, t);
+    return new y.Vector3(n, e, t);
   if (o === "yz")
-    return new x.Vector3(e, n, t);
+    return new y.Vector3(e, n, t);
   throw new Error(`Unsupported plane: ${o}`);
 }
 function So(n, t, e) {
   if (Math.abs(t) < 1e-12)
     return n >= e ? { x: 1, y: 0 } : { x: 0, y: 1 };
   const i = n + e, r = n * e - t * t, s = Math.sqrt(Math.max(0, i * i * 0.25 - r)), a = i * 0.5 + s;
-  let l = t, c = a - n;
-  const h = Math.hypot(l, c);
+  let l = t, u = a - n;
+  const h = Math.hypot(l, u);
   return h < 1e-12 ? { x: 1, y: 0 } : {
     x: l / h,
-    y: c / h
+    y: u / h
   };
 }
 function vo(n, t = {}) {
@@ -1401,18 +1401,18 @@ function vo(n, t = {}) {
   for (const B of i)
     r += B.x, s += B.y, a += B.up;
   r /= i.length, s /= i.length, a /= i.length;
-  let l = 0, c = 0, h = 0;
+  let l = 0, u = 0, h = 0;
   for (const B of i) {
     const L = B.x - r, N = B.y - s;
-    l += L * L, c += L * N, h += N * N;
+    l += L * L, u += L * N, h += N * N;
   }
-  l /= i.length, c /= i.length, h /= i.length;
-  const d = So(l, c, h), u = {
+  l /= i.length, u /= i.length, h /= i.length;
+  const d = So(l, u, h), c = {
     x: -d.y,
     y: d.x
   }, f = [];
   for (const B of i) {
-    const L = B.x - r, N = B.y - s, C = L * d.x + N * d.y, R = L * u.x + N * u.y;
+    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: R,
@@ -1421,15 +1421,15 @@ function vo(n, t = {}) {
   }
   f.sort((B, L) => B.s - L.s);
   const w = f.length;
-  let y = Math.floor(w * o), M = Math.ceil(w * (1 - o)) - 1;
-  y = Math.max(0, Math.min(w - 1, y)), M = Math.max(0, Math.min(w - 1, M));
-  const P = f[y], g = f[M], m = (() => {
+  let x = Math.floor(w * o), P = Math.ceil(w * (1 - o)) - 1;
+  x = Math.max(0, Math.min(w - 1, x)), P = Math.max(0, Math.min(w - 1, P));
+  const M = f[x], g = f[P], m = (() => {
     const B = f.map((N) => N.t).sort((N, C) => N - C), L = Math.floor(B.length / 2);
     return B.length % 2 === 0 ? (B[L - 1] + B[L]) * 0.5 : B[L];
   })(), p = (() => {
     const B = f.map((N) => N.up).sort((N, C) => N - C), L = Math.floor(B.length / 2);
     return B.length % 2 === 0 ? (B[L - 1] + B[L]) * 0.5 : B[L];
-  })(), b = P.s, V = g.s, v = m, S = m, z = p, D = p, _ = r + d.x * b + u.x * v, E = s + d.y * b + u.y * v, T = r + d.x * V + u.x * S, A = s + d.y * V + u.y * S, O = nn(_, E, z, e), I = nn(T, A, D, e);
+  })(), 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 wi = async (n, t, e, o, i) => {
@@ -1446,27 +1446,27 @@ const wi = async (n, t, e, o, i) => {
     if (!(!m.checkResults || m.checkResults.length <= 0)) {
       for (let b = 0; b < m.checkResults.length; b++) {
         let D = function(A) {
-          for (; z[A] !== A; )
-            z[A] = z[z[A]], A = z[A];
+          for (; V[A] !== A; )
+            V[A] = V[V[A]], A = V[A];
           return A;
         };
-        const V = m.checkResults[b];
-        if (V.isDoor = !1, !V.originalVertices || V.originalVertices.length == 0)
+        const z = m.checkResults[b];
+        if (z.isDoor = !1, !z.originalVertices || z.originalVertices.length == 0)
           continue;
         const v = [];
-        V.originalVertices.forEach((A) => {
+        z.originalVertices.forEach((A) => {
           let O = [];
           A.forEach((I) => {
-            O.push(new x.Vector3(I.x, I.y, I.z));
+            O.push(new y.Vector3(I.x, I.y, I.z));
           }), v.push(O);
         });
-        const S = v.length, z = Array.from({ length: S }, (A, O) => O);
+        const S = v.length, V = Array.from({ length: S }, (A, O) => O);
         for (let A = 0; A < S; A++)
           for (let O = A + 1; O < S; O++) {
             const I = v[A], B = v[O];
             if (I.some((N) => B.some((C) => N.equals(C)))) {
               const N = D(A), C = D(O);
-              N !== C && (z[N] = C);
+              N !== C && (V[N] = C);
             }
           }
         const _ = /* @__PURE__ */ new Map();
@@ -1484,11 +1484,11 @@ const wi = async (n, t, e, o, i) => {
           });
           const I = _.get(O);
           let [B, L, N, C] = v[A];
-          const R = new x.Vector3().add(B).add(L).add(N).add(C).multiplyScalar(0.25);
+          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 x.Vector3().subVectors(B, L).normalize();
+            let $ = new y.Vector3().subVectors(B, L).normalize();
             T = B.distanceTo(C), E = B.distanceTo(L);
-            let X = oe($, new x.Vector3(0, 0, 1));
+            let X = oe($, new y.Vector3(0, 0, 1));
             X && X.parallel && ([T, E] = [E, T]);
           }
           I.gridWidth = E, I.gridHeight = T;
@@ -1520,14 +1520,14 @@ const wi = async (n, t, e, o, i) => {
     if (p.isFindBeam = !1, p.category == "door") {
       let b = [];
       p.coordinatesByArea.coordinates.forEach((D) => {
-        b.push(new x.Vector3(D.x, D.y, D.z));
+        b.push(new y.Vector3(D.x, D.y, D.z));
       }), b[0].equals(b[b.length - 1]) && b.pop();
-      let V = b[0].distanceTo(b[1]), v = b[0].distanceTo(b[3]);
-      v > V && ([V, v] = [v, V], b = [b[0], b[3], b[2], b[1]]);
-      let S = ee(b[0], b[3], !0), z = ee(b[1], b[2], !0);
+      let z = b[0].distanceTo(b[1]), v = b[0].distanceTo(b[3]);
+      v > z && ([z, v] = [v, z], b = [b[0], b[3], b[2], b[1]]);
+      let S = ee(b[0], b[3], !0), V = ee(b[1], b[2], !0);
       a.push({
         doorStartPt: S,
-        doorEndPt: z,
+        doorEndPt: V,
         boxPoints: b,
         minZ: p.coordinatesByArea.heightData.minZ,
         maxZ: p.coordinatesByArea.heightData.maxZ,
@@ -1542,31 +1542,31 @@ const wi = async (n, t, e, o, i) => {
     const p = a[m];
     for (let b = 0; b < n.length; b++) {
       if (n[b].length < 0.5) continue;
-      let V = [];
+      let z = [];
       const v = ee(n[b].start, n[b].end, !0);
-      V.push(v), V.push(ee(v, n[b].start, !0)), V.push(ee(v, n[b].end, !0));
+      z.push(v), z.push(ee(v, n[b].start, !0)), z.push(ee(v, n[b].end, !0));
       let S = !1;
-      const z = p.boxPoints.length;
-      for (let D = 0; D < V.length; D++) {
-        const _ = V[D].x, E = V[D].y;
-        for (let T = 0, A = z - 1; T < z; A = T++) {
+      const V = p.boxPoints.length;
+      for (let D = 0; D < z.length; D++) {
+        const _ = z[D].x, E = z[D].y;
+        for (let T = 0, A = V - 1; T < V; A = T++) {
           const O = p.boxPoints[T].x, I = p.boxPoints[T].y, B = p.boxPoints[A].x, L = p.boxPoints[A].y;
           I > E != L > E && _ < (B - O) * (E - I) / (L - I) + O && (S = !S);
         }
         if (S) break;
       }
       if (S) {
-        let D = new x.Vector3(n[b].start.x, n[b].start.y, 0), _ = new x.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, _);
+        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 x.Vector3(n[b].start.x, n[b].start.y, 0), p.doorEndPt = new x.Vector3(n[b].end.x, n[b].end.y, 0);
+          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(T - E) > 1.3 && A && A.angleDeg < 15) {
-          let O = ne(p.doorStartPt, p.doorEndPt, D, _, { parallelAngleMax: x.MathUtils.degToRad(15) }), I = p.doorStartPt.distanceTo(D), B = p.doorStartPt.distanceTo(_), L = p.doorEndPt.distanceTo(D), N = p.doorEndPt.distanceTo(_), C = I < 0.2 || B < 0.2 || L < 0.2 || N < 0.2;
+          let O = ne(p.doorStartPt, p.doorEndPt, D, _, { parallelAngleMax: y.MathUtils.degToRad(15) }), I = p.doorStartPt.distanceTo(D), B = p.doorStartPt.distanceTo(_), 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 R = new x.Line3(D, _), $ = R.closestPointToPoint(p.doorStartPt, !0, new x.Vector3()), X = R.closestPointToPoint(p.doorEndPt, !0, new x.Vector3()), ot = $.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,20 +1577,20 @@ const wi = async (n, t, e, o, i) => {
         continue;
     }
   }
-  let l = 0, c = [], h = [], d = [];
-  const u = [];
+  let l = 0, u = [], h = [], d = [];
+  const c = [];
   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;
-    let b = new x.Box3();
+    let b = new y.Box3();
     b.setFromPoints(p.originalPoints);
-    let V = b.max.z;
+    let z = b.max.z;
     b.min.z;
-    const v = new x.Vector3(p.start.x, p.start.y, p.start.z), S = new x.Vector3(p.end.x, p.end.y, p.end.z);
-    let z = p.rooftopPz - p.start.z, D = 0;
+    const v = new y.Vector3(p.start.x, p.start.y, p.start.z), S = new y.Vector3(p.end.x, p.end.y, p.end.z);
+    let V = p.rooftopPz - p.start.z, D = 0;
     for (const E of p.mergeCheckRegion) {
       const { facePoints: T, boxArea: A, totalInPlaneNum: O } = co(
         E.points,
@@ -1603,9 +1603,9 @@ const wi = async (n, t, e, o, i) => {
       T[0].distanceTo(T[1]);
       let I = T[0].distanceTo(T[3]);
       const B = E.gridHeight * (I / E.gridHeight / 3 * 2) + E.gridHeight / 2;
-      let L = new x.Vector3(T[0].x, T[0].y, T[0].z + B), N = new x.Vector3(T[1].x, T[1].y, T[1].z + B);
-      const C = new x.Line3(L, N), R = [];
-      let $ = new x.Vector3();
+      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);
       });
@@ -1629,12 +1629,12 @@ const wi = async (n, t, e, o, i) => {
       const K = [];
       for (let rt = 0; rt < X.length; rt++) {
         const F = {
-          lineSt: new x.Vector3(),
-          lineEd: new x.Vector3(),
+          lineSt: new y.Vector3(),
+          lineEd: new y.Vector3(),
           facePoints: []
         };
         let H = Se(X[rt]);
-        Array.isArray(H) && H.length == 2 && (F.lineSt = H[0], F.lineEd = H[1], F.facePoints.push(new x.Vector3(H[0].x, H[0].y, T[0].z)), F.facePoints.push(new x.Vector3(H[1].x, H[1].y, T[0].z)), F.facePoints.push(new x.Vector3(H[1].x, H[1].y, T[2].z)), F.facePoints.push(new x.Vector3(H[0].x, H[0].y, T[2].z)), K.push(F));
+        Array.isArray(H) && H.length == 2 && (F.lineSt = H[0], F.lineEd = H[1], F.facePoints.push(new y.Vector3(H[0].x, H[0].y, T[0].z)), F.facePoints.push(new y.Vector3(H[1].x, H[1].y, T[0].z)), F.facePoints.push(new y.Vector3(H[1].x, H[1].y, T[2].z)), F.facePoints.push(new y.Vector3(H[0].x, H[0].y, T[2].z)), K.push(F));
       }
       D += E.area;
       let G = 0;
@@ -1642,7 +1642,7 @@ const wi = async (n, t, e, o, i) => {
         for (let rt = 0; rt < K.length; rt++) {
           const F = K[rt];
           let H = F.facePoints[0].distanceTo(F.facePoints[1]), Mt = F.facePoints[0].distanceTo(F.facePoints[3]), Zt = H / p.length * 100, qt = p.rooftopPz - F.facePoints[2].z;
-          if (Mt < 1.5 || V < F.facePoints[2].z || qt > z / 3 * 2)
+          if (Mt < 1.5 || z < F.facePoints[2].z || qt > V / 3 * 2)
             continue;
           let Rt = !1, _t = !1, Et = !1, Ft = [], tt = F.facePoints[2].clone(), lt = F.facePoints[3].clone(), W = F.facePoints[0].clone(), j = F.facePoints[1].clone(), Nt = !1, Tt = -1;
           if (Math.abs(F.facePoints[0].z - p.start.z) < 0.25) {
@@ -1654,11 +1654,11 @@ const wi = async (n, t, e, o, i) => {
                 if (Ut.forEach((Q) => {
                   Q.z >= tt.z ? at.push(Q) : Q.z <= W.z;
                 }), at.length > 10) {
-                  const Q = new x.Vector3(p.start.x, p.start.y, 0), gt = new x.Vector3(p.end.x, p.end.y, 0), Pt = new x.Vector3().subVectors(Q, gt).normalize();
-                  let Gt = new x.Vector3(), ht = 1 / 0, Z = -1, k = !1, ft = !1;
+                  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 == m) continue;
-                    const it = new x.Vector3(n[U].start.x, n[U].start.y, 0), dt = new x.Vector3(n[U].end.x, n[U].end.y, 0), Ct = te(Q, gt, it, dt);
+                    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) {
                       if (St && St.angle > 85) {
@@ -1671,22 +1671,22 @@ const wi = async (n, t, e, o, i) => {
                       continue;
                     }
                     if (St && St.angle > 85) {
-                      const Y = new x.Line3(it, dt).closestPointToPoint(Q, !0, Gt);
+                      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 x.Vector3().subVectors(dt, it).normalize(), vt = it.clone().addScaledVector(xt.clone().negate(), 0.03), Bt = dt.clone().addScaledVector(xt, 0.03);
+                      let xt = new y.Vector3().subVectors(dt, it).normalize(), vt = it.clone().addScaledVector(xt.clone().negate(), 0.03), Bt = dt.clone().addScaledVector(xt, 0.03);
                       const wt = te(et, st, vt, Bt);
                       if (wt == null) continue;
                       let Xt = Q.distanceTo(wt.point);
                       Xt < ht && (ht = Xt, Z = U);
                     } else if (St && St.angle < 5) {
-                      const At = new x.Vector3(W.x, W.y, 0), Y = new x.Vector3(j.x, j.y, 0);
+                      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++)
-                          Xt.push(new x.Vector3(
+                          Xt.push(new y.Vector3(
                             n[U].checkResults[wt].allCenterPoints[Kt].x,
                             n[U].checkResults[wt].allCenterPoints[Kt].y,
                             0
@@ -1722,11 +1722,11 @@ const wi = async (n, t, e, o, i) => {
                 if (Ut.forEach((Q) => {
                   Q.z >= tt.z ? at.push(Q) : Q.z <= W.z;
                 }), at.length > 10) {
-                  const Q = new x.Vector3(p.start.x, p.start.y, 0), gt = new x.Vector3(p.end.x, p.end.y, 0), Pt = new x.Vector3().subVectors(gt, Q).normalize();
-                  let Gt = new x.Vector3(), ht = 1 / 0, Z = -1, k = !1, ft = !1;
+                  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 == m) continue;
-                    const it = new x.Vector3(n[U].start.x, n[U].start.y, 0), dt = new x.Vector3(n[U].end.x, n[U].end.y, 0), Ct = te(Q, gt, it, dt);
+                    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) {
                       if (St && St.angle > 85 && (Ct.point.distanceTo(Q), Ct.point.distanceTo(gt) < 0.3)) {
@@ -1736,22 +1736,22 @@ const wi = async (n, t, e, o, i) => {
                       continue;
                     }
                     if (St && St.angle > 85) {
-                      const Y = new x.Line3(it, dt).closestPointToPoint(gt, !0, 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 x.Vector3().subVectors(dt, it).normalize(), vt = it.clone().addScaledVector(xt.clone().negate(), 0.03), Bt = dt.clone().addScaledVector(xt, 0.03);
+                      let xt = new y.Vector3().subVectors(dt, it).normalize(), vt = it.clone().addScaledVector(xt.clone().negate(), 0.03), Bt = dt.clone().addScaledVector(xt, 0.03);
                       const wt = te(et, st, vt, Bt);
                       if (wt == null) continue;
                       let Xt = gt.distanceTo(wt.point);
                       Xt < ht && (ht = Xt, Z = U);
                     } else if (St && St.angle < 5) {
-                      const At = new x.Vector3(W.x, W.y, 0), Y = new x.Vector3(j.x, j.y, 0);
+                      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++)
-                          Xt.push(new x.Vector3(
+                          Xt.push(new y.Vector3(
                             n[U].checkResults[wt].allCenterPoints[Kt].x,
                             n[U].checkResults[wt].allCenterPoints[Kt].y,
                             0
@@ -1784,18 +1784,18 @@ const wi = async (n, t, e, o, i) => {
               }
               H = lt.distanceTo(tt);
             }
-            if (Zt < 85 && H > 0.3 || H > 0.7 && Mt > z - z / 3) {
+            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 q = new x.Vector3(t[J].x, t[J].y, t[J].z), bt = new x.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 x.Vector3(q.x, q.y, 0),
-                  new x.Vector3(bt.x, bt.y, 0),
-                  new x.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0),
-                  new x.Vector3(F.facePoints[1].x, F.facePoints[1].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) {
                   Wt = !0;
@@ -1803,13 +1803,13 @@ const wi = async (n, t, e, o, i) => {
                 }
               }
               for (let J = 0; J < a.length; J++) {
-                let ct = new x.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), q = new x.Vector3(a[J].doorEndPt.x, a[J].doorEndPt.y, 0), bt = new x.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0), Vt = new x.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(), q.clone(), bt.clone(), Vt.clone(), {
                     distanceThreshold: 2
                   });
                   if (at && at.type == "collinear_gap") {
-                    let Q = ee(ct, q), gt = new x.Line3(new x.Vector3(p.start.x, p.start.y, 0), new x.Vector3(p.end.x, p.end.y, 0)), Pt = new x.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) {
@@ -1818,14 +1818,14 @@ const wi = async (n, t, e, o, i) => {
                           continue;
                       }
                       _t = !0, Et = !0, Ft.push(a[J].index), a[J].isFind = !0, Tt = J, e[a[J].index].isFindBeam = !0;
-                      let ft = new x.Vector3().subVectors(bt, Vt).normalize(), U = ct.distanceTo(q) - at.overlap;
+                      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 = q.distanceTo(ct);
                     if (Math.abs(Q - at.overlap) < 0.25 || Math.abs(gt - at.overlap) < 0.25) {
                       if (gt > Q && Math.abs(gt - at.overlap) > 1) {
-                        let Pt = bt.distanceTo(ct), Gt = bt.distanceTo(q), ht = Vt.distanceTo(ct), Z = Vt.distanceTo(q), k = Pt < Gt ? Pt : Gt, ft = ht < Z ? ht : Z, U = new x.Vector3().subVectors(bt, Vt).normalize(), it = gt - at.overlap;
+                        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, Et = !0, Ft.push(a[J].index), a[J].isFind = !0, e[a[J].index].isFindBeam = !0, Tt = J;
@@ -1836,10 +1836,10 @@ const wi = async (n, t, e, o, i) => {
               if (!Et && H < 1.5)
                 for (let J = 0; J < a.length; J++) {
                   if (a[J].inWall) continue;
-                  let ct = new x.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), q = new x.Vector3(a[J].doorEndPt.x, a[J].doorEndPt.y, 0), bt = new x.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0), Vt = new x.Vector3(F.facePoints[1].x, F.facePoints[1].y, 0), Ut = new x.Vector3().subVectors(ct, q).normalize(), at = new x.Vector3().subVectors(bt, Vt).normalize(), Q = 0.25, gt = ct.clone().addScaledVector(Ut, Q), Pt = q.clone().addScaledVector(Ut.clone().negate(), Q), Gt = bt.clone().addScaledVector(at, Q), ht = Vt.clone().addScaledVector(at.clone().negate(), Q), Z = te(gt, Pt, Gt, ht), k = !0, ft = ct.distanceTo(bt), U = ct.distanceTo(Vt), it = q.distanceTo(bt), dt = q.distanceTo(Vt);
+                  let ct = new y.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), q = new y.Vector3(a[J].doorEndPt.x, a[J].doorEndPt.y, 0), bt = new y.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0), Vt = new y.Vector3(F.facePoints[1].x, F.facePoints[1].y, 0), Ut = new y.Vector3().subVectors(ct, q).normalize(), at = new y.Vector3().subVectors(bt, Vt).normalize(), Q = 0.25, gt = ct.clone().addScaledVector(Ut, Q), Pt = q.clone().addScaledVector(Ut.clone().negate(), Q), Gt = bt.clone().addScaledVector(at, Q), ht = Vt.clone().addScaledVector(at.clone().negate(), Q), Z = te(gt, Pt, Gt, ht), k = !0, ft = ct.distanceTo(bt), U = ct.distanceTo(Vt), it = q.distanceTo(bt), dt = q.distanceTo(Vt);
                   (ft < f || U < f || it < f || dt < f || Z) && k && (e[a[J].index].isFindBeam = !0, _t = !0, a[J].isFind = !0, Tt = J);
                 }
-              (_t || Wt || Math.abs(Mt - z) > 0.1 && Mt > z / 2 && H > 0.3) && (Rt = !0);
+              (_t || Wt || Math.abs(Mt - V) > 0.1 && Mt > V / 2 && H > 0.3) && (Rt = !0);
             }
           }
           if (Rt) {
@@ -1860,13 +1860,13 @@ const wi = async (n, t, e, o, i) => {
               end: j
             });
             {
-              new x.PointsMaterial({ color: 65535, size: 0.01 });
-              let Z = new x.Vector3().subVectors(W, j), k = new x.Vector3().subVectors(j, W), ft = 1 / 0, U = 1 / 0, it = W.clone(), dt = j.clone();
+              new y.PointsMaterial({ color: 65535, size: 0.01 });
+              let Z = new y.Vector3().subVectors(W, j), k = new y.Vector3().subVectors(j, W), ft = 1 / 0, U = 1 / 0, it = W.clone(), dt = j.clone();
               const Ct = [], St = [];
-              let At = new x.Line3(tt, lt), Y = new x.Vector3(), pt = 999999;
+              let At = new y.Line3(tt, lt), Y = new y.Vector3(), pt = 999999;
               if (p.originalPoints.forEach((et) => {
                 if (et.z - W.z < Mt / 2 + 0.1 && et.z - W.z > Mt / 2 - 0.1 && Ct.push(et), et.z > tt.z) {
-                  let st = At.closestPointToPoint(et, !0, Y), xt = new x.Vector3().subVectors(st, tt), vt = new x.Vector3().subVectors(st, lt), Bt = oe(Z, vt), wt = oe(k, xt);
+                  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) {
@@ -1874,7 +1874,7 @@ const wi = async (n, t, e, o, i) => {
                 for (const st of et)
                   st.z = W.z;
                 et.forEach((st) => {
-                  let xt = new x.Vector3(st.x, st.y, W.z), vt = new x.Vector3().subVectors(xt, j), Bt = new x.Vector3().subVectors(xt, W), 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 $t = xt.distanceTo(W);
                     $t < ft && (ft = $t, it = xt);
@@ -1884,7 +1884,7 @@ const wi = async (n, t, e, o, i) => {
                   }
                 });
               }
-              if (it.equals(W) || (W = it, lt = new x.Vector3(W.x, W.y, lt.z)), dt.equals(j) || (j = dt, tt = new x.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, Y).distanceTo(et[st]);
@@ -1912,10 +1912,10 @@ const wi = async (n, t, e, o, i) => {
               isDoor: _t,
               isPullOutDoor: Et,
               pcbDoorIndexs: Ft,
-              beamNearWallVec: new x.Vector3(0, 0, 0)
-            }, bt = !1, Vt = new x.Vector3(), Ut = new x.Vector3(), at = -1, Q = -1, gt = -1;
-            for (let Z = 0; Z < c.length; Z++) {
-              const k = n[c[Z].linesIndex].doorAndBeamData[c[Z].doorIndex];
+              beamNearWallVec: new y.Vector3(0, 0, 0)
+            }, bt = !1, Vt = new y.Vector3(), Ut = new y.Vector3(), at = -1, Q = -1, gt = -1;
+            for (let Z = 0; Z < u.length; Z++) {
+              const k = n[u[Z].linesIndex].doorAndBeamData[u[Z].doorIndex];
               if (k.nearId != -1)
                 continue;
               let ft = Jt(
@@ -1925,38 +1925,38 @@ const wi = async (n, t, e, o, i) => {
                 k.beamEnd.clone()
               );
               if (ft && ft.isParallel) {
-                let U = tt.distanceTo(lt), it = k.beamStart.distanceTo(k.beamEnd), dt = new x.Line3(tt.clone(), lt.clone());
+                let U = tt.distanceTo(lt), it = k.beamStart.distanceTo(k.beamEnd), dt = new y.Line3(tt.clone(), lt.clone());
                 dt.start.z = 0, dt.end.z = 0;
                 let Ct = ee(k.beamStart, k.beamEnd, !0);
-                it > U && (dt.start = new x.Vector3(k.beamStart.x, k.beamStart.y, 0), dt.end = new x.Vector3(k.beamEnd.x, k.beamEnd.y, 0), Ct = ee(tt, lt, !0));
-                let St = new x.Vector3(), At = dt.closestPointToPoint(Ct, !0, St), Y = At.distanceTo(Ct), pt = new x.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);
+                it > U && (dt.start = new y.Vector3(k.beamStart.x, k.beamStart.y, 0), dt.end = new y.Vector3(k.beamEnd.x, k.beamEnd.y, 0), Ct = ee(tt, lt, !0));
+                let St = new y.Vector3(), At = dt.closestPointToPoint(Ct, !0, St), Y = At.distanceTo(Ct), pt = new y.Vector3().subVectors(Ct, At).normalize(), et = pt.clone().negate(), st = Ct.clone().addScaledVector(et, Y + 0.1), xt = te(dt.start, dt.end, Ct, st), vt = !_t && !k.isDoor && (U > it * 2 || it > U * 2);
                 if (Y < 0.4 && xt != null && !vt) {
                   k.nearId = l, q.nearId = k.id;
                   let Bt = 0.8;
                   (k.isDoor || q.isDoor) && (k.isDoor = !0, q.isDoor = !0);
                   const wt = Ft.some((Xt) => k.pcbDoorIndexs.includes(Xt));
-                  U < it ? U > Bt && !k.isPullOutDoor ? (k.beamStart = tt.clone().addScaledVector(et, Y), k.beamEnd = lt.clone().addScaledVector(et, Y), k.doorStart = W.clone().addScaledVector(et, Y), k.doorEnd = j.clone().addScaledVector(et, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : !Et || Et && k.isPullOutDoor && wt ? (q.beamStart = k.beamStart.clone().addScaledVector(pt, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(pt, Y), q.doorStart = k.doorStart.clone().addScaledVector(pt, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(pt, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight) : (k.beamStart = tt.clone().addScaledVector(et, Y), k.beamEnd = lt.clone().addScaledVector(et, Y), k.doorStart = W.clone().addScaledVector(et, Y), k.doorEnd = j.clone().addScaledVector(et, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : U > it && (it > Bt && !Et ? (q.beamStart = k.beamStart.clone().addScaledVector(et, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(et, Y), q.doorStart = k.doorStart.clone().addScaledVector(et, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(et, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight) : !k.isPullOutDoor || Et && k.isPullOutDoor && wt ? (k.beamStart = tt.clone().addScaledVector(pt, Y), k.beamEnd = lt.clone().addScaledVector(pt, Y), k.doorStart = W.clone().addScaledVector(pt, Y), k.doorEnd = j.clone().addScaledVector(pt, Y), k.doorHeight = q.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : (q.beamStart = k.beamStart.clone().addScaledVector(et, Y), q.beamEnd = k.beamEnd.clone().addScaledVector(et, Y), q.doorStart = k.doorStart.clone().addScaledVector(et, Y), q.doorEnd = k.doorEnd.clone().addScaledVector(et, Y), q.doorHeight = k.doorHeight, q.beamStart.z = q.beamEnd.z = q.doorStart.z + q.doorHeight)), at = q.nearId, Vt = k.beamStart.clone(), Ut = k.beamEnd.clone(), bt = !0, Q = c[Z].linesIndex, gt = c[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 x.Line3(W.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 == m) continue;
-                let ft = new x.Vector3(n[k].start.x, n[k].start.y, n[k].start.z), U = new x.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);
+                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 x.Line3(ft, U), xt = new x.Vector3(W.x, W.y, ft.z), vt = st.closestPointToPoint(xt, !0, new x.Vector3()), Bt = re(vt, xt, W, j);
-                    Bt && Bt.angle > 85 && (q.beamNearWallVec = new x.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 > W.z + 0.2 && st.z < W.z + Mt / 2 && St.push(new x.Vector3(st.x, st.y, W.z));
+                    st.z > W.z + 0.2 && st.z < W.z + Mt / 2 && St.push(new y.Vector3(st.x, st.y, W.z));
                   });
-                  const At = new x.Vector3();
+                  const At = new y.Vector3();
                   let Y = [], pt = [];
                   for (let st = 0; st < St.length; st++) {
                     let xt = Z.closestPointToPoint(St[st], !0, At);
@@ -1969,8 +1969,8 @@ const wi = async (n, t, e, o, i) => {
                   if (et.length == 2) {
                     let st = et[0].distanceTo(et[1]);
                     if (Math.abs(st - Z.distance()) < 0.3) {
-                      let xt = new x.Line3(ft, U), vt = new x.Vector3(W.x, W.y, ft.z), Bt = xt.closestPointToPoint(vt, !0, new x.Vector3());
-                      if (q.beamNearWallVec = new x.Vector3().subVectors(Bt, vt).normalize(), q.beamStart.z > Ct.maxZ - 0.03 && H > 1)
+                      let xt = new y.Line3(ft, U), vt = new y.Vector3(W.x, W.y, ft.z), Bt = xt.closestPointToPoint(vt, !0, new y.Vector3());
+                      if (q.beamNearWallVec = new y.Vector3().subVectors(Bt, vt).normalize(), q.beamStart.z > Ct.maxZ - 0.03 && H > 1)
                         Pt = !0;
                       else if (Wt = !0, Tt != -1 && (e[a[Tt].index].isFindBeam = !1, a[Tt].isFind = !1), Q != -1 && gt != -1) {
                         const wt = n[Q].doorAndBeamData[gt];
@@ -1991,9 +1991,9 @@ const wi = async (n, t, e, o, i) => {
             }
             let Gt = !1;
             if (at != -1)
-              for (let Z = 0; Z < u.length && !(u[Z].length == 1 && (u[Z][0].id == l ? (u[Z].push({ id: at, beamStart: Vt, beamEnd: Ut }), Gt = !0) : u[Z][0].id == at && (u[Z].push({ id: l, beamStart: tt, beamEnd: lt }), Gt = !0), Gt)); Z++)
+              for (let Z = 0; Z < c.length && !(c[Z].length == 1 && (c[Z][0].id == l ? (c[Z].push({ id: at, beamStart: Vt, beamEnd: Ut }), Gt = !0) : c[Z][0].id == at && (c[Z].push({ id: l, beamStart: tt, beamEnd: lt }), Gt = !0), Gt)); Z++)
                 ;
-            Gt || u.push([{ id: l, beamStart: tt, beamEnd: lt }]);
+            Gt || c.push([{ id: l, beamStart: tt, beamEnd: lt }]);
             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;
@@ -2007,7 +2007,7 @@ const wi = async (n, t, e, o, i) => {
                   if (Z) break;
                 }
             }
-            if (p.doorAndBeamData.push(q), c.push({
+            if (p.doorAndBeamData.push(q), u.push({
               linesIndex: m,
               doorIndex: p.doorAndBeamData.length - 1
             }), l++, Et && H < 2) break;
@@ -2021,11 +2021,11 @@ const wi = async (n, t, e, o, i) => {
     for (let m = 0; m < h.length; m++) {
       let p = [];
       for (let b = 0; b < n[h[m]].doorAndBeamData.length; b++) {
-        let V = !1;
-        if (n[h[m]].doorAndBeamData[b].type === "beam" && n[h[m]].doorAndBeamData[b].beamNearWallVec.x == 0 && n[h[m]].doorAndBeamData[b].beamNearWallVec.y == 0 && n[h[m]].doorAndBeamData[b].beamNearWallVec.z == 0 && n[h[m]].doorAndBeamData[b].nearId == -1 && (V = !0), !V) {
+        let z = !1;
+        if (n[h[m]].doorAndBeamData[b].type === "beam" && n[h[m]].doorAndBeamData[b].beamNearWallVec.x == 0 && n[h[m]].doorAndBeamData[b].beamNearWallVec.y == 0 && n[h[m]].doorAndBeamData[b].beamNearWallVec.z == 0 && n[h[m]].doorAndBeamData[b].nearId == -1 && (z = !0), !z) {
           let v = n[h[m]].doorAndBeamData[b].doorStart.clone(), S = n[h[m]].doorAndBeamData[b].doorEnd.clone();
           v.z = S.z = 0;
-          let z = v.distanceTo(S);
+          let V = v.distanceTo(S);
           for (let D = 0; D < h.length; D++)
             if (m != D)
               for (let _ = 0; _ < n[h[D]].doorAndBeamData.length; _++) {
@@ -2033,49 +2033,49 @@ const wi = async (n, t, e, o, i) => {
                 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 x.Line3(E, T), I = ee(v, S), B = O.closestPointToPoint(I, !0, new x.Vector3()), L = I.distanceTo(B);
-                  if (Math.abs(z - A.overlap) < 0.1 && L < 0.04) {
-                    n[h[D]].doorAndBeamData[_].nearId == n[h[m]].doorAndBeamData[b].id && (n[h[D]].doorAndBeamData[_].nearId = -1), V = !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;
                   }
                 }
               }
         }
-        V || p.push(n[h[m]].doorAndBeamData[b]);
+        z || p.push(n[h[m]].doorAndBeamData[b]);
       }
       p.length != n[h[m]].doorAndBeamData.length && (n[h[m]].doorAndBeamData = p);
     }
-  let w = 0.65, y = 2, M = [], P = [];
+  let w = 0.65, x = 2, P = [], M = [];
   for (let m = 0; m < a.length; m++) {
     if (a[m].isFind || a[m].inWall)
       continue;
-    let p = new x.Vector3(a[m].doorStartPt.x, a[m].doorStartPt.y, 0), b = new x.Vector3(a[m].doorEndPt.x, a[m].doorEndPt.y, 0), V = new x.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 x.Vector3(n[v].start.x, n[v].start.y, 0), z = new x.Vector3(n[v].end.x, n[v].end.y, 0), D = new x.Vector3().subVectors(S, z).normalize(), _ = 0.3, E = p.clone().addScaledVector(V, _), T = b.clone().addScaledVector(V.clone().negate(), _), A = S.clone().addScaledVector(D, _), O = z.clone().addScaledVector(D.clone().negate(), _);
+      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(
         E,
         T,
         A,
         O
-      ), B = p.distanceTo(S) > b.distanceTo(S) ? b : p, L = B.distanceTo(S), N = B.distanceTo(z);
+      ), 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(z), X = R < $ ? S : z, ot = !1;
+        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 || M.includes(K) || n[K].length < 0.7)
+          if (K == v || P.includes(K) || n[K].length < 0.7)
             continue;
-          let G = new x.Vector3(n[K].start.x, n[K].start.y, 0), ut = new x.Vector3(n[K].end.x, n[K].end.y, 0), rt = new x.Vector3().subVectors(G, ut).normalize(), F = rt.clone().negate(), H = G.clone().addScaledVector(rt, 5), Mt = ut.clone().addScaledVector(F, 5), Zt = re(S, z, G, ut), qt = ne(S, z, G, ut), Rt = te(S, z, H, Mt), _t = !0;
-          if (Rt != null && (_t = Rt.point.distanceTo(S) < f || Rt.point.distanceTo(z) < f), (Zt && Zt.angle > 85 || qt && qt.type == "collinear_gap") && _t) {
-            let Et = new x.Line3(S, z), Ft = new x.Vector3(), tt = Et.closestPointToPoint(G, !0, Ft), lt = Et.closestPointToPoint(ut, !0, Ft), W = tt.distanceTo(G), j = lt.distanceTo(ut), Nt, Tt;
+          let G = new y.Vector3(n[K].start.x, n[K].start.y, 0), ut = new y.Vector3(n[K].end.x, n[K].end.y, 0), rt = new y.Vector3().subVectors(G, ut).normalize(), F = rt.clone().negate(), H = G.clone().addScaledVector(rt, 5), Mt = ut.clone().addScaledVector(F, 5), Zt = re(S, 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 (W = X.distanceTo(G), j = X.distanceTo(ut), W > y && j > y)
+            if (W = X.distanceTo(G), j = X.distanceTo(ut), W > x && j > x)
               continue;
             let Wt = Jt(Nt, Tt, G, ut), J = Jt(Nt, Tt, E, T);
             if (J && J.isParallel || !Wt || !Wt.isParallel)
@@ -2085,8 +2085,8 @@ const wi = async (n, t, e, o, i) => {
               continue;
             Nt.z = Tt.z = n[K].start.z;
             let q = !1;
-            for (let at = 0; at < P.length; at++) {
-              let Q = ne(P[at].start, P[at].end, Nt, Tt);
+            for (let at = 0; at < M.length; at++) {
+              let Q = ne(M[at].start, M[at].end, Nt, Tt);
               if (Q && Q.type == "collinear_overlap" && Q.maxPerpendicularDistance < 0.2) {
                 q = !0;
                 break;
@@ -2096,7 +2096,7 @@ const wi = async (n, t, e, o, i) => {
               continue;
             for (let at = 0; at < n.length; at++) {
               if (n[at].length < 0.5) continue;
-              let Q = new x.Vector3(n[at].start.x, n[at].start.y, n[at].start.z), gt = new x.Vector3(n[at].end.x, n[at].end.y, n[at].end.z), Pt = ne(Q, gt, Nt, Tt);
+              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) {
                 q = !0;
                 break;
@@ -2104,10 +2104,10 @@ const wi = async (n, t, e, o, i) => {
             }
             if (q)
               continue;
-            P.push({
+            M.push({
               start: Nt,
               end: Tt
-            }), M.push(K);
+            }), 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,
@@ -2120,8 +2120,8 @@ const wi = async (n, t, e, o, i) => {
               nearId: -1,
               type: "onlyDoor",
               isDoor: !0,
-              beamNearWallVec: new x.Vector3(0, 0, 0)
-            }), e[a[m].index].isFindBeam = !0, e[a[m].index].isFindOnlyDoor = !0, u.push([{ id: l, beamStart: Nt, beamEnd: Tt }]), l++, ot = !0;
+              beamNearWallVec: new y.Vector3(0, 0, 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;
           }
         }
@@ -2132,7 +2132,7 @@ const wi = async (n, t, e, o, i) => {
   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: u };
+  return n.length = 0, n.push(...g), { lines: n, beamGroup: c };
 }, bi = (n, t) => {
   if (!n || n.length <= 0) return;
   let e = {
@@ -2141,54 +2141,54 @@ const wi = async (n, t, e, o, i) => {
   }, o = /* @__PURE__ */ new Set(), i = 0.2, r = 1.5, s = 0.15, a = 2;
   if (!n[0].uuid) {
     let l = 1e4;
-    for (let c = 0; c < n.length; c++)
-      n[c].uuid = l++;
+    for (let u = 0; u < n.length; u++)
+      n[u].uuid = l++;
   }
   for (let l = 0; l < n.length; l++) {
-    let c = n[l].length;
-    if (o.has(n[l].uuid) || c < i || c > r)
+    let u = n[l].length;
+    if (o.has(n[l].uuid) || u < i || u > r)
       continue;
-    let h = [], d = new x.Vector3(n[l].start.x, n[l].start.y, n[l].start.z), u = new x.Vector3(n[l].end.x, n[l].end.y, n[l].end.z), w = new x.Vector3().subVectors(u, d).normalize().clone().negate(), y = new x.Vector3(), M = new x.Vector3(), P = new x.Vector3();
-    new x.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 g = 0; g < n.length; g++) {
       let m = n[g].length;
       if (g == l || m < i || m > r)
         continue;
-      let p = new x.Vector3(n[g].start.x, n[g].start.y, n[g].start.z), b = new x.Vector3(n[g].end.x, n[g].end.y, n[g].end.z), V = re(d, u, p, b);
-      if (!V || V.angle < 85)
+      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, d), S = kt(p, u), z = kt(b, d), D = kt(b, u);
-      if (!(!v && !S && !z && !D)) {
-        v || S ? (y = p.clone(), M = b.clone()) : (y = b.clone(), M = p.clone()), P = new x.Vector3().subVectors(M, y).normalize(), P.clone().negate();
+      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 E = n[_].length;
           if (_ == l || _ == g || E < i || E > r)
             continue;
-          let T = new x.Vector3(n[_].start.x, n[_].start.y, n[_].start.z), A = new x.Vector3(n[_].end.x, n[_].end.y, n[_].end.z), O = re(p, b, T, A);
+          let T = new y.Vector3(n[_].start.x, n[_].start.y, n[_].start.z), A = new y.Vector3(n[_].end.x, n[_].end.y, n[_].end.z), O = re(p, b, T, A);
           if (!O || O.angle < 85)
             continue;
-          let I = kt(T, M), B = kt(A, M);
+          let I = kt(T, P), B = kt(A, P);
           if (!I && !B) continue;
-          new x.Vector3();
-          let L = new x.Vector3(), N = new x.Vector3();
-          I ? (N = new x.Vector3().subVectors(A, T).normalize(), T.clone(), L = A.clone()) : (N = new x.Vector3().subVectors(T, A).normalize(), A.clone(), L = T.clone());
+          new y.Vector3();
+          let L = new y.Vector3(), N = new y.Vector3();
+          I ? (N = new y.Vector3().subVectors(A, T).normalize(), T.clone(), L = A.clone()) : (N = new y.Vector3().subVectors(T, A).normalize(), A.clone(), L = T.clone());
           let C = oe(w, N, 0.1);
           if (!(!C || !C.parallel || !C.sameDirection)) {
             for (let R = 0; R < n.length; R++) {
               let $ = n[R].length;
               if (R == l || R == g || R == _ || $ < i || $ > r)
                 continue;
-              let X = new x.Vector3(n[R].start.x, n[R].start.y, n[R].start.z), ot = new x.Vector3(n[R].end.x, n[R].end.y, n[R].end.z), K = re(X, ot, T, A);
+              let X = new y.Vector3(n[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, L), ut = kt(ot, L);
               if (!G && !ut) continue;
-              new x.Vector3();
-              let rt = new x.Vector3();
+              new y.Vector3();
+              let rt = new y.Vector3();
               G ? (X.clone(), rt = ot.clone()) : (ot.clone(), rt = X.clone());
-              let F = kt(rt, d), H = kt(rt, u);
+              let F = kt(rt, d), H = kt(rt, c);
               if (!F && !H) continue;
-              let Mt = c * m;
+              let Mt = u * m;
               if (!(Mt < s || Mt > a)) {
                 h = [n[l].uuid, n[g].uuid, n[_].uuid, n[R].uuid];
                 break;
@@ -2205,81 +2205,81 @@ const wi = async (n, t, e, o, i) => {
     h.length == 4 && (h.forEach((g) => o.add(g)), e.rectangles.push(h));
   }
   for (let l = 0; l < n.length; l++) {
-    let c = n[l].length;
-    if (o.has(n[l].uuid) || c < i || c > r)
+    let u = n[l].length;
+    if (o.has(n[l].uuid) || u < i || u > r)
       continue;
     let h = {
       indexs: [],
       missingEdge: {
-        start: new x.Vector3(),
-        end: new x.Vector3()
+        start: new y.Vector3(),
+        end: new y.Vector3()
       }
-    }, d = new x.Vector3(n[l].start.x, n[l].start.y, n[l].start.z), u = new x.Vector3(n[l].end.x, n[l].end.y, n[l].end.z), f = !0, w = !0;
-    for (let P = 0; P < n.length; P++) {
-      if (P == l || n[P].length < i)
+    }, 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 g = new x.Vector3(n[P].start.x, n[P].start.y, n[P].start.z), m = new x.Vector3(n[P].end.x, n[P].end.y, n[P].end.z), p = kt(g, d), b = kt(m, d), V = kt(g, u), v = kt(m, u);
-      if (p || b ? f = !1 : (V || v) && (w = !1), !f && !w) break;
+      let g = new y.Vector3(n[M].start.x, n[M].start.y, n[M].start.z), m = new y.Vector3(n[M].end.x, n[M].end.y, n[M].end.z), p = kt(g, d), 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 (!f && !w) continue;
-    let y = new x.Vector3();
-    f || ([d, u] = [u, d]), y = new x.Vector3().subVectors(u, d).normalize();
-    let M = y.clone().negate();
-    for (let P = 0; P < n.length; P++) {
-      let g = n[P].length;
-      if (P == l || o.has(P) || g < i || g > r)
+    let x = new y.Vector3();
+    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 g = n[M].length;
+      if (M == l || o.has(M) || g < i || g > r)
         continue;
-      let m = new x.Vector3(n[P].start.x, n[P].start.y, n[P].start.z), p = new x.Vector3(n[P].end.x, n[P].end.y, n[P].end.z), b = re(d, u, m, 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 V = kt(m, u), v = kt(p, u);
-      if (!V && !v) continue;
-      new x.Vector3();
-      let S = new x.Vector3();
-      V ? (m.clone(), S = p.clone()) : (p.clone(), S = m.clone());
-      for (let z = 0; z < n.length; z++) {
-        let D = n[z].length;
-        if (z == l || z == P || o.has(z) || D < i || D > r)
+      let z = kt(m, c), v = kt(p, c);
+      if (!z && !v) continue;
+      new y.Vector3();
+      let S = new y.Vector3();
+      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 x.Vector3(n[z].start.x, n[z].start.y, n[z].start.z), E = new x.Vector3(n[z].end.x, n[z].end.y, n[z].end.z), T = re(m, p, _, E);
+        let _ = new y.Vector3(n[V].start.x, n[V].start.y, n[V].start.z), E = new y.Vector3(n[V].end.x, n[V].end.y, n[V].end.z), T = re(m, p, _, E);
         if (!T || T.angle < 85)
           continue;
         let A = kt(_, S), O = kt(E, S);
         if (!A && !O) continue;
-        let I = new x.Vector3(), B = new x.Vector3();
+        let I = new y.Vector3(), B = new y.Vector3();
         A ? (I = _.clone(), B = E.clone()) : (I = E.clone(), B = _.clone());
-        let L = new x.Vector3().subVectors(B, I).normalize(), N = oe(M, L, 0.1);
+        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 == z || n[X].length < i) continue;
-          let ot = new x.Vector3(n[X].start.x, n[X].start.y, n[X].start.z), K = new x.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 (X == V || n[X].length < i) continue;
+          let ot = new y.Vector3(n[X].start.x, n[X].start.y, n[X].start.z), K = new y.Vector3(n[X].end.x, n[X].end.y, n[X].end.z), G = kt(ot, _), ut = kt(K, _), rt = kt(ot, E), F = kt(K, E);
           if (G || ut ? C = !1 : (rt || F) && (R = !1), !C && !R) break;
         }
         if (!C && !R) continue;
-        let $ = c * g;
+        let $ = u * g;
         if (!($ < s || $ > a)) {
-          h.indexs = [n[l].uuid, n[P].uuid, n[z].uuid], h.missingEdge.start = B, h.missingEdge.end = d;
+          h.indexs = [n[l].uuid, n[M].uuid, n[V].uuid], h.missingEdge.start = B, h.missingEdge.end = d;
           break;
         }
       }
       if (h.indexs.length == 3) break;
     }
-    h.indexs.length == 3 && (h.indexs.forEach((P) => o.add(P)), e.threeEdgeRect.push(h));
+    h.indexs.length == 3 && (h.indexs.forEach((M) => o.add(M)), e.threeEdgeRect.push(h));
   }
   return e;
 }, ae = 11102230246251565e-32, Yt = 134217729, Do = (3 + 8 * ae) * ae;
 function qe(n, t, e, o, i) {
-  let r, s, a, l, c = t[0], h = o[0], d = 0, u = 0;
-  h > c == h > -c ? (r = c, c = t[++d]) : (r = h, h = o[++u]);
+  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 && u < e)
-    for (h > c == h > -c ? (s = c + r, a = r - (s - c), c = t[++d]) : (s = h + r, a = r - (s - h), h = o[++u]), r = s, a !== 0 && (i[f++] = a); d < n && u < e; )
-      h > c == h > -c ? (s = r + c, l = s - r, a = r - (s - l) + (c - l), c = t[++d]) : (s = r + h, l = s - r, a = r - (s - l) + (h - l), h = o[++u]), r = s, a !== 0 && (i[f++] = a);
+  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 + c, l = s - r, a = r - (s - l) + (c - l), c = t[++d], r = s, a !== 0 && (i[f++] = a);
-  for (; u < e; )
-    s = r + h, l = s - r, a = r - (s - l) + (h - l), h = o[++u], r = s, a !== 0 && (i[f++] = a);
+    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[f++] = a);
   return (r !== 0 || f === 0) && (i[f++] = r), f;
 }
 function _o(n, t) {
@@ -2292,22 +2292,22 @@ function Ve(n) {
 }
 const Eo = (3 + 16 * ae) * ae, To = (2 + 12 * ae) * ae, Ao = (9 + 64 * ae) * ae * ae, me = Ve(4), on = Ve(8), rn = Ve(12), sn = Ve(16), jt = Ve(4);
 function Bo(n, t, e, o, i, r, s) {
-  let a, l, c, h, d, u, f, w, y, M, P, g, m, p, b, V, v, S;
-  const z = n - i, D = e - i, _ = t - r, E = o - r;
-  p = z * E, u = Yt * z, f = u - (u - z), w = z - f, u = Yt * E, y = u - (u - E), M = E - y, b = w * M - (p - f * y - w * y - f * M), V = _ * D, u = Yt * _, f = u - (u - _), w = _ - f, u = Yt * D, y = u - (u - D), M = D - y, v = w * M - (V - f * y - w * y - f * M), P = b - v, d = b - P, me[0] = b - (P + d) + (d - v), g = p + P, d = g - p, m = p - (g - d) + (P - d), P = m - V, d = m - P, me[1] = m - (P + d) + (d - V), S = g + P, d = S - g, me[2] = g - (S - d) + (P - d), me[3] = S;
+  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 - z, a = n - (z + d) + (d - i), d = e - D, c = 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 && c === 0 && h === 0) || (A = Ao * s + Do * Math.abs(T), T += z * h + E * a - (_ * c + D * l), T >= A || -T >= A)) return T;
-  p = a * E, u = Yt * a, f = u - (u - a), w = a - f, u = Yt * E, y = u - (u - E), M = E - y, b = w * M - (p - f * y - w * y - f * M), V = l * D, u = Yt * l, f = u - (u - l), w = l - f, u = Yt * D, y = u - (u - D), M = D - y, v = w * M - (V - f * y - w * y - f * M), P = b - v, d = b - P, jt[0] = b - (P + d) + (d - v), g = p + P, d = g - p, m = p - (g - d) + (P - d), P = m - V, d = m - P, jt[1] = m - (P + d) + (d - V), S = g + P, d = S - g, jt[2] = g - (S - d) + (P - d), jt[3] = 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 = z * h, u = Yt * z, f = u - (u - z), w = z - f, u = Yt * h, y = u - (u - h), M = h - y, b = w * M - (p - f * y - w * y - f * M), V = _ * c, u = Yt * _, f = u - (u - _), w = _ - f, u = Yt * c, y = u - (u - c), M = c - y, v = w * M - (V - f * y - w * y - f * M), P = b - v, d = b - P, jt[0] = b - (P + d) + (d - v), g = p + P, d = g - p, m = p - (g - d) + (P - d), P = m - V, d = m - P, jt[1] = m - (P + d) + (d - V), S = g + P, d = S - g, jt[2] = g - (S - d) + (P - d), jt[3] = S;
+  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, u = Yt * a, f = u - (u - a), w = a - f, u = Yt * h, y = u - (u - h), M = h - y, b = w * M - (p - f * y - w * y - f * M), V = l * c, u = Yt * l, f = u - (u - l), w = l - f, u = Yt * c, y = u - (u - c), M = c - y, v = w * M - (V - f * y - w * y - f * M), P = b - v, d = b - P, jt[0] = b - (P + d) + (d - v), g = p + P, d = g - p, m = p - (g - d) + (P - d), P = m - V, d = m - P, jt[1] = m - (P + d) + (d - V), S = g + P, d = S - g, jt[2] = g - (S - d) + (P - d), jt[3] = S;
+  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, c = Math.abs(s + a);
-  return Math.abs(l) >= Eo * c ? l : -Bo(n, t, e, o, i, r, c);
+  const s = (t - r) * (e - i), a = (n - i) * (o - r), l = s - a, u = Math.abs(s + a);
+  return Math.abs(l) >= Eo * u ? l : -Bo(n, t, e, o, i, r, u);
 }
 const an = Math.pow(2, -52), De = new Uint32Array(512);
 class Be {
@@ -2348,57 +2348,57 @@ class Be {
    */
   update() {
     const { coords: t, _hullPrev: e, _hullNext: o, _hullTri: i, _hullHash: r } = this, s = t.length >> 1;
-    let a = 1 / 0, l = 1 / 0, c = -1 / 0, h = -1 / 0;
-    for (let z = 0; z < s; z++) {
-      const D = t[2 * z], _ = t[2 * z + 1];
-      D < a && (a = D), _ < l && (l = _), D > c && (c = D), _ > h && (h = _), this._ids[z] = z;
+    let a = 1 / 0, l = 1 / 0, u = -1 / 0, h = -1 / 0;
+    for (let V = 0; V < s; V++) {
+      const D = t[2 * V], _ = t[2 * V + 1];
+      D < a && (a = D), _ < l && (l = _), D > u && (u = D), _ > h && (h = _), this._ids[V] = V;
     }
-    const d = (a + c) / 2, u = (l + h) / 2;
-    let f = 0, w = 0, y = 0;
-    for (let z = 0, D = 1 / 0; z < s; z++) {
-      const _ = We(d, u, t[2 * z], t[2 * z + 1]);
-      _ < D && (f = z, D = _);
+    const d = (a + u) / 2, c = (l + h) / 2;
+    let f = 0, w = 0, x = 0;
+    for (let V = 0, D = 1 / 0; V < s; V++) {
+      const _ = We(d, c, t[2 * V], t[2 * V + 1]);
+      _ < D && (f = V, D = _);
     }
-    const M = t[2 * f], P = t[2 * f + 1];
-    for (let z = 0, D = 1 / 0; z < s; z++) {
-      if (z === f) continue;
-      const _ = We(M, P, t[2 * z], t[2 * z + 1]);
-      _ < D && _ > 0 && (w = z, D = _);
+    const P = t[2 * f], M = t[2 * f + 1];
+    for (let V = 0, D = 1 / 0; V < s; V++) {
+      if (V === f) continue;
+      const _ = We(P, M, t[2 * V], t[2 * V + 1]);
+      _ < D && _ > 0 && (w = V, D = _);
     }
     let g = t[2 * w], m = t[2 * w + 1], p = 1 / 0;
-    for (let z = 0; z < s; z++) {
-      if (z === f || z === w) continue;
-      const D = Co(M, P, g, m, t[2 * z], t[2 * z + 1]);
-      D < p && (y = z, p = D);
+    for (let V = 0; V < s; V++) {
+      if (V === f || V === w) continue;
+      const D = Co(P, M, g, m, t[2 * V], t[2 * V + 1]);
+      D < p && (x = V, p = D);
     }
-    let b = t[2 * y], V = t[2 * y + 1];
+    let b = t[2 * x], z = t[2 * x + 1];
     if (p === 1 / 0) {
       for (let _ = 0; _ < s; _++)
         this._dists[_] = t[2 * _] - t[0] || t[2 * _ + 1] - t[1];
       ye(this._ids, this._dists, 0, s - 1);
-      const z = new Uint32Array(s);
+      const V = new Uint32Array(s);
       let D = 0;
       for (let _ = 0, E = -1 / 0; _ < s; _++) {
         const T = this._ids[_], A = this._dists[T];
-        A > E && (z[D++] = T, E = A);
+        A > E && (V[D++] = T, E = A);
       }
-      this.hull = z.subarray(0, D), this.triangles = new Uint32Array(0), this.halfedges = new Int32Array(0);
+      this.hull = V.subarray(0, D), this.triangles = new Uint32Array(0), this.halfedges = new Int32Array(0);
       return;
     }
-    if (ve(M, P, g, m, b, V) < 0) {
-      const z = w, D = g, _ = m;
-      w = y, g = b, m = V, y = z, b = D, V = _;
+    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 = Lo(M, P, g, m, b, V);
+    const v = Lo(P, M, g, m, b, z);
     this._cx = v.x, this._cy = v.y;
-    for (let z = 0; z < s; z++)
-      this._dists[z] = We(t[2 * z], t[2 * z + 1], v.x, v.y);
+    for (let V = 0; V < s; V++)
+      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[f] = e[y] = w, o[w] = e[f] = y, o[y] = e[w] = f, i[f] = 0, i[w] = 1, i[y] = 2, r.fill(-1), r[this._hashKey(M, P)] = f, r[this._hashKey(g, m)] = w, r[this._hashKey(b, V)] = y, this.trianglesLen = 0, this._addTriangle(f, w, y, -1, -1, -1);
-    for (let z = 0, D = 0, _ = 0; z < this._ids.length; z++) {
-      const E = this._ids[z], T = t[2 * E], A = t[2 * E + 1];
-      if (z > 0 && Math.abs(T - D) <= an && Math.abs(A - _) <= an || (D = T, _ = A, E === f || E === w || E === y)) continue;
+    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 E = this._ids[V], T = t[2 * E], A = t[2 * E + 1];
+      if (V > 0 && Math.abs(T - D) <= an && Math.abs(A - _) <= an || (D = T, _ = A, E === f || E === w || E === x)) continue;
       let O = 0;
       for (let C = 0, R = this._hashKey(T, A); C < this._hashSize && (O = r[(R + C) % this._hashSize], !(O !== -1 && O !== o[O])); C++)
         ;
@@ -2421,8 +2421,8 @@ class Be {
       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 z = 0, D = this._hullStart; z < S; z++)
-      this.hull[z] = D, D = o[D];
+    for (let V = 0, D = this._hullStart; V < S; V++)
+      this.hull[V] = D, D = o[D];
     this.triangles = this._triangles.subarray(0, this.trianglesLen), this.halfedges = this._halfedges.subarray(0, this.trianglesLen);
   }
   /**
@@ -2451,20 +2451,20 @@ class Be {
         t = De[--r];
         continue;
       }
-      const c = a - a % 3, h = l + (t + 1) % 3, d = c + (a + 2) % 3, u = e[s], f = e[t], w = e[h], y = e[d];
+      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 * u],
-        i[2 * u + 1],
+        i[2 * c],
+        i[2 * c + 1],
         i[2 * f],
         i[2 * f + 1],
         i[2 * w],
         i[2 * w + 1],
-        i[2 * y],
-        i[2 * y + 1]
+        i[2 * x],
+        i[2 * x + 1]
       )) {
-        e[t] = y, e[a] = u;
-        const P = o[d];
-        if (P === -1) {
+        e[t] = x, e[a] = c;
+        const M = o[d];
+        if (M === -1) {
           let m = this._hullStart;
           do {
             if (this._hullTri[m] === d) {
@@ -2474,8 +2474,8 @@ class Be {
             m = this._hullPrev[m];
           } while (m !== this._hullStart);
         }
-        this._link(t, P), this._link(a, o[s]), this._link(s, d);
-        const g = c + (a + 1) % 3;
+        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;
@@ -2518,15 +2518,15 @@ function We(n, t, e, o) {
   return i * i + r * r;
 }
 function ko(n, t, e, o, i, r, s, a) {
-  const l = n - s, c = t - a, h = e - s, d = o - a, u = i - s, f = r - a, w = l * l + c * c, y = h * h + d * d, M = u * u + f * f;
-  return l * (d * M - y * f) - c * (h * M - y * u) + w * (h * f - d * u) < 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, c = r - t, h = s * s + a * a, d = l * l + c * c, u = 0.5 / (s * c - a * l), f = (c * h - a * d) * u, w = (s * d - l * h) * u;
+  const s = e - n, a = o - t, l = i - n, u = r - t, h = s * s + a * a, d = l * l + u * u, c = 0.5 / (s * u - a * l), f = (u * h - a * d) * c, w = (s * d - l * h) * c;
   return f * f + w * w;
 }
 function Lo(n, t, e, o, i, r) {
-  const s = e - n, a = o - t, l = i - n, c = r - t, h = s * s + a * a, d = l * l + c * c, u = 0.5 / (s * c - a * l), f = n + (c * h - a * d) * u, w = t + (s * d - l * h) * u;
+  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) {
@@ -2622,8 +2622,8 @@ 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 y = 0, M = 0, P = o.length, g, m; y < P; y += 3, M += 2) {
-      const p = o[y] * 2, b = o[y + 1] * 2, V = o[y + 2] * 2, v = t[p], S = t[p + 1], z = t[b], D = t[b + 1], _ = t[V], E = t[V + 1], T = z - v, A = D - S, O = _ - v, I = E - S, B = (T * 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;
@@ -2636,27 +2636,27 @@ class Oo {
         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[M] = g, a[M + 1] = m;
+      a[P] = g, a[P + 1] = m;
     }
-    let l = e[e.length - 1], c, h = l * 4, d, u = t[2 * l], f, 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 y = 0; y < e.length; ++y)
-      l = e[y], c = h, d = u, f = w, h = l * 4, u = t[2 * l], w = t[2 * l + 1], i[c + 2] = i[h] = f - w, i[c + 3] = i[h + 1] = u - d;
+    for (let x = 0; x < e.length; ++x)
+      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, d = o.length; h < d; ++h) {
-      const u = o[h];
-      if (u < h) continue;
-      const f = Math.floor(h / 3) * 2, w = Math.floor(u / 3) * 2, y = s[f], M = s[f + 1], P = s[w], g = s[w + 1];
-      this._renderSegment(y, M, P, g, t);
+      const c = o[h];
+      if (c < h) continue;
+      const f = Math.floor(h / 3) * 2, w = Math.floor(c / 3) * 2, x = s[f], P = s[f + 1], M = s[w], g = s[w + 1];
+      this._renderSegment(x, P, M, g, t);
     }
-    let l, c = r[r.length - 1];
+    let l, u = r[r.length - 1];
     for (let h = 0; h < r.length; ++h) {
-      l = c, c = r[h];
-      const d = Math.floor(i[c] / 3) * 2, u = s[d], f = s[d + 1], w = l * 4, y = this._project(u, f, a[w + 2], a[w + 3]);
-      y && this._renderSegment(u, f, y[0], y[1], t);
+      l = u, u = r[h];
+      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();
   }
@@ -2713,8 +2713,8 @@ class Oo {
     const a = [];
     let l = s;
     do {
-      const c = Math.floor(l / 3);
-      if (a.push(e[c * 2], e[c * 2 + 1]), l = l % 3 === 2 ? l - 2 : l + 1, r[l] !== t) break;
+      const u = Math.floor(l / 3);
+      if (a.push(e[u * 2], e[u * 2 + 1]), l = l % 3 === 2 ? l - 2 : l + 1, r[l] !== t) break;
       l = i[l];
     } while (l !== s && l !== -1);
     return a;
@@ -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], c, h = this._regioncode(a, l), d, u = 0;
+    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], c = h, h = this._regioncode(a, l), c === 0 && h === 0)
-        d = u, u = 0, i ? i.push(a, l) : i = [a, l];
+      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, y, M, P, g;
-        if (c === 0) {
-          if ((w = this._clipSegment(r, s, a, l, c, h)) === null) continue;
-          [y, M, P, g] = w;
+        let w, x, P, M, g;
+        if (u === 0) {
+          if ((w = this._clipSegment(r, s, a, l, u, h)) === null) continue;
+          [x, P, M, g] = w;
         } else {
-          if ((w = this._clipSegment(a, l, r, s, h, c)) === null) continue;
-          [P, g, y, M] = w, d = u, u = this._edgecode(y, M), d && u && this._edge(t, d, u, i, i.length), i ? i.push(y, M) : i = [y, M];
+          if ((w = this._clipSegment(a, l, r, s, h, u)) === null) continue;
+          [M, g, x, P] = w, d = c, c = this._edgecode(x, P), d && c && this._edge(t, d, c, i, i.length), i ? i.push(x, P) : i = [x, P];
         }
-        d = u, u = this._edgecode(P, g), d && u && this._edge(t, d, u, i, i.length), i ? i.push(P, g) : i = [P, g];
+        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)
-      d = u, u = this._edgecode(i[0], i[1]), d && u && this._edge(t, d, u, 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;
@@ -2755,15 +2755,15 @@ class Oo {
     for (a && ([t, e, o, i, r, s] = [o, i, t, e, s, r]); ; ) {
       if (r === 0 && s === 0) return a ? [o, i, t, e] : [t, e, o, i];
       if (r & s) return null;
-      let l, c, h = r || s;
-      h & 8 ? (l = t + (o - t) * (this.ymax - e) / (i - e), c = this.ymax) : h & 4 ? (l = t + (o - t) * (this.ymin - e) / (i - e), c = this.ymin) : h & 2 ? (c = e + (i - e) * (this.xmax - t) / (o - t), l = this.xmax) : (c = e + (i - e) * (this.xmin - t) / (o - t), l = this.xmin), r ? (t = l, e = c, r = this._regioncode(t, e)) : (o = l, i = c, s = this._regioncode(o, i));
+      let l, u, h = r || s;
+      h & 8 ? (l = t + (o - t) * (this.ymax - e) / (i - e), u = this.ymax) : h & 4 ? (l = t + (o - t) * (this.ymin - e) / (i - e), u = this.ymin) : h & 2 ? (u = e + (i - e) * (this.xmax - t) / (o - t), l = this.xmax) : (u = e + (i - e) * (this.xmin - t) / (o - t), l = this.xmin), r ? (t = l, e = u, r = this._regioncode(t, e)) : (o = l, i = u, s = this._regioncode(o, i));
     }
   }
   _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 c = 0, h = a.length, d, u = this._edgecode(a[h - 2], a[h - 1]); c < h; c += 2)
-        d = u, u = this._edgecode(a[c], a[c + 1]), d && u && (c = this._edge(t, d, u, a, c), 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;
   }
@@ -2866,21 +2866,21 @@ class ke {
   _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 }, (u, f) => f).sort((u, f) => e[2 * u] - e[2 * f] || e[2 * u + 1] - e[2 * f + 1]);
-      const l = this.collinear[0], c = this.collinear[this.collinear.length - 1], h = [e[2 * l], e[2 * l + 1], e[2 * c], e[2 * c + 1]], d = 1e-8 * Math.hypot(h[3] - h[1], h[2] - h[0]);
-      for (let u = 0, f = e.length / 2; u < f; ++u) {
-        const w = $o(e[2 * u], e[2 * u + 1], d);
-        e[2 * u] = w[0], e[2 * u + 1] = w[1];
+      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);
     } else
       delete this.collinear;
     const o = this.halfedges = this._delaunator.halfedges, i = this.hull = this._delaunator.hull, r = this.triangles = this._delaunator.triangles, s = this.inedges.fill(-1), a = this._hullIndex.fill(-1);
-    for (let l = 0, c = o.length; l < c; ++l) {
+    for (let l = 0, u = o.length; l < u; ++l) {
       const h = r[l % 3 === 2 ? l - 2 : l + 1];
       (o[l] === -1 || s[h] === -1) && (s[h] = l);
     }
-    for (let l = 0, c = i.length; l < c; ++l)
+    for (let l = 0, u = i.length; l < u; ++l)
       a[i[l]] = l;
     i.length <= 2 && i.length > 0 && (this.triangles = new Int32Array(3).fill(-1), this.halfedges = new Int32Array(3).fill(-1), this.triangles[0] = i[0], s[i[0]] = 1, i.length === 2 && (s[i[1]] = 0, this.triangles[1] = i[1], this.triangles[2] = i[1]));
   }
@@ -2896,15 +2896,15 @@ class ke {
     }
     const l = e[t];
     if (l === -1) return;
-    let c = l, h = -1;
+    let u = l, h = -1;
     do {
-      if (yield h = s[c], c = c % 3 === 2 ? c - 2 : c + 1, s[c] !== t) return;
-      if (c = r[c], c === -1) {
+      if (yield h = s[u], u = u % 3 === 2 ? u - 2 : u + 1, s[u] !== t) return;
+      if (u = r[u], u === -1) {
         const d = o[(i[t] + 1) % o.length];
         d !== h && (yield d);
         return;
       }
-    } while (c !== l);
+    } while (u !== l);
   }
   find(t, e, o = 0) {
     if (t = +t, t !== t || (e = +e, e !== e)) return -1;
@@ -2914,21 +2914,21 @@ class ke {
     return r;
   }
   _step(t, e, o) {
-    const { inedges: i, hull: r, _hullIndex: s, halfedges: a, triangles: l, points: c } = this;
-    if (i[t] === -1 || !c.length) return (t + 1) % (c.length >> 1);
-    let h = t, d = ge(e - c[t * 2], 2) + ge(o - c[t * 2 + 1], 2);
-    const u = i[t];
-    let f = u;
+    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, d = ge(e - u[t * 2], 2) + ge(o - u[t * 2 + 1], 2);
+    const c = i[t];
+    let f = c;
     do {
       let w = l[f];
-      const y = ge(e - c[w * 2], 2) + ge(o - c[w * 2 + 1], 2);
-      if (y < d && (d = y, h = w), f = f % 3 === 2 ? f - 2 : f + 1, l[f] !== t) break;
+      const x = ge(e - u[w * 2], 2) + ge(o - u[w * 2 + 1], 2);
+      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 - c[f * 2], 2) + ge(o - c[f * 2 + 1], 2) < d)
+        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 (f !== u);
+    } while (f !== c);
     return h;
   }
   render(t) {
@@ -2936,8 +2936,8 @@ class ke {
     for (let s = 0, a = i.length; s < a; ++s) {
       const l = i[s];
       if (l < s) continue;
-      const c = r[s] * 2, h = r[l] * 2;
-      t.moveTo(o[c], o[c + 1]), t.lineTo(o[h], o[h + 1]);
+      const u = r[s] * 2, h = r[l] * 2;
+      t.moveTo(o[u], o[u + 1]), t.lineTo(o[h], o[h + 1]);
     }
     return this.renderHull(t), e && e.value();
   }
@@ -2994,43 +2994,43 @@ function Go(n, t, e, o) {
   return 1 + (n[t][0] === 0 || n[e][0] === 0 || n[o][0] === 0 ? 1 : 0);
 }
 function jo(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), c = Math.abs((e - n) * (r - t) - (i - n) * (o - t)) / 2;
-  return c === 0 ? 1 / 0 : s * a * l / (4 * c);
+  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;
+  return u === 0 ? 1 / 0 : s * a * l / (4 * u);
 }
 function cn(n) {
   if (!n || n.length < 3) return [];
   const t = /* @__PURE__ */ new Set(), e = [];
   for (const w of n) {
-    const y = `${w[0]}_${w[1]}`;
-    t.has(y) || (t.add(y), e.push(w));
+    const x = `${w[0]}_${w[1]}`;
+    t.has(x) || (t.add(x), e.push(w));
   }
   if (e.length < 3) return [];
   const o = new ke(Float64Array.from(e.flat())), { triangles: i } = o;
   if (!i.length) return [];
-  const r = /* @__PURE__ */ new Map(), s = (w, y) => w < y ? `${w}_${y}` : `${y}_${w}`;
+  const r = /* @__PURE__ */ new Map(), s = (w, x) => w < x ? `${w}_${x}` : `${x}_${w}`;
   for (let w = 0; w < i.length; w += 3) {
-    const y = i[w], M = i[w + 1], P = i[w + 2], [g, m] = e[y], [p, b] = e[M], [V, v] = e[P], S = jo(g, m, p, b, V, v), z = Go(e, y, M, P);
-    if (S <= 1 / z)
-      for (const [D, _] of [[y, M], [M, P], [P, y]]) {
+    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 E = s(D, _);
         r.set(E, (r.get(E) || 0) + 1);
       }
   }
   const a = [];
-  for (const [w, y] of r) y === 1 && a.push(w.split("_").map(Number));
+  for (const [w, x] of r) x === 1 && a.push(w.split("_").map(Number));
   if (!a.length) return [];
   const l = /* @__PURE__ */ new Map();
-  for (const [w, y] of a)
-    (l.get(w) || l.set(w, []).get(w)).push(y), (l.get(y) || l.set(y, []).get(y)).push(w);
-  const c = a[0][0], h = [], d = /* @__PURE__ */ new Set();
-  let u = c, f = -1;
+  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 = [], d = /* @__PURE__ */ new Set();
+  let c = u, f = -1;
   do {
-    h.push(e[u]), d.add(u);
-    const w = l.get(u) || [];
-    let y = w.find((M) => M !== f && !d.has(M));
-    if (y === void 0 && (y = w.find((M) => M !== f)), y === void 0) break;
-    f = u, u = y;
-  } while (u !== c && h.length <= a.length + 1);
+    h.push(e[c]), d.add(c);
+    const w = l.get(c) || [];
+    let x = w.find((P) => P !== f && !d.has(P));
+    if (x === void 0 && (x = w.find((P) => P !== f)), x === void 0) break;
+    f = c, c = x;
+  } while (c !== u && h.length <= a.length + 1);
   return h;
 }
 const mt = {
@@ -3225,8 +3225,8 @@ let An = class {
     let o = Ot.set(e[0], e[1], e[2]).length();
     const i = Ot.set(e[4], e[5], e[6]).length(), r = Ot.set(e[8], e[9], e[10]).length();
     t.determinant() < 0 && (o = -o), Qt.setFromMatrix4(t);
-    const a = 1 / o, l = 1 / i, c = 1 / r;
-    return Qt.elements[0] *= a, Qt.elements[1] *= a, Qt.elements[2] *= a, Qt.elements[3] *= l, Qt.elements[4] *= l, Qt.elements[5] *= l, Qt.elements[6] *= c, Qt.elements[7] *= c, Qt.elements[8] *= c, this.rotation.multiply(Qt), this.halfSize.x *= o, this.halfSize.y *= i, this.halfSize.z *= r, Ot.setFromMatrixPosition(t), this.center.add(Ot), this;
+    const a = 1 / o, l = 1 / i, u = 1 / r;
+    return Qt.elements[0] *= a, Qt.elements[1] *= a, Qt.elements[2] *= a, Qt.elements[3] *= l, Qt.elements[4] *= l, Qt.elements[5] *= l, Qt.elements[6] *= u, Qt.elements[7] *= u, Qt.elements[8] *= u, this.rotation.multiply(Qt), this.halfSize.x *= o, this.halfSize.y *= i, this.halfSize.z *= r, Ot.setFromMatrixPosition(t), this.center.add(Ot), this;
   }
 };
 const Uo = new An();
@@ -3313,17 +3313,17 @@ function Qo(n) {
 }
 function Pe(n, t, e) {
   if (n !== null)
-    for (var o, i, r, s, a, l, c, h = 0, d = 0, u, f = n.type, w = f === "FeatureCollection", y = f === "Feature", M = w ? n.features.length : 1, P = 0; P < M; P++) {
-      c = w ? (
+    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[P].geometry
-      ) : y ? (
+        n.features[M].geometry
+      ) : x ? (
         // @ts-expect-error: Known type conflict
         n.geometry
-      ) : n, u = c ? c.type === "GeometryCollection" : !1, a = u ? c.geometries.length : 1;
+      ) : n, c = u ? u.type === "GeometryCollection" : !1, a = c ? u.geometries.length : 1;
       for (var g = 0; g < a; g++) {
         var m = 0, p = 0;
-        if (s = u ? c.geometries[g] : c, s !== null) {
+        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) {
@@ -3335,7 +3335,7 @@ function Pe(n, t, e) {
                 t(
                   l,
                   d,
-                  P,
+                  M,
                   m,
                   p
                 ) === !1
@@ -3351,7 +3351,7 @@ function Pe(n, t, e) {
                   t(
                     l[o],
                     d,
-                    P,
+                    M,
                     m,
                     p
                   ) === !1
@@ -3370,7 +3370,7 @@ function Pe(n, t, e) {
                     t(
                       l[o][i],
                       d,
-                      P,
+                      M,
                       m,
                       p
                     ) === !1
@@ -3391,7 +3391,7 @@ function Pe(n, t, e) {
                       t(
                         l[o][i][r],
                         d,
-                        P,
+                        M,
                         m,
                         p
                       ) === !1
@@ -3426,15 +3426,15 @@ function Jo(n) {
   }), t;
 }
 function tr(n, t) {
-  var e, o, i, r, s, a, l, c, h, d, u = 0, f = n.type === "FeatureCollection", w = n.type === "Feature", y = f ? n.features.length : 1;
-  for (e = 0; e < y; e++) {
+  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 = f ? (
       // @ts-expect-error: Known type conflict
       n.features[e].geometry
     ) : w ? (
       // @ts-expect-error: Known type conflict
       n.geometry
-    ) : n, c = f ? (
+    ) : n, u = f ? (
       // @ts-expect-error: Known type conflict
       n.features[e].properties
     ) : w ? (
@@ -3459,8 +3459,8 @@ function tr(n, t) {
           t(
             // @ts-expect-error: Known type conflict
             null,
-            u,
             c,
+            u,
             h,
             d
           ) === !1
@@ -3479,8 +3479,8 @@ function tr(n, t) {
             // @ts-expect-error: Known type conflict
             t(
               r,
-              u,
               c,
+              u,
               h,
               d
             ) === !1
@@ -3494,8 +3494,8 @@ function tr(n, t) {
               // @ts-expect-error: Known type conflict
               t(
                 r.geometries[o],
-                u,
                 c,
+                u,
                 h,
                 d
               ) === !1
@@ -3507,7 +3507,7 @@ function tr(n, t) {
           throw new Error("Unknown Geometry Type");
       }
     }
-    u++;
+    c++;
   }
 }
 function er(n, t, e) {
@@ -3555,21 +3555,21 @@ var Ze = { exports: {} }, On = { exports: {} };
   (function(e, o) {
     n.exports = o();
   })(Fn, function() {
-    function e(g, m, p, b, V) {
-      (function v(S, z, D, _, E) {
+    function e(g, m, p, b, z) {
+      (function v(S, V, D, _, E) {
         for (; _ > D; ) {
           if (_ - D > 600) {
-            var T = _ - D + 1, A = z - D + 1, O = Math.log(T), I = 0.5 * Math.exp(2 * O / 3), B = 0.5 * Math.sqrt(O * I * (T - I) / T) * (A - T / 2 < 0 ? -1 : 1), L = Math.max(D, Math.floor(z - A * I / T + B)), N = Math.min(_, Math.floor(z + (T - A) * I / T + B));
-            v(S, z, L, N, E);
+            var T = _ - D + 1, A = V - D + 1, O = Math.log(T), I = 0.5 * Math.exp(2 * O / 3), B = 0.5 * Math.sqrt(O * I * (T - I) / T) * (A - T / 2 < 0 ? -1 : 1), 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[z], R = D, $ = _;
-          for (o(S, D, z), E(S[_], C) > 0 && o(S, D, _); R < $; ) {
+          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; ) $--;
           }
-          E(S[D], C) === 0 ? o(S, D, $) : o(S, ++$, _), $ <= z && (D = $ + 1), z <= $ && (_ = $ - 1);
+          E(S[D], C) === 0 ? o(S, D, $) : o(S, ++$, _), $ <= V && (D = $ + 1), V <= $ && (_ = $ - 1);
         }
-      })(g, m, p || 0, b || g.length - 1, V || i);
+      })(g, m, p || 0, b || g.length - 1, z || i);
     }
     function o(g, m, p) {
       var b = g[m];
@@ -3589,15 +3589,15 @@ var Ze = { exports: {} }, On = { exports: {} };
     function a(g, m) {
       l(g, 0, g.children.length, m, g);
     }
-    function l(g, m, p, b, V) {
-      V || (V = M(null)), V.minX = 1 / 0, V.minY = 1 / 0, V.maxX = -1 / 0, V.maxY = -1 / 0;
+    function l(g, m, p, b, z) {
+      z || (z = P(null)), z.minX = 1 / 0, z.minY = 1 / 0, z.maxX = -1 / 0, z.maxY = -1 / 0;
       for (var v = m; v < p; v++) {
         var S = g.children[v];
-        c(V, g.leaf ? b(S) : S);
+        u(z, g.leaf ? b(S) : S);
       }
-      return V;
+      return z;
     }
-    function c(g, m) {
+    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(g, m) {
@@ -3606,7 +3606,7 @@ var Ze = { exports: {} }, On = { exports: {} };
     function d(g, m) {
       return g.minY - m.minY;
     }
-    function u(g) {
+    function c(g) {
       return (g.maxX - g.minX) * (g.maxY - g.minY);
     }
     function f(g) {
@@ -3615,40 +3615,40 @@ var Ze = { exports: {} }, On = { exports: {} };
     function w(g, m) {
       return g.minX <= m.minX && g.minY <= m.minY && m.maxX <= g.maxX && m.maxY <= g.maxY;
     }
-    function y(g, m) {
+    function x(g, m) {
       return m.minX <= g.maxX && m.minY <= g.maxY && m.maxX >= g.minX && m.maxY >= g.minY;
     }
-    function M(g) {
+    function P(g) {
       return { children: g, height: 1, leaf: !0, minX: 1 / 0, minY: 1 / 0, maxX: -1 / 0, maxY: -1 / 0 };
     }
-    function P(g, m, p, b, V) {
+    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, V), v.push(m, S, S, p);
+        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(g) {
       var m = this.data, p = [];
-      if (!y(g, m)) return p;
-      for (var b = this.toBBox, V = []; m; ) {
+      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], z = m.leaf ? b(S) : S;
-          y(g, z) && (m.leaf ? p.push(S) : w(g, z) ? this._all(S, p) : V.push(S));
+          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));
         }
-        m = V.pop();
+        m = z.pop();
       }
       return p;
     }, r.prototype.collides = function(g) {
       var m = this.data;
-      if (!y(g, m)) return !1;
+      if (!x(g, m)) return !1;
       for (var p = []; m; ) {
         for (var b = 0; b < m.children.length; b++) {
-          var V = m.children[b], v = m.leaf ? this.toBBox(V) : V;
-          if (y(g, v)) {
+          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(V);
+            p.push(z);
           }
         }
         m = p.pop();
@@ -3674,15 +3674,15 @@ var Ze = { exports: {} }, On = { exports: {} };
     }, r.prototype.insert = function(g) {
       return g && this._insert(g, this.data.height - 1), this;
     }, r.prototype.clear = function() {
-      return this.data = M([]), this;
+      return this.data = P([]), this;
     }, r.prototype.remove = function(g, m) {
       if (!g) return this;
-      for (var p, b, V, v = this.data, S = this.toBBox(g), z = [], D = []; v || z.length; ) {
-        if (v || (v = z.pop(), b = z[z.length - 1], p = D.pop(), V = !0), v.leaf) {
+      for (var p, b, z, v = this.data, S = this.toBBox(g), V = [], D = []; v || V.length; ) {
+        if (v || (v = V.pop(), b = V[V.length - 1], p = D.pop(), z = !0), v.leaf) {
           var _ = s(g, v.children, m);
-          if (_ !== -1) return v.children.splice(_, 1), z.push(v), this._condense(z), this;
+          if (_ !== -1) return v.children.splice(_, 1), V.push(v), this._condense(V), this;
         }
-        V || v.leaf || !w(v, S) ? b ? (p++, v = b.children[p], V = !1) : v = null : (z.push(v), D.push(p), p = 0, b = v, v = v.children[0]);
+        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(g) {
@@ -3699,63 +3699,63 @@ var Ze = { exports: {} }, On = { exports: {} };
       for (var p = []; g; ) g.leaf ? m.push.apply(m, g.children) : p.push.apply(p, g.children), g = p.pop();
       return m;
     }, r.prototype._build = function(g, m, p, b) {
-      var V, v = p - m + 1, S = this._maxEntries;
-      if (v <= S) return a(V = M(g.slice(m, p + 1)), this.toBBox), V;
-      b || (b = Math.ceil(Math.log(v) / Math.log(S)), S = Math.ceil(v / Math.pow(S, b - 1))), (V = M([])).leaf = !1, V.height = b;
-      var z = Math.ceil(v / S), D = z * Math.ceil(Math.sqrt(S));
-      P(g, m, p, D, this.compareMinX);
+      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(g, m, p, D, this.compareMinX);
       for (var _ = m; _ <= p; _ += D) {
         var E = Math.min(_ + D - 1, p);
-        P(g, _, E, z, this.compareMinY);
-        for (var T = _; T <= E; T += z) {
-          var A = Math.min(T + z - 1, E);
-          V.children.push(this._build(g, T, A, b - 1));
+        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(V, this.toBBox), V;
+      return a(z, this.toBBox), z;
     }, r.prototype._chooseSubtree = function(g, m, p, b) {
       for (; b.push(m), !m.leaf && b.length - 1 !== p; ) {
-        for (var V = 1 / 0, v = 1 / 0, S = void 0, z = 0; z < m.children.length; z++) {
-          var D = m.children[z], _ = u(D), E = (T = g, A = D, (Math.max(A.maxX, T.maxX) - Math.min(A.minX, T.minX)) * (Math.max(A.maxY, T.maxY) - Math.min(A.minY, T.minY)) - _);
-          E < v ? (v = E, V = _ < V ? _ : V, S = D) : E === v && _ < V && (V = _, S = D);
+        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);
         }
         m = S || m.children[0];
       }
       var T, A;
       return m;
     }, r.prototype._insert = function(g, m, p) {
-      var b = p ? g : this.toBBox(g), V = [], v = this._chooseSubtree(b, this.data, m, V);
-      for (v.children.push(g), c(v, b); m >= 0 && V[m].children.length > this._maxEntries; ) this._split(V, m), m--;
-      this._adjustParentBBoxes(b, V, m);
+      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, V = this._minEntries;
-      this._chooseSplitAxis(p, V, b);
-      var v = this._chooseSplitIndex(p, V, b), S = M(p.children.splice(v, p.children.length - v));
+      var p = g[m], b = p.children.length, z = this._minEntries;
+      this._chooseSplitAxis(p, z, b);
+      var v = this._chooseSplitIndex(p, z, b), S = P(p.children.splice(v, p.children.length - v));
       S.height = p.height, S.leaf = p.leaf, a(p, this.toBBox), a(S, this.toBBox), m ? g[m - 1].children.push(S) : this._splitRoot(p, S);
     }, r.prototype._splitRoot = function(g, m) {
-      this.data = M([g, m]), this.data.height = g.height + 1, this.data.leaf = !1, a(this.data, this.toBBox);
+      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, V, v, S, z, D, _, E = 1 / 0, T = 1 / 0, A = m; A <= p - m; A++) {
-        var O = l(g, 0, A, this.toBBox), I = l(g, A, p, this.toBBox), B = (V = O, v = I, S = void 0, z = void 0, D = void 0, _ = void 0, S = Math.max(V.minX, v.minX), z = Math.max(V.minY, v.minY), D = Math.min(V.maxX, v.maxX), _ = Math.min(V.maxY, v.maxY), Math.max(0, D - S) * Math.max(0, _ - z)), L = u(O) + u(I);
+      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 - m;
     }, r.prototype._chooseSplitAxis = function(g, m, p) {
-      var b = g.leaf ? this.compareMinX : h, V = g.leaf ? this.compareMinY : d;
-      this._allDistMargin(g, m, p, b) < this._allDistMargin(g, m, p, V) && g.children.sort(b);
+      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 V = this.toBBox, v = l(g, 0, m, V), S = l(g, p - m, p, V), z = f(v) + f(S), D = m; D < p - m; D++) {
+      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];
-        c(v, g.leaf ? V(_) : _), z += f(v);
+        u(v, g.leaf ? z(_) : _), V += f(v);
       }
       for (var E = p - m - 1; E >= m; E--) {
         var T = g.children[E];
-        c(S, g.leaf ? V(T) : T), z += f(S);
+        u(S, g.leaf ? z(T) : T), V += f(S);
       }
-      return z;
+      return V;
     }, r.prototype._adjustParentBBoxes = function(g, m, p) {
-      for (var b = p; b >= 0; b--) c(m[b], g);
+      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;
@@ -3808,17 +3808,17 @@ const ar = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
 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, c = 0, h = l - 1; c < l; h = c++) {
-    var d = e[o + c * 2 + 0], u = e[o + c * 2 + 1], f = e[o + h * 2 + 0], w = e[o + h * 2 + 1], y = u > s != w > s && r < (f - d) * (s - u) / (w - u) + d;
-    y && (a = !a);
+  for (var l = (i - o) / 2, u = 0, h = l - 1; u < l; h = u++) {
+    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;
 }, ur = 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, c = 0, h = l - 1; c < l; h = c++) {
-    var d = e[c + o][0], u = e[c + o][1], f = e[h + o][0], w = e[h + o][1], y = u > s != w > s && r < (f - d) * (s - u) / (w - u) + d;
-    y && (a = !a);
+  for (var l = i - o, u = 0, h = l - 1; u < l; h = u++) {
+    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;
 }, Nn = cr, qn = ur;
@@ -3833,43 +3833,43 @@ var hr = Ce.exports, Ue = { exports: {} };
     o(t);
   })(Fn, function(e) {
     const i = 33306690738754706e-32;
-    function r(y, M, P, g, m) {
-      let p, b, V, v, S = M[0], z = g[0], D = 0, _ = 0;
-      z > S == z > -S ? (p = S, S = M[++D]) : (p = z, z = g[++_]);
+    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 < y && _ < P) for (z > S == z > -S ? (V = p - ((b = S + p) - S), S = M[++D]) : (V = p - ((b = z + p) - z), z = g[++_]), p = b, V !== 0 && (m[E++] = V); D < y && _ < P; ) z > S == z > -S ? (V = p - ((b = p + S) - (v = b - p)) + (S - v), S = M[++D]) : (V = p - ((b = p + z) - (v = b - p)) + (z - v), z = g[++_]), p = b, V !== 0 && (m[E++] = V);
-      for (; D < y; ) V = p - ((b = p + S) - (v = b - p)) + (S - v), S = M[++D], p = b, V !== 0 && (m[E++] = V);
-      for (; _ < P; ) V = p - ((b = p + z) - (v = b - p)) + (z - v), z = g[++_], p = b, V !== 0 && (m[E++] = V);
+      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(y) {
-      return new Float64Array(y);
+    function s(x) {
+      return new Float64Array(x);
     }
-    const a = 33306690738754716e-32, l = 22204460492503146e-32, c = 11093356479670487e-47, h = s(4), d = s(8), u = s(12), f = s(16), w = s(4);
-    e.orient2d = function(y, M, P, g, m, p) {
-      const b = (M - p) * (P - m), V = (y - m) * (g - p), v = b - V;
-      if (b === 0 || V === 0 || b > 0 != V > 0) return v;
-      const S = Math.abs(b + V);
-      return Math.abs(v) >= a * S ? v : -function(z, D, _, E, T, A, O) {
+    const a = 33306690738754716e-32, l = 22204460492503146e-32, u = 11093356479670487e-47, h = s(4), d = s(8), c = s(12), f = s(16), w = s(4);
+    e.orient2d = function(x, P, M, g, m, p) {
+      const b = (P - p) * (M - m), z = (x - m) * (g - p), v = b - z;
+      if (b === 0 || z === 0 || b > 0 != z > 0) return v;
+      const S = Math.abs(b + z);
+      return Math.abs(v) >= a * S ? v : -function(V, D, _, E, T, A, O) {
         let I, B, L, N, C, R, $, X, ot, K, G, ut, rt, F, H, Mt, Zt, qt;
-        const Rt = z - T, _t = _ - T, Et = D - A, Ft = E - A;
+        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 = z - (Rt + (C = z - 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 = c * O + i * Math.abs(tt), (tt += Rt * N + Ft * I - (Et * L + _t * B)) >= lt || -tt >= lt)) return tt;
+        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, u);
+        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, u, 4, w, f);
+        const Nt = r(j, c, 4, w, f);
         return f[Nt - 1];
-      }(y, M, P, g, m, p, S);
-    }, e.orient2dfast = function(y, M, P, g, m, p) {
-      return (M - p) * (P - m) - (y - m) * (g - p);
+      }(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 });
   });
 })(Ue, Ue.exports);
@@ -3896,34 +3896,34 @@ function Wn(n, t, e) {
     var l = o[s];
     i.remove(l), a = wn(l, a), r.push(a);
   }
-  var c = new pn(16);
-  for (s = 0; s < r.length; s++) c.insert(Xe(r[s]));
+  var u = new pn(16);
+  for (s = 0; s < r.length; s++) u.insert(Xe(r[s]));
   for (var h = t * t, d = e * e; r.length; ) {
-    var u = r.shift(), f = u.p, w = u.next.p, y = $e(f, w);
-    if (!(y < d)) {
-      var M = y / h;
-      l = gr(i, u.prev.p, f, w, u.next.next.p, M, c), l && Math.min($e(l, f), $e(l, w)) <= M && (r.push(u), r.push(wn(l, u)), i.remove(l), c.remove(u), c.insert(Xe(u)), c.insert(Xe(u.next)));
+    var c = r.shift(), f = c.p, w = c.next.p, x = $e(f, w);
+    if (!(x < d)) {
+      var P = x / h;
+      l = gr(i, c.prev.p, f, w, c.next.next.p, P, u), l && Math.min($e(l, f), $e(l, w)) <= P && (r.push(c), r.push(wn(l, c)), i.remove(l), u.remove(c), u.insert(Xe(c)), u.insert(Xe(c.next)));
     }
   }
-  u = a;
-  var P = [];
+  c = a;
+  var M = [];
   do
-    P.push(u.p), u = u.next;
-  while (u !== a);
-  return P.push(u.p), P;
+    M.push(c.p), c = c.next;
+  while (c !== a);
+  return M.push(c.p), M;
 }
 function gr(n, t, e, o, i, r, s) {
   for (var a = new Ae([], pr), l = n.data; l; ) {
-    for (var c = 0; c < l.children.length; c++) {
-      var h = l.children[c], d = l.leaf ? He(h, e, o) : yr(e, o, h);
+    for (var u = 0; u < l.children.length; u++) {
+      var h = l.children[u], d = l.leaf ? He(h, e, o) : yr(e, o, h);
       d > r || a.push({
         node: h,
         dist: d
       });
     }
     for (; a.length && !a.peek().node.children; ) {
-      var u = a.pop(), f = u.node, w = He(f, t, e), y = He(f, o, i);
-      if (u.dist < w && u.dist < y && xn(e, f, s) && xn(o, f, s)) return f;
+      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);
   }
@@ -3996,9 +3996,9 @@ function He(n, t, e) {
   return r = n[0] - o, s = n[1] - i, r * r + s * s;
 }
 function Ee(n, t, e, o, i, r, s, a) {
-  var l = e - n, c = o - t, h = s - i, d = a - r, u = n - i, f = t - r, w = l * l + c * c, y = l * h + c * d, M = h * h + d * d, P = l * u + c * f, g = h * u + d * f, m = w * M - y * y, p, b, V, v, S = m, z = m;
-  m === 0 ? (b = 0, S = 1, v = g, z = M) : (b = y * g - M * P, v = w * g - y * P, b < 0 ? (b = 0, v = g, z = M) : b > S && (b = S, v = g + y, z = M)), v < 0 ? (v = 0, -P < 0 ? b = 0 : -P > w ? b = S : (b = -P, S = w)) : v > z && (v = z, -P + y < 0 ? b = 0 : -P + y > w ? b = S : (b = -P + y, S = w)), p = b === 0 ? 0 : b / S, V = v === 0 ? 0 : v / z;
-  var D = (1 - p) * n + p * e, _ = (1 - p) * t + p * o, E = (1 - V) * i + V * s, T = (1 - V) * r + V * a, A = E - D, O = T - _;
+  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) {
@@ -4091,9 +4091,9 @@ function _r(n, t, e) {
   a > Math.PI && (a -= 2 * Math.PI);
   const l = Math.log(
     Math.tan(r / 2 + Math.PI / 4) / Math.tan(i / 2 + Math.PI / 4)
-  ), c = Math.abs(l) > 1e-11 ? s / l : Math.cos(i);
+  ), u = Math.abs(l) > 1e-11 ? s / l : Math.cos(i);
   return Math.sqrt(
-    s * s + c * c * a * a
+    s * s + u * u * a * a
   ) * o;
 }
 function Er(n, t, e, o = {}) {
@@ -4114,14 +4114,14 @@ function Er(n, t, e, 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 c = s + l;
-  Math.abs(c) > Math.PI / 2 && (c = c > 0 ? Math.PI - c : -Math.PI - c);
+  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(c / 2 + Math.PI / 4) / Math.tan(s / 2 + Math.PI / 4)
-  ), d = Math.abs(h) > 1e-11 ? l / h : Math.cos(s), u = i * Math.sin(a) / d;
+    Math.tan(u / 2 + Math.PI / 4) / Math.tan(s / 2 + Math.PI / 4)
+  ), d = Math.abs(h) > 1e-11 ? l / h : Math.cos(s), c = i * Math.sin(a) / d;
   return [
-    ((r + u) * 180 / Math.PI + 540) % 360 - 180,
-    c * 180 / Math.PI
+    ((r + c) * 180 / Math.PI + 540) % 360 - 180,
+    u * 180 / Math.PI
   ];
 }
 function Ar(n) {
@@ -4193,8 +4193,8 @@ function Pn(n, t, e) {
   if (t === 0) return n;
   const r = o ?? Xn(n);
   return (i === !1 || i === void 0) && (n = Ar(n)), Pe(n, function(s) {
-    const l = vr(r, s) + t, c = Dr(r, s), h = Sr(
-      Er(r, c, l)
+    const l = vr(r, s) + t, u = Dr(r, s), h = Sr(
+      Er(r, u, l)
     );
     s[0] = h[0], s[1] = h[1];
   }), n;
@@ -4202,8 +4202,8 @@ function Pn(n, t, e) {
 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]), c = Math.sin(s - r) * Math.cos(l), h = Math.cos(a) * Math.sin(l) - Math.sin(a) * Math.cos(l) * Math.cos(s - r);
-  return Ln(Math.atan2(c, h));
+  const o = se(n), i = se(t), r = ie(o[0]), s = ie(i[0]), a = ie(o[1]), l = ie(i[1]), u = Math.sin(s - r) * Math.cos(l), h = Math.cos(a) * Math.sin(l) - Math.sin(a) * Math.cos(l) * Math.cos(s - r);
+  return Ln(Math.atan2(u, h));
 }
 function Ir(n, t) {
   let e = Gn(t, n);
@@ -4272,8 +4272,8 @@ function zn(n) {
   if (t <= 2) return 0;
   let e = 0, o = 0;
   for (; o < t; ) {
-    const i = n[o], r = n[o + 1 === t ? 0 : o + 1], s = n[o + 2 >= t ? (o + 2) % t : o + 2], a = i[0] * Ye, l = r[1] * Ye, c = s[0] * Ye;
-    e += (c - a) * Math.sin(l), o++;
+    const i = n[o], r = n[o + 1 === t ? 0 : o + 1], s = n[o + 2 >= t ? (o + 2) % t : o + 2], a = i[0] * Ye, l = r[1] * Ye, u = s[0] * Ye;
+    e += (u - a) * Math.sin(l), o++;
   }
   return e * Or;
 }
@@ -4286,8 +4286,8 @@ function Nr(n) {
   for (let s = 0; s < o.length - 1; s++) {
     let a = Gn(o[s], o[s + 1]), l = Pn(t, -1 * a, {
       pivot: e
-    }), c = Lr(l), h = Rr(c);
-    h < i && (i = h, r = Pn(c, a, {
+    }), u = Lr(l), h = Rr(u);
+    h < i && (i = h, r = Pn(u, a, {
       pivot: e
     }));
   }
@@ -4305,18 +4305,18 @@ function qr(n) {
 }
 class Ie extends An {
   getBoxMesh() {
-    le.identity(), le.setFromMatrix3(this.rotation), le.decompose(Te, fe, new x.Vector3());
-    const t = this.halfSize.clone().multiplyScalar(2), e = new x.Mesh(new x.BoxGeometry(t.x, t.y, t.z));
+    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;
   }
   getBoxEdge(t = 16776960) {
     const e = this.getBoxMesh();
     Xr.setFromObject(e);
-    const o = new x.EdgesGeometry(e.geometry.clone().applyMatrix4(e.matrixWorld));
-    return new x.LineSegments(o, new x.LineBasicMaterial({ color: t, toneMapped: !1 }));
+    const o = new y.EdgesGeometry(e.geometry.clone().applyMatrix4(e.matrixWorld));
+    return new y.LineSegments(o, new y.LineBasicMaterial({ color: t, toneMapped: !1 }));
   }
   toJson() {
-    return le.identity(), le.setFromMatrix3(this.rotation), le.decompose(Te, fe, new x.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()
@@ -4330,8 +4330,8 @@ class Ie extends An {
    * @returns 
    */
   static from(t, e, o, i = new Ie()) {
-    if (o instanceof x.Euler) fe.setFromEuler(o);
-    else if (o instanceof x.Quaternion) fe.copy(o);
+    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, Wr), i.center.copy(e), i.halfSize.copy(t.multiplyScalar(0.5)), i.rotation.setFromMatrix4(le), i;
   }
@@ -4348,41 +4348,41 @@ class Ie extends An {
       coordinates: [t.map((f) => [f.x, f.y])]
     });
     if (!r) throw new Error("2d obb 获取失败");
-    const s = r.geometry.coordinates[0], a = Vn(s[0], s[1]), l = Vn(s[1], s[2]), c = Math.atan2(s[1][1] - s[0][1], s[1][0] - s[0][0]);
-    Te.set(a, l, o), Sn.set(0, 0, c);
+    const s = r.geometry.coordinates[0], a = Vn(s[0], s[1]), l = Vn(s[1], s[2]), u = Math.atan2(s[1][1] - s[0][1], s[1][0] - s[0][0]);
+    Te.set(a, l, o), Sn.set(0, 0, u);
     const [h, d] = qr(s);
     return e.x = h, e.y = d, this.from(Te, e, Sn, i);
   }
 }
-const le = new x.Matrix4(), fe = new x.Quaternion(), Sn = new x.Euler(), Wr = new x.Vector3(1, 1, 1), Te = new x.Vector3(), Xr = new x.Box3();
+const le = new y.Matrix4(), fe = new y.Quaternion(), Sn = new y.Euler(), Wr = new y.Vector3(1, 1, 1), Te = new y.Vector3(), Xr = new y.Box3();
 function $r(n, t, e = 5e-3, o = 0.2) {
   if (!n.length || !t.length) return 0;
-  const i = Math.max(e, 0.03), r = e * e, s = /* @__PURE__ */ new Map(), a = (d, u, f) => `${Math.floor(d / i)},${Math.floor(u / i)},${Math.floor(f / i)}`;
+  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 u = a(d.x, d.y, d.z);
-    s.has(u) || s.set(u, []), s.get(u).push(d);
+    const c = a(d.x, d.y, d.z);
+    s.has(c) || s.set(c, []), s.get(c).push(d);
   }
   let l = 0;
-  const c = Math.ceil(e / i) + 1, h = [];
-  for (let d = -c; d <= c; d++)
-    for (let u = -c; u <= c; u++)
-      for (let f = -c; f <= c; f++)
-        d * d + u * u + f * f <= c * c && h.push([d, u, f]);
+  const u = Math.ceil(e / i) + 1, h = [];
+  for (let d = -u; d <= u; d++)
+    for (let c = -u; c <= u; c++)
+      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 u = Math.floor(d.x / i), f = Math.floor(d.y / i), w = Math.floor(d.z / i);
-    let y = !1;
-    for (const [M, P, g] of h) {
-      const m = `${u + M},${f + P},${w + g}`;
+    const c = Math.floor(d.x / i), f = Math.floor(d.y / i), w = Math.floor(d.z / i);
+    let x = !1;
+    for (const [P, M, g] of h) {
+      const m = `${c + P},${f + M},${w + g}`;
       if (s.has(m)) {
         for (const p of s.get(m))
           if (d.distanceToSquared(p) < r) {
-            y = !0;
+            x = !0;
             break;
           }
-        if (y) break;
+        if (x) break;
       }
     }
-    if (y && (l++, l / n.length > o))
+    if (x && (l++, l / n.length > o))
       return l / n.length;
   }
   return l / n.length;
@@ -4405,7 +4405,7 @@ function Ge(n, t, e, o) {
   return !1;
 }
 function vn(n, t) {
-  const e = new x.Vector3(), o = new x.Vector3();
+  const e = new y.Vector3(), o = new y.Vector3();
   n.getSize(e), t.getSize(o);
   const i = e.x * e.y * e.z, r = o.x * o.y * o.z;
   return i > r ? 1 : i < r ? -1 : 0;
@@ -4437,7 +4437,7 @@ function Dn(n) {
 function _n(n, t, e, o) {
   const i = [];
   for (let s = 0; s < n.length; s++)
-    i.push(new x.Vector3(
+    i.push(new y.Vector3(
       n[s][0],
       n[s][1],
       0
@@ -4450,196 +4450,196 @@ function _n(n, t, e, o) {
 const Mi = (n) => {
   if (n.length == 0) return [];
   const t = [], e = /* @__PURE__ */ new Map();
-  for (let i = 0; i < n.length; i++) {
-    let r = n[i].points.map((y) => [y.x, y.y]), s = n[i].obj_id;
-    s = s.replace(/calcony railing/g, "balcony railing").replace(/glass balcony railing/g, "balcony railing").replace(/metal balcony railing/g, "balcony railing").replace(/temporary construction guardrail/g, "balcony railing").replace(/the floor of the house/g, "floor").replace(/the outdoor floor/g, "floor"), s.split("_").slice(1, 3).join("_").split(".")[0].split("_")[0];
-    const a = s.indexOf("_") + 1, l = s.lastIndexOf("_"), c = s.substring(a, l);
-    if (c === "wall")
+  for (let r = 0; r < n.length; r++) {
+    let s = n[r].points.map((P) => [P.x, P.y]), a = n[r].obj_id;
+    a = a.replace(/calcony railing/g, "balcony railing").replace(/glass balcony railing/g, "balcony railing").replace(/metal balcony railing/g, "balcony railing").replace(/temporary construction guardrail/g, "balcony railing").replace(/the floor of the house/g, "floor").replace(/the outdoor floor/g, "floor"), a.split("_").slice(1, 3).join("_").split(".")[0].split("_")[0];
+    const l = a.indexOf("_") + 1, u = a.lastIndexOf("_"), h = a.substring(l, u);
+    if (h === "wall")
       continue;
-    let h = [];
-    for (let y = 0; y < n[i].points.length; y++)
-      h.push(new x.Vector3(
-        n[i].points[y].x,
-        n[i].points[y].y,
-        n[i].points[y].z
+    let d = [];
+    for (let P = 0; P < n[r].points.length; P++)
+      d.push(new y.Vector3(
+        n[r].points[P].x,
+        n[r].points[P].y,
+        n[r].points[P].z
       ));
-    let d = -99999;
-    if (c === "floor") {
-      let y = /* @__PURE__ */ new Map();
-      for (let P = 0; P < n[i].points.length; P++) {
-        let g = n[i].points[P].z;
-        if (g = Math.floor(g * 10) / 10, y.has(g)) {
-          const m = y.get(g);
-          m.num += 1, m.points.push(n[i].points[P]), y.set(g, m);
+    let c = -99999;
+    if (h === "floor") {
+      let P = /* @__PURE__ */ new Map();
+      for (let g = 0; g < n[r].points.length; g++) {
+        let m = n[r].points[g].z;
+        if (m = Math.floor(m * 10) / 10, P.has(m)) {
+          const p = P.get(m);
+          p.num += 1, p.points.push(n[r].points[g]), P.set(m, p);
         } else
-          y.set(g, { num: 1, points: [n[i].points[P]] });
+          P.set(m, { num: 1, points: [n[r].points[g]] });
       }
-      let M = [...y.entries()].reduce(
-        (P, g) => g[1].num > P[1].num ? g : P
+      let M = [...P.entries()].reduce(
+        (g, m) => m[1].num > g[1].num ? m : g
       );
-      r = [], r = M[1].points.map((P) => [P.x, P.y]), h = [], h = M[1].points.map((P) => new x.Vector3(P.x, P.y, P.z)), d = 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 u = Dn(h), f = {
-      points: h,
-      path: cn(r),
-      h: u.h,
-      minz: u.minz,
-      maxz: u.maxz,
-      center: { x: u.x, y: u.y, z: u.z },
-      obj_id: n[i].obj_id,
-      type: c,
-      averagePz: n[i].averagePz,
+    const f = Dn(d), w = {
+      points: d,
+      path: cn(s),
+      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,
       obb: null,
       isDel: !1,
-      obj_id: s,
-      positionArr: [n[i].position]
+      obj_id: a,
+      positionArr: [n[r].position]
     };
-    if (f.obb = _n(f.path, f.center, f.h, (f.maxz + f.minz) / 2), f.obb == null) continue;
-    let w = -1;
-    for (let y = 0; y < t.length; y++)
-      if (t[y].type == c) {
-        w = y;
+    if (w.obb = _n(w.path, w.center, w.h, (w.maxz + w.minz) / 2), w.obb == null) continue;
+    let x = -1;
+    for (let P = 0; P < t.length; P++)
+      if (t[P].type == h) {
+        x = P;
         break;
       }
-    if (w != -1 ? t[w].array.push(f) : t.push({
-      type: c,
-      array: [f]
-    }), c == "floor" && d != -99999)
-      if (e.has(d)) {
-        const y = e.get(d);
-        y.num += f.points.length, y.datas.push(f), e.set(d, y);
+    if (x != -1 ? t[x].array.push(w) : t.push({
+      type: h,
+      array: [w]
+    }), h == "floor" && c != -99999)
+      if (e.has(c)) {
+        const P = e.get(c);
+        P.num += w.points.length, P.datas.push(w), e.set(c, P);
       } else
-        e.set(d, { num: f.points.length, datas: [f] });
+        e.set(c, { num: w.points.length, datas: [w] });
   }
   let o = -1 / 0;
   if (e.size > 0) {
-    let i = [];
-    for (const [r, s] of e.entries()) {
-      const { num: a, datas: l } = s;
-      a > 3e3 && (r > o && (o = r), i.push(...l));
+    let r = [];
+    for (const [s, a] of e.entries()) {
+      const { num: l, datas: u } = a;
+      l > 3e3 && (s > o && (o = s), r.push(...u));
     }
-    for (let r = 0; r < t.length; r++)
-      if (t[r].type == "floor") {
-        t[r].array = i;
+    for (let s = 0; s < t.length; s++)
+      if (t[s].type == "floor") {
+        t[s].array = r;
         break;
       }
   }
-  for (let i = 0; i < t.length; i++) {
-    const r = t[i].array, s = [], a = [];
-    for (let c = 0; c < r.length; c++) {
-      if (r[c].obb == null || s.includes(c))
+  for (let r = 0; r < t.length; r++) {
+    const s = t[r].array, a = [], l = [];
+    for (let h = 0; h < s.length; h++) {
+      if (s[h].obb == null || a.includes(h))
         continue;
-      const h = {
-        ...r[c],
-        obb: r[c].obb.clone()
+      const d = {
+        ...s[h],
+        obb: s[h].obb.clone()
       };
-      for (let d = c + 1; d < r.length; d++) {
-        if (r[d].obb == null || s.includes(d))
+      for (let c = h + 1; c < s.length; c++) {
+        if (s[c].obb == null || a.includes(c))
           continue;
-        if (h.obb.intersectsOBB(r[d].obb)) {
-          s.push(d);
-          for (let y = 0; y < r[d].points.length; y++)
-            (r[d].points[y].z > o && r[d].points[y].z - o > 0.1 || h.type == "floor") && h.points.push(r[d].points[y]);
-          const f = h.points.map((y) => [y.x, y.y]);
-          h.path = cn(f);
-          const w = Dn(h.points);
-          h.h = w.h, h.minz = w.minz, h.maxz = w.maxz, h.center = { x: w.x, y: w.y, z: w.z }, h.obb = _n(h.path, h.center, h.h, (h.maxz + h.minz) / 2), h.positionArr.push(...r[d].positionArr), d = c;
+        if (d.obb.intersectsOBB(s[c].obb)) {
+          a.push(c);
+          for (let P = 0; P < s[c].points.length; P++)
+            (s[c].points[P].z > o && s[c].points[P].z - o > 0.1 || d.type == "floor") && d.points.push(s[c].points[P]);
+          const w = d.points.map((P) => [P.x, P.y]);
+          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;
         }
       }
-      h.path.length > r[c].path.length && (s.push(c), a.push(h));
+      d.path.length > s[h].path.length && (a.push(h), l.push(d));
     }
-    const l = [];
-    for (let c = 0; c < r.length; c++)
-      s.includes(c) || l.push(r[c]);
-    l.push(...a), t[i].array = l;
-  }
-  for (let i = 0; i < t.length; i++) {
-    const r = t[i].type;
-    if (r === "people" || r === "floor")
+    const u = [];
+    for (let h = 0; h < s.length; h++)
+      a.includes(h) || u.push(s[h]);
+    u.push(...l), t[r].array = u;
+  }
+  for (let r = 0; r < t.length; r++) {
+    const s = t[r].type;
+    if (s === "people" || s === "floor")
       continue;
-    const s = t[i].array;
-    for (let a = 0; a < s.length; a++) {
-      const l = s[a].obb, c = s[a].minz;
-      s[a].maxz;
-      const h = s[a].averagePz;
-      if (r === "window" || r === "door" || r === "tv" || r === "chair" || r === "cabinet" || r === "table") {
-        const d = new x.Vector3();
-        l.getSize(d);
-        const u = [d.x, d.y, d.z];
-        let f = 0;
-        for (const w of u)
-          if (w < 0.2 && (f++, f === 2)) {
-            s[a].isDel = !0;
+    const a = t[r].array;
+    for (let l = 0; l < a.length; l++) {
+      const u = a[l].obb, h = a[l].minz;
+      a[l].maxz;
+      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 f = [c.x, c.y, c.z];
+        let w = 0;
+        for (const x of f)
+          if (x < 0.2 && (w++, w === 2)) {
+            a[l].isDel = !0;
             break;
           }
       }
-      if (!s[a].isDel)
-        for (let d = i + 1; d < t.length; d++) {
-          const u = t[d].type;
-          if (u === "people" || u === "floor")
+      if (!a[l].isDel)
+        for (let c = r + 1; c < t.length; c++) {
+          const f = t[c].type;
+          if (f === "people" || f === "floor")
             continue;
-          const f = t[d].array;
-          for (let w = 0; w < f.length; w++) {
-            if (f[w].isDel) continue;
-            const y = f[w].obb, M = f[w].minz;
-            if (f[w].maxz, l.intersectsOBB(y)) {
-              pe(f[w].points, l);
-              const P = pe(s[a].points, y), g = vn(l, y);
-              if (P >= 0.3 && g == -1) {
-                s[a].isDel = !0;
+          const w = t[c].array;
+          for (let x = 0; x < w.length; x++) {
+            if (w[x].isDel) continue;
+            const P = w[x].obb, M = w[x].minz;
+            if (w[x].maxz, u.intersectsOBB(P)) {
+              pe(w[x].points, u);
+              const g = pe(a[l].points, P), m = vn(u, P);
+              if (g >= 0.3 && m == -1) {
+                a[l].isDel = !0;
                 break;
               }
-              if (r !== "wall" && r !== "floor" && r !== "roof") {
-                if (r === "window") {
-                  if (u === "balcony railing" && we(l, f[w].points)) {
-                    f[w].isDel = !0;
+              if (s !== "wall" && s !== "floor" && s !== "roof") {
+                if (s === "window") {
+                  if (f === "balcony railing" && we(u, w[x].points)) {
+                    w[x].isDel = !0;
                     continue;
                   }
-                  if (u === "balcony railing" && we(y, s[a].points)) {
-                    s[a].isDel = !0;
+                  if (f === "balcony railing" && we(P, a[l].points)) {
+                    a[l].isDel = !0;
                     break;
                   }
-                  if (u === "balcony railing" && Ge(l, y, s[a].points, f[w].points) && (Math.abs(c - M) < 0.1 || Math.abs(M - h) > 0.3)) {
-                    f[w].isDel = !0;
+                  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 (r === "balcony railing") {
-                  if (u === "window" && we(l, f[w].points)) {
-                    f[w].isDel = !0;
+                } else if (s === "balcony railing") {
+                  if (f === "window" && we(u, w[x].points)) {
+                    w[x].isDel = !0;
                     continue;
                   }
-                  if (u === "window" && we(y, s[a].points)) {
-                    s[a].isDel = !0;
+                  if (f === "window" && we(P, a[l].points)) {
+                    a[l].isDel = !0;
                     break;
                   }
-                  if (u === "window" && Ge(l, y, s[a].points, f[w].points) && (Math.abs(c - M) < 0.1 || Math.abs(c - h) > 0.3)) {
-                    s[a].isDel = !0;
+                  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 m = !1, p = [], b = [];
-                const V = s[a].points, v = f[w].points;
-                if (V.length > v.length ? (m = !0, p = V, b = v) : (p = v, b = V), $r(b, p, 0.03, 0.5) > 0.5)
-                  if (m)
-                    f[w].isDel = !0;
+                let p = !1, b = [], z = [];
+                const v = a[l].points, S = w[x].points;
+                if (v.length > S.length ? (p = !0, b = v, z = S) : (b = S, z = v), $r(z, b, 0.03, 0.5) > 0.5)
+                  if (p)
+                    w[x].isDel = !0;
                   else {
-                    s[a].isDel = !0;
+                    a[l].isDel = !0;
                     break;
                   }
-                else if (Ge(l, y)) {
-                  const z = vn(l, y);
-                  if (z === 1 || z === 0) {
-                    if (u === "switch") continue;
-                    V.length > v.length ? pe(b, l) >= 0.5 && (f[w].isDel = !0) : pe(p, l) >= 0.5 && (f[w].isDel = !0);
+                else if (Ge(u, P)) {
+                  const D = vn(u, P);
+                  if (D === 1 || D === 0) {
+                    if (f === "switch") continue;
+                    v.length > S.length ? pe(z, u) >= 0.5 && (w[x].isDel = !0) : pe(b, u) >= 0.5 && (w[x].isDel = !0);
                   } else {
-                    if (r === "switch") continue;
-                    if (V.length > v.length) {
-                      if (pe(p, y) >= 0.5) {
-                        s[a].isDel = !0;
+                    if (s === "switch") continue;
+                    if (v.length > S.length) {
+                      if (pe(b, P) >= 0.5) {
+                        a[l].isDel = !0;
                         break;
                       }
-                    } else if (pe(b, y) >= 0.5) {
-                      s[a].isDel = !0;
+                    } else if (pe(z, P) >= 0.5) {
+                      a[l].isDel = !0;
                       break;
                     }
                   }
@@ -4647,33 +4647,48 @@ const Mi = (n) => {
               }
             }
           }
-          if (s[a].isDel) break;
+          if (a[l].isDel) break;
         }
     }
   }
-  for (let i = 0; i < t.length; i++) {
-    const r = t[i].type, s = t[i].array;
-    for (let a = 0; a < s.length; a++) {
-      let l = s[a].maxz, c = s[a].minz, h = r === "switch" ? 0.1 : 0.3;
-      const d = s[a].averagePz;
-      if (Math.abs(l - d) < h) {
-        s[a].isDel = !0;
+  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, d = s === "switch" ? 0.1 : 0.3;
+      const c = a[l].averagePz;
+      if (Math.abs(u - c) < d) {
+        a[l].isDel = !0;
         continue;
       }
-      if (r === "window" || r === "door" || r === "tv") {
-        const u = Math.abs(l - d), f = Math.abs(c - d);
-        (r === "tv" && f < 1.6 || r !== "window" && u < 1.6) && (s[a].isDel = !0), r === "window" && u < 1 && (s[a].isDel = !0);
+      if (s === "window" || s === "door" || s === "tv") {
+        const f = Math.abs(u - c), w = Math.abs(h - c);
+        (s === "tv" && w < 1.6 || s !== "window" && f < 1.6) && (a[l].isDel = !0), s === "window" && f < 1 && (a[l].isDel = !0);
       }
-      if (r === "chair") {
-        const u = new x.Vector3();
-        s[a].obb.getSize(u), (u.x < 0.1 || u.y < 0.1 || u.z < 0.2) && (s[a].isDel = !0);
+      if (s === "chair") {
+        const f = new y.Vector3();
+        a[l].obb.getSize(f), (f.x < 0.1 || f.y < 0.1 || f.z < 0.2) && (a[l].isDel = !0);
       }
-      r === "balcony railing" && (Math.abs(l - c) < 0.4 && (s[a].isDel = !0), (c < d && Math.abs(c - d) > 1 || c > d && Math.abs(c - d) > 1) && (s[a].isDel = !0), l < d && (s[a].isDel = !0)), r === "people" && (Math.abs(l - c) < 1 && (s[a].isDel = !0), c > d && c - d > 0.3 && (s[a].isDel = !0), l < d && (s[a].isDel = !0)), r === "floor" && s[a].points.length < 500 && (s[a].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);
     }
   }
-  for (let i = 0; i < t.length; i++)
-    t[i].array = t[i].array.filter((r) => !r.isDel);
-  return t;
+  for (let r = 0; r < t.length; r++)
+    t[r].array = t[r].array.filter((s) => !s.isDel);
+  const i = [];
+  for (let r = 0; r < t.length; r++) {
+    const s = t[r].array;
+    for (let a = 0; a < s.length; a++)
+      i.push({
+        obbBox: s[a].obb,
+        box: new y.Box3().setFromPoints(s[a].points),
+        category: s[a].type,
+        center: { x: s[a].center.x, y: s[a].center.y, z: (s[a].minz + s[a].maxz) / 2 },
+        name: s[a].obj_id,
+        obj_id: s[a].obj_id,
+        pcdPoints: s[a].points,
+        positionArr: s[a].positionArr
+      });
+  }
+  return i;
 };
 function Hr(n, t, e, o) {
   return 1 + (n[t][0] === 0 || n[e][0] === 0 || n[o][0] === 0 ? 1 : 0);
@@ -4684,31 +4699,31 @@ function Yr(n) {
   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), c = Math.abs(
+  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 c === 0 ? {
+  return u === 0 ? {
     radius: 1 / 0,
     maxEdge: h
   } : {
-    radius: s * a * l / (4 * c),
+    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], c = [
+    const s = t[r], a = t[r + 1], l = t[r + 2], u = [
       [s, a],
       [a, l],
       [l, s]
     ];
-    for (const [h, d] of c) {
-      const u = i(h, d);
-      if (o.has(u)) continue;
-      o.add(u);
-      const [f, w] = n[h], [y, M] = n[d], P = Math.hypot(y - f, M - w);
-      Number.isFinite(P) && P > 0 && e.push(P);
+    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);
@@ -4737,10 +4752,10 @@ function Kr(n, t) {
   do {
     i.push(n[s]), r.add(s);
     const l = e.get(s) || [];
-    let c = l.find((h) => h !== a && !r.has(h));
-    if (c === void 0 && (c = l.find((h) => h !== a)), c === void 0)
+    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 = c;
+    a = s, s = u;
   } while (s !== o && i.length <= t.length + 1);
   return i;
 }
@@ -4757,30 +4772,30 @@ function zi(n, t = {}) {
   const a = jr(i, s);
   if (!Number.isFinite(a) || a <= 0)
     return [];
-  const l = a * e, c = /* @__PURE__ */ new Map(), h = (f, w) => f < w ? `${f}_${w}` : `${w}_${f}`;
+  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], y = s[f + 1], M = s[f + 2], [P, g] = i[w], [m, p] = i[y], [b, V] = i[M], { radius: v, maxEdge: S } = Gr(
-      P,
+    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,
-      V
-    ), z = Hr(i, w, y, M) * o;
-    if (v <= 1 / z && S <= l) {
+      z
+    ), V = Hr(i, w, x, P) * o;
+    if (v <= 1 / V && S <= l) {
       const D = [
-        [w, y],
-        [y, M],
-        [M, w]
+        [w, x],
+        [x, P],
+        [P, w]
       ];
       for (const [_, E] of D) {
         const T = h(_, E);
-        c.set(T, (c.get(T) || 0) + 1);
+        u.set(T, (u.get(T) || 0) + 1);
       }
     }
   }
   const d = [];
-  for (const [f, w] of c)
+  for (const [f, w] of u)
     w === 1 && d.push(f.split("_").map(Number));
   return d.length ? Kr(i, d) : [];
 }
@@ -4791,16 +4806,16 @@ function be(n, t) {
 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, c = Math.sqrt(a * a + l * l);
-    c > t && (t = c, e = a / c, o = l / c);
+    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);
+    u > t && (t = u, e = a / u, o = l / u);
   }
   return { longSide: t, dirX: e, dirY: o };
 }
 function jn(n, t, e) {
   const i = [];
   for (const r of n) {
-    const s = (r.start.x + r.end.x) / 2, a = (r.start.y + r.end.y) / 2, l = s - t, c = a - e;
-    l * l + c * c <= 3 * 3 && i.push(r.start.z, r.end.z);
+    const s = (r.start.x + r.end.x) / 2, a = (r.start.y + r.end.y) / 2, l = s - t, u = a - e;
+    l * l + u * u <= 3 * 3 && i.push(r.start.z, r.end.z);
   }
   if (i.length === 0) {
     const r = [];
@@ -4813,8 +4828,8 @@ 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 c = n - e, h = t - o, d = (c * s + h * a) / l, u = e + d * s, f = o + d * a;
-  return { dist: Math.sqrt((n - u) ** 2 + (t - f) ** 2), t: d };
+  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 Jr(n, t, e = 0.15) {
   let o = 0, i = 0;
@@ -4837,21 +4852,21 @@ function ei(n, t, e = 0.15) {
   if (r < 1e-12) return 0;
   const s = -i / r, a = o / r, l = [[], []];
   for (let d = 0; d < 2; d++) {
-    const u = d === 0 ? n.start : n.end;
+    const c = d === 0 ? n.start : n.end;
     for (const f of t) {
       if (f === n) continue;
-      const w = be(u, f.start), y = be(u, f.end);
-      let M = null;
-      if (w <= e ? M = f.end : y <= e && (M = f.start), !M) continue;
-      const P = f.end.x - f.start.x, g = f.end.y - f.start.y, m = Math.sqrt(P * P + g * g);
-      if (m < 1e-12 || Math.abs(o * P + i * g) / (r * m) >= 0.342) continue;
-      const b = (M.x - u.x) * s + (M.y - u.y) * a;
+      const w = be(c, f.start), x = be(c, f.end);
+      let P = null;
+      if (w <= e ? P = f.end : x <= e && (P = f.start), !P) continue;
+      const M = f.end.x - f.start.x, g = f.end.y - f.start.y, m = Math.sqrt(M * M + g * g);
+      if (m < 1e-12 || Math.abs(o * M + i * g) / (r * m) >= 0.342) continue;
+      const b = (P.x - c.x) * s + (P.y - c.y) * a;
       l[d].push(b > 0 ? 1 : -1);
     }
   }
   if (l[0].length === 0 || l[1].length === 0) return 0;
-  const c = [...l[0], ...l[1]];
-  return c.every((d) => d === c[0]) ? 2 : 1;
+  const u = [...l[0], ...l[1]];
+  return u.every((d) => d === u[0]) ? 2 : 1;
 }
 function ni(n, t, e) {
   const o = Jr(n, e), i = ti(n, t), r = ei(n, e);
@@ -4893,18 +4908,18 @@ function ii(n, t = 0.05) {
 function si(n, t, e, o, i) {
   const r = [];
   for (const a of n) {
-    const l = a.seg, c = (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;
-    r.push({ l: Math.min(c, h), r: Math.max(c, h), idx: a.idx });
+    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;
+    r.push({ l: Math.min(u, h), r: Math.max(u, h), idx: a.idx });
   }
   r.sort((a, l) => a.l - l.l);
   const s = [];
-  for (const { l: a, r: l, idx: c } of r) {
+  for (const { l: a, r: l, idx: u } of r) {
     if (s.length === 0) {
-      s.push({ l: a, r: l, srcIdxs: [c] });
+      s.push({ l: a, r: l, srcIdxs: [u] });
       continue;
     }
     const h = s[s.length - 1];
-    a <= h.r + i ? (h.r = Math.max(h.r, l), h.srcIdxs.includes(c) || h.srcIdxs.push(c)) : s.push({ l: a, r: l, srcIdxs: [c] });
+    a <= h.r + i ? (h.r = Math.max(h.r, l), h.srcIdxs.includes(u) || h.srcIdxs.push(u)) : s.push({ l: a, r: l, srcIdxs: [u] });
   }
   return s;
 }
@@ -4921,43 +4936,43 @@ function li(n, t) {
         const r = n[o], s = n[i];
         if (r.rooftopPz !== void 0 && s.rooftopPz !== void 0 && Math.abs(r.rooftopPz - s.rooftopPz) > 0.05)
           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, c = 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 || c || h) || r.direction.x * s.direction.x + r.direction.y * s.direction.y < 0.98) continue;
-        let u = r.start, f = r.end;
-        a ? f = s.end : l ? u = s.start : c ? f = s.start : h && (u = s.end);
-        const w = Math.hypot(f.x - u.x, f.y - u.y), y = { ...r };
-        y.start = u, y.end = f, y.length = w, y.direction = { x: (f.x - u.x) / w, y: (f.y - u.y) / w, z: 0 }, y.rooftopPz = r.rooftopPz !== void 0 ? r.rooftopPz : s.rooftopPz, y.buildRosource = r.buildRosource || s.buildRosource, y.isRebuild = !1, y.doorAndBeamData || (y.doorAndBeamData = []), y.insetionArr || (y.insetionArr = []), n[o] = y, t[o] = [.../* @__PURE__ */ new Set([...t[o], ...t[i]])], n.splice(i, 1), t.splice(i, 1), i--, e = !0;
+        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, 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 };
 }
 function Zn(n, t = 5, e = 0.05) {
   if (n.length <= 1)
-    return { segments: n, sourceMap: n.map((l, c) => [c]) };
-  const o = n.map((l, c) => ({ seg: l, angle: oi(l), idx: c }));
-  o.sort((l, c) => l.angle - c.angle);
+    return { segments: n, sourceMap: n.map((l, u) => [u]) };
+  const o = n.map((l, u) => ({ seg: l, angle: oi(l), idx: u }));
+  o.sort((l, u) => l.angle - u.angle);
   const i = ri(o, t), r = [], s = [], a = [];
   for (const l of i) {
-    let c = l[0].seg;
-    for (const P of l)
-      P.seg.length > c.length && (c = P.seg);
-    const h = c.end.x - c.start.x, d = c.end.y - c.start.y, u = Math.sqrt(h * h + d * d);
-    if (u < 1e-12) continue;
-    const f = -d / u, w = h / u, y = l.map((P) => {
-      const g = P.seg.start.x - c.start.x, m = P.seg.start.y - c.start.y;
-      return { seg: P.seg, offset: Math.abs(g * f + m * w), idx: P.idx };
+    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, d = u.end.y - u.start.y, c = Math.sqrt(h * h + d * d);
+    if (c < 1e-12) continue;
+    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 };
     });
-    y.sort((P, g) => P.offset - g.offset);
-    const M = ii(y);
-    for (const P of M) {
-      let g = P[0].seg;
-      for (const E of P)
+    x.sort((M, g) => M.offset - g.offset);
+    const P = ii(x);
+    for (const M of 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 V = m / b, v = p / b, S = P.map((E) => E.seg.rooftopPz ?? 0), z = Math.max(...S), D = [...new Set(S.map((E) => E.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 E = P.map((T) => ({
+        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 },
@@ -4966,11 +4981,11 @@ function Zn(n, t = 5, e = 0.05) {
         }));
         a.push({ values: [...D], segments: E });
       }
-      [...new Set(P.map((E) => String(E.seg.buildRosource)))];
-      const _ = si(P, g, V, v, e);
+      [...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, V, v, z, g.buildRosource);
+        const O = ai(g, E, T, z, v, V, g.buildRosource);
         r.push(O), s.push(A);
       }
     }
@@ -5005,42 +5020,42 @@ function hi(n, t, e, o, i, r, s) {
     { margin: 0.4, maxDist: 0.65, label: "宽松" }
   ];
   let l = [];
-  for (const c of a) {
+  for (const u of a) {
     if (l.length > 0) break;
     for (const h of n) {
       const d = t * r.minLengthRatio;
       if (h.length < d)
         continue;
-      const { start: u, end: f } = h;
-      let w = !1, y = 1 / 0;
+      const { start: c, end: f } = h;
+      let w = !1, x = 1 / 0;
       for (const S of i) {
-        const { dist: z, t: D } = Un(S.x, S.y, u.x, u.y, f.x, f.y);
-        D >= -c.margin && D <= 1 + c.margin && z <= c.maxDist && (w = !0, y = Math.min(y, z));
+        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) {
-        `${c.maxDist}${(-c.margin).toFixed(1)}${(1 + c.margin).toFixed(1)}`;
+        `${u.maxDist}${(-u.margin).toFixed(1)}${(1 + u.margin).toFixed(1)}`;
         continue;
       }
-      const M = Math.sqrt((f.x - u.x) ** 2 + (f.y - u.y) ** 2);
-      if (M < 1e-12) continue;
-      const P = (f.x - u.x) / M, g = (f.y - u.y) / M, m = Math.abs(e * P + o * g), p = Math.abs(-o * P + e * g), b = Math.max(m, p), V = Math.acos(Math.min(b, 1)) * (180 / Math.PI);
-      if (V > r.angleThreshold) {
-        `${V.toFixed(1)}${r.angleThreshold}`;
+      const P = Math.sqrt((f.x - c.x) ** 2 + (f.y - c.y) ** 2);
+      if (P < 1e-12) continue;
+      const M = (f.x - c.x) / P, g = (f.y - c.y) / P, m = Math.abs(e * M + o * g), p = Math.abs(-o * M + e * g), b = Math.max(m, p), z = Math.acos(Math.min(b, 1)) * (180 / Math.PI);
+      if (z > r.angleThreshold) {
+        `${z.toFixed(1)}${r.angleThreshold}`;
         continue;
       }
       let v = 0;
-      if (M > 0.01) {
+      if (P > 0.01) {
         const S = [];
         for (let _ = 1; _ <= 4; _++) {
-          const E = i[_], T = E.x - u.x, A = E.y - u.y, O = (T * P + A * g) / M;
+          const E = i[_], T = E.x - c.x, A = E.y - c.y, O = (T * M + A * g) / P;
           S.push(O);
         }
-        const z = Math.min(...S), D = Math.max(...S);
-        D > z && (v = Math.max(0, Math.min(1, D) - Math.max(0, z)) / (D - z));
+        const V = Math.min(...S), D = Math.max(...S);
+        D > V && (v = Math.max(0, Math.min(1, D) - Math.max(0, V)) / (D - V));
       }
       l.push({
         seg: h,
-        minDist: y,
+        minDist: x,
         embedRatio: v,
         ratio: h.length / t,
         score: 0,
@@ -5060,73 +5075,73 @@ function fi(n, t, e, o) {
   return n.sort((i, r) => r.embedRatio - i.embedRatio || r.score - i.score || i.minDist - r.minDist), n;
 }
 function di(n, t, e, o) {
-  const i = n.end.x - n.start.x, r = n.end.y - n.start.y, s = Math.sqrt(i * i + r * r), a = i / s, l = r / s, c = t.map((v) => {
-    const S = v.x - n.start.x, z = v.y - n.start.y;
-    return (S * a + z * l) / s;
-  }), h = Math.min(...c), d = Math.max(...c), u = (d - h) * s, f = (h + d) / 2, w = n.start.x + f * i, y = n.start.y + f * r, M = e.box.min.z, P = e.box.max.z, g = Math.abs(P - M), m = jn(o, n.start.x, n.start.y), p = Math.max(0, M - m), b = h <= 0 && d >= 1, V = n.start.z + f * (n.end.z - n.start.z);
+  const i = n.end.x - n.start.x, r = n.end.y - n.start.y, s = Math.sqrt(i * i + r * r), a = i / s, l = r / s, u = t.map((v) => {
+    const S = v.x - n.start.x, V = v.y - n.start.y;
+    return (S * a + V * l) / s;
+  }), h = Math.min(...u), d = Math.max(...u), c = (d - h) * s, f = (h + d) / 2, w = n.start.x + f * i, x = n.start.y + f * r, P = e.box.min.z, M = e.box.max.z, g = Math.abs(M - P), m = jn(o, n.start.x, n.start.y), p = Math.max(0, P - m), b = h <= 0 && d >= 1, z = n.start.z + f * (n.end.z - n.start.z);
   return {
-    p: { x: w, y, z: V },
-    width: u,
+    p: { x: w, y: x, z },
+    width: c,
     full: b,
     height: g,
     groundClearance: p
   };
 }
 function Kn(n, t, e) {
-  var h, d, u, f, w;
-  const o = t.map((y) => e[y]), i = [], r = [], s = [], a = [], l = [];
-  let c;
-  for (const y of o) {
-    if ((h = y.points) != null && h.length) for (const M of y.points) i.push(M);
-    if ((d = y.originalPoints) != null && d.length) for (const M of y.originalPoints) r.push(M);
-    if ((u = y.doorAndBeamData) != null && u.length) for (const M of y.doorAndBeamData) s.push(M);
-    if ((f = y.insetionArr) != null && f.length) for (const M of y.insetionArr) a.push(M);
-    if ((w = y.drawWindow) != null && w.length) for (const M of y.drawWindow) l.push(M);
-    y.boxData && !c && (c = y.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), c && (n.boxData = c);
+  var h, d, c, f, w;
+  const o = t.map((x) => e[x]), i = [], r = [], s = [], a = [], l = [];
+  let u;
+  for (const x of o) {
+    if ((h = x.points) != null && h.length) for (const P of x.points) i.push(P);
+    if ((d = x.originalPoints) != null && d.length) for (const P of x.originalPoints) r.push(P);
+    if ((c = x.doorAndBeamData) != null && c.length) for (const P of x.doorAndBeamData) s.push(P);
+    if ((f = x.insetionArr) != null && f.length) for (const P of x.insetionArr) a.push(P);
+    if ((w = x.drawWindow) != null && w.length) for (const P of x.drawWindow) l.push(P);
+    x.boxData && !u && (u = x.boxData);
+  }
+  i.length && (n.points = i), r.length && (n.originalPoints = r), s.length && (n.doorAndBeamData = s), a.length && (n.insetionArr = a), l.length && (n.drawWindow = l), u && (n.boxData = u);
 }
 function mi(n, t, e, o) {
-  var c;
+  var u;
   const i = ci(e), r = [], { segments: s, sourceMap: a } = o ?? Zn(t), l = s;
   for (const h of n) {
-    const d = (c = h.coordinatesByArea) == null ? void 0 : c.coordinates;
+    const d = (u = h.coordinatesByArea) == null ? void 0 : u.coordinates;
     if (!d || d.length < 4)
       continue;
-    const u = d.slice(0, 4), f = u.reduce((D, _) => D + _.x, 0) / 4, w = u.reduce((D, _) => D + _.y, 0) / 4, { longSide: y, dirX: M, dirY: P } = Qr(u);
-    if (y < 0.01)
+    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 g = u.reduce((D, _) => D + _.z, 0) / 4, m = jn(t, f, w);
+    const g = c.reduce((D, _) => D + _.z, 0) / 4, m = jn(t, f, w);
     if (g < m - 0.3)
       continue;
-    const p = ui(u, f, w);
+    const p = ui(c, f, w);
     h.name;
-    let b = hi(l, y, M, P, p, i, h.name);
+    let b = hi(l, x, P, M, p, i, h.name);
     b = fi(b, p, t, h.name);
-    let V = null, v = 1 / 0, S = 0;
+    let z = null, v = 1 / 0, S = 0;
     if (b.length > 0) {
       const D = b[0];
-      V = D.seg, v = D.minDist, S = D.ratio;
+      z = D.seg, v = D.minDist, S = D.ratio;
     }
-    let z;
-    if (V && (z = di(V, u, h, s), !i.printOnly)) {
-      const D = V;
-      D.drawWindow || (D.drawWindow = []), D.drawWindow.push(z);
+    let V;
+    if (z && (V = di(z, c, h, s), !i.printOnly)) {
+      const D = z;
+      D.drawWindow || (D.drawWindow = []), D.drawWindow.push(V);
     }
-    V && r.push({
+    z && r.push({
       windowName: h.name,
       windowCategory: h.category,
       windowCenter: h.center,
-      wallSegment: V,
+      wallSegment: z,
       distance: v,
       wallLengthRatio: S,
-      drawWindow: z
+      drawWindow: V
     });
   }
   for (const h of r) {
-    const d = h.wallSegment, u = s.indexOf(d);
-    if (u === -1) continue;
-    const f = a[u];
+    const d = h.wallSegment, c = s.indexOf(d);
+    if (c === -1) continue;
+    const f = a[c];
     !f || f.length <= 1 || Kn(d, f, t);
   }
   return r;
@@ -5135,28 +5150,28 @@ function Vi(n, t, e) {
   const o = {
     printOnly: !1,
     ...e
-  }, i = Array.isArray(t) ? t.filter((u) => u && u.category === "window" && !u.isBayWindowObj) : [], { segments: r, sourceMap: s } = Zn(n), a = mi(i, n, o, { segments: r, sourceMap: s }), l = /* @__PURE__ */ new Set();
-  for (const u of a) {
-    const f = r.indexOf(u.wallSegment);
+  }, 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 f = r.indexOf(c.wallSegment);
     f >= 0 && l.add(f);
   }
-  const c = [], h = /* @__PURE__ */ new Set();
-  for (const u of l) {
-    const f = s[u];
+  const u = [], h = /* @__PURE__ */ new Set();
+  for (const c of l) {
+    const f = s[c];
     if (f) {
-      Kn(r[u], f, n);
+      Kn(r[c], f, n);
       for (const w of f) h.add(w);
     }
-    c.push(r[u]);
-  }
-  for (let u = 0; u < n.length; u++)
-    h.has(u) || c.push(n[u]);
-  const d = new Set(a.map((u) => u.windowName));
-  for (const u of t)
-    u && u.category === "window" && !u.isBayWindowObj && (d.has(u.name) ? delete u.AbnormalWindow : u.AbnormalWindow = !0);
-  for (const u of a)
-    u.drawWindow && u.wallSegment && (u.wallSegment.drawWindow || (u.wallSegment.drawWindow = []), u.wallSegment.drawWindow.push(u.drawWindow));
-  return { segments: c, matches: a };
+    u.push(r[c]);
+  }
+  for (let c = 0; c < n.length; c++)
+    h.has(c) || u.push(n[c]);
+  const d = new Set(a.map((c) => c.windowName));
+  for (const c of t)
+    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,