@thatopen/components 2.0.20 → 2.0.21

package/dist/index.mjs

@@ -92,26 +92,26 @@ function Re(l) {
   return 2 * (e * t + t * s + s * e);
 }
 function Gs(l, e, t, s, i = null) {
-  let o = 1 / 0, n = 1 / 0, r = 1 / 0, a = -1 / 0, c = -1 / 0, E = -1 / 0, d = 1 / 0, h = 1 / 0, u = 1 / 0, p = -1 / 0, A = -1 / 0, m = -1 / 0;
+  let o = 1 / 0, n = 1 / 0, r = 1 / 0, a = -1 / 0, c = -1 / 0, h = -1 / 0, d = 1 / 0, E = 1 / 0, u = 1 / 0, p = -1 / 0, A = -1 / 0, m = -1 / 0;
   const C = i !== null;
   for (let R = e * 6, F = (e + t) * 6; R < F; R += 6) {
     const f = l[R + 0], T = l[R + 1], O = f - T, _ = f + T;
     O < o && (o = O), _ > a && (a = _), C && f < d && (d = f), C && f > p && (p = f);
     const S = l[R + 2], N = l[R + 3], P = S - N, w = S + N;
-    P < n && (n = P), w > c && (c = w), C && S < h && (h = S), C && S > A && (A = S);
+    P < n && (n = P), w > c && (c = w), C && S < E && (E = S), C && S > A && (A = S);
     const y = l[R + 4], U = l[R + 5], x = y - U, B = y + U;
-    x < r && (r = x), B > E && (E = B), C && y < u && (u = y), C && y > m && (m = y);
+    x < r && (r = x), B > h && (h = B), C && y < u && (u = y), C && y > m && (m = y);
   }
-  s[0] = o, s[1] = n, s[2] = r, s[3] = a, s[4] = c, s[5] = E, C && (i[0] = d, i[1] = h, i[2] = u, i[3] = p, i[4] = A, i[5] = m);
+  s[0] = o, s[1] = n, s[2] = r, s[3] = a, s[4] = c, s[5] = h, C && (i[0] = d, i[1] = E, i[2] = u, i[3] = p, i[4] = A, i[5] = m);
 }
 function lo(l, e, t, s) {
   let i = 1 / 0, o = 1 / 0, n = 1 / 0, r = -1 / 0, a = -1 / 0, c = -1 / 0;
-  for (let E = e * 6, d = (e + t) * 6; E < d; E += 6) {
-    const h = l[E + 0];
-    h < i && (i = h), h > r && (r = h);
-    const u = l[E + 2];
+  for (let h = e * 6, d = (e + t) * 6; h < d; h += 6) {
+    const E = l[h + 0];
+    E < i && (i = E), E > r && (r = E);
+    const u = l[h + 2];
     u < o && (o = u), u > a && (a = u);
-    const p = l[E + 4];
+    const p = l[h + 4];
     p < n && (n = p), p > c && (c = p);
   }
   s[0] = i, s[1] = o, s[2] = n, s[3] = r, s[4] = a, s[5] = c;
@@ -121,14 +121,14 @@ function ho(l, e) {
   const t = l.attributes.position, s = l.index ? l.index.array : null, i = pe(l), o = new Float32Array(i * 6), n = t.normalized, r = t.array, a = t.offset || 0;
   let c = 3;
   t.isInterleavedBufferAttribute && (c = t.data.stride);
-  const E = ["getX", "getY", "getZ"];
+  const h = ["getX", "getY", "getZ"];
   for (let d = 0; d < i; d++) {
-    const h = d * 3, u = d * 6;
-    let p = h + 0, A = h + 1, m = h + 2;
+    const E = d * 3, u = d * 6;
+    let p = E + 0, A = E + 1, m = E + 2;
     s && (p = s[p], A = s[A], m = s[m]), n || (p = p * c + a, A = A * c + a, m = m * c + a);
     for (let C = 0; C < 3; C++) {
       let R, F, f;
-      n ? (R = t[E[C]](p), F = t[E[C]](A), f = t[E[C]](m)) : (R = r[p + C], F = r[A + C], f = r[m + C]);
+      n ? (R = t[h[C]](p), F = t[h[C]](A), f = t[h[C]](m)) : (R = r[p + C], F = r[A + C], f = r[m + C]);
       let T = R;
       F < T && (T = F), f < T && (T = f);
       let O = R;
@@ -155,16 +155,16 @@ function uo(l, e, t, s, i, o) {
   else if (o === so) {
     const a = Re(l);
     let c = Ys * i;
-    const E = s * 6, d = (s + i) * 6;
-    for (let h = 0; h < 3; h++) {
-      const u = e[h], m = (e[h + 3] - u) / Mt;
+    const h = s * 6, d = (s + i) * 6;
+    for (let E = 0; E < 3; E++) {
+      const u = e[E], m = (e[E + 3] - u) / Mt;
       if (i < Mt / 4) {
         const C = [...Ut];
         C.length = i;
         let R = 0;
-        for (let f = E; f < d; f += 6, R++) {
+        for (let f = h; f < d; f += 6, R++) {
           const T = C[R];
-          T.candidate = t[f + 2 * h], T.count = 0;
+          T.candidate = t[f + 2 * E], T.count = 0;
           const {
             bounds: O,
             leftCacheBounds: _,
@@ -181,8 +181,8 @@ function uo(l, e, t, s, i, o) {
           for (; f + 1 < F && C[f + 1].candidate === T.candidate; )
             C.splice(f + 1, 1), F--;
         }
-        for (let f = E; f < d; f += 6) {
-          const T = t[f + 2 * h];
+        for (let f = h; f < d; f += 6) {
+          const T = t[f + 2 * E];
           for (let O = 0; O < F; O++) {
             const _ = C[O];
             T >= _.candidate ? Qe(f, t, _.rightCacheBounds) : (Qe(f, t, _.leftCacheBounds), _.count++);
@@ -195,7 +195,7 @@ function uo(l, e, t, s, i, o) {
           let w = 0;
           _ !== 0 && (w = Re(N) / a);
           const y = bi + Ys * (P * O + w * _);
-          y < c && (n = h, c = y, r = T.candidate);
+          y < c && (n = E, c = y, r = T.candidate);
         }
       } else {
         for (let F = 0; F < Mt; F++) {
@@ -205,8 +205,8 @@ function uo(l, e, t, s, i, o) {
           for (let O = 0; O < 3; O++)
             T[O] = 1 / 0, T[O + 3] = -1 / 0;
         }
-        for (let F = E; F < d; F += 6) {
-          let O = ~~((t[F + 2 * h] - u) / m);
+        for (let F = h; F < d; F += 6) {
+          let O = ~~((t[F + 2 * E] - u) / m);
           O >= Mt && (O = Mt - 1);
           const _ = Ut[O];
           _.count++, Qe(F, t, _.bounds);
@@ -226,7 +226,7 @@ function uo(l, e, t, s, i, o) {
           const w = i - R;
           w !== 0 && (P = Re(S) / a);
           const y = bi + Ys * (N * R + P * w);
-          y < c && (n = h, c = y, r = f.candidate);
+          y < c && (n = E, c = y, r = f.candidate);
         }
       }
     }
@@ -253,13 +253,13 @@ function fo(l, e, t, s, i, o) {
     for (; n <= r && t[r * 6 + c] >= a; )
       r--;
     if (n < r) {
-      for (let E = 0; E < 3; E++) {
-        let d = e[n * 3 + E];
-        e[n * 3 + E] = e[r * 3 + E], e[r * 3 + E] = d;
+      for (let h = 0; h < 3; h++) {
+        let d = e[n * 3 + h];
+        e[n * 3 + h] = e[r * 3 + h], e[r * 3 + h] = d;
       }
-      for (let E = 0; E < 6; E++) {
-        let d = t[n * 6 + E];
-        t[n * 6 + E] = t[r * 6 + E], t[r * 6 + E] = d;
+      for (let h = 0; h < 6; h++) {
+        let d = t[n * 6 + h];
+        t[n * 6 + h] = t[r * 6 + h], t[r * 6 + h] = d;
       }
       n++, r--;
     } else
@@ -275,11 +275,11 @@ function po(l, e, t, s, i, o) {
     for (; n <= r && t[r * 6 + c] >= a; )
       r--;
     if (n < r) {
-      let E = l[n];
-      l[n] = l[r], l[r] = E;
+      let h = l[n];
+      l[n] = l[r], l[r] = h;
       for (let d = 0; d < 6; d++) {
-        let h = t[n * 6 + d];
-        t[n * 6 + d] = t[r * 6 + d], t[r * 6 + d] = h;
+        let E = t[n * 6 + d];
+        t[n * 6 + d] = t[r * 6 + d], t[r * 6 + d] = E;
       }
       n++, r--;
     } else
@@ -293,12 +293,12 @@ function Co(l, e) {
   return n;
 }
 function To(l, e) {
-  const t = l.geometry, s = t.index ? t.index.array : null, i = e.maxDepth, o = e.verbose, n = e.maxLeafTris, r = e.strategy, a = e.onProgress, c = pe(t), E = l._indirectBuffer;
+  const t = l.geometry, s = t.index ? t.index.array : null, i = e.maxDepth, o = e.verbose, n = e.maxLeafTris, r = e.strategy, a = e.onProgress, c = pe(t), h = l._indirectBuffer;
   let d = !1;
-  const h = new Float32Array(6), u = new Float32Array(6), p = ho(t, h), A = e.indirect ? po : fo, m = [], C = e.indirect ? wn(t) : Dn(t);
+  const E = new Float32Array(6), u = new Float32Array(6), p = ho(t, E), A = e.indirect ? po : fo, m = [], C = e.indirect ? wn(t) : Dn(t);
   if (C.length === 1) {
     const f = C[0], T = new qe();
-    T.boundingData = h, lo(p, f.offset, f.count, u), F(T, f.offset, f.count, u), m.push(T);
+    T.boundingData = E, lo(p, f.offset, f.count, u), F(T, f.offset, f.count, u), m.push(T);
   } else
     for (let f of C) {
       const T = new qe();
@@ -314,7 +314,7 @@ function To(l, e) {
     const N = uo(f.boundingData, _, p, T, O, r);
     if (N.axis === -1)
       return R(T + O), f.offset = T, f.count = O, f;
-    const P = A(E, s, p, T, O, N);
+    const P = A(h, s, p, T, O, N);
     if (P === T || P === T + O)
       R(T + O), f.offset = T, f.count = O;
     else {
@@ -336,29 +336,29 @@ function mo(l, e) {
   let i, o, n;
   const r = [], a = e.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer;
   for (let d = 0; d < s.length; d++) {
-    const h = s[d];
-    let u = c(h);
+    const E = s[d];
+    let u = c(E);
     const p = new a(Cs * u);
-    i = new Float32Array(p), o = new Uint32Array(p), n = new Uint16Array(p), E(0, h), r.push(p);
+    i = new Float32Array(p), o = new Uint32Array(p), n = new Uint16Array(p), h(0, E), r.push(p);
   }
   l._roots = r;
   return;
   function c(d) {
     return d.count ? 1 : 1 + c(d.left) + c(d.right);
   }
-  function E(d, h) {
-    const u = d / 4, p = d / 2, A = !!h.count, m = h.boundingData;
+  function h(d, E) {
+    const u = d / 4, p = d / 2, A = !!E.count, m = E.boundingData;
     for (let C = 0; C < 6; C++)
       i[u + C] = m[C];
     if (A) {
-      const C = h.offset, R = h.count;
+      const C = E.offset, R = E.count;
       return o[u + 6] = C, n[p + 14] = R, n[p + 15] = Us, d + Cs;
     } else {
-      const C = h.left, R = h.right, F = h.splitAxis;
+      const C = E.left, R = E.right, F = E.splitAxis;
       let f;
-      if (f = E(d + Cs, C), f / 4 > Math.pow(2, 32))
+      if (f = h(d + Cs, C), f / 4 > Math.pow(2, 32))
         throw new Error("MeshBVH: Cannot store child pointer greater than 32 bits.");
-      return o[u + 6] = f / 4, f = E(f, R), o[u + 7] = F, f;
+      return o[u + 6] = f / 4, f = h(f, R), o[u + 7] = F, f;
     }
   }
 }
@@ -393,8 +393,8 @@ wt.prototype.setFromBox = function() {
     let n = 1 / 0, r = -1 / 0;
     for (let a = 0; a <= 1; a++)
       for (let c = 0; c <= 1; c++)
-        for (let E = 0; E <= 1; E++) {
-          l.x = i.x * a + o.x * (1 - a), l.y = i.y * c + o.y * (1 - c), l.z = i.z * E + o.z * (1 - E);
+        for (let h = 0; h <= 1; h++) {
+          l.x = i.x * a + o.x * (1 - a), l.y = i.y * c + o.y * (1 - c), l.z = i.z * h + o.z * (1 - h);
           const d = t.dot(l);
           n = Math.min(d, n), r = Math.max(d, r);
         }
@@ -404,11 +404,11 @@ wt.prototype.setFromBox = function() {
 const Ro = function() {
   const l = new M(), e = new M(), t = new M();
   return function(i, o, n) {
-    const r = i.start, a = l, c = o.start, E = e;
+    const r = i.start, a = l, c = o.start, h = e;
     t.subVectors(r, c), l.subVectors(i.end, i.start), e.subVectors(o.end, o.start);
-    const d = t.dot(E), h = E.dot(a), u = E.dot(E), p = t.dot(a), m = a.dot(a) * u - h * h;
+    const d = t.dot(h), E = h.dot(a), u = h.dot(h), p = t.dot(a), m = a.dot(a) * u - E * E;
     let C, R;
-    m !== 0 ? C = (d * h - p * u) / m : C = 0, R = (d + C * h) / u, n.x = C, n.y = R;
+    m !== 0 ? C = (d * E - p * u) / m : C = 0, R = (d + C * E) / u, n.x = C, n.y = R;
   };
 }(), Oi = function() {
   const l = new fe(), e = new M(), t = new M();
@@ -425,16 +425,16 @@ const Ro = function() {
       a < 0 ? i.at(0, n) : i.at(1, n), o.closestPointToPoint(n, !0, r);
       return;
     } else {
-      let E;
-      a < 0 ? E = i.start : E = i.end;
+      let h;
+      a < 0 ? h = i.start : h = i.end;
       let d;
       c < 0 ? d = o.start : d = o.end;
-      const h = e, u = t;
-      if (i.closestPointToPoint(d, !0, e), o.closestPointToPoint(E, !0, t), h.distanceToSquared(d) <= u.distanceToSquared(E)) {
-        n.copy(h), r.copy(d);
+      const E = e, u = t;
+      if (i.closestPointToPoint(d, !0, e), o.closestPointToPoint(h, !0, t), E.distanceToSquared(d) <= u.distanceToSquared(h)) {
+        n.copy(E), r.copy(d);
         return;
       } else {
-        n.copy(E), r.copy(u);
+        n.copy(h), r.copy(u);
         return;
       }
     }
@@ -442,8 +442,8 @@ const Ro = function() {
 }(), Ao = function() {
   const l = new M(), e = new M(), t = new Fi(), s = new Pt();
   return function(o, n) {
-    const { radius: r, center: a } = o, { a: c, b: E, c: d } = n;
-    if (s.start = c, s.end = E, s.closestPointToPoint(a, !0, l).distanceTo(a) <= r || (s.start = c, s.end = d, s.closestPointToPoint(a, !0, l).distanceTo(a) <= r) || (s.start = E, s.end = d, s.closestPointToPoint(a, !0, l).distanceTo(a) <= r))
+    const { radius: r, center: a } = o, { a: c, b: h, c: d } = n;
+    if (s.start = c, s.end = h, s.closestPointToPoint(a, !0, l).distanceTo(a) <= r || (s.start = c, s.end = d, s.closestPointToPoint(a, !0, l).distanceTo(a) <= r) || (s.start = h, s.end = d, s.closestPointToPoint(a, !0, l).distanceTo(a) <= r))
       return !0;
     const A = n.getPlane(t);
     if (Math.abs(A.distanceToPoint(a)) <= r) {
@@ -467,10 +467,10 @@ class Ft extends ue {
   update() {
     const e = this.a, t = this.b, s = this.c, i = this.points, o = this.satAxes, n = this.satBounds, r = o[0], a = n[0];
     this.getNormal(r), a.setFromPoints(r, i);
-    const c = o[1], E = n[1];
-    c.subVectors(e, t), E.setFromPoints(c, i);
-    const d = o[2], h = n[2];
-    d.subVectors(t, s), h.setFromPoints(d, i);
+    const c = o[1], h = n[1];
+    c.subVectors(e, t), h.setFromPoints(c, i);
+    const d = o[2], E = n[2];
+    d.subVectors(t, s), E.setFromPoints(d, i);
     const u = o[3], p = n[3];
     u.subVectors(s, e), p.setFromPoints(u, i), this.sphere.setFromPoints(this.points), this.plane.setFromNormalAndCoplanarPoint(r, e), this.needsUpdate = !1;
   }
@@ -479,28 +479,28 @@ Ft.prototype.closestPointToSegment = function() {
   const l = new M(), e = new M(), t = new Pt();
   return function(i, o = null, n = null) {
     const { start: r, end: a } = i, c = this.points;
-    let E, d = 1 / 0;
-    for (let h = 0; h < 3; h++) {
-      const u = (h + 1) % 3;
-      t.start.copy(c[h]), t.end.copy(c[u]), Oi(t, i, l, e), E = l.distanceToSquared(e), E < d && (d = E, o && o.copy(l), n && n.copy(e));
+    let h, d = 1 / 0;
+    for (let E = 0; E < 3; E++) {
+      const u = (E + 1) % 3;
+      t.start.copy(c[E]), t.end.copy(c[u]), Oi(t, i, l, e), h = l.distanceToSquared(e), h < d && (d = h, o && o.copy(l), n && n.copy(e));
     }
-    return this.closestPointToPoint(r, l), E = r.distanceToSquared(l), E < d && (d = E, o && o.copy(l), n && n.copy(r)), this.closestPointToPoint(a, l), E = a.distanceToSquared(l), E < d && (d = E, o && o.copy(l), n && n.copy(a)), Math.sqrt(d);
+    return this.closestPointToPoint(r, l), h = r.distanceToSquared(l), h < d && (d = h, o && o.copy(l), n && n.copy(r)), this.closestPointToPoint(a, l), h = a.distanceToSquared(l), h < d && (d = h, o && o.copy(l), n && n.copy(a)), Math.sqrt(d);
   };
 }();
 Ft.prototype.intersectsTriangle = function() {
-  const l = new Ft(), e = new Array(3), t = new Array(3), s = new wt(), i = new wt(), o = new M(), n = new M(), r = new M(), a = new M(), c = new M(), E = new Pt(), d = new Pt(), h = new Pt(), u = new M();
+  const l = new Ft(), e = new Array(3), t = new Array(3), s = new wt(), i = new wt(), o = new M(), n = new M(), r = new M(), a = new M(), c = new M(), h = new Pt(), d = new Pt(), E = new Pt(), u = new M();
   function p(A, m, C) {
     const R = A.points;
     let F = 0, f = -1;
     for (let T = 0; T < 3; T++) {
-      const { start: O, end: _ } = E;
-      O.copy(R[T]), _.copy(R[(T + 1) % 3]), E.delta(n);
+      const { start: O, end: _ } = h;
+      O.copy(R[T]), _.copy(R[(T + 1) % 3]), h.delta(n);
       const S = zs(m.distanceToPoint(O));
       if (zs(m.normal.dot(n)) && S) {
-        C.copy(E), F = 2;
+        C.copy(h), F = 2;
         break;
       }
-      const N = m.intersectLine(E, u);
+      const N = m.intersectLine(h, u);
       if (!N && S && u.copy(O), (N || S) && !zs(u.distanceTo(_))) {
         if (F <= 1)
           (F === 1 ? C.start : C.end).copy(u), S && (f = F);
@@ -547,17 +547,17 @@ Ft.prototype.intersectsTriangle = function() {
         return C && (C.start.copy(d.end), C.end.copy(d.end)), !0;
       if (T !== 2)
         return !1;
-      const O = p(m, F, h);
-      if (O === 1 && this.containsPoint(h.end))
-        return C && (C.start.copy(h.end), C.end.copy(h.end)), !0;
+      const O = p(m, F, E);
+      if (O === 1 && this.containsPoint(E.end))
+        return C && (C.start.copy(E.end), C.end.copy(E.end)), !0;
       if (O !== 2)
         return !1;
-      if (d.delta(r), h.delta(a), r.dot(a) < 0) {
-        let U = h.start;
-        h.start = h.end, h.end = U;
+      if (d.delta(r), E.delta(a), r.dot(a) < 0) {
+        let U = E.start;
+        E.start = E.end, E.end = U;
       }
-      const _ = d.start.dot(r), S = d.end.dot(r), N = h.start.dot(r), P = h.end.dot(r), w = S < N, y = _ < P;
-      return _ !== P && N !== S && w === y ? !1 : (C && (c.subVectors(d.start, h.start), c.dot(r) > 0 ? C.start.copy(d.start) : C.start.copy(h.start), c.subVectors(d.end, h.end), c.dot(r) < 0 ? C.end.copy(d.end) : C.end.copy(h.end)), !0);
+      const _ = d.start.dot(r), S = d.end.dot(r), N = E.start.dot(r), P = E.end.dot(r), w = S < N, y = _ < P;
+      return _ !== P && N !== S && w === y ? !1 : (C && (c.subVectors(d.start, E.start), c.dot(r) > 0 ? C.start.copy(d.start) : C.start.copy(E.start), c.subVectors(d.end, E.end), c.dot(r) < 0 ? C.end.copy(d.end) : C.end.copy(E.end)), !0);
     }
   };
 }();
@@ -573,25 +573,25 @@ Ft.prototype.distanceToTriangle = function() {
     const c = r || a ? s : null;
     if (this.intersectsTriangle(n, c))
       return (r || a) && (r && c.getCenter(r), a && c.getCenter(a)), 0;
-    let E = 1 / 0;
+    let h = 1 / 0;
     for (let d = 0; d < 3; d++) {
-      let h;
+      let E;
       const u = t[d], p = n[u];
-      this.closestPointToPoint(p, l), h = p.distanceToSquared(l), h < E && (E = h, r && r.copy(l), a && a.copy(p));
+      this.closestPointToPoint(p, l), E = p.distanceToSquared(l), E < h && (h = E, r && r.copy(l), a && a.copy(p));
       const A = this[u];
-      n.closestPointToPoint(A, l), h = A.distanceToSquared(l), h < E && (E = h, r && r.copy(A), a && a.copy(l));
+      n.closestPointToPoint(A, l), E = A.distanceToSquared(l), E < h && (h = E, r && r.copy(A), a && a.copy(l));
     }
     for (let d = 0; d < 3; d++) {
-      const h = t[d], u = t[(d + 1) % 3];
-      s.set(this[h], this[u]);
+      const E = t[d], u = t[(d + 1) % 3];
+      s.set(this[E], this[u]);
       for (let p = 0; p < 3; p++) {
         const A = t[p], m = t[(p + 1) % 3];
         i.set(n[A], n[m]), Oi(s, i, l, e);
         const C = l.distanceToSquared(e);
-        C < E && (E = C, r && r.copy(l), a && a.copy(e));
+        C < h && (h = C, r && r.copy(l), a && a.copy(e));
       }
     }
-    return Math.sqrt(E);
+    return Math.sqrt(h);
   };
 }();
 class at {
@@ -609,15 +609,15 @@ at.prototype.update = /* @__PURE__ */ function() {
   return function() {
     const e = this.matrix, t = this.min, s = this.max, i = this.points;
     for (let c = 0; c <= 1; c++)
-      for (let E = 0; E <= 1; E++)
+      for (let h = 0; h <= 1; h++)
         for (let d = 0; d <= 1; d++) {
-          const h = 1 * c | 2 * E | 4 * d, u = i[h];
-          u.x = c ? s.x : t.x, u.y = E ? s.y : t.y, u.z = d ? s.z : t.z, u.applyMatrix4(e);
+          const E = 1 * c | 2 * h | 4 * d, u = i[E];
+          u.x = c ? s.x : t.x, u.y = h ? s.y : t.y, u.z = d ? s.z : t.z, u.applyMatrix4(e);
         }
     const o = this.satBounds, n = this.satAxes, r = i[0];
     for (let c = 0; c < 3; c++) {
-      const E = n[c], d = o[c], h = 1 << c, u = i[h];
-      E.subVectors(r, u), d.setFromPoints(E, i);
+      const h = n[c], d = o[c], E = 1 << c, u = i[E];
+      h.subVectors(r, u), d.setFromPoints(h, i);
     }
     const a = this.alignedSatBounds;
     a[0].setFromPointsField(i, "x"), a[1].setFromPointsField(i, "y"), a[2].setFromPointsField(i, "z"), this.invMatrix.copy(this.matrix).invert(), this.needsUpdate = !1;
@@ -631,8 +631,8 @@ at.prototype.intersectsBox = function() {
     if (l.min = s.x, l.max = i.x, r[0].isSeparated(l) || (l.min = s.y, l.max = i.y, r[1].isSeparated(l)) || (l.min = s.z, l.max = i.z, r[2].isSeparated(l)))
       return !1;
     for (let a = 0; a < 3; a++) {
-      const c = n[a], E = o[a];
-      if (l.setFromBox(c, t), E.isSeparated(l))
+      const c = n[a], h = o[a];
+      if (l.setFromBox(c, t), h.isSeparated(l))
         return !1;
     }
     return !0;
@@ -644,21 +644,21 @@ at.prototype.intersectsTriangle = function() {
     this.needsUpdate && this.update(), n.isExtendedTriangle ? n.needsUpdate && n.update() : (l.copy(n), l.update(), n = l);
     const r = this.satBounds, a = this.satAxes;
     e[0] = n.a, e[1] = n.b, e[2] = n.c;
-    for (let h = 0; h < 3; h++) {
-      const u = r[h], p = a[h];
+    for (let E = 0; E < 3; E++) {
+      const u = r[E], p = a[E];
       if (t.setFromPoints(p, e), u.isSeparated(t))
         return !1;
     }
-    const c = n.satBounds, E = n.satAxes, d = this.points;
-    for (let h = 0; h < 3; h++) {
-      const u = c[h], p = E[h];
+    const c = n.satBounds, h = n.satAxes, d = this.points;
+    for (let E = 0; E < 3; E++) {
+      const u = c[E], p = h[E];
       if (t.setFromPoints(p, d), u.isSeparated(t))
         return !1;
     }
-    for (let h = 0; h < 3; h++) {
-      const u = a[h];
+    for (let E = 0; E < 3; E++) {
+      const u = a[E];
       for (let p = 0; p < 4; p++) {
-        const A = E[p];
+        const A = h[p];
         if (i.crossVectors(u, A), t.setFromPoints(i, e), s.setFromPoints(i, d), t.isSeparated(s))
           return !1;
       }
@@ -682,13 +682,13 @@ at.prototype.distanceToBox = function() {
   return function(n, r = 0, a = null, c = null) {
     if (this.needsUpdate && this.update(), this.intersectsBox(n))
       return (a || c) && (n.getCenter(i), this.closestPointToPoint(i, s), n.closestPointToPoint(s, i), a && a.copy(s), c && c.copy(i)), 0;
-    const E = r * r, d = n.min, h = n.max, u = this.points;
+    const h = r * r, d = n.min, E = n.max, u = this.points;
     let p = 1 / 0;
     for (let m = 0; m < 8; m++) {
       const C = u[m];
-      i.copy(C).clamp(d, h);
+      i.copy(C).clamp(d, E);
       const R = C.distanceToSquared(i);
-      if (R < p && (p = R, a && a.copy(C), c && c.copy(i), R < E))
+      if (R < p && (p = R, a && a.copy(C), c && c.copy(i), R < h))
         return Math.sqrt(R);
     }
     let A = 0;
@@ -698,14 +698,14 @@ at.prototype.distanceToBox = function() {
           const F = (m + 1) % 3, f = (m + 2) % 3, T = C << F | R << f, O = 1 << m | C << F | R << f, _ = u[T], S = u[O];
           e[A].set(_, S);
           const P = l[m], w = l[F], y = l[f], U = t[A], x = U.start, B = U.end;
-          x[P] = d[P], x[w] = C ? d[w] : h[w], x[y] = R ? d[y] : h[w], B[P] = h[P], B[w] = C ? d[w] : h[w], B[y] = R ? d[y] : h[w], A++;
+          x[P] = d[P], x[w] = C ? d[w] : E[w], x[y] = R ? d[y] : E[w], B[P] = E[P], B[w] = C ? d[w] : E[w], B[y] = R ? d[y] : E[w], A++;
         }
     for (let m = 0; m <= 1; m++)
       for (let C = 0; C <= 1; C++)
         for (let R = 0; R <= 1; R++) {
-          i.x = m ? h.x : d.x, i.y = C ? h.y : d.y, i.z = R ? h.z : d.z, this.closestPointToPoint(i, s);
+          i.x = m ? E.x : d.x, i.y = C ? E.y : d.y, i.z = R ? E.z : d.z, this.closestPointToPoint(i, s);
           const F = i.distanceToSquared(s);
-          if (F < p && (p = F, a && a.copy(s), c && c.copy(i), F < E))
+          if (F < p && (p = F, a && a.copy(s), c && c.copy(i), F < h))
             return Math.sqrt(F);
         }
     for (let m = 0; m < 12; m++) {
@@ -714,7 +714,7 @@ at.prototype.distanceToBox = function() {
         const F = t[R];
         Oi(C, F, s, i);
         const f = s.distanceToSquared(i);
-        if (f < p && (p = f, a && a.copy(s), c && c.copy(i), f < E))
+        if (f < p && (p = f, a && a.copy(s), c && c.copy(i), f < h))
           return Math.sqrt(f);
       }
     }
@@ -781,10 +781,10 @@ function _o(l, e, t, s, i, o) {
 }
 function ai(l, e, t, s, i = null, o = 0, n = 0) {
   const { float32Array: r, uint16Array: a, uint32Array: c } = Z;
-  let E = l * 2;
-  if (ht(E, a)) {
-    const h = Et(l, c), u = ft(E, a);
-    return K(l, r, Yt), s(h, u, !1, n, o + l, Yt);
+  let h = l * 2;
+  if (ht(h, a)) {
+    const E = Et(l, c), u = ft(h, a);
+    return K(l, r, Yt), s(E, u, !1, n, o + l, Yt);
   } else {
     let P = function(y) {
       const { uint16Array: U, uint32Array: x } = Z;
@@ -799,10 +799,10 @@ function ai(l, e, t, s, i = null, o = 0, n = 0) {
         y = Ct(y, x), B = y * 2;
       return Et(y, x) + ft(B, U);
     };
-    const h = pt(l), u = Ct(l, c);
-    let p = h, A = u, m, C, R, F;
+    const E = pt(l), u = Ct(l, c);
+    let p = E, A = u, m, C, R, F;
     if (i && (R = Yt, F = Ie, K(p, r, R), K(A, r, F), m = i(R), C = i(F), C < m)) {
-      p = u, A = h;
+      p = u, A = E;
       const y = m;
       m = C, C = y, R = F;
     }
@@ -849,12 +849,12 @@ function So(l, e, t = {}, s = 0, i = 1 / 0) {
   let r = 1 / 0, a = null;
   if (l.shapecast(
     {
-      boundsTraverseOrder: (E) => (Ae.copy(e).clamp(E.min, E.max), Ae.distanceToSquared(e)),
-      intersectsBounds: (E, d, h) => h < r && h < n,
-      intersectsTriangle: (E, d) => {
-        E.closestPointToPoint(e, Ae);
-        const h = e.distanceToSquared(Ae);
-        return h < r && (Hs.copy(Ae), r = h, a = d), h < o;
+      boundsTraverseOrder: (h) => (Ae.copy(e).clamp(h.min, h.max), Ae.distanceToSquared(e)),
+      intersectsBounds: (h, d, E) => E < r && E < n,
+      intersectsTriangle: (h, d) => {
+        h.closestPointToPoint(e, Ae);
+        const E = e.distanceToSquared(Ae);
+        return E < r && (Hs.copy(Ae), r = E, a = d), E < o;
       }
     }
   ), r === 1 / 0)
@@ -875,14 +875,14 @@ function Lo(l, e, t, s, i, o, n, r, a) {
   const c = No(l, te, ee, se, es, a);
   if (c) {
     s && ($e.fromBufferAttribute(s, o), Je.fromBufferAttribute(s, n), ts.fromBufferAttribute(s, r), c.uv = ue.getInterpolation(es, te, ee, se, $e, Je, ts, new fe())), i && ($e.fromBufferAttribute(i, o), Je.fromBufferAttribute(i, n), ts.fromBufferAttribute(i, r), c.uv1 = ue.getInterpolation(es, te, ee, se, $e, Je, ts, new fe())), t && (Vi.fromBufferAttribute(t, o), Gi.fromBufferAttribute(t, n), zi.fromBufferAttribute(t, r), c.normal = ue.getInterpolation(es, te, ee, se, Vi, Gi, zi, new M()), c.normal.dot(l.direction) > 0 && c.normal.multiplyScalar(-1));
-    const E = {
+    const h = {
       a: o,
       b: n,
       c: r,
       normal: new M(),
       materialIndex: 0
     };
-    ue.getNormal(te, ee, se, E.normal), c.face = E, c.faceIndex = o;
+    ue.getNormal(te, ee, se, h.normal), c.face = h, c.faceIndex = o;
   }
   return c;
 }
@@ -891,7 +891,7 @@ function xs(l, e, t, s, i) {
   let n = o + 0, r = o + 1, a = o + 2;
   const c = l.index;
   l.index && (n = c.getX(n), r = c.getX(r), a = c.getX(a));
-  const { position: E, normal: d, uv: h, uv1: u } = l.attributes, p = Lo(t, E, d, h, u, n, r, a, e);
+  const { position: h, normal: d, uv: E, uv1: u } = l.attributes, p = Lo(t, h, d, E, u, n, r, a, e);
   return p ? (p.faceIndex = s, i && i.push(p), p) : null;
 }
 function tt(l, e, t, s) {
@@ -907,7 +907,7 @@ function Po(l, e, t, s, i, o) {
 function yo(l, e, t, s, i) {
   const { geometry: o, _indirectBuffer: n } = l;
   let r = 1 / 0, a = null;
-  for (let c = s, E = s + i; c < E; c++) {
+  for (let c = s, h = s + i; c < h; c++) {
     let d;
     d = xs(o, e, t, c), d && d.distance < r && (a = d, r = d.distance);
   }
@@ -915,9 +915,9 @@ function yo(l, e, t, s, i) {
 }
 function Mo(l, e, t, s, i, o, n) {
   const { geometry: r } = t, { index: a } = r, c = r.attributes.position;
-  for (let E = l, d = e + l; E < d; E++) {
-    let h;
-    if (h = E, tt(n, h * 3, a, c), n.needsUpdate = !0, s(n, h, i, o))
+  for (let h = l, d = e + l; h < d; h++) {
+    let E;
+    if (E = h, tt(n, E * 3, a, c), n.needsUpdate = !0, s(n, E, i, o))
       return !0;
   }
   return !1;
@@ -926,22 +926,22 @@ function wo(l, e = null) {
   e && Array.isArray(e) && (e = new Set(e));
   const t = l.geometry, s = t.index ? t.index.array : null, i = t.attributes.position;
   let o, n, r, a, c = 0;
-  const E = l._roots;
-  for (let h = 0, u = E.length; h < u; h++)
-    o = E[h], n = new Uint32Array(o), r = new Uint16Array(o), a = new Float32Array(o), d(0, c), c += o.byteLength;
-  function d(h, u, p = !1) {
-    const A = h * 2;
+  const h = l._roots;
+  for (let E = 0, u = h.length; E < u; E++)
+    o = h[E], n = new Uint32Array(o), r = new Uint16Array(o), a = new Float32Array(o), d(0, c), c += o.byteLength;
+  function d(E, u, p = !1) {
+    const A = E * 2;
     if (r[A + 15] === Us) {
-      const C = n[h + 6], R = r[A + 14];
+      const C = n[E + 6], R = r[A + 14];
       let F = 1 / 0, f = 1 / 0, T = 1 / 0, O = -1 / 0, _ = -1 / 0, S = -1 / 0;
       for (let N = 3 * C, P = 3 * (C + R); N < P; N++) {
         let w = s[N];
         const y = i.getX(w), U = i.getY(w), x = i.getZ(w);
         y < F && (F = y), y > O && (O = y), U < f && (f = U), U > _ && (_ = U), x < T && (T = x), x > S && (S = x);
       }
-      return a[h + 0] !== F || a[h + 1] !== f || a[h + 2] !== T || a[h + 3] !== O || a[h + 4] !== _ || a[h + 5] !== S ? (a[h + 0] = F, a[h + 1] = f, a[h + 2] = T, a[h + 3] = O, a[h + 4] = _, a[h + 5] = S, !0) : !1;
+      return a[E + 0] !== F || a[E + 1] !== f || a[E + 2] !== T || a[E + 3] !== O || a[E + 4] !== _ || a[E + 5] !== S ? (a[E + 0] = F, a[E + 1] = f, a[E + 2] = T, a[E + 3] = O, a[E + 4] = _, a[E + 5] = S, !0) : !1;
     } else {
-      const C = h + 8, R = n[h + 6], F = C + u, f = R + u;
+      const C = E + 8, R = n[E + 6], F = C + u, f = R + u;
       let T = p, O = !1, _ = !1;
       e ? T || (O = e.has(F), _ = e.has(f), T = !O && !_) : (O = !0, _ = !0);
       const S = T || O, N = T || _;
@@ -953,7 +953,7 @@ function wo(l, e = null) {
       if (y)
         for (let U = 0; U < 3; U++) {
           const x = C + U, B = R + U, H = a[x], q = a[x + 3], st = a[B], Q = a[B + 3];
-          a[h + U] = H < st ? H : st, a[h + U + 3] = q > Q ? q : Q;
+          a[E + U] = H < st ? H : st, a[E + U + 3] = q > Q ? q : Q;
         }
       return y;
     }
@@ -966,14 +966,14 @@ function Gt(l, e, t, s) {
 function Do(l, e, t, s, i, o) {
   const { geometry: n, _indirectBuffer: r } = l;
   for (let a = s, c = s + i; a < c; a++) {
-    let E = r ? r[a] : a;
-    xs(n, e, t, E, o);
+    let h = r ? r[a] : a;
+    xs(n, e, t, h, o);
   }
 }
 function Uo(l, e, t, s, i) {
   const { geometry: o, _indirectBuffer: n } = l;
   let r = 1 / 0, a = null;
-  for (let c = s, E = s + i; c < E; c++) {
+  for (let c = s, h = s + i; c < h; c++) {
     let d;
     d = xs(o, e, t, n ? n[c] : c), d && d.distance < r && (a = d, r = d.distance);
   }
@@ -981,9 +981,9 @@ function Uo(l, e, t, s, i) {
 }
 function xo(l, e, t, s, i, o, n) {
   const { geometry: r } = t, { index: a } = r, c = r.attributes.position;
-  for (let E = l, d = e + l; E < d; E++) {
-    let h;
-    if (h = t.resolveTriangleIndex(E), tt(n, h * 3, a, c), n.needsUpdate = !0, s(n, h, i, o))
+  for (let h = l, d = e + l; h < d; h++) {
+    let E;
+    if (E = t.resolveTriangleIndex(h), tt(n, E * 3, a, c), n.needsUpdate = !0, s(n, E, i, o))
       return !0;
   }
   return !1;
@@ -995,11 +995,11 @@ function bo(l, e, t, s, i) {
 function ci(l, e, t, s, i) {
   const { float32Array: o, uint16Array: n, uint32Array: r } = Z, a = l * 2;
   if (ht(a, n)) {
-    const E = Et(l, r), d = ft(a, n);
-    Po(e, t, s, E, d, i);
+    const h = Et(l, r), d = ft(a, n);
+    Po(e, t, s, h, d, i);
   } else {
-    const E = pt(l);
-    Gt(E, o, s, ki) && ci(E, e, t, s, i);
+    const h = pt(l);
+    Gt(h, o, s, ki) && ci(h, e, t, s, i);
     const d = Ct(l, r);
     Gt(d, o, s, ki) && ci(d, e, t, s, i);
   }
@@ -1014,16 +1014,16 @@ function li(l, e, t, s) {
   const { float32Array: i, uint16Array: o, uint32Array: n } = Z;
   let r = l * 2;
   if (ht(r, o)) {
-    const c = Et(l, n), E = ft(r, o);
-    return yo(e, t, s, c, E);
+    const c = Et(l, n), h = ft(r, o);
+    return yo(e, t, s, c, h);
   } else {
-    const c = Un(l, n), E = vo[c], h = s.direction[E] >= 0;
+    const c = Un(l, n), h = vo[c], E = s.direction[h] >= 0;
     let u, p;
-    h ? (u = pt(l), p = Ct(l, n)) : (u = Ct(l, n), p = pt(l));
+    E ? (u = pt(l), p = Ct(l, n)) : (u = Ct(l, n), p = pt(l));
     const m = Gt(u, i, s, Wi) ? li(u, e, t, s) : null;
     if (m) {
-      const F = m.point[E];
-      if (h ? F <= i[p + c] : (
+      const F = m.point[h];
+      if (E ? F <= i[p + c] : (
         // min bounding data
         F >= i[p + c + 3]
       ))
@@ -1043,33 +1043,33 @@ function hi(l, e, t, s, i = null) {
   const { float32Array: o, uint16Array: n, uint32Array: r } = Z;
   let a = l * 2;
   if (i === null && (t.boundingBox || t.computeBoundingBox(), Xi.set(t.boundingBox.min, t.boundingBox.max, s), i = Xi), ht(a, n)) {
-    const E = e.geometry, d = E.index, h = E.attributes.position, u = t.index, p = t.attributes.position, A = Et(l, r), m = ft(a, n);
+    const h = e.geometry, d = h.index, E = h.attributes.position, u = t.index, p = t.attributes.position, A = Et(l, r), m = ft(a, n);
     if (Fe.copy(s).invert(), t.boundsTree)
       return K(l, o, is), is.matrix.copy(Fe), is.needsUpdate = !0, t.boundsTree.shapecast({
         intersectsBounds: (R) => is.intersectsBox(R),
         intersectsTriangle: (R) => {
           R.a.applyMatrix4(s), R.b.applyMatrix4(s), R.c.applyMatrix4(s), R.needsUpdate = !0;
           for (let F = A * 3, f = (m + A) * 3; F < f; F += 3)
-            if (tt(ne, F, d, h), ne.needsUpdate = !0, R.intersectsTriangle(ne))
+            if (tt(ne, F, d, E), ne.needsUpdate = !0, R.intersectsTriangle(ne))
               return !0;
           return !1;
         }
       });
     for (let C = A * 3, R = (m + A) * 3; C < R; C += 3) {
-      tt(ie, C, d, h), ie.a.applyMatrix4(Fe), ie.b.applyMatrix4(Fe), ie.c.applyMatrix4(Fe), ie.needsUpdate = !0;
+      tt(ie, C, d, E), ie.a.applyMatrix4(Fe), ie.b.applyMatrix4(Fe), ie.c.applyMatrix4(Fe), ie.needsUpdate = !0;
       for (let F = 0, f = u.count; F < f; F += 3)
         if (tt(ne, F, u, p), ne.needsUpdate = !0, ie.intersectsTriangle(ne))
           return !0;
     }
   } else {
-    const E = l + 8, d = r[l + 6];
-    return K(E, o, ss), !!(i.intersectsBox(ss) && hi(E, e, t, s, i) || (K(d, o, ss), i.intersectsBox(ss) && hi(d, e, t, s, i)));
+    const h = l + 8, d = r[l + 6];
+    return K(h, o, ss), !!(i.intersectsBox(ss) && hi(h, e, t, s, i) || (K(d, o, ss), i.intersectsBox(ss) && hi(d, e, t, s, i)));
   }
 }
 const ns = /* @__PURE__ */ new yt(), ks = /* @__PURE__ */ new at(), Oe = /* @__PURE__ */ new at(), Vo = /* @__PURE__ */ new M(), Go = /* @__PURE__ */ new M(), zo = /* @__PURE__ */ new M(), Ho = /* @__PURE__ */ new M();
 function ko(l, e, t, s = {}, i = {}, o = 0, n = 1 / 0) {
   e.boundingBox || e.computeBoundingBox(), ks.set(e.boundingBox.min, e.boundingBox.max, t), ks.needsUpdate = !0;
-  const r = l.geometry, a = r.attributes.position, c = r.index, E = e.attributes.position, d = e.index, h = It.getPrimitive(), u = It.getPrimitive();
+  const r = l.geometry, a = r.attributes.position, c = r.index, h = e.attributes.position, d = e.index, E = It.getPrimitive(), u = It.getPrimitive();
   let p = Vo, A = Go, m = null, C = null;
   i && (m = zo, C = Ho);
   let R = 1 / 0, F = null, f = null;
@@ -1084,10 +1084,10 @@ function ko(l, e, t, s = {}, i = {}, o = 0, n = 1 / 0) {
             intersectsBounds: (S, N, P) => P < R && P < n,
             intersectsRange: (S, N) => {
               for (let P = S, w = S + N; P < w; P++) {
-                tt(u, 3 * P, d, E), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+                tt(u, 3 * P, d, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
                 for (let y = T, U = T + O; y < U; y++) {
-                  tt(h, 3 * y, c, a), h.needsUpdate = !0;
-                  const x = h.distanceToTriangle(u, p, m);
+                  tt(E, 3 * y, c, a), E.needsUpdate = !0;
+                  const x = E.distanceToTriangle(u, p, m);
                   if (x < R && (A.copy(p), C && C.copy(m), R = x, F = y, f = P), x < o)
                     return !0;
                 }
@@ -1097,10 +1097,10 @@ function ko(l, e, t, s = {}, i = {}, o = 0, n = 1 / 0) {
         {
           const _ = pe(e);
           for (let S = 0, N = _; S < N; S++) {
-            tt(u, 3 * S, d, E), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+            tt(u, 3 * S, d, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
             for (let P = T, w = T + O; P < w; P++) {
-              tt(h, 3 * P, c, a), h.needsUpdate = !0;
-              const y = h.distanceToTriangle(u, p, m);
+              tt(E, 3 * P, c, a), E.needsUpdate = !0;
+              const y = E.distanceToTriangle(u, p, m);
               if (y < R && (A.copy(p), C && C.copy(m), R = y, F = P, f = S), y < o)
                 return !0;
             }
@@ -1108,19 +1108,19 @@ function ko(l, e, t, s = {}, i = {}, o = 0, n = 1 / 0) {
         }
       }
     }
-  ), It.releasePrimitive(h), It.releasePrimitive(u), R === 1 / 0 ? null : (s.point ? s.point.copy(A) : s.point = A.clone(), s.distance = R, s.faceIndex = F, i && (i.point ? i.point.copy(C) : i.point = C.clone(), i.point.applyMatrix4(ns), A.applyMatrix4(ns), i.distance = A.sub(i.point).length(), i.faceIndex = f), s);
+  ), It.releasePrimitive(E), It.releasePrimitive(u), R === 1 / 0 ? null : (s.point ? s.point.copy(A) : s.point = A.clone(), s.distance = R, s.faceIndex = F, i && (i.point ? i.point.copy(C) : i.point = C.clone(), i.point.applyMatrix4(ns), A.applyMatrix4(ns), i.distance = A.sub(i.point).length(), i.faceIndex = f), s);
 }
 function Wo(l, e = null) {
   e && Array.isArray(e) && (e = new Set(e));
   const t = l.geometry, s = t.index ? t.index.array : null, i = t.attributes.position;
   let o, n, r, a, c = 0;
-  const E = l._roots;
-  for (let h = 0, u = E.length; h < u; h++)
-    o = E[h], n = new Uint32Array(o), r = new Uint16Array(o), a = new Float32Array(o), d(0, c), c += o.byteLength;
-  function d(h, u, p = !1) {
-    const A = h * 2;
+  const h = l._roots;
+  for (let E = 0, u = h.length; E < u; E++)
+    o = h[E], n = new Uint32Array(o), r = new Uint16Array(o), a = new Float32Array(o), d(0, c), c += o.byteLength;
+  function d(E, u, p = !1) {
+    const A = E * 2;
     if (r[A + 15] === Us) {
-      const C = n[h + 6], R = r[A + 14];
+      const C = n[E + 6], R = r[A + 14];
       let F = 1 / 0, f = 1 / 0, T = 1 / 0, O = -1 / 0, _ = -1 / 0, S = -1 / 0;
       for (let N = C, P = C + R; N < P; N++) {
         const w = 3 * l.resolveTriangleIndex(N);
@@ -1131,9 +1131,9 @@ function Wo(l, e = null) {
           x < F && (F = x), x > O && (O = x), B < f && (f = B), B > _ && (_ = B), H < T && (T = H), H > S && (S = H);
         }
       }
-      return a[h + 0] !== F || a[h + 1] !== f || a[h + 2] !== T || a[h + 3] !== O || a[h + 4] !== _ || a[h + 5] !== S ? (a[h + 0] = F, a[h + 1] = f, a[h + 2] = T, a[h + 3] = O, a[h + 4] = _, a[h + 5] = S, !0) : !1;
+      return a[E + 0] !== F || a[E + 1] !== f || a[E + 2] !== T || a[E + 3] !== O || a[E + 4] !== _ || a[E + 5] !== S ? (a[E + 0] = F, a[E + 1] = f, a[E + 2] = T, a[E + 3] = O, a[E + 4] = _, a[E + 5] = S, !0) : !1;
     } else {
-      const C = h + 8, R = n[h + 6], F = C + u, f = R + u;
+      const C = E + 8, R = n[E + 6], F = C + u, f = R + u;
       let T = p, O = !1, _ = !1;
       e ? T || (O = e.has(F), _ = e.has(f), T = !O && !_) : (O = !0, _ = !0);
       const S = T || O, N = T || _;
@@ -1145,7 +1145,7 @@ function Wo(l, e = null) {
       if (y)
         for (let U = 0; U < 3; U++) {
           const x = C + U, B = R + U, H = a[x], q = a[x + 3], st = a[B], Q = a[B + 3];
-          a[h + U] = H < st ? H : st, a[h + U + 3] = q > Q ? q : Q;
+          a[E + U] = H < st ? H : st, a[E + U + 3] = q > Q ? q : Q;
         }
       return y;
     }
@@ -1158,11 +1158,11 @@ function Xo(l, e, t, s, i) {
 function Ei(l, e, t, s, i) {
   const { float32Array: o, uint16Array: n, uint32Array: r } = Z, a = l * 2;
   if (ht(a, n)) {
-    const E = Et(l, r), d = ft(a, n);
-    Do(e, t, s, E, d, i);
+    const h = Et(l, r), d = ft(a, n);
+    Do(e, t, s, h, d, i);
   } else {
-    const E = pt(l);
-    Gt(E, o, s, Zi) && Ei(E, e, t, s, i);
+    const h = pt(l);
+    Gt(h, o, s, Zi) && Ei(h, e, t, s, i);
     const d = Ct(l, r);
     Gt(d, o, s, Zi) && Ei(d, e, t, s, i);
   }
@@ -1177,16 +1177,16 @@ function di(l, e, t, s) {
   const { float32Array: i, uint16Array: o, uint32Array: n } = Z;
   let r = l * 2;
   if (ht(r, o)) {
-    const c = Et(l, n), E = ft(r, o);
-    return Uo(e, t, s, c, E);
+    const c = Et(l, n), h = ft(r, o);
+    return Uo(e, t, s, c, h);
   } else {
-    const c = Un(l, n), E = Zo[c], h = s.direction[E] >= 0;
+    const c = Un(l, n), h = Zo[c], E = s.direction[h] >= 0;
     let u, p;
-    h ? (u = pt(l), p = Ct(l, n)) : (u = Ct(l, n), p = pt(l));
+    E ? (u = pt(l), p = Ct(l, n)) : (u = Ct(l, n), p = pt(l));
     const m = Gt(u, i, s, Qi) ? di(u, e, t, s) : null;
     if (m) {
-      const F = m.point[E];
-      if (h ? F <= i[p + c] : (
+      const F = m.point[h];
+      if (E ? F <= i[p + c] : (
         // min bounding data
         F >= i[p + c + 3]
       ))
@@ -1206,34 +1206,34 @@ function ui(l, e, t, s, i = null) {
   const { float32Array: o, uint16Array: n, uint32Array: r } = Z;
   let a = l * 2;
   if (i === null && (t.boundingBox || t.computeBoundingBox(), ji.set(t.boundingBox.min, t.boundingBox.max, s), i = ji), ht(a, n)) {
-    const E = e.geometry, d = E.index, h = E.attributes.position, u = t.index, p = t.attributes.position, A = Et(l, r), m = ft(a, n);
+    const h = e.geometry, d = h.index, E = h.attributes.position, u = t.index, p = t.attributes.position, A = Et(l, r), m = ft(a, n);
     if (ge.copy(s).invert(), t.boundsTree)
       return K(l, o, rs), rs.matrix.copy(ge), rs.needsUpdate = !0, t.boundsTree.shapecast({
         intersectsBounds: (R) => rs.intersectsBox(R),
         intersectsTriangle: (R) => {
           R.a.applyMatrix4(s), R.b.applyMatrix4(s), R.c.applyMatrix4(s), R.needsUpdate = !0;
           for (let F = A, f = m + A; F < f; F++)
-            if (tt(re, 3 * e.resolveTriangleIndex(F), d, h), re.needsUpdate = !0, R.intersectsTriangle(re))
+            if (tt(re, 3 * e.resolveTriangleIndex(F), d, E), re.needsUpdate = !0, R.intersectsTriangle(re))
               return !0;
           return !1;
         }
       });
     for (let C = A, R = m + A; C < R; C++) {
       const F = e.resolveTriangleIndex(C);
-      tt(oe, 3 * F, d, h), oe.a.applyMatrix4(ge), oe.b.applyMatrix4(ge), oe.c.applyMatrix4(ge), oe.needsUpdate = !0;
+      tt(oe, 3 * F, d, E), oe.a.applyMatrix4(ge), oe.b.applyMatrix4(ge), oe.c.applyMatrix4(ge), oe.needsUpdate = !0;
       for (let f = 0, T = u.count; f < T; f += 3)
         if (tt(re, f, u, p), re.needsUpdate = !0, oe.intersectsTriangle(re))
           return !0;
     }
   } else {
-    const E = l + 8, d = r[l + 6];
-    return K(E, o, os), !!(i.intersectsBox(os) && ui(E, e, t, s, i) || (K(d, o, os), i.intersectsBox(os) && ui(d, e, t, s, i)));
+    const h = l + 8, d = r[l + 6];
+    return K(h, o, os), !!(i.intersectsBox(os) && ui(h, e, t, s, i) || (K(d, o, os), i.intersectsBox(os) && ui(d, e, t, s, i)));
   }
 }
 const as = /* @__PURE__ */ new yt(), Ws = /* @__PURE__ */ new at(), _e = /* @__PURE__ */ new at(), qo = /* @__PURE__ */ new M(), Ko = /* @__PURE__ */ new M(), $o = /* @__PURE__ */ new M(), Jo = /* @__PURE__ */ new M();
 function tr(l, e, t, s = {}, i = {}, o = 0, n = 1 / 0) {
   e.boundingBox || e.computeBoundingBox(), Ws.set(e.boundingBox.min, e.boundingBox.max, t), Ws.needsUpdate = !0;
-  const r = l.geometry, a = r.attributes.position, c = r.index, E = e.attributes.position, d = e.index, h = It.getPrimitive(), u = It.getPrimitive();
+  const r = l.geometry, a = r.attributes.position, c = r.index, h = e.attributes.position, d = e.index, E = It.getPrimitive(), u = It.getPrimitive();
   let p = qo, A = Ko, m = null, C = null;
   i && (m = $o, C = Jo);
   let R = 1 / 0, F = null, f = null;
@@ -1250,11 +1250,11 @@ function tr(l, e, t, s = {}, i = {}, o = 0, n = 1 / 0) {
             intersectsRange: (S, N) => {
               for (let P = S, w = S + N; P < w; P++) {
                 const y = _.resolveTriangleIndex(P);
-                tt(u, 3 * y, d, E), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+                tt(u, 3 * y, d, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
                 for (let U = T, x = T + O; U < x; U++) {
                   const B = l.resolveTriangleIndex(U);
-                  tt(h, 3 * B, c, a), h.needsUpdate = !0;
-                  const H = h.distanceToTriangle(u, p, m);
+                  tt(E, 3 * B, c, a), E.needsUpdate = !0;
+                  const H = E.distanceToTriangle(u, p, m);
                   if (H < R && (A.copy(p), C && C.copy(m), R = H, F = U, f = P), H < o)
                     return !0;
                 }
@@ -1264,11 +1264,11 @@ function tr(l, e, t, s = {}, i = {}, o = 0, n = 1 / 0) {
         } else {
           const _ = pe(e);
           for (let S = 0, N = _; S < N; S++) {
-            tt(u, 3 * S, d, E), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+            tt(u, 3 * S, d, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
             for (let P = T, w = T + O; P < w; P++) {
               const y = l.resolveTriangleIndex(P);
-              tt(h, 3 * y, c, a), h.needsUpdate = !0;
-              const U = h.distanceToTriangle(u, p, m);
+              tt(E, 3 * y, c, a), E.needsUpdate = !0;
+              const U = E.distanceToTriangle(u, p, m);
               if (U < R && (A.copy(p), C && C.copy(m), R = U, F = P, f = S), U < o)
                 return !0;
             }
@@ -1276,7 +1276,7 @@ function tr(l, e, t, s = {}, i = {}, o = 0, n = 1 / 0) {
         }
       }
     }
-  ), It.releasePrimitive(h), It.releasePrimitive(u), R === 1 / 0 ? null : (s.point ? s.point.copy(A) : s.point = A.clone(), s.distance = R, s.faceIndex = F, i && (i.point ? i.point.copy(C) : i.point = C.clone(), i.point.applyMatrix4(as), A.applyMatrix4(as), i.distance = A.sub(i.point).length(), i.faceIndex = f), s);
+  ), It.releasePrimitive(E), It.releasePrimitive(u), R === 1 / 0 ? null : (s.point ? s.point.copy(A) : s.point = A.clone(), s.distance = R, s.faceIndex = F, i && (i.point ? i.point.copy(C) : i.point = C.clone(), i.point.applyMatrix4(as), A.applyMatrix4(as), i.distance = A.sub(i.point).length(), i.faceIndex = f), s);
 }
 function er() {
   return typeof SharedArrayBuffer < "u";
@@ -1290,11 +1290,11 @@ function sr(l, e, t, s) {
   const i = l._roots, o = e._roots;
   let n, r = 0, a = 0;
   const c = new yt().copy(t).invert();
-  for (let E = 0, d = i.length; E < d; E++) {
-    xe.setBuffer(i[E]), a = 0;
-    const h = vt.getPrimitive();
-    K(0, xe.float32Array, h), h.applyMatrix4(c);
-    for (let u = 0, p = o.length; u < p && (As.setBuffer(o[E]), n = Tt(
+  for (let h = 0, d = i.length; h < d; h++) {
+    xe.setBuffer(i[h]), a = 0;
+    const E = vt.getPrimitive();
+    K(0, xe.float32Array, E), E.applyMatrix4(c);
+    for (let u = 0, p = o.length; u < p && (As.setBuffer(o[h]), n = Tt(
       0,
       0,
       t,
@@ -1304,21 +1304,21 @@ function sr(l, e, t, s) {
       a,
       0,
       0,
-      h
+      E
     ), As.clearBuffer(), a += o[u].length, !n); u++)
       ;
-    if (vt.releasePrimitive(h), xe.clearBuffer(), r += i[E].length, n)
+    if (vt.releasePrimitive(E), xe.clearBuffer(), r += i[h].length, n)
       break;
   }
   return Qs = !1, n;
 }
-function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
-  let d, h;
-  E ? (d = As, h = xe) : (d = xe, h = As);
-  const u = d.float32Array, p = d.uint32Array, A = d.uint16Array, m = h.float32Array, C = h.uint32Array, R = h.uint16Array, F = l * 2, f = e * 2, T = ht(F, A), O = ht(f, R);
+function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, h = !1) {
+  let d, E;
+  h ? (d = As, E = xe) : (d = xe, E = As);
+  const u = d.float32Array, p = d.uint32Array, A = d.uint16Array, m = E.float32Array, C = E.uint32Array, R = E.uint16Array, F = l * 2, f = e * 2, T = ht(F, A), O = ht(f, R);
   let _ = !1;
   if (O && T)
-    E ? _ = i(
+    h ? _ = i(
       Et(e, C),
       ft(e * 2, R),
       Et(l, p),
@@ -1354,7 +1354,7 @@ function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
       a,
       r + 1,
       S,
-      !E
+      !h
     ) || y && Tt(
       e,
       P,
@@ -1366,7 +1366,7 @@ function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
       a,
       r + 1,
       S,
-      !E
+      !h
     ), vt.releasePrimitive(S);
   } else {
     const S = pt(e), N = Ct(e, C);
@@ -1384,7 +1384,7 @@ function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
         r,
         a + 1,
         c,
-        E
+        h
       ) || Tt(
         l,
         N,
@@ -1396,7 +1396,7 @@ function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
         r,
         a + 1,
         c,
-        E
+        h
       );
     else if (P)
       if (T)
@@ -1411,7 +1411,7 @@ function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           r,
           a + 1,
           c,
-          E
+          h
         );
       else {
         const y = vt.getPrimitive();
@@ -1430,7 +1430,7 @@ function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           a,
           r + 1,
           y,
-          !E
+          !h
         ) || H && Tt(
           S,
           x,
@@ -1442,7 +1442,7 @@ function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           a,
           r + 1,
           y,
-          !E
+          !h
         ), vt.releasePrimitive(y);
       }
     else if (w)
@@ -1458,7 +1458,7 @@ function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           r,
           a + 1,
           c,
-          E
+          h
         );
       else {
         const y = vt.getPrimitive();
@@ -1477,7 +1477,7 @@ function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           a,
           r + 1,
           y,
-          !E
+          !h
         ) || H && Tt(
           N,
           x,
@@ -1489,7 +1489,7 @@ function Tt(l, e, t, s, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           a,
           r + 1,
           y,
-          !E
+          !h
         ), vt.releasePrimitive(y);
       }
   }
@@ -1565,22 +1565,22 @@ class _i {
     const s = this._roots[t], i = new Uint32Array(s), o = new Uint16Array(s);
     n(0);
     function n(r, a = 0) {
-      const c = r * 2, E = o[c + 15] === Us;
-      if (E) {
-        const d = i[r + 6], h = o[c + 14];
-        e(a, E, new Float32Array(s, r * 4, 6), d, h);
+      const c = r * 2, h = o[c + 15] === Us;
+      if (h) {
+        const d = i[r + 6], E = o[c + 14];
+        e(a, h, new Float32Array(s, r * 4, 6), d, E);
       } else {
-        const d = r + Cs / 4, h = i[r + 6], u = i[r + 7];
-        e(a, E, new Float32Array(s, r * 4, 6), u) || (n(d, a + 1), n(h, a + 1));
+        const d = r + Cs / 4, E = i[r + 6], u = i[r + 7];
+        e(a, h, new Float32Array(s, r * 4, 6), u) || (n(d, a + 1), n(E, a + 1));
       }
     }
   }
   /* Core Cast Functions */
   raycast(e, t = wi) {
-    const s = this._roots, i = this.geometry, o = [], n = t.isMaterial, r = Array.isArray(t), a = i.groups, c = n ? t.side : t, E = this.indirect ? Xo : bo;
-    for (let d = 0, h = s.length; d < h; d++) {
+    const s = this._roots, i = this.geometry, o = [], n = t.isMaterial, r = Array.isArray(t), a = i.groups, c = n ? t.side : t, h = this.indirect ? Xo : bo;
+    for (let d = 0, E = s.length; d < E; d++) {
       const u = r ? t[a[d].materialIndex].side : c, p = o.length;
-      if (E(this, d, u, e, o), r) {
+      if (h(this, d, u, e, o), r) {
         const A = a[d].materialIndex;
         for (let m = p, C = o.length; m < C; m++)
           o[m].face.materialIndex = A;
@@ -1591,9 +1591,9 @@ class _i {
   raycastFirst(e, t = wi) {
     const s = this._roots, i = this.geometry, o = t.isMaterial, n = Array.isArray(t);
     let r = null;
-    const a = i.groups, c = o ? t.side : t, E = this.indirect ? Qo : Bo;
-    for (let d = 0, h = s.length; d < h; d++) {
-      const u = n ? t[a[d].materialIndex].side : c, p = E(this, d, u, e);
+    const a = i.groups, c = o ? t.side : t, h = this.indirect ? Qo : Bo;
+    for (let d = 0, E = s.length; d < E; d++) {
+      const u = n ? t[a[d].materialIndex].side : c, p = h(this, d, u, e);
       p != null && (r == null || p.distance < r.distance) && (r = p, n && (p.face.materialIndex = a[d].materialIndex));
     }
     return r;
@@ -1615,13 +1615,13 @@ class _i {
     } = e;
     if (n && r) {
       const d = n;
-      n = (h, u, p, A, m) => d(h, u, p, A, m) ? !0 : s(h, u, this, r, p, A, t);
+      n = (E, u, p, A, m) => d(E, u, p, A, m) ? !0 : s(E, u, this, r, p, A, t);
     } else
-      n || (r ? n = (d, h, u, p) => s(d, h, this, r, u, p, t) : n = (d, h, u) => u);
+      n || (r ? n = (d, E, u, p) => s(d, E, this, r, u, p, t) : n = (d, E, u) => u);
     let a = !1, c = 0;
-    const E = this._roots;
-    for (let d = 0, h = E.length; d < h; d++) {
-      const u = E[d];
+    const h = this._roots;
+    for (let d = 0, E = h.length; d < E; d++) {
+      const u = h[d];
       if (a = _o(this, d, o, n, i, c), a)
         break;
       c += u.byteLength;
@@ -1638,18 +1638,18 @@ class _i {
       tt(n, A * 3, r, a);
     } : (p) => {
       tt(n, p * 3, r, a);
-    }, E = It.getPrimitive(), d = e.geometry.index, h = e.geometry.attributes.position, u = e.indirect ? (p) => {
+    }, h = It.getPrimitive(), d = e.geometry.index, E = e.geometry.attributes.position, u = e.indirect ? (p) => {
       const A = e.resolveTriangleIndex(p);
-      tt(E, A * 3, d, h);
+      tt(h, A * 3, d, E);
     } : (p) => {
-      tt(E, p * 3, d, h);
+      tt(h, p * 3, d, E);
     };
     if (o) {
       const p = (A, m, C, R, F, f, T, O) => {
         for (let _ = C, S = C + R; _ < S; _++) {
-          u(_), E.a.applyMatrix4(t), E.b.applyMatrix4(t), E.c.applyMatrix4(t), E.needsUpdate = !0;
+          u(_), h.a.applyMatrix4(t), h.b.applyMatrix4(t), h.c.applyMatrix4(t), h.needsUpdate = !0;
           for (let N = A, P = A + m; N < P; N++)
-            if (c(N), n.needsUpdate = !0, o(n, E, N, _, F, f, T, O))
+            if (c(N), n.needsUpdate = !0, o(n, h, N, _, F, f, T, O))
               return !0;
         }
         return !1;
@@ -2013,11 +2013,11 @@ class dr {
     const s = this.faces;
     let i = -1 / 0, o = 1 / 0;
     for (let n = 0, r = s.length; n < r; n++) {
-      const a = s[n], c = a.distanceToPoint(e.origin), E = a.normal.dot(e.direction);
-      if (c > 0 && E >= 0)
+      const a = s[n], c = a.distanceToPoint(e.origin), h = a.normal.dot(e.direction);
+      if (c > 0 && h >= 0)
         return null;
-      const d = E !== 0 ? -c / E : 0;
-      if (!(d <= 0) && (E > 0 ? o = Math.min(d, o) : i = Math.max(d, i), i > o))
+      const d = h !== 0 ? -c / h : 0;
+      if (!(d <= 0) && (h > 0 ? o = Math.min(d, o) : i = Math.max(d, i), i > o))
         return null;
     }
     return i !== -1 / 0 ? e.at(i, t) : e.at(o, t), t;
@@ -2101,15 +2101,15 @@ class dr {
   computeInitialHull() {
     const e = this.vertices, t = this.computeExtremes(), s = t.min, i = t.max;
     let o = 0, n = 0;
-    for (let h = 0; h < 3; h++) {
-      const u = i[h].point.getComponent(h) - s[h].point.getComponent(h);
-      u > o && (o = u, n = h);
+    for (let E = 0; E < 3; E++) {
+      const u = i[E].point.getComponent(E) - s[E].point.getComponent(E);
+      u > o && (o = u, n = E);
     }
     const r = s[n], a = i[n];
-    let c, E;
+    let c, h;
     o = 0, Ji.set(r.point, a.point);
-    for (let h = 0, u = this.vertices.length; h < u; h++) {
-      const p = e[h];
+    for (let E = 0, u = this.vertices.length; E < u; E++) {
+      const p = e[E];
       if (p !== r && p !== a) {
         Ji.closestPointToPoint(p.point, !0, tn);
         const A = tn.distanceToSquared(p.point);
@@ -2117,42 +2117,42 @@ class dr {
       }
     }
     o = -1, qs.setFromCoplanarPoints(r.point, a.point, c.point);
-    for (let h = 0, u = this.vertices.length; h < u; h++) {
-      const p = e[h];
+    for (let E = 0, u = this.vertices.length; E < u; E++) {
+      const p = e[E];
       if (p !== r && p !== a && p !== c) {
         const A = Math.abs(qs.distanceToPoint(p.point));
-        A > o && (o = A, E = p);
+        A > o && (o = A, h = p);
       }
     }
     const d = [];
-    if (qs.distanceToPoint(E.point) < 0) {
+    if (qs.distanceToPoint(h.point) < 0) {
       d.push(
         Rt.create(r, a, c),
-        Rt.create(E, a, r),
-        Rt.create(E, c, a),
-        Rt.create(E, r, c)
+        Rt.create(h, a, r),
+        Rt.create(h, c, a),
+        Rt.create(h, r, c)
       );
-      for (let h = 0; h < 3; h++) {
-        const u = (h + 1) % 3;
-        d[h + 1].getEdge(2).setTwin(d[0].getEdge(u)), d[h + 1].getEdge(1).setTwin(d[u + 1].getEdge(0));
+      for (let E = 0; E < 3; E++) {
+        const u = (E + 1) % 3;
+        d[E + 1].getEdge(2).setTwin(d[0].getEdge(u)), d[E + 1].getEdge(1).setTwin(d[u + 1].getEdge(0));
       }
     } else {
       d.push(
         Rt.create(r, c, a),
-        Rt.create(E, r, a),
-        Rt.create(E, a, c),
-        Rt.create(E, c, r)
+        Rt.create(h, r, a),
+        Rt.create(h, a, c),
+        Rt.create(h, c, r)
       );
-      for (let h = 0; h < 3; h++) {
-        const u = (h + 1) % 3;
-        d[h + 1].getEdge(2).setTwin(d[0].getEdge((3 - h) % 3)), d[h + 1].getEdge(0).setTwin(d[u + 1].getEdge(1));
+      for (let E = 0; E < 3; E++) {
+        const u = (E + 1) % 3;
+        d[E + 1].getEdge(2).setTwin(d[0].getEdge((3 - E) % 3)), d[E + 1].getEdge(0).setTwin(d[u + 1].getEdge(1));
       }
     }
-    for (let h = 0; h < 4; h++)
-      this.faces.push(d[h]);
-    for (let h = 0, u = e.length; h < u; h++) {
-      const p = e[h];
-      if (p !== r && p !== a && p !== c && p !== E) {
+    for (let E = 0; E < 4; E++)
+      this.faces.push(d[E]);
+    for (let E = 0, u = e.length; E < u; E++) {
+      const p = e[E];
+      if (p !== r && p !== a && p !== c && p !== h) {
         o = this.tolerance;
         let A = null;
         for (let m = 0; m < 4; m++) {
@@ -2348,15 +2348,15 @@ function pr(l, e) {
   let t = 0, s = 1;
   const i = l.elements;
   for (let c = 0; c < 3; c++) {
-    const E = Math.abs(i[Nt(Ii[c], fi[c])]);
-    E > t && (t = E, s = c);
+    const h = Math.abs(i[Nt(Ii[c], fi[c])]);
+    h > t && (t = h, s = c);
   }
   let o = 1, n = 0;
   const r = fi[s], a = Ii[s];
   if (Math.abs(i[Nt(a, r)]) > Number.EPSILON) {
-    const c = i[Nt(a, a)], E = i[Nt(r, r)], d = i[Nt(a, r)], h = (c - E) / 2 / d;
+    const c = i[Nt(a, a)], h = i[Nt(r, r)], d = i[Nt(a, r)], E = (c - h) / 2 / d;
     let u;
-    h < 0 ? u = -1 / (-h + Math.sqrt(1 + h * h)) : u = 1 / (h + Math.sqrt(1 + h * h)), o = 1 / Math.sqrt(1 + u * u), n = u * o;
+    E < 0 ? u = -1 / (-E + Math.sqrt(1 + E * E)) : u = 1 / (E + Math.sqrt(1 + E * E)), o = 1 / Math.sqrt(1 + u * u), n = u * o;
   }
   return e.identity(), e.elements[Nt(r, r)] = o, e.elements[Nt(a, a)] = o, e.elements[Nt(a, r)] = n, e.elements[Nt(r, a)] = -n, e;
 }
@@ -2394,12 +2394,12 @@ function Tr(l) {
       n.push(bs.point.x, bs.point.y, bs.point.z), n.push(vs.point.x, vs.point.y, vs.point.z), n.push(Bs.point.x, Bs.point.y, Bs.point.z);
     }
   }
-  const r = new g.Vector3(), a = new g.Vector3(), c = new g.Vector3(), E = new g.Vector3(), d = new g.Vector3(), h = new g.Vector3(), u = new g.Vector3(), p = new g.Vector3();
+  const r = new g.Vector3(), a = new g.Vector3(), c = new g.Vector3(), h = new g.Vector3(), d = new g.Vector3(), E = new g.Vector3(), u = new g.Vector3(), p = new g.Vector3();
   let A = 0, m = 0, C = 0, R = 0, F = 0, f = 0, T = 0;
   for (let it = 0, Xt = n.length; it < Xt; it += 9) {
-    r.fromArray(n, it), a.fromArray(n, it + 3), c.fromArray(n, it + 6), u.set(0, 0, 0), u.add(r).add(a).add(c).divideScalar(3), E.subVectors(a, r), d.subVectors(c, r);
-    const J = h.crossVectors(E, d).length() / 2;
-    p.add(h.copy(u).multiplyScalar(J)), A += J, m += (9 * u.x * u.x + r.x * r.x + a.x * a.x + c.x * c.x) * (J / 12), C += (9 * u.x * u.y + r.x * r.y + a.x * a.y + c.x * c.y) * (J / 12), R += (9 * u.x * u.z + r.x * r.z + a.x * a.z + c.x * c.z) * (J / 12), F += (9 * u.y * u.y + r.y * r.y + a.y * a.y + c.y * c.y) * (J / 12), f += (9 * u.y * u.z + r.y * r.z + a.y * a.z + c.y * c.z) * (J / 12), T += (9 * u.z * u.z + r.z * r.z + a.z * a.z + c.z * c.z) * (J / 12);
+    r.fromArray(n, it), a.fromArray(n, it + 3), c.fromArray(n, it + 6), u.set(0, 0, 0), u.add(r).add(a).add(c).divideScalar(3), h.subVectors(a, r), d.subVectors(c, r);
+    const J = E.crossVectors(h, d).length() / 2;
+    p.add(E.copy(u).multiplyScalar(J)), A += J, m += (9 * u.x * u.x + r.x * r.x + a.x * a.x + c.x * c.x) * (J / 12), C += (9 * u.x * u.y + r.x * r.y + a.x * a.y + c.x * c.y) * (J / 12), R += (9 * u.x * u.z + r.x * r.z + a.x * a.z + c.x * c.z) * (J / 12), F += (9 * u.y * u.y + r.y * r.y + a.y * a.y + c.y * c.y) * (J / 12), f += (9 * u.y * u.z + r.y * r.z + a.y * a.z + c.y * c.z) * (J / 12), T += (9 * u.z * u.z + r.z * r.z + a.z * a.z + c.z * c.z) * (J / 12);
   }
   p.divideScalar(A), m /= A, C /= A, R /= A, F /= A, f /= A, T /= A, m -= p.x * p.x, C -= p.x * p.y, R -= p.x * p.z, F -= p.y * p.y, f -= p.y * p.z, T -= p.z * p.z;
   const O = new g.Matrix3();
@@ -2964,7 +2964,7 @@ const Fs = class Fs {
 /**
  * The version of the @thatopen/components library.
  */
-I(Fs, "release", "2.0.20");
+I(Fs, "release", "2.0.21");
 let pi = Fs;
 class Rr {
   constructor(e) {
@@ -3427,25 +3427,25 @@ function hs(l, e, t, s, i = 1 / 0, o) {
   s = Math.max(1e-4, s);
   const n = 2 / s, r = n * o, a = 1 / (1 + r + 0.48 * r * r + 0.235 * r * r * r);
   let c = l - e;
-  const E = e, d = i * s;
+  const h = e, d = i * s;
   c = mt(c, -d, d), e = l - c;
-  const h = (t.value + n * c) * o;
-  t.value = (t.value - n * h) * a;
-  let u = e + (c + h) * a;
-  return E - l > 0 == u > E && (u = E, t.value = (u - E) / o), u;
+  const E = (t.value + n * c) * o;
+  t.value = (t.value - n * E) * a;
+  let u = e + (c + E) * a;
+  return h - l > 0 == u > h && (u = h, t.value = (u - h) / o), u;
 }
 function rn(l, e, t, s, i = 1 / 0, o, n) {
   s = Math.max(1e-4, s);
   const r = 2 / s, a = r * o, c = 1 / (1 + a + 0.48 * a * a + 0.235 * a * a * a);
-  let E = e.x, d = e.y, h = e.z, u = l.x - E, p = l.y - d, A = l.z - h;
-  const m = E, C = d, R = h, F = i * s, f = F * F, T = u * u + p * p + A * A;
+  let h = e.x, d = e.y, E = e.z, u = l.x - h, p = l.y - d, A = l.z - E;
+  const m = h, C = d, R = E, F = i * s, f = F * F, T = u * u + p * p + A * A;
   if (T > f) {
     const B = Math.sqrt(T);
     u = u / B * F, p = p / B * F, A = A / B * F;
   }
-  E = l.x - u, d = l.y - p, h = l.z - A;
+  h = l.x - u, d = l.y - p, E = l.z - A;
   const O = (t.x + r * u) * o, _ = (t.y + r * p) * o, S = (t.z + r * A) * o;
-  t.x = (t.x - r * O) * c, t.y = (t.y - r * _) * c, t.z = (t.z - r * S) * c, n.x = E + (u + O) * c, n.y = d + (p + _) * c, n.z = h + (A + S) * c;
+  t.x = (t.x - r * O) * c, t.y = (t.y - r * _) * c, t.z = (t.z - r * S) * c, n.x = h + (u + O) * c, n.y = d + (p + _) * c, n.z = E + (A + S) * c;
   const N = m - l.x, P = C - l.y, w = R - l.z, y = n.x - m, U = n.y - C, x = n.z - R;
   return N * y + P * U + w * x > 0 && (n.x = m, n.y = C, n.z = R, t.x = (n.x - m) / o, t.y = (n.y - C) / o, t.z = (n.z - R) / o), n;
 }
@@ -3651,7 +3651,7 @@ class ot extends Or {
         deltaY: 0,
         mouseButton: T
       };
-      this._activePointers.push(O), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", E), this._domElement.ownerDocument.addEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.addEventListener("pointerup", E), this._isDragging = !0, A(f);
+      this._activePointers.push(O), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.addEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.addEventListener("pointerup", h), this._isDragging = !0, A(f);
     }, r = (f) => {
       if (!this._enabled || !this._domElement || this._lockedPointer)
         return;
@@ -3697,7 +3697,7 @@ class ot extends Or {
     }, c = (f) => {
       const T = this._lockedPointer || this._findPointerById(1);
       T && (T.clientX = f.clientX, T.clientY = f.clientY, T.deltaX = f.movementX, T.deltaY = f.movementY, this._state = 0, (this._lockedPointer || (f.buttons & V.LEFT) === V.LEFT) && (this._state = this._state | this.mouseButtons.left), (f.buttons & V.MIDDLE) === V.MIDDLE && (this._state = this._state | this.mouseButtons.middle), (f.buttons & V.RIGHT) === V.RIGHT && (this._state = this._state | this.mouseButtons.right), m());
-    }, E = (f) => {
+    }, h = (f) => {
       const T = this._findPointerById(f.pointerId);
       if (!(T && T === this._lockedPointer)) {
         if (T && this._disposePointer(T), f.pointerType === "touch")
@@ -3723,7 +3723,7 @@ class ot extends Or {
       const f = this._findPointerById(1);
       f && f === this._lockedPointer || (f && this._disposePointer(f), this._state = L.NONE, C());
     };
-    let h = -1;
+    let E = -1;
     const u = (f) => {
       if (!this._domElement || !this._enabled || this.mouseButtons.wheel === L.NONE)
         return;
@@ -3734,7 +3734,7 @@ class ot extends Or {
       }
       if (f.preventDefault(), this.dollyToCursor || this.mouseButtons.wheel === L.ROTATE || this.mouseButtons.wheel === L.TRUCK) {
         const N = performance.now();
-        h - N < 1e3 && this._getClientRect(this._elementRect), h = N;
+        E - N < 1e3 && this._getClientRect(this._elementRect), E = N;
       }
       const T = _r ? -1 : -3, O = f.deltaMode === 1 ? f.deltaY / T : f.deltaY / (T * 10), _ = this.dollyToCursor ? (f.clientX - this._elementRect.x) / this._elementRect.width * 2 - 1 : 0, S = this.dollyToCursor ? (f.clientY - this._elementRect.y) / this._elementRect.height * -2 + 1 : 0;
       switch (this.mouseButtons.wheel) {
@@ -3764,7 +3764,7 @@ class ot extends Or {
       if (!(!this._domElement || !this._enabled)) {
         if (this.mouseButtons.right === ot.ACTION.NONE) {
           const T = f instanceof PointerEvent ? f.pointerId : (f instanceof MouseEvent, 0), O = this._findPointerById(T);
-          O && this._disposePointer(O), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", E), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("mouseup", d);
+          O && this._disposePointer(O), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("mouseup", d);
           return;
         }
         f.preventDefault();
@@ -3812,7 +3812,7 @@ class ot extends Or {
       }
       ((this._state & L.TRUCK) === L.TRUCK || (this._state & L.TOUCH_TRUCK) === L.TOUCH_TRUCK || (this._state & L.TOUCH_DOLLY_TRUCK) === L.TOUCH_DOLLY_TRUCK || (this._state & L.TOUCH_ZOOM_TRUCK) === L.TOUCH_ZOOM_TRUCK) && (this._truckInternal(O, _, !1), this._isUserControllingTruck = !0), ((this._state & L.OFFSET) === L.OFFSET || (this._state & L.TOUCH_OFFSET) === L.TOUCH_OFFSET || (this._state & L.TOUCH_DOLLY_OFFSET) === L.TOUCH_DOLLY_OFFSET || (this._state & L.TOUCH_ZOOM_OFFSET) === L.TOUCH_ZOOM_OFFSET) && (this._truckInternal(O, _, !0), this._isUserControllingOffset = !0), this.dispatchEvent({ type: "control" });
     }, C = () => {
-      $s(this._activePointers, lt), i.copy(lt), this._dragNeedsUpdate = !1, (this._activePointers.length === 0 || this._activePointers.length === 1 && this._activePointers[0] === this._lockedPointer) && (this._isDragging = !1), this._activePointers.length === 0 && this._domElement && (this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("pointerup", E), this._domElement.ownerDocument.removeEventListener("mouseup", d), this.dispatchEvent({ type: "controlend" }));
+      $s(this._activePointers, lt), i.copy(lt), this._dragNeedsUpdate = !1, (this._activePointers.length === 0 || this._activePointers.length === 1 && this._activePointers[0] === this._lockedPointer) && (this._isDragging = !1), this._activePointers.length === 0 && this._domElement && (this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.removeEventListener("mouseup", d), this.dispatchEvent({ type: "controlend" }));
     };
     this.lockPointer = () => {
       !this._enabled || !this._domElement || (this.cancel(), this._lockedPointer = {
@@ -3822,7 +3822,7 @@ class ot extends Or {
         deltaX: 0,
         deltaY: 0,
         mouseButton: null
-      }, this._activePointers.push(this._lockedPointer), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", E), this._domElement.requestPointerLock(), this._domElement.ownerDocument.addEventListener("pointerlockchange", R), this._domElement.ownerDocument.addEventListener("pointerlockerror", F), this._domElement.ownerDocument.addEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.addEventListener("pointerup", E), A());
+      }, this._activePointers.push(this._lockedPointer), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.requestPointerLock(), this._domElement.ownerDocument.addEventListener("pointerlockchange", R), this._domElement.ownerDocument.addEventListener("pointerlockerror", F), this._domElement.ownerDocument.addEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.addEventListener("pointerup", h), A());
     }, this.unlockPointer = () => {
       this._lockedPointer !== null && (this._disposePointer(this._lockedPointer), this._lockedPointer = null), document.exitPointerLock(), this.cancel(), this._domElement && (this._domElement.ownerDocument.removeEventListener("pointerlockchange", R), this._domElement.ownerDocument.removeEventListener("pointerlockerror", F));
     };
@@ -3832,9 +3832,9 @@ class ot extends Or {
       this.unlockPointer();
     };
     this._addAllEventListeners = (f) => {
-      this._domElement = f, this._domElement.style.touchAction = "none", this._domElement.style.userSelect = "none", this._domElement.style.webkitUserSelect = "none", this._domElement.addEventListener("pointerdown", n), Sr && this._domElement.addEventListener("mousedown", r), this._domElement.addEventListener("pointercancel", E), this._domElement.addEventListener("wheel", u, { passive: !1 }), this._domElement.addEventListener("contextmenu", p);
+      this._domElement = f, this._domElement.style.touchAction = "none", this._domElement.style.userSelect = "none", this._domElement.style.webkitUserSelect = "none", this._domElement.addEventListener("pointerdown", n), Sr && this._domElement.addEventListener("mousedown", r), this._domElement.addEventListener("pointercancel", h), this._domElement.addEventListener("wheel", u, { passive: !1 }), this._domElement.addEventListener("contextmenu", p);
     }, this._removeAllEventListeners = () => {
-      this._domElement && (this._domElement.style.touchAction = "", this._domElement.style.userSelect = "", this._domElement.style.webkitUserSelect = "", this._domElement.removeEventListener("pointerdown", n), this._domElement.removeEventListener("mousedown", r), this._domElement.removeEventListener("pointercancel", E), this._domElement.removeEventListener("wheel", u, { passive: !1 }), this._domElement.removeEventListener("contextmenu", p), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("pointerup", E), this._domElement.ownerDocument.removeEventListener("mouseup", d), this._domElement.ownerDocument.removeEventListener("pointerlockchange", R), this._domElement.ownerDocument.removeEventListener("pointerlockerror", F));
+      this._domElement && (this._domElement.style.touchAction = "", this._domElement.style.userSelect = "", this._domElement.style.webkitUserSelect = "", this._domElement.removeEventListener("pointerdown", n), this._domElement.removeEventListener("mousedown", r), this._domElement.removeEventListener("pointercancel", h), this._domElement.removeEventListener("wheel", u, { passive: !1 }), this._domElement.removeEventListener("contextmenu", p), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.removeEventListener("mouseup", d), this._domElement.ownerDocument.removeEventListener("pointerlockchange", R), this._domElement.ownerDocument.removeEventListener("pointerlockerror", F));
     }, this.cancel = () => {
       this._state !== L.NONE && (this._state = L.NONE, this._activePointers.length = 0, C());
     }, t && this.connect(t), this.update(0);
@@ -4201,12 +4201,12 @@ class ot extends Or {
   fitToBox(e, t, { cover: s = !1, paddingLeft: i = 0, paddingRight: o = 0, paddingBottom: n = 0, paddingTop: r = 0 } = {}) {
     const a = [], c = e.isBox3 ? de.copy(e) : de.setFromObject(e);
     c.isEmpty() && (console.warn("camera-controls: fitTo() cannot be used with an empty box. Aborting"), Promise.resolve());
-    const E = on(this._sphericalEnd.theta, nn), d = on(this._sphericalEnd.phi, nn);
-    a.push(this.rotateTo(E, d, t));
-    const h = G.setFromSpherical(this._sphericalEnd).normalize(), u = En.setFromUnitVectors(h, ti), p = k(Math.abs(h.y), 1);
-    p && u.multiply(si.setFromAxisAngle(ds, E)), u.multiply(this._yAxisUpSpaceInverse);
+    const h = on(this._sphericalEnd.theta, nn), d = on(this._sphericalEnd.phi, nn);
+    a.push(this.rotateTo(h, d, t));
+    const E = G.setFromSpherical(this._sphericalEnd).normalize(), u = En.setFromUnitVectors(E, ti), p = k(Math.abs(E.y), 1);
+    p && u.multiply(si.setFromAxisAngle(ds, h)), u.multiply(this._yAxisUpSpaceInverse);
     const A = hn.makeEmpty();
-    z.copy(c.min).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setX(c.max.x).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setY(c.max.y).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setZ(c.min.z).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setZ(c.max.z).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setY(c.min.y).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setX(c.min.x).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).applyQuaternion(u), A.expandByPoint(z), A.min.x -= i, A.min.y -= n, A.max.x += o, A.max.y += r, u.setFromUnitVectors(ti, h), p && u.premultiply(si.invert()), u.premultiply(this._yAxisUpSpace);
+    z.copy(c.min).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setX(c.max.x).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setY(c.max.y).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setZ(c.min.z).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setZ(c.max.z).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setY(c.min.y).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setX(c.min.x).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).applyQuaternion(u), A.expandByPoint(z), A.min.x -= i, A.min.y -= n, A.max.x += o, A.max.y += r, u.setFromUnitVectors(ti, E), p && u.premultiply(si.invert()), u.premultiply(this._yAxisUpSpace);
     const m = A.getSize(G), C = A.getCenter(z).applyQuaternion(u);
     if (Zt(this._camera)) {
       const R = this.getDistanceToFitBox(m.x, m.y, m.z, s);
@@ -4249,8 +4249,8 @@ class ot extends Or {
     this._isUserControllingRotate = !1, this._isUserControllingDolly = !1, this._isUserControllingTruck = !1, this._lastDollyDirection = le.NONE, this._changedDolly = 0;
     const a = z.set(i, o, n), c = G.set(e, t, s);
     this._targetEnd.copy(a), this._sphericalEnd.setFromVector3(c.sub(a).applyQuaternion(this._yAxisUpSpace)), this.normalizeRotations(), this._needsUpdate = !0, r || (this._target.copy(this._targetEnd), this._spherical.copy(this._sphericalEnd));
-    const E = !r || k(this._target.x, this._targetEnd.x, this.restThreshold) && k(this._target.y, this._targetEnd.y, this.restThreshold) && k(this._target.z, this._targetEnd.z, this.restThreshold) && k(this._spherical.theta, this._sphericalEnd.theta, this.restThreshold) && k(this._spherical.phi, this._sphericalEnd.phi, this.restThreshold) && k(this._spherical.radius, this._sphericalEnd.radius, this.restThreshold);
-    return this._createOnRestPromise(E);
+    const h = !r || k(this._target.x, this._targetEnd.x, this.restThreshold) && k(this._target.y, this._targetEnd.y, this.restThreshold) && k(this._target.z, this._targetEnd.z, this.restThreshold) && k(this._spherical.theta, this._sphericalEnd.theta, this.restThreshold) && k(this._spherical.phi, this._sphericalEnd.phi, this.restThreshold) && k(this._spherical.radius, this._sphericalEnd.radius, this.restThreshold);
+    return this._createOnRestPromise(h);
   }
   /**
    * Similar to setLookAt, but it interpolates between two states.
@@ -4270,11 +4270,11 @@ class ot extends Or {
    * @param enableTransition
    * @category Methods
    */
-  lerpLookAt(e, t, s, i, o, n, r, a, c, E, d, h, u, p = !1) {
+  lerpLookAt(e, t, s, i, o, n, r, a, c, h, d, E, u, p = !1) {
     this._isUserControllingRotate = !1, this._isUserControllingDolly = !1, this._isUserControllingTruck = !1, this._lastDollyDirection = le.NONE, this._changedDolly = 0;
     const A = G.set(i, o, n), m = z.set(e, t, s);
     dt.setFromVector3(m.sub(A).applyQuaternion(this._yAxisUpSpace));
-    const C = Ee.set(E, d, h), R = z.set(r, a, c);
+    const C = Ee.set(h, d, E), R = z.set(r, a, c);
     ye.setFromVector3(R.sub(C).applyQuaternion(this._yAxisUpSpace)), this._targetEnd.copy(A.lerp(C, u));
     const F = ye.theta - dt.theta, f = ye.phi - dt.phi, T = ye.radius - dt.radius;
     this._sphericalEnd.set(dt.radius + T * u, dt.phi + f * u, dt.theta + F * u), this.normalizeRotations(), this._needsUpdate = !0, p || (this._target.copy(this._targetEnd), this._spherical.copy(this._sphericalEnd));
@@ -4520,9 +4520,9 @@ class ot extends Or {
     }
     if (this.dollyToCursor) {
       if (Zt(this._camera) && this._changedDolly !== 0) {
-        const d = this._spherical.radius - this._lastDistance, h = this._camera, u = this._getCameraDirection(Pe), p = G.copy(u).cross(h.up).normalize();
+        const d = this._spherical.radius - this._lastDistance, E = this._camera, u = this._getCameraDirection(Pe), p = G.copy(u).cross(E.up).normalize();
         p.lengthSq() === 0 && (p.x = 1);
-        const A = z.crossVectors(p, u), m = this._sphericalEnd.radius * Math.tan(h.getEffectiveFOV() * Se * 0.5), R = (this._sphericalEnd.radius - d - this._sphericalEnd.radius) / this._sphericalEnd.radius, F = Ee.copy(this._targetEnd).add(p.multiplyScalar(this._dollyControlCoord.x * m * h.aspect)).add(A.multiplyScalar(this._dollyControlCoord.y * m)), f = G.copy(this._targetEnd).lerp(F, R), T = this._lastDollyDirection === le.IN && this._spherical.radius <= this.minDistance, O = this._lastDollyDirection === le.OUT && this.maxDistance <= this._spherical.radius;
+        const A = z.crossVectors(p, u), m = this._sphericalEnd.radius * Math.tan(E.getEffectiveFOV() * Se * 0.5), R = (this._sphericalEnd.radius - d - this._sphericalEnd.radius) / this._sphericalEnd.radius, F = Ee.copy(this._targetEnd).add(p.multiplyScalar(this._dollyControlCoord.x * m * E.aspect)).add(A.multiplyScalar(this._dollyControlCoord.y * m)), f = G.copy(this._targetEnd).lerp(F, R), T = this._lastDollyDirection === le.IN && this._spherical.radius <= this.minDistance, O = this._lastDollyDirection === le.OUT && this.maxDistance <= this._spherical.radius;
         if (this.infinityDolly && (T || O)) {
           this._sphericalEnd.radius -= d, this._spherical.radius -= d;
           const S = z.copy(u).multiplyScalar(-d);
@@ -4532,7 +4532,7 @@ class ot extends Or {
         const _ = z.subVectors(f, this._targetEnd);
         this._targetEnd.copy(f), this._target.add(_), this._changedDolly -= d, X(this._changedDolly) && (this._changedDolly = 0);
       } else if (bt(this._camera) && this._changedZoom !== 0) {
-        const d = this._zoom - this._lastZoom, h = this._camera, u = G.set(this._dollyControlCoord.x, this._dollyControlCoord.y, (h.near + h.far) / (h.near - h.far)).unproject(h), p = z.set(0, 0, -1).applyQuaternion(h.quaternion), A = Ee.copy(u).add(p.multiplyScalar(-u.dot(h.up))), C = -(this._zoom - d - this._zoom) / this._zoom, R = this._getCameraDirection(Pe), F = this._targetEnd.dot(R), f = G.copy(this._targetEnd).lerp(A, C), T = f.dot(R), O = R.multiplyScalar(T - F);
+        const d = this._zoom - this._lastZoom, E = this._camera, u = G.set(this._dollyControlCoord.x, this._dollyControlCoord.y, (E.near + E.far) / (E.near - E.far)).unproject(E), p = z.set(0, 0, -1).applyQuaternion(E.quaternion), A = Ee.copy(u).add(p.multiplyScalar(-u.dot(E.up))), C = -(this._zoom - d - this._zoom) / this._zoom, R = this._getCameraDirection(Pe), F = this._targetEnd.dot(R), f = G.copy(this._targetEnd).lerp(A, C), T = f.dot(R), O = R.multiplyScalar(T - F);
         f.sub(O), this._boundary.clampPoint(f, f);
         const _ = z.subVectors(f, this._targetEnd);
         this._targetEnd.copy(f), this._target.add(_), this._changedZoom -= d, X(this._changedZoom) && (this._changedZoom = 0);
@@ -4541,8 +4541,8 @@ class ot extends Or {
     this._camera.zoom !== this._zoom && (this._camera.zoom = this._zoom, this._camera.updateProjectionMatrix(), this._updateNearPlaneCorners(), this._needsUpdate = !0), this._dragNeedsUpdate = !0;
     const a = this._collisionTest();
     this._spherical.radius = Math.min(this._spherical.radius, a), this._spherical.makeSafe(), this._camera.position.setFromSpherical(this._spherical).applyQuaternion(this._yAxisUpSpaceInverse).add(this._target), this._camera.lookAt(this._target), (!X(this._focalOffset.x) || !X(this._focalOffset.y) || !X(this._focalOffset.z)) && (this._camera.updateMatrixWorld(), gt.setFromMatrixColumn(this._camera.matrix, 0), _t.setFromMatrixColumn(this._camera.matrix, 1), Qt.setFromMatrixColumn(this._camera.matrix, 2), gt.multiplyScalar(this._focalOffset.x), _t.multiplyScalar(-this._focalOffset.y), Qt.multiplyScalar(this._focalOffset.z), G.copy(gt).add(_t).add(Qt), this._camera.position.add(G)), this._boundaryEnclosesCamera && this._encloseToBoundary(this._camera.position.copy(this._target), G.setFromSpherical(this._spherical).applyQuaternion(this._yAxisUpSpaceInverse), 1);
-    const E = this._needsUpdate;
-    return E && !this._updatedLastTime ? (this._hasRested = !1, this.dispatchEvent({ type: "wake" }), this.dispatchEvent({ type: "update" })) : E ? (this.dispatchEvent({ type: "update" }), X(t, this.restThreshold) && X(s, this.restThreshold) && X(i, this.restThreshold) && X(o.x, this.restThreshold) && X(o.y, this.restThreshold) && X(o.z, this.restThreshold) && X(n.x, this.restThreshold) && X(n.y, this.restThreshold) && X(n.z, this.restThreshold) && X(r, this.restThreshold) && !this._hasRested && (this._hasRested = !0, this.dispatchEvent({ type: "rest" }))) : !E && this._updatedLastTime && this.dispatchEvent({ type: "sleep" }), this._lastDistance = this._spherical.radius, this._lastZoom = this._zoom, this._updatedLastTime = E, this._needsUpdate = !1, E;
+    const h = this._needsUpdate;
+    return h && !this._updatedLastTime ? (this._hasRested = !1, this.dispatchEvent({ type: "wake" }), this.dispatchEvent({ type: "update" })) : h ? (this.dispatchEvent({ type: "update" }), X(t, this.restThreshold) && X(s, this.restThreshold) && X(i, this.restThreshold) && X(o.x, this.restThreshold) && X(o.y, this.restThreshold) && X(o.z, this.restThreshold) && X(n.x, this.restThreshold) && X(n.y, this.restThreshold) && X(n.z, this.restThreshold) && X(r, this.restThreshold) && !this._hasRested && (this._hasRested = !0, this.dispatchEvent({ type: "rest" }))) : !h && this._updatedLastTime && this.dispatchEvent({ type: "sleep" }), this._lastDistance = this._spherical.radius, this._lastZoom = this._zoom, this._updatedLastTime = h, this._needsUpdate = !1, h;
   }
   /**
    * Get all state in JSON string
@@ -4733,9 +4733,9 @@ class ot extends Or {
         return;
       const r = n, a = r.geometry.clone();
       a.applyMatrix4(r.matrixWorld);
-      const E = a.attributes.position;
-      for (let d = 0, h = E.count; d < h; d++)
-        G.fromBufferAttribute(E, d), o = Math.max(o, i.distanceToSquared(G));
+      const h = a.attributes.position;
+      for (let d = 0, E = h.count; d < E; d++)
+        G.fromBufferAttribute(h, d), o = Math.max(o, i.distanceToSquared(G));
     }), s.radius = Math.sqrt(o), s;
   }
 }
@@ -5183,8 +5183,8 @@ class Lr extends ri {
       }), o[R] = F, i[R] = F, s[R] = F;
     }
     n("camera", e), n("object", void 0), n("enabled", !0), n("axis", null), n("mode", "translate"), n("translationSnap", null), n("rotationSnap", null), n("scaleSnap", null), n("space", "world"), n("size", 1), n("dragging", !1), n("showX", !0), n("showY", !0), n("showZ", !0);
-    const r = new M(), a = new M(), c = new Lt(), E = new Lt(), d = new M(), h = new Lt(), u = new M(), p = new M(), A = new M(), m = 0, C = new M();
-    n("worldPosition", r), n("worldPositionStart", a), n("worldQuaternion", c), n("worldQuaternionStart", E), n("cameraPosition", d), n("cameraQuaternion", h), n("pointStart", u), n("pointEnd", p), n("rotationAxis", A), n("rotationAngle", m), n("eye", C), this._offset = new M(), this._startNorm = new M(), this._endNorm = new M(), this._cameraScale = new M(), this._parentPosition = new M(), this._parentQuaternion = new Lt(), this._parentQuaternionInv = new Lt(), this._parentScale = new M(), this._worldScaleStart = new M(), this._worldQuaternionInv = new Lt(), this._worldScale = new M(), this._positionStart = new M(), this._quaternionStart = new Lt(), this._scaleStart = new M(), this._getPointer = Pr.bind(this), this._onPointerDown = Mr.bind(this), this._onPointerHover = yr.bind(this), this._onPointerMove = wr.bind(this), this._onPointerUp = Dr.bind(this), this.domElement.addEventListener("pointerdown", this._onPointerDown), this.domElement.addEventListener("pointermove", this._onPointerHover), this.domElement.addEventListener("pointerup", this._onPointerUp);
+    const r = new M(), a = new M(), c = new Lt(), h = new Lt(), d = new M(), E = new Lt(), u = new M(), p = new M(), A = new M(), m = 0, C = new M();
+    n("worldPosition", r), n("worldPositionStart", a), n("worldQuaternion", c), n("worldQuaternionStart", h), n("cameraPosition", d), n("cameraQuaternion", E), n("pointStart", u), n("pointEnd", p), n("rotationAxis", A), n("rotationAngle", m), n("eye", C), this._offset = new M(), this._startNorm = new M(), this._endNorm = new M(), this._cameraScale = new M(), this._parentPosition = new M(), this._parentQuaternion = new Lt(), this._parentQuaternionInv = new Lt(), this._parentScale = new M(), this._worldScaleStart = new M(), this._worldQuaternionInv = new Lt(), this._worldScale = new M(), this._positionStart = new M(), this._quaternionStart = new Lt(), this._scaleStart = new M(), this._getPointer = Pr.bind(this), this._onPointerDown = Mr.bind(this), this._onPointerHover = yr.bind(this), this._onPointerMove = wr.bind(this), this._onPointerUp = Dr.bind(this), this.domElement.addEventListener("pointerdown", this._onPointerDown), this.domElement.addEventListener("pointermove", this._onPointerHover), this.domElement.addEventListener("pointerup", this._onPointerUp);
   }
   // updateMatrixWorld  updates key transformation variables
   updateMatrixWorld() {
@@ -5346,12 +5346,12 @@ class Ur extends ri {
     a.color.setHex(16711680), a.opacity = 0.5;
     const c = e.clone();
     c.color.setHex(65280), c.opacity = 0.5;
-    const E = e.clone();
-    E.color.setHex(255), E.opacity = 0.5;
+    const h = e.clone();
+    h.color.setHex(255), h.opacity = 0.5;
     const d = e.clone();
     d.opacity = 0.25;
-    const h = e.clone();
-    h.color.setHex(16776960), h.opacity = 0.25, e.clone().color.setHex(16776960);
+    const E = e.clone();
+    E.color.setHex(16776960), E.opacity = 0.25, e.clone().color.setHex(16776960);
     const p = e.clone();
     p.color.setHex(7895160);
     const A = new ct(0, 0.04, 0.1, 12);
@@ -5390,7 +5390,7 @@ class Ur extends ri {
         [new v(new Ze(0.1, 0), d.clone()), [0, 0, 0]]
       ],
       XY: [
-        [new v(new rt(0.15, 0.15, 0.01), E.clone()), [0.15, 0.15, 0]]
+        [new v(new rt(0.15, 0.15, 0.01), h.clone()), [0.15, 0.15, 0]]
       ],
       YZ: [
         [new v(new rt(0.15, 0.15, 0.01), a.clone()), [0, 0.15, 0.15], [0, Math.PI / 2, 0]]
@@ -5456,7 +5456,7 @@ class Ur extends ri {
         [new v(F(0.5, 0.5), r), null, [0, Math.PI / 2, 0]]
       ],
       E: [
-        [new v(F(0.75, 1), h), null, [0, Math.PI / 2, 0]]
+        [new v(F(0.75, 1), E), null, [0, Math.PI / 2, 0]]
       ]
     }, N = {
       AXIS: [
@@ -5495,7 +5495,7 @@ class Ur extends ri {
         [new v(m, r), [0, 0, -0.5], [-Math.PI / 2, 0, 0]]
       ],
       XY: [
-        [new v(new rt(0.15, 0.15, 0.01), E), [0.15, 0.15, 0]]
+        [new v(new rt(0.15, 0.15, 0.01), h), [0.15, 0.15, 0]]
       ],
       YZ: [
         [new v(new rt(0.15, 0.15, 0.01), a), [0, 0.15, 0.15], [0, Math.PI / 2, 0]]
@@ -6250,22 +6250,22 @@ class Vr extends Yr {
     let a;
     if (Array.isArray(o)) {
       let d = !0;
-      const h = [];
+      const E = [];
       for (const u of o)
-        sn.isTransparent(u) ? h.push(this._transparentMat) : (d = !1, h.push(n));
+        sn.isTransparent(u) ? E.push(this._transparentMat) : (d = !1, E.push(n));
       if (d) {
         n.dispose(), this.isProcessing = !1;
         return;
       }
-      a = h;
+      a = E;
     } else if (sn.isTransparent(o)) {
       n.dispose(), this.isProcessing = !1;
       return;
     } else
       a = n;
     this._colorCodeMeshMap.set(r, t), this._meshIDColorCodeMap.set(t.uuid, r);
-    const c = s ? t.count : 1, E = new g.InstancedMesh(i, a, c);
-    s ? E.instanceMatrix = t.instanceMatrix : E.setMatrixAt(0, new g.Matrix4()), t.visible = !1, t.updateWorldMatrix(!0, !1), E.applyMatrix4(t.matrixWorld), E.updateMatrix(), this.scene.add(E), this.colorMeshes.set(t.uuid, E), this.increaseColor(), this.isProcessing = !1;
+    const c = s ? t.count : 1, h = new g.InstancedMesh(i, a, c);
+    s ? h.instanceMatrix = t.instanceMatrix : h.setMatrixAt(0, new g.Matrix4()), t.visible = !1, t.updateWorldMatrix(!0, !1), h.applyMatrix4(t.matrixWorld), h.updateMatrix(), this.scene.add(h), this.colorMeshes.set(t.uuid, h), this.increaseColor(), this.isProcessing = !1;
   }
   /**
    * Removes a mesh from the culler, so its visibility is not controlled by the culler anymore.
@@ -6791,10 +6791,10 @@ class na extends He {
     }
     const a = new g.Box3(n, r), c = new g.Vector3();
     a.getSize(c);
-    const E = new g.Vector3();
-    a.getCenter(E);
-    const d = Math.max(c.x, c.y, c.z) * s, h = new g.Sphere(E, d);
-    await this.controls.fitToSphere(h, !0);
+    const h = new g.Vector3();
+    a.getCenter(h);
+    const d = Math.max(c.x, c.y, c.z) * s, E = new g.Sphere(h, d);
+    await this.controls.fitToSphere(E, !0);
   }
   /**
    * Allows or prevents all user input.
@@ -7042,16 +7042,16 @@ const At = class At extends et {
     const o = t.matrixWorld, n = new g.Matrix4(), r = t instanceof g.InstancedMesh, a = /* @__PURE__ */ new Set();
     if (s && t instanceof Vt.FragmentMesh)
       for (const c of s) {
-        const E = t.fragment.getInstancesIDs(c);
-        if (E)
-          for (const d of E)
+        const h = t.fragment.getInstancesIDs(c);
+        if (h)
+          for (const d of h)
             a.add(d);
       }
     else
       a.add(0);
     for (const c of a) {
-      const E = i.min.clone(), d = i.max.clone();
-      r && (t.getMatrixAt(c, n), E.applyMatrix4(n), d.applyMatrix4(n)), E.applyMatrix4(o), d.applyMatrix4(o), E.x < this._absoluteMin.x && (this._absoluteMin.x = E.x), E.y < this._absoluteMin.y && (this._absoluteMin.y = E.y), E.z < this._absoluteMin.z && (this._absoluteMin.z = E.z), E.x > this._absoluteMax.x && (this._absoluteMax.x = E.x), E.y > this._absoluteMax.y && (this._absoluteMax.y = E.y), E.z > this._absoluteMax.z && (this._absoluteMax.z = E.z), d.x > this._absoluteMax.x && (this._absoluteMax.x = d.x), d.y > this._absoluteMax.y && (this._absoluteMax.y = d.y), d.z > this._absoluteMax.z && (this._absoluteMax.z = d.z), d.x < this._absoluteMin.x && (this._absoluteMin.x = d.x), d.y < this._absoluteMin.y && (this._absoluteMin.y = d.y), d.z < this._absoluteMin.z && (this._absoluteMin.z = d.z);
+      const h = i.min.clone(), d = i.max.clone();
+      r && (t.getMatrixAt(c, n), h.applyMatrix4(n), d.applyMatrix4(n)), h.applyMatrix4(o), d.applyMatrix4(o), h.x < this._absoluteMin.x && (this._absoluteMin.x = h.x), h.y < this._absoluteMin.y && (this._absoluteMin.y = h.y), h.z < this._absoluteMin.z && (this._absoluteMin.z = h.z), h.x > this._absoluteMax.x && (this._absoluteMax.x = h.x), h.y > this._absoluteMax.y && (this._absoluteMax.y = h.y), h.z > this._absoluteMax.z && (this._absoluteMax.z = h.z), d.x > this._absoluteMax.x && (this._absoluteMax.x = d.x), d.y > this._absoluteMax.y && (this._absoluteMax.y = d.y), d.z > this._absoluteMax.z && (this._absoluteMax.z = d.z), d.x < this._absoluteMin.x && (this._absoluteMin.x = d.x), d.y < this._absoluteMin.y && (this._absoluteMin.y = d.y), d.z < this._absoluteMin.z && (this._absoluteMin.z = d.z);
     }
   }
   static getFragmentBounds(t) {
@@ -7064,8 +7064,8 @@ const At = class At extends et {
         c += 2;
         continue;
       }
-      const E = a[c], d = s.getX(E), h = s.getY(E), u = s.getZ(E);
-      d < n.x && (n.x = d), h < n.y && (n.y = h), u < n.z && (n.z = u), d > r.x && (r.x = d), h > r.y && (r.y = h), u > r.z && (r.z = u);
+      const h = a[c], d = s.getX(h), E = s.getY(h), u = s.getZ(h);
+      d < n.x && (n.x = d), E < n.y && (n.y = E), u < n.z && (n.z = u), d > r.x && (r.x = d), E > r.y && (r.y = E), u > r.z && (r.z = u);
     }
     return new g.Box3(n, r);
   }
@@ -7234,9 +7234,9 @@ const vn = /* @__PURE__ */ new Set([
     for (const c of r) {
       if (vn.has(c))
         continue;
-      const E = a.has(c) && o, d = t.GetLineIDsWithType(s, c);
-      for (const h of d) {
-        const u = t.GetLine(0, h, E, i);
+      const h = a.has(c) && o, d = t.GetLineIDsWithType(s, c);
+      for (const E of d) {
+        const u = t.GetLine(0, E, h, i);
         n[u.expressID] = u;
       }
     }
@@ -7320,11 +7320,11 @@ const Ls = class Ls extends et {
    * @returns The loaded FragmentsGroup.
    */
   load(t, s) {
-    const o = { ...{ coordinate: !0 }, ...s }, { coordinate: n, name: r, properties: a, relationsMap: c } = o, E = this._loader.import(t);
-    r && (E.name = r);
-    for (const d of E.items)
-      d.group = E, this.list.set(d.id, d);
-    return n && this.coordinate([E]), this.groups.set(E.uuid, E), a && E.setLocalProperties(a), c && this.components.get(ke).setRelationMap(E, c), this.onFragmentsLoaded.trigger(E), E;
+    const o = { ...{ coordinate: !0 }, ...s }, { coordinate: n, name: r, properties: a, relationsMap: c } = o, h = this._loader.import(t);
+    r && (h.name = r);
+    for (const d of h.items)
+      d.group = h, this.list.set(d.id, d);
+    return n && this.coordinate([h]), this.groups.set(h.uuid, h), a && h.setLocalProperties(a), c && this.components.get(ke).setRelationMap(h, c), this.onFragmentsLoaded.trigger(h), h;
   }
   /**
    * Export the specified fragmentsgroup to binary data.
@@ -7525,17 +7525,17 @@ const Xr = /* @__PURE__ */ new Map([
   }
   indexRelations(t, s, i, o) {
     const n = Object.keys(s).find(
-      (h) => h.startsWith("Relating")
+      (E) => E.startsWith("Relating")
     ), r = Object.keys(s).find(
-      (h) => h.startsWith("Related")
+      (E) => E.startsWith("Related")
     );
     if (!(n && r))
       return;
-    const a = s[n].value, c = s[r].map((h) => h.value), E = t.get(a) ?? /* @__PURE__ */ new Map(), d = this._inverseAttributes.indexOf(o);
-    E.set(d, c), t.set(a, E);
-    for (const h of c) {
-      const u = t.get(h) ?? /* @__PURE__ */ new Map(), p = this._inverseAttributes.indexOf(i), A = u.get(p) ?? [];
-      A.push(a), u.set(p, A), t.set(h, u);
+    const a = s[n].value, c = s[r].map((E) => E.value), h = t.get(a) ?? /* @__PURE__ */ new Map(), d = this._inverseAttributes.indexOf(o);
+    h.set(d, c), t.set(a, h);
+    for (const E of c) {
+      const u = t.get(E) ?? /* @__PURE__ */ new Map(), p = this._inverseAttributes.indexOf(i), A = u.get(p) ?? [];
+      A.push(a), u.set(p, A), t.set(E, u);
     }
   }
   /**
@@ -7584,8 +7584,8 @@ const Xr = /* @__PURE__ */ new Map([
         continue;
       const { forRelated: r, forRelating: a } = n;
       for (const c in o) {
-        const E = o[c];
-        this.indexRelations(s, E, r, a);
+        const h = o[c];
+        this.indexRelations(s, h, r, a);
       }
     }
     return this.setRelationMap(t, s), s;
@@ -7605,10 +7605,10 @@ const Xr = /* @__PURE__ */ new Map([
       if (!n)
         continue;
       const { forRelated: r, forRelating: a } = n, c = t.GetLineIDsWithType(s, o);
-      for (let E = 0; E < c.size(); E++) {
+      for (let h = 0; h < c.size(); h++) {
         const d = await t.properties.getItemProperties(
           s,
-          c.get(E)
+          c.get(h)
         );
         this.indexRelations(i, d, r, a);
       }
@@ -9033,8 +9033,8 @@ class Kt {
       const a = await e.getProperties(r.value);
       if (!a || !a.UnitType || !a.UnitType.value || a.UnitType.value !== "LENGTHUNIT")
         continue;
-      let E = 1, d = 1;
-      return a.Name.value === "METRE" && (d = 1), a.Name.value === "FOOT" && (d = 0.3048), ((n = a.Prefix) == null ? void 0 : n.value) === "MILLI" && (E = 1e-3), d * E;
+      let h = 1, d = 1;
+      return a.Name.value === "METRE" && (d = 1), a.Name.value === "FOOT" && (d = 0.3048), ((n = a.Prefix) == null ? void 0 : n.value) === "MILLI" && (h = 1e-3), d * h;
     }
     return 1;
   }
@@ -9053,17 +9053,17 @@ class Kt {
     const o = s ?? (async () => {
     }), n = {}, r = e.getAllPropertiesIDs();
     for (const c of r) {
-      const E = await e.getProperties(c);
-      if (!E)
+      const h = await e.getProperties(c);
+      if (!h)
         continue;
-      const d = E.type === t, h = Object.keys(E).find(
+      const d = h.type === t, E = Object.keys(h).find(
         (C) => C.startsWith("Relating")
-      ), u = Object.keys(E).find(
+      ), u = Object.keys(h).find(
         (C) => C.startsWith("Related")
       );
-      if (!(d && h && u))
+      if (!(d && E && u))
         continue;
-      const p = await e.getProperties((a = E[h]) == null ? void 0 : a.value), A = E[u];
+      const p = await e.getProperties((a = h[E]) == null ? void 0 : a.value), A = h[u];
       if (!p || !A || !(A && Array.isArray(A)))
         continue;
       const m = A.map((C) => C.value);
@@ -9230,48 +9230,48 @@ class Yn {
         s.add(i.get(c));
       const o = e.GetLineIDsWithType(0, b.IFCRELAGGREGATES), n = o.size();
       for (let c = 0; c < n; c++) {
-        const E = o.get(c), d = e.GetLine(0, E);
+        const h = o.get(c), d = e.GetLine(0, h);
         if (!d || !d.RelatingObject || !d.RelatedObjects)
           continue;
-        const h = d.RelatingObject.value, u = d.RelatedObjects;
+        const E = d.RelatingObject.value, u = d.RelatedObjects;
         for (const p of u) {
           const A = p.value;
-          s.has(A) && (this.itemsByFloor[A] = h);
+          s.has(A) && (this.itemsByFloor[A] = E);
         }
       }
       const r = {}, a = t.size();
       for (let c = 0; c < a; c++) {
-        const E = t.get(c), d = e.GetLine(0, E);
+        const h = t.get(c), d = e.GetLine(0, h);
         if (!d || !d.RelatingStructure || !d.RelatedElements)
           continue;
-        const h = d.RelatingStructure.value, u = d.RelatedElements;
-        if (s.has(h))
+        const E = d.RelatingStructure.value, u = d.RelatedElements;
+        if (s.has(E))
           for (const p of u) {
-            r[h] || (r[h] = []);
+            r[E] || (r[E] = []);
             const A = p.value;
-            r[h].push(A);
+            r[E].push(A);
           }
         else
           for (const p of u) {
             const A = p.value;
-            this.itemsByFloor[A] = h;
+            this.itemsByFloor[A] = E;
           }
       }
       for (const c in r) {
-        const E = this.itemsByFloor[c];
-        if (E !== void 0) {
+        const h = this.itemsByFloor[c];
+        if (h !== void 0) {
           const d = r[c];
-          for (const h of d)
-            this.itemsByFloor[h] = E;
+          for (const E of d)
+            this.itemsByFloor[E] = h;
         }
       }
       for (let c = 0; c < n; c++) {
-        const E = o.get(c), d = e.GetLine(0, E);
+        const h = o.get(c), d = e.GetLine(0, h);
         if (!d || !d.RelatingObject || !d.RelatedObjects)
           continue;
-        const h = d.RelatingObject.value, u = d.RelatedObjects;
+        const E = d.RelatingObject.value, u = d.RelatedObjects;
         for (const p of u) {
-          const A = p.value, m = this.itemsByFloor[h];
+          const A = p.value, m = this.itemsByFloor[E];
           m !== void 0 && (this.itemsByFloor[A] = m);
         }
       }
@@ -9355,22 +9355,22 @@ class Vn {
     for (const o of e) {
       const n = {};
       if (o.data)
-        for (const h of o.data) {
-          const [u, p] = h.split(": "), A = parseFloat(p);
+        for (const E of o.data) {
+          const [u, p] = E.split(": "), A = parseFloat(p);
           n[u] = A || p;
         }
       const { points: r } = o, a = new Float32Array(r.length * 3);
-      for (let h = 0; h < r.length; h++) {
-        const { x: u, y: p, z: A } = r[h];
-        a[h * 3] = u, a[h * 3 + 1] = p, a[h * 3 + 2] = A || 0;
+      for (let E = 0; E < r.length; E++) {
+        const { x: u, y: p, z: A } = r[E];
+        a[E * 3] = u, a[E * 3 + 1] = p, a[E * 3 + 2] = A || 0;
       }
-      const c = new g.BufferAttribute(a, 3), E = new g.EdgesGeometry();
-      E.setAttribute("position", c);
+      const c = new g.BufferAttribute(a, 3), h = new g.EdgesGeometry();
+      h.setAttribute("position", c);
       const d = new Vt.CurveMesh(
         i,
         n,
         t,
-        E,
+        h,
         this.defLineMat
       );
       s.push(d.curve), i++;
@@ -9391,14 +9391,14 @@ class Gn {
       r,
       a,
       c,
-      E
+      h
     ] = s;
     if (i != null && i.value && (t.name = i.value), o != null && o.value && (t.creationDate = new Date(o.value)), n) {
       t.author = {};
-      const [h, u] = n;
-      h != null && h.value && (t.author.name = h.value), u != null && u.value && (t.author.email = u.value);
+      const [E, u] = n;
+      E != null && E.value && (t.author.name = E.value), u != null && u.value && (t.author.email = u.value);
     }
-    return (d = r[0]) != null && d.value && (t.organization = r[0].value), a != null && a.value && (t.preprocessorVersion = a == null ? void 0 : a.value), c != null && c.value && (t.originatingSystem = c == null ? void 0 : c.value), E != null && E.value && (t.authorization = E == null ? void 0 : E.value), t;
+    return (d = r[0]) != null && d.value && (t.organization = r[0].value), a != null && a.value && (t.preprocessorVersion = a == null ? void 0 : a.value), c != null && c.value && (t.originatingSystem = c == null ? void 0 : c.value), h != null && h.value && (t.authorization = h == null ? void 0 : h.value), t;
   }
   getDescriptionInfo(e) {
     var n;
@@ -9497,7 +9497,15 @@ const Ve = class Ve extends et {
     a.groups.set(o.uuid, o);
     for (const c of o.items)
       a.list.set(c.id, c), c.mesh.uuid = c.id, c.group = o;
-    return a.onFragmentsLoaded.trigger(o), s && a.coordinate([o]), console.log(`Streaming the IFC took ${performance.now() - i} ms!`), o;
+    a.onFragmentsLoaded.trigger(o), s && a.coordinate([o]);
+    for (const [c] of o.data) {
+      const h = r[c];
+      if (!h || !h.GlobalId)
+        continue;
+      const d = h.GlobalId.value || h.GlobalId;
+      o.globalToExpressIDs.set(d, c);
+    }
+    return console.log(`Streaming the IFC took ${performance.now() - i} ms!`), o;
   }
   /**
    * Reads an IFC file and initializes the Web-IFC library.
@@ -9553,10 +9561,10 @@ const Ve = class Ve extends et {
         continue;
       const r = this.webIfc.GetLineIDsWithType(0, n), a = r.size();
       for (let c = 0; c < a; c++) {
-        const E = r.get(c);
-        i.push(E);
-        const d = this._spatialTree.itemsByFloor[E] || 0;
-        s.data.set(E, [[], [d, n]]);
+        const h = r.get(c);
+        i.push(h);
+        const d = this._spatialTree.itemsByFloor[h] || 0;
+        s.data.set(h, [[], [d, n]]);
       }
     }
     this._spatialTree.cleanUp(), this.webIfc.StreamMeshes(0, i, (n) => {
@@ -9571,8 +9579,8 @@ const Ve = class Ve extends et {
       if (!r)
         throw new Error("Fragment not found!");
       const a = [];
-      for (const [c, E] of r)
-        a.push(E);
+      for (const [c, h] of r)
+        a.push(h);
       n.add(a);
     }
     const o = this.webIfc.GetCoordinationMatrix(0);
@@ -9581,14 +9589,14 @@ const Ve = class Ve extends et {
   getMesh(t, s) {
     const i = t.geometries.size(), o = t.expressID;
     for (let n = 0; n < i; n++) {
-      const r = t.geometries.get(n), { x: a, y: c, z: E, w: d } = r.color, h = d !== 1, { geometryExpressID: u } = r, p = `${u}-${h}`;
+      const r = t.geometries.get(n), { x: a, y: c, z: h, w: d } = r.color, E = d !== 1, { geometryExpressID: u } = r, p = `${u}-${E}`;
       if (!this._visitedFragments.has(p)) {
-        const T = this.getGeometry(this.webIfc, u), O = h ? this._materialT : this._material, _ = new Vt.Fragment(T, O, 1);
+        const T = this.getGeometry(this.webIfc, u), O = E ? this._materialT : this._material, _ = new Vt.Fragment(T, O, 1);
         s.add(_.mesh), s.items.push(_);
         const S = this._visitedFragments.size;
         this._visitedFragments.set(p, { index: S, fragment: _ });
       }
-      const A = new g.Color().setRGB(a, c, E, "srgb"), m = new g.Matrix4();
+      const A = new g.Color().setRGB(a, c, h, "srgb"), m = new g.Matrix4();
       m.fromArray(r.flatTransformation);
       const C = this._visitedFragments.get(p);
       if (C === void 0)
@@ -9619,10 +9627,10 @@ const Ve = class Ve extends et {
       i.GetVertexData(),
       i.GetVertexDataSize()
     ), r = new Float32Array(n.length / 2), a = new Float32Array(n.length / 2);
-    for (let h = 0; h < n.length; h += 6)
-      r[h / 2] = n[h], r[h / 2 + 1] = n[h + 1], r[h / 2 + 2] = n[h + 2], a[h / 2] = n[h + 3], a[h / 2 + 1] = n[h + 4], a[h / 2 + 2] = n[h + 5];
-    const c = new g.BufferGeometry(), E = new g.BufferAttribute(r, 3), d = new g.BufferAttribute(a, 3);
-    return c.setAttribute("position", E), c.setAttribute("normal", d), c.setIndex(Array.from(o)), i.delete(), c;
+    for (let E = 0; E < n.length; E += 6)
+      r[E / 2] = n[E], r[E / 2 + 1] = n[E + 1], r[E / 2 + 2] = n[E + 2], a[E / 2] = n[E + 3], a[E / 2 + 1] = n[E + 4], a[E / 2 + 2] = n[E + 5];
+    const c = new g.BufferGeometry(), h = new g.BufferAttribute(r, 3), d = new g.BufferAttribute(a, 3);
+    return c.setAttribute("position", h), c.setAttribute("normal", d), c.setIndex(Array.from(o)), i.delete(), c;
   }
   async autoSetWasm() {
     const t = await fetch(
@@ -9751,23 +9759,23 @@ const Bt = class Bt extends et {
    * @throws Will throw an error if no OwnerHistory is found in the model.
    */
   async newPset(t, s, i) {
-    const o = Bt.getIFCSchema(t), { ownerHistoryHandle: n } = await this.getOwnerHistory(t), r = this.newGUID(t), a = new b[o].IfcLabel(s), c = i ? new b[o].IfcText(i) : null, E = new b[o].IfcPropertySet(
+    const o = Bt.getIFCSchema(t), { ownerHistoryHandle: n } = await this.getOwnerHistory(t), r = this.newGUID(t), a = new b[o].IfcLabel(s), c = i ? new b[o].IfcText(i) : null, h = new b[o].IfcPropertySet(
       r,
       n,
       a,
       c,
       []
     );
-    E.expressID = this.increaseMaxID(t);
-    const d = this.newGUID(t), h = new b[o].IfcRelDefinesByProperties(
+    h.expressID = this.increaseMaxID(t);
+    const d = this.newGUID(t), E = new b[o].IfcRelDefinesByProperties(
       d,
       n,
       null,
       null,
       [],
-      new b.Handle(E.expressID)
+      new b.Handle(h.expressID)
     );
-    return h.expressID = this.increaseMaxID(t), await this.setData(t, E, h), { pset: E, rel: h };
+    return E.expressID = this.increaseMaxID(t), await this.setData(t, h, E), { pset: h, rel: E };
   }
   /**
    * Removes a Property Set (Pset) from the given model.
@@ -9913,10 +9921,10 @@ const Bt = class Bt extends et {
   async saveToIfc(t, s) {
     const i = this.components.get(Ri), o = i.webIfc, n = await i.readIfcFile(s), r = this.changeMap[t.uuid] ?? [];
     for (const c of r) {
-      const E = await t.getProperties(c);
-      if (E)
+      const h = await t.getProperties(c);
+      if (h)
         try {
-          o.WriteLine(n, E);
+          o.WriteLine(n, h);
         } catch {
         }
       else
@@ -9963,8 +9971,8 @@ const Bt = class Bt extends et {
       get() {
         return this._value;
       },
-      async set(E) {
-        this._value = E, c.trigger(E);
+      async set(h) {
+        this._value = h, c.trigger(h);
       }
     }), n[i].value = a, this.attributeListeners[t.uuid][s] || (this.attributeListeners[t.uuid][s] = {}), this.attributeListeners[t.uuid][s][i] = c, c;
   }
@@ -10026,8 +10034,8 @@ const Ps = class Ps extends et {
         else
           for (const a of r) {
             const c = n[a];
-            for (const E of i)
-              delete c[E];
+            for (const h of i)
+              delete c[h];
             Object.values(c).length === 0 && delete n[a];
           }
       }
@@ -10082,13 +10090,13 @@ const Ps = class Ps extends et {
         continue;
       }
       for (const c of a) {
-        const E = this.list[r][c];
-        if (E)
-          for (const d in E) {
+        const h = this.list[r][c];
+        if (h)
+          for (const d in h) {
             o[d] || (o[d] = /* @__PURE__ */ new Map());
-            for (const h of E[d]) {
-              const u = o[d].get(h);
-              u === void 0 ? o[d].set(h, 1) : o[d].set(h, u + 1);
+            for (const E of h[d]) {
+              const u = o[d].get(E);
+              u === void 0 ? o[d].set(E, 1) : o[d].set(E, u + 1);
             }
           }
       }
@@ -10096,10 +10104,10 @@ const Ps = class Ps extends et {
     const n = {};
     for (const r in o) {
       const a = o[r];
-      for (const [c, E] of a) {
-        if (E === void 0)
+      for (const [c, h] of a) {
+        if (h === void 0)
           throw new Error("Malformed fragments map!");
-        E === i && (n[r] || (n[r] = /* @__PURE__ */ new Set()), n[r].add(c));
+        h === i && (n[r] || (n[r] = /* @__PURE__ */ new Set()), n[r].add(c));
       }
     }
     return n;
@@ -10125,8 +10133,8 @@ const Ps = class Ps extends et {
     for (const [n, r] of s.data) {
       const a = r[0];
       for (const c of a) {
-        const E = s.keyFragments.get(c);
-        E && (o[E] || (o[E] = /* @__PURE__ */ new Set()), o[E].add(n));
+        const h = s.keyFragments.get(c);
+        h && (o[h] || (o[h] = /* @__PURE__ */ new Set()), o[h].add(n));
       }
     }
   }
@@ -10154,9 +10162,9 @@ const Ps = class Ps extends et {
       const a = String((o = r.PredefinedType) == null ? void 0 : o.value).toUpperCase();
       s[a] || (s[a] = {});
       const c = s[a];
-      for (const [E, d] of t.data) {
-        const h = d[0];
-        for (const u of h) {
+      for (const [h, d] of t.data) {
+        const E = d[0];
+        for (const u of E) {
           const p = t.keyFragments.get(u);
           if (!p)
             throw new Error("Fragment ID not found!");
@@ -10248,17 +10256,17 @@ const Ps = class Ps extends et {
       ), c = await t.getProperties(r);
       if (!(a && c))
         continue;
-      const E = (n = c.Name) == null ? void 0 : n.value;
+      const h = (n = c.Name) == null ? void 0 : n.value;
       for (const d of a) {
-        this.saveItem(t, o, E, d);
-        const h = s.getEntityRelations(
+        this.saveItem(t, o, h, d);
+        const E = s.getEntityRelations(
           t,
           Number(d),
           "IsDecomposedBy"
         );
-        if (h)
-          for (const u of h)
-            this.saveItem(t, o, E, u);
+        if (E)
+          for (const u of E)
+            this.saveItem(t, o, h, u);
       }
     }
   }
@@ -10377,12 +10385,12 @@ const ys = class ys extends et {
     const r = s.list[this.groupName], a = new g.Matrix4();
     for (const c in r) {
       a.elements[13] = n * o * this.height;
-      for (const E in r[c]) {
-        const d = i.list.get(E), h = c + E, u = this.list.has(h);
+      for (const h in r[c]) {
+        const d = i.list.get(h), E = c + h, u = this.list.has(E);
         if (!d || t && u || !t && !u)
           continue;
-        t ? this.list.add(h) : this.list.delete(h);
-        const p = r[c][E];
+        t ? this.list.add(E) : this.list.delete(E);
+        const p = r[c][h];
         d.applyTransform(p, a);
       }
       n++;
@@ -10579,23 +10587,28 @@ const ws = class ws extends et {
         r > t && (r = 0, a++, o.push([]));
         const f = C.get(F);
         o[a].push(f);
-        const T = this._spatialTree.itemsByFloor[f] || 0;
-        n.data.set(f, [[], [T, m]]), r++;
+        const T = this.webIfc.GetLine(0, f);
+        if (T.GlobalId) {
+          const _ = (T == null ? void 0 : T.GlobalId.value) || (T == null ? void 0 : T.GlobalId);
+          n.globalToExpressIDs.set(_, f);
+        }
+        const O = this._spatialTree.itemsByFloor[f] || 0;
+        n.data.set(f, [[], [O, m]]), r++;
       }
     }
     this._spatialTree.cleanUp();
-    let c = 0.01, E = 0;
+    let c = 0.01, h = 0;
     for (const m of o) {
-      E++, this.webIfc.StreamMeshes(0, m, (R) => {
+      h++, this.webIfc.StreamMeshes(0, m, (R) => {
         this.getMesh(this.webIfc, R, n);
       }), this._geometryCount > t && await this.streamGeometries(), this._assets.length > s && await this.streamAssets();
-      const C = E / o.length;
+      const C = h / o.length;
       C > c && (c += 0.01, c = Math.max(c, C), this.onProgress.trigger(Math.round(c * 100) / 100));
     }
     this._geometryCount && await this.streamGeometries(), this._assets.length && await this.streamAssets();
-    const { opaque: d, transparent: h } = n.geometryIDs;
+    const { opaque: d, transparent: E } = n.geometryIDs;
     for (const [m, { index: C, uuid: R }] of this._visitedGeometries)
-      n.keyFragments.set(C, R), (m > 1 ? d : h).set(m, C);
+      n.keyFragments.set(C, R), (m > 1 ? d : E).set(m, C);
     const u = n.data.keys();
     for (const m of u) {
       const [C] = n.data.get(m);
@@ -10612,13 +10625,13 @@ const ws = class ws extends et {
   getMesh(t, s, i) {
     const o = s.geometries.size(), n = s.expressID, r = { id: n, geometries: [] };
     for (let a = 0; a < o; a++) {
-      const c = s.geometries.get(a), E = c.geometryExpressID, d = c.color.w === 1 ? 1 : -1, h = E * d;
-      if (!this._visitedGeometries.has(h)) {
-        this._visitedGeometries.has(E) || this.getGeometry(t, E);
+      const c = s.geometries.get(a), h = c.geometryExpressID, d = c.color.w === 1 ? 1 : -1, E = h * d;
+      if (!this._visitedGeometries.has(E)) {
+        this._visitedGeometries.has(h) || this.getGeometry(t, h);
         const T = this._visitedGeometries.size, O = g.MathUtils.generateUUID();
-        this._visitedGeometries.set(h, { uuid: O, index: T });
+        this._visitedGeometries.set(E, { uuid: O, index: T });
       }
-      const u = this._visitedGeometries.get(h);
+      const u = this._visitedGeometries.get(E);
       if (u === void 0)
         throw new Error("Error getting geometry data for streaming!");
       const p = i.data.get(n);
@@ -10626,7 +10639,7 @@ const ws = class ws extends et {
         throw new Error("Data not found!");
       p[0].push(u.index);
       const { x: A, y: m, z: C, w: R } = c.color, F = [A, m, C, R], f = c.flatTransformation;
-      r.geometries.push({ color: F, geometryID: E, transformation: f });
+      r.geometries.push({ color: F, geometryID: h, transformation: f });
     }
     this._assets.push(r);
   }
@@ -10640,12 +10653,12 @@ const ws = class ws extends et {
     ), r = new Float32Array(n.length / 2), a = new Float32Array(n.length / 2);
     for (let u = 0; u < n.length; u += 6)
       r[u / 2] = n[u], r[u / 2 + 1] = n[u + 1], r[u / 2 + 2] = n[u + 2], a[u / 2] = n[u + 3], a[u / 2 + 1] = n[u + 4], a[u / 2 + 2] = n[u + 5];
-    const c = Tr(r), E = new Float32Array(c.transformation.elements), d = [c.center.x, c.center.y, c.center.z];
-    let h = !1;
+    const c = Tr(r), h = new Float32Array(c.transformation.elements), d = [c.center.x, c.center.y, c.center.z];
+    let E = !1;
     for (let u = 0; u < r.length - 2; u += 3) {
       const p = r[u], A = r[u + 1], m = r[u + 2], C = a[u], R = a[u + 1], F = a[u + 2];
       if (mr(d, [p, A, m], [C, R, F])) {
-        h = !0;
+        E = !0;
         break;
       }
     }
@@ -10653,8 +10666,8 @@ const ws = class ws extends et {
       position: r,
       normal: a,
       index: o,
-      boundingBox: E,
-      hasHoles: h
+      boundingBox: h,
+      hasHoles: E
     }), i.delete(), this._geometryCount++;
   }
   async streamAssets() {
@@ -10758,15 +10771,15 @@ class Kr extends et {
     for (const c of s) {
       if (n++, vn.has(c))
         continue;
-      const E = i.has(c), d = this.webIfc.GetLineIDsWithType(0, c), h = d.size();
+      const h = i.has(c), d = this.webIfc.GetLineIDsWithType(0, c), E = d.size();
       let u = 0;
-      for (let A = 0; A < h - t; A += t) {
+      for (let A = 0; A < E - t; A += t) {
         const m = {};
         for (let C = 0; C < t; C++) {
           u++;
           const R = d.get(A + C);
           try {
-            const F = this.webIfc.GetLine(0, R, E);
+            const F = this.webIfc.GetLine(0, R, h);
             m[F.expressID] = F;
           } catch {
             console.log(`Could not get property: ${R}`);
@@ -10774,12 +10787,12 @@ class Kr extends et {
         }
         await this.onPropertiesStreamed.trigger({ type: c, data: m });
       }
-      if (u !== h) {
+      if (u !== E) {
         const A = {};
-        for (let m = u; m < h; m++) {
+        for (let m = u; m < E; m++) {
           const C = d.get(m);
           try {
-            const R = this.webIfc.GetLine(0, C, E);
+            const R = this.webIfc.GetLine(0, C, h);
             A[R.expressID] = R;
           } catch {
             console.log(`Could not get property: ${C}`);
@@ -10839,60 +10852,60 @@ const Ds = class Ds extends et {
       i,
       t
     ), a = [];
-    for (let h = 0; h < n.length / 3; h++) {
-      const { plane: u, edges: p } = this.getFaceData(h, i, t);
+    for (let E = 0; E < n.length / 3; E++) {
+      const { plane: u, edges: p } = this.getFaceData(E, i, t);
       if (u.equals(r)) {
-        a.push({ index: h, edges: p });
+        a.push({ index: E, edges: p });
         for (const { id: A, points: m, distance: C } of p)
           o.set(A, { points: m, distance: C });
       }
     }
     let c = 0;
-    const E = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map();
-    for (const { index: h, edges: u } of a) {
+    const h = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map();
+    for (const { index: E, edges: u } of a) {
       const p = /* @__PURE__ */ new Map();
       for (const { id: T } of u)
-        if (E.has(T)) {
-          const O = E.get(T);
+        if (h.has(T)) {
+          const O = h.get(T);
           p.set(T, O);
         }
       const A = u.map((T) => T.id);
       if (!p.size) {
         const T = c++;
         for (const { id: O } of u)
-          E.set(O, T);
+          h.set(O, T);
         d.set(T, {
           edges: new Set(A),
-          indices: /* @__PURE__ */ new Set([h])
+          indices: /* @__PURE__ */ new Set([E])
         });
         continue;
       }
       let m = null;
       const C = /* @__PURE__ */ new Set(), R = new Set(A);
       for (const [T, O] of p) {
-        m === null ? m = O : O !== m && C.add(O), E.delete(T);
+        m === null ? m = O : O !== m && C.add(O), h.delete(T);
         const { edges: _ } = d.get(O);
         _.delete(T), R.delete(T);
       }
       if (m === null)
         throw new Error("Error computing face!");
       const F = d.get(m), { indices: f } = F;
-      f.add(h);
+      f.add(E);
       for (const T of R) {
-        E.set(T, m);
+        h.set(T, m);
         const { edges: O } = F;
         O.add(T);
       }
       for (const T of C) {
         const O = d.get(T), { edges: _, indices: S } = O, N = d.get(m), { edges: P, indices: w } = N;
         for (const y of _)
-          P.add(y), E.set(y, m);
+          P.add(y), h.set(y, m);
         for (const y of S)
           w.add(y);
         d.delete(T);
       }
     }
-    for (const [h, { indices: u, edges: p }] of d)
+    for (const [E, { indices: u, edges: p }] of d)
       if (u.has(s)) {
         const A = [];
         for (const m of p) {
@@ -10916,14 +10929,14 @@ const Ds = class Ds extends et {
   getVerticesAndNormal(t, s, i) {
     if (!t.geometry.index)
       throw new Error("Geometry must be indexed!");
-    const o = t.geometry.index.array, n = t.geometry.attributes.position.array, r = t.geometry.attributes.normal.array, a = o[s * 3] * 3, c = o[s * 3 + 1] * 3, E = o[s * 3 + 2] * 3, d = new g.Vector3(n[a], n[a + 1], n[a + 2]), h = new g.Vector3(n[c], n[c + 1], n[c + 2]), u = new g.Vector3(n[E], n[E + 1], n[E + 2]), p = new g.Vector3(r[a], r[a + 1], r[a + 2]), A = new g.Vector3(r[c], r[c + 1], r[c + 2]), m = new g.Vector3(r[E], r[E + 1], r[E + 2]), C = (p.x + A.x + m.x) / 3, R = (p.y + A.y + m.y) / 3, F = (p.z + A.z + m.z) / 3, f = new g.Vector3(C, R, F);
+    const o = t.geometry.index.array, n = t.geometry.attributes.position.array, r = t.geometry.attributes.normal.array, a = o[s * 3] * 3, c = o[s * 3 + 1] * 3, h = o[s * 3 + 2] * 3, d = new g.Vector3(n[a], n[a + 1], n[a + 2]), E = new g.Vector3(n[c], n[c + 1], n[c + 2]), u = new g.Vector3(n[h], n[h + 1], n[h + 2]), p = new g.Vector3(r[a], r[a + 1], r[a + 2]), A = new g.Vector3(r[c], r[c + 1], r[c + 2]), m = new g.Vector3(r[h], r[h + 1], r[h + 2]), C = (p.x + A.x + m.x) / 3, R = (p.y + A.y + m.y) / 3, F = (p.z + A.z + m.z) / 3, f = new g.Vector3(C, R, F);
     if (i !== void 0 && t instanceof g.InstancedMesh) {
       const T = new g.Matrix4();
       t.getMatrixAt(i, T);
       const O = new g.Matrix4();
-      O.extractRotation(T), f.applyMatrix4(O), d.applyMatrix4(T), h.applyMatrix4(T), u.applyMatrix4(T);
+      O.extractRotation(T), f.applyMatrix4(O), d.applyMatrix4(T), E.applyMatrix4(T), u.applyMatrix4(T);
     }
-    return { p1: d, p2: h, p3: u, faceNormal: f };
+    return { p1: d, p2: E, p3: u, faceNormal: f };
   }
   /**
    * Method to round the vector's components to a specified number of decimal places.
@@ -10938,21 +10951,21 @@ const Ds = class Ds extends et {
   getFaceData(t, s, i) {
     const o = this.getVerticesAndNormal(i, t, s), { p1: n, p2: r, p3: a, faceNormal: c } = o;
     this.round(n), this.round(r), this.round(a), this.round(c);
-    const E = [
+    const h = [
       { id: `${n.x}|${n.y}|${n.z}`, value: n },
       { id: `${r.x}|${r.y}|${r.z}`, value: r },
       { id: `${a.x}|${a.y}|${a.z}`, value: a }
     ];
-    E.sort((F, f) => F.id < f.id ? -1 : F.id > f.id ? 1 : 0);
+    h.sort((F, f) => F.id < f.id ? -1 : F.id > f.id ? 1 : 0);
     const [
-      { id: d, value: h },
+      { id: d, value: E },
       { id: u, value: p },
       { id: A, value: m }
-    ] = E, C = [
+    ] = h, C = [
       {
         id: `${d}|${u}`,
-        distance: h.distanceTo(p),
-        points: [h, p]
+        distance: E.distanceTo(p),
+        points: [E, p]
       },
       {
         id: `${u}|${A}`,
@@ -10961,8 +10974,8 @@ const Ds = class Ds extends et {
       },
       {
         id: `${d}|${A}`,
-        distance: h.distanceTo(m),
-        points: [h, m]
+        distance: E.distanceTo(m),
+        points: [E, m]
       }
     ], R = new g.Plane();
     return R.setFromNormalAndCoplanarPoint(c, n), R.constant = Math.round(R.constant * 10) / 10, { plane: R, edges: C };