rm-graphical-computing 1.0.63 → 1.0.64

package/dist/index.js

@@ -5,63 +5,63 @@ import * as y from "three";
 import { BufferGeometry as to, BufferAttribute as eo, Plane as no, Vector3 as zt, Matrix3 as Tn, MathUtils as Oe, Box3 as oo, Matrix4 as En, Ray as ro } from "three";
 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 f = n[h];
-    let u = 0;
-    if (e !== (f.index !== null))
+    const g = n[h];
+    let c = 0;
+    if (e !== (g.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 p in f.attributes) {
-      if (!o.has(p))
-        return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + '. All geometries must have compatible attributes; make sure "' + p + '" attribute exists among all geometries, or in none of them.'), null;
-      r[p] === void 0 && (r[p] = []), r[p].push(f.attributes[p]), u++;
+    for (const m in g.attributes) {
+      if (!o.has(m))
+        return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + '. All geometries must have compatible attributes; make sure "' + m + '" attribute exists among all geometries, or in none of them.'), null;
+      r[m] === void 0 && (r[m] = []), r[m].push(g.attributes[m]), c++;
     }
-    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 !== f.morphTargetsRelative)
+    if (a !== g.morphTargetsRelative)
       return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + ". .morphTargetsRelative must be consistent throughout all geometries."), null;
-    for (const p in f.morphAttributes) {
-      if (!i.has(p))
+    for (const m in g.morphAttributes) {
+      if (!i.has(m))
         return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + h + ".  .morphAttributes must be consistent throughout all geometries."), null;
-      s[p] === void 0 && (s[p] = []), s[p].push(f.morphAttributes[p]);
+      s[m] === void 0 && (s[m] = []), s[m].push(g.morphAttributes[m]);
     }
     if (t) {
-      let p;
+      let m;
       if (e)
-        p = f.index.count;
-      else if (f.attributes.position !== void 0)
-        p = f.attributes.position.count;
+        m = g.index.count;
+      else if (g.attributes.position !== void 0)
+        m = g.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, p, h), c += p;
+      l.addGroup(u, m, h), u += m;
     }
   }
   if (e) {
     let h = 0;
-    const f = [];
-    for (let u = 0; u < n.length; ++u) {
-      const p = n[u].index;
-      for (let w = 0; w < p.count; ++w)
-        f.push(p.getX(w) + h);
-      h += n[u].attributes.position.count;
+    const g = [];
+    for (let c = 0; c < n.length; ++c) {
+      const m = n[c].index;
+      for (let w = 0; w < m.count; ++w)
+        g.push(m.getX(w) + h);
+      h += n[c].attributes.position.count;
     }
-    l.setIndex(f);
+    l.setIndex(g);
   }
   for (const h in r) {
-    const f = Qe(r[h]);
-    if (!f)
+    const g = Qe(r[h]);
+    if (!g)
       return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the " + h + " attribute."), null;
-    l.setAttribute(h, f);
+    l.setAttribute(h, g);
   }
   for (const h in s) {
-    const f = s[h][0].length;
-    if (f === 0) break;
+    const g = s[h][0].length;
+    if (g === 0) break;
     l.morphAttributes = l.morphAttributes || {}, l.morphAttributes[h] = [];
-    for (let u = 0; u < f; ++u) {
-      const p = [];
+    for (let c = 0; c < g; ++c) {
+      const m = [];
       for (let x = 0; x < s[h].length; ++x)
-        p.push(s[h][x][u]);
-      const w = Qe(p);
+        m.push(s[h][x][c]);
+      const w = Qe(m);
       if (!w)
         return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the " + h + " morphAttribute."), null;
       l.morphAttributes[h].push(w);
@@ -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 f = l / e;
-      for (let u = 0, p = h.count; u < p; u++)
+      const g = l / e;
+      for (let c = 0, m = h.count; c < m; c++)
         for (let w = 0; w < e; w++) {
-          const x = h.getComponent(u, w);
-          a.setComponent(u + f, w, x);
+          const x = h.getComponent(c, w);
+          a.setComponent(c + g, w, x);
         }
     } else
       s.set(h.array, l);
@@ -106,10 +106,10 @@ const so = (n, t, e) => {
   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, f = ((e.x - n.x) * s - (e.y - n.y) * r) / c;
-  return h < -i || h > 1 + i || f < -i || f > 1 + i ? null : {
+  const r = t.x - n.x, s = t.y - n.y, a = o.x - e.x, l = o.y - e.y, u = r * l - s * a;
+  if (Math.abs(u) < i) return null;
+  const h = ((e.x - n.x) * l - (e.y - n.y) * a) / u, g = ((e.x - n.x) * s - (e.y - n.y) * r) / u;
+  return h < -i || h > 1 + i || g < -i || g > 1 + i ? null : {
     point: new y.Vector3(
       n.x + h * r,
       n.y + h * s,
@@ -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 p = Math.min(u + a * 2, l), w = o + a * 2;
+  const c = h.measureText(n).width;
+  let m = Math.min(c + a * 2, l), w = o + a * 2;
   const x = document.createElement("canvas");
-  x.width = p, x.height = w;
+  x.width = m, x.height = w;
   const P = x.getContext("2d");
-  P.fillStyle = r, P.fillRect(0, 0, p, w), P.fillStyle = s, P.font = `bold ${o}px ${i}`, P.textAlign = "center", P.textBaseline = "middle", u > l - a * 2 ? lo(P, n, p / 2, w / 2, l, o) : P.fillText(n, p / 2, w / 2);
-  const M = new y.CanvasTexture(x), m = new y.SpriteMaterial({
+  P.fillStyle = r, P.fillRect(0, 0, m, w), P.fillStyle = s, P.font = `bold ${o}px ${i}`, P.textAlign = "center", P.textBaseline = "middle", c > l - a * 2 ? lo(P, n, m / 2, w / 2, l, o) : P.fillText(n, m / 2, w / 2);
+  const M = new y.CanvasTexture(x), d = new y.SpriteMaterial({
     map: M,
     depthTest: !1,
     transparent: !0
-  }), d = new y.Sprite(m);
-  d.position.set(t.x, t.y, t.z);
-  const g = 5e-3;
-  return d.scale.set(p * g, w * g, 1), d;
+  }), f = new y.Sprite(d);
+  f.position.set(t.x, t.y, t.z);
+  const p = 5e-3;
+  return f.scale.set(m * p, w * p, 1), f;
 };
 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 f = a + s[h];
-    n.measureText(f).width > i && h > 0 ? (n.fillText(a, e, c), a = s[h], c += l) : a = f;
+    const g = a + s[h];
+    n.measureText(g).width > i && h > 0 ? (n.fillText(a, e, u), a = s[h], u += l) : a = g;
   }
-  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 {};
+  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 c = 1 / 0, h = -1 / 0, f = 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 < f && (f = S), S > u && (u = S);
-  }
-  const p = i[0].dot(l), w = s.clone().multiplyScalar(c).add(a.clone().multiplyScalar(f)).add(l.clone().multiplyScalar(p)), x = s.clone().multiplyScalar(h).add(a.clone().multiplyScalar(f)).add(l.clone().multiplyScalar(p)), P = s.clone().multiplyScalar(h).add(a.clone().multiplyScalar(u)).add(l.clone().multiplyScalar(p)), M = s.clone().multiplyScalar(c).add(a.clone().multiplyScalar(u)).add(l.clone().multiplyScalar(p));
-  let m = [w, x, P, M], d = oe(new y.Vector3().subVectors(w, x), new y.Vector3(0, 0, 1));
-  d && d.parallel && (m = [w, M, P, x]);
-  let g = 0;
+  let u = 1 / 0, h = -1 / 0, g = 1 / 0, c = -1 / 0;
+  for (const z of i) {
+    const v = z.dot(s), S = z.dot(a);
+    v < u && (u = v), v > h && (h = v), S < g && (g = S), S > c && (c = S);
+  }
+  const m = i[0].dot(l), w = s.clone().multiplyScalar(u).add(a.clone().multiplyScalar(g)).add(l.clone().multiplyScalar(m)), x = s.clone().multiplyScalar(h).add(a.clone().multiplyScalar(g)).add(l.clone().multiplyScalar(m)), P = s.clone().multiplyScalar(h).add(a.clone().multiplyScalar(c)).add(l.clone().multiplyScalar(m)), M = s.clone().multiplyScalar(u).add(a.clone().multiplyScalar(c)).add(l.clone().multiplyScalar(m));
+  let d = [w, x, P, M], f = oe(new y.Vector3().subVectors(w, x), new y.Vector3(0, 0, 1));
+  f && f.parallel && (d = [w, M, P, x]);
+  let p = 0;
   if (o.length > 0) {
-    const V = new y.Vector3().subVectors(m[1], m[0]).normalize(), v = V.clone().negate(), S = new y.Vector3().subVectors(m[3], m[0]).normalize(), z = S.clone().negate();
-    let D = m[0].distanceTo(m[1]), _ = m[0].distanceTo(m[3]), T = D / t, E = _ / e, A = 1e-3;
+    const z = new y.Vector3().subVectors(d[1], d[0]).normalize(), v = z.clone().negate(), S = new y.Vector3().subVectors(d[3], d[0]).normalize(), V = S.clone().negate();
+    let D = d[0].distanceTo(d[1]), _ = d[0].distanceTo(d[3]), T = D / t, E = _ / e, A = 1e-3;
     for (let O = 0; O < T; O++) {
-      let I = m[0], B = 0;
+      let I = d[0], B = 0;
       for (let R = 0; R < E; R++) {
-        let W = I.clone().addScaledVector(V, t), C = W.clone().addScaledVector(S, e), L = I.clone().addScaledVector(S, e), H = new y.Vector3().add(I).add(W).add(C).add(L).multiplyScalar(0.25);
+        let W = I.clone().addScaledVector(z, t), C = W.clone().addScaledVector(S, e), L = I.clone().addScaledVector(S, e), H = new y.Vector3().add(I).add(W).add(C).add(L).multiplyScalar(0.25);
         for (let X = 0; X < r.length; X++)
           if (r[X].distanceTo(H) < A) {
             B++;
@@ -194,11 +194,11 @@ const oe = (n, t, e = 0.01) => {
       }
       if (B >= E / 2)
         break;
-      g += B, m[0] = m[0].addScaledVector(V, t), m[3] = m[3].addScaledVector(V, t);
+      p += B, d[0] = d[0].addScaledVector(z, t), d[3] = d[3].addScaledVector(z, t);
     }
-    D = m[0].distanceTo(m[1]), T = D / t;
+    D = d[0].distanceTo(d[1]), T = D / t;
     for (let O = 0; O < T; O++) {
-      let I = m[1], B = 0;
+      let I = d[1], B = 0;
       for (let R = 0; R < E; R++) {
         let W = I.clone().addScaledVector(v, t), C = W.clone().addScaledVector(S, e), L = I.clone().addScaledVector(S, e), H = new y.Vector3().add(I).add(W).add(C).add(L).multiplyScalar(0.25);
         for (let X = 0; X < r.length; X++)
@@ -210,13 +210,13 @@ const oe = (n, t, e = 0.01) => {
       }
       if (B >= E / 2)
         break;
-      g += B, m[1] = m[1].addScaledVector(v, t), m[2] = m[2].addScaledVector(v, t);
+      p += B, d[1] = d[1].addScaledVector(v, t), d[2] = d[2].addScaledVector(v, t);
     }
-    D = m[0].distanceTo(m[1]), T = D / t;
+    D = d[0].distanceTo(d[1]), T = D / t;
     for (let O = 0; O < E; O++) {
-      let I = m[3], B = 0;
+      let I = d[3], B = 0;
       for (let R = 0; R < T; R++) {
-        let W = I.clone().addScaledVector(V, t), C = W.clone().addScaledVector(z, e), L = I.clone().addScaledVector(z, e), H = new y.Vector3().add(I).add(W).add(C).add(L).multiplyScalar(0.25);
+        let W = I.clone().addScaledVector(z, t), C = W.clone().addScaledVector(V, e), L = I.clone().addScaledVector(V, e), H = new y.Vector3().add(I).add(W).add(C).add(L).multiplyScalar(0.25);
         for (let X = 0; X < r.length; X++)
           if (r[X].distanceTo(H) < A) {
             B++;
@@ -226,14 +226,14 @@ const oe = (n, t, e = 0.01) => {
       }
       if (B >= T / 2)
         break;
-      g += B, m[2] = m[2].addScaledVector(z, e), m[3] = m[3].addScaledVector(z, e);
+      p += B, d[2] = d[2].addScaledVector(V, e), d[3] = d[3].addScaledVector(V, e);
     }
   }
-  const b = m[0].distanceTo(m[1]) * m[0].distanceTo(m[3]);
+  const b = d[0].distanceTo(d[1]) * d[0].distanceTo(d[3]);
   return {
-    facePoints: m,
+    facePoints: d,
     boxArea: b,
-    totalInPlaneNum: g
+    totalInPlaneNum: p
   };
 }, Jt = (n, t, e, o, i = y.MathUtils.degToRad(8)) => {
   const r = new y.Vector3(), s = new y.Vector3();
@@ -244,9 +244,9 @@ const oe = (n, t, e = 0.01) => {
     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,
     // 实际夹角（弧度）
@@ -264,17 +264,17 @@ const oe = (n, t, e = 0.01) => {
   if (s === 0 || a === 0)
     return { rate: NaN, angle: NaN, isPerpendicular: !1, isParallel: !1 };
   i.normalize(), r.normalize();
-  const l = Math.abs(i.dot(r)), c = Math.min(1, Math.max(0, l)), h = Math.acos(c), f = y.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), g = 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: f,
+    angle: g,
     // 夹角（度，0~90）
-    isPerpendicular: Math.abs(f - 90) < 0.01,
+    isPerpendicular: Math.abs(g - 90) < 0.01,
     // 是否垂直
-    isParallel: f < 0.01
+    isParallel: g < 0.01
     // 是否平行
   };
 }, ee = (n, t, e = !1) => new y.Vector3((n.x + t.x) / 2, (n.y + t.y) / 2, e ? 0 : (n.z + t.z) / 2), ne = (n, t, e, o, i = {}) => {
@@ -284,9 +284,9 @@ const oe = (n, t, e = 0.01) => {
     distanceThreshold: a = 2,
     overlapThreshold: l = 0.01
     // 投影重叠量大于此值才算 overlap
-  } = i, c = new y.Vector3().subVectors(t, n), h = new y.Vector3().subVectors(o, e), f = c.clone().normalize(), u = h.clone().normalize();
-  let p = y.MathUtils.clamp(f.dot(u), -1, 1);
-  const w = Math.acos(Math.abs(p)), x = y.MathUtils.radToDeg(w);
+  } = i, u = new y.Vector3().subVectors(t, n), h = new y.Vector3().subVectors(o, e), g = u.clone().normalize(), c = h.clone().normalize();
+  let m = y.MathUtils.clamp(g.dot(c), -1, 1);
+  const w = Math.acos(Math.abs(m)), x = y.MathUtils.radToDeg(w);
   if (w > r)
     return {
       type: "not_parallel",
@@ -297,18 +297,18 @@ const oe = (n, t, e = 0.01) => {
       overlap: null,
       closestDistance: null
     };
-  p < 0 && u.negate();
-  const P = new y.Vector3().addVectors(f, u).normalize(), M = new y.Vector3().addVectors(n, t).multiplyScalar(0.5), m = Je(e, M, f), d = Je(o, M, f), g = (m + d) / 2, b = Math.max(m, d), V = n.dot(P), v = t.dot(P), S = e.dot(P), z = o.dot(P), D = Math.min(V, v), _ = Math.max(V, v), T = Math.min(S, z), E = Math.max(S, z), A = _ - D, O = E - T, I = Math.min(A, O), B = Math.min(_, E) - Math.max(D, T), R = B < 0 ? -B : 0, W = B > 0 ? B : 0, C = I > 0 ? W / I : 0, L = uo(
+  m < 0 && c.negate();
+  const P = new y.Vector3().addVectors(g, c).normalize(), M = new y.Vector3().addVectors(n, t).multiplyScalar(0.5), d = Je(e, M, g), f = Je(o, M, g), p = (d + f) / 2, b = Math.max(d, f), z = n.dot(P), v = t.dot(P), S = e.dot(P), V = o.dot(P), D = Math.min(z, v), _ = Math.max(z, v), T = Math.min(S, V), E = Math.max(S, V), A = _ - D, O = E - T, I = Math.min(A, O), B = Math.min(_, E) - Math.max(D, T), R = B < 0 ? -B : 0, W = B > 0 ? B : 0, C = I > 0 ? W / I : 0, L = uo(
     n,
     t,
     e,
     o
-  ), H = w <= s && g < a;
+  ), H = w <= s && p < a;
   let X;
   return H ? X = C > 0.5 ? "collinear_overlap" : "collinear_gap" : w <= r && (X = "parallel_offset"), {
     type: X,
     angleDeg: x,
-    avgPerpendicularDistance: g,
+    avgPerpendicularDistance: p,
     maxPerpendicularDistance: b,
     gap: R,
     overlap: W,
@@ -320,39 +320,39 @@ function Je(n, t, e) {
   return new y.Vector3().subVectors(o, r).length();
 }
 function uo(n, t, e, o) {
-  const i = new y.Vector3().subVectors(t, n), r = new y.Vector3().subVectors(o, e), s = new y.Vector3().subVectors(e, n), a = i.dot(i), l = i.dot(r), c = r.dot(r), h = i.dot(s), f = r.dot(s), u = a * c - l * l;
-  let p, w;
-  u < 1e-10 ? (p = 0, w = c !== 0 ? f / c : 0) : (p = (l * f - c * h) / u, w = (a * f - l * h) / u), p = y.MathUtils.clamp(p, 0, 1), w = c !== 0 ? y.MathUtils.clamp((l * p + f) / c, 0, 1) : 0, p = a !== 0 ? y.MathUtils.clamp((l * w - h) / a, 0, 1) : 0;
-  const x = n.clone().add(i.clone().multiplyScalar(p)), P = e.clone().add(r.clone().multiplyScalar(w));
+  const i = new y.Vector3().subVectors(t, n), r = new y.Vector3().subVectors(o, e), s = new y.Vector3().subVectors(e, n), a = i.dot(i), l = i.dot(r), u = r.dot(r), h = i.dot(s), g = r.dot(s), c = a * u - l * l;
+  let m, w;
+  c < 1e-10 ? (m = 0, w = u !== 0 ? g / u : 0) : (m = (l * g - u * h) / c, w = (a * g - l * h) / c), m = y.MathUtils.clamp(m, 0, 1), w = u !== 0 ? y.MathUtils.clamp((l * m + g) / u, 0, 1) : 0, m = a !== 0 ? y.MathUtils.clamp((l * w - h) / a, 0, 1) : 0;
+  const x = n.clone().add(i.clone().multiplyScalar(m)), P = e.clone().add(r.clone().multiplyScalar(w));
   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 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 c = new y.Line3(t, e);
-  const h = n.originalPoints, f = new y.Vector3();
+  let u = new y.Line3(t, e);
+  const h = n.originalPoints, g = new y.Vector3();
   for (let x = 0; x < h.length; x++) {
     const P = h[x];
-    let m = c.closestPointToPoint(P, !0, f).distanceTo(P);
-    const d = Math.floor(m / a);
-    if (d < s) {
-      const g = l.get((d + 1) * a);
-      g.count++, P.z < g.minZ && (g.minZ = P.z), P.z > g.maxZ && (g.maxZ = P.z);
+    let d = u.closestPointToPoint(P, !0, g).distanceTo(P);
+    const f = Math.floor(d / a);
+    if (f < s) {
+      const p = l.get((f + 1) * a);
+      p.count++, P.z < p.minZ && (p.minZ = P.z), P.z > p.maxZ && (p.maxZ = P.z);
     }
   }
-  let u, p, w = r / 2;
+  let c, m, w = r / 2;
   for (const [x, P] of l)
     if (P.count >= w) {
-      u = P.minZ;
+      c = P.minZ;
       break;
     }
   for (const [x, P] of [...l.entries()].reverse())
     if (P.count >= w) {
-      p = P.maxZ;
+      m = P.maxZ;
       break;
     }
-  return { minZ: u, maxZ: p };
+  return { minZ: c, maxZ: m };
 }, ze = (n, t, e) => {
   let o = new y.Plane();
   const i = new y.Vector3(n.x, n.y, n.z), r = new y.Vector3(t.x, t.y, t.z), s = new y.Vector3(t.x, t.y, t.z + 5);
@@ -362,28 +362,28 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
     const M = new y.Vector3();
     o.projectPoint(P, M), l.push(M.clone()), M.z = i.z, a.push(M);
   });
-  let c = new y.Vector3(), h = new y.Vector3();
-  o.projectPoint(i, c), o.projectPoint(r, h);
-  const f = new y.Line3(c, h), u = [], p = [], w = [];
+  let u = new y.Vector3(), h = new y.Vector3();
+  o.projectPoint(i, u), o.projectPoint(r, h);
+  const g = new y.Line3(u, h), c = [], m = [], w = [];
   let x = new y.Vector3();
   return a.forEach((P, M) => {
-    f.closestPointToPoint(P, !0, x).distanceTo(P) < 1e-3 ? (u.push(e[M]), p.push(l[M])) : w.push(P);
-  }), { newOriginalPoints: u, newProjectPoints: w, newOnLinePoints: p };
+    g.closestPointToPoint(P, !0, x).distanceTo(P) < 1e-3 ? (c.push(e[M]), m.push(l[M])) : w.push(P);
+  }), { newOriginalPoints: c, newProjectPoints: w, newOnLinePoints: m };
 }, fo = (n) => {
-  function t(e, o, i, r, s, a, l, c, h) {
-    let f = new y.Line3(e, o), u = /* @__PURE__ */ new Map(), p = new y.Vector3(), w = e.clone(), x = o.clone(), P = 0;
+  function t(e, o, i, r, s, a, l, u, h) {
+    let g = new y.Line3(e, o), c = /* @__PURE__ */ new Map(), m = new y.Vector3(), w = e.clone(), x = o.clone(), P = 0;
     for (; ; ) {
-      let M = /* @__PURE__ */ new Map(), m = 0;
-      for (let d = 0; d < h.checkResults.length; d++)
-        if (!(h.checkResults[d].allCenterPoints.length / c * 100 < 1))
-          for (let b = 0; b < h.checkResults[d].allCenterPoints.length; b++) {
-            if (u.has(d) && u.get(d).removePtsIndex.includes(b))
+      let M = /* @__PURE__ */ new Map(), d = 0;
+      for (let f = 0; f < h.checkResults.length; f++)
+        if (!(h.checkResults[f].allCenterPoints.length / u * 100 < 1))
+          for (let b = 0; b < h.checkResults[f].allCenterPoints.length; b++) {
+            if (c.has(f) && c.get(f).removePtsIndex.includes(b))
               continue;
-            let V = h.checkResults[d].allCenterPoints[b];
-            V = new y.Vector3(V.x, V.y, V.z);
-            let v = f.closestPointToPoint(V, !0, p), S = V.distanceTo(v);
-            Math.abs(S - s) < 0.01 && (m++, M.has(d) ? M.get(d).removePtsIndex.push(b) : M.set(d, {
-              index: d,
+            let z = h.checkResults[f].allCenterPoints[b];
+            z = new y.Vector3(z.x, z.y, z.z);
+            let v = g.closestPointToPoint(z, !0, m), S = z.distanceTo(v);
+            Math.abs(S - s) < 0.01 && (d++, M.has(f) ? M.get(f).removePtsIndex.push(b) : M.set(f, {
+              index: f,
               removePtsIndex: [b]
             }));
           }
@@ -391,22 +391,22 @@ const tn = (n, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(n)))), h
         e = w, o = x;
         break;
       }
-      if (m < a / 20 * 18 || m == 0) {
-        M.clear(), l - P < 5 && (e = w, o = x, u.clear());
+      if (d < a / 20 * 18 || d == 0) {
+        M.clear(), l - P < 5 && (e = w, o = x, c.clear());
         break;
       } else {
         P++;
-        for (const [d, g] of M)
-          u.has(d) ? u.get(d).removePtsIndex.push(...g.removePtsIndex) : u.set(d, g);
-        M.clear(), e = e.addScaledVector(i, r), o = o.addScaledVector(i, r), f.set(e, o);
+        for (const [f, p] of M)
+          c.has(f) ? c.get(f).removePtsIndex.push(...p.removePtsIndex) : c.set(f, p);
+        M.clear(), e = e.addScaledVector(i, r), o = o.addScaledVector(i, r), g.set(e, o);
       }
     }
-    if (u.size > 0 && P != l)
-      for (const [M, m] of u) {
-        let d = [], g = [];
+    if (c.size > 0 && P != l)
+      for (const [M, d] of c) {
+        let f = [], p = [];
         for (let b = 0; b < h.checkResults[M].allCenterPoints.length; b++)
-          m.removePtsIndex.includes(b) || (d.push(h.checkResults[M].allCenterPoints[b]), g.push(h.checkResults[M].originalVertices[b]));
-        h.checkResults[M].allCenterPoints = d, h.checkResults[M].originalVertices = g;
+          d.removePtsIndex.includes(b) || (f.push(h.checkResults[M].allCenterPoints[b]), p.push(h.checkResults[M].originalVertices[b]));
+        h.checkResults[M].allCenterPoints = f, h.checkResults[M].originalVertices = p;
       }
   }
   for (let e = 0; e < n.length; e++) {
@@ -418,20 +418,20 @@ 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, _, T] = S;
-      z = new y.Vector3(z.x, z.y, z.z), D = new y.Vector3(D.x, D.y, D.z), _ = new y.Vector3(_.x, _.y, _.z), T = new y.Vector3(T.x, T.y, T.z), i = z.distanceTo(D), r = z.distanceTo(T);
-      let E = new y.Vector3().subVectors(z, D).normalize(), A = oe(E, new y.Vector3(0, 0, 1));
+      let [V, D, _, T] = S;
+      V = new y.Vector3(V.x, V.y, V.z), D = new y.Vector3(D.x, D.y, D.z), _ = new y.Vector3(_.x, _.y, _.z), T = new y.Vector3(T.x, T.y, T.z), i = V.distanceTo(D), r = V.distanceTo(T);
+      let E = new y.Vector3().subVectors(V, D).normalize(), A = oe(E, new y.Vector3(0, 0, 1));
       A && A.parallel && ([r, i] = [i, r]);
     }
     if (i < 0 || r < 0)
       continue;
     let s = new y.Vector3(o.start.x, o.start.y, o.start.z), a = new y.Vector3(o.end.x, o.end.y, o.end.z);
-    const l = s.distanceTo(a), c = o.rooftopPz - o.start.z, h = Math.ceil(l / i), f = Math.ceil(c / r);
-    let u = s.clone(), p = a.clone(), w = p.clone().add(new y.Vector3(0, 0, c)), x = u.clone().add(new y.Vector3(0, 0, c)), P = new y.Vector3().subVectors(p, u).normalize(), M = P.clone().negate();
-    new y.Vector3().subVectors(w, u).normalize().clone().negate();
-    let d = i / 2, g = l * c, b = i * r, V = g / b;
-    t(u, x, P, i, d, f, h, V, o), t(p, w, M, i, d, f, h, V, o), o.start = u, o.end = p;
-    const { newOriginalPoints: v } = ze(u, p, o.originalPoints);
+    const l = s.distanceTo(a), u = o.rooftopPz - o.start.z, h = Math.ceil(l / i), g = Math.ceil(u / r);
+    let c = s.clone(), m = a.clone(), w = m.clone().add(new y.Vector3(0, 0, u)), x = c.clone().add(new y.Vector3(0, 0, u)), P = new y.Vector3().subVectors(m, c).normalize(), M = P.clone().negate();
+    new y.Vector3().subVectors(w, c).normalize().clone().negate();
+    let f = i / 2, p = l * u, b = i * r, z = p / b;
+    t(c, x, P, i, f, g, h, z, o), t(m, w, M, i, f, g, h, z, o), o.start = c, o.end = m;
+    const { newOriginalPoints: v } = ze(c, m, o.originalPoints);
     o.originalPoints = v;
   }
 }, Rt = (n, t) => new y.Vector3(n.x, n.y, 0).distanceTo(new y.Vector3(t.x, t.y, 0)), mo = (n, t, e = 1e-6) => {
@@ -503,7 +503,7 @@ class yo {
     const l = [t, e, o, i];
     for (let P = 0; P < l.length; P++)
       this.isValidVector3(l[P]) || (console.error(`点${P + 1}包含无效数据:`, l[P]), l[P] = new y.Vector3(P, 0, P));
-    const c = new y.BufferGeometry(), h = new Float32Array([
+    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
       // 左上
-    ]), f = [0, 1, 2, 0, 2, 3], u = new Float32Array([
+    ]), g = [0, 1, 2, 0, 2, 3], c = new Float32Array([
       0,
       0,
       // 左下
@@ -534,9 +534,9 @@ class yo {
       1
       // 左上
     ]);
-    c.setAttribute("position", new y.BufferAttribute(h, 3)), c.setAttribute("uv", new y.BufferAttribute(u, 2)), c.setIndex(f), c.computeVertexNormals();
-    const p = new y.Mesh(c, r), w = new y.EdgesGeometry(c), x = new y.LineSegments(w, new y.LineBasicMaterial({ color: a }));
-    return s.add(x), p;
+    u.setAttribute("position", new y.BufferAttribute(h, 3)), u.setAttribute("uv", new y.BufferAttribute(c, 2)), u.setIndex(g), u.computeVertexNormals();
+    const m = new y.Mesh(u, r), w = new y.EdgesGeometry(u), x = new y.LineSegments(w, new y.LineBasicMaterial({ color: a }));
+    return s.add(x), m;
   }
   /**
    * 将一面墙体按 rows×cols 细分成小格 Mesh，每格存入 wallGroup。
@@ -549,31 +549,31 @@ class yo {
     const s = [];
     if (!t || !t.start || !t.end || isNaN(t.rooftopPz))
       return s;
-    const a = new y.Vector3(t.start.x, t.start.y, t.start.z), l = new y.Vector3(t.end.x, t.end.y, t.end.z), c = new y.Vector3(t.end.x, t.end.y, t.rooftopPz), h = new y.Vector3(t.start.x, t.start.y, t.rooftopPz), f = [a, l, c, h];
-    for (let m = 0; m < f.length; m++)
-      if (!this.isValidVector3(f[m]))
-        return console.error(`墙体基础点${m}无效:`, f[m]), s;
-    const u = a.distanceTo(l), p = Math.abs(t.rooftopPz - t.start.z);
-    if (u === 0 || p === 0)
+    const a = new y.Vector3(t.start.x, t.start.y, t.start.z), l = new y.Vector3(t.end.x, t.end.y, t.end.z), u = new y.Vector3(t.end.x, t.end.y, t.rooftopPz), h = new y.Vector3(t.start.x, t.start.y, t.rooftopPz), g = [a, l, u, h];
+    for (let d = 0; d < g.length; d++)
+      if (!this.isValidVector3(g[d]))
+        return console.error(`墙体基础点${d}无效:`, g[d]), s;
+    const c = a.distanceTo(l), m = Math.abs(t.rooftopPz - t.start.z);
+    if (c === 0 || m === 0)
       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, x = p / e, P = new y.Vector3().subVectors(l, a).normalize(), M = new y.Vector3(0, 0, 1);
-    for (let m = 0; m < e; m++)
-      for (let d = 0; d < o; d++)
+    const w = c / o, x = m / e, P = new y.Vector3().subVectors(l, a).normalize(), M = new y.Vector3(0, 0, 1);
+    for (let d = 0; d < e; d++)
+      for (let f = 0; f < o; f++)
         try {
-          const g = new y.Vector3().copy(a).add(P.clone().multiplyScalar(d * w)).add(M.clone().multiplyScalar(m * x)), b = new y.Vector3().copy(a).add(P.clone().multiplyScalar((d + 1) * w)).add(M.clone().multiplyScalar(m * x)), V = new y.Vector3().copy(a).add(P.clone().multiplyScalar((d + 1) * w)).add(M.clone().multiplyScalar((m + 1) * x)), v = new y.Vector3().copy(a).add(P.clone().multiplyScalar(d * w)).add(M.clone().multiplyScalar((m + 1) * x)), S = {
-            points: [g, b, V, v],
+          const p = new y.Vector3().copy(a).add(P.clone().multiplyScalar(f * w)).add(M.clone().multiplyScalar(d * x)), b = new y.Vector3().copy(a).add(P.clone().multiplyScalar((f + 1) * w)).add(M.clone().multiplyScalar(d * x)), z = new y.Vector3().copy(a).add(P.clone().multiplyScalar((f + 1) * w)).add(M.clone().multiplyScalar((d + 1) * x)), v = new y.Vector3().copy(a).add(P.clone().multiplyScalar(f * w)).add(M.clone().multiplyScalar((d + 1) * x)), S = {
+            points: [p, b, z, v],
             userData: {}
           };
           S.userData = {
             type: "wallSegment",
-            row: m,
-            col: d,
+            row: d,
+            col: f,
             originalMaterial: i,
             width: w,
             height: x
           }, s.push(S);
-        } catch (g) {
-          console.error(`创建墙体小平面(${m}, ${d})时出错:`, g);
+        } catch (p) {
+          console.error(`创建墙体小平面(${d}, ${f})时出错:`, p);
         }
     return s;
   }
@@ -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;
-    let f = !0;
-    return r < 0.5 && e > 0 && (f = this.checkSmallAreaDistribution(t, o, i)), c && h && f;
+    const r = t.area, s = t.minRequiredPoints, a = t.expectedDensity, l = e / Math.max(r, 1e-3), u = e >= s, h = l >= a * 0.3;
+    let g = !0;
+    return r < 0.5 && e > 0 && (g = this.checkSmallAreaDistribution(t, o, i)), u && h && g;
   }
   checkSmallAreaDistribution(t, e, o) {
     if (e.length < 2) return !0;
@@ -873,23 +873,23 @@ class yo {
     }), this.results.totalSegments = r.length;
     for (const s of r) {
       if (s.vertices.length < 4) continue;
-      const a = s.userData.center, l = `row${s.userData.row}_col${s.userData.col}`, [c, h, f, u] = s.vertices, p = new y.Vector3().subVectors(h, c).normalize(), w = new y.Vector3().subVectors(u, c).normalize(), x = c.distanceTo(h), P = c.distanceTo(u), M = new y.Plane();
-      M.setFromCoplanarPoints(c, h, u);
-      const m = x / 2, d = P / 2;
-      for (let g = 0; g < e.length; g++)
+      const a = s.userData.center, l = `row${s.userData.row}_col${s.userData.col}`, [u, h, g, c] = s.vertices, m = new y.Vector3().subVectors(h, u).normalize(), w = new y.Vector3().subVectors(c, u).normalize(), x = u.distanceTo(h), P = u.distanceTo(c), M = new y.Plane();
+      M.setFromCoplanarPoints(u, h, c);
+      const d = x / 2, f = P / 2;
+      for (let p = 0; p < e.length; p++)
         this.isPointInWallSegmentOptimized(
-          e[g],
+          e[p],
           a,
           M,
-          c,
-          p,
+          u,
+          m,
           w,
           x,
           P,
-          m,
           d,
+          f,
           o
-        ) && (this.results.pointsInSegments.has(l) || this.results.pointsInSegments.set(l, []), this.results.pointsInSegments.get(l).push(g));
+        ) && (this.results.pointsInSegments.has(l) || this.results.pointsInSegments.set(l, []), this.results.pointsInSegments.get(l).push(p));
     }
     return r.forEach((s) => {
       const a = `row${s.userData.row}_col${s.userData.col}`, l = this.results.pointsInSegments.has(a) ? this.results.pointsInSegments.get(a).length : 0;
@@ -911,14 +911,14 @@ class yo {
     }), this.results.analysisTime = performance.now() - i, this.printAnalysisResults(), this.results;
   }
   // 优化后的判断函数（移出重复计算）
-  isPointInWallSegmentOptimized(t, e, o, i, r, s, a, l, c, h, f) {
-    if (Math.abs(o.distanceToPoint(t)) > f)
+  isPointInWallSegmentOptimized(t, e, o, i, r, s, a, l, u, h, g) {
+    if (Math.abs(o.distanceToPoint(t)) > g)
       return !1;
-    const p = new y.Vector3().subVectors(t, e), w = Math.abs(p.dot(r)), x = Math.abs(p.dot(s));
-    if (w > c && x > h)
+    const m = new y.Vector3().subVectors(t, e), w = Math.abs(m.dot(r)), x = Math.abs(m.dot(s));
+    if (w > u && x > h)
       return !1;
-    const P = new y.Vector3().subVectors(t, i), M = P.dot(r), m = P.dot(s), d = M >= -f && M <= a + f, g = m >= -f && m <= l + f;
-    return d && g;
+    const P = new y.Vector3().subVectors(t, i), M = P.dot(r), d = P.dot(s), f = M >= -g && M <= a + g, p = d >= -g && d <= l + g;
+    return f && p;
   }
   // 判断点是否在细分墙体平面内
   isPointInWallSegment(t, e, o, i = 0.1) {
@@ -932,13 +932,13 @@ class yo {
   }
   // 判断点是否在任意旋转的墙体平面内
   isPointInRotatedWall(t, e, o, i = 0.1) {
-    const [r, s, a, l] = t, c = new y.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 f = new y.Vector3().subVectors(s, r).normalize(), u = new y.Vector3().subVectors(l, r).normalize();
-    new y.Vector3().crossVectors(f, u).normalize();
-    const p = new y.Vector3().subVectors(e, r), w = p.dot(f), x = p.dot(u), P = r.distanceTo(s), M = r.distanceTo(l), m = w >= -i && w <= P + i, d = x >= -i && x <= M + i;
-    return m && d && o.distanceTo(e) < P / 2 && o.distanceTo(e) < M / 2;
+    const g = new y.Vector3().subVectors(s, r).normalize(), c = new y.Vector3().subVectors(l, r).normalize();
+    new y.Vector3().crossVectors(g, c).normalize();
+    const m = new y.Vector3().subVectors(e, r), w = m.dot(g), x = m.dot(c), P = r.distanceTo(s), M = r.distanceTo(l), d = w >= -i && w <= P + i, f = x >= -i && x <= M + i;
+    return d && f && o.distanceTo(e) < P / 2 && o.distanceTo(e) < M / 2;
   }
   // 优化顶点获取（添加缓存）
   getWorldVertices(t) {
@@ -1006,23 +1006,23 @@ class yo {
   // }
   // 高亮没有点的平面并进行聚类
   highlightEmptySegments(t, e, o, i = 1) {
-    var f;
+    var g;
     if (!this.results) {
       console.warn("请先运行分析函数");
       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 p = `row${u.userData.row}_col${u.userData.col}`, w = r.has(p);
-        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, {
-          segmentKey: p,
+    }), t.forEach((c) => {
+      if (c.userData && c.userData.type === "wallSegment") {
+        const m = `row${c.userData.row}_col${c.userData.col}`, w = r.has(m);
+        s.has(c.userData.row) || s.set(c.userData.row, /* @__PURE__ */ new Map()), s.get(c.userData.row).has(c.userData.col) || s.get(c.userData.row).set(c.userData.col, {
+          segmentKey: m,
           isEmpty: w,
           visited: !1
         });
@@ -1038,29 +1038,29 @@ class yo {
       [-1, 0]
       // 上
     ];
-    for (const [u, p] of r) {
-      const w = (f = s.get(p.row)) == null ? void 0 : f.get(p.col);
+    for (const [c, m] of r) {
+      const w = (g = s.get(m.row)) == null ? void 0 : g.get(m.col);
       if (w && !w.visited) {
-        const x = [], P = [[p.row, p.col]];
+        const x = [], P = [[m.row, m.col]];
         for (w.visited = !0; P.length > 0; ) {
-          const [M, m] = P.shift(), d = `row${M}_col${m}`;
-          r.has(d) && x.push(r.get(d));
-          for (const [g, b] of l) {
-            const V = M + g, v = m + b;
-            if (s.has(V) && s.get(V).has(v)) {
-              const S = s.get(V).get(v);
-              !S.visited && S.isEmpty && (S.visited = !0, P.push([V, v]));
+          const [M, d] = P.shift(), f = `row${M}_col${d}`;
+          r.has(f) && x.push(r.get(f));
+          for (const [p, b] of l) {
+            const z = M + p, v = d + 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]));
             }
           }
         }
         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, p) => p.length - u.length),
+      clusters: a.sort((c, m) => m.length - c.length),
       highlightedMeshes: h,
-      clusterMaterials: c,
+      clusterMaterials: u,
       totalClusters: a.length,
       totalHighlighted: h.length
     }, this.clusterResults;
@@ -1073,20 +1073,20 @@ class yo {
     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 x = i; x <= r; x++)
-      t.has(c) && t.get(c).has(x) || (h = !1);
+      t.has(u) && t.get(u).has(x) || (h = !1);
     h && s++;
-    const f = i;
-    let u = !0;
+    const g = i;
+    let c = !0;
     for (let x = e; x <= o; x++)
-      t.has(x) && t.get(x).has(f) || (u = !1);
-    u && s++;
-    const p = r;
+      t.has(x) && t.get(x).has(g) || (c = !1);
+    c && s++;
+    const m = r;
     let w = !0;
     for (let x = e; x <= o; x++)
-      t.has(x) && t.get(x).has(p) || (w = !1);
+      t.has(x) && t.get(x).has(m) || (w = !1);
     return w && s++, s / 4;
   }
   // 计算聚类质量分数
@@ -1096,20 +1096,20 @@ class yo {
   }
   // 计算严格的聚类边界尺寸（基于实际几何）
   calculateStrictClusterBounds(t) {
-    var f, u;
+    var g, c;
     if (t.length === 0) return { width: 0, height: 0 };
     const e = [];
-    if (t.forEach((p) => {
-      p.vertices && p.vertices.length > 0 && e.push(...p.vertices);
+    if (t.forEach((m) => {
+      m.vertices && m.vertices.length > 0 && e.push(...m.vertices);
     }), e.length === 0) {
-      const p = [...new Set(t.map((x) => x.row))];
+      const m = [...new Set(t.map((x) => x.row))];
       return {
-        width: [...new Set(t.map((x) => x.col))].length * (((f = t[0].bounds) == null ? void 0 : f.width) || 1),
-        height: p.length * (((u = t[0].bounds) == null ? void 0 : u.height) || 1)
+        width: [...new Set(t.map((x) => x.col))].length * (((g = t[0].bounds) == null ? void 0 : g.width) || 1),
+        height: m.length * (((c = t[0].bounds) == null ? void 0 : c.height) || 1)
       };
     }
-    const o = Math.min(...e.map((p) => p.x)), i = Math.max(...e.map((p) => p.x)), r = Math.min(...e.map((p) => p.y)), s = Math.max(...e.map((p) => p.y)), a = Math.min(...e.map((p) => p.z)), l = Math.max(...e.map((p) => p.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((m) => m.x)), i = Math.max(...e.map((m) => m.x)), r = Math.min(...e.map((m) => m.y)), s = Math.max(...e.map((m) => m.y)), a = Math.min(...e.map((m) => m.z)), l = Math.max(...e.map((m) => m.z)), u = Math.abs(i - o), h = Math.max(Math.abs(s - r), Math.abs(l - a));
+    return { width: u, height: h };
   }
   // 创建不同颜色的聚类材质
   createClusterMaterials(t) {
@@ -1182,8 +1182,8 @@ class yo {
       if (o.userData && o.userData.type === "wallSegment") {
         const i = this.getWorldVertices(o);
         if (i.length < 4) return;
-        const r = new y.Vector3().add(i[0]).add(i[1]).add(i[2]).add(i[3]).multiplyScalar(0.25), s = new y.Vector3().subVectors(i[1], i[0]).normalize(), a = new y.Vector3().subVectors(i[3], i[0]).normalize(), l = new y.Vector3().crossVectors(s, a).normalize(), c = new y.ArrowHelper(l, r, 0.3, 16711680), h = new y.ArrowHelper(s, r, 0.2, 65280), f = new y.ArrowHelper(a, r, 0.2, 255);
-        e.add(c), e.add(h), e.add(f);
+        const r = new y.Vector3().add(i[0]).add(i[1]).add(i[2]).add(i[3]).multiplyScalar(0.25), s = new y.Vector3().subVectors(i[1], i[0]).normalize(), a = new y.Vector3().subVectors(i[3], i[0]).normalize(), l = new y.Vector3().crossVectors(s, a).normalize(), u = new y.ArrowHelper(l, r, 0.3, 16711680), h = new y.ArrowHelper(s, r, 0.2, 65280), g = new y.ArrowHelper(a, r, 0.2, 255);
+        e.add(u), e.add(h), e.add(g);
       }
     }), e;
   }
@@ -1243,70 +1243,70 @@ const xo = (n) => {
     s.applyEuler(new y.Euler(-Math.PI / 2, 0, 0));
     let a = new y.Vector3(r.end.x, r.end.y, r.end.z);
     if (a.applyEuler(new y.Euler(-Math.PI / 2, 0, 0)), t.add(ao(String(i), new y.Vector3((s.x + a.x) / 2, (s.y + a.y) / 2, (s.z + a.z) / 2))), (r.isBayWindow || r.isWindow) && e) continue;
-    const l = new no().setFromCoplanarPoints(new zt(r.start.x, r.start.y, r.start.z), new zt(r.end.x, r.end.y, r.end.z), new zt(r.start.x, r.start.y, r.rooftopPz)), c = [];
+    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)), f = Math.abs(r.rooftopPz - r.start.z), u = new y.MeshBasicMaterial({
+    const h = new zt(r.start.x, r.start.y, r.start.z).distanceTo(new zt(r.end.x, r.end.y, r.end.z)), g = Math.abs(r.rooftopPz - r.start.z), c = new y.MeshBasicMaterial({
       color: "red",
       side: y.DoubleSide,
       wireframe: !1,
       transparent: !0,
       opacity: 0.5
-    }), p = new y.Group(), w = new yo(), { horizontalSubdivisions: x, verticalSubdivisions: P } = w.initLimits4(h, f), M = w.createSubdividedWallPlane(r, P, x, u, p);
-    w.analyzePointDistribution(M, c, 0.01);
-    const m = new y.MeshBasicMaterial({
+    }), m = new y.Group(), w = new yo(), { horizontalSubdivisions: x, verticalSubdivisions: P } = w.initLimits4(h, g), M = w.createSubdividedWallPlane(r, P, x, c, m);
+    w.analyzePointDistribution(M, u, 0.01);
+    const d = new y.MeshBasicMaterial({
       color: "black",
       transparent: !0,
       opacity: 0.8,
       side: y.DoubleSide
-    }), d = w.highlightEmptySegments(M, m, p), g = [];
-    for (const v of d.clusters) {
+    }), f = w.highlightEmptySegments(M, d, m), p = [];
+    for (const v of f.clusters) {
       const S = xo(v);
-      S && g.push(S);
+      S && p.push(S);
     }
-    const V = wo(r).direction;
-    r.checkResults = g, 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;
 }, hi = (n, t) => {
   console.log("lines", n);
   for (let e = 0; e < n.length; e++) {
     const o = n[e], i = [];
-    o.originalPoints.forEach((d) => {
-      let g = new y.Vector3(d.x, d.y, 0), b = !1;
-      for (let V = 0; V < i.length; V++)
-        if (kt(g, i[V], 0.01)) {
+    o.originalPoints.forEach((f) => {
+      let p = new y.Vector3(f.x, f.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(g);
+      b || i.push(p);
     });
     const r = Math.round(Math.max(5, Math.min(350, 20 * Math.sqrt(o.length)))), s = 1;
-    let a = new y.Vector3(o.start.x, o.start.y, o.start.z), l = new y.Vector3(o.end.x, o.end.y, o.end.z), c = new y.Vector3().subVectors(l, a).normalize(), h = c.clone().cross(new y.Vector3(0, 0, 1)).normalize(), f = h.clone().negate(), u = [];
-    const p = [];
+    let a = new y.Vector3(o.start.x, o.start.y, o.start.z), l = new y.Vector3(o.end.x, o.end.y, o.end.z), u = new y.Vector3().subVectors(l, a).normalize(), h = u.clone().cross(new y.Vector3(0, 0, 1)).normalize(), g = h.clone().negate(), c = [];
+    const m = [];
     let w = o.length / r;
     console.log(w);
-    for (let d = 0; d < r; d++) {
-      const g = [];
-      g.push(a.clone().addScaledVector(h, s)), g.push(g[0].clone().addScaledVector(c, w)), g.push(g[1].clone().addScaledVector(f, s * 2)), g.push(a.clone().addScaledVector(f, w));
+    for (let f = 0; f < r; f++) {
+      const p = [];
+      p.push(a.clone().addScaledVector(h, s)), p.push(p[0].clone().addScaledVector(u, w)), p.push(p[1].clone().addScaledVector(g, s * 2)), p.push(a.clone().addScaledVector(g, w));
       let b = [];
-      for (let V = 0; V < i.length; V++)
-        u.includes(V) || Po(i[V], g) && (u.push(V), b.push(i[V]));
-      b.length > 0 && p.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 && m.push(Mo(b)), a = a.addScaledVector(u, w);
     }
     const x = new Float32Array(i.length * 3);
-    i.forEach((d, g) => {
-      x[g * 3] = d.x, x[g * 3 + 1] = d.y, x[g * 3 + 2] = d.z;
+    i.forEach((f, p) => {
+      x[p * 3] = f.x, x[p * 3 + 1] = f.y, x[p * 3 + 2] = f.z;
     });
     const P = new y.BufferGeometry();
     P.setAttribute("position", new y.BufferAttribute(x, 3)), P.rotateX(-Math.PI / 2), t.add(new y.Points(P, new y.PointsMaterial({ color: go(), size: 0.02 })));
-    const [M, m] = vo(p, {
+    const [M, d] = vo(m, {
       plane: "xy",
       trimRatio: 0
     });
-    so(M, m, t);
+    so(M, d, 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;
   }
@@ -1380,11 +1380,11 @@ 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,72 +1401,72 @@ 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 R = B.x - r, W = B.y - s;
-    l += R * R, c += R * W, h += W * W;
+    l += R * R, u += R * W, h += W * W;
   }
-  l /= i.length, c /= i.length, h /= i.length;
-  const f = So(l, c, h), u = {
-    x: -f.y,
-    y: f.x
-  }, p = [];
+  l /= i.length, u /= i.length, h /= i.length;
+  const g = So(l, u, h), c = {
+    x: -g.y,
+    y: g.x
+  }, m = [];
   for (const B of i) {
-    const R = B.x - r, W = B.y - s, C = R * f.x + W * f.y, L = R * u.x + W * u.y;
-    p.push({
+    const R = B.x - r, W = B.y - s, C = R * g.x + W * g.y, L = R * c.x + W * c.y;
+    m.push({
       s: C,
       t: L,
       up: B.up
     });
   }
-  p.sort((B, R) => B.s - R.s);
-  const w = p.length;
+  m.sort((B, R) => B.s - R.s);
+  const w = m.length;
   let x = Math.floor(w * o), P = Math.ceil(w * (1 - o)) - 1;
   x = Math.max(0, Math.min(w - 1, x)), P = Math.max(0, Math.min(w - 1, P));
-  const M = p[x], m = p[P], d = (() => {
-    const B = p.map((W) => W.t).sort((W, C) => W - C), R = Math.floor(B.length / 2);
+  const M = m[x], d = m[P], f = (() => {
+    const B = m.map((W) => W.t).sort((W, C) => W - C), R = Math.floor(B.length / 2);
     return B.length % 2 === 0 ? (B[R - 1] + B[R]) * 0.5 : B[R];
-  })(), g = (() => {
-    const B = p.map((W) => W.up).sort((W, C) => W - C), R = Math.floor(B.length / 2);
+  })(), p = (() => {
+    const B = m.map((W) => W.up).sort((W, C) => W - C), R = Math.floor(B.length / 2);
     return B.length % 2 === 0 ? (B[R - 1] + B[R]) * 0.5 : B[R];
-  })(), b = M.s, V = m.s, v = d, S = d, z = g, D = g, _ = r + f.x * b + u.x * v, T = s + f.y * b + u.y * v, E = r + f.x * V + u.x * S, A = s + f.y * V + u.y * S, O = nn(_, T, z, e), I = nn(E, A, D, e);
+  })(), b = M.s, z = d.s, v = f, S = f, V = p, D = p, _ = r + g.x * b + c.x * v, T = s + g.y * b + c.y * v, E = r + g.x * z + c.x * S, A = s + g.y * z + c.y * S, O = nn(_, T, V, e), I = nn(E, A, D, e);
   return [O, I];
 }
 const fi = async (n, t, e, o, i) => {
   if (o && o.length > 0)
-    for (let d = 0; d < o.length; d++) {
-      const g = o[d];
-      g.isLine2 = !0, n.push(g);
+    for (let f = 0; f < o.length; f++) {
+      const p = o[f];
+      p.isLine2 = !0, n.push(p);
     }
   if (fo(n), n.length <= 0 || t.length <= 0)
     return n;
   e || (e = []);
-  for (const d of n) {
-    let g = [];
-    if (!(!d.checkResults || d.checkResults.length <= 0)) {
-      for (let b = 0; b < d.checkResults.length; b++) {
+  for (const f of n) {
+    let p = [];
+    if (!(!f.checkResults || f.checkResults.length <= 0)) {
+      for (let b = 0; b < f.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 = d.checkResults[b];
-        if (V.isDoor = !1, !V.originalVertices || V.originalVertices.length == 0)
+        const z = f.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 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((W) => B.some((C) => W.equals(C)))) {
               const W = D(A), C = D(O);
-              W !== C && (z[W] = C);
+              W !== C && (V[W] = C);
             }
           }
         const _ = /* @__PURE__ */ new Map();
@@ -1493,82 +1493,82 @@ const fi = async (n, t, e, o, i) => {
           }
           I.gridWidth = T, I.gridHeight = E;
         }
-        g.push(..._.values());
+        p.push(..._.values());
       }
-      d.mergeCheckRegion = g;
+      f.mergeCheckRegion = p;
     }
   }
   let r = /* @__PURE__ */ new Map();
-  for (const d of n) {
-    if (d.length < 0.3) continue;
-    let g = d.rooftopPz - d.start.z, b = Math.floor(d.rooftopPz - d.start.z);
+  for (const f of n) {
+    if (f.length < 0.3) continue;
+    let p = f.rooftopPz - f.start.z, b = Math.floor(f.rooftopPz - f.start.z);
     r.has(b) ? r.set(b, {
       num: r.get(b).num + 1,
-      totalHeight: r.get(b).totalHeight + g
+      totalHeight: r.get(b).totalHeight + p
     }) : r.set(b, {
       num: 1,
-      totalHeight: g
+      totalHeight: p
     });
   }
   let s = [...r.entries()].reduce(
-    (d, g) => g[1].num > d[1].num ? g : d
+    (f, p) => p[1].num > f[1].num ? p : f
   );
   s[0], s[1].totalHeight / s[1].num;
   const a = [];
-  for (let d = 0; d < e.length; d++) {
-    const g = e[d];
-    if (g.isFindBeam = !1, g.category == "door") {
+  for (let f = 0; f < e.length; f++) {
+    const p = e[f];
+    if (p.isFindBeam = !1, p.category == "door") {
       let b = [];
-      g.coordinatesByArea.coordinates.forEach((D) => {
+      p.coordinatesByArea.coordinates.forEach((D) => {
         b.push(new y.Vector3(D.x, D.y, D.z));
       }), b[0].equals(b[b.length - 1]) && b.pop();
-      let 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: g.coordinatesByArea.heightData.minZ,
-        maxZ: g.coordinatesByArea.heightData.maxZ,
-        index: d,
+        minZ: p.coordinatesByArea.heightData.minZ,
+        maxZ: p.coordinatesByArea.heightData.maxZ,
+        index: f,
         isFind: !1,
         inWall: !1
         //是否在墙内
       });
     }
   }
-  for (let d = 0; d < a.length; d++) {
-    const g = a[d];
+  for (let f = 0; f < a.length; f++) {
+    const p = a[f];
     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 = g.boxPoints.length;
-      for (let D = 0; D < V.length; D++) {
-        const _ = V[D].x, T = V[D].y;
-        for (let E = 0, A = z - 1; E < z; A = E++) {
-          const O = g.boxPoints[E].x, I = g.boxPoints[E].y, B = g.boxPoints[A].x, R = g.boxPoints[A].y;
+      const V = p.boxPoints.length;
+      for (let D = 0; D < z.length; D++) {
+        const _ = z[D].x, T = z[D].y;
+        for (let E = 0, A = V - 1; E < V; A = E++) {
+          const O = p.boxPoints[E].x, I = p.boxPoints[E].y, B = p.boxPoints[A].x, R = p.boxPoints[A].y;
           I > T != R > T && _ < (B - O) * (T - I) / (R - I) + O && (S = !S);
         }
         if (S) break;
       }
       if (S) {
-        let D = new y.Vector3(n[b].start.x, n[b].start.y, 0), _ = new y.Vector3(n[b].end.x, n[b].end.y, 0), T = g.doorStartPt.distanceTo(g.doorEndPt), E = D.distanceTo(_), A = Jt(g.doorStartPt, g.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), T = p.doorStartPt.distanceTo(p.doorEndPt), E = D.distanceTo(_), A = Jt(p.doorStartPt, p.doorEndPt, D, _);
         if (Math.abs(E - T) < 0.5 && A && A.angleDeg < 15) {
-          g.doorStartPt = new y.Vector3(n[b].start.x, n[b].start.y, 0), g.doorEndPt = new y.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(E - T) > 1.3 && A && A.angleDeg < 15) {
-          let O = ne(g.doorStartPt, g.doorEndPt, D, _, { parallelAngleMax: y.MathUtils.degToRad(15) }), I = g.doorStartPt.distanceTo(D), B = g.doorStartPt.distanceTo(_), R = g.doorEndPt.distanceTo(D), W = g.doorEndPt.distanceTo(_), C = I < 0.2 || B < 0.2 || R < 0.2 || W < 0.2;
+          let O = ne(p.doorStartPt, p.doorEndPt, D, _, { parallelAngleMax: y.MathUtils.degToRad(15) }), I = p.doorStartPt.distanceTo(D), B = p.doorStartPt.distanceTo(_), R = p.doorEndPt.distanceTo(D), W = p.doorEndPt.distanceTo(_), C = I < 0.2 || B < 0.2 || R < 0.2 || W < 0.2;
           if (O && O.type == "collinear_overlap" && O.maxPerpendicularDistance < 0.1 && !C) {
-            g.inWall = !0;
+            p.inWall = !0;
             break;
           } else {
-            let L = new y.Line3(D, _), H = L.closestPointToPoint(g.doorStartPt, !0, new y.Vector3()), X = L.closestPointToPoint(g.doorEndPt, !0, new y.Vector3()), ot = H.distanceTo(g.doorStartPt), K = X.distanceTo(g.doorEndPt);
+            let L = new y.Line3(D, _), H = L.closestPointToPoint(p.doorStartPt, !0, new y.Vector3()), X = L.closestPointToPoint(p.doorEndPt, !0, new y.Vector3()), ot = H.distanceTo(p.doorStartPt), K = X.distanceTo(p.doorEndPt);
             if (ot < 0.1 || K < 0.1) {
-              g.inWall = !0;
+              p.inWall = !0;
               break;
             }
           }
@@ -1577,21 +1577,21 @@ const fi = async (n, t, e, o, i) => {
         continue;
     }
   }
-  let l = 0, c = [], h = [], f = [];
-  const u = [];
-  let p = 0.15;
-  for (let d = 0; d < n.length; d++) {
-    const g = n[d];
-    if (g.noDetection || (g.doorAndBeamData = [], !g.mergeCheckRegion || g.mergeCheckRegion.length == 0))
+  let l = 0, u = [], h = [], g = [];
+  const c = [];
+  let m = 0.15;
+  for (let f = 0; f < n.length; f++) {
+    const p = n[f];
+    if (p.noDetection || (p.doorAndBeamData = [], !p.mergeCheckRegion || p.mergeCheckRegion.length == 0))
       continue;
-    g.completePointAreaPercentage = -1;
+    p.completePointAreaPercentage = -1;
     let b = new y.Box3();
-    b.setFromPoints(g.originalPoints);
-    let V = b.max.z;
+    b.setFromPoints(p.originalPoints);
+    let z = b.max.z;
     b.min.z;
-    const v = new y.Vector3(g.start.x, g.start.y, g.start.z), S = new y.Vector3(g.end.x, g.end.y, g.end.z);
-    let z = g.rooftopPz - g.start.z, D = 0;
-    for (const T of g.mergeCheckRegion) {
+    const v = new y.Vector3(p.start.x, p.start.y, p.start.z), S = new y.Vector3(p.end.x, p.end.y, p.end.z);
+    let V = p.rooftopPz - p.start.z, D = 0;
+    for (const T of p.mergeCheckRegion) {
       const { facePoints: E, boxArea: A, totalInPlaneNum: O } = co(
         T.points,
         T.gridWidth,
@@ -1641,23 +1641,23 @@ const fi = async (n, t, e, o, i) => {
       if (O != 0 && (G = T.gridHeight * T.gridWidth * O), (T.area - G) / A * 100 > 70 && K.length == 1 || K.length > 1)
         for (let rt = 0; rt < K.length; rt++) {
           const F = K[rt];
-          let Y = F.facePoints[0].distanceTo(F.facePoints[1]), Mt = F.facePoints[0].distanceTo(F.facePoints[3]), Zt = Y / g.length * 100, Nt = g.rooftopPz - F.facePoints[2].z;
-          if (Mt < 1.5 || V < F.facePoints[2].z || Nt > z / 3 * 2)
+          let Y = F.facePoints[0].distanceTo(F.facePoints[1]), Mt = F.facePoints[0].distanceTo(F.facePoints[3]), Zt = Y / p.length * 100, Nt = p.rooftopPz - F.facePoints[2].z;
+          if (Mt < 1.5 || z < F.facePoints[2].z || Nt > V / 3 * 2)
             continue;
           let Lt = !1, _t = !1, Tt = !1, Ft = [], tt = F.facePoints[2].clone(), lt = F.facePoints[3].clone(), q = F.facePoints[0].clone(), j = F.facePoints[1].clone(), Wt = !1, Et = -1;
-          if (Math.abs(F.facePoints[0].z - g.start.z) < 0.25) {
-            if (Y > 0.17 && g.length > 0.5) {
+          if (Math.abs(F.facePoints[0].z - p.start.z) < 0.25) {
+            if (Y > 0.17 && p.length > 0.5) {
               let qt = Rt(v, q), J = Rt(v, j), ct = Rt(S, q), N = Rt(S, j);
               const bt = 0.1, Vt = 10;
               if (qt < bt || J < bt) {
-                const { newOriginalPoints: Ut } = ze(q, j, g.originalPoints), at = [];
+                const { newOriginalPoints: Ut } = ze(q, j, p.originalPoints), at = [];
                 if (Ut.forEach((Q) => {
                   Q.z >= tt.z ? at.push(Q) : Q.z <= q.z;
                 }), at.length > 10) {
-                  const Q = new y.Vector3(g.start.x, g.start.y, 0), gt = new y.Vector3(g.end.x, g.end.y, 0), Pt = new y.Vector3().subVectors(Q, gt).normalize();
+                  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 == d) continue;
+                    if (U == f) continue;
                     const it = new y.Vector3(n[U].start.x, n[U].start.y, 0), dt = new y.Vector3(n[U].end.x, n[U].end.y, 0), Ct = te(Q, gt, it, dt);
                     let St = re(Q, gt, it, dt);
                     if (Ct != null) {
@@ -1706,26 +1706,26 @@ const fi = async (n, t, e, o, i) => {
                       }
                     }
                   }
-                  if (ht != 1 / 0 && ht < 2 && (g.length - Y > 0.2 || g.length - Y < 0.02) && ht < Y * 3)
+                  if (ht != 1 / 0 && ht < 2 && (p.length - Y > 0.2 || p.length - Y < 0.02) && ht < Y * 3)
                     n[Z].length > 0.25 && Y + ht > 0.5 && (Wt = !0, qt < bt ? (lt = lt.addScaledVector(Pt, ht), q = q.addScaledVector(Pt, ht)) : (tt = tt.addScaledVector(Pt, ht), j = j.addScaledVector(Pt, ht)));
                   else {
-                    if (!k && !ft && g.length - Y > 0.1)
+                    if (!k && !ft && p.length - Y > 0.1)
                       continue;
-                    if (!k && !ft && g.length - Y < 0.1 && g.length < 1.8)
+                    if (!k && !ft && p.length - Y < 0.1 && p.length < 1.8)
                       continue;
                   }
                 } else
                   continue;
               }
               if (ct < bt || N < bt) {
-                const { newOriginalPoints: Ut } = ze(q, j, g.originalPoints), at = [];
+                const { newOriginalPoints: Ut } = ze(q, j, p.originalPoints), at = [];
                 if (Ut.forEach((Q) => {
                   Q.z >= tt.z ? at.push(Q) : Q.z <= q.z;
                 }), at.length > 10) {
-                  const Q = new y.Vector3(g.start.x, g.start.y, 0), gt = new y.Vector3(g.end.x, g.end.y, 0), Pt = new y.Vector3().subVectors(gt, Q).normalize();
+                  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 == d) continue;
+                    if (U == f) continue;
                     const it = new y.Vector3(n[U].start.x, n[U].start.y, 0), dt = new y.Vector3(n[U].end.x, n[U].end.y, 0), Ct = te(Q, gt, it, dt);
                     let St = re(Q, gt, it, dt);
                     if (Ct != null) {
@@ -1771,12 +1771,12 @@ const fi = async (n, t, e, o, i) => {
                       }
                     }
                   }
-                  if (ht != 1 / 0 && ht < 2 && (g.length - Y > 0.2 || g.length - Y < 0.02) && ht < Y * 3)
+                  if (ht != 1 / 0 && ht < 2 && (p.length - Y > 0.2 || p.length - Y < 0.02) && ht < Y * 3)
                     n[Z].length > 0.25 && Y + ht > 0.5 && (Wt = !0, ct < bt ? (lt = lt.addScaledVector(Pt, ht), q = q.addScaledVector(Pt, ht)) : (tt = tt.addScaledVector(Pt, ht), j = j.addScaledVector(Pt, ht)));
                   else {
-                    if (!k && !ft && g.length - Y > 0.1)
+                    if (!k && !ft && p.length - Y > 0.1)
                       continue;
-                    if (!k && !ft && g.length - Y < 0.1 && g.length < 1.8)
+                    if (!k && !ft && p.length - Y < 0.1 && p.length < 1.8)
                       continue;
                   }
                 } else
@@ -1784,7 +1784,7 @@ const fi = async (n, t, e, o, i) => {
               }
               Y = lt.distanceTo(tt);
             }
-            if (Zt < 85 && Y > 0.3 || Y > 0.7 && Mt > z - z / 3) {
+            if (Zt < 85 && Y > 0.3 || Y > 0.7 && Mt > V - V / 3) {
               let qt = !1;
               for (let J = 0; J < t.length; J++) {
                 let ct = J + 1;
@@ -1809,7 +1809,7 @@ const fi = async (n, t, e, o, i) => {
                     distanceThreshold: 2
                   });
                   if (at && at.type == "collinear_gap") {
-                    let Q = ee(ct, N), gt = new y.Line3(new y.Vector3(g.start.x, g.start.y, 0), new y.Vector3(g.end.x, g.end.y, 0)), Pt = new y.Vector3(), Gt = gt.closestPointToPoint(Q, !0, Pt);
+                    let Q = ee(ct, N), gt = new y.Line3(new y.Vector3(p.start.x, p.start.y, 0), new y.Vector3(p.end.x, p.end.y, 0)), Pt = new y.Vector3(), Gt = gt.closestPointToPoint(Q, !0, Pt);
                     if (Q.distanceTo(Gt) < 0.15) {
                       let Z = bt.distanceTo(ct), k = Vt.distanceTo(ct);
                       if (Z > 0.25 && k > 0.25) {
@@ -1837,15 +1837,15 @@ const fi = async (n, t, e, o, i) => {
                 for (let J = 0; J < a.length; J++) {
                   if (a[J].inWall) continue;
                   let ct = new y.Vector3(a[J].doorStartPt.x, a[J].doorStartPt.y, 0), N = new y.Vector3(a[J].doorEndPt.x, a[J].doorEndPt.y, 0), bt = new y.Vector3(F.facePoints[0].x, F.facePoints[0].y, 0), Vt = new y.Vector3(F.facePoints[1].x, F.facePoints[1].y, 0), Ut = new y.Vector3().subVectors(ct, N).normalize(), at = new y.Vector3().subVectors(bt, Vt).normalize(), Q = 0.25, gt = ct.clone().addScaledVector(Ut, Q), Pt = N.clone().addScaledVector(Ut.clone().negate(), Q), Gt = bt.clone().addScaledVector(at, Q), ht = Vt.clone().addScaledVector(at.clone().negate(), Q), Z = te(gt, Pt, Gt, ht), k = !0, ft = ct.distanceTo(bt), U = ct.distanceTo(Vt), it = N.distanceTo(bt), dt = N.distanceTo(Vt);
-                  (ft < p || U < p || it < p || dt < p || Z) && k && (e[a[J].index].isFindBeam = !0, _t = !0, a[J].isFind = !0, Et = J);
+                  (ft < m || U < m || it < m || dt < m || Z) && k && (e[a[J].index].isFindBeam = !0, _t = !0, a[J].isFind = !0, Et = J);
                 }
-              (_t || qt || Math.abs(Mt - z) > 0.1 && Mt > z / 2 && Y > 0.3) && (Lt = !0);
+              (_t || qt || Math.abs(Mt - V) > 0.1 && Mt > V / 2 && Y > 0.3) && (Lt = !0);
             }
           }
           if (Lt) {
             let qt = !1;
-            for (let Z = 0; Z < f.length; Z++) {
-              let k = ne(f[Z].start, f[Z].end, q, j);
+            for (let Z = 0; Z < g.length; Z++) {
+              let k = ne(g[Z].start, g[Z].end, q, j);
               if (k && k.type == "collinear_overlap" && k.maxPerpendicularDistance < 0.01) {
                 qt = !0;
                 break;
@@ -1855,7 +1855,7 @@ const fi = async (n, t, e, o, i) => {
               Et != -1 && (e[a[Et].index].isFindBeam = !1, a[Et].isFind = !1);
               continue;
             }
-            f.push({
+            g.push({
               start: q,
               end: j
             });
@@ -1864,7 +1864,7 @@ const fi = async (n, t, e, o, i) => {
               let Z = new y.Vector3().subVectors(q, j), k = new y.Vector3().subVectors(j, q), ft = 1 / 0, U = 1 / 0, it = q.clone(), dt = j.clone();
               const Ct = [], St = [];
               let At = new y.Line3(tt, lt), $ = new y.Vector3(), pt = 999999;
-              if (g.originalPoints.forEach((et) => {
+              if (p.originalPoints.forEach((et) => {
                 if (et.z - q.z < Mt / 2 + 0.1 && et.z - q.z > Mt / 2 - 0.1 && Ct.push(et), et.z > tt.z) {
                   let st = At.closestPointToPoint(et, !0, $), xt = new y.Vector3().subVectors(st, tt), vt = new y.Vector3().subVectors(st, lt), Bt = oe(Z, vt), wt = oe(k, xt);
                   Bt && Bt.parallel && !Bt.sameDirection && wt && wt.parallel && !wt.sameDirection && St.push(et);
@@ -1896,12 +1896,12 @@ const fi = async (n, t, e, o, i) => {
             let J = j.distanceTo(q);
             if (J < 0.4 && !_t || J < 0.3 && _t)
               continue;
-            h.includes(d) || h.push(d), g.checkResults[T.index].isDoor = !0;
+            h.includes(f) || h.push(f), p.checkResults[T.index].isDoor = !0;
             let ct = "", N = {
               id: l,
               beamStart: tt,
               beamEnd: lt,
-              beamHeight: g.rooftopPz - tt.z,
+              beamHeight: p.rooftopPz - tt.z,
               doorStart: q,
               doorEnd: j,
               doorHeight: Mt,
@@ -1914,8 +1914,8 @@ const fi = async (n, t, e, o, i) => {
               pcbDoorIndexs: Ft,
               beamNearWallVec: new y.Vector3(0, 0, 0)
             }, bt = !1, Vt = new y.Vector3(), Ut = new y.Vector3(), at = -1, Q = -1, gt = -1;
-            for (let Z = 0; Z < c.length; Z++) {
-              const k = n[c[Z].linesIndex].doorAndBeamData[c[Z].doorIndex];
+            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(
@@ -1935,7 +1935,7 @@ const fi = async (n, t, e, o, i) => {
                   let Bt = 0.8;
                   (k.isDoor || N.isDoor) && (k.isDoor = !0, N.isDoor = !0);
                   const wt = Ft.some((Xt) => k.pcbDoorIndexs.includes(Xt));
-                  U < it ? U > Bt && !k.isPullOutDoor ? (k.beamStart = tt.clone().addScaledVector(et, $), k.beamEnd = lt.clone().addScaledVector(et, $), k.doorStart = q.clone().addScaledVector(et, $), k.doorEnd = j.clone().addScaledVector(et, $), k.doorHeight = N.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : !Tt || Tt && k.isPullOutDoor && wt ? (N.beamStart = k.beamStart.clone().addScaledVector(pt, $), N.beamEnd = k.beamEnd.clone().addScaledVector(pt, $), N.doorStart = k.doorStart.clone().addScaledVector(pt, $), N.doorEnd = k.doorEnd.clone().addScaledVector(pt, $), N.doorHeight = k.doorHeight, N.beamStart.z = N.beamEnd.z = N.doorStart.z + N.doorHeight) : (k.beamStart = tt.clone().addScaledVector(et, $), k.beamEnd = lt.clone().addScaledVector(et, $), k.doorStart = q.clone().addScaledVector(et, $), k.doorEnd = j.clone().addScaledVector(et, $), k.doorHeight = N.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : U > it && (it > Bt && !Tt ? (N.beamStart = k.beamStart.clone().addScaledVector(et, $), N.beamEnd = k.beamEnd.clone().addScaledVector(et, $), N.doorStart = k.doorStart.clone().addScaledVector(et, $), N.doorEnd = k.doorEnd.clone().addScaledVector(et, $), N.doorHeight = k.doorHeight, N.beamStart.z = N.beamEnd.z = N.doorStart.z + N.doorHeight) : !k.isPullOutDoor || Tt && k.isPullOutDoor && wt ? (k.beamStart = tt.clone().addScaledVector(pt, $), k.beamEnd = lt.clone().addScaledVector(pt, $), k.doorStart = q.clone().addScaledVector(pt, $), k.doorEnd = j.clone().addScaledVector(pt, $), k.doorHeight = N.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : (N.beamStart = k.beamStart.clone().addScaledVector(et, $), N.beamEnd = k.beamEnd.clone().addScaledVector(et, $), N.doorStart = k.doorStart.clone().addScaledVector(et, $), N.doorEnd = k.doorEnd.clone().addScaledVector(et, $), N.doorHeight = k.doorHeight, N.beamStart.z = N.beamEnd.z = N.doorStart.z + N.doorHeight)), at = N.nearId, Vt = k.beamStart.clone(), Ut = k.beamEnd.clone(), bt = !0, Q = c[Z].linesIndex, gt = c[Z].doorIndex;
+                  U < it ? U > Bt && !k.isPullOutDoor ? (k.beamStart = tt.clone().addScaledVector(et, $), k.beamEnd = lt.clone().addScaledVector(et, $), k.doorStart = q.clone().addScaledVector(et, $), k.doorEnd = j.clone().addScaledVector(et, $), k.doorHeight = N.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : !Tt || Tt && k.isPullOutDoor && wt ? (N.beamStart = k.beamStart.clone().addScaledVector(pt, $), N.beamEnd = k.beamEnd.clone().addScaledVector(pt, $), N.doorStart = k.doorStart.clone().addScaledVector(pt, $), N.doorEnd = k.doorEnd.clone().addScaledVector(pt, $), N.doorHeight = k.doorHeight, N.beamStart.z = N.beamEnd.z = N.doorStart.z + N.doorHeight) : (k.beamStart = tt.clone().addScaledVector(et, $), k.beamEnd = lt.clone().addScaledVector(et, $), k.doorStart = q.clone().addScaledVector(et, $), k.doorEnd = j.clone().addScaledVector(et, $), k.doorHeight = N.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : U > it && (it > Bt && !Tt ? (N.beamStart = k.beamStart.clone().addScaledVector(et, $), N.beamEnd = k.beamEnd.clone().addScaledVector(et, $), N.doorStart = k.doorStart.clone().addScaledVector(et, $), N.doorEnd = k.doorEnd.clone().addScaledVector(et, $), N.doorHeight = k.doorHeight, N.beamStart.z = N.beamEnd.z = N.doorStart.z + N.doorHeight) : !k.isPullOutDoor || Tt && k.isPullOutDoor && wt ? (k.beamStart = tt.clone().addScaledVector(pt, $), k.beamEnd = lt.clone().addScaledVector(pt, $), k.doorStart = q.clone().addScaledVector(pt, $), k.doorEnd = j.clone().addScaledVector(pt, $), k.doorHeight = N.doorHeight, k.beamStart.z = k.beamEnd.z = k.doorStart.z + k.doorHeight) : (N.beamStart = k.beamStart.clone().addScaledVector(et, $), N.beamEnd = k.beamEnd.clone().addScaledVector(et, $), N.doorStart = k.doorStart.clone().addScaledVector(et, $), N.doorEnd = k.doorEnd.clone().addScaledVector(et, $), N.doorHeight = k.doorHeight, N.beamStart.z = N.beamEnd.z = N.doorStart.z + N.doorHeight)), at = N.nearId, Vt = k.beamStart.clone(), Ut = k.beamEnd.clone(), bt = !0, Q = u[Z].linesIndex, gt = u[Z].doorIndex;
                   break;
                 }
               }
@@ -1944,7 +1944,7 @@ const fi = async (n, t, e, o, i) => {
             if (!bt) {
               let Z = new y.Line3(q.clone(), j.clone());
               for (let k = 0; k < n.length; k++) {
-                if (n[k].length < 0.5 || k == d) continue;
+                if (n[k].length < 0.5 || k == f) continue;
                 let ft = new y.Vector3(n[k].start.x, n[k].start.y, n[k].start.z), U = new y.Vector3(n[k].end.x, n[k].end.y, n[k].end.z), it = ne(ft, U, q, j), dt = Jt(ft, U, q, j);
                 const Ct = ho(n[k]);
                 if (it && it.maxPerpendicularDistance < 0.5) {
@@ -1991,9 +1991,9 @@ const fi = 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 = N.doorStart.distanceTo(N.doorEnd);
             if (_t ? ct = "door" : ht > 1.8 ? ct = "beam" : ct = Pt && ht > 1 ? "beam" : "hole", N.type = ct, N.nearId != -1 && ct == "hole") {
               let Z = !1;
@@ -2007,68 +2007,68 @@ const fi = async (n, t, e, o, i) => {
                   if (Z) break;
                 }
             }
-            if (g.doorAndBeamData.push(N), c.push({
-              linesIndex: d,
-              doorIndex: g.doorAndBeamData.length - 1
+            if (p.doorAndBeamData.push(N), u.push({
+              linesIndex: f,
+              doorIndex: p.doorAndBeamData.length - 1
             }), l++, Tt && Y < 2) break;
           }
         }
     }
-    let _ = g.length * (g.rooftopPz - g.start.z);
-    g.completePointAreaPercentage = D / _ * 100;
+    let _ = p.length * (p.rooftopPz - p.start.z);
+    p.completePointAreaPercentage = D / _ * 100;
   }
   if (h.length > 1)
-    for (let d = 0; d < h.length; d++) {
-      let g = [];
-      for (let b = 0; b < n[h[d]].doorAndBeamData.length; b++) {
-        let V = !1;
-        if (n[h[d]].doorAndBeamData[b].type === "beam" && n[h[d]].doorAndBeamData[b].beamNearWallVec.x == 0 && n[h[d]].doorAndBeamData[b].beamNearWallVec.y == 0 && n[h[d]].doorAndBeamData[b].beamNearWallVec.z == 0 && n[h[d]].doorAndBeamData[b].nearId == -1 && (V = !0), !V) {
-          let v = n[h[d]].doorAndBeamData[b].doorStart.clone(), S = n[h[d]].doorAndBeamData[b].doorEnd.clone();
+    for (let f = 0; f < h.length; f++) {
+      let p = [];
+      for (let b = 0; b < n[h[f]].doorAndBeamData.length; b++) {
+        let z = !1;
+        if (n[h[f]].doorAndBeamData[b].type === "beam" && n[h[f]].doorAndBeamData[b].beamNearWallVec.x == 0 && n[h[f]].doorAndBeamData[b].beamNearWallVec.y == 0 && n[h[f]].doorAndBeamData[b].beamNearWallVec.z == 0 && n[h[f]].doorAndBeamData[b].nearId == -1 && (z = !0), !z) {
+          let v = n[h[f]].doorAndBeamData[b].doorStart.clone(), S = n[h[f]].doorAndBeamData[b].doorEnd.clone();
           v.z = S.z = 0;
-          let z = v.distanceTo(S);
+          let V = v.distanceTo(S);
           for (let D = 0; D < h.length; D++)
-            if (d != D)
+            if (f != D)
               for (let _ = 0; _ < n[h[D]].doorAndBeamData.length; _++) {
                 let T = n[h[D]].doorAndBeamData[_].doorStart.clone(), E = n[h[D]].doorAndBeamData[_].doorEnd.clone();
                 T.z = E.z = 0, T.distanceTo(E);
                 let A = ne(v, S, T, E);
                 if (A.type == "collinear_overlap" && A.maxPerpendicularDistance < 0.2) {
                   let O = new y.Line3(T, E), I = ee(v, S), B = O.closestPointToPoint(I, !0, new y.Vector3()), R = I.distanceTo(B);
-                  if (Math.abs(z - A.overlap) < 0.1 && R < 0.04) {
-                    n[h[D]].doorAndBeamData[_].nearId == n[h[d]].doorAndBeamData[b].id && (n[h[D]].doorAndBeamData[_].nearId = -1), V = !0;
+                  if (Math.abs(V - A.overlap) < 0.1 && R < 0.04) {
+                    n[h[D]].doorAndBeamData[_].nearId == n[h[f]].doorAndBeamData[b].id && (n[h[D]].doorAndBeamData[_].nearId = -1), z = !0;
                     break;
                   }
                 }
               }
         }
-        V || g.push(n[h[d]].doorAndBeamData[b]);
+        z || p.push(n[h[f]].doorAndBeamData[b]);
       }
-      g.length != n[h[d]].doorAndBeamData.length && (n[h[d]].doorAndBeamData = g);
+      p.length != n[h[f]].doorAndBeamData.length && (n[h[f]].doorAndBeamData = p);
     }
   let w = 0.65, x = 2, P = [], M = [];
-  for (let d = 0; d < a.length; d++) {
-    if (a[d].isFind || a[d].inWall)
+  for (let f = 0; f < a.length; f++) {
+    if (a[f].isFind || a[f].inWall)
       continue;
-    let g = new y.Vector3(a[d].doorStartPt.x, a[d].doorStartPt.y, 0), b = new y.Vector3(a[d].doorEndPt.x, a[d].doorEndPt.y, 0), V = new y.Vector3().subVectors(g, b).normalize();
+    let p = new y.Vector3(a[f].doorStartPt.x, a[f].doorStartPt.y, 0), b = new y.Vector3(a[f].doorEndPt.x, a[f].doorEndPt.y, 0), z = new y.Vector3().subVectors(p, b).normalize();
     for (let v = 0; v < n.length; v++) {
       if (n[v].length < 0.7 || n[v].completePointAreaPercentage > 60)
         continue;
-      let S = new y.Vector3(n[v].start.x, n[v].start.y, 0), z = new y.Vector3(n[v].end.x, n[v].end.y, 0), D = new y.Vector3().subVectors(S, z).normalize(), _ = 0.3, T = g.clone().addScaledVector(V, _), E = 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, T = p.clone().addScaledVector(z, _), E = b.clone().addScaledVector(z.clone().negate(), _), A = S.clone().addScaledVector(D, _), O = V.clone().addScaledVector(D.clone().negate(), _);
       te(T, E, A, O);
       let I = Jt(
         T,
         E,
         A,
         O
-      ), B = g.distanceTo(S) > b.distanceTo(S) ? b : g, R = B.distanceTo(S), W = B.distanceTo(z);
-      if ((R < p || W < p) && I && !I.isParallel) {
-        let L = g.distanceTo(S), H = g.distanceTo(z), X = L < H ? S : z, ot = !1;
+      ), B = p.distanceTo(S) > b.distanceTo(S) ? b : p, R = B.distanceTo(S), W = B.distanceTo(V);
+      if ((R < m || W < m) && I && !I.isParallel) {
+        let L = p.distanceTo(S), H = p.distanceTo(V), X = L < H ? S : V, ot = !1;
         for (let K = 0; K < n.length; K++) {
           if (K == v || P.includes(K) || n[K].length < 0.7)
             continue;
-          let G = new y.Vector3(n[K].start.x, n[K].start.y, 0), ut = new y.Vector3(n[K].end.x, n[K].end.y, 0), rt = new y.Vector3().subVectors(G, ut).normalize(), F = rt.clone().negate(), Y = G.clone().addScaledVector(rt, 5), Mt = ut.clone().addScaledVector(F, 5), Zt = re(S, z, G, ut), Nt = ne(S, z, G, ut), Lt = te(S, z, Y, Mt), _t = !0;
-          if (Lt != null && (_t = Lt.point.distanceTo(S) < p || Lt.point.distanceTo(z) < p), (Zt && Zt.angle > 85 || Nt && Nt.type == "collinear_gap") && _t) {
-            let Tt = new y.Line3(S, z), Ft = new y.Vector3(), tt = Tt.closestPointToPoint(G, !0, Ft), lt = Tt.closestPointToPoint(ut, !0, Ft), q = tt.distanceTo(G), j = lt.distanceTo(ut), Wt, Et;
+          let G = new y.Vector3(n[K].start.x, n[K].start.y, 0), ut = new y.Vector3(n[K].end.x, n[K].end.y, 0), rt = new y.Vector3().subVectors(G, ut).normalize(), F = rt.clone().negate(), Y = G.clone().addScaledVector(rt, 5), Mt = ut.clone().addScaledVector(F, 5), Zt = re(S, V, G, ut), Nt = ne(S, V, G, ut), Lt = te(S, V, Y, Mt), _t = !0;
+          if (Lt != null && (_t = Lt.point.distanceTo(S) < m || Lt.point.distanceTo(V) < m), (Zt && Zt.angle > 85 || Nt && Nt.type == "collinear_gap") && _t) {
+            let Tt = new y.Line3(S, V), Ft = new y.Vector3(), tt = Tt.closestPointToPoint(G, !0, Ft), lt = Tt.closestPointToPoint(ut, !0, Ft), q = tt.distanceTo(G), j = lt.distanceTo(ut), Wt, Et;
             if (q > j && j > w)
               Wt = ut, Et = lt;
             else if (q < j && q > w)
@@ -2080,7 +2080,7 @@ const fi = async (n, t, e, o, i) => {
             let qt = Jt(Wt, Et, G, ut), J = Jt(Wt, Et, T, E);
             if (J && J.isParallel || !qt || !qt.isParallel)
               continue;
-            let ct = ne(g, b, Wt, Et);
+            let ct = ne(p, b, Wt, Et);
             if (ct && ct.type == "collinear_overlap" && ct.maxPerpendicularDistance < 0.2)
               continue;
             Wt.z = Et.z = n[K].start.z;
@@ -2121,7 +2121,7 @@ const fi = async (n, t, e, o, i) => {
               type: "onlyDoor",
               isDoor: !0,
               beamNearWallVec: new y.Vector3(0, 0, 0)
-            }), e[a[d].index].isFindBeam = !0, e[a[d].index].isFindOnlyDoor = !0, u.push([{ id: l, beamStart: Wt, beamEnd: Et }]), l++, ot = !0;
+            }), e[a[f].index].isFindBeam = !0, e[a[f].index].isFindOnlyDoor = !0, c.push([{ id: l, beamStart: Wt, beamEnd: Et }]), l++, ot = !0;
             break;
           }
         }
@@ -2129,10 +2129,10 @@ const fi = async (n, t, e, o, i) => {
       }
     }
   }
-  let m = [];
-  for (let d = 0; d < n.length; d++)
-    n[d].isLine2 || m.push(n[d]), n[d].isLine2 && n[d].doorAndBeamData.length != 0 && m.push(n[d]);
-  return n.length = 0, n.push(...m), { lines: n, beamGroup: u };
+  let d = [];
+  for (let f = 0; f < n.length; f++)
+    n[f].isLine2 || d.push(n[f]), n[f].isLine2 && n[f].doorAndBeamData.length != 0 && d.push(n[f]);
+  return n.length = 0, n.push(...d), { lines: n, beamGroup: c };
 }, di = (n, t) => {
   if (!n || n.length <= 0) return;
   let e = {
@@ -2141,30 +2141,30 @@ const fi = 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 = [], f = new y.Vector3(n[l].start.x, n[l].start.y, n[l].start.z), u = new y.Vector3(n[l].end.x, n[l].end.y, n[l].end.z), w = new y.Vector3().subVectors(u, f).normalize().clone().negate(), x = new y.Vector3(), P = new y.Vector3(), M = new y.Vector3();
+    let h = [], g = new y.Vector3(n[l].start.x, n[l].start.y, n[l].start.z), c = new y.Vector3(n[l].end.x, n[l].end.y, n[l].end.z), w = new y.Vector3().subVectors(c, g).normalize().clone().negate(), x = new y.Vector3(), P = new y.Vector3(), M = new y.Vector3();
     new y.Vector3();
-    for (let m = 0; m < n.length; m++) {
-      let d = n[m].length;
-      if (m == l || d < i || d > r)
+    for (let d = 0; d < n.length; d++) {
+      let f = n[d].length;
+      if (d == l || f < i || f > r)
         continue;
-      let g = new y.Vector3(n[m].start.x, n[m].start.y, n[m].start.z), b = new y.Vector3(n[m].end.x, n[m].end.y, n[m].end.z), V = re(f, u, g, b);
-      if (!V || V.angle < 85)
+      let p = new y.Vector3(n[d].start.x, n[d].start.y, n[d].start.z), b = new y.Vector3(n[d].end.x, n[d].end.y, n[d].end.z), z = re(g, c, p, b);
+      if (!z || z.angle < 85)
         continue;
-      let v = kt(g, f), S = kt(g, u), z = kt(b, f), D = kt(b, u);
-      if (!(!v && !S && !z && !D)) {
-        v || S ? (x = g.clone(), P = b.clone()) : (x = b.clone(), P = g.clone()), M = new y.Vector3().subVectors(P, x).normalize(), M.clone().negate();
+      let v = kt(p, g), S = kt(p, c), V = kt(b, g), D = kt(b, c);
+      if (!(!v && !S && !V && !D)) {
+        v || S ? (x = p.clone(), P = b.clone()) : (x = b.clone(), P = p.clone()), M = new y.Vector3().subVectors(P, x).normalize(), M.clone().negate();
         for (let _ = 0; _ < n.length; _++) {
           let T = n[_].length;
-          if (_ == l || _ == m || T < i || T > r)
+          if (_ == l || _ == d || T < i || T > r)
             continue;
-          let E = new y.Vector3(n[_].start.x, n[_].start.y, n[_].start.z), A = new y.Vector3(n[_].end.x, n[_].end.y, n[_].end.z), O = re(g, b, E, A);
+          let E = new y.Vector3(n[_].start.x, n[_].start.y, n[_].start.z), A = new y.Vector3(n[_].end.x, n[_].end.y, n[_].end.z), O = re(p, b, E, A);
           if (!O || O.angle < 85)
             continue;
           let I = kt(E, P), B = kt(A, P);
@@ -2176,7 +2176,7 @@ const fi = async (n, t, e, o, i) => {
           if (!(!C || !C.parallel || !C.sameDirection)) {
             for (let L = 0; L < n.length; L++) {
               let H = n[L].length;
-              if (L == l || L == m || L == _ || H < i || H > r)
+              if (L == l || L == d || L == _ || H < i || H > r)
                 continue;
               let X = new y.Vector3(n[L].start.x, n[L].start.y, n[L].start.z), ot = new y.Vector3(n[L].end.x, n[L].end.y, n[L].end.z), K = re(X, ot, E, A);
               if (!K || K.angle < 85)
@@ -2186,11 +2186,11 @@ const fi = async (n, t, e, o, i) => {
               new y.Vector3();
               let rt = new y.Vector3();
               G ? (X.clone(), rt = ot.clone()) : (ot.clone(), rt = X.clone());
-              let F = kt(rt, f), Y = kt(rt, u);
+              let F = kt(rt, g), Y = kt(rt, c);
               if (!F && !Y) continue;
-              let Mt = c * d;
+              let Mt = u * f;
               if (!(Mt < s || Mt > a)) {
-                h = [n[l].uuid, n[m].uuid, n[_].uuid, n[L].uuid];
+                h = [n[l].uuid, n[d].uuid, n[_].uuid, n[L].uuid];
                 break;
               }
             }
@@ -2202,11 +2202,11 @@ const fi = async (n, t, e, o, i) => {
           break;
       }
     }
-    h.length == 4 && (h.forEach((m) => o.add(m)), e.rectangles.push(h));
+    h.length == 4 && (h.forEach((d) => o.add(d)), 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: [],
@@ -2214,34 +2214,34 @@ const fi = async (n, t, e, o, i) => {
         start: new y.Vector3(),
         end: new y.Vector3()
       }
-    }, f = new y.Vector3(n[l].start.x, n[l].start.y, n[l].start.z), u = new y.Vector3(n[l].end.x, n[l].end.y, n[l].end.z), p = !0, w = !0;
+    }, g = new y.Vector3(n[l].start.x, n[l].start.y, n[l].start.z), c = new y.Vector3(n[l].end.x, n[l].end.y, n[l].end.z), m = !0, w = !0;
     for (let M = 0; M < n.length; M++) {
       if (M == l || n[M].length < i)
         continue;
-      let m = new y.Vector3(n[M].start.x, n[M].start.y, n[M].start.z), d = new y.Vector3(n[M].end.x, n[M].end.y, n[M].end.z), g = kt(m, f), b = kt(d, f), V = kt(m, u), v = kt(d, u);
-      if (g || b ? p = !1 : (V || v) && (w = !1), !p && !w) break;
+      let d = new y.Vector3(n[M].start.x, n[M].start.y, n[M].start.z), f = new y.Vector3(n[M].end.x, n[M].end.y, n[M].end.z), p = kt(d, g), b = kt(f, g), z = kt(d, c), v = kt(f, c);
+      if (p || b ? m = !1 : (z || v) && (w = !1), !m && !w) break;
     }
-    if (!p && !w) continue;
+    if (!m && !w) continue;
     let x = new y.Vector3();
-    p || ([f, u] = [u, f]), x = new y.Vector3().subVectors(u, f).normalize();
+    m || ([g, c] = [c, g]), x = new y.Vector3().subVectors(c, g).normalize();
     let P = x.clone().negate();
     for (let M = 0; M < n.length; M++) {
-      let m = n[M].length;
-      if (M == l || o.has(M) || m < i || m > r)
+      let d = n[M].length;
+      if (M == l || o.has(M) || d < i || d > r)
         continue;
-      let d = new y.Vector3(n[M].start.x, n[M].start.y, n[M].start.z), g = new y.Vector3(n[M].end.x, n[M].end.y, n[M].end.z), b = re(f, u, d, g);
+      let f = new y.Vector3(n[M].start.x, n[M].start.y, n[M].start.z), p = new y.Vector3(n[M].end.x, n[M].end.y, n[M].end.z), b = re(g, c, f, p);
       if (!b || b.angle < 85)
         continue;
-      let V = kt(d, u), v = kt(g, u);
-      if (!V && !v) continue;
+      let z = kt(f, c), v = kt(p, c);
+      if (!z && !v) continue;
       new y.Vector3();
       let S = new y.Vector3();
-      V ? (d.clone(), S = g.clone()) : (g.clone(), S = d.clone());
-      for (let z = 0; z < n.length; z++) {
-        let D = n[z].length;
-        if (z == l || z == M || o.has(z) || D < i || D > r)
+      z ? (f.clone(), S = p.clone()) : (p.clone(), S = f.clone());
+      for (let V = 0; V < n.length; V++) {
+        let D = n[V].length;
+        if (V == l || V == M || o.has(V) || D < i || D > r)
           continue;
-        let _ = new y.Vector3(n[z].start.x, n[z].start.y, n[z].start.z), T = new y.Vector3(n[z].end.x, n[z].end.y, n[z].end.z), E = re(d, g, _, T);
+        let _ = new y.Vector3(n[V].start.x, n[V].start.y, n[V].start.z), T = new y.Vector3(n[V].end.x, n[V].end.y, n[V].end.z), E = re(f, p, _, T);
         if (!E || E.angle < 85)
           continue;
         let A = kt(_, S), O = kt(T, S);
@@ -2252,14 +2252,14 @@ const fi = async (n, t, e, o, i) => {
         if (!W || !W.parallel || !W.sameDirection) continue;
         let C = !0, L = !0;
         for (let X = 0; X < n.length; X++) {
-          if (X == z || n[X].length < i) continue;
+          if (X == V || n[X].length < i) continue;
           let ot = new y.Vector3(n[X].start.x, n[X].start.y, n[X].start.z), K = new y.Vector3(n[X].end.x, n[X].end.y, n[X].end.z), G = kt(ot, _), ut = kt(K, _), rt = kt(ot, T), F = kt(K, T);
           if (G || ut ? C = !1 : (rt || F) && (L = !1), !C && !L) break;
         }
         if (!C && !L) continue;
-        let H = c * m;
+        let H = u * d;
         if (!(H < s || H > a)) {
-          h.indexs = [n[l].uuid, n[M].uuid, n[z].uuid], h.missingEdge.start = B, h.missingEdge.end = f;
+          h.indexs = [n[l].uuid, n[M].uuid, n[V].uuid], h.missingEdge.start = B, h.missingEdge.end = g;
           break;
         }
       }
@@ -2270,17 +2270,17 @@ const fi = async (n, t, e, o, i) => {
   return e;
 }, ae = 11102230246251565e-32, $t = 134217729, Do = (3 + 8 * ae) * ae;
 function We(n, t, e, o, i) {
-  let r, s, a, l, c = t[0], h = o[0], f = 0, u = 0;
-  h > c == h > -c ? (r = c, c = t[++f]) : (r = h, h = o[++u]);
-  let p = 0;
-  if (f < n && u < e)
-    for (h > c == h > -c ? (s = c + r, a = r - (s - c), c = t[++f]) : (s = h + r, a = r - (s - h), h = o[++u]), r = s, a !== 0 && (i[p++] = a); f < n && u < e; )
-      h > c == h > -c ? (s = r + c, l = s - r, a = r - (s - l) + (c - l), c = t[++f]) : (s = r + h, l = s - r, a = r - (s - l) + (h - l), h = o[++u]), r = s, a !== 0 && (i[p++] = a);
-  for (; f < n; )
-    s = r + c, l = s - r, a = r - (s - l) + (c - l), c = t[++f], r = s, a !== 0 && (i[p++] = a);
-  for (; u < e; )
-    s = r + h, l = s - r, a = r - (s - l) + (h - l), h = o[++u], r = s, a !== 0 && (i[p++] = a);
-  return (r !== 0 || p === 0) && (i[p++] = r), p;
+  let r, s, a, l, u = t[0], h = o[0], g = 0, c = 0;
+  h > u == h > -u ? (r = u, u = t[++g]) : (r = h, h = o[++c]);
+  let m = 0;
+  if (g < n && c < e)
+    for (h > u == h > -u ? (s = u + r, a = r - (s - u), u = t[++g]) : (s = h + r, a = r - (s - h), h = o[++c]), r = s, a !== 0 && (i[m++] = a); g < n && c < e; )
+      h > u == h > -u ? (s = r + u, l = s - r, a = r - (s - l) + (u - l), u = t[++g]) : (s = r + h, l = s - r, a = r - (s - l) + (h - l), h = o[++c]), r = s, a !== 0 && (i[m++] = a);
+  for (; g < n; )
+    s = r + u, l = s - r, a = r - (s - l) + (u - l), u = t[++g], r = s, a !== 0 && (i[m++] = a);
+  for (; c < e; )
+    s = r + h, l = s - r, a = r - (s - l) + (h - l), h = o[++c], r = s, a !== 0 && (i[m++] = a);
+  return (r !== 0 || m === 0) && (i[m++] = r), m;
 }
 function _o(n, t) {
   let e = t[0];
@@ -2292,22 +2292,22 @@ function Ve(n) {
 }
 const To = (3 + 16 * ae) * ae, Eo = (2 + 12 * ae) * ae, Ao = (9 + 64 * ae) * ae * ae, me = Ve(4), on = Ve(8), rn = Ve(12), sn = Ve(16), jt = Ve(4);
 function Bo(n, t, e, o, i, r, s) {
-  let a, l, c, h, f, u, p, w, x, P, M, m, d, g, b, V, v, S;
-  const z = n - i, D = e - i, _ = t - r, T = o - r;
-  g = z * T, u = $t * z, p = u - (u - z), w = z - p, u = $t * T, x = u - (u - T), P = T - x, b = w * P - (g - p * x - w * x - p * P), V = _ * D, u = $t * _, p = u - (u - _), w = _ - p, u = $t * D, x = u - (u - D), P = D - x, v = w * P - (V - p * x - w * x - p * P), M = b - v, f = b - M, me[0] = b - (M + f) + (f - v), m = g + M, f = m - g, d = g - (m - f) + (M - f), M = d - V, f = d - M, me[1] = d - (M + f) + (f - V), S = m + M, f = S - m, me[2] = m - (S - f) + (M - f), me[3] = S;
+  let a, l, u, h, g, c, m, w, x, P, M, d, f, p, b, z, v, S;
+  const V = n - i, D = e - i, _ = t - r, T = o - r;
+  p = V * T, c = $t * V, m = c - (c - V), w = V - m, c = $t * T, x = c - (c - T), P = T - x, b = w * P - (p - m * x - w * x - m * P), z = _ * D, c = $t * _, m = c - (c - _), w = _ - m, c = $t * D, x = c - (c - D), P = D - x, v = w * P - (z - m * x - w * x - m * P), M = b - v, g = b - M, me[0] = b - (M + g) + (g - v), d = p + M, g = d - p, f = p - (d - g) + (M - g), M = f - z, g = f - M, me[1] = f - (M + g) + (g - z), S = d + M, g = S - d, me[2] = d - (S - g) + (M - g), me[3] = S;
   let E = _o(4, me), A = Eo * s;
-  if (E >= A || -E >= A || (f = n - z, a = n - (z + f) + (f - i), f = e - D, c = e - (D + f) + (f - i), f = t - _, l = t - (_ + f) + (f - r), f = o - T, h = o - (T + f) + (f - r), a === 0 && l === 0 && c === 0 && h === 0) || (A = Ao * s + Do * Math.abs(E), E += z * h + T * a - (_ * c + D * l), E >= A || -E >= A)) return E;
-  g = a * T, u = $t * a, p = u - (u - a), w = a - p, u = $t * T, x = u - (u - T), P = T - x, b = w * P - (g - p * x - w * x - p * P), V = l * D, u = $t * l, p = u - (u - l), w = l - p, u = $t * D, x = u - (u - D), P = D - x, v = w * P - (V - p * x - w * x - p * P), M = b - v, f = b - M, jt[0] = b - (M + f) + (f - v), m = g + M, f = m - g, d = g - (m - f) + (M - f), M = d - V, f = d - M, jt[1] = d - (M + f) + (f - V), S = m + M, f = S - m, jt[2] = m - (S - f) + (M - f), jt[3] = S;
+  if (E >= A || -E >= A || (g = n - V, a = n - (V + g) + (g - i), g = e - D, u = e - (D + g) + (g - i), g = t - _, l = t - (_ + g) + (g - r), g = o - T, h = o - (T + g) + (g - r), a === 0 && l === 0 && u === 0 && h === 0) || (A = Ao * s + Do * Math.abs(E), E += V * h + T * a - (_ * u + D * l), E >= A || -E >= A)) return E;
+  p = a * T, c = $t * a, m = c - (c - a), w = a - m, c = $t * T, x = c - (c - T), P = T - x, b = w * P - (p - m * x - w * x - m * P), z = l * D, c = $t * l, m = c - (c - l), w = l - m, c = $t * D, x = c - (c - D), P = D - x, v = w * P - (z - m * x - w * x - m * P), M = b - v, g = b - M, jt[0] = b - (M + g) + (g - v), d = p + M, g = d - p, f = p - (d - g) + (M - g), M = f - z, g = f - M, jt[1] = f - (M + g) + (g - z), S = d + M, g = S - d, jt[2] = d - (S - g) + (M - g), jt[3] = S;
   const O = We(4, me, 4, jt, on);
-  g = z * h, u = $t * z, p = u - (u - z), w = z - p, u = $t * h, x = u - (u - h), P = h - x, b = w * P - (g - p * x - w * x - p * P), V = _ * c, u = $t * _, p = u - (u - _), w = _ - p, u = $t * c, x = u - (u - c), P = c - x, v = w * P - (V - p * x - w * x - p * P), M = b - v, f = b - M, jt[0] = b - (M + f) + (f - v), m = g + M, f = m - g, d = g - (m - f) + (M - f), M = d - V, f = d - M, jt[1] = d - (M + f) + (f - V), S = m + M, f = S - m, jt[2] = m - (S - f) + (M - f), jt[3] = S;
+  p = V * h, c = $t * V, m = c - (c - V), w = V - m, c = $t * h, x = c - (c - h), P = h - x, b = w * P - (p - m * x - w * x - m * P), z = _ * u, c = $t * _, m = c - (c - _), w = _ - m, c = $t * u, x = c - (c - u), P = u - x, v = w * P - (z - m * x - w * x - m * P), M = b - v, g = b - M, jt[0] = b - (M + g) + (g - v), d = p + M, g = d - p, f = p - (d - g) + (M - g), M = f - z, g = f - M, jt[1] = f - (M + g) + (g - z), S = d + M, g = S - d, jt[2] = d - (S - g) + (M - g), jt[3] = S;
   const I = We(O, on, 4, jt, rn);
-  g = a * h, u = $t * a, p = u - (u - a), w = a - p, u = $t * h, x = u - (u - h), P = h - x, b = w * P - (g - p * x - w * x - p * P), V = l * c, u = $t * l, p = u - (u - l), w = l - p, u = $t * c, x = u - (u - c), P = c - x, v = w * P - (V - p * x - w * x - p * P), M = b - v, f = b - M, jt[0] = b - (M + f) + (f - v), m = g + M, f = m - g, d = g - (m - f) + (M - f), M = d - V, f = d - M, jt[1] = d - (M + f) + (f - V), S = m + M, f = S - m, jt[2] = m - (S - f) + (M - f), jt[3] = S;
+  p = a * h, c = $t * a, m = c - (c - a), w = a - m, c = $t * h, x = c - (c - h), P = h - x, b = w * P - (p - m * x - w * x - m * P), z = l * u, c = $t * l, m = c - (c - l), w = l - m, c = $t * u, x = c - (c - u), P = u - x, v = w * P - (z - m * x - w * x - m * P), M = b - v, g = b - M, jt[0] = b - (M + g) + (g - v), d = p + M, g = d - p, f = p - (d - g) + (M - g), M = f - z, g = f - M, jt[1] = f - (M + g) + (g - z), S = d + M, g = S - d, jt[2] = d - (S - g) + (M - g), jt[3] = S;
   const B = We(I, rn, 4, jt, sn);
   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) >= To * 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) >= To * 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 f = (a + c) / 2, u = (l + h) / 2;
-    let p = 0, w = 0, x = 0;
-    for (let z = 0, D = 1 / 0; z < s; z++) {
-      const _ = Ne(f, u, t[2 * z], t[2 * z + 1]);
-      _ < D && (p = z, D = _);
+    const g = (a + u) / 2, c = (l + h) / 2;
+    let m = 0, w = 0, x = 0;
+    for (let V = 0, D = 1 / 0; V < s; V++) {
+      const _ = Ne(g, c, t[2 * V], t[2 * V + 1]);
+      _ < D && (m = V, D = _);
     }
-    const P = t[2 * p], M = t[2 * p + 1];
-    for (let z = 0, D = 1 / 0; z < s; z++) {
-      if (z === p) continue;
-      const _ = Ne(P, M, t[2 * z], t[2 * z + 1]);
-      _ < D && _ > 0 && (w = z, D = _);
+    const P = t[2 * m], M = t[2 * m + 1];
+    for (let V = 0, D = 1 / 0; V < s; V++) {
+      if (V === m) continue;
+      const _ = Ne(P, M, t[2 * V], t[2 * V + 1]);
+      _ < D && _ > 0 && (w = V, D = _);
     }
-    let m = t[2 * w], d = t[2 * w + 1], g = 1 / 0;
-    for (let z = 0; z < s; z++) {
-      if (z === p || z === w) continue;
-      const D = Co(P, M, m, d, t[2 * z], t[2 * z + 1]);
-      D < g && (x = z, g = D);
+    let d = t[2 * w], f = t[2 * w + 1], p = 1 / 0;
+    for (let V = 0; V < s; V++) {
+      if (V === m || V === w) continue;
+      const D = Co(P, M, d, f, t[2 * V], t[2 * V + 1]);
+      D < p && (x = V, p = D);
     }
-    let b = t[2 * x], V = t[2 * x + 1];
-    if (g === 1 / 0) {
+    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, T = -1 / 0; _ < s; _++) {
         const E = this._ids[_], A = this._dists[E];
-        A > T && (z[D++] = E, T = A);
+        A > T && (V[D++] = E, T = 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(P, M, m, d, b, V) < 0) {
-      const z = w, D = m, _ = d;
-      w = x, m = b, d = V, x = z, b = D, V = _;
+    if (ve(P, M, d, f, b, z) < 0) {
+      const V = w, D = d, _ = f;
+      w = x, d = b, f = z, x = V, b = D, z = _;
     }
-    const v = Ro(P, M, m, d, b, V);
+    const v = Ro(P, M, d, f, b, z);
     this._cx = v.x, this._cy = v.y;
-    for (let z = 0; z < s; z++)
-      this._dists[z] = Ne(t[2 * z], t[2 * z + 1], v.x, v.y);
-    ye(this._ids, this._dists, 0, s - 1), this._hullStart = p;
+    for (let V = 0; V < s; V++)
+      this._dists[V] = Ne(t[2 * V], t[2 * V + 1], v.x, v.y);
+    ye(this._ids, this._dists, 0, s - 1), this._hullStart = m;
     let S = 3;
-    o[p] = e[x] = w, o[w] = e[p] = x, o[x] = e[w] = p, i[p] = 0, i[w] = 1, i[x] = 2, r.fill(-1), r[this._hashKey(P, M)] = p, r[this._hashKey(m, d)] = w, r[this._hashKey(b, V)] = x, this.trianglesLen = 0, this._addTriangle(p, w, x, -1, -1, -1);
-    for (let z = 0, D = 0, _ = 0; z < this._ids.length; z++) {
-      const T = this._ids[z], E = t[2 * T], A = t[2 * T + 1];
-      if (z > 0 && Math.abs(E - D) <= an && Math.abs(A - _) <= an || (D = E, _ = A, T === p || T === w || T === x)) continue;
+    o[m] = e[x] = w, o[w] = e[m] = x, o[x] = e[w] = m, i[m] = 0, i[w] = 1, i[x] = 2, r.fill(-1), r[this._hashKey(P, M)] = m, r[this._hashKey(d, f)] = w, r[this._hashKey(b, z)] = x, this.trianglesLen = 0, this._addTriangle(m, w, x, -1, -1, -1);
+    for (let V = 0, D = 0, _ = 0; V < this._ids.length; V++) {
+      const T = this._ids[V], E = t[2 * T], A = t[2 * T + 1];
+      if (V > 0 && Math.abs(E - D) <= an && Math.abs(A - _) <= an || (D = E, _ = A, T === m || T === w || T === x)) continue;
       let O = 0;
       for (let C = 0, L = this._hashKey(E, A); C < this._hashSize && (O = r[(L + C) % this._hashSize], !(O !== -1 && O !== o[O])); C++)
         ;
@@ -2421,8 +2421,8 @@ class Be {
       this._hullStart = e[T] = I, o[I] = e[W] = T, o[T] = W, r[this._hashKey(E, A)] = T, r[this._hashKey(t[2 * I], t[2 * I + 1])] = I;
     }
     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,32 +2451,32 @@ class Be {
         t = De[--r];
         continue;
       }
-      const c = a - a % 3, h = l + (t + 1) % 3, f = c + (a + 2) % 3, u = e[s], p = e[t], w = e[h], x = e[f];
+      const u = a - a % 3, h = l + (t + 1) % 3, g = u + (a + 2) % 3, c = e[s], m = e[t], w = e[h], x = e[g];
       if (ko(
-        i[2 * u],
-        i[2 * u + 1],
-        i[2 * p],
-        i[2 * p + 1],
+        i[2 * c],
+        i[2 * c + 1],
+        i[2 * m],
+        i[2 * m + 1],
         i[2 * w],
         i[2 * w + 1],
         i[2 * x],
         i[2 * x + 1]
       )) {
-        e[t] = x, e[a] = u;
-        const M = o[f];
+        e[t] = x, e[a] = c;
+        const M = o[g];
         if (M === -1) {
-          let d = this._hullStart;
+          let f = this._hullStart;
           do {
-            if (this._hullTri[d] === f) {
-              this._hullTri[d] = t;
+            if (this._hullTri[f] === g) {
+              this._hullTri[f] = t;
               break;
             }
-            d = this._hullPrev[d];
-          } while (d !== this._hullStart);
+            f = this._hullPrev[f];
+          } while (f !== this._hullStart);
         }
-        this._link(t, M), this._link(a, o[s]), this._link(s, f);
-        const m = c + (a + 1) % 3;
-        r < De.length && (De[r++] = m);
+        this._link(t, M), this._link(a, o[s]), this._link(s, g);
+        const d = u + (a + 1) % 3;
+        r < De.length && (De[r++] = d);
       } else {
         if (r === 0) break;
         t = De[--r];
@@ -2518,16 +2518,16 @@ function Ne(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, f = o - a, u = i - s, p = r - a, w = l * l + c * c, x = h * h + f * f, P = u * u + p * p;
-  return l * (f * P - x * p) - c * (h * P - x * u) + w * (h * p - f * u) < 0;
+  const l = n - s, u = t - a, h = e - s, g = o - a, c = i - s, m = r - a, w = l * l + u * u, x = h * h + g * g, P = c * c + m * m;
+  return l * (g * P - x * m) - u * (h * P - x * c) + w * (h * m - g * c) < 0;
 }
 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, f = l * l + c * c, u = 0.5 / (s * c - a * l), p = (c * h - a * f) * u, w = (s * f - l * h) * u;
-  return p * p + w * w;
+  const s = e - n, a = o - t, l = i - n, u = r - t, h = s * s + a * a, g = l * l + u * u, c = 0.5 / (s * u - a * l), m = (u * h - a * g) * c, w = (s * g - l * h) * c;
+  return m * m + w * w;
 }
 function Ro(n, t, e, o, i, r) {
-  const s = e - n, a = o - t, l = i - n, c = r - t, h = s * s + a * a, f = l * l + c * c, u = 0.5 / (s * c - a * l), p = n + (c * h - a * f) * u, w = t + (s * f - l * h) * u;
-  return { x: p, y: w };
+  const s = e - n, a = o - t, l = i - n, u = r - t, h = s * s + a * a, g = l * l + u * u, c = 0.5 / (s * u - a * l), m = n + (u * h - a * g) * c, w = t + (s * g - l * h) * c;
+  return { x: m, y: w };
 }
 function ye(n, t, e, o) {
   if (o - e <= 20)
@@ -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 x = 0, P = 0, M = o.length, m, d; x < M; x += 3, P += 2) {
-      const g = o[x] * 2, b = o[x + 1] * 2, V = o[x + 2] * 2, v = t[g], S = t[g + 1], z = t[b], D = t[b + 1], _ = t[V], T = t[V + 1], E = z - v, A = D - S, O = _ - v, I = T - S, B = (E * I - A * O) * 2;
+    for (let x = 0, P = 0, M = o.length, d, f; x < M; x += 3, P += 2) {
+      const p = o[x] * 2, b = o[x + 1] * 2, z = o[x + 2] * 2, v = t[p], S = t[p + 1], V = t[b], D = t[b + 1], _ = t[z], T = t[z + 1], E = V - v, A = D - S, O = _ - v, I = T - S, B = (E * I - A * O) * 2;
       if (Math.abs(B) < 1e-9) {
         if (r === void 0) {
           r = s = 0;
@@ -2631,32 +2631,32 @@ class Oo {
           r /= e.length, s /= e.length;
         }
         const R = 1e9 * Math.sign((r - v) * I - (s - S) * O);
-        m = (v + _) / 2 - R * I, d = (S + T) / 2 + R * O;
+        d = (v + _) / 2 - R * I, f = (S + T) / 2 + R * O;
       } else {
         const R = 1 / B, W = E * E + A * A, C = O * O + I * I;
-        m = v + (I * W - A * C) * R, d = S + (E * C - O * W) * R;
+        d = v + (I * W - A * C) * R, f = S + (E * C - O * W) * R;
       }
-      a[P] = m, a[P + 1] = d;
+      a[P] = d, a[P + 1] = f;
     }
-    let l = e[e.length - 1], c, h = l * 4, f, u = t[2 * l], p, w = t[2 * l + 1];
+    let l = e[e.length - 1], u, h = l * 4, g, c = t[2 * l], m, w = t[2 * l + 1];
     i.fill(0);
     for (let x = 0; x < e.length; ++x)
-      l = e[x], c = h, f = u, p = w, h = l * 4, u = t[2 * l], w = t[2 * l + 1], i[c + 2] = i[h] = p - w, i[c + 3] = i[h + 1] = u - f;
+      l = e[x], u = h, g = c, m = w, h = l * 4, c = t[2 * l], w = t[2 * l + 1], i[u + 2] = i[h] = m - w, i[u + 3] = i[h + 1] = c - g;
   }
   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, f = o.length; h < f; ++h) {
-      const u = o[h];
-      if (u < h) continue;
-      const p = Math.floor(h / 3) * 2, w = Math.floor(u / 3) * 2, x = s[p], P = s[p + 1], M = s[w], m = s[w + 1];
-      this._renderSegment(x, P, M, m, t);
+    for (let h = 0, g = o.length; h < g; ++h) {
+      const c = o[h];
+      if (c < h) continue;
+      const m = Math.floor(h / 3) * 2, w = Math.floor(c / 3) * 2, x = s[m], P = s[m + 1], M = s[w], d = s[w + 1];
+      this._renderSegment(x, P, M, d, t);
     }
-    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 f = Math.floor(i[c] / 3) * 2, u = s[f], p = s[f + 1], w = l * 4, x = this._project(u, p, a[w + 2], a[w + 3]);
-      x && this._renderSegment(u, p, x[0], x[1], t);
+      l = u, u = r[h];
+      const g = Math.floor(i[u] / 3) * 2, c = s[g], m = s[g + 1], w = l * 4, x = this._project(c, m, a[w + 2], a[w + 3]);
+      x && this._renderSegment(c, m, x[0], x[1], t);
     }
     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), f, u = 0;
-    for (let p = 0; p < o; p += 2)
-      if (r = a, s = l, a = e[p], l = e[p + 1], c = h, h = this._regioncode(a, l), c === 0 && h === 0)
-        f = u, u = 0, i ? i.push(a, l) : i = [a, l];
+    let i = null, r, s, a = e[o - 2], l = e[o - 1], u, h = this._regioncode(a, l), g, c = 0;
+    for (let m = 0; m < o; m += 2)
+      if (r = a, s = l, a = e[m], l = e[m + 1], u = h, h = this._regioncode(a, l), u === 0 && h === 0)
+        g = c, c = 0, i ? i.push(a, l) : i = [a, l];
       else {
-        let w, x, P, M, m;
-        if (c === 0) {
-          if ((w = this._clipSegment(r, s, a, l, c, h)) === null) continue;
-          [x, P, M, m] = w;
+        let w, x, P, M, d;
+        if (u === 0) {
+          if ((w = this._clipSegment(r, s, a, l, u, h)) === null) continue;
+          [x, P, M, d] = w;
         } else {
-          if ((w = this._clipSegment(a, l, r, s, h, c)) === null) continue;
-          [M, m, x, P] = w, f = u, u = this._edgecode(x, P), f && u && this._edge(t, f, u, i, i.length), i ? i.push(x, P) : i = [x, P];
+          if ((w = this._clipSegment(a, l, r, s, h, u)) === null) continue;
+          [M, d, x, P] = w, g = c, c = this._edgecode(x, P), g && c && this._edge(t, g, c, i, i.length), i ? i.push(x, P) : i = [x, P];
         }
-        f = u, u = this._edgecode(M, m), f && u && this._edge(t, f, u, i, i.length), i ? i.push(M, m) : i = [M, m];
+        g = c, c = this._edgecode(M, d), g && c && this._edge(t, g, c, i, i.length), i ? i.push(M, d) : i = [M, d];
       }
     if (i)
-      f = u, u = this._edgecode(i[0], i[1]), f && u && this._edge(t, f, u, i, i.length);
+      g = c, c = this._edgecode(i[0], i[1]), g && c && this._edge(t, g, 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, f, u = this._edgecode(a[h - 2], a[h - 1]); c < h; c += 2)
-        f = u, u = this._edgecode(a[c], a[c + 1]), f && u && (c = this._edge(t, f, u, a, c), h = a.length);
+      for (let u = 0, h = a.length, g, c = this._edgecode(a[h - 2], a[h - 1]); u < h; u += 2)
+        g = c, c = this._edgecode(a[u], a[u + 1]), g && c && (u = this._edge(t, g, c, a, u), h = a.length);
     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 Ue {
   _init() {
     const t = this._delaunator, e = this.points;
     if (t.hull && t.hull.length > 2 && Xo(t)) {
-      this.collinear = Int32Array.from({ length: e.length / 2 }, (u, p) => p).sort((u, p) => e[2 * u] - e[2 * p] || e[2 * u + 1] - e[2 * p + 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]], f = 1e-8 * Math.hypot(h[3] - h[1], h[2] - h[0]);
-      for (let u = 0, p = e.length / 2; u < p; ++u) {
-        const w = Ho(e[2 * u], e[2 * u + 1], f);
-        e[2 * u] = w[0], e[2 * u + 1] = w[1];
+      this.collinear = Int32Array.from({ length: e.length / 2 }, (c, m) => m).sort((c, m) => e[2 * c] - e[2 * m] || e[2 * c + 1] - e[2 * m + 1]);
+      const l = this.collinear[0], u = this.collinear[this.collinear.length - 1], h = [e[2 * l], e[2 * l + 1], e[2 * u], e[2 * u + 1]], g = 1e-8 * Math.hypot(h[3] - h[1], h[2] - h[0]);
+      for (let c = 0, m = e.length / 2; c < m; ++c) {
+        const w = Ho(e[2 * c], e[2 * c + 1], g);
+        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]));
   }
@@ -2890,21 +2890,21 @@ class Ue {
   *neighbors(t) {
     const { inedges: e, hull: o, _hullIndex: i, halfedges: r, triangles: s, collinear: a } = this;
     if (a) {
-      const f = a.indexOf(t);
-      f > 0 && (yield a[f - 1]), f < a.length - 1 && (yield a[f + 1]);
+      const g = a.indexOf(t);
+      g > 0 && (yield a[g - 1]), g < a.length - 1 && (yield a[g + 1]);
       return;
     }
     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) {
-        const f = o[(i[t] + 1) % o.length];
-        f !== h && (yield f);
+      if (yield h = s[u], u = u % 3 === 2 ? u - 2 : u + 1, s[u] !== t) return;
+      if (u = r[u], u === -1) {
+        const g = o[(i[t] + 1) % o.length];
+        g !== h && (yield g);
         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 Ue {
     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, f = ge(e - c[t * 2], 2) + ge(o - c[t * 2 + 1], 2);
-    const u = i[t];
-    let p = 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, g = ge(e - u[t * 2], 2) + ge(o - u[t * 2 + 1], 2);
+    const c = i[t];
+    let m = c;
     do {
-      let w = l[p];
-      const x = ge(e - c[w * 2], 2) + ge(o - c[w * 2 + 1], 2);
-      if (x < f && (f = x, h = w), p = p % 3 === 2 ? p - 2 : p + 1, l[p] !== t) break;
-      if (p = a[p], p === -1) {
-        if (p = r[(s[t] + 1) % r.length], p !== w && ge(e - c[p * 2], 2) + ge(o - c[p * 2 + 1], 2) < f)
-          return p;
+      let w = l[m];
+      const x = ge(e - u[w * 2], 2) + ge(o - u[w * 2 + 1], 2);
+      if (x < g && (g = x, h = w), m = m % 3 === 2 ? m - 2 : m + 1, l[m] !== t) break;
+      if (m = a[m], m === -1) {
+        if (m = r[(s[t] + 1) % r.length], m !== w && ge(e - u[m * 2], 2) + ge(o - u[m * 2 + 1], 2) < g)
+          return m;
         break;
       }
-    } while (p !== u);
+    } while (m !== c);
     return h;
   }
   render(t) {
@@ -2936,8 +2936,8 @@ class Ue {
     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,8 +2994,8 @@ 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 [];
@@ -3009,8 +3009,8 @@ function cn(n) {
   if (!i.length) return [];
   const r = /* @__PURE__ */ new Map(), s = (w, x) => w < x ? `${w}_${x}` : `${x}_${w}`;
   for (let w = 0; w < i.length; w += 3) {
-    const x = i[w], P = i[w + 1], M = i[w + 2], [m, d] = e[x], [g, b] = e[P], [V, v] = e[M], S = jo(m, d, g, b, V, v), z = Go(e, x, P, M);
-    if (S <= 1 / z)
+    const x = i[w], P = i[w + 1], M = i[w + 2], [d, f] = e[x], [p, b] = e[P], [z, v] = e[M], S = jo(d, f, p, b, z, v), V = Go(e, x, P, M);
+    if (S <= 1 / V)
       for (const [D, _] of [[x, P], [P, M], [M, x]]) {
         const T = s(D, _);
         r.set(T, (r.get(T) || 0) + 1);
@@ -3022,15 +3022,15 @@ function cn(n) {
   const l = /* @__PURE__ */ new Map();
   for (const [w, x] of a)
     (l.get(w) || l.set(w, []).get(w)).push(x), (l.get(x) || l.set(x, []).get(x)).push(w);
-  const c = a[0][0], h = [], f = /* @__PURE__ */ new Set();
-  let u = c, p = -1;
+  const u = a[0][0], h = [], g = /* @__PURE__ */ new Set();
+  let c = u, m = -1;
   do {
-    h.push(e[u]), f.add(u);
-    const w = l.get(u) || [];
-    let x = w.find((P) => P !== p && !f.has(P));
-    if (x === void 0 && (x = w.find((P) => P !== p)), x === void 0) break;
-    p = u, u = x;
-  } while (u !== c && h.length <= a.length + 1);
+    h.push(e[c]), g.add(c);
+    const w = l.get(c) || [];
+    let x = w.find((P) => P !== m && !g.has(P));
+    if (x === void 0 && (x = w.find((P) => P !== m)), x === void 0) break;
+    m = c, c = x;
+  } 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, f = 0, u, p = n.type, w = p === "FeatureCollection", x = p === "Feature", P = w ? n.features.length : 1, M = 0; M < P; M++) {
-      c = w ? (
+    for (var o, i, r, s, a, l, u, h = 0, g = 0, c, m = n.type, w = m === "FeatureCollection", x = m === "Feature", P = w ? n.features.length : 1, M = 0; M < P; M++) {
+      u = w ? (
         // @ts-expect-error: Known type conflict
         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;
-      for (var m = 0; m < a; m++) {
-        var d = 0, g = 0;
-        if (s = u ? c.geometries[m] : c, s !== null) {
+      ) : n, c = u ? u.type === "GeometryCollection" : !1, a = c ? u.geometries.length : 1;
+      for (var d = 0; d < a; d++) {
+        var f = 0, p = 0;
+        if (s = c ? u.geometries[d] : u, s !== null) {
           l = s.coordinates;
           var b = s.type;
           switch (h = e && (b === "Polygon" || b === "MultiPolygon") ? 1 : 0, b) {
@@ -3334,14 +3334,14 @@ function Pe(n, t, e) {
                 // @ts-expect-error: Known type conflict
                 t(
                   l,
-                  f,
+                  g,
                   M,
-                  d,
-                  g
+                  f,
+                  p
                 ) === !1
               )
                 return !1;
-              f++, d++;
+              g++, f++;
               break;
             case "LineString":
             case "MultiPoint":
@@ -3350,16 +3350,16 @@ function Pe(n, t, e) {
                   // @ts-expect-error: Known type conflict
                   t(
                     l[o],
-                    f,
+                    g,
                     M,
-                    d,
-                    g
+                    f,
+                    p
                   ) === !1
                 )
                   return !1;
-                f++, b === "MultiPoint" && d++;
+                g++, b === "MultiPoint" && f++;
               }
-              b === "LineString" && d++;
+              b === "LineString" && f++;
               break;
             case "Polygon":
             case "MultiLineString":
@@ -3369,39 +3369,39 @@ function Pe(n, t, e) {
                     // @ts-expect-error: Known type conflict
                     t(
                       l[o][i],
-                      f,
+                      g,
                       M,
-                      d,
-                      g
+                      f,
+                      p
                     ) === !1
                   )
                     return !1;
-                  f++;
+                  g++;
                 }
-                b === "MultiLineString" && d++, b === "Polygon" && g++;
+                b === "MultiLineString" && f++, b === "Polygon" && p++;
               }
-              b === "Polygon" && d++;
+              b === "Polygon" && f++;
               break;
             case "MultiPolygon":
               for (o = 0; o < l.length; o++) {
-                for (g = 0, i = 0; i < l[o].length; i++) {
+                for (p = 0, i = 0; i < l[o].length; i++) {
                   for (r = 0; r < l[o][i].length - h; r++) {
                     if (
                       // @ts-expect-error: Known type conflict
                       t(
                         l[o][i][r],
-                        f,
+                        g,
                         M,
-                        d,
-                        g
+                        f,
+                        p
                       ) === !1
                     )
                       return !1;
-                    f++;
+                    g++;
                   }
-                  g++;
+                  p++;
                 }
-                d++;
+                f++;
               }
               break;
             case "GeometryCollection":
@@ -3426,27 +3426,27 @@ function Jo(n) {
   }), t;
 }
 function tr(n, t) {
-  var e, o, i, r, s, a, l, c, h, f, u = 0, p = n.type === "FeatureCollection", w = n.type === "Feature", x = p ? n.features.length : 1;
+  var e, o, i, r, s, a, l, u, h, g, c = 0, m = n.type === "FeatureCollection", w = n.type === "Feature", x = m ? n.features.length : 1;
   for (e = 0; e < x; e++) {
-    for (a = p ? (
+    for (a = m ? (
       // @ts-expect-error: Known type conflict
       n.features[e].geometry
     ) : w ? (
       // @ts-expect-error: Known type conflict
       n.geometry
-    ) : n, c = p ? (
+    ) : n, u = m ? (
       // @ts-expect-error: Known type conflict
       n.features[e].properties
     ) : w ? (
       // @ts-expect-error: Known type conflict
       n.properties
-    ) : {}, h = p ? (
+    ) : {}, h = m ? (
       // @ts-expect-error: Known type conflict
       n.features[e].bbox
     ) : w ? (
       // @ts-expect-error: Known type conflict
       n.bbox
-    ) : void 0, f = p ? (
+    ) : void 0, g = m ? (
       // @ts-expect-error: Known type conflict
       n.features[e].id
     ) : w ? (
@@ -3459,10 +3459,10 @@ function tr(n, t) {
           t(
             // @ts-expect-error: Known type conflict
             null,
-            u,
             c,
+            u,
             h,
-            f
+            g
           ) === !1
         )
           return !1;
@@ -3479,10 +3479,10 @@ function tr(n, t) {
             // @ts-expect-error: Known type conflict
             t(
               r,
-              u,
               c,
+              u,
               h,
-              f
+              g
             ) === !1
           )
             return !1;
@@ -3494,10 +3494,10 @@ function tr(n, t) {
               // @ts-expect-error: Known type conflict
               t(
                 r.geometries[o],
-                u,
                 c,
+                u,
                 h,
-                f
+                g
               ) === !1
             )
               return !1;
@@ -3507,7 +3507,7 @@ function tr(n, t) {
           throw new Error("Unknown Geometry Type");
       }
     }
-    u++;
+    c++;
   }
 }
 function er(n, t, e) {
@@ -3555,209 +3555,209 @@ var Ze = { exports: {} }, On = { exports: {} };
   (function(e, o) {
     n.exports = o();
   })(Fn, function() {
-    function e(m, d, g, b, V) {
-      (function v(S, z, D, _, T) {
+    function e(d, f, p, b, z) {
+      (function v(S, V, D, _, T) {
         for (; _ > D; ) {
           if (_ - D > 600) {
-            var E = _ - D + 1, A = z - D + 1, O = Math.log(E), I = 0.5 * Math.exp(2 * O / 3), B = 0.5 * Math.sqrt(O * I * (E - I) / E) * (A - E / 2 < 0 ? -1 : 1), R = Math.max(D, Math.floor(z - A * I / E + B)), W = Math.min(_, Math.floor(z + (E - A) * I / E + B));
-            v(S, z, R, W, T);
+            var E = _ - D + 1, A = V - D + 1, O = Math.log(E), I = 0.5 * Math.exp(2 * O / 3), B = 0.5 * Math.sqrt(O * I * (E - I) / E) * (A - E / 2 < 0 ? -1 : 1), R = Math.max(D, Math.floor(V - A * I / E + B)), W = Math.min(_, Math.floor(V + (E - A) * I / E + B));
+            v(S, V, R, W, T);
           }
-          var C = S[z], L = D, H = _;
-          for (o(S, D, z), T(S[_], C) > 0 && o(S, D, _); L < H; ) {
+          var C = S[V], L = D, H = _;
+          for (o(S, D, V), T(S[_], C) > 0 && o(S, D, _); L < H; ) {
             for (o(S, L, H), L++, H--; T(S[L], C) < 0; ) L++;
             for (; T(S[H], C) > 0; ) H--;
           }
-          T(S[D], C) === 0 ? o(S, D, H) : o(S, ++H, _), H <= z && (D = H + 1), z <= H && (_ = H - 1);
+          T(S[D], C) === 0 ? o(S, D, H) : o(S, ++H, _), H <= V && (D = H + 1), V <= H && (_ = H - 1);
         }
-      })(m, d, g || 0, b || m.length - 1, V || i);
+      })(d, f, p || 0, b || d.length - 1, z || i);
     }
-    function o(m, d, g) {
-      var b = m[d];
-      m[d] = m[g], m[g] = b;
+    function o(d, f, p) {
+      var b = d[f];
+      d[f] = d[p], d[p] = b;
     }
-    function i(m, d) {
-      return m < d ? -1 : m > d ? 1 : 0;
+    function i(d, f) {
+      return d < f ? -1 : d > f ? 1 : 0;
     }
-    var r = function(m) {
-      m === void 0 && (m = 9), this._maxEntries = Math.max(4, m), this._minEntries = Math.max(2, Math.ceil(0.4 * this._maxEntries)), this.clear();
+    var r = function(d) {
+      d === void 0 && (d = 9), this._maxEntries = Math.max(4, d), this._minEntries = Math.max(2, Math.ceil(0.4 * this._maxEntries)), this.clear();
     };
-    function s(m, d, g) {
-      if (!g) return d.indexOf(m);
-      for (var b = 0; b < d.length; b++) if (g(m, d[b])) return b;
+    function s(d, f, p) {
+      if (!p) return f.indexOf(d);
+      for (var b = 0; b < f.length; b++) if (p(d, f[b])) return b;
       return -1;
     }
-    function a(m, d) {
-      l(m, 0, m.children.length, d, m);
+    function a(d, f) {
+      l(d, 0, d.children.length, f, d);
     }
-    function l(m, d, g, b, V) {
-      V || (V = P(null)), V.minX = 1 / 0, V.minY = 1 / 0, V.maxX = -1 / 0, V.maxY = -1 / 0;
-      for (var v = d; v < g; v++) {
-        var S = m.children[v];
-        c(V, m.leaf ? b(S) : S);
+    function l(d, f, p, b, z) {
+      z || (z = P(null)), z.minX = 1 / 0, z.minY = 1 / 0, z.maxX = -1 / 0, z.maxY = -1 / 0;
+      for (var v = f; v < p; v++) {
+        var S = d.children[v];
+        u(z, d.leaf ? b(S) : S);
       }
-      return V;
+      return z;
     }
-    function c(m, d) {
-      return m.minX = Math.min(m.minX, d.minX), m.minY = Math.min(m.minY, d.minY), m.maxX = Math.max(m.maxX, d.maxX), m.maxY = Math.max(m.maxY, d.maxY), m;
+    function u(d, f) {
+      return d.minX = Math.min(d.minX, f.minX), d.minY = Math.min(d.minY, f.minY), d.maxX = Math.max(d.maxX, f.maxX), d.maxY = Math.max(d.maxY, f.maxY), d;
     }
-    function h(m, d) {
-      return m.minX - d.minX;
+    function h(d, f) {
+      return d.minX - f.minX;
     }
-    function f(m, d) {
-      return m.minY - d.minY;
+    function g(d, f) {
+      return d.minY - f.minY;
     }
-    function u(m) {
-      return (m.maxX - m.minX) * (m.maxY - m.minY);
+    function c(d) {
+      return (d.maxX - d.minX) * (d.maxY - d.minY);
     }
-    function p(m) {
-      return m.maxX - m.minX + (m.maxY - m.minY);
+    function m(d) {
+      return d.maxX - d.minX + (d.maxY - d.minY);
     }
-    function w(m, d) {
-      return m.minX <= d.minX && m.minY <= d.minY && d.maxX <= m.maxX && d.maxY <= m.maxY;
+    function w(d, f) {
+      return d.minX <= f.minX && d.minY <= f.minY && f.maxX <= d.maxX && f.maxY <= d.maxY;
     }
-    function x(m, d) {
-      return d.minX <= m.maxX && d.minY <= m.maxY && d.maxX >= m.minX && d.maxY >= m.minY;
+    function x(d, f) {
+      return f.minX <= d.maxX && f.minY <= d.maxY && f.maxX >= d.minX && f.maxY >= d.minY;
     }
-    function P(m) {
-      return { children: m, height: 1, leaf: !0, minX: 1 / 0, minY: 1 / 0, maxX: -1 / 0, maxY: -1 / 0 };
+    function P(d) {
+      return { children: d, height: 1, leaf: !0, minX: 1 / 0, minY: 1 / 0, maxX: -1 / 0, maxY: -1 / 0 };
     }
-    function M(m, d, g, b, V) {
-      for (var v = [d, g]; v.length; ) if (!((g = v.pop()) - (d = v.pop()) <= b)) {
-        var S = d + Math.ceil((g - d) / b / 2) * b;
-        e(m, S, d, g, V), v.push(d, S, S, g);
+    function M(d, f, p, b, z) {
+      for (var v = [f, p]; v.length; ) if (!((p = v.pop()) - (f = v.pop()) <= b)) {
+        var S = f + Math.ceil((p - f) / b / 2) * b;
+        e(d, S, f, p, z), v.push(f, S, S, p);
       }
     }
     return r.prototype.all = function() {
       return this._all(this.data, []);
-    }, r.prototype.search = function(m) {
-      var d = this.data, g = [];
-      if (!x(m, d)) return g;
-      for (var b = this.toBBox, V = []; d; ) {
-        for (var v = 0; v < d.children.length; v++) {
-          var S = d.children[v], z = d.leaf ? b(S) : S;
-          x(m, z) && (d.leaf ? g.push(S) : w(m, z) ? this._all(S, g) : V.push(S));
+    }, r.prototype.search = function(d) {
+      var f = this.data, p = [];
+      if (!x(d, f)) return p;
+      for (var b = this.toBBox, z = []; f; ) {
+        for (var v = 0; v < f.children.length; v++) {
+          var S = f.children[v], V = f.leaf ? b(S) : S;
+          x(d, V) && (f.leaf ? p.push(S) : w(d, V) ? this._all(S, p) : z.push(S));
         }
-        d = V.pop();
+        f = z.pop();
       }
-      return g;
-    }, r.prototype.collides = function(m) {
-      var d = this.data;
-      if (!x(m, d)) return !1;
-      for (var g = []; d; ) {
-        for (var b = 0; b < d.children.length; b++) {
-          var V = d.children[b], v = d.leaf ? this.toBBox(V) : V;
-          if (x(m, v)) {
-            if (d.leaf || w(m, v)) return !0;
-            g.push(V);
+      return p;
+    }, r.prototype.collides = function(d) {
+      var f = this.data;
+      if (!x(d, f)) return !1;
+      for (var p = []; f; ) {
+        for (var b = 0; b < f.children.length; b++) {
+          var z = f.children[b], v = f.leaf ? this.toBBox(z) : z;
+          if (x(d, v)) {
+            if (f.leaf || w(d, v)) return !0;
+            p.push(z);
           }
         }
-        d = g.pop();
+        f = p.pop();
       }
       return !1;
-    }, r.prototype.load = function(m) {
-      if (!m || !m.length) return this;
-      if (m.length < this._minEntries) {
-        for (var d = 0; d < m.length; d++) this.insert(m[d]);
+    }, r.prototype.load = function(d) {
+      if (!d || !d.length) return this;
+      if (d.length < this._minEntries) {
+        for (var f = 0; f < d.length; f++) this.insert(d[f]);
         return this;
       }
-      var g = this._build(m.slice(), 0, m.length - 1, 0);
-      if (this.data.children.length) if (this.data.height === g.height) this._splitRoot(this.data, g);
+      var p = this._build(d.slice(), 0, d.length - 1, 0);
+      if (this.data.children.length) if (this.data.height === p.height) this._splitRoot(this.data, p);
       else {
-        if (this.data.height < g.height) {
+        if (this.data.height < p.height) {
           var b = this.data;
-          this.data = g, g = b;
+          this.data = p, p = b;
         }
-        this._insert(g, this.data.height - g.height - 1, !0);
+        this._insert(p, this.data.height - p.height - 1, !0);
       }
-      else this.data = g;
+      else this.data = p;
       return this;
-    }, r.prototype.insert = function(m) {
-      return m && this._insert(m, this.data.height - 1), this;
+    }, r.prototype.insert = function(d) {
+      return d && this._insert(d, this.data.height - 1), this;
     }, r.prototype.clear = function() {
       return this.data = P([]), this;
-    }, r.prototype.remove = function(m, d) {
-      if (!m) return this;
-      for (var g, b, V, v = this.data, S = this.toBBox(m), z = [], D = []; v || z.length; ) {
-        if (v || (v = z.pop(), b = z[z.length - 1], g = D.pop(), V = !0), v.leaf) {
-          var _ = s(m, v.children, d);
-          if (_ !== -1) return v.children.splice(_, 1), z.push(v), this._condense(z), this;
+    }, r.prototype.remove = function(d, f) {
+      if (!d) return this;
+      for (var p, b, z, v = this.data, S = this.toBBox(d), V = [], D = []; v || V.length; ) {
+        if (v || (v = V.pop(), b = V[V.length - 1], p = D.pop(), z = !0), v.leaf) {
+          var _ = s(d, v.children, f);
+          if (_ !== -1) return v.children.splice(_, 1), V.push(v), this._condense(V), this;
         }
-        V || v.leaf || !w(v, S) ? b ? (g++, v = b.children[g], V = !1) : v = null : (z.push(v), D.push(g), g = 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(m) {
-      return m;
-    }, r.prototype.compareMinX = function(m, d) {
-      return m.minX - d.minX;
-    }, r.prototype.compareMinY = function(m, d) {
-      return m.minY - d.minY;
+    }, r.prototype.toBBox = function(d) {
+      return d;
+    }, r.prototype.compareMinX = function(d, f) {
+      return d.minX - f.minX;
+    }, r.prototype.compareMinY = function(d, f) {
+      return d.minY - f.minY;
     }, r.prototype.toJSON = function() {
       return this.data;
-    }, r.prototype.fromJSON = function(m) {
-      return this.data = m, this;
-    }, r.prototype._all = function(m, d) {
-      for (var g = []; m; ) m.leaf ? d.push.apply(d, m.children) : g.push.apply(g, m.children), m = g.pop();
-      return d;
-    }, r.prototype._build = function(m, d, g, b) {
-      var V, v = g - d + 1, S = this._maxEntries;
-      if (v <= S) return a(V = P(m.slice(d, g + 1)), this.toBBox), V;
-      b || (b = Math.ceil(Math.log(v) / Math.log(S)), S = Math.ceil(v / Math.pow(S, b - 1))), (V = P([])).leaf = !1, V.height = b;
-      var z = Math.ceil(v / S), D = z * Math.ceil(Math.sqrt(S));
-      M(m, d, g, D, this.compareMinX);
-      for (var _ = d; _ <= g; _ += D) {
-        var T = Math.min(_ + D - 1, g);
-        M(m, _, T, z, this.compareMinY);
-        for (var E = _; E <= T; E += z) {
-          var A = Math.min(E + z - 1, T);
-          V.children.push(this._build(m, E, A, b - 1));
+    }, r.prototype.fromJSON = function(d) {
+      return this.data = d, this;
+    }, r.prototype._all = function(d, f) {
+      for (var p = []; d; ) d.leaf ? f.push.apply(f, d.children) : p.push.apply(p, d.children), d = p.pop();
+      return f;
+    }, r.prototype._build = function(d, f, p, b) {
+      var z, v = p - f + 1, S = this._maxEntries;
+      if (v <= S) return a(z = P(d.slice(f, p + 1)), this.toBBox), z;
+      b || (b = Math.ceil(Math.log(v) / Math.log(S)), S = Math.ceil(v / Math.pow(S, b - 1))), (z = P([])).leaf = !1, z.height = b;
+      var V = Math.ceil(v / S), D = V * Math.ceil(Math.sqrt(S));
+      M(d, f, p, D, this.compareMinX);
+      for (var _ = f; _ <= p; _ += D) {
+        var T = Math.min(_ + D - 1, p);
+        M(d, _, T, V, this.compareMinY);
+        for (var E = _; E <= T; E += V) {
+          var A = Math.min(E + V - 1, T);
+          z.children.push(this._build(d, E, A, b - 1));
         }
       }
-      return a(V, this.toBBox), V;
-    }, r.prototype._chooseSubtree = function(m, d, g, b) {
-      for (; b.push(d), !d.leaf && b.length - 1 !== g; ) {
-        for (var V = 1 / 0, v = 1 / 0, S = void 0, z = 0; z < d.children.length; z++) {
-          var D = d.children[z], _ = u(D), T = (E = m, A = D, (Math.max(A.maxX, E.maxX) - Math.min(A.minX, E.minX)) * (Math.max(A.maxY, E.maxY) - Math.min(A.minY, E.minY)) - _);
-          T < v ? (v = T, V = _ < V ? _ : V, S = D) : T === v && _ < V && (V = _, S = D);
+      return a(z, this.toBBox), z;
+    }, r.prototype._chooseSubtree = function(d, f, p, b) {
+      for (; b.push(f), !f.leaf && b.length - 1 !== p; ) {
+        for (var z = 1 / 0, v = 1 / 0, S = void 0, V = 0; V < f.children.length; V++) {
+          var D = f.children[V], _ = c(D), T = (E = d, A = D, (Math.max(A.maxX, E.maxX) - Math.min(A.minX, E.minX)) * (Math.max(A.maxY, E.maxY) - Math.min(A.minY, E.minY)) - _);
+          T < v ? (v = T, z = _ < z ? _ : z, S = D) : T === v && _ < z && (z = _, S = D);
         }
-        d = S || d.children[0];
+        f = S || f.children[0];
       }
       var E, A;
-      return d;
-    }, r.prototype._insert = function(m, d, g) {
-      var b = g ? m : this.toBBox(m), V = [], v = this._chooseSubtree(b, this.data, d, V);
-      for (v.children.push(m), c(v, b); d >= 0 && V[d].children.length > this._maxEntries; ) this._split(V, d), d--;
-      this._adjustParentBBoxes(b, V, d);
-    }, r.prototype._split = function(m, d) {
-      var g = m[d], b = g.children.length, V = this._minEntries;
-      this._chooseSplitAxis(g, V, b);
-      var v = this._chooseSplitIndex(g, V, b), S = P(g.children.splice(v, g.children.length - v));
-      S.height = g.height, S.leaf = g.leaf, a(g, this.toBBox), a(S, this.toBBox), d ? m[d - 1].children.push(S) : this._splitRoot(g, S);
-    }, r.prototype._splitRoot = function(m, d) {
-      this.data = P([m, d]), this.data.height = m.height + 1, this.data.leaf = !1, a(this.data, this.toBBox);
-    }, r.prototype._chooseSplitIndex = function(m, d, g) {
-      for (var b, V, v, S, z, D, _, T = 1 / 0, E = 1 / 0, A = d; A <= g - d; A++) {
-        var O = l(m, 0, A, this.toBBox), I = l(m, A, g, this.toBBox), B = (V = O, v = I, S = void 0, z = void 0, D = void 0, _ = void 0, S = Math.max(V.minX, v.minX), z = Math.max(V.minY, v.minY), D = Math.min(V.maxX, v.maxX), _ = Math.min(V.maxY, v.maxY), Math.max(0, D - S) * Math.max(0, _ - z)), R = u(O) + u(I);
+      return f;
+    }, r.prototype._insert = function(d, f, p) {
+      var b = p ? d : this.toBBox(d), z = [], v = this._chooseSubtree(b, this.data, f, z);
+      for (v.children.push(d), u(v, b); f >= 0 && z[f].children.length > this._maxEntries; ) this._split(z, f), f--;
+      this._adjustParentBBoxes(b, z, f);
+    }, r.prototype._split = function(d, f) {
+      var p = d[f], b = p.children.length, z = this._minEntries;
+      this._chooseSplitAxis(p, z, b);
+      var v = this._chooseSplitIndex(p, z, b), S = P(p.children.splice(v, p.children.length - v));
+      S.height = p.height, S.leaf = p.leaf, a(p, this.toBBox), a(S, this.toBBox), f ? d[f - 1].children.push(S) : this._splitRoot(p, S);
+    }, r.prototype._splitRoot = function(d, f) {
+      this.data = P([d, f]), this.data.height = d.height + 1, this.data.leaf = !1, a(this.data, this.toBBox);
+    }, r.prototype._chooseSplitIndex = function(d, f, p) {
+      for (var b, z, v, S, V, D, _, T = 1 / 0, E = 1 / 0, A = f; A <= p - f; A++) {
+        var O = l(d, 0, A, this.toBBox), I = l(d, A, p, this.toBBox), B = (z = O, v = I, S = void 0, V = void 0, D = void 0, _ = void 0, S = Math.max(z.minX, v.minX), V = Math.max(z.minY, v.minY), D = Math.min(z.maxX, v.maxX), _ = Math.min(z.maxY, v.maxY), Math.max(0, D - S) * Math.max(0, _ - V)), R = c(O) + c(I);
         B < T ? (T = B, b = A, E = R < E ? R : E) : B === T && R < E && (E = R, b = A);
       }
-      return b || g - d;
-    }, r.prototype._chooseSplitAxis = function(m, d, g) {
-      var b = m.leaf ? this.compareMinX : h, V = m.leaf ? this.compareMinY : f;
-      this._allDistMargin(m, d, g, b) < this._allDistMargin(m, d, g, V) && m.children.sort(b);
-    }, r.prototype._allDistMargin = function(m, d, g, b) {
-      m.children.sort(b);
-      for (var V = this.toBBox, v = l(m, 0, d, V), S = l(m, g - d, g, V), z = p(v) + p(S), D = d; D < g - d; D++) {
-        var _ = m.children[D];
-        c(v, m.leaf ? V(_) : _), z += p(v);
+      return b || p - f;
+    }, r.prototype._chooseSplitAxis = function(d, f, p) {
+      var b = d.leaf ? this.compareMinX : h, z = d.leaf ? this.compareMinY : g;
+      this._allDistMargin(d, f, p, b) < this._allDistMargin(d, f, p, z) && d.children.sort(b);
+    }, r.prototype._allDistMargin = function(d, f, p, b) {
+      d.children.sort(b);
+      for (var z = this.toBBox, v = l(d, 0, f, z), S = l(d, p - f, p, z), V = m(v) + m(S), D = f; D < p - f; D++) {
+        var _ = d.children[D];
+        u(v, d.leaf ? z(_) : _), V += m(v);
       }
-      for (var T = g - d - 1; T >= d; T--) {
-        var E = m.children[T];
-        c(S, m.leaf ? V(E) : E), z += p(S);
+      for (var T = p - f - 1; T >= f; T--) {
+        var E = d.children[T];
+        u(S, d.leaf ? z(E) : E), V += m(S);
       }
-      return z;
-    }, r.prototype._adjustParentBBoxes = function(m, d, g) {
-      for (var b = g; b >= 0; b--) c(d[b], m);
-    }, r.prototype._condense = function(m) {
-      for (var d = m.length - 1, g = void 0; d >= 0; d--) m[d].children.length === 0 ? d > 0 ? (g = m[d - 1].children).splice(g.indexOf(m[d]), 1) : this.clear() : a(m[d], this.toBBox);
+      return V;
+    }, r.prototype._adjustParentBBoxes = function(d, f, p) {
+      for (var b = p; b >= 0; b--) u(f[b], d);
+    }, r.prototype._condense = function(d) {
+      for (var f = d.length - 1, p = void 0; f >= 0; f--) d[f].children.length === 0 ? f > 0 ? (p = d[f - 1].children).splice(p.indexOf(d[f]), 1) : this.clear() : a(d[f], this.toBBox);
     }, r;
   });
 })(On);
@@ -3808,16 +3808,16 @@ const ar = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
 var ke = { exports: {} }, cr = function(t, e, o, i) {
   var r = t[0], s = t[1], a = !1;
   o === void 0 && (o = 0), i === void 0 && (i = e.length);
-  for (var l = (i - o) / 2, c = 0, h = l - 1; c < l; h = c++) {
-    var f = e[o + c * 2 + 0], u = e[o + c * 2 + 1], p = e[o + h * 2 + 0], w = e[o + h * 2 + 1], x = u > s != w > s && r < (p - f) * (s - u) / (w - u) + f;
+  for (var l = (i - o) / 2, u = 0, h = l - 1; u < l; h = u++) {
+    var g = e[o + u * 2 + 0], c = e[o + u * 2 + 1], m = e[o + h * 2 + 0], w = e[o + h * 2 + 1], x = c > s != w > s && r < (m - g) * (s - c) / (w - c) + g;
     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 f = e[c + o][0], u = e[c + o][1], p = e[h + o][0], w = e[h + o][1], x = u > s != w > s && r < (p - f) * (s - u) / (w - u) + f;
+  for (var l = i - o, u = 0, h = l - 1; u < l; h = u++) {
+    var g = e[u + o][0], c = e[u + o][1], m = e[h + o][0], w = e[h + o][1], x = c > s != w > s && r < (m - g) * (s - c) / (w - c) + g;
     x && (a = !a);
   }
   return a;
@@ -3833,43 +3833,43 @@ var hr = ke.exports, je = { exports: {} };
     o(t);
   })(Fn, function(e) {
     const i = 33306690738754706e-32;
-    function r(x, P, M, m, d) {
-      let g, b, V, v, S = P[0], z = m[0], D = 0, _ = 0;
-      z > S == z > -S ? (g = S, S = P[++D]) : (g = z, z = m[++_]);
+    function r(x, P, M, d, f) {
+      let p, b, z, v, S = P[0], V = d[0], D = 0, _ = 0;
+      V > S == V > -S ? (p = S, S = P[++D]) : (p = V, V = d[++_]);
       let T = 0;
-      if (D < x && _ < M) for (z > S == z > -S ? (V = g - ((b = S + g) - S), S = P[++D]) : (V = g - ((b = z + g) - z), z = m[++_]), g = b, V !== 0 && (d[T++] = V); D < x && _ < M; ) z > S == z > -S ? (V = g - ((b = g + S) - (v = b - g)) + (S - v), S = P[++D]) : (V = g - ((b = g + z) - (v = b - g)) + (z - v), z = m[++_]), g = b, V !== 0 && (d[T++] = V);
-      for (; D < x; ) V = g - ((b = g + S) - (v = b - g)) + (S - v), S = P[++D], g = b, V !== 0 && (d[T++] = V);
-      for (; _ < M; ) V = g - ((b = g + z) - (v = b - g)) + (z - v), z = m[++_], g = b, V !== 0 && (d[T++] = V);
-      return g === 0 && T !== 0 || (d[T++] = g), T;
+      if (D < x && _ < M) for (V > S == V > -S ? (z = p - ((b = S + p) - S), S = P[++D]) : (z = p - ((b = V + p) - V), V = d[++_]), p = b, z !== 0 && (f[T++] = z); D < x && _ < M; ) V > S == V > -S ? (z = p - ((b = p + S) - (v = b - p)) + (S - v), S = P[++D]) : (z = p - ((b = p + V) - (v = b - p)) + (V - v), V = d[++_]), p = b, z !== 0 && (f[T++] = z);
+      for (; D < x; ) z = p - ((b = p + S) - (v = b - p)) + (S - v), S = P[++D], p = b, z !== 0 && (f[T++] = z);
+      for (; _ < M; ) z = p - ((b = p + V) - (v = b - p)) + (V - v), V = d[++_], p = b, z !== 0 && (f[T++] = z);
+      return p === 0 && T !== 0 || (f[T++] = p), T;
     }
     function s(x) {
       return new Float64Array(x);
     }
-    const a = 33306690738754716e-32, l = 22204460492503146e-32, c = 11093356479670487e-47, h = s(4), f = s(8), u = s(12), p = s(16), w = s(4);
-    e.orient2d = function(x, P, M, m, d, g) {
-      const b = (P - g) * (M - d), V = (x - d) * (m - g), 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, _, T, E, A, O) {
+    const a = 33306690738754716e-32, l = 22204460492503146e-32, u = 11093356479670487e-47, h = s(4), g = s(8), c = s(12), m = s(16), w = s(4);
+    e.orient2d = function(x, P, M, d, f, p) {
+      const b = (P - p) * (M - f), z = (x - f) * (d - p), v = b - z;
+      if (b === 0 || z === 0 || b > 0 != z > 0) return v;
+      const S = Math.abs(b + z);
+      return Math.abs(v) >= a * S ? v : -function(V, D, _, T, E, A, O) {
         let I, B, R, W, C, L, H, X, ot, K, G, ut, rt, F, Y, Mt, Zt, Nt;
-        const Lt = z - E, _t = _ - E, Tt = D - A, Ft = T - A;
+        const Lt = V - E, _t = _ - E, Tt = D - A, Ft = T - A;
         C = (Y = (X = Lt - (H = (L = 134217729 * Lt) - (L - Lt))) * (K = Ft - (ot = (L = 134217729 * Ft) - (L - Ft))) - ((F = Lt * Ft) - H * ot - X * ot - H * K)) - (G = Y - (Zt = (X = Tt - (H = (L = 134217729 * Tt) - (L - Tt))) * (K = _t - (ot = (L = 134217729 * _t) - (L - _t))) - ((Mt = Tt * _t) - H * ot - X * ot - H * K))), h[0] = Y - (G + C) + (C - Zt), C = (rt = F - ((ut = F + G) - (C = ut - F)) + (G - C)) - (G = rt - Mt), h[1] = rt - (G + C) + (C - Mt), C = (Nt = ut + G) - ut, h[2] = ut - (Nt - C) + (G - C), h[3] = Nt;
         let tt = function(Et, qt) {
           let J = qt[0];
           for (let ct = 1; ct < Et; ct++) J += qt[ct];
           return J;
         }(4, h), lt = l * O;
-        if (tt >= lt || -tt >= lt || (I = z - (Lt + (C = z - Lt)) + (C - E), R = _ - (_t + (C = _ - _t)) + (C - E), B = D - (Tt + (C = D - Tt)) + (C - A), W = T - (Ft + (C = T - Ft)) + (C - A), I === 0 && B === 0 && R === 0 && W === 0) || (lt = c * O + i * Math.abs(tt), (tt += Lt * W + Ft * I - (Tt * R + _t * B)) >= lt || -tt >= lt)) return tt;
+        if (tt >= lt || -tt >= lt || (I = V - (Lt + (C = V - Lt)) + (C - E), R = _ - (_t + (C = _ - _t)) + (C - E), B = D - (Tt + (C = D - Tt)) + (C - A), W = T - (Ft + (C = T - Ft)) + (C - A), I === 0 && B === 0 && R === 0 && W === 0) || (lt = u * O + i * Math.abs(tt), (tt += Lt * W + Ft * I - (Tt * R + _t * B)) >= lt || -tt >= lt)) return tt;
         C = (Y = (X = I - (H = (L = 134217729 * I) - (L - I))) * (K = Ft - (ot = (L = 134217729 * Ft) - (L - Ft))) - ((F = I * Ft) - H * ot - X * ot - H * K)) - (G = Y - (Zt = (X = B - (H = (L = 134217729 * B) - (L - B))) * (K = _t - (ot = (L = 134217729 * _t) - (L - _t))) - ((Mt = B * _t) - H * ot - X * ot - H * K))), w[0] = Y - (G + C) + (C - Zt), C = (rt = F - ((ut = F + G) - (C = ut - F)) + (G - C)) - (G = rt - Mt), w[1] = rt - (G + C) + (C - Mt), C = (Nt = ut + G) - ut, w[2] = ut - (Nt - C) + (G - C), w[3] = Nt;
-        const q = r(4, h, 4, w, f);
+        const q = r(4, h, 4, w, g);
         C = (Y = (X = Lt - (H = (L = 134217729 * Lt) - (L - Lt))) * (K = W - (ot = (L = 134217729 * W) - (L - W))) - ((F = Lt * W) - H * ot - X * ot - H * K)) - (G = Y - (Zt = (X = Tt - (H = (L = 134217729 * Tt) - (L - Tt))) * (K = R - (ot = (L = 134217729 * R) - (L - R))) - ((Mt = Tt * R) - H * ot - X * ot - H * K))), w[0] = Y - (G + C) + (C - Zt), C = (rt = F - ((ut = F + G) - (C = ut - F)) + (G - C)) - (G = rt - Mt), w[1] = rt - (G + C) + (C - Mt), C = (Nt = ut + G) - ut, w[2] = ut - (Nt - C) + (G - C), w[3] = Nt;
-        const j = r(q, f, 4, w, u);
+        const j = r(q, g, 4, w, c);
         C = (Y = (X = I - (H = (L = 134217729 * I) - (L - I))) * (K = W - (ot = (L = 134217729 * W) - (L - W))) - ((F = I * W) - H * ot - X * ot - H * K)) - (G = Y - (Zt = (X = B - (H = (L = 134217729 * B) - (L - B))) * (K = R - (ot = (L = 134217729 * R) - (L - R))) - ((Mt = B * R) - H * ot - X * ot - H * K))), w[0] = Y - (G + C) + (C - Zt), C = (rt = F - ((ut = F + G) - (C = ut - F)) + (G - C)) - (G = rt - Mt), w[1] = rt - (G + C) + (C - Mt), C = (Nt = ut + G) - ut, w[2] = ut - (Nt - C) + (G - C), w[3] = Nt;
-        const Wt = r(j, u, 4, w, p);
-        return p[Wt - 1];
-      }(x, P, M, m, d, g, S);
-    }, e.orient2dfast = function(x, P, M, m, d, g) {
-      return (P - g) * (M - d) - (x - d) * (m - g);
+        const Wt = r(j, c, 4, w, m);
+        return m[Wt - 1];
+      }(x, P, M, d, f, p, S);
+    }, e.orient2dfast = function(x, P, M, d, f, p) {
+      return (P - p) * (M - f) - (x - f) * (d - p);
     }, Object.defineProperty(e, "__esModule", { value: !0 });
   });
 })(je, je.exports);
@@ -3880,50 +3880,50 @@ Ze.exports.default = qn;
 function qn(n, t, e) {
   t = Math.max(0, t === void 0 ? 2 : t), e = e || 0;
   var o = wr(n), i = new pn(16);
-  i.toBBox = function(m) {
+  i.toBBox = function(d) {
     return {
-      minX: m[0],
-      minY: m[1],
-      maxX: m[0],
-      maxY: m[1]
+      minX: d[0],
+      minY: d[1],
+      maxX: d[0],
+      maxY: d[1]
     };
-  }, i.compareMinX = function(m, d) {
-    return m[0] - d[0];
-  }, i.compareMinY = function(m, d) {
-    return m[1] - d[1];
+  }, i.compareMinX = function(d, f) {
+    return d[0] - f[0];
+  }, i.compareMinY = function(d, f) {
+    return d[1] - f[1];
   }, i.load(n);
   for (var r = [], s = 0, a; s < o.length; s++) {
     var l = o[s];
     i.remove(l), a = wn(l, a), r.push(a);
   }
-  var c = new pn(16);
-  for (s = 0; s < r.length; s++) c.insert(qe(r[s]));
-  for (var h = t * t, f = e * e; r.length; ) {
-    var u = r.shift(), p = u.p, w = u.next.p, x = Xe(p, w);
-    if (!(x < f)) {
+  var u = new pn(16);
+  for (s = 0; s < r.length; s++) u.insert(qe(r[s]));
+  for (var h = t * t, g = e * e; r.length; ) {
+    var c = r.shift(), m = c.p, w = c.next.p, x = Xe(m, w);
+    if (!(x < g)) {
       var P = x / h;
-      l = gr(i, u.prev.p, p, w, u.next.next.p, P, c), l && Math.min(Xe(l, p), Xe(l, w)) <= P && (r.push(u), r.push(wn(l, u)), i.remove(l), c.remove(u), c.insert(qe(u)), c.insert(qe(u.next)));
+      l = gr(i, c.prev.p, m, w, c.next.next.p, P, u), l && Math.min(Xe(l, m), Xe(l, w)) <= P && (r.push(c), r.push(wn(l, c)), i.remove(l), u.remove(c), u.insert(qe(c)), u.insert(qe(c.next)));
     }
   }
-  u = a;
+  c = a;
   var M = [];
   do
-    M.push(u.p), u = u.next;
-  while (u !== a);
-  return M.push(u.p), M;
+    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], f = l.leaf ? He(h, e, o) : yr(e, o, h);
-      f > r || a.push({
+    for (var u = 0; u < l.children.length; u++) {
+      var h = l.children[u], g = l.leaf ? He(h, e, o) : yr(e, o, h);
+      g > r || a.push({
         node: h,
-        dist: f
+        dist: g
       });
     }
     for (; a.length && !a.peek().node.children; ) {
-      var u = a.pop(), p = u.node, w = He(p, t, e), x = He(p, o, i);
-      if (u.dist < w && u.dist < x && xn(e, p, s) && xn(o, p, s)) return p;
+      var c = a.pop(), m = c.node, w = He(m, t, e), x = He(m, o, i);
+      if (c.dist < w && c.dist < x && xn(e, m, s) && xn(o, m, s)) return m;
     }
     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 Te(n, t, e, o, i, r, s, a) {
-  var l = e - n, c = o - t, h = s - i, f = a - r, u = n - i, p = t - r, w = l * l + c * c, x = l * h + c * f, P = h * h + f * f, M = l * u + c * p, m = h * u + f * p, d = w * P - x * x, g, b, V, v, S = d, z = d;
-  d === 0 ? (b = 0, S = 1, v = m, z = P) : (b = x * m - P * M, v = w * m - x * M, b < 0 ? (b = 0, v = m, z = P) : b > S && (b = S, v = m + x, z = P)), v < 0 ? (v = 0, -M < 0 ? b = 0 : -M > w ? b = S : (b = -M, S = w)) : v > z && (v = z, -M + x < 0 ? b = 0 : -M + x > w ? b = S : (b = -M + x, S = w)), g = b === 0 ? 0 : b / S, V = v === 0 ? 0 : v / z;
-  var D = (1 - g) * n + g * e, _ = (1 - g) * t + g * o, T = (1 - V) * i + V * s, E = (1 - V) * r + V * a, A = T - D, O = E - _;
+  var l = e - n, u = o - t, h = s - i, g = a - r, c = n - i, m = t - r, w = l * l + u * u, x = l * h + u * g, P = h * h + g * g, M = l * c + u * m, d = h * c + g * m, f = w * P - x * x, p, b, z, v, S = f, V = f;
+  f === 0 ? (b = 0, S = 1, v = d, V = P) : (b = x * d - P * M, v = w * d - x * M, b < 0 ? (b = 0, v = d, V = P) : b > S && (b = S, v = d + x, V = P)), v < 0 ? (v = 0, -M < 0 ? b = 0 : -M > w ? b = S : (b = -M, S = w)) : v > V && (v = V, -M + x < 0 ? b = 0 : -M + x > w ? b = S : (b = -M + x, S = w)), p = b === 0 ? 0 : b / S, z = v === 0 ? 0 : v / V;
+  var D = (1 - p) * n + p * e, _ = (1 - p) * t + p * o, T = (1 - z) * i + z * s, E = (1 - z) * r + z * a, A = T - D, O = E - _;
   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 Tr(n, t, e, o = {}) {
@@ -4114,14 +4114,14 @@ function Tr(n, t, e, o = {}) {
 function Er(n, t, e, o) {
   o = o === void 0 ? Yt : 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)
-  ), f = Math.abs(h) > 1e-11 ? l / h : Math.cos(s), u = i * Math.sin(a) / f;
+    Math.tan(u / 2 + Math.PI / 4) / Math.tan(s / 2 + Math.PI / 4)
+  ), g = Math.abs(h) > 1e-11 ? l / h : Math.cos(s), c = i * Math.sin(a) / g;
   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(
-      Tr(r, c, l)
+    const l = vr(r, s) + t, u = Dr(r, s), h = Sr(
+      Tr(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 Rn(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 Rn(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 Wr(n) {
   for (let s = 0; s < o.length - 1; s++) {
     let a = Gn(o[s], o[s + 1]), l = Pn(t, -1 * a, {
       pivot: e
-    }), c = Rr(l), h = Lr(c);
-    h < i && (i = h, r = Pn(c, a, {
+    }), u = Rr(l), h = Lr(u);
+    h < i && (i = h, r = Pn(u, a, {
       pivot: e
     }));
   }
@@ -4345,37 +4345,37 @@ class Ie extends An {
   static fromByPath2D(t, e, o, i = new Ie()) {
     const r = Wr({
       type: "Polygon",
-      coordinates: [t.map((p) => [p.x, p.y])]
+      coordinates: [t.map((m) => [m.x, m.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]);
-    Ee.set(a, l, o), Sn.set(0, 0, c);
-    const [h, f] = Nr(s);
-    return e.x = h, e.y = f, this.from(Ee, e, Sn, i);
+    const s = r.geometry.coordinates[0], a = Vn(s[0], s[1]), l = Vn(s[1], s[2]), u = Math.atan2(s[1][1] - s[0][1], s[1][0] - s[0][0]);
+    Ee.set(a, l, o), Sn.set(0, 0, u);
+    const [h, g] = Nr(s);
+    return e.x = h, e.y = g, this.from(Ee, e, Sn, i);
   }
 }
 const le = new y.Matrix4(), fe = new y.Quaternion(), Sn = new y.Euler(), qr = new y.Vector3(1, 1, 1), Ee = new y.Vector3(), Xr = new y.Box3();
 function Hr(n, t, e = 5e-3, o = 0.2) {
   if (!n.length || !t.length) return 0;
-  const i = Math.max(e, 0.03), r = e * e, s = /* @__PURE__ */ new Map(), a = (f, u, p) => `${Math.floor(f / i)},${Math.floor(u / i)},${Math.floor(p / i)}`;
-  for (const f of t) {
-    const u = a(f.x, f.y, f.z);
-    s.has(u) || s.set(u, []), s.get(u).push(f);
+  const i = Math.max(e, 0.03), r = e * e, s = /* @__PURE__ */ new Map(), a = (g, c, m) => `${Math.floor(g / i)},${Math.floor(c / i)},${Math.floor(m / i)}`;
+  for (const g of t) {
+    const c = a(g.x, g.y, g.z);
+    s.has(c) || s.set(c, []), s.get(c).push(g);
   }
   let l = 0;
-  const c = Math.ceil(e / i) + 1, h = [];
-  for (let f = -c; f <= c; f++)
-    for (let u = -c; u <= c; u++)
-      for (let p = -c; p <= c; p++)
-        f * f + u * u + p * p <= c * c && h.push([f, u, p]);
-  for (const f of n) {
-    const u = Math.floor(f.x / i), p = Math.floor(f.y / i), w = Math.floor(f.z / i);
+  const u = Math.ceil(e / i) + 1, h = [];
+  for (let g = -u; g <= u; g++)
+    for (let c = -u; c <= u; c++)
+      for (let m = -u; m <= u; m++)
+        g * g + c * c + m * m <= u * u && h.push([g, c, m]);
+  for (const g of n) {
+    const c = Math.floor(g.x / i), m = Math.floor(g.y / i), w = Math.floor(g.z / i);
     let x = !1;
-    for (const [P, M, m] of h) {
-      const d = `${u + P},${p + M},${w + m}`;
-      if (s.has(d)) {
-        for (const g of s.get(d))
-          if (f.distanceToSquared(g) < r) {
+    for (const [P, M, d] of h) {
+      const f = `${c + P},${m + M},${w + d}`;
+      if (s.has(f)) {
+        for (const p of s.get(f))
+          if (g.distanceToSquared(p) < r) {
             x = !0;
             break;
           }
@@ -4453,39 +4453,39 @@ const gi = (n) => {
   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, c = a.lastIndexOf("_"), h = a.substring(l, c);
+    const l = a.indexOf("_") + 1, u = a.lastIndexOf("_"), h = a.substring(l, u);
     if (h === "wall")
       continue;
-    let f = [];
+    let g = [];
     for (let P = 0; P < n[r].points.length; P++)
-      f.push(new y.Vector3(
+      g.push(new y.Vector3(
         n[r].points[P].x,
         n[r].points[P].y,
         n[r].points[P].z
       ));
-    let u = -99999;
+    let c = -99999;
     if (h === "floor") {
       let P = /* @__PURE__ */ new Map();
-      for (let m = 0; m < n[r].points.length; m++) {
-        let d = n[r].points[m].z;
-        if (d = Math.floor(d * 10) / 10, P.has(d)) {
-          const g = P.get(d);
-          g.num += 1, g.points.push(n[r].points[m]), P.set(d, g);
+      for (let d = 0; d < n[r].points.length; d++) {
+        let f = n[r].points[d].z;
+        if (f = Math.floor(f * 10) / 10, P.has(f)) {
+          const p = P.get(f);
+          p.num += 1, p.points.push(n[r].points[d]), P.set(f, p);
         } else
-          P.set(d, { num: 1, points: [n[r].points[m]] });
+          P.set(f, { num: 1, points: [n[r].points[d]] });
       }
       let M = [...P.entries()].reduce(
-        (m, d) => d[1].num > m[1].num ? d : m
+        (d, f) => f[1].num > d[1].num ? f : d
       );
-      s = [], s = M[1].points.map((m) => [m.x, m.y]), f = [], f = M[1].points.map((m) => new y.Vector3(m.x, m.y, m.z)), u = M[0];
+      s = [], s = M[1].points.map((d) => [d.x, d.y]), g = [], g = M[1].points.map((d) => new y.Vector3(d.x, d.y, d.z)), c = M[0];
     }
-    const p = Dn(f), w = {
-      points: f,
+    const m = Dn(g), w = {
+      points: g,
       path: cn(s),
-      h: p.h,
-      minz: p.minz,
-      maxz: p.maxz,
-      center: { x: p.x, y: p.y, z: p.z },
+      h: m.h,
+      minz: m.minz,
+      maxz: m.maxz,
+      center: { x: m.x, y: m.y, z: m.z },
       obj_id: n[r].obj_id,
       type: h,
       averagePz: n[r].averagePz,
@@ -4504,19 +4504,19 @@ const gi = (n) => {
     if (x != -1 ? t[x].array.push(w) : t.push({
       type: h,
       array: [w]
-    }), h == "floor" && u != -99999)
-      if (e.has(u)) {
-        const P = e.get(u);
-        P.num += w.points.length, P.datas.push(w), e.set(u, P);
+    }), 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(u, { num: w.points.length, datas: [w] });
+        e.set(c, { num: w.points.length, datas: [w] });
   }
   let o = -1 / 0;
   if (e.size > 0) {
     let r = [];
     for (const [s, a] of e.entries()) {
-      const { num: l, datas: c } = a;
-      l > 3e3 && (s > o && (o = s), r.push(...c));
+      const { num: l, datas: u } = a;
+      l > 3e3 && (s > o && (o = s), r.push(...u));
     }
     for (let s = 0; s < t.length; s++)
       if (t[s].type == "floor") {
@@ -4529,29 +4529,29 @@ const gi = (n) => {
     for (let h = 0; h < s.length; h++) {
       if (s[h].obb == null || a.includes(h))
         continue;
-      const f = {
+      const g = {
         ...s[h],
         obb: s[h].obb.clone()
       };
-      for (let u = h + 1; u < s.length; u++) {
-        if (s[u].obb == null || a.includes(u))
+      for (let c = h + 1; c < s.length; c++) {
+        if (s[c].obb == null || a.includes(c))
           continue;
-        if (f.obb.intersectsOBB(s[u].obb)) {
-          a.push(u);
-          for (let P = 0; P < s[u].points.length; P++)
-            (s[u].points[P].z > o && s[u].points[P].z - o > 0.1 || f.type == "floor") && f.points.push(s[u].points[P]);
-          const w = f.points.map((P) => [P.x, P.y]);
-          f.path = cn(w);
-          const x = Dn(f.points);
-          f.h = x.h, f.minz = x.minz, f.maxz = x.maxz, f.center = { x: x.x, y: x.y, z: x.z }, f.obb = _n(f.path, f.center, f.h, (f.maxz + f.minz) / 2), f.positionArr.push(...s[u].positionArr), u = h;
+        if (g.obb.intersectsOBB(s[c].obb)) {
+          a.push(c);
+          for (let P = 0; P < s[c].points.length; P++)
+            (s[c].points[P].z > o && s[c].points[P].z - o > 0.1 || g.type == "floor") && g.points.push(s[c].points[P]);
+          const w = g.points.map((P) => [P.x, P.y]);
+          g.path = cn(w);
+          const x = Dn(g.points);
+          g.h = x.h, g.minz = x.minz, g.maxz = x.maxz, g.center = { x: x.x, y: x.y, z: x.z }, g.obb = _n(g.path, g.center, g.h, (g.maxz + g.minz) / 2), g.positionArr.push(...s[c].positionArr), c = h;
         }
       }
-      f.path.length > s[h].path.length && (a.push(h), l.push(f));
+      g.path.length > s[h].path.length && (a.push(h), l.push(g));
     }
-    const c = [];
+    const u = [];
     for (let h = 0; h < s.length; h++)
-      a.includes(h) || c.push(s[h]);
-    c.push(...l), t[r].array = c;
+      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;
@@ -4559,78 +4559,78 @@ const gi = (n) => {
       continue;
     const a = t[r].array;
     for (let l = 0; l < a.length; l++) {
-      const c = a[l].obb, h = a[l].minz;
+      const u = a[l].obb, h = a[l].minz;
       a[l].maxz;
-      const f = a[l].averagePz;
+      const g = a[l].averagePz;
       if (s === "window" || s === "door" || s === "tv" || s === "chair" || s === "cabinet" || s === "table") {
-        const u = new y.Vector3();
-        c.getSize(u);
-        const p = [u.x, u.y, u.z];
+        const c = new y.Vector3();
+        u.getSize(c);
+        const m = [c.x, c.y, c.z];
         let w = 0;
-        for (const x of p)
+        for (const x of m)
           if (x < 0.2 && (w++, w === 2)) {
             a[l].isDel = !0;
             break;
           }
       }
       if (!a[l].isDel)
-        for (let u = r + 1; u < t.length; u++) {
-          const p = t[u].type;
-          if (p === "people" || p === "floor")
+        for (let c = r + 1; c < t.length; c++) {
+          const m = t[c].type;
+          if (m === "people" || m === "floor")
             continue;
-          const w = t[u].array;
+          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, c.intersectsOBB(P)) {
-              pe(w[x].points, c);
-              const m = pe(a[l].points, P), d = vn(c, P);
-              if (m >= 0.3 && d == -1) {
+            if (w[x].maxz, u.intersectsOBB(P)) {
+              pe(w[x].points, u);
+              const d = pe(a[l].points, P), f = vn(u, P);
+              if (d >= 0.3 && f == -1) {
                 a[l].isDel = !0;
                 break;
               }
               if (s !== "wall" && s !== "floor" && s !== "roof") {
                 if (s === "window") {
-                  if (p === "balcony railing" && we(c, w[x].points)) {
+                  if (m === "balcony railing" && we(u, w[x].points)) {
                     w[x].isDel = !0;
                     continue;
                   }
-                  if (p === "balcony railing" && we(P, a[l].points)) {
+                  if (m === "balcony railing" && we(P, a[l].points)) {
                     a[l].isDel = !0;
                     break;
                   }
-                  if (p === "balcony railing" && $e(c, P, a[l].points, w[x].points) && (Math.abs(h - M) < 0.1 || Math.abs(M - f) > 0.3)) {
+                  if (m === "balcony railing" && $e(u, P, a[l].points, w[x].points) && (Math.abs(h - M) < 0.1 || Math.abs(M - g) > 0.3)) {
                     w[x].isDel = !0;
                     continue;
                   }
                 } else if (s === "balcony railing") {
-                  if (p === "window" && we(c, w[x].points)) {
+                  if (m === "window" && we(u, w[x].points)) {
                     w[x].isDel = !0;
                     continue;
                   }
-                  if (p === "window" && we(P, a[l].points)) {
+                  if (m === "window" && we(P, a[l].points)) {
                     a[l].isDel = !0;
                     break;
                   }
-                  if (p === "window" && $e(c, P, a[l].points, w[x].points) && (Math.abs(h - M) < 0.1 || Math.abs(h - f) > 0.3)) {
+                  if (m === "window" && $e(u, P, a[l].points, w[x].points) && (Math.abs(h - M) < 0.1 || Math.abs(h - g) > 0.3)) {
                     a[l].isDel = !0;
                     break;
                   }
                 }
-                let g = !1, b = [], V = [];
+                let p = !1, b = [], z = [];
                 const v = a[l].points, S = w[x].points;
-                if (v.length > S.length ? (g = !0, b = v, V = S) : (b = S, V = v), Hr(V, b, 0.03, 0.5) > 0.5)
-                  if (g)
+                if (v.length > S.length ? (p = !0, b = v, z = S) : (b = S, z = v), Hr(z, b, 0.03, 0.5) > 0.5)
+                  if (p)
                     w[x].isDel = !0;
                   else {
                     a[l].isDel = !0;
                     break;
                   }
-                else if ($e(c, P)) {
-                  const D = vn(c, P);
+                else if ($e(u, P)) {
+                  const D = vn(u, P);
                   if (D === 1 || D === 0) {
-                    if (p === "switch") continue;
-                    v.length > S.length ? pe(V, c) >= 0.5 && (w[x].isDel = !0) : pe(b, c) >= 0.5 && (w[x].isDel = !0);
+                    if (m === "switch") continue;
+                    v.length > S.length ? pe(z, u) >= 0.5 && (w[x].isDel = !0) : pe(b, u) >= 0.5 && (w[x].isDel = !0);
                   } else {
                     if (s === "switch") continue;
                     if (v.length > S.length) {
@@ -4638,7 +4638,7 @@ const gi = (n) => {
                         a[l].isDel = !0;
                         break;
                       }
-                    } else if (pe(V, P) >= 0.5) {
+                    } else if (pe(z, P) >= 0.5) {
                       a[l].isDel = !0;
                       break;
                     }
@@ -4654,21 +4654,21 @@ const gi = (n) => {
   for (let r = 0; r < t.length; r++) {
     const s = t[r].type, a = t[r].array;
     for (let l = 0; l < a.length; l++) {
-      let c = a[l].maxz, h = a[l].minz, f = s === "switch" ? 0.1 : 0.3;
-      const u = a[l].averagePz;
-      if (Math.abs(c - u) < f) {
+      let u = a[l].maxz, h = a[l].minz, g = s === "switch" ? 0.1 : 0.3;
+      const c = a[l].averagePz;
+      if (Math.abs(u - c) < g) {
         a[l].isDel = !0;
         continue;
       }
       if (s === "window" || s === "door" || s === "tv") {
-        const p = Math.abs(c - u), w = Math.abs(h - u);
-        (s === "tv" && w < 1.6 || s !== "window" && p < 1.6) && (a[l].isDel = !0), s === "window" && p < 1 && (a[l].isDel = !0);
+        const m = Math.abs(u - c), w = Math.abs(h - c);
+        (s === "tv" && w < 1.6 || s !== "window" && m < 1.6) && (a[l].isDel = !0), s === "window" && m < 1 && (a[l].isDel = !0);
       }
       if (s === "chair") {
-        const p = new y.Vector3();
-        a[l].obb.getSize(p), (p.x < 0.1 || p.y < 0.1 || p.z < 0.2) && (a[l].isDel = !0);
+        const m = new y.Vector3();
+        a[l].obb.getSize(m), (m.x < 0.1 || m.y < 0.1 || m.z < 0.2) && (a[l].isDel = !0);
       }
-      s === "balcony railing" && (Math.abs(c - h) < 0.4 && (a[l].isDel = !0), (h < u && Math.abs(h - u) > 1 || h > u && Math.abs(h - u) > 1) && (a[l].isDel = !0), c < u && (a[l].isDel = !0)), s === "people" && (Math.abs(c - h) < 1 && (a[l].isDel = !0), h > u && h - u > 0.3 && (a[l].isDel = !0), c < u && (a[l].isDel = !0)), s === "floor" && a[l].points.length < 500 && (a[l].isDel = !0);
+      s === "balcony railing" && (Math.abs(u - h) < 0.4 && (a[l].isDel = !0), (h < 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 r = 0; r < t.length; r++)
@@ -4697,16 +4697,16 @@ function be(n, t) {
 function Yr(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 = [];
@@ -4719,8 +4719,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, f = (c * s + h * a) / l, u = e + f * s, p = o + f * a;
-  return { dist: Math.sqrt((n - u) ** 2 + (t - p) ** 2), t: f };
+  const u = n - e, h = t - o, g = (u * s + h * a) / l, c = e + g * s, m = o + g * a;
+  return { dist: Math.sqrt((n - c) ** 2 + (t - m) ** 2), t: g };
 }
 function $r(n, t, e = 0.15) {
   let o = 0, i = 0;
@@ -4742,22 +4742,22 @@ function jr(n, t, e = 0.15) {
   const o = n.end.x - n.start.x, i = n.end.y - n.start.y, r = Math.sqrt(o * o + i * i);
   if (r < 1e-12) return 0;
   const s = -i / r, a = o / r, l = [[], []];
-  for (let f = 0; f < 2; f++) {
-    const u = f === 0 ? n.start : n.end;
-    for (const p of t) {
-      if (p === n) continue;
-      const w = be(u, p.start), x = be(u, p.end);
+  for (let g = 0; g < 2; g++) {
+    const c = g === 0 ? n.start : n.end;
+    for (const m of t) {
+      if (m === n) continue;
+      const w = be(c, m.start), x = be(c, m.end);
       let P = null;
-      if (w <= e ? P = p.end : x <= e && (P = p.start), !P) continue;
-      const M = p.end.x - p.start.x, m = p.end.y - p.start.y, d = Math.sqrt(M * M + m * m);
-      if (d < 1e-12 || Math.abs(o * M + i * m) / (r * d) >= 0.342) continue;
-      const b = (P.x - u.x) * s + (P.y - u.y) * a;
-      l[f].push(b > 0 ? 1 : -1);
+      if (w <= e ? P = m.end : x <= e && (P = m.start), !P) continue;
+      const M = m.end.x - m.start.x, d = m.end.y - m.start.y, f = Math.sqrt(M * M + d * d);
+      if (f < 1e-12 || Math.abs(o * M + i * d) / (r * f) >= 0.342) continue;
+      const b = (P.x - c.x) * s + (P.y - c.y) * a;
+      l[g].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((f) => f === c[0]) ? 2 : 1;
+  const u = [...l[0], ...l[1]];
+  return u.every((g) => g === u[0]) ? 2 : 1;
 }
 function Ur(n, t, e) {
   const o = $r(n, e), i = Gr(n, t), r = jr(n, e);
@@ -4799,18 +4799,18 @@ function Qr(n, t = 0.05) {
 function Jr(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;
 }
@@ -4827,41 +4827,41 @@ function ei(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, p = r.end;
-        a ? p = s.end : l ? u = s.start : c ? p = s.start : h && (u = s.end);
-        const w = Math.hypot(p.x - u.x, p.y - u.y), x = { ...r };
-        x.start = u, x.end = p, x.length = w, x.direction = { x: (p.x - u.x) / w, y: (p.y - u.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;
+        const a = Math.abs(r.end.x - s.start.x) < 1e-3 && Math.abs(r.end.y - s.start.y) < 1e-3, l = Math.abs(r.start.x - s.end.x) < 1e-3 && Math.abs(r.start.y - s.end.y) < 1e-3, u = Math.abs(r.end.x - s.end.x) < 1e-3 && Math.abs(r.end.y - s.end.y) < 1e-3, h = Math.abs(r.start.x - s.start.x) < 1e-3 && Math.abs(r.start.y - s.start.y) < 1e-3;
+        if (!(a || l || u || h) || r.direction.x * s.direction.x + r.direction.y * s.direction.y < 0.98) continue;
+        let c = r.start, m = r.end;
+        a ? m = s.end : l ? c = s.start : u ? m = s.start : h && (c = s.end);
+        const w = Math.hypot(m.x - c.x, m.y - c.y), x = { ...r };
+        x.start = c, x.end = m, x.length = w, x.direction = { x: (m.x - c.x) / w, y: (m.y - c.y) / w, z: 0 }, x.rooftopPz = r.rooftopPz !== void 0 ? r.rooftopPz : s.rooftopPz, x.buildRosource = r.buildRosource || s.buildRosource, x.isRebuild = !1, x.doorAndBeamData || (x.doorAndBeamData = []), x.insetionArr || (x.insetionArr = []), n[o] = x, t[o] = [.../* @__PURE__ */ new Set([...t[o], ...t[i]])], n.splice(i, 1), t.splice(i, 1), i--, e = !0;
       }
   }
   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: Zr(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: Zr(l), idx: u }));
+  o.sort((l, u) => l.angle - u.angle);
   const i = Kr(o, t), r = [], s = [], a = [];
   for (const l of i) {
-    let c = l[0].seg;
+    let u = l[0].seg;
     for (const M of l)
-      M.seg.length > c.length && (c = M.seg);
-    const h = c.end.x - c.start.x, f = c.end.y - c.start.y, u = Math.sqrt(h * h + f * f);
-    if (u < 1e-12) continue;
-    const p = -f / u, w = h / u, x = l.map((M) => {
-      const m = M.seg.start.x - c.start.x, d = M.seg.start.y - c.start.y;
-      return { seg: M.seg, offset: Math.abs(m * p + d * w), idx: M.idx };
+      M.seg.length > u.length && (u = M.seg);
+    const h = u.end.x - u.start.x, g = u.end.y - u.start.y, c = Math.sqrt(h * h + g * g);
+    if (c < 1e-12) continue;
+    const m = -g / c, w = h / c, x = l.map((M) => {
+      const d = M.seg.start.x - u.start.x, f = M.seg.start.y - u.start.y;
+      return { seg: M.seg, offset: Math.abs(d * m + f * w), idx: M.idx };
     });
-    x.sort((M, m) => M.offset - m.offset);
+    x.sort((M, d) => M.offset - d.offset);
     const P = Qr(x);
     for (const M of P) {
-      let m = M[0].seg;
+      let d = M[0].seg;
       for (const T of M)
-        T.seg.length > m.length && (m = T.seg);
-      const d = m.end.x - m.start.x, g = m.end.y - m.start.y, b = Math.sqrt(d * d + g * g);
+        T.seg.length > d.length && (d = T.seg);
+      const f = d.end.x - d.start.x, p = d.end.y - d.start.y, b = Math.sqrt(f * f + p * p);
       if (b < 1e-12) continue;
-      const V = d / b, v = g / b, S = M.map((T) => T.seg.rooftopPz ?? 0), z = Math.max(...S), D = [...new Set(S.map((T) => T.toFixed(3)))];
+      const z = f / b, v = p / b, S = M.map((T) => T.seg.rooftopPz ?? 0), V = Math.max(...S), D = [...new Set(S.map((T) => T.toFixed(3)))];
       if (D.length > 1) {
         const T = M.map((E) => ({
           idx: E.idx,
@@ -4873,10 +4873,10 @@ function Zn(n, t = 5, e = 0.05) {
         a.push({ values: [...D], segments: T });
       }
       [...new Set(M.map((T) => String(T.seg.buildRosource)))];
-      const _ = Jr(M, m, V, v, e);
+      const _ = Jr(M, d, z, v, e);
       for (const { l: T, r: E, srcIdxs: A } of _) {
         if (E - T < 0.01) continue;
-        const O = ti(m, T, E, V, v, z, m.buildRosource);
+        const O = ti(d, T, E, z, v, V, d.buildRosource);
         r.push(O), s.push(A);
       }
     }
@@ -4911,38 +4911,38 @@ function ri(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 f = t * r.minLengthRatio;
-      if (h.length < f)
+      const g = t * r.minLengthRatio;
+      if (h.length < g)
         continue;
-      const { start: u, end: p } = h;
+      const { start: c, end: m } = 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, p.x, p.y);
-        D >= -c.margin && D <= 1 + c.margin && z <= c.maxDist && (w = !0, x = Math.min(x, z));
+        const { dist: V, t: D } = Un(S.x, S.y, c.x, c.y, m.x, m.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 P = Math.sqrt((p.x - u.x) ** 2 + (p.y - u.y) ** 2);
+      const P = Math.sqrt((m.x - c.x) ** 2 + (m.y - c.y) ** 2);
       if (P < 1e-12) continue;
-      const M = (p.x - u.x) / P, m = (p.y - u.y) / P, d = Math.abs(e * M + o * m), g = Math.abs(-o * M + e * m), b = Math.max(d, g), V = Math.acos(Math.min(b, 1)) * (180 / Math.PI);
-      if (V > r.angleThreshold) {
-        `${V.toFixed(1)}${r.angleThreshold}`;
+      const M = (m.x - c.x) / P, d = (m.y - c.y) / P, f = Math.abs(e * M + o * d), p = Math.abs(-o * M + e * d), b = Math.max(f, p), z = Math.acos(Math.min(b, 1)) * (180 / Math.PI);
+      if (z > r.angleThreshold) {
+        `${z.toFixed(1)}${r.angleThreshold}`;
         continue;
       }
       let v = 0;
       if (P > 0.01) {
         const S = [];
         for (let _ = 1; _ <= 4; _++) {
-          const T = i[_], E = T.x - u.x, A = T.y - u.y, O = (E * M + A * m) / P;
+          const T = i[_], E = T.x - c.x, A = T.y - c.y, O = (E * M + A * d) / 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,
@@ -4966,97 +4966,103 @@ function ii(n, t, e, o) {
   return n.sort((i, r) => r.embedRatio - i.embedRatio || r.score - i.score || i.minDist - r.minDist), n;
 }
 function si(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), f = Math.max(...c), u = (f - h) * s, p = (h + f) / 2, w = n.start.x + p * i, x = n.start.y + p * r, P = e.box.min.z, M = e.box.max.z, m = Math.abs(M - P), d = jn(o, n.start.x, n.start.y), g = Math.max(0, P - d), b = h <= 0 && f >= 1, V = n.start.z + p * (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), g = Math.max(...u), c = (g - h) * s, m = (h + g) / 2, w = n.start.x + m * i, x = n.start.y + m * r, P = e.box.min.z, M = e.box.max.z, d = Math.abs(M - P), f = jn(o, n.start.x, n.start.y), p = Math.max(0, P - f), b = h <= 0 && g >= 1, z = n.start.z + m * (n.end.z - n.start.z);
   return {
-    p: { x: w, y: x, z: V },
-    width: u,
+    p: { x: w, y: x, z },
+    width: c,
     full: b,
-    height: m,
-    groundClearance: g
+    height: d,
+    groundClearance: p
   };
 }
 function Kn(n, t, e) {
-  var h, f, u, p, w;
+  var h, g, c, m, w;
   const o = t.map((x) => e[x]), i = [], r = [], s = [], a = [], l = [];
-  let c;
+  let u;
   for (const x of o) {
     if ((h = x.points) != null && h.length) for (const P of x.points) i.push(P);
-    if ((f = x.originalPoints) != null && f.length) for (const P of x.originalPoints) r.push(P);
-    if ((u = x.doorAndBeamData) != null && u.length) for (const P of x.doorAndBeamData) s.push(P);
-    if ((p = x.insetionArr) != null && p.length) for (const P of x.insetionArr) a.push(P);
+    if ((g = x.originalPoints) != null && g.length) for (const P of x.originalPoints) r.push(P);
+    if ((c = x.doorAndBeamData) != null && c.length) for (const P of x.doorAndBeamData) s.push(P);
+    if ((m = x.insetionArr) != null && m.length) for (const P of x.insetionArr) a.push(P);
     if ((w = x.drawWindow) != null && w.length) for (const P of x.drawWindow) l.push(P);
-    x.boxData && !c && (c = x.boxData);
+    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), c && (n.boxData = c);
+  i.length && (n.points = i), r.length && (n.originalPoints = r), s.length && (n.doorAndBeamData = s), a.length && (n.insetionArr = a), l.length && (n.drawWindow = l), u && (n.boxData = u);
 }
-function ai(n, t, e) {
-  var l;
-  const o = ni(e), i = [], { segments: r, sourceMap: s } = Zn(t), a = r;
-  for (const c of n) {
-    const h = (l = c.coordinatesByArea) == null ? void 0 : l.coordinates;
-    if (!h || h.length < 4)
+function ai(n, t, e, o) {
+  var u;
+  const i = ni(e), r = [], { segments: s, sourceMap: a } = o ?? Zn(t), l = s;
+  for (const h of n) {
+    const g = (u = h.coordinatesByArea) == null ? void 0 : u.coordinates;
+    if (!g || g.length < 4)
       continue;
-    const f = h.slice(0, 4), u = f.reduce((z, D) => z + D.x, 0) / 4, p = f.reduce((z, D) => z + D.y, 0) / 4, { longSide: w, dirX: x, dirY: P } = Yr(f);
-    if (w < 0.01)
+    const c = g.slice(0, 4), m = c.reduce((D, _) => D + _.x, 0) / 4, w = c.reduce((D, _) => D + _.y, 0) / 4, { longSide: x, dirX: P, dirY: M } = Yr(c);
+    if (x < 0.01)
       continue;
-    const M = f.reduce((z, D) => z + D.z, 0) / 4, m = jn(t, u, p);
-    if (M < m - 0.3)
+    const d = c.reduce((D, _) => D + _.z, 0) / 4, f = jn(t, m, w);
+    if (d < f - 0.3)
       continue;
-    const d = oi(f, u, p);
-    c.name;
-    let g = ri(a, w, x, P, d, o, c.name);
-    g = ii(g, d, t, c.name);
-    let b = null, V = 1 / 0, v = 0;
-    if (g.length > 0) {
-      const z = g[0];
-      b = z.seg, V = z.minDist, v = z.ratio;
+    const p = oi(c, m, w);
+    h.name;
+    let b = ri(l, x, P, M, p, i, h.name);
+    b = ii(b, p, t, h.name);
+    let z = null, v = 1 / 0, S = 0;
+    if (b.length > 0) {
+      const D = b[0];
+      z = D.seg, v = D.minDist, S = D.ratio;
     }
-    let S;
-    if (b && (S = si(b, f, c, r), !o.printOnly)) {
-      const z = b;
-      z.drawWindow || (z.drawWindow = []), z.drawWindow.push(S);
+    let V;
+    if (z && (V = si(z, c, h, s), !i.printOnly)) {
+      const D = z;
+      D.drawWindow || (D.drawWindow = []), D.drawWindow.push(V);
     }
-    b && i.push({
-      windowName: c.name,
-      windowCategory: c.category,
-      windowCenter: c.center,
-      wallSegment: b,
-      distance: V,
-      wallLengthRatio: v,
-      drawWindow: S
+    z && r.push({
+      windowName: h.name,
+      windowCategory: h.category,
+      windowCenter: h.center,
+      wallSegment: z,
+      distance: v,
+      wallLengthRatio: S,
+      drawWindow: V
     });
   }
-  for (const c of i) {
-    const h = c.wallSegment, f = r.indexOf(h);
-    if (f === -1) continue;
-    const u = s[f];
-    !u || u.length <= 1 || Kn(h, u, t);
+  for (const h of r) {
+    const g = h.wallSegment, c = s.indexOf(g);
+    if (c === -1) continue;
+    const m = a[c];
+    !m || m.length <= 1 || Kn(g, m, t);
   }
-  return i;
+  return r;
 }
 function pi(n, t, e) {
   const o = {
     printOnly: !1,
     ...e
-  }, i = Array.isArray(t) ? t.filter((c) => c && c.category === "window" && !c.isBayWindowObj) : [], r = ai(i, n, o), { segments: s, sourceMap: a } = Zn(n);
-  for (let c = 0; c < s.length; c++) {
-    const h = a[c];
-    h && Kn(s[c], h, n);
+  }, i = Array.isArray(t) ? t.filter((c) => c && c.category === "window" && !c.isBayWindowObj) : [], { segments: r, sourceMap: s } = Zn(n), a = ai(i, n, o, { segments: r, sourceMap: s }), l = /* @__PURE__ */ new Set();
+  for (const c of a) {
+    const m = r.indexOf(c.wallSegment);
+    m >= 0 && l.add(m);
+  }
+  const u = [], h = /* @__PURE__ */ new Set();
+  for (const c of l) {
+    const m = s[c];
+    if (m) {
+      Kn(r[c], m, n);
+      for (const w of m) h.add(w);
+    }
+    u.push(r[c]);
   }
-  const l = new Set(r.map((c) => c.windowName));
+  for (let c = 0; c < n.length; c++)
+    h.has(c) || u.push(n[c]);
+  const g = new Set(a.map((c) => c.windowName));
   for (const c of t)
-    c && c.category === "window" && !c.isBayWindowObj && (l.has(c.name) ? delete c.AbnormalWindow : c.AbnormalWindow = !0);
-  for (const c of r)
-    if (c.drawWindow) {
-      const h = s.find(
-        (f) => Math.abs(f.start.x - c.wallSegment.start.x) < 0.01 && Math.abs(f.start.y - c.wallSegment.start.y) < 0.01 && Math.abs(f.end.x - c.wallSegment.end.x) < 0.01 && Math.abs(f.end.y - c.wallSegment.end.y) < 0.01
-      );
-      h && (h.drawWindow || (h.drawWindow = []), h.drawWindow.push(c.drawWindow));
-    }
-  return { segments: s, matches: r, sourceMap: a };
+    c && c.category === "window" && !c.isBayWindowObj && (g.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,