softbox 4.1.2 → 4.1.3

package/dist/{index-2b1F-jOC.js → index-Ckn3VxIa.js}

@@ -161,7 +161,7 @@ class Ac {
    * aborts before touching a disposed renderer/scene.
    */
   async configureEnvironment(e, t, n, s, r, o) {
-    var u, h, f, p, w, _;
+    var u, h, f, p, y, S;
     const a = await t.initialize({ renderer: s, autoDispose: !0 });
     if (o())
       return;
@@ -172,25 +172,25 @@ class Ac {
       environmentIntensity: (f = r.environment) == null ? void 0 : f.environmentIntensity
     }, d = (p = r.environment) == null ? void 0 : p.url;
     if (d) {
-      const y = await t.loadEnvironmentMap(d);
+      const w = await t.loadEnvironmentMap(d);
       if (o())
         return;
-      y.ok ? t.applyToScene(e, y.value, c) : console.warn("Failed to load environment map:", y.error);
-    } else if ((w = r.helpers) != null && w.studioEnvironment) {
-      const y = t.createStudioEnvironment();
-      if (y.ok) {
-        if (t.applyToScene(e, y.value, {
+      w.ok ? t.applyToScene(e, w.value, c) : console.warn("Failed to load environment map:", w.error);
+    } else if ((y = r.helpers) != null && y.studioEnvironment) {
+      const w = t.createStudioEnvironment();
+      if (w.ok) {
+        if (t.applyToScene(e, w.value, {
           ...c,
           setBackground: !1
-        }), (_ = r.helpers) != null && _.darkStudioMode && n) {
-          const S = n.createGradientBackground(e, {
+        }), (S = r.helpers) != null && S.darkStudioMode && n) {
+          const x = n.createGradientBackground(e, {
             topColor: Cr,
             bottomColor: Cr
           });
-          S.ok || console.warn("Failed to set dark studio background:", S.error);
+          x.ok || console.warn("Failed to set dark studio background:", x.error);
         }
       } else
-        console.warn("Failed to create studio environment:", y.error);
+        console.warn("Failed to create studio environment:", w.error);
     }
   }
 }
@@ -999,11 +999,11 @@ class Dc {
     }, d = `video-capture:${Do()}`;
     return this.deps.renderLoopManager.requireContinuous(d), this.deps.reviveRenderLoop(), this.deps.renderLoopManager.requestRender(), new Promise((h) => {
       const f = [];
-      let p = null, w = !1;
-      const _ = (S) => {
-        w || (w = !0, this.pendingSettlers.delete(y), c(), p !== null && clearTimeout(p), this.deps.renderLoopManager.releaseContinuous(d), s.getTracks().forEach((E) => E.stop()), h(S));
-      }, y = () => {
-        _(
+      let p = null, y = !1;
+      const S = (x) => {
+        y || (y = !0, this.pendingSettlers.delete(w), c(), p !== null && clearTimeout(p), this.deps.renderLoopManager.releaseContinuous(d), s.getTracks().forEach((E) => E.stop()), h(x));
+      }, w = () => {
+        S(
           B.err(
             new W("Viewer was disposed during video capture", Y.INVALID_STATE)
           )
@@ -1013,12 +1013,12 @@ class Dc {
         } catch {
         }
       };
-      this.pendingSettlers.add(y), r.ondataavailable = (S) => {
-        S.data.size > 0 && f.push(S.data);
+      this.pendingSettlers.add(w), r.ondataavailable = (x) => {
+        x.data.size > 0 && f.push(x.data);
       }, r.onstop = () => {
-        _(B.ok(new Blob(f, { type: r.mimeType || "video/webm" })));
+        S(B.ok(new Blob(f, { type: r.mimeType || "video/webm" })));
       }, r.onerror = () => {
-        _(
+        S(
           B.err(
             new W("Video recording failed", Y.OPERATION_FAILED)
           )
@@ -1079,17 +1079,17 @@ class Dc {
       e.width ?? (e.height !== void 0 ? e.height * h : d * a)
     ), p = Math.round(
       e.height ?? (e.width !== void 0 ? e.width / h : u * a)
-    ), w = t.capabilities.maxTextureSize;
-    if (!Number.isFinite(f) || !Number.isFinite(p) || f <= 0 || p <= 0 || f > w || p > w)
+    ), y = t.capabilities.maxTextureSize;
+    if (!Number.isFinite(f) || !Number.isFinite(p) || f <= 0 || p <= 0 || f > y || p > y)
       return B.err(
         new W(
-          `Requested still size ${f}x${p} is outside 1..${w}`,
+          `Requested still size ${f}x${p} is outside 1..${y}`,
           Y.INVALID_PARAMETER
         )
       );
     t.setPixelRatio(1), t.setSize(f, p), Mi(s, f / p);
-    const _ = t.render(n, s), y = _.ok ? this.readCanvasPng() : B.err(_.error);
-    return t.setSize(d, u), t.setPixelRatio(a), Mi(s, h), t.render(n, s), r.requestRender(), y;
+    const S = t.render(n, s), w = S.ok ? this.readCanvasPng() : B.err(S.error);
+    return t.setSize(d, u), t.setPixelRatio(a), Mi(s, h), t.render(n, s), r.requestRender(), w;
   }
   readCanvasPng() {
     const e = Oo(this.deps.renderer.getDomElement());
@@ -1294,7 +1294,7 @@ class Nc {
    * helpers — take effect at construction time and require a rebuild.
    */
   updateOptions(e) {
-    var u, h, f, p, w, _, y, S;
+    var u, h, f, p, y, S, w, x;
     if (this.disposed)
       return;
     const t = (u = this.options.animations) == null ? void 0 : u.autoplay;
@@ -1307,12 +1307,12 @@ class Nc {
     r !== void 0 && (this.scene.setEnvironmentIntensity(r), n = !0);
     const o = (p = e.controls) == null ? void 0 : p.autoRotate;
     o !== void 0 && (this.controls.autoRotate = o, o ? this.renderLoopManager.requireContinuous("turntable") : this.renderLoopManager.releaseContinuous("turntable"), n = !0);
-    const a = (w = e.controls) == null ? void 0 : w.autoRotateSpeed;
+    const a = (y = e.controls) == null ? void 0 : y.autoRotateSpeed;
     a !== void 0 && (this.controls.autoRotateSpeed = a, n = !0);
-    const c = (_ = e.animations) == null ? void 0 : _.autoplay;
+    const c = (S = e.animations) == null ? void 0 : S.autoplay;
     c !== void 0 && c !== t && (c ? this.playAnimations(typeof c == "string" ? c : void 0) : this.pauseAnimations(), n = !0);
-    const d = (y = e.animations) == null ? void 0 : y.speed;
-    d !== void 0 && ((S = this.animationService) == null || S.setSpeed(d), n = !0), n && (this.reviveRenderLoop(), this.renderLoopManager.requestRender());
+    const d = (w = e.animations) == null ? void 0 : w.speed;
+    d !== void 0 && ((x = this.animationService) == null || x.setSpeed(d), n = !0), n && (this.reviveRenderLoop(), this.renderLoopManager.requestRender());
   }
   applyBackgroundColor(e) {
     var n;
@@ -1594,17 +1594,17 @@ function Fd(i) {
   return i;
 }
 function ii(i, e, t, n, s) {
-  let r = 1 / 0, o = 1 / 0, a = 1 / 0, c = -1 / 0, d = -1 / 0, u = -1 / 0, h = 1 / 0, f = 1 / 0, p = 1 / 0, w = -1 / 0, _ = -1 / 0, y = -1 / 0;
-  const S = i.offset || 0;
-  for (let E = (e - S) * 6, b = (e + t - S) * 6; E < b; E += 6) {
-    const x = i[E + 0], v = i[E + 1], L = x - v, C = x + v;
-    L < r && (r = L), C > c && (c = C), x < h && (h = x), x > w && (w = x);
-    const M = i[E + 2], D = i[E + 3], I = M - D, N = M + D;
-    I < o && (o = I), N > d && (d = N), M < f && (f = M), M > _ && (_ = M);
+  let r = 1 / 0, o = 1 / 0, a = 1 / 0, c = -1 / 0, d = -1 / 0, u = -1 / 0, h = 1 / 0, f = 1 / 0, p = 1 / 0, y = -1 / 0, S = -1 / 0, w = -1 / 0;
+  const x = i.offset || 0;
+  for (let E = (e - x) * 6, b = (e + t - x) * 6; E < b; E += 6) {
+    const _ = i[E + 0], A = i[E + 1], P = _ - A, I = _ + A;
+    P < r && (r = P), I > c && (c = I), _ < h && (h = _), _ > y && (y = _);
+    const M = i[E + 2], D = i[E + 3], C = M - D, N = M + D;
+    C < o && (o = C), N > d && (d = N), M < f && (f = M), M > S && (S = M);
     const O = i[E + 4], F = i[E + 5], V = O - F, te = O + F;
-    V < a && (a = V), te > u && (u = te), O < p && (p = O), O > y && (y = O);
+    V < a && (a = V), te > u && (u = te), O < p && (p = O), O > w && (w = O);
   }
-  n[0] = r, n[1] = o, n[2] = a, n[3] = c, n[4] = d, n[5] = u, s[0] = h, s[1] = f, s[2] = p, s[3] = w, s[4] = _, s[5] = y;
+  n[0] = r, n[1] = o, n[2] = a, n[3] = c, n[4] = d, n[5] = u, s[0] = h, s[1] = f, s[2] = p, s[3] = y, s[4] = S, s[5] = w;
 }
 const Ct = 32, zc = (i, e) => i.candidate - e.candidate, zt = /* @__PURE__ */ new Array(Ct).fill().map(() => ({
   count: 0,
@@ -1624,76 +1624,76 @@ function Bc(i, e, t, n, s, r) {
     let d = si * s;
     const u = t.offset || 0, h = (n - u) * 6, f = (n + s - u) * 6;
     for (let p = 0; p < 3; p++) {
-      const w = e[p], S = (e[p + 3] - w) / Ct;
+      const y = e[p], x = (e[p + 3] - y) / Ct;
       if (s < Ct / 4) {
         const E = [...zt];
         E.length = s;
         let b = 0;
-        for (let v = h; v < f; v += 6, b++) {
-          const L = E[b];
-          L.candidate = t[v + 2 * p], L.count = 0;
+        for (let A = h; A < f; A += 6, b++) {
+          const P = E[b];
+          P.candidate = t[A + 2 * p], P.count = 0;
           const {
-            bounds: C,
+            bounds: I,
             leftCacheBounds: M,
             rightCacheBounds: D
-          } = L;
-          for (let I = 0; I < 3; I++)
-            D[I] = 1 / 0, D[I + 3] = -1 / 0, M[I] = 1 / 0, M[I + 3] = -1 / 0, C[I] = 1 / 0, C[I + 3] = -1 / 0;
-          ps(v, t, C);
+          } = P;
+          for (let C = 0; C < 3; C++)
+            D[C] = 1 / 0, D[C + 3] = -1 / 0, M[C] = 1 / 0, M[C + 3] = -1 / 0, I[C] = 1 / 0, I[C + 3] = -1 / 0;
+          ps(A, t, I);
         }
         E.sort(zc);
-        let x = s;
-        for (let v = 0; v < x; v++) {
-          const L = E[v];
-          for (; v + 1 < x && E[v + 1].candidate === L.candidate; )
-            E.splice(v + 1, 1), x--;
+        let _ = s;
+        for (let A = 0; A < _; A++) {
+          const P = E[A];
+          for (; A + 1 < _ && E[A + 1].candidate === P.candidate; )
+            E.splice(A + 1, 1), _--;
         }
-        for (let v = h; v < f; v += 6) {
-          const L = t[v + 2 * p];
-          for (let C = 0; C < x; C++) {
-            const M = E[C];
-            L >= M.candidate ? ps(v, t, M.rightCacheBounds) : (ps(v, t, M.leftCacheBounds), M.count++);
+        for (let A = h; A < f; A += 6) {
+          const P = t[A + 2 * p];
+          for (let I = 0; I < _; I++) {
+            const M = E[I];
+            P >= M.candidate ? ps(A, t, M.rightCacheBounds) : (ps(A, t, M.leftCacheBounds), M.count++);
           }
         }
-        for (let v = 0; v < x; v++) {
-          const L = E[v], C = L.count, M = s - L.count, D = L.leftCacheBounds, I = L.rightCacheBounds;
+        for (let A = 0; A < _; A++) {
+          const P = E[A], I = P.count, M = s - P.count, D = P.leftCacheBounds, C = P.rightCacheBounds;
           let N = 0;
-          C !== 0 && (N = Cn(D) / c);
+          I !== 0 && (N = Cn(D) / c);
           let O = 0;
-          M !== 0 && (O = Cn(I) / c);
-          const F = Lr + si * (N * C + O * M);
-          F < d && (o = p, d = F, a = L.candidate);
+          M !== 0 && (O = Cn(C) / c);
+          const F = Lr + si * (N * I + O * M);
+          F < d && (o = p, d = F, a = P.candidate);
         }
       } else {
-        for (let x = 0; x < Ct; x++) {
-          const v = zt[x];
-          v.count = 0, v.candidate = w + S + x * S;
-          const L = v.bounds;
-          for (let C = 0; C < 3; C++)
-            L[C] = 1 / 0, L[C + 3] = -1 / 0;
+        for (let _ = 0; _ < Ct; _++) {
+          const A = zt[_];
+          A.count = 0, A.candidate = y + x + _ * x;
+          const P = A.bounds;
+          for (let I = 0; I < 3; I++)
+            P[I] = 1 / 0, P[I + 3] = -1 / 0;
         }
-        for (let x = h; x < f; x += 6) {
-          let C = ~~((t[x + 2 * p] - w) / S);
-          C >= Ct && (C = Ct - 1);
-          const M = zt[C];
-          M.count++, ps(x, t, M.bounds);
+        for (let _ = h; _ < f; _ += 6) {
+          let I = ~~((t[_ + 2 * p] - y) / x);
+          I >= Ct && (I = Ct - 1);
+          const M = zt[I];
+          M.count++, ps(_, t, M.bounds);
         }
         const E = zt[Ct - 1];
         Dr(E.bounds, E.rightCacheBounds);
-        for (let x = Ct - 2; x >= 0; x--) {
-          const v = zt[x], L = zt[x + 1];
-          Nr(v.bounds, L.rightCacheBounds, v.rightCacheBounds);
+        for (let _ = Ct - 2; _ >= 0; _--) {
+          const A = zt[_], P = zt[_ + 1];
+          Nr(A.bounds, P.rightCacheBounds, A.rightCacheBounds);
         }
         let b = 0;
-        for (let x = 0; x < Ct - 1; x++) {
-          const v = zt[x], L = v.count, C = v.bounds, D = zt[x + 1].rightCacheBounds;
-          L !== 0 && (b === 0 ? Dr(C, ms) : Nr(C, ms, ms)), b += L;
-          let I = 0, N = 0;
-          b !== 0 && (I = Cn(ms) / c);
+        for (let _ = 0; _ < Ct - 1; _++) {
+          const A = zt[_], P = A.count, I = A.bounds, D = zt[_ + 1].rightCacheBounds;
+          P !== 0 && (b === 0 ? Dr(I, ms) : Nr(I, ms, ms)), b += P;
+          let C = 0, N = 0;
+          b !== 0 && (C = Cn(ms) / c);
           const O = s - b;
           O !== 0 && (N = Cn(D) / c);
-          const F = Lr + si * (I * b + N * O);
-          F < d && (o = p, d = F, a = v.candidate);
+          const F = Lr + si * (C * b + N * O);
+          F < d && (o = p, d = F, a = A.candidate);
         }
       }
     }
@@ -1727,8 +1727,8 @@ function Hc(i, e, t, n, s, r) {
         i[o * e + h] = i[a * e + h], i[a * e + h] = f;
       }
       for (let h = 0; h < 6; h++) {
-        const f = o - u, p = a - u, w = t[f * 6 + h];
-        t[f * 6 + h] = t[p * 6 + h], t[p * 6 + h] = w;
+        const f = o - u, p = a - u, y = t[f * 6 + h];
+        t[f * 6 + h] = t[p * 6 + h], t[p * 6 + h] = y;
       }
       o++, a--;
     } else
@@ -1766,27 +1766,27 @@ function Vc(i, e, t, n, s, r) {
     strategy: d,
     onProgress: u
   } = s, h = i.primitiveBuffer, f = i.primitiveBufferStride, p = new Float32Array(6);
-  let w = !1;
-  const _ = new ri();
-  return ii(e, t, n, _.boundingData, p), S(_, t, n, p), _;
-  function y(E) {
+  let y = !1;
+  const S = new ri();
+  return ii(e, t, n, S.boundingData, p), x(S, t, n, p), S;
+  function w(E) {
     u && u((E - r.offset) / r.count);
   }
-  function S(E, b, x, v = null, L = 0) {
-    if (!w && L >= o && (w = !0, a && console.warn(`BVH: Max depth of ${o} reached when generating BVH. Consider increasing maxDepth.`)), x <= c || L >= o)
-      return y(b + x), E.offset = b, E.count = x, E;
-    const C = Bc(E.boundingData, v, e, b, x, d);
-    if (C.axis === -1)
-      return y(b + x), E.offset = b, E.count = x, E;
-    const M = Hc(h, f, e, b, x, C);
-    if (M === b || M === b + x)
-      y(b + x), E.offset = b, E.count = x;
+  function x(E, b, _, A = null, P = 0) {
+    if (!y && P >= o && (y = !0, a && console.warn(`BVH: Max depth of ${o} reached when generating BVH. Consider increasing maxDepth.`)), _ <= c || P >= o)
+      return w(b + _), E.offset = b, E.count = _, E;
+    const I = Bc(E.boundingData, A, e, b, _, d);
+    if (I.axis === -1)
+      return w(b + _), E.offset = b, E.count = _, E;
+    const M = Hc(h, f, e, b, _, I);
+    if (M === b || M === b + _)
+      w(b + _), E.offset = b, E.count = _;
     else {
-      E.splitAxis = C.axis;
-      const D = new ri(), I = b, N = M - b;
-      E.left = D, ii(e, I, N, D.boundingData, p), S(D, I, N, p, L + 1);
-      const O = new ri(), F = M, V = x - N;
-      E.right = O, ii(e, F, V, O.boundingData, p), S(O, F, V, p, L + 1);
+      E.splitAxis = I.axis;
+      const D = new ri(), C = b, N = M - b;
+      E.left = D, ii(e, C, N, D.boundingData, p), x(D, C, N, p, P + 1);
+      const O = new ri(), F = M, V = _ - N;
+      E.right = O, ii(e, F, V, O.boundingData, p), x(O, F, V, p, P + 1);
     }
     return E;
   }
@@ -1842,7 +1842,7 @@ function Li(i, e, t, n, s = null, r = 0, o = 0) {
     const f = qe(i, d), p = Qe(u, c);
     return xe(i, a, Vt), n(f, p, !1, o, r + i / Oe, Vt);
   } else {
-    let I = function(O) {
+    let C = function(O) {
       const { uint16Array: F, uint32Array: V } = be;
       let te = O * 2;
       for (; !De(te, F); )
@@ -1856,21 +1856,21 @@ function Li(i, e, t, n, s = null, r = 0, o = 0) {
       return qe(O, V) + Qe(te, F);
     };
     const f = Fe(i), p = ze(i, d);
-    let w = f, _ = p, y, S, E, b;
-    if (s && (E = Vt, b = _n, xe(w, a, E), xe(_, a, b), y = s(E), S = s(b), S < y)) {
-      w = p, _ = f;
-      const O = y;
-      y = S, S = O, E = b;
-    }
-    E || (E = Vt, xe(w, a, E));
-    const x = De(w * 2, c), v = t(E, x, y, o + 1, r + w / Oe);
-    let L;
-    if (v === Pr) {
-      const O = I(w), V = N(w) - O;
-      L = n(O, V, !0, o + 1, r + w / Oe, E);
+    let y = f, S = p, w, x, E, b;
+    if (s && (E = Vt, b = _n, xe(y, a, E), xe(S, a, b), w = s(E), x = s(b), x < w)) {
+      y = p, S = f;
+      const O = w;
+      w = x, x = O, E = b;
+    }
+    E || (E = Vt, xe(y, a, E));
+    const _ = De(y * 2, c), A = t(E, _, w, o + 1, r + y / Oe);
+    let P;
+    if (A === Pr) {
+      const O = C(y), V = N(y) - O;
+      P = n(O, V, !0, o + 1, r + y / Oe, E);
     } else
-      L = v && Li(
-        w,
+      P = A && Li(
+        y,
         e,
         t,
         n,
@@ -1878,16 +1878,16 @@ function Li(i, e, t, n, s = null, r = 0, o = 0) {
         r,
         o + 1
       );
-    if (L) return !0;
-    b = _n, xe(_, a, b);
-    const C = De(_ * 2, c), M = t(b, C, S, o + 1, r + _ / Oe);
+    if (P) return !0;
+    b = _n, xe(S, a, b);
+    const I = De(S * 2, c), M = t(b, I, x, o + 1, r + S / Oe);
     let D;
     if (M === Pr) {
-      const O = I(_), V = N(_) - O;
-      D = n(O, V, !0, o + 1, r + _ / Oe, b);
+      const O = C(S), V = N(S) - O;
+      D = n(O, V, !0, o + 1, r + S / Oe, b);
     } else
       D = M && Li(
-        _,
+        S,
         e,
         t,
         n,
@@ -1911,7 +1911,7 @@ function Xc(i, e, t, n) {
     Zn.setBuffer(s[u]), c = 0;
     const f = Ht.getPrimitive();
     xe(0, Zn.float32Array, f), f.applyMatrix4(d);
-    for (let p = 0, w = r.length; p < w && (Gs.setBuffer(r[p]), o = mt(
+    for (let p = 0, y = r.length; p < y && (Gs.setBuffer(r[p]), o = mt(
       0,
       0,
       t,
@@ -1932,35 +1932,35 @@ function Xc(i, e, t, n) {
 function mt(i, e, t, n, s, r = 0, o = 0, a = 0, c = 0, d = null, u = !1) {
   let h, f;
   u ? (h = Gs, f = Zn) : (h = Zn, f = Gs);
-  const p = h.float32Array, w = h.uint32Array, _ = h.uint16Array, y = f.float32Array, S = f.uint32Array, E = f.uint16Array, b = i * 2, x = e * 2, v = De(b, _), L = De(x, E);
-  let C = !1;
-  if (L && v)
-    u ? C = s(
-      qe(e, S),
+  const p = h.float32Array, y = h.uint32Array, S = h.uint16Array, w = f.float32Array, x = f.uint32Array, E = f.uint16Array, b = i * 2, _ = e * 2, A = De(b, S), P = De(_, E);
+  let I = !1;
+  if (P && A)
+    u ? I = s(
+      qe(e, x),
       Qe(e * 2, E),
-      qe(i, w),
-      Qe(i * 2, _),
+      qe(i, y),
+      Qe(i * 2, S),
       c,
       o + e / Oe,
       a,
       r + i / Oe
-    ) : C = s(
-      qe(i, w),
-      Qe(i * 2, _),
-      qe(e, S),
+    ) : I = s(
+      qe(i, y),
+      Qe(i * 2, S),
+      qe(e, x),
       Qe(e * 2, E),
       a,
       r + i / Oe,
       c,
       o + e / Oe
     );
-  else if (L) {
+  else if (P) {
     const M = Ht.getPrimitive();
-    xe(e, y, M), M.applyMatrix4(t);
-    const D = Fe(i), I = ze(i, w);
-    xe(D, p, ln), xe(I, p, hn);
+    xe(e, w, M), M.applyMatrix4(t);
+    const D = Fe(i), C = ze(i, y);
+    xe(D, p, ln), xe(C, p, hn);
     const N = M.intersectsBox(ln), O = M.intersectsBox(hn);
-    C = N && mt(
+    I = N && mt(
       e,
       D,
       n,
@@ -1974,7 +1974,7 @@ function mt(i, e, t, n, s, r = 0, o = 0, a = 0, c = 0, d = null, u = !1) {
       !u
     ) || O && mt(
       e,
-      I,
+      C,
       n,
       t,
       s,
@@ -1986,11 +1986,11 @@ function mt(i, e, t, n, s, r = 0, o = 0, a = 0, c = 0, d = null, u = !1) {
       !u
     ), Ht.releasePrimitive(M);
   } else {
-    const M = Fe(e), D = ze(e, S);
-    xe(M, y, oi), xe(D, y, ai);
-    const I = d.intersectsBox(oi), N = d.intersectsBox(ai);
-    if (I && N)
-      C = mt(
+    const M = Fe(e), D = ze(e, x);
+    xe(M, w, oi), xe(D, w, ai);
+    const C = d.intersectsBox(oi), N = d.intersectsBox(ai);
+    if (C && N)
+      I = mt(
         i,
         M,
         t,
@@ -2015,9 +2015,9 @@ function mt(i, e, t, n, s, r = 0, o = 0, a = 0, c = 0, d = null, u = !1) {
         d,
         u
       );
-    else if (I)
-      if (v)
-        C = mt(
+    else if (C)
+      if (A)
+        I = mt(
           i,
           M,
           t,
@@ -2033,10 +2033,10 @@ function mt(i, e, t, n, s, r = 0, o = 0, a = 0, c = 0, d = null, u = !1) {
       else {
         const O = Ht.getPrimitive();
         O.copy(oi).applyMatrix4(t);
-        const F = Fe(i), V = ze(i, w);
+        const F = Fe(i), V = ze(i, y);
         xe(F, p, ln), xe(V, p, hn);
         const te = O.intersectsBox(ln), re = O.intersectsBox(hn);
-        C = te && mt(
+        I = te && mt(
           M,
           F,
           n,
@@ -2063,8 +2063,8 @@ function mt(i, e, t, n, s, r = 0, o = 0, a = 0, c = 0, d = null, u = !1) {
         ), Ht.releasePrimitive(O);
       }
     else if (N)
-      if (v)
-        C = mt(
+      if (A)
+        I = mt(
           i,
           D,
           t,
@@ -2080,10 +2080,10 @@ function mt(i, e, t, n, s, r = 0, o = 0, a = 0, c = 0, d = null, u = !1) {
       else {
         const O = Ht.getPrimitive();
         O.copy(ai).applyMatrix4(t);
-        const F = Fe(i), V = ze(i, w);
+        const F = Fe(i), V = ze(i, y);
         xe(F, p, ln), xe(V, p, hn);
         const te = O.intersectsBox(ln), re = O.intersectsBox(hn);
-        C = te && mt(
+        I = te && mt(
           D,
           F,
           n,
@@ -2110,7 +2110,7 @@ function mt(i, e, t, n, s, r = 0, o = 0, a = 0, c = 0, d = null, u = !1) {
         ), Ht.releasePrimitive(O);
       }
   }
-  return C;
+  return I;
 }
 const kr = /* @__PURE__ */ new _t(), un = /* @__PURE__ */ new Float32Array(6);
 class Yc {
@@ -2137,8 +2137,8 @@ class Yc {
     let r = 1 / 0, o = 1 / 0, a = 1 / 0, c = -1 / 0, d = -1 / 0, u = -1 / 0;
     for (let h = e, f = e + t; h < f; h++) {
       this.writePrimitiveBounds(h, un, 0);
-      const [p, w, _, y, S, E] = un;
-      p < r && (r = p), y > c && (c = y), w < o && (o = w), S > d && (d = S), _ < a && (a = _), E > u && (u = E);
+      const [p, y, S, w, x, E] = un;
+      p < r && (r = p), w > c && (c = w), y < o && (o = y), x > d && (d = x), S < a && (a = S), E > u && (u = E);
     }
     return n[s + 0] = r, n[s + 1] = o, n[s + 2] = a, n[s + 3] = c, n[s + 4] = d, n[s + 5] = u, n;
   }
@@ -2146,8 +2146,8 @@ class Yc {
     const s = n.offset || 0;
     for (let r = e, o = e + t; r < o; r++) {
       this.writePrimitiveBounds(r, un, 0);
-      const [a, c, d, u, h, f] = un, p = (a + u) / 2, w = (c + h) / 2, _ = (d + f) / 2, y = (u - a) / 2, S = (h - c) / 2, E = (f - d) / 2, b = (r - s) * 6;
-      n[b + 0] = p, n[b + 1] = y + (Math.abs(p) + y) * Fs, n[b + 2] = w, n[b + 3] = S + (Math.abs(w) + S) * Fs, n[b + 4] = _, n[b + 5] = E + (Math.abs(_) + E) * Fs;
+      const [a, c, d, u, h, f] = un, p = (a + u) / 2, y = (c + h) / 2, S = (d + f) / 2, w = (u - a) / 2, x = (h - c) / 2, E = (f - d) / 2, b = (r - s) * 6;
+      n[b + 0] = p, n[b + 1] = w + (Math.abs(p) + w) * Fs, n[b + 2] = y, n[b + 3] = x + (Math.abs(y) + x) * Fs, n[b + 4] = S, n[b + 5] = E + (Math.abs(S) + E) * Fs;
     }
     return n;
   }
@@ -2207,13 +2207,13 @@ class Yc {
       for (let d = c - 1; d >= 0; d--) {
         const u = d * Oe, h = u * 2;
         if (De(h, o)) {
-          const p = qe(u, r), w = Qe(h, o);
-          this.writePrimitiveRangeBounds(p, w, un, 0), a.set(un, u);
+          const p = qe(u, r), y = Qe(h, o);
+          this.writePrimitiveRangeBounds(p, y, un, 0), a.set(un, u);
         } else {
-          const p = Fe(u), w = ze(u, r);
-          for (let _ = 0; _ < 3; _++) {
-            const y = a[p + _], S = a[p + _ + 3], E = a[w + _], b = a[w + _ + 3];
-            a[u + _] = y < E ? y : E, a[u + _ + 3] = S > b ? S : b;
+          const p = Fe(u), y = ze(u, r);
+          for (let S = 0; S < 3; S++) {
+            const w = a[p + S], x = a[p + S + 3], E = a[y + S], b = a[y + S + 3];
+            a[u + S] = w < E ? w : E, a[u + S + 3] = x > b ? x : b;
           }
         }
       }
@@ -2255,8 +2255,8 @@ class Yc {
     } = e;
     if (s && r) {
       const h = s;
-      s = (f, p, w, _, y) => h(f, p, w, _, y) ? !0 : a(f, p, this, r, w, _, o);
-    } else s || (r ? s = (h, f, p, w) => a(h, f, this, r, p, w, o) : s = (h, f, p) => p);
+      s = (f, p, y, S, w) => h(f, p, y, S, w) ? !0 : a(f, p, this, r, y, S, o);
+    } else s || (r ? s = (h, f, p, y) => a(h, f, this, r, p, y, o) : s = (h, f, p) => p);
     let c = !1, d = 0;
     const u = this._roots;
     for (let h = 0, f = u.length; h < f; h++) {
@@ -2322,8 +2322,8 @@ function Fr(i, e, t) {
     return [n];
   const r = [], o = n.offset, a = n.offset + n.count, c = ar(i) / t, d = [];
   for (const f of s) {
-    const { offset: p, count: w } = f, _ = p, y = isFinite(w) ? w : c - p, S = p + y;
-    _ < a && S > o && (d.push({ pos: Math.max(o, _), isStart: !0 }), d.push({ pos: Math.min(a, S), isStart: !1 }));
+    const { offset: p, count: y } = f, S = p, w = isFinite(y) ? y : c - p, x = p + w;
+    S < a && x > o && (d.push({ pos: Math.max(o, S), isStart: !0 }), d.push({ pos: Math.min(a, x), isStart: !1 }));
   }
   d.sort((f, p) => f.pos !== p.pos ? f.pos - p.pos : f.type === "end" ? -1 : 1);
   let u = 0, h = null;
@@ -2442,9 +2442,9 @@ const sl = /* @__PURE__ */ (function() {
   return function(s, r, o) {
     const a = s.start, c = i, d = r.start, u = e;
     t.subVectors(a, d), i.subVectors(s.end, s.start), e.subVectors(r.end, r.start);
-    const h = t.dot(u), f = u.dot(c), p = u.dot(u), w = t.dot(c), y = c.dot(c) * p - f * f;
-    let S, E;
-    y !== 0 ? S = (h * f - w * p) / y : S = 0, E = (h + S * f) / p, o.x = S, o.y = E;
+    const h = t.dot(u), f = u.dot(c), p = u.dot(u), y = t.dot(c), w = c.dot(c) * p - f * f;
+    let x, E;
+    w !== 0 ? x = (h * f - y * p) / w : x = 0, E = (h + x * f) / p, o.x = x, o.y = E;
   };
 })(), cr = /* @__PURE__ */ (function() {
   const i = /* @__PURE__ */ new pe(), e = /* @__PURE__ */ new q(), t = /* @__PURE__ */ new q();
@@ -2480,10 +2480,10 @@ const sl = /* @__PURE__ */ (function() {
   return function(r, o) {
     const { radius: a, center: c } = r, { a: d, b: u, c: h } = o;
     if (n.start = d, n.end = u, n.closestPointToPoint(c, !0, i).distanceTo(c) <= a || (n.start = d, n.end = h, n.closestPointToPoint(c, !0, i).distanceTo(c) <= a) || (n.start = u, n.end = h, n.closestPointToPoint(c, !0, i).distanceTo(c) <= a)) return !0;
-    const _ = o.getPlane(t);
-    if (Math.abs(_.distanceToPoint(c)) <= a) {
-      const S = _.projectPoint(c, e);
-      if (o.containsPoint(S)) return !0;
+    const S = o.getPlane(t);
+    if (Math.abs(S.distanceToPoint(c)) <= a) {
+      const x = S.projectPoint(c, e);
+      if (o.containsPoint(x)) return !0;
     }
     return !1;
   };
@@ -2510,10 +2510,10 @@ class Tt extends En {
     d.subVectors(e, t), u.setFromPoints(d, s);
     const h = r[2], f = o[2];
     h.subVectors(t, n), f.setFromPoints(h, s);
-    const p = r[3], w = o[3];
-    p.subVectors(n, e), w.setFromPoints(p, s);
-    const _ = d.length(), y = h.length(), S = p.length();
-    this.isDegenerateIntoPoint = !1, this.isDegenerateIntoSegment = !1, _ < Pt ? y < Pt || S < Pt ? this.isDegenerateIntoPoint = !0 : (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(e), this.degenerateSegment.end.copy(n)) : y < Pt ? S < Pt ? this.isDegenerateIntoPoint = !0 : (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(t), this.degenerateSegment.end.copy(e)) : S < Pt && (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(n), this.degenerateSegment.end.copy(t)), this.plane.setFromNormalAndCoplanarPoint(a, e), this.needsUpdate = !1;
+    const p = r[3], y = o[3];
+    p.subVectors(n, e), y.setFromPoints(p, s);
+    const S = d.length(), w = h.length(), x = p.length();
+    this.isDegenerateIntoPoint = !1, this.isDegenerateIntoSegment = !1, S < Pt ? w < Pt || x < Pt ? this.isDegenerateIntoPoint = !0 : (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(e), this.degenerateSegment.end.copy(n)) : w < Pt ? x < Pt ? this.isDegenerateIntoPoint = !0 : (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(t), this.degenerateSegment.end.copy(e)) : x < Pt && (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(n), this.degenerateSegment.end.copy(t)), this.plane.setFromNormalAndCoplanarPoint(a, e), this.needsUpdate = !1;
   }
 }
 Tt.prototype.closestPointToSegment = /* @__PURE__ */ (function() {
@@ -2530,87 +2530,87 @@ Tt.prototype.closestPointToSegment = /* @__PURE__ */ (function() {
 })();
 Tt.prototype.intersectsTriangle = /* @__PURE__ */ (function() {
   const i = /* @__PURE__ */ new Tt(), e = /* @__PURE__ */ new Nt(), t = /* @__PURE__ */ new Nt(), n = /* @__PURE__ */ new q(), s = /* @__PURE__ */ new q(), r = /* @__PURE__ */ new q(), o = /* @__PURE__ */ new q(), a = /* @__PURE__ */ new Dt(), c = /* @__PURE__ */ new Dt(), d = /* @__PURE__ */ new q(), u = /* @__PURE__ */ new pe(), h = /* @__PURE__ */ new pe();
-  function f(b, x, v, L) {
-    const C = n;
-    !b.isDegenerateIntoPoint && !b.isDegenerateIntoSegment ? C.copy(b.plane.normal) : C.copy(x.plane.normal);
+  function f(b, _, A, P) {
+    const I = n;
+    !b.isDegenerateIntoPoint && !b.isDegenerateIntoSegment ? I.copy(b.plane.normal) : I.copy(_.plane.normal);
     const M = b.satBounds, D = b.satAxes;
     for (let O = 1; O < 4; O++) {
       const F = M[O], V = D[O];
-      if (e.setFromPoints(V, x.points), F.isSeparated(e) || (o.copy(C).cross(V), e.setFromPoints(o, b.points), t.setFromPoints(o, x.points), e.isSeparated(t))) return !1;
+      if (e.setFromPoints(V, _.points), F.isSeparated(e) || (o.copy(I).cross(V), e.setFromPoints(o, b.points), t.setFromPoints(o, _.points), e.isSeparated(t))) return !1;
     }
-    const I = x.satBounds, N = x.satAxes;
+    const C = _.satBounds, N = _.satAxes;
     for (let O = 1; O < 4; O++) {
-      const F = I[O], V = N[O];
-      if (e.setFromPoints(V, b.points), F.isSeparated(e) || (o.crossVectors(C, V), e.setFromPoints(o, b.points), t.setFromPoints(o, x.points), e.isSeparated(t))) return !1;
+      const F = C[O], V = N[O];
+      if (e.setFromPoints(V, b.points), F.isSeparated(e) || (o.crossVectors(I, V), e.setFromPoints(o, b.points), t.setFromPoints(o, _.points), e.isSeparated(t))) return !1;
     }
-    return v && (L || console.warn("ExtendedTriangle.intersectsTriangle: Triangles are coplanar which does not support an output edge. Setting edge to 0, 0, 0."), v.start.set(0, 0, 0), v.end.set(0, 0, 0)), !0;
+    return A && (P || console.warn("ExtendedTriangle.intersectsTriangle: Triangles are coplanar which does not support an output edge. Setting edge to 0, 0, 0."), A.start.set(0, 0, 0), A.end.set(0, 0, 0)), !0;
   }
-  function p(b, x, v, L, C, M, D, I, N, O, F) {
-    let V = D / (D - I);
-    O.x = L + (C - L) * V, F.start.subVectors(x, b).multiplyScalar(V).add(b), V = D / (D - N), O.y = L + (M - L) * V, F.end.subVectors(v, b).multiplyScalar(V).add(b);
+  function p(b, _, A, P, I, M, D, C, N, O, F) {
+    let V = D / (D - C);
+    O.x = P + (I - P) * V, F.start.subVectors(_, b).multiplyScalar(V).add(b), V = D / (D - N), O.y = P + (M - P) * V, F.end.subVectors(A, b).multiplyScalar(V).add(b);
   }
-  function w(b, x, v, L, C, M, D, I, N, O, F) {
-    if (C > 0)
-      p(b.c, b.a, b.b, L, x, v, N, D, I, O, F);
+  function y(b, _, A, P, I, M, D, C, N, O, F) {
+    if (I > 0)
+      p(b.c, b.a, b.b, P, _, A, N, D, C, O, F);
     else if (M > 0)
-      p(b.b, b.a, b.c, v, x, L, I, D, N, O, F);
-    else if (I * N > 0 || D != 0)
-      p(b.a, b.b, b.c, x, v, L, D, I, N, O, F);
-    else if (I != 0)
-      p(b.b, b.a, b.c, v, x, L, I, D, N, O, F);
+      p(b.b, b.a, b.c, A, _, P, C, D, N, O, F);
+    else if (C * N > 0 || D != 0)
+      p(b.a, b.b, b.c, _, A, P, D, C, N, O, F);
+    else if (C != 0)
+      p(b.b, b.a, b.c, A, _, P, C, D, N, O, F);
     else if (N != 0)
-      p(b.c, b.a, b.b, L, x, v, N, D, I, O, F);
+      p(b.c, b.a, b.b, P, _, A, N, D, C, O, F);
     else
       return !0;
     return !1;
   }
-  function _(b, x, v, L) {
-    const C = x.degenerateSegment, M = b.plane.distanceToPoint(C.start), D = b.plane.distanceToPoint(C.end);
-    return ot(M) ? ot(D) ? f(b, x, v, L) : (v && (v.start.copy(C.start), v.end.copy(C.start)), b.containsPoint(C.start)) : ot(D) ? (v && (v.start.copy(C.end), v.end.copy(C.end)), b.containsPoint(C.end)) : b.plane.intersectLine(C, n) != null ? (v && (v.start.copy(n), v.end.copy(n)), b.containsPoint(n)) : !1;
+  function S(b, _, A, P) {
+    const I = _.degenerateSegment, M = b.plane.distanceToPoint(I.start), D = b.plane.distanceToPoint(I.end);
+    return ot(M) ? ot(D) ? f(b, _, A, P) : (A && (A.start.copy(I.start), A.end.copy(I.start)), b.containsPoint(I.start)) : ot(D) ? (A && (A.start.copy(I.end), A.end.copy(I.end)), b.containsPoint(I.end)) : b.plane.intersectLine(I, n) != null ? (A && (A.start.copy(n), A.end.copy(n)), b.containsPoint(n)) : !1;
   }
-  function y(b, x, v) {
-    const L = x.a;
-    return ot(b.plane.distanceToPoint(L)) && b.containsPoint(L) ? (v && (v.start.copy(L), v.end.copy(L)), !0) : !1;
+  function w(b, _, A) {
+    const P = _.a;
+    return ot(b.plane.distanceToPoint(P)) && b.containsPoint(P) ? (A && (A.start.copy(P), A.end.copy(P)), !0) : !1;
   }
-  function S(b, x, v) {
-    const L = b.degenerateSegment, C = x.a;
-    return L.closestPointToPoint(C, !0, n), C.distanceToSquared(n) < zr ? (v && (v.start.copy(C), v.end.copy(C)), !0) : !1;
+  function x(b, _, A) {
+    const P = b.degenerateSegment, I = _.a;
+    return P.closestPointToPoint(I, !0, n), I.distanceToSquared(n) < zr ? (A && (A.start.copy(I), A.end.copy(I)), !0) : !1;
   }
-  function E(b, x, v, L) {
+  function E(b, _, A, P) {
     if (b.isDegenerateIntoSegment)
-      if (x.isDegenerateIntoSegment) {
-        const C = b.degenerateSegment, M = x.degenerateSegment, D = s, I = r;
-        C.delta(D), M.delta(I);
-        const N = n.subVectors(M.start, C.start), O = D.x * I.y - D.y * I.x;
+      if (_.isDegenerateIntoSegment) {
+        const I = b.degenerateSegment, M = _.degenerateSegment, D = s, C = r;
+        I.delta(D), M.delta(C);
+        const N = n.subVectors(M.start, I.start), O = D.x * C.y - D.y * C.x;
         if (ot(O))
           return !1;
-        const F = (N.x * I.y - N.y * I.x) / O, V = -(D.x * N.y - D.y * N.x) / O;
+        const F = (N.x * C.y - N.y * C.x) / O, V = -(D.x * N.y - D.y * N.x) / O;
         if (F < 0 || F > 1 || V < 0 || V > 1)
           return !1;
-        const te = C.start.z + D.z * F, re = M.start.z + I.z * V;
-        return ot(te - re) ? (v && (v.start.copy(C.start).addScaledVector(D, F), v.end.copy(C.start).addScaledVector(D, F)), !0) : !1;
-      } else return x.isDegenerateIntoPoint ? S(b, x, v) : _(x, b, v, L);
+        const te = I.start.z + D.z * F, re = M.start.z + C.z * V;
+        return ot(te - re) ? (A && (A.start.copy(I.start).addScaledVector(D, F), A.end.copy(I.start).addScaledVector(D, F)), !0) : !1;
+      } else return _.isDegenerateIntoPoint ? x(b, _, A) : S(_, b, A, P);
     else {
       if (b.isDegenerateIntoPoint)
-        return x.isDegenerateIntoPoint ? x.a.distanceToSquared(b.a) < zr ? (v && (v.start.copy(b.a), v.end.copy(b.a)), !0) : !1 : x.isDegenerateIntoSegment ? S(x, b, v) : y(x, b, v);
-      if (x.isDegenerateIntoPoint)
-        return y(b, x, v);
-      if (x.isDegenerateIntoSegment)
-        return _(b, x, v, L);
-    }
-  }
-  return function(x, v = null, L = !1) {
-    this.needsUpdate && this.update(), x.isExtendedTriangle ? x.needsUpdate && x.update() : (i.copy(x), i.update(), x = i);
-    const C = E(this, x, v, L);
-    if (C !== void 0)
-      return C;
-    const M = this.plane, D = x.plane;
-    let I = D.distanceToPoint(this.a), N = D.distanceToPoint(this.b), O = D.distanceToPoint(this.c);
-    ot(I) && (I = 0), ot(N) && (N = 0), ot(O) && (O = 0);
-    const F = I * N, V = I * O;
+        return _.isDegenerateIntoPoint ? _.a.distanceToSquared(b.a) < zr ? (A && (A.start.copy(b.a), A.end.copy(b.a)), !0) : !1 : _.isDegenerateIntoSegment ? x(_, b, A) : w(_, b, A);
+      if (_.isDegenerateIntoPoint)
+        return w(b, _, A);
+      if (_.isDegenerateIntoSegment)
+        return S(b, _, A, P);
+    }
+  }
+  return function(_, A = null, P = !1) {
+    this.needsUpdate && this.update(), _.isExtendedTriangle ? _.needsUpdate && _.update() : (i.copy(_), i.update(), _ = i);
+    const I = E(this, _, A, P);
+    if (I !== void 0)
+      return I;
+    const M = this.plane, D = _.plane;
+    let C = D.distanceToPoint(this.a), N = D.distanceToPoint(this.b), O = D.distanceToPoint(this.c);
+    ot(C) && (C = 0), ot(N) && (N = 0), ot(O) && (O = 0);
+    const F = C * N, V = C * O;
     if (F > 0 && V > 0)
       return !1;
-    let te = M.distanceToPoint(x.a), re = M.distanceToPoint(x.b), Ne = M.distanceToPoint(x.c);
+    let te = M.distanceToPoint(_.a), re = M.distanceToPoint(_.b), Ne = M.distanceToPoint(_.c);
     ot(te) && (te = 0), ot(re) && (re = 0), ot(Ne) && (Ne = 0);
     const ut = te * re, Re = te * Ne;
     if (ut > 0 && Re > 0)
@@ -2620,11 +2620,11 @@ Tt.prototype.intersectsTriangle = /* @__PURE__ */ (function() {
     let Ge = 0, Ae = Math.abs(Ue.x);
     const ge = Math.abs(Ue.y);
     ge > Ae && (Ae = ge, Ge = 1), Math.abs(Ue.z) > Ae && (Ge = 2);
-    const Ve = rl[Ge], kt = this.a[Ve], me = this.b[Ve], dt = this.c[Ve], ft = x.a[Ve], An = x.b[Ve], rn = x.c[Ve];
-    if (w(this, kt, me, dt, F, V, I, N, O, u, a))
-      return f(this, x, v, L);
-    if (w(x, ft, An, rn, ut, Re, te, re, Ne, h, c))
-      return f(this, x, v, L);
+    const Ve = rl[Ge], kt = this.a[Ve], me = this.b[Ve], dt = this.c[Ve], ft = _.a[Ve], An = _.b[Ve], rn = _.c[Ve];
+    if (y(this, kt, me, dt, F, V, C, N, O, u, a))
+      return f(this, _, A, P);
+    if (y(_, ft, An, rn, ut, Re, te, re, Ne, h, c))
+      return f(this, _, A, P);
     if (u.y < u.x) {
       const It = u.y;
       u.y = u.x, u.x = It, d.copy(a.start), a.start.copy(a.end), a.end.copy(d);
@@ -2633,7 +2633,7 @@ Tt.prototype.intersectsTriangle = /* @__PURE__ */ (function() {
       const It = h.y;
       h.y = h.x, h.x = It, d.copy(c.start), c.start.copy(c.end), c.end.copy(d);
     }
-    return u.y < h.x || h.y < u.x ? !1 : (v && (h.x > u.x ? v.start.copy(c.start) : v.start.copy(a.start), h.y < u.y ? v.end.copy(c.end) : v.end.copy(a.end)), !0);
+    return u.y < h.x || h.y < u.x ? !1 : (A && (h.x > u.x ? A.start.copy(c.start) : A.start.copy(a.start), h.y < u.y ? A.end.copy(c.end) : A.end.copy(a.end)), !0);
   };
 })();
 Tt.prototype.distanceToPoint = /* @__PURE__ */ (function() {
@@ -2651,19 +2651,19 @@ Tt.prototype.distanceToTriangle = /* @__PURE__ */ (function() {
     let u = 1 / 0;
     for (let h = 0; h < 3; h++) {
       let f;
-      const p = t[h], w = o[p];
-      this.closestPointToPoint(w, i), f = w.distanceToSquared(i), f < u && (u = f, a && a.copy(i), c && c.copy(w));
-      const _ = this[p];
-      o.closestPointToPoint(_, i), f = _.distanceToSquared(i), f < u && (u = f, a && a.copy(_), c && c.copy(i));
+      const p = t[h], y = o[p];
+      this.closestPointToPoint(y, i), f = y.distanceToSquared(i), f < u && (u = f, a && a.copy(i), c && c.copy(y));
+      const S = this[p];
+      o.closestPointToPoint(S, i), f = S.distanceToSquared(i), f < u && (u = f, a && a.copy(S), c && c.copy(i));
     }
     for (let h = 0; h < 3; h++) {
       const f = t[h], p = t[(h + 1) % 3];
       n.set(this[f], this[p]);
-      for (let w = 0; w < 3; w++) {
-        const _ = t[w], y = t[(w + 1) % 3];
-        s.set(o[_], o[y]), cr(n, s, i, e);
-        const S = i.distanceToSquared(e);
-        S < u && (u = S, a && a.copy(i), c && c.copy(e));
+      for (let y = 0; y < 3; y++) {
+        const S = t[y], w = t[(y + 1) % 3];
+        s.set(o[S], o[w]), cr(n, s, i, e);
+        const x = i.distanceToSquared(e);
+        x < u && (u = x, a && a.copy(i), c && c.copy(e));
       }
     }
     return Math.sqrt(u);
@@ -2724,19 +2724,19 @@ Je.prototype.intersectsTriangle = /* @__PURE__ */ (function() {
     const a = this.satBounds, c = this.satAxes;
     e[0] = o.a, e[1] = o.b, e[2] = o.c;
     for (let f = 0; f < 3; f++) {
-      const p = a[f], w = c[f];
-      if (t.setFromPoints(w, e), p.isSeparated(t)) return !1;
+      const p = a[f], y = c[f];
+      if (t.setFromPoints(y, e), p.isSeparated(t)) return !1;
     }
     const d = o.satBounds, u = o.satAxes, h = this.points;
     for (let f = 0; f < 3; f++) {
-      const p = d[f], w = u[f];
-      if (t.setFromPoints(w, h), p.isSeparated(t)) return !1;
+      const p = d[f], y = u[f];
+      if (t.setFromPoints(y, h), p.isSeparated(t)) return !1;
     }
     for (let f = 0; f < 3; f++) {
       const p = c[f];
-      for (let w = 0; w < 4; w++) {
-        const _ = u[w];
-        if (s.crossVectors(p, _), t.setFromPoints(s, e), n.setFromPoints(s, h), t.isSeparated(n)) return !1;
+      for (let y = 0; y < 4; y++) {
+        const S = u[y];
+        if (s.crossVectors(p, S), t.setFromPoints(s, e), n.setFromPoints(s, h), t.isSeparated(n)) return !1;
       }
     }
     return !0;
@@ -2759,42 +2759,42 @@ Je.prototype.distanceToBox = /* @__PURE__ */ (function() {
     if (this.needsUpdate && this.update(), this.intersectsBox(o))
       return (c || d) && (o.getCenter(s), this.closestPointToPoint(s, n), o.closestPointToPoint(n, s), c && c.copy(n), d && d.copy(s)), 0;
     const u = a * a, h = o.min, f = o.max, p = this.points;
-    let w = 1 / 0;
-    for (let y = 0; y < 8; y++) {
-      const S = p[y];
-      s.copy(S).clamp(h, f);
-      const E = S.distanceToSquared(s);
-      if (E < w && (w = E, c && c.copy(S), d && d.copy(s), E < u))
+    let y = 1 / 0;
+    for (let w = 0; w < 8; w++) {
+      const x = p[w];
+      s.copy(x).clamp(h, f);
+      const E = x.distanceToSquared(s);
+      if (E < y && (y = E, c && c.copy(x), d && d.copy(s), E < u))
         return Math.sqrt(E);
     }
-    let _ = 0;
-    for (let y = 0; y < 3; y++)
-      for (let S = 0; S <= 1; S++)
+    let S = 0;
+    for (let w = 0; w < 3; w++)
+      for (let x = 0; x <= 1; x++)
         for (let E = 0; E <= 1; E++) {
-          const b = (y + 1) % 3, x = (y + 2) % 3, v = S << b | E << x, L = 1 << y | S << b | E << x, C = p[v], M = p[L];
-          e[_].set(C, M);
-          const I = i[y], N = i[b], O = i[x], F = t[_], V = F.start, te = F.end;
-          V[I] = h[I], V[N] = S ? h[N] : f[N], V[O] = E ? h[O] : f[N], te[I] = f[I], te[N] = S ? h[N] : f[N], te[O] = E ? h[O] : f[N], _++;
+          const b = (w + 1) % 3, _ = (w + 2) % 3, A = x << b | E << _, P = 1 << w | x << b | E << _, I = p[A], M = p[P];
+          e[S].set(I, M);
+          const C = i[w], N = i[b], O = i[_], F = t[S], V = F.start, te = F.end;
+          V[C] = h[C], V[N] = x ? h[N] : f[N], V[O] = E ? h[O] : f[N], te[C] = f[C], te[N] = x ? h[N] : f[N], te[O] = E ? h[O] : f[N], S++;
         }
-    for (let y = 0; y <= 1; y++)
-      for (let S = 0; S <= 1; S++)
+    for (let w = 0; w <= 1; w++)
+      for (let x = 0; x <= 1; x++)
         for (let E = 0; E <= 1; E++) {
-          s.x = y ? f.x : h.x, s.y = S ? f.y : h.y, s.z = E ? f.z : h.z, this.closestPointToPoint(s, n);
+          s.x = w ? f.x : h.x, s.y = x ? f.y : h.y, s.z = E ? f.z : h.z, this.closestPointToPoint(s, n);
           const b = s.distanceToSquared(n);
-          if (b < w && (w = b, c && c.copy(n), d && d.copy(s), b < u))
+          if (b < y && (y = b, c && c.copy(n), d && d.copy(s), b < u))
             return Math.sqrt(b);
         }
-    for (let y = 0; y < 12; y++) {
-      const S = e[y];
+    for (let w = 0; w < 12; w++) {
+      const x = e[w];
       for (let E = 0; E < 12; E++) {
         const b = t[E];
-        cr(S, b, n, s);
-        const x = n.distanceToSquared(s);
-        if (x < w && (w = x, c && c.copy(n), d && d.copy(s), x < u))
-          return Math.sqrt(x);
+        cr(x, b, n, s);
+        const _ = n.distanceToSquared(s);
+        if (_ < y && (y = _, c && c.copy(n), d && d.copy(s), _ < u))
+          return Math.sqrt(_);
       }
     }
-    return Math.sqrt(w);
+    return Math.sqrt(y);
   };
 })();
 class ol extends or {
@@ -2871,22 +2871,22 @@ function qs(i, e, t, n, s, r, o) {
   let c = a + 0, d = a + 1, u = a + 2;
   const { index: h, groups: f } = i;
   i.index && (c = h.getX(c), d = h.getX(d), u = h.getX(u));
-  const { position: p, normal: w, uv: _, uv1: y } = i.attributes;
+  const { position: p, normal: y, uv: S, uv1: w } = i.attributes;
   if (Array.isArray(e)) {
-    const S = n * 3;
+    const x = n * 3;
     for (let E = 0, b = f.length; E < b; E++) {
-      const { start: x, count: v, materialIndex: L } = f[E];
-      if (S >= x && S < x + v) {
-        const C = Gr(e[L]), M = jr(t, p, w, _, y, c, d, u, C, r, o);
+      const { start: _, count: A, materialIndex: P } = f[E];
+      if (x >= _ && x < _ + A) {
+        const I = Gr(e[P]), M = jr(t, p, y, S, w, c, d, u, I, r, o);
         if (M)
-          if (M.faceIndex = n, M.face.materialIndex = L, s)
+          if (M.faceIndex = n, M.face.materialIndex = P, s)
             s.push(M);
           else
             return M;
       }
     }
   } else {
-    const S = Gr(e), E = jr(t, p, w, _, y, c, d, u, S, r, o);
+    const x = Gr(e), E = jr(t, p, y, S, w, c, d, u, x, r, o);
     if (E)
       if (E.faceIndex = n, E.face.materialIndex = 0, s)
         s.push(E);
@@ -2930,37 +2930,37 @@ function fl(i, e = null) {
   const u = i._roots;
   for (let f = 0, p = u.length; f < p; f++)
     r = u[f], o = new Uint32Array(r), a = new Uint16Array(r), c = new Float32Array(r), h(0, d), d += r.byteLength;
-  function h(f, p, w = !1) {
-    const _ = f * 2;
-    if (De(_, a)) {
-      const y = qe(f, o), S = Qe(_, a);
-      let E = 1 / 0, b = 1 / 0, x = 1 / 0, v = -1 / 0, L = -1 / 0, C = -1 / 0;
-      for (let M = 3 * y, D = 3 * (y + S); M < D; M++) {
-        let I = n[M];
-        const N = s.getX(I), O = s.getY(I), F = s.getZ(I);
-        N < E && (E = N), N > v && (v = N), O < b && (b = O), O > L && (L = O), F < x && (x = F), F > C && (C = F);
-      }
-      return c[f + 0] !== E || c[f + 1] !== b || c[f + 2] !== x || c[f + 3] !== v || c[f + 4] !== L || c[f + 5] !== C ? (c[f + 0] = E, c[f + 1] = b, c[f + 2] = x, c[f + 3] = v, c[f + 4] = L, c[f + 5] = C, !0) : !1;
+  function h(f, p, y = !1) {
+    const S = f * 2;
+    if (De(S, a)) {
+      const w = qe(f, o), x = Qe(S, a);
+      let E = 1 / 0, b = 1 / 0, _ = 1 / 0, A = -1 / 0, P = -1 / 0, I = -1 / 0;
+      for (let M = 3 * w, D = 3 * (w + x); M < D; M++) {
+        let C = n[M];
+        const N = s.getX(C), O = s.getY(C), F = s.getZ(C);
+        N < E && (E = N), N > A && (A = N), O < b && (b = O), O > P && (P = O), F < _ && (_ = F), F > I && (I = F);
+      }
+      return c[f + 0] !== E || c[f + 1] !== b || c[f + 2] !== _ || c[f + 3] !== A || c[f + 4] !== P || c[f + 5] !== I ? (c[f + 0] = E, c[f + 1] = b, c[f + 2] = _, c[f + 3] = A, c[f + 4] = P, c[f + 5] = I, !0) : !1;
     } else {
-      const y = Fe(f), S = ze(f, o);
-      let E = w, b = !1, x = !1;
+      const w = Fe(f), x = ze(f, o);
+      let E = y, b = !1, _ = !1;
       if (e) {
         if (!E) {
-          const I = y / Oe + p / Ye, N = S / Oe + p / Ye;
-          b = e.has(I), x = e.has(N), E = !b && !x;
+          const C = w / Oe + p / Ye, N = x / Oe + p / Ye;
+          b = e.has(C), _ = e.has(N), E = !b && !_;
         }
       } else
-        b = !0, x = !0;
-      const v = E || b, L = E || x;
-      let C = !1;
-      v && (C = h(y, p, E));
+        b = !0, _ = !0;
+      const A = E || b, P = E || _;
+      let I = !1;
+      A && (I = h(w, p, E));
       let M = !1;
-      L && (M = h(S, p, E));
-      const D = C || M;
+      P && (M = h(x, p, E));
+      const D = I || M;
       if (D)
-        for (let I = 0; I < 3; I++) {
-          const N = y + I, O = S + I, F = c[N], V = c[N + 3], te = c[O], re = c[O + 3];
-          c[f + I] = F < te ? F : te, c[f + I + 3] = V > re ? V : re;
+        for (let C = 0; C < 3; C++) {
+          const N = w + C, O = x + C, F = c[N], V = c[N + 3], te = c[O], re = c[O + 3];
+          c[f + C] = F < te ? F : te, c[f + C + 3] = V > re ? V : re;
         }
       return D;
     }
@@ -2968,9 +2968,9 @@ function fl(i, e = null) {
 }
 function Kt(i, e, t, n, s) {
   let r, o, a, c, d, u;
-  const h = 1 / t.direction.x, f = 1 / t.direction.y, p = 1 / t.direction.z, w = t.origin.x, _ = t.origin.y, y = t.origin.z;
-  let S = e[i], E = e[i + 3], b = e[i + 1], x = e[i + 3 + 1], v = e[i + 2], L = e[i + 3 + 2];
-  return h >= 0 ? (r = (S - w) * h, o = (E - w) * h) : (r = (E - w) * h, o = (S - w) * h), f >= 0 ? (a = (b - _) * f, c = (x - _) * f) : (a = (x - _) * f, c = (b - _) * f), r > c || a > o || ((a > r || isNaN(r)) && (r = a), (c < o || isNaN(o)) && (o = c), p >= 0 ? (d = (v - y) * p, u = (L - y) * p) : (d = (L - y) * p, u = (v - y) * p), r > u || d > o) ? !1 : ((d > r || r !== r) && (r = d), (u < o || o !== o) && (o = u), r <= s && o >= n);
+  const h = 1 / t.direction.x, f = 1 / t.direction.y, p = 1 / t.direction.z, y = t.origin.x, S = t.origin.y, w = t.origin.z;
+  let x = e[i], E = e[i + 3], b = e[i + 1], _ = e[i + 3 + 1], A = e[i + 2], P = e[i + 3 + 2];
+  return h >= 0 ? (r = (x - y) * h, o = (E - y) * h) : (r = (E - y) * h, o = (x - y) * h), f >= 0 ? (a = (b - S) * f, c = (_ - S) * f) : (a = (_ - S) * f, c = (b - S) * f), r > c || a > o || ((a > r || isNaN(r)) && (r = a), (c < o || isNaN(o)) && (o = c), p >= 0 ? (d = (A - w) * p, u = (P - w) * p) : (d = (P - w) * p, u = (A - w) * p), r > u || d > o) ? !1 : ((d > r || r !== r) && (r = d), (u < o || o !== o) && (o = u), r <= s && o >= n);
 }
 function pl(i, e, t, n, s, r, o, a) {
   const { geometry: c, _indirectBuffer: d } = i;
@@ -3025,20 +3025,20 @@ function Di(i, e, t, n, s, r) {
     const h = qe(i, c), f = Qe(d, a);
     return ul(e, t, n, h, f, s, r);
   } else {
-    const h = rr(i, c), f = wl[h], w = n.direction[f] >= 0;
-    let _, y;
-    w ? (_ = Fe(i), y = ze(i, c)) : (_ = ze(i, c), y = Fe(i));
-    const E = Kt(_, o, n, s, r) ? Di(_, e, t, n, s, r) : null;
+    const h = rr(i, c), f = wl[h], y = n.direction[f] >= 0;
+    let S, w;
+    y ? (S = Fe(i), w = ze(i, c)) : (S = ze(i, c), w = Fe(i));
+    const E = Kt(S, o, n, s, r) ? Di(S, e, t, n, s, r) : null;
     if (E) {
-      const v = E.point[f];
-      if (w ? v <= o[y + h] : (
+      const A = E.point[f];
+      if (y ? A <= o[w + h] : (
         // min bounding data
-        v >= o[y + h + 3]
+        A >= o[w + h + 3]
       ))
         return E;
     }
-    const x = Kt(y, o, n, s, r) ? Di(y, e, t, n, s, r) : null;
-    return E && x ? E.distance <= x.distance ? E : x : E || x || null;
+    const _ = Kt(w, o, n, s, r) ? Di(w, e, t, n, s, r) : null;
+    return E && _ ? E.distance <= _.distance ? E : _ : E || _ || null;
   }
 }
 const _s = /* @__PURE__ */ new _t(), dn = /* @__PURE__ */ new Tt(), fn = /* @__PURE__ */ new Tt(), On = /* @__PURE__ */ new ht(), Vr = /* @__PURE__ */ new Je(), Ss = /* @__PURE__ */ new Je();
@@ -3051,24 +3051,24 @@ function Ni(i, e, t, n, s = null) {
   const { float32Array: r, uint16Array: o, uint32Array: a } = be;
   let c = i * 2;
   if (s === null && (t.boundingBox || t.computeBoundingBox(), Vr.set(t.boundingBox.min, t.boundingBox.max, n), s = Vr), De(c, o)) {
-    const u = e.geometry, h = u.index, f = u.attributes.position, p = t.index, w = t.attributes.position, _ = qe(i, a), y = Qe(c, o);
+    const u = e.geometry, h = u.index, f = u.attributes.position, p = t.index, y = t.attributes.position, S = qe(i, a), w = Qe(c, o);
     if (On.copy(n).invert(), t.boundsTree)
       return xe(i, r, Ss), Ss.matrix.copy(On), Ss.needsUpdate = !0, t.boundsTree.shapecast({
         intersectsBounds: (E) => Ss.intersectsBox(E),
         intersectsTriangle: (E) => {
           E.a.applyMatrix4(n), E.b.applyMatrix4(n), E.c.applyMatrix4(n), E.needsUpdate = !0;
-          for (let b = _ * 3, x = (y + _) * 3; b < x; b += 3)
+          for (let b = S * 3, _ = (w + S) * 3; b < _; b += 3)
             if (Ie(fn, b, h, f), fn.needsUpdate = !0, E.intersectsTriangle(fn))
               return !0;
           return !1;
         }
       });
     {
-      const S = Ys(t);
-      for (let E = _ * 3, b = (y + _) * 3; E < b; E += 3) {
+      const x = Ys(t);
+      for (let E = S * 3, b = (w + S) * 3; E < b; E += 3) {
         Ie(dn, E, h, f), dn.a.applyMatrix4(On), dn.b.applyMatrix4(On), dn.c.applyMatrix4(On), dn.needsUpdate = !0;
-        for (let x = 0, v = S * 3; x < v; x += 3)
-          if (Ie(fn, x, p, w), fn.needsUpdate = !0, dn.intersectsTriangle(fn))
+        for (let _ = 0, A = x * 3; _ < A; _ += 3)
+          if (Ie(fn, _, p, y), fn.needsUpdate = !0, dn.intersectsTriangle(fn))
             return !0;
       }
     }
@@ -3081,45 +3081,45 @@ const bs = /* @__PURE__ */ new ht(), hi = /* @__PURE__ */ new Je(), Dn = /* @__P
 function Al(i, e, t, n = {}, s = {}, r = 0, o = 1 / 0) {
   e.boundingBox || e.computeBoundingBox(), hi.set(e.boundingBox.min, e.boundingBox.max, t), hi.needsUpdate = !0;
   const a = i.geometry, c = a.attributes.position, d = a.index, u = e.attributes.position, h = e.index, f = lt.getPrimitive(), p = lt.getPrimitive();
-  let w = _l, _ = Sl, y = null, S = null;
-  s && (y = bl, S = xl);
-  let E = 1 / 0, b = null, x = null;
+  let y = _l, S = Sl, w = null, x = null;
+  s && (w = bl, x = xl);
+  let E = 1 / 0, b = null, _ = null;
   return bs.copy(t).invert(), Dn.matrix.copy(bs), i.shapecast(
     {
-      boundsTraverseOrder: (v) => hi.distanceToBox(v),
-      intersectsBounds: (v, L, C) => C < E && C < o ? (L && (Dn.min.copy(v.min), Dn.max.copy(v.max), Dn.needsUpdate = !0), !0) : !1,
-      intersectsRange: (v, L) => {
+      boundsTraverseOrder: (A) => hi.distanceToBox(A),
+      intersectsBounds: (A, P, I) => I < E && I < o ? (P && (Dn.min.copy(A.min), Dn.max.copy(A.max), Dn.needsUpdate = !0), !0) : !1,
+      intersectsRange: (A, P) => {
         if (e.boundsTree)
           return e.boundsTree.shapecast({
             boundsTraverseOrder: (M) => Dn.distanceToBox(M),
-            intersectsBounds: (M, D, I) => I < E && I < o,
+            intersectsBounds: (M, D, C) => C < E && C < o,
             intersectsRange: (M, D) => {
-              for (let I = M, N = M + D; I < N; I++) {
-                Ie(p, 3 * I, h, u), p.a.applyMatrix4(t), p.b.applyMatrix4(t), p.c.applyMatrix4(t), p.needsUpdate = !0;
-                for (let O = v, F = v + L; O < F; O++) {
+              for (let C = M, N = M + D; C < N; C++) {
+                Ie(p, 3 * C, h, u), p.a.applyMatrix4(t), p.b.applyMatrix4(t), p.c.applyMatrix4(t), p.needsUpdate = !0;
+                for (let O = A, F = A + P; O < F; O++) {
                   Ie(f, 3 * O, d, c), f.needsUpdate = !0;
-                  const V = f.distanceToTriangle(p, w, y);
-                  if (V < E && (_.copy(w), S && S.copy(y), E = V, b = O, x = I), V < r)
+                  const V = f.distanceToTriangle(p, y, w);
+                  if (V < E && (S.copy(y), x && x.copy(w), E = V, b = O, _ = C), V < r)
                     return !0;
                 }
               }
             }
           });
         {
-          const C = Ys(e);
-          for (let M = 0, D = C; M < D; M++) {
+          const I = Ys(e);
+          for (let M = 0, D = I; M < D; M++) {
             Ie(p, 3 * M, h, u), p.a.applyMatrix4(t), p.b.applyMatrix4(t), p.c.applyMatrix4(t), p.needsUpdate = !0;
-            for (let I = v, N = v + L; I < N; I++) {
-              Ie(f, 3 * I, d, c), f.needsUpdate = !0;
-              const O = f.distanceToTriangle(p, w, y);
-              if (O < E && (_.copy(w), S && S.copy(y), E = O, b = I, x = M), O < r)
+            for (let C = A, N = A + P; C < N; C++) {
+              Ie(f, 3 * C, d, c), f.needsUpdate = !0;
+              const O = f.distanceToTriangle(p, y, w);
+              if (O < E && (S.copy(y), x && x.copy(w), E = O, b = C, _ = M), O < r)
                 return !0;
             }
           }
         }
       }
     }
-  ), lt.releasePrimitive(f), lt.releasePrimitive(p), E === 1 / 0 ? null : (n.point ? n.point.copy(_) : n.point = _.clone(), n.distance = E, n.faceIndex = b, s && (s.point ? s.point.copy(S) : s.point = S.clone(), s.point.applyMatrix4(bs), _.applyMatrix4(bs), s.distance = _.sub(s.point).length(), s.faceIndex = x), n);
+  ), lt.releasePrimitive(f), lt.releasePrimitive(p), E === 1 / 0 ? null : (n.point ? n.point.copy(S) : n.point = S.clone(), n.distance = E, n.faceIndex = b, s && (s.point ? s.point.copy(x) : s.point = x.clone(), s.point.applyMatrix4(bs), S.applyMatrix4(bs), s.distance = S.sub(s.point).length(), s.faceIndex = _), n);
 }
 function vl(i, e = null) {
   e && Array.isArray(e) && (e = new Set(e));
@@ -3128,41 +3128,41 @@ function vl(i, e = null) {
   const u = i._roots;
   for (let f = 0, p = u.length; f < p; f++)
     r = u[f], o = new Uint32Array(r), a = new Uint16Array(r), c = new Float32Array(r), h(0, d), d += r.byteLength;
-  function h(f, p, w = !1) {
-    const _ = f * 2;
-    if (De(_, a)) {
-      const y = qe(f, o), S = Qe(_, a);
-      let E = 1 / 0, b = 1 / 0, x = 1 / 0, v = -1 / 0, L = -1 / 0, C = -1 / 0;
-      for (let M = y, D = y + S; M < D; M++) {
-        const I = 3 * i.resolveTriangleIndex(M);
+  function h(f, p, y = !1) {
+    const S = f * 2;
+    if (De(S, a)) {
+      const w = qe(f, o), x = Qe(S, a);
+      let E = 1 / 0, b = 1 / 0, _ = 1 / 0, A = -1 / 0, P = -1 / 0, I = -1 / 0;
+      for (let M = w, D = w + x; M < D; M++) {
+        const C = 3 * i.resolveTriangleIndex(M);
         for (let N = 0; N < 3; N++) {
-          let O = I + N;
+          let O = C + N;
           O = n ? n[O] : O;
           const F = s.getX(O), V = s.getY(O), te = s.getZ(O);
-          F < E && (E = F), F > v && (v = F), V < b && (b = V), V > L && (L = V), te < x && (x = te), te > C && (C = te);
+          F < E && (E = F), F > A && (A = F), V < b && (b = V), V > P && (P = V), te < _ && (_ = te), te > I && (I = te);
         }
       }
-      return c[f + 0] !== E || c[f + 1] !== b || c[f + 2] !== x || c[f + 3] !== v || c[f + 4] !== L || c[f + 5] !== C ? (c[f + 0] = E, c[f + 1] = b, c[f + 2] = x, c[f + 3] = v, c[f + 4] = L, c[f + 5] = C, !0) : !1;
+      return c[f + 0] !== E || c[f + 1] !== b || c[f + 2] !== _ || c[f + 3] !== A || c[f + 4] !== P || c[f + 5] !== I ? (c[f + 0] = E, c[f + 1] = b, c[f + 2] = _, c[f + 3] = A, c[f + 4] = P, c[f + 5] = I, !0) : !1;
     } else {
-      const y = Fe(f), S = ze(f, o);
-      let E = w, b = !1, x = !1;
+      const w = Fe(f), x = ze(f, o);
+      let E = y, b = !1, _ = !1;
       if (e) {
         if (!E) {
-          const I = y / Oe + p / Ye, N = S / Oe + p / Ye;
-          b = e.has(I), x = e.has(N), E = !b && !x;
+          const C = w / Oe + p / Ye, N = x / Oe + p / Ye;
+          b = e.has(C), _ = e.has(N), E = !b && !_;
         }
       } else
-        b = !0, x = !0;
-      const v = E || b, L = E || x;
-      let C = !1;
-      v && (C = h(y, p, E));
+        b = !0, _ = !0;
+      const A = E || b, P = E || _;
+      let I = !1;
+      A && (I = h(w, p, E));
       let M = !1;
-      L && (M = h(S, p, E));
-      const D = C || M;
+      P && (M = h(x, p, E));
+      const D = I || M;
       if (D)
-        for (let I = 0; I < 3; I++) {
-          const N = y + I, O = S + I, F = c[N], V = c[N + 3], te = c[O], re = c[O + 3];
-          c[f + I] = F < te ? F : te, c[f + I + 3] = V > re ? V : re;
+        for (let C = 0; C < 3; C++) {
+          const N = w + C, O = x + C, F = c[N], V = c[N + 3], te = c[O], re = c[O + 3];
+          c[f + C] = F < te ? F : te, c[f + C + 3] = V > re ? V : re;
         }
       return D;
     }
@@ -3196,20 +3196,20 @@ function Fi(i, e, t, n, s, r) {
     const h = qe(i, c), f = Qe(d, a);
     return ml(e, t, n, h, f, s, r);
   } else {
-    const h = rr(i, c), f = Ml[h], w = n.direction[f] >= 0;
-    let _, y;
-    w ? (_ = Fe(i), y = ze(i, c)) : (_ = ze(i, c), y = Fe(i));
-    const E = Kt(_, o, n, s, r) ? Fi(_, e, t, n, s, r) : null;
+    const h = rr(i, c), f = Ml[h], y = n.direction[f] >= 0;
+    let S, w;
+    y ? (S = Fe(i), w = ze(i, c)) : (S = ze(i, c), w = Fe(i));
+    const E = Kt(S, o, n, s, r) ? Fi(S, e, t, n, s, r) : null;
     if (E) {
-      const v = E.point[f];
-      if (w ? v <= o[y + h] : (
+      const A = E.point[f];
+      if (y ? A <= o[w + h] : (
         // min bounding data
-        v >= o[y + h + 3]
+        A >= o[w + h + 3]
       ))
         return E;
     }
-    const x = Kt(y, o, n, s, r) ? Fi(y, e, t, n, s, r) : null;
-    return E && x ? E.distance <= x.distance ? E : x : E || x || null;
+    const _ = Kt(w, o, n, s, r) ? Fi(w, e, t, n, s, r) : null;
+    return E && _ ? E.distance <= _.distance ? E : _ : E || _ || null;
   }
 }
 const xs = /* @__PURE__ */ new _t(), pn = /* @__PURE__ */ new Tt(), mn = /* @__PURE__ */ new Tt(), Nn = /* @__PURE__ */ new ht(), Zr = /* @__PURE__ */ new Je(), As = /* @__PURE__ */ new Je();
@@ -3222,25 +3222,25 @@ function zi(i, e, t, n, s = null) {
   const { float32Array: r, uint16Array: o, uint32Array: a } = be;
   let c = i * 2;
   if (s === null && (t.boundingBox || t.computeBoundingBox(), Zr.set(t.boundingBox.min, t.boundingBox.max, n), s = Zr), De(c, o)) {
-    const u = e.geometry, h = u.index, f = u.attributes.position, p = t.index, w = t.attributes.position, _ = qe(i, a), y = Qe(c, o);
+    const u = e.geometry, h = u.index, f = u.attributes.position, p = t.index, y = t.attributes.position, S = qe(i, a), w = Qe(c, o);
     if (Nn.copy(n).invert(), t.boundsTree)
       return xe(i, r, As), As.matrix.copy(Nn), As.needsUpdate = !0, t.boundsTree.shapecast({
         intersectsBounds: (E) => As.intersectsBox(E),
         intersectsTriangle: (E) => {
           E.a.applyMatrix4(n), E.b.applyMatrix4(n), E.c.applyMatrix4(n), E.needsUpdate = !0;
-          for (let b = _, x = y + _; b < x; b++)
+          for (let b = S, _ = w + S; b < _; b++)
             if (Ie(mn, 3 * e.resolveTriangleIndex(b), h, f), mn.needsUpdate = !0, E.intersectsTriangle(mn))
               return !0;
           return !1;
         }
       });
     {
-      const S = Ys(t);
-      for (let E = _, b = y + _; E < b; E++) {
-        const x = e.resolveTriangleIndex(E);
-        Ie(pn, 3 * x, h, f), pn.a.applyMatrix4(Nn), pn.b.applyMatrix4(Nn), pn.c.applyMatrix4(Nn), pn.needsUpdate = !0;
-        for (let v = 0, L = S * 3; v < L; v += 3)
-          if (Ie(mn, v, p, w), mn.needsUpdate = !0, pn.intersectsTriangle(mn))
+      const x = Ys(t);
+      for (let E = S, b = w + S; E < b; E++) {
+        const _ = e.resolveTriangleIndex(E);
+        Ie(pn, 3 * _, h, f), pn.a.applyMatrix4(Nn), pn.b.applyMatrix4(Nn), pn.c.applyMatrix4(Nn), pn.needsUpdate = !0;
+        for (let A = 0, P = x * 3; A < P; A += 3)
+          if (Ie(mn, A, p, y), mn.needsUpdate = !0, pn.intersectsTriangle(mn))
             return !0;
       }
     }
@@ -3253,49 +3253,49 @@ const vs = /* @__PURE__ */ new ht(), ui = /* @__PURE__ */ new Je(), kn = /* @__P
 function Nl(i, e, t, n = {}, s = {}, r = 0, o = 1 / 0) {
   e.boundingBox || e.computeBoundingBox(), ui.set(e.boundingBox.min, e.boundingBox.max, t), ui.needsUpdate = !0;
   const a = i.geometry, c = a.attributes.position, d = a.index, u = e.attributes.position, h = e.index, f = lt.getPrimitive(), p = lt.getPrimitive();
-  let w = Pl, _ = Ll, y = null, S = null;
-  s && (y = Ol, S = Dl);
-  let E = 1 / 0, b = null, x = null;
+  let y = Pl, S = Ll, w = null, x = null;
+  s && (w = Ol, x = Dl);
+  let E = 1 / 0, b = null, _ = null;
   return vs.copy(t).invert(), kn.matrix.copy(vs), i.shapecast(
     {
-      boundsTraverseOrder: (v) => ui.distanceToBox(v),
-      intersectsBounds: (v, L, C) => C < E && C < o ? (L && (kn.min.copy(v.min), kn.max.copy(v.max), kn.needsUpdate = !0), !0) : !1,
-      intersectsRange: (v, L) => {
+      boundsTraverseOrder: (A) => ui.distanceToBox(A),
+      intersectsBounds: (A, P, I) => I < E && I < o ? (P && (kn.min.copy(A.min), kn.max.copy(A.max), kn.needsUpdate = !0), !0) : !1,
+      intersectsRange: (A, P) => {
         if (e.boundsTree) {
-          const C = e.boundsTree;
-          return C.shapecast({
+          const I = e.boundsTree;
+          return I.shapecast({
             boundsTraverseOrder: (M) => kn.distanceToBox(M),
-            intersectsBounds: (M, D, I) => I < E && I < o,
+            intersectsBounds: (M, D, C) => C < E && C < o,
             intersectsRange: (M, D) => {
-              for (let I = M, N = M + D; I < N; I++) {
-                const O = C.resolveTriangleIndex(I);
+              for (let C = M, N = M + D; C < N; C++) {
+                const O = I.resolveTriangleIndex(C);
                 Ie(p, 3 * O, h, u), p.a.applyMatrix4(t), p.b.applyMatrix4(t), p.c.applyMatrix4(t), p.needsUpdate = !0;
-                for (let F = v, V = v + L; F < V; F++) {
+                for (let F = A, V = A + P; F < V; F++) {
                   const te = i.resolveTriangleIndex(F);
                   Ie(f, 3 * te, d, c), f.needsUpdate = !0;
-                  const re = f.distanceToTriangle(p, w, y);
-                  if (re < E && (_.copy(w), S && S.copy(y), E = re, b = F, x = I), re < r)
+                  const re = f.distanceToTriangle(p, y, w);
+                  if (re < E && (S.copy(y), x && x.copy(w), E = re, b = F, _ = C), re < r)
                     return !0;
                 }
               }
             }
           });
         } else {
-          const C = Ys(e);
-          for (let M = 0, D = C; M < D; M++) {
+          const I = Ys(e);
+          for (let M = 0, D = I; M < D; M++) {
             Ie(p, 3 * M, h, u), p.a.applyMatrix4(t), p.b.applyMatrix4(t), p.c.applyMatrix4(t), p.needsUpdate = !0;
-            for (let I = v, N = v + L; I < N; I++) {
-              const O = i.resolveTriangleIndex(I);
+            for (let C = A, N = A + P; C < N; C++) {
+              const O = i.resolveTriangleIndex(C);
               Ie(f, 3 * O, d, c), f.needsUpdate = !0;
-              const F = f.distanceToTriangle(p, w, y);
-              if (F < E && (_.copy(w), S && S.copy(y), E = F, b = I, x = M), F < r)
+              const F = f.distanceToTriangle(p, y, w);
+              if (F < E && (S.copy(y), x && x.copy(w), E = F, b = C, _ = M), F < r)
                 return !0;
             }
           }
         }
       }
     }
-  ), lt.releasePrimitive(f), lt.releasePrimitive(p), E === 1 / 0 ? null : (n.point ? n.point.copy(_) : n.point = _.clone(), n.distance = E, n.faceIndex = b, s && (s.point ? s.point.copy(S) : s.point = S.clone(), s.point.applyMatrix4(vs), _.applyMatrix4(vs), s.distance = _.sub(s.point).length(), s.faceIndex = x), n);
+  ), lt.releasePrimitive(f), lt.releasePrimitive(p), E === 1 / 0 ? null : (n.point ? n.point.copy(S) : n.point = S.clone(), n.distance = E, n.faceIndex = b, s && (s.point ? s.point.copy(x) : s.point = x.clone(), s.point.applyMatrix4(vs), S.applyMatrix4(vs), s.distance = S.sub(s.point).length(), s.faceIndex = _), n);
 }
 function Wr(i, e, t) {
   return i === null ? null : (i.point.applyMatrix4(e.matrixWorld), i.distance = i.point.distanceTo(t.ray.origin), i.object = e, i);
@@ -3366,9 +3366,9 @@ class Vs extends nl {
     function c(d) {
       for (let u = 0; u < d.length; u++) {
         const h = d[u], f = new Uint32Array(h), p = new Uint16Array(h);
-        for (let w = 0, _ = h.byteLength / Ye; w < _; w++) {
-          const y = Oe * w, S = 2 * y;
-          De(S, p) || (f[y + 6] = f[y + 6] / Oe - w);
+        for (let y = 0, S = h.byteLength / Ye; y < S; y++) {
+          const w = Oe * y, x = 2 * w;
+          De(x, p) || (f[w + 6] = f[w + 6] / Oe - y);
         }
       }
     }
@@ -3412,11 +3412,11 @@ class Vs extends nl {
     let u = d + 0, h = d + 1, f = d + 2;
     a && (u = a[u], h = a[h], f = a[f]);
     for (let p = 0; p < 3; p++) {
-      const w = o[di[p]](u), _ = o[di[p]](h), y = o[di[p]](f);
-      let S = w;
-      _ < S && (S = _), y < S && (S = y);
-      let E = w;
-      _ > E && (E = _), y > E && (E = y), t[n + p] = S, t[n + p + 3] = E;
+      const y = o[di[p]](u), S = o[di[p]](h), w = o[di[p]](f);
+      let x = y;
+      S < x && (x = S), w < x && (x = w);
+      let E = y;
+      S > E && (E = S), w > E && (E = w), t[n + p] = x, t[n + p + 3] = E;
     }
     return t;
   }
@@ -3432,19 +3432,19 @@ class Vs extends nl {
     let h = 3;
     o.isInterleavedBufferAttribute && (h = o.data.stride);
     const f = ["getX", "getY", "getZ"], p = n.offset;
-    for (let w = e, _ = e + t; w < _; w++) {
-      const S = (r ? r[w] : w) * 3, E = (w - p) * 6;
-      let b = S + 0, x = S + 1, v = S + 2;
-      a && (b = a[b], x = a[x], v = a[v]), c || (b = b * h + u, x = x * h + u, v = v * h + u);
-      for (let L = 0; L < 3; L++) {
-        let C, M, D;
-        c ? (C = o[f[L]](b), M = o[f[L]](x), D = o[f[L]](v)) : (C = d[b + L], M = d[x + L], D = d[v + L]);
-        let I = C;
-        M < I && (I = M), D < I && (I = D);
-        let N = C;
+    for (let y = e, S = e + t; y < S; y++) {
+      const x = (r ? r[y] : y) * 3, E = (y - p) * 6;
+      let b = x + 0, _ = x + 1, A = x + 2;
+      a && (b = a[b], _ = a[_], A = a[A]), c || (b = b * h + u, _ = _ * h + u, A = A * h + u);
+      for (let P = 0; P < 3; P++) {
+        let I, M, D;
+        c ? (I = o[f[P]](b), M = o[f[P]](_), D = o[f[P]](A)) : (I = d[b + P], M = d[_ + P], D = d[A + P]);
+        let C = I;
+        M < C && (C = M), D < C && (C = D);
+        let N = I;
         M > N && (N = M), D > N && (N = D);
-        const O = (N - I) / 2, F = L * 2;
-        n[E + F + 0] = I + O, n[E + F + 1] = O + (Math.abs(I) + O) * Fs;
+        const O = (N - C) / 2, F = P * 2;
+        n[E + F + 0] = C + O, n[E + F + 1] = O + (Math.abs(C) + O) * Fs;
       }
     }
     return n;
@@ -3600,36 +3600,36 @@ class Vs extends nl {
       intersectsRanges: s,
       intersectsTriangles: r
     } = n;
-    const o = lt.getPrimitive(), a = this.geometry.index, c = this.geometry.attributes.position, d = this.indirect ? (w) => {
-      const _ = this.resolveTriangleIndex(w);
-      Ie(o, _ * 3, a, c);
-    } : (w) => {
-      Ie(o, w * 3, a, c);
-    }, u = lt.getPrimitive(), h = e.geometry.index, f = e.geometry.attributes.position, p = e.indirect ? (w) => {
-      const _ = e.resolveTriangleIndex(w);
-      Ie(u, _ * 3, h, f);
-    } : (w) => {
-      Ie(u, w * 3, h, f);
+    const o = lt.getPrimitive(), a = this.geometry.index, c = this.geometry.attributes.position, d = this.indirect ? (y) => {
+      const S = this.resolveTriangleIndex(y);
+      Ie(o, S * 3, a, c);
+    } : (y) => {
+      Ie(o, y * 3, a, c);
+    }, u = lt.getPrimitive(), h = e.geometry.index, f = e.geometry.attributes.position, p = e.indirect ? (y) => {
+      const S = e.resolveTriangleIndex(y);
+      Ie(u, S * 3, h, f);
+    } : (y) => {
+      Ie(u, y * 3, h, f);
     };
     if (r) {
       if (!(e instanceof Vs))
         throw new Error('MeshBVH: "intersectsTriangles" callback can only be used with another MeshBVH.');
-      const w = (_, y, S, E, b, x, v, L) => {
-        for (let C = S, M = S + E; C < M; C++) {
-          p(C), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
-          for (let D = _, I = _ + y; D < I; D++)
-            if (d(D), o.needsUpdate = !0, r(o, u, D, C, b, x, v, L))
+      const y = (S, w, x, E, b, _, A, P) => {
+        for (let I = x, M = x + E; I < M; I++) {
+          p(I), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+          for (let D = S, C = S + w; D < C; D++)
+            if (d(D), o.needsUpdate = !0, r(o, u, D, I, b, _, A, P))
               return !0;
         }
         return !1;
       };
       if (s) {
-        const _ = s;
-        s = function(y, S, E, b, x, v, L, C) {
-          return _(y, S, E, b, x, v, L, C) ? !0 : w(y, S, E, b, x, v, L, C);
+        const S = s;
+        s = function(w, x, E, b, _, A, P, I) {
+          return S(w, x, E, b, _, A, P, I) ? !0 : y(w, x, E, b, _, A, P, I);
         };
       } else
-        s = w;
+        s = y;
     }
     return super.bvhcast(e, t, { intersectsRanges: s });
   }
@@ -4937,16 +4937,16 @@ class oh {
       a.push(this.parser.getDependency("accessor", o[d]).then((u) => (c[d] = u, c[d])));
     return a.length < 1 ? null : (a.push(this.parser.createNodeMesh(e)), Promise.all(a).then((d) => {
       const u = d.pop(), h = u.isGroup ? u.children : [u], f = d[0].count, p = [];
-      for (const w of h) {
-        const _ = new ht(), y = new q(), S = new xn(), E = new q(1, 1, 1), b = new Ao(w.geometry, w.material, f);
-        for (let x = 0; x < f; x++)
-          c.TRANSLATION && y.fromBufferAttribute(c.TRANSLATION, x), c.ROTATION && S.fromBufferAttribute(c.ROTATION, x), c.SCALE && E.fromBufferAttribute(c.SCALE, x), b.setMatrixAt(x, _.compose(y, S, E));
-        for (const x in c)
-          if (x === "_COLOR_0") {
-            const v = c[x];
-            b.instanceColor = new Qa(v.array, v.itemSize, v.normalized);
-          } else x !== "TRANSLATION" && x !== "ROTATION" && x !== "SCALE" && w.geometry.setAttribute(x, c[x]);
-        er.prototype.copy.call(b, w), this.parser.assignFinalMaterial(b), p.push(b);
+      for (const y of h) {
+        const S = new ht(), w = new q(), x = new xn(), E = new q(1, 1, 1), b = new Ao(y.geometry, y.material, f);
+        for (let _ = 0; _ < f; _++)
+          c.TRANSLATION && w.fromBufferAttribute(c.TRANSLATION, _), c.ROTATION && x.fromBufferAttribute(c.ROTATION, _), c.SCALE && E.fromBufferAttribute(c.SCALE, _), b.setMatrixAt(_, S.compose(w, x, E));
+        for (const _ in c)
+          if (_ === "_COLOR_0") {
+            const A = c[_];
+            b.instanceColor = new Qa(A.array, A.itemSize, A.normalized);
+          } else _ !== "TRANSLATION" && _ !== "ROTATION" && _ !== "SCALE" && y.geometry.setAttribute(_, c[_]);
+        er.prototype.copy.call(b, y), this.parser.assignFinalMaterial(b), p.push(b);
       }
       return u.isGroup ? (u.clear(), u.add(...p), u) : p[0];
     }));
@@ -5006,9 +5006,9 @@ class ch {
     return t.getDependency("bufferView", r).then(function(u) {
       return new Promise(function(h, f) {
         s.decodeDracoFile(u, function(p) {
-          for (const w in p.attributes) {
-            const _ = p.attributes[w], y = c[w];
-            y !== void 0 && (_.normalized = y);
+          for (const y in p.attributes) {
+            const S = p.attributes[y], w = c[y];
+            w !== void 0 && (S.normalized = w);
           }
           h(p);
         }, a, d, je, f);
@@ -5040,10 +5040,10 @@ class Go extends Ec {
     return t;
   }
   interpolate_(e, t, n, s) {
-    const r = this.resultBuffer, o = this.sampleValues, a = this.valueSize, c = a * 2, d = a * 3, u = s - t, h = (n - t) / u, f = h * h, p = f * h, w = e * d, _ = w - d, y = -2 * p + 3 * f, S = p - f, E = 1 - y, b = S - f + h;
-    for (let x = 0; x !== a; x++) {
-      const v = o[_ + x + a], L = o[_ + x + c] * u, C = o[w + x + a], M = o[w + x] * u;
-      r[x] = E * v + b * L + y * C + S * M;
+    const r = this.resultBuffer, o = this.sampleValues, a = this.valueSize, c = a * 2, d = a * 3, u = s - t, h = (n - t) / u, f = h * h, p = f * h, y = e * d, S = y - d, w = -2 * p + 3 * f, x = p - f, E = 1 - w, b = x - f + h;
+    for (let _ = 0; _ !== a; _++) {
+      const A = o[S + _ + a], P = o[S + _ + c] * u, I = o[y + _ + a], M = o[y + _] * u;
+      r[_] = E * A + b * P + w * I + x * M;
     }
     return r;
   }
@@ -5468,24 +5468,24 @@ class Th {
     }
     const r = [];
     return s.bufferView !== void 0 ? r.push(this.getDependency("bufferView", s.bufferView)) : r.push(null), s.sparse !== void 0 && (r.push(this.getDependency("bufferView", s.sparse.indices.bufferView)), r.push(this.getDependency("bufferView", s.sparse.values.bufferView))), Promise.all(r).then(function(o) {
-      const a = o[0], c = fi[s.type], d = bn[s.componentType], u = d.BYTES_PER_ELEMENT, h = u * c, f = s.byteOffset || 0, p = s.bufferView !== void 0 ? n.bufferViews[s.bufferView].byteStride : void 0, w = s.normalized === !0;
-      let _, y;
+      const a = o[0], c = fi[s.type], d = bn[s.componentType], u = d.BYTES_PER_ELEMENT, h = u * c, f = s.byteOffset || 0, p = s.bufferView !== void 0 ? n.bufferViews[s.bufferView].byteStride : void 0, y = s.normalized === !0;
+      let S, w;
       if (p && p !== h) {
-        const S = Math.floor(f / p), E = "InterleavedBuffer:" + s.bufferView + ":" + s.componentType + ":" + S + ":" + s.count;
+        const x = Math.floor(f / p), E = "InterleavedBuffer:" + s.bufferView + ":" + s.componentType + ":" + x + ":" + s.count;
         let b = t.cache.get(E);
-        b || (_ = new d(a, S * p, s.count * p / u), b = new tc(_, p / u), t.cache.add(E, b)), y = new nc(b, c, f % p / u, w);
+        b || (S = new d(a, x * p, s.count * p / u), b = new tc(S, p / u), t.cache.add(E, b)), w = new nc(b, c, f % p / u, y);
       } else
-        a === null ? _ = new d(s.count * c) : _ = new d(a, f, s.count * c), y = new jn(_, c, w);
+        a === null ? S = new d(s.count * c) : S = new d(a, f, s.count * c), w = new jn(S, c, y);
       if (s.sparse !== void 0) {
-        const S = fi.SCALAR, E = bn[s.sparse.indices.componentType], b = s.sparse.indices.byteOffset || 0, x = s.sparse.values.byteOffset || 0, v = new E(o[1], b, s.sparse.count * S), L = new d(o[2], x, s.sparse.count * c);
-        a !== null && (y = new jn(y.array.slice(), y.itemSize, y.normalized)), y.normalized = !1;
-        for (let C = 0, M = v.length; C < M; C++) {
-          const D = v[C];
-          if (y.setX(D, L[C * c]), c >= 2 && y.setY(D, L[C * c + 1]), c >= 3 && y.setZ(D, L[C * c + 2]), c >= 4 && y.setW(D, L[C * c + 3]), c >= 5) throw new Error("THREE.GLTFLoader: Unsupported itemSize in sparse BufferAttribute.");
+        const x = fi.SCALAR, E = bn[s.sparse.indices.componentType], b = s.sparse.indices.byteOffset || 0, _ = s.sparse.values.byteOffset || 0, A = new E(o[1], b, s.sparse.count * x), P = new d(o[2], _, s.sparse.count * c);
+        a !== null && (w = new jn(w.array.slice(), w.itemSize, w.normalized)), w.normalized = !1;
+        for (let I = 0, M = A.length; I < M; I++) {
+          const D = A[I];
+          if (w.setX(D, P[I * c]), c >= 2 && w.setY(D, P[I * c + 1]), c >= 3 && w.setZ(D, P[I * c + 2]), c >= 4 && w.setW(D, P[I * c + 3]), c >= 5) throw new Error("THREE.GLTFLoader: Unsupported itemSize in sparse BufferAttribute.");
         }
-        y.normalized = w;
+        w.normalized = y;
       }
-      return y;
+      return w;
     });
   }
   /**
@@ -5533,11 +5533,11 @@ class Th {
       throw new Error("THREE.GLTFLoader: Image " + e + " is missing URI and bufferView");
     const u = Promise.resolve(c).then(function(h) {
       return new Promise(function(f, p) {
-        let w = f;
-        t.isImageBitmapLoader === !0 && (w = function(_) {
-          const y = new xr(_);
-          y.needsUpdate = !0, f(y);
-        }), t.load(Gn.resolveURL(h, r.path), w, void 0, p);
+        let y = f;
+        t.isImageBitmapLoader === !0 && (y = function(S) {
+          const w = new xr(S);
+          w.needsUpdate = !0, f(w);
+        }), t.load(Gn.resolveURL(h, r.path), y, void 0, p);
       });
     }).then(function(h) {
       return d === !0 && a.revokeObjectURL(c), vt(h, o), h.userData.mimeType = o.mimeType || wh(o.uri), h;
@@ -5699,25 +5699,25 @@ class Th {
     }
     return a.push(t.loadGeometries(o)), Promise.all(a).then(function(c) {
       const d = c.slice(0, c.length - 1), u = c[c.length - 1], h = [];
-      for (let p = 0, w = u.length; p < w; p++) {
-        const _ = u[p], y = o[p];
-        let S;
+      for (let p = 0, y = u.length; p < y; p++) {
+        const S = u[p], w = o[p];
+        let x;
         const E = d[p];
-        if (y.mode === at.TRIANGLES || y.mode === at.TRIANGLE_STRIP || y.mode === at.TRIANGLE_FAN || y.mode === void 0)
-          S = r.isSkinnedMesh === !0 ? new dc(_, E) : new yt(_, E), S.isSkinnedMesh === !0 && S.normalizeSkinWeights(), y.mode === at.TRIANGLE_STRIP ? S.geometry = Qr(S.geometry, So) : y.mode === at.TRIANGLE_FAN && (S.geometry = Qr(S.geometry, vi));
-        else if (y.mode === at.LINES)
-          S = new qi(_, E);
-        else if (y.mode === at.LINE_STRIP)
-          S = new Qi(_, E);
-        else if (y.mode === at.LINE_LOOP)
-          S = new $i(_, E);
-        else if (y.mode === at.POINTS)
-          S = new Ji(_, E);
+        if (w.mode === at.TRIANGLES || w.mode === at.TRIANGLE_STRIP || w.mode === at.TRIANGLE_FAN || w.mode === void 0)
+          x = r.isSkinnedMesh === !0 ? new dc(S, E) : new yt(S, E), x.isSkinnedMesh === !0 && x.normalizeSkinWeights(), w.mode === at.TRIANGLE_STRIP ? x.geometry = Qr(x.geometry, So) : w.mode === at.TRIANGLE_FAN && (x.geometry = Qr(x.geometry, vi));
+        else if (w.mode === at.LINES)
+          x = new qi(S, E);
+        else if (w.mode === at.LINE_STRIP)
+          x = new Qi(S, E);
+        else if (w.mode === at.LINE_LOOP)
+          x = new $i(S, E);
+        else if (w.mode === at.POINTS)
+          x = new Ji(S, E);
         else
-          throw new Error("THREE.GLTFLoader: Primitive mode unsupported: " + y.mode);
-        Object.keys(S.geometry.morphAttributes).length > 0 && gh(S, r), S.name = t.createUniqueName(r.name || "mesh_" + e), vt(S, r), y.extensions && Jt(s, S, y), t.assignFinalMaterial(S), h.push(S);
+          throw new Error("THREE.GLTFLoader: Primitive mode unsupported: " + w.mode);
+        Object.keys(x.geometry.morphAttributes).length > 0 && gh(x, r), x.name = t.createUniqueName(r.name || "mesh_" + e), vt(x, r), w.extensions && Jt(s, x, w), t.assignFinalMaterial(x), h.push(x);
       }
-      for (let p = 0, w = h.length; p < w; p++)
+      for (let p = 0, y = h.length; p < y; p++)
         t.associations.set(h[p], {
           meshes: e,
           primitives: p
@@ -5726,7 +5726,7 @@ class Th {
         return r.extensions && Jt(s, h[0], r), h[0];
       const f = new ti();
       r.extensions && Jt(s, f, r), t.associations.set(f, { meshes: e });
-      for (let p = 0, w = h.length; p < w; p++)
+      for (let p = 0, y = h.length; p < y; p++)
         f.add(h[p]);
       return f;
     });
@@ -5782,8 +5782,8 @@ class Th {
   loadAnimation(e) {
     const t = this.json, n = this, s = t.animations[e], r = s.name ? s.name : "animation_" + e, o = [], a = [], c = [], d = [], u = [];
     for (let h = 0, f = s.channels.length; h < f; h++) {
-      const p = s.channels[h], w = s.samplers[p.sampler], _ = p.target, y = _.node, S = s.parameters !== void 0 ? s.parameters[w.input] : w.input, E = s.parameters !== void 0 ? s.parameters[w.output] : w.output;
-      _.node !== void 0 && (o.push(this.getDependency("node", y)), a.push(this.getDependency("accessor", S)), c.push(this.getDependency("accessor", E)), d.push(w), u.push(_));
+      const p = s.channels[h], y = s.samplers[p.sampler], S = p.target, w = S.node, x = s.parameters !== void 0 ? s.parameters[y.input] : y.input, E = s.parameters !== void 0 ? s.parameters[y.output] : y.output;
+      S.node !== void 0 && (o.push(this.getDependency("node", w)), a.push(this.getDependency("accessor", x)), c.push(this.getDependency("accessor", E)), d.push(y), u.push(S));
     }
     return Promise.all([
       Promise.all(o),
@@ -5792,17 +5792,17 @@ class Th {
       Promise.all(d),
       Promise.all(u)
     ]).then(function(h) {
-      const f = h[0], p = h[1], w = h[2], _ = h[3], y = h[4], S = [];
-      for (let b = 0, x = f.length; b < x; b++) {
-        const v = f[b], L = p[b], C = w[b], M = _[b], D = y[b];
-        if (v === void 0) continue;
-        v.updateMatrix && v.updateMatrix();
-        const I = n._createAnimationTracks(v, L, C, M, D);
-        if (I)
-          for (let N = 0; N < I.length; N++)
-            S.push(I[N]);
-      }
-      const E = new gc(r, void 0, S);
+      const f = h[0], p = h[1], y = h[2], S = h[3], w = h[4], x = [];
+      for (let b = 0, _ = f.length; b < _; b++) {
+        const A = f[b], P = p[b], I = y[b], M = S[b], D = w[b];
+        if (A === void 0) continue;
+        A.updateMatrix && A.updateMatrix();
+        const C = n._createAnimationTracks(A, P, I, M, D);
+        if (C)
+          for (let N = 0; N < C.length; N++)
+            x.push(C[N]);
+      }
+      const E = new gc(r, void 0, x);
       return vt(E, s), E;
     });
   }
@@ -5838,11 +5838,11 @@ class Th {
       f !== null && u.traverse(function(p) {
         p.isSkinnedMesh && p.bind(f, Eh);
       });
-      for (let p = 0, w = h.length; p < w; p++)
+      for (let p = 0, y = h.length; p < y; p++)
         u.add(h[p]);
       if (u.userData.pivot !== void 0 && h.length > 0) {
-        const p = u.userData.pivot, w = h[0];
-        u.pivot = new q().fromArray(p), u.position.x -= p[0], u.position.y -= p[1], u.position.z -= p[2], w.position.set(0, 0, 0), delete u.userData.pivot;
+        const p = u.userData.pivot, y = h[0];
+        u.pivot = new q().fromArray(p), u.position.x -= p[0], u.position.y -= p[1], u.position.z -= p[2], y.position.set(0, 0, 0), delete u.userData.pivot;
       }
       return u;
     });
@@ -5943,14 +5943,14 @@ class Th {
         break;
     }
     const h = s.interpolation !== void 0 ? fh[s.interpolation] : Mo, f = this._getArrayFromAccessor(n);
-    for (let p = 0, w = c.length; p < w; p++) {
-      const _ = new u(
+    for (let p = 0, y = c.length; p < y; p++) {
+      const S = new u(
         c[p] + "." + Bt[r.path],
         t.array,
         f,
         h
       );
-      s.interpolation === "CUBICSPLINE" && this._createCubicSplineTrackInterpolant(_), o.push(_);
+      s.interpolation === "CUBICSPLINE" && this._createCubicSplineTrackInterpolant(S), o.push(S);
     }
     return o;
   }
@@ -5995,11 +5995,11 @@ function _h(i, e, t) {
     for (let d = 0, u = r.length; d < u; d++) {
       const h = r[d];
       if (h.POSITION !== void 0) {
-        const f = t.json.accessors[h.POSITION], p = f.min, w = f.max;
-        if (p !== void 0 && w !== void 0) {
-          if (c.setX(Math.max(Math.abs(p[0]), Math.abs(w[0]))), c.setY(Math.max(Math.abs(p[1]), Math.abs(w[1]))), c.setZ(Math.max(Math.abs(p[2]), Math.abs(w[2]))), f.normalized) {
-            const _ = Hi(bn[f.componentType]);
-            c.multiplyScalar(_);
+        const f = t.json.accessors[h.POSITION], p = f.min, y = f.max;
+        if (p !== void 0 && y !== void 0) {
+          if (c.setX(Math.max(Math.abs(p[0]), Math.abs(y[0]))), c.setY(Math.max(Math.abs(p[1]), Math.abs(y[1]))), c.setZ(Math.max(Math.abs(p[2]), Math.abs(y[2]))), f.normalized) {
+            const S = Hi(bn[f.componentType]);
+            c.multiplyScalar(S);
           }
           a.max(c);
         } else
@@ -6911,13 +6911,13 @@ const Gi = "contact-shadow-baked", Yn = "contact-shadow-live", ao = Math.PI * (3
     f.rotation.x = -Math.PI / 2, f.position.set(s.center.x, 0, s.center.z), f.receiveShadow = !0, a.add(f);
     const p = this.createBakeCamera(s);
     a.add(p);
-    const w = e.getRenderTarget(), _ = e.autoClear, y = e.getClearColor(new T.Color()), S = e.getClearAlpha(), E = e.shadowMap.autoUpdate;
+    const y = e.getRenderTarget(), S = e.autoClear, w = e.getClearColor(new T.Color()), x = e.getClearAlpha(), E = e.shadowMap.autoUpdate;
     try {
       e.shadowMap.autoUpdate = !0, e.setRenderTarget(r), e.setClearColor(0, 0), e.clear(!0, !1, !1), e.autoClear = !1;
       for (const b of this.sampleLightPositions(n))
         u.position.copy(b), e.render(a, p);
     } finally {
-      e.autoClear = _, e.setClearColor(y, S), e.setRenderTarget(w), e.shadowMap.autoUpdate = E, this.restoreColorWrite(d), c ? c.add(t) : a.remove(t), u.dispose(), h.dispose();
+      e.autoClear = S, e.setClearColor(w, x), e.setRenderTarget(y), e.shadowMap.autoUpdate = E, this.restoreColorWrite(d), c ? c.add(t) : a.remove(t), u.dispose(), h.dispose();
     }
   }
   /**
@@ -6955,22 +6955,22 @@ const Gi = "contact-shadow-baked", Yn = "contact-shadow-live", ao = Math.PI * (3
     const t = e.position.clone(), n = e.target.parent ? e.target.getWorldPosition(new T.Vector3()) : e.target.position.clone(), s = n.clone().sub(t), r = s.length(), o = s.normalize(), a = new T.Vector3().crossVectors(o, new T.Vector3(0, 1, 0));
     a.lengthSq() < 1e-6 && a.set(1, 0, 0), a.normalize();
     const c = new T.Vector3().crossVectors(o, a), d = Math.round(this.passes * Ke.AMBIENT_RATIO), u = this.passes - d, h = T.MathUtils.degToRad(Ke.LIGHT_APERTURE_DEGREES), f = Math.tan(h / 2) * r, p = [];
-    for (let y = 0; y < u; y++) {
-      const S = f * Math.sqrt((y + 0.5) / u), E = y * ao;
+    for (let w = 0; w < u; w++) {
+      const x = f * Math.sqrt((w + 0.5) / u), E = w * ao;
       p.push(
-        t.clone().addScaledVector(a, S * Math.cos(E)).addScaledVector(c, S * Math.sin(E))
+        t.clone().addScaledVector(a, x * Math.cos(E)).addScaledVector(c, x * Math.sin(E))
       );
     }
-    const w = Math.sin(
+    const y = Math.sin(
       T.MathUtils.degToRad(Ke.AMBIENT_MIN_ELEVATION_DEGREES)
-    ), _ = 0.98;
-    for (let y = 0; y < d; y++) {
-      const S = Math.sqrt((y + 0.5) / d), E = w + (_ - w) * S, b = Math.sqrt(1 - E * E), x = y * ao;
+    ), S = 0.98;
+    for (let w = 0; w < d; w++) {
+      const x = Math.sqrt((w + 0.5) / d), E = y + (S - y) * x, b = Math.sqrt(1 - E * E), _ = w * ao;
       p.push(
         new T.Vector3(
-          b * Math.cos(x),
+          b * Math.cos(_),
           E,
-          b * Math.sin(x)
+          b * Math.sin(_)
         ).multiplyScalar(r).add(n)
       );
     }
@@ -7103,14 +7103,14 @@ class Gh {
     }), c = s * Math.sqrt(3), d = s * 2;
     for (let h = -n; h <= n; h++) {
       const f = Math.max(-n, -h - n), p = Math.min(n, -h + n);
-      for (let w = f; w <= p; w++) {
-        const _ = c * (h + w / 2), y = d * 0.75 * w, S = [], E = Math.PI * 2 / 6;
-        for (let v = 0; v <= 6; v++) {
-          const L = v * E + Math.PI / 6, C = _ + s * Math.cos(L), M = y + s * Math.sin(L);
-          S.push(new T.Vector3(C, 0, M));
+      for (let y = f; y <= p; y++) {
+        const S = c * (h + y / 2), w = d * 0.75 * y, x = [], E = Math.PI * 2 / 6;
+        for (let A = 0; A <= 6; A++) {
+          const P = A * E + Math.PI / 6, I = S + s * Math.cos(P), M = w + s * Math.sin(P);
+          x.push(new T.Vector3(I, 0, M));
         }
-        const b = new T.BufferGeometry().setFromPoints(S), x = new T.Line(b, a);
-        t.add(x);
+        const b = new T.BufferGeometry().setFromPoints(x), _ = new T.Line(b, a);
+        t.add(_);
       }
     }
     return t;
@@ -7124,9 +7124,9 @@ class Vh {
   }
   createMesh() {
     const e = new T.Shape(), t = this.size + this.bevel, n = Math.PI * 2 / 6;
-    for (let _ = 0; _ < 6; _++) {
-      const y = t * Math.cos(_ * n), S = t * Math.sin(_ * n);
-      _ === 0 ? e.moveTo(y, S) : e.lineTo(y, S);
+    for (let S = 0; S < 6; S++) {
+      const w = t * Math.cos(S * n), x = t * Math.sin(S * n);
+      S === 0 ? e.moveTo(w, x) : e.lineTo(w, x);
     }
     e.closePath();
     const s = {
@@ -7163,8 +7163,8 @@ class Vh {
       // Enable environment map reflections
     }), p = new T.Mesh(r, f);
     p.receiveShadow = !0;
-    const w = new T.Group();
-    return w.add(p), w.position.set(this.position.x, this.position.y, this.position.z), w.rotation.x = Math.PI / 2, w.rotation.z = Math.PI / 6, w;
+    const y = new T.Group();
+    return y.add(p), y.position.set(this.position.x, this.position.y, this.position.z), y.rotation.x = Math.PI / 2, y.rotation.z = Math.PI / 6, y;
   }
 }
 class Zh {
@@ -7172,17 +7172,17 @@ class Zh {
     this.name = "Hexagonal Glass Grid";
   }
   createGrid(e) {
-    var d, u, h, f, p, w, _;
+    var d, u, h, f, p, y, S;
     const t = new T.Group(), n = ((d = e.styleOptions) == null ? void 0 : d.hexRadius) || Math.floor(e.divisions / 2), s = ((u = e.styleOptions) == null ? void 0 : u.tileSize) || 1, r = String(e.color || "#ffffff"), o = sn.getGridSpacing(s), a = o.width, c = o.height;
-    for (let y = -n; y <= n; y++) {
-      const S = Math.max(-n, -y - n), E = Math.min(n, -y + n);
-      for (let b = S; b <= E; b++) {
-        const x = a * (y + b / 2), v = c * 0.75 * b, L = sn.getYPosition(s), M = new Vh(new T.Vector3(x, L, v), s, r, {
+    for (let w = -n; w <= n; w++) {
+      const x = Math.max(-n, -w - n), E = Math.min(n, -w + n);
+      for (let b = x; b <= E; b++) {
+        const _ = a * (w + b / 2), A = c * 0.75 * b, P = sn.getYPosition(s), M = new Vh(new T.Vector3(_, P, A), s, r, {
           metalness: (h = e.styleOptions) == null ? void 0 : h.metalness,
           roughness: (f = e.styleOptions) == null ? void 0 : f.roughness,
           transmission: (p = e.styleOptions) == null ? void 0 : p.transmission,
-          thickness: (w = e.styleOptions) == null ? void 0 : w.thickness,
-          ior: (_ = e.styleOptions) == null ? void 0 : _.ior
+          thickness: (y = e.styleOptions) == null ? void 0 : y.thickness,
+          ior: (S = e.styleOptions) == null ? void 0 : S.ior
         }).createMesh();
         t.add(M);
       }
@@ -7204,22 +7204,22 @@ class Wh {
     this.name = "Stone Tile Grid", this.textureLoader = new T.TextureLoader();
   }
   createGrid(e) {
-    var p, w, _, y;
-    const t = new T.Group(), n = e.size, s = Math.max(1, e.divisions), r = n / s, o = r * 0.02, a = r - o, c = ((p = e.styleOptions) == null ? void 0 : p.height) || r * 0.05, d = ((w = e.styleOptions) == null ? void 0 : w.bevelSize) || c * 0.2, u = ((_ = e.styleOptions) == null ? void 0 : _.randomHeight) || !1, h = ((y = e.styleOptions) == null ? void 0 : y.randomRotation) || !1, f = this.createStoneMaterial(e);
-    for (let S = 0; S < s; S++)
+    var p, y, S, w;
+    const t = new T.Group(), n = e.size, s = Math.max(1, e.divisions), r = n / s, o = r * 0.02, a = r - o, c = ((p = e.styleOptions) == null ? void 0 : p.height) || r * 0.05, d = ((y = e.styleOptions) == null ? void 0 : y.bevelSize) || c * 0.2, u = ((S = e.styleOptions) == null ? void 0 : S.randomHeight) || !1, h = ((w = e.styleOptions) == null ? void 0 : w.randomRotation) || !1, f = this.createStoneMaterial(e);
+    for (let x = 0; x < s; x++)
       for (let E = 0; E < s; E++) {
-        const b = (S - s / 2) * r + r / 2, x = (E - s / 2) * r + r / 2, v = u ? c * (0.8 + Math.random() * 0.4) : c, L = new T.Shape(), C = a / 2;
-        L.moveTo(-C, -C), L.lineTo(C, -C), L.lineTo(C, C), L.lineTo(-C, C), L.closePath();
+        const b = (x - s / 2) * r + r / 2, _ = (E - s / 2) * r + r / 2, A = u ? c * (0.8 + Math.random() * 0.4) : c, P = new T.Shape(), I = a / 2;
+        P.moveTo(-I, -I), P.lineTo(I, -I), P.lineTo(I, I), P.lineTo(-I, I), P.closePath();
         const M = {
-          depth: v,
+          depth: A,
           bevelEnabled: !0,
           bevelSize: d,
           bevelThickness: d,
           bevelSegments: 2
-        }, D = new T.ExtrudeGeometry(L, M);
+        }, D = new T.ExtrudeGeometry(P, M);
         D.rotateX(-Math.PI / 2);
-        const I = new T.Mesh(D, f);
-        I.position.set(b, -v / 2, x), I.castShadow = !0, I.receiveShadow = !0, h && (I.rotation.y = Math.floor(Math.random() * 4) * (Math.PI / 2)), t.add(I);
+        const C = new T.Mesh(D, f);
+        C.position.set(b, -A / 2, _), C.castShadow = !0, C.receiveShadow = !0, h && (C.rotation.y = Math.floor(Math.random() * 4) * (Math.PI / 2)), t.add(C);
       }
     return t;
   }
@@ -7375,8 +7375,8 @@ class Kh {
         return B.ok(void 0);
       const c = [];
       r.traverse((M) => {
-        var D, I, N;
-        ((D = M.userData) != null && D.isGrid || (I = M.userData) != null && I.isHexGrid || (N = M.userData) != null && N.isDefaultGrid) && c.push(M);
+        var D, C, N;
+        ((D = M.userData) != null && D.isGrid || (C = M.userData) != null && C.isHexGrid || (N = M.userData) != null && N.isDefaultGrid) && c.push(M);
       }), c.forEach((M) => {
         $s(M), r.remove(M);
       });
@@ -7385,26 +7385,26 @@ class Kh {
       const u = new T.Box3().setFromObject(d), h = u.getSize(new T.Vector3());
       if (u.isEmpty() || !Number.isFinite(h.x) || !Number.isFinite(h.z))
         return console.warn("Skipping dynamic grid: object has an empty or non-finite bounding box"), B.ok(void 0);
-      const f = (s = a.styleOptions) == null ? void 0 : s.tileSize, p = typeof f == "number" ? f : 1, _ = sn.getGridSpacing(p).width, y = Math.max(h.x, h.z) * n + h.y;
-      let S = y <= _ ? 0 : Math.ceil((y / _ - 1) / 2);
+      const f = (s = a.styleOptions) == null ? void 0 : s.tileSize, p = typeof f == "number" ? f : 1, S = sn.getGridSpacing(p).width, w = Math.max(h.x, h.z) * n + h.y;
+      let x = w <= S ? 0 : Math.ceil((w / S - 1) / 2);
       const E = 60;
-      S > E && (console.warn(
-        `Dynamic grid would need ${S} rings to cover the object; capping at ${E}. The floor will not fully reach the configured coverage for this tileSize/object-size combination.`
-      ), S = E), y < _ * 0.8 ? S = 0 : S < 3 && y > _ * 2 && (S = 3);
-      const b = a.type || Ot.HEXAGONAL_GLASS, v = {
+      x > E && (console.warn(
+        `Dynamic grid would need ${x} rings to cover the object; capping at ${E}. The floor will not fully reach the configured coverage for this tileSize/object-size combination.`
+      ), x = E), w < S * 0.8 ? x = 0 : x < 3 && w > S * 2 && (x = 3);
+      const b = a.type || Ot.HEXAGONAL_GLASS, A = {
         size: Math.max(h.x, h.z) * n,
-        divisions: S * 2 + 1,
+        divisions: x * 2 + 1,
         color: a.color,
         opacity: a.opacity,
         styleOptions: {
-          hexRadius: S,
+          hexRadius: x,
           tileSize: p,
           ...a.styleOptions
         }
-      }, L = Zs.createGrid(b, v);
-      L.userData.isGrid = !0, L.userData.isHexGrid = !0;
-      const C = L.getObjectByName(Yn);
-      return C && (C.position.y = T.MathUtils.clamp(h.y * 25e-4, 2e-4, 2e-3)), r.add(L), B.ok(void 0);
+      }, P = Zs.createGrid(b, A);
+      P.userData.isGrid = !0, P.userData.isHexGrid = !0;
+      const I = P.getObjectByName(Yn);
+      return I && (I.position.y = T.MathUtils.clamp(h.y * 25e-4, 2e-4, 2e-3)), r.add(P), B.ok(void 0);
     } catch (r) {
       return B.err(
         new W(
@@ -7426,47 +7426,50 @@ class Kh {
         );
       let n;
       t instanceof Le || "getThreeObject" in t && typeof t.getThreeObject == "function" ? n = t.getThreeObject() : n = t;
-      const s = (y) => {
-        var E, b, x;
-        let S = y;
-        for (; S; ) {
-          if ((E = S.userData) != null && E.isGrid || (b = S.userData) != null && b.isHexGrid || (x = S.userData) != null && x.isDefaultGrid)
+      const s = (_) => {
+        var P, I, M;
+        let A = _;
+        for (; A; ) {
+          if ((P = A.userData) != null && P.isGrid || (I = A.userData) != null && I.isHexGrid || (M = A.userData) != null && M.isDefaultGrid)
             return !0;
-          S = S.parent;
+          A = A.parent;
         }
         return !1;
       }, r = e.getThreeScene();
       r.updateMatrixWorld(!0);
       const o = [];
-      r.traverse((y) => {
-        y.isMesh && s(y) && o.push(y);
+      r.traverse((_) => {
+        _.isMesh && s(_) && o.push(_);
       });
       const a = [];
-      if (n.traverse((y) => {
-        y.isMesh && a.push(y);
+      if (n.traverse((_) => {
+        _.isMesh && a.push(_);
       }), o.length === 0 || a.length === 0)
         return B.ok(void 0);
       let c = -1 / 0;
       const d = new T.Box3();
-      for (const y of o)
-        d.setFromObject(y), Number.isFinite(d.max.y) && (c = Math.max(c, d.max.y));
+      for (const _ of o)
+        d.setFromObject(_), Number.isFinite(d.max.y) && (c = Math.max(c, d.max.y));
       if (!Number.isFinite(c))
         return B.ok(void 0);
       const u = new T.Box3().setFromObject(n);
       if (u.isEmpty() || !Number.isFinite(u.min.x) || !Number.isFinite(u.max.x))
         return B.ok(void 0);
-      const h = 40, f = u.max.y + Math.max(1, u.max.y - u.min.y), p = new T.Raycaster(), w = new T.Vector3(0, -1, 0);
-      let _ = 1 / 0;
-      for (let y = 0; y <= h; y++)
-        for (let S = 0; S <= h; S++) {
-          const E = u.min.x + (u.max.x - u.min.x) * (y / h), b = u.min.z + (u.max.z - u.min.z) * (S / h);
-          p.set(new T.Vector3(E, f, b), w);
-          for (const x of p.intersectObjects(a, !1))
-            x.point.y < _ && (_ = x.point.y);
+      const h = 40, f = Math.max(1, u.max.y - u.min.y), p = u.max.y + f, y = u.min.y - f, S = new T.Raycaster(), w = new T.Vector3(0, -1, 0), x = new T.Vector3(0, 1, 0);
+      let E = 1 / 0;
+      const b = (_, A, P, I) => {
+        S.set(new T.Vector3(_, A, P), I);
+        for (const M of S.intersectObjects(a, !1))
+          M.point.y < E && (E = M.point.y);
+      };
+      for (let _ = 0; _ <= h; _++)
+        for (let A = 0; A <= h; A++) {
+          const P = u.min.x + (u.max.x - u.min.x) * (_ / h), I = u.min.z + (u.max.z - u.min.z) * (A / h);
+          b(P, p, I, w), b(P, y, I, x);
         }
-      if (Number.isFinite(_)) {
-        const y = _ - c;
-        Math.abs(y) > 1e-4 && (n.position.y -= y);
+      if (Number.isFinite(E)) {
+        const _ = E - c;
+        Math.abs(_) > 1e-4 && (n.position.y -= _);
       }
       return B.ok(void 0);
     } catch (n) {
@@ -7685,8 +7688,8 @@ class Kh {
       "fov" in r ? h = r.fov * (Math.PI / 180) : h = 50 * (Math.PI / 180);
       let f = Math.abs(u / 2 / Math.tan(h / 2));
       f *= 2;
-      const p = -Math.PI / 4, w = Math.PI / 8, _ = c.x + f * Math.sin(p) * Math.cos(w), y = c.y + f * Math.sin(w), S = c.z + f * Math.cos(p) * Math.cos(w);
-      return r.position.set(_, y, S), r.lookAt(c), r.updateProjectionMatrix(), o && o.target && (o.target.copy(c), o.update()), B.ok(void 0);
+      const p = -Math.PI / 4, y = Math.PI / 8, S = c.x + f * Math.sin(p) * Math.cos(y), w = c.y + f * Math.sin(y), x = c.z + f * Math.cos(p) * Math.cos(y);
+      return r.position.set(S, w, x), r.lookAt(c), r.updateProjectionMatrix(), o && o.target && (o.target.copy(c), o.update()), B.ok(void 0);
     } catch (s) {
       return B.err(
         new W(
@@ -7703,7 +7706,7 @@ class Xh {
     this.events = new nr(), this.disposed = !1;
   }
   async initialize(e) {
-    const { ThreePathTracingService: t } = await import("./ThreePathTracingService-BmpaPOib.js");
+    const { ThreePathTracingService: t } = await import("./ThreePathTracingService-D0KG3Ciu.js");
     if (this.disposed)
       return B.ok(void 0);
     const n = new t();
@@ -7911,21 +7914,21 @@ var eu = /* @__PURE__ */ Wn(es, 9, 1), tu = /* @__PURE__ */ Wn(ea, 5, 1), Ei = f
       var ts = new ct(Math.max(It * 2, rn));
       ts.set(t), t = ts;
     }
-  }, u = e.f || 0, h = e.p || 0, f = e.b || 0, p = e.l, w = e.d, _ = e.m, y = e.n, S = s * 8;
+  }, u = e.f || 0, h = e.p || 0, f = e.b || 0, p = e.l, y = e.d, S = e.m, w = e.n, x = s * 8;
   do {
     if (!p) {
       u = pt(i, h, 1);
       var E = pt(i, h + 1, 3);
       if (h += 3, E)
         if (E == 1)
-          p = eu, w = tu, _ = 9, y = 5;
+          p = eu, y = tu, S = 9, w = 5;
         else if (E == 2) {
-          var L = pt(i, h, 31) + 257, C = pt(i, h + 10, 15) + 4, M = L + pt(i, h + 5, 31) + 1;
+          var P = pt(i, h, 31) + 257, I = pt(i, h + 10, 15) + 4, M = P + pt(i, h + 5, 31) + 1;
           h += 14;
-          for (var D = new ct(M), I = new ct(19), N = 0; N < C; ++N)
-            I[qh[N]] = pt(i, h + N * 3, 7);
-          h += C * 3;
-          for (var O = Ei(I), F = (1 << O) - 1, V = Wn(I, O, 1), N = 0; N < M; ) {
+          for (var D = new ct(M), C = new ct(19), N = 0; N < I; ++N)
+            C[qh[N]] = pt(i, h + N * 3, 7);
+          h += I * 3;
+          for (var O = Ei(C), F = (1 << O) - 1, V = Wn(C, O, 1), N = 0; N < M; ) {
             var te = V[pt(i, h, F)];
             h += te & 15;
             var b = te >> 4;
@@ -7937,28 +7940,28 @@ var eu = /* @__PURE__ */ Wn(es, 9, 1), tu = /* @__PURE__ */ Wn(ea, 5, 1), Ei = f
                 D[N++] = re;
             }
           }
-          var ut = D.subarray(0, L), Re = D.subarray(L);
-          _ = Ei(ut), y = Ei(Re), p = Wn(ut, _, 1), w = Wn(Re, y, 1);
+          var ut = D.subarray(0, P), Re = D.subarray(P);
+          S = Ei(ut), w = Ei(Re), p = Wn(ut, S, 1), y = Wn(Re, w, 1);
         } else
           gt(1);
       else {
-        var b = nu(h) + 4, x = i[b - 4] | i[b - 3] << 8, v = b + x;
-        if (v > s) {
+        var b = nu(h) + 4, _ = i[b - 4] | i[b - 3] << 8, A = b + _;
+        if (A > s) {
           c && gt(0);
           break;
         }
-        a && d(f + x), t.set(i.subarray(b, v), f), e.b = f += x, e.p = h = v * 8, e.f = u;
+        a && d(f + _), t.set(i.subarray(b, A), f), e.b = f += _, e.p = h = A * 8, e.f = u;
         continue;
       }
-      if (h > S) {
+      if (h > x) {
         c && gt(0);
         break;
       }
     }
     a && d(f + 131072);
-    for (var Ue = (1 << _) - 1, Ge = (1 << y) - 1, Ae = h; ; Ae = h) {
+    for (var Ue = (1 << S) - 1, Ge = (1 << w) - 1, Ae = h; ; Ae = h) {
       var re = p[Ti(i, h) & Ue], ge = re >> 4;
-      if (h += re & 15, h > S) {
+      if (h += re & 15, h > x) {
         c && gt(0);
         break;
       }
@@ -7973,14 +7976,14 @@ var eu = /* @__PURE__ */ Wn(es, 9, 1), tu = /* @__PURE__ */ Wn(ea, 5, 1), Ei = f
           var N = ge - 257, Ve = Yo[N];
           St = pt(i, h, (1 << Ve) - 1) + Jo[N], h += Ve;
         }
-        var kt = w[Ti(i, h) & Ge], me = kt >> 4;
+        var kt = y[Ti(i, h) & Ge], me = kt >> 4;
         kt || gt(3), h += kt & 15;
         var Re = Jh[me];
         if (me > 3) {
           var Ve = qo[me];
           Re += Ti(i, h) & (1 << Ve) - 1, h += Ve;
         }
-        if (h > S) {
+        if (h > x) {
           c && gt(0);
           break;
         }
@@ -7995,7 +7998,7 @@ var eu = /* @__PURE__ */ Wn(es, 9, 1), tu = /* @__PURE__ */ Wn(ea, 5, 1), Ei = f
           t[f] = t[f - Re];
       }
     }
-    e.l = p, e.p = Ae, e.b = f, e.f = u, p && (u = 1, e.m = _, e.d = w, e.n = y);
+    e.l = p, e.p = Ae, e.b = f, e.f = u, p && (u = 1, e.m = S, e.d = y, e.n = w);
   } while (!u);
   return f != t.length && o ? su(t, 0, f) : t.subarray(0, f);
 }, ou = /* @__PURE__ */ new ct(0), au = function(i, e) {
@@ -8026,11 +8029,11 @@ class hu extends Co {
    */
   parse(e) {
     const D = Math.pow(2.7182818, 2.2);
-    let I = null;
+    let C = null;
     function N(l, m) {
       let g = 0;
-      for (let P = 0; P < 65536; ++P)
-        (P == 0 || l[P >> 3] & 1 << (P & 7)) && (m[g++] = P);
+      for (let L = 0; L < 65536; ++L)
+        (L == 0 || l[L >> 3] & 1 << (L & 7)) && (m[g++] = L);
       const R = g - 1;
       for (; g < 65536; ) m[g++] = 0;
       return R;
@@ -8040,9 +8043,9 @@ class hu extends Co {
         l[m] = {}, l[m].len = 0, l[m].lit = 0, l[m].p = null;
     }
     const F = { l: 0, c: 0, lc: 0 };
-    function V(l, m, g, R, P) {
+    function V(l, m, g, R, L) {
       for (; g < l; )
-        m = m << 8 | Er(R, P), g += 8;
+        m = m << 8 | Er(R, L), g += 8;
       g -= l, F.l = m >> g & (1 << l) - 1, F.c = m, F.lc = g;
     }
     const te = new Array(59);
@@ -8059,25 +8062,25 @@ class hu extends Co {
         R > 0 && (l[g] = R | te[R]++ << 6);
       }
     }
-    function Ne(l, m, g, R, P, z) {
-      const A = m;
+    function Ne(l, m, g, R, L, z) {
+      const v = m;
       let H = 0, k = 0;
-      for (; R <= P; R++) {
-        if (A.value - m.value > g) return !1;
-        V(6, H, k, l, A);
+      for (; R <= L; R++) {
+        if (v.value - m.value > g) return !1;
+        V(6, H, k, l, v);
         const U = F.l;
         if (H = F.c, k = F.lc, z[R] = U, U == 63) {
-          if (A.value - m.value > g)
+          if (v.value - m.value > g)
             throw new Error("THREE.EXRLoader: Something wrong with hufUnpackEncTable");
-          V(8, H, k, l, A);
+          V(8, H, k, l, v);
           let j = F.l + 6;
-          if (H = F.c, k = F.lc, R + j > P + 1)
+          if (H = F.c, k = F.lc, R + j > L + 1)
             throw new Error("THREE.EXRLoader: Something wrong with hufUnpackEncTable");
           for (; j--; ) z[R++] = 0;
           R--;
         } else if (U >= 59) {
           let j = U - 59 + 2;
-          if (R + j > P + 1)
+          if (R + j > L + 1)
             throw new Error("THREE.EXRLoader: Something wrong with hufUnpackEncTable");
           for (; j--; ) z[R++] = 0;
           R--;
@@ -8093,28 +8096,28 @@ class hu extends Co {
     }
     function Ue(l, m, g, R) {
       for (; m <= g; m++) {
-        const P = Re(l[m]), z = ut(l[m]);
-        if (P >> z)
+        const L = Re(l[m]), z = ut(l[m]);
+        if (L >> z)
           throw new Error("THREE.EXRLoader: Invalid table entry");
         if (z > 14) {
-          const A = R[P >> z - 14];
-          if (A.len)
+          const v = R[L >> z - 14];
+          if (v.len)
             throw new Error("THREE.EXRLoader: Invalid table entry");
-          if (A.lit++, A.p) {
-            const H = A.p;
-            A.p = new Array(A.lit);
-            for (let k = 0; k < A.lit - 1; ++k)
-              A.p[k] = H[k];
+          if (v.lit++, v.p) {
+            const H = v.p;
+            v.p = new Array(v.lit);
+            for (let k = 0; k < v.lit - 1; ++k)
+              v.p[k] = H[k];
           } else
-            A.p = new Array(1);
-          A.p[A.lit - 1] = m;
+            v.p = new Array(1);
+          v.p[v.lit - 1] = m;
         } else if (z) {
-          let A = 0;
+          let v = 0;
           for (let H = 1 << 14 - z; H > 0; H--) {
-            const k = R[(P << 14 - z) + A];
+            const k = R[(L << 14 - z) + v];
             if (k.len || k.p)
               throw new Error("THREE.EXRLoader: Invalid table entry");
-            k.len = z, k.lit = m, A++;
+            k.len = z, k.lit = m, v++;
           }
         }
       }
@@ -8125,17 +8128,17 @@ class hu extends Co {
       l = l << 8 | Er(g, R), m += 8, Ge.c = l, Ge.lc = m;
     }
     const ge = { c: 0, lc: 0 };
-    function St(l, m, g, R, P, z, A, H, k) {
+    function St(l, m, g, R, L, z, v, H, k) {
       if (l == m) {
-        R < 8 && (Ae(g, R, P, z), g = Ge.c, R = Ge.lc), R -= 8;
+        R < 8 && (Ae(g, R, L, z), g = Ge.c, R = Ge.lc), R -= 8;
         let U = g >> R;
         if (U = new Uint8Array([U])[0], H.value + U > k)
           return !1;
-        const j = A[H.value - 1];
+        const j = v[H.value - 1];
         for (; U-- > 0; )
-          A[H.value++] = j;
+          v[H.value++] = j;
       } else if (H.value < k)
-        A[H.value++] = l;
+        v[H.value++] = l;
       else
         return !1;
       ge.c = g, ge.lc = R;
@@ -8149,20 +8152,20 @@ class hu extends Co {
     }
     const me = { a: 0, b: 0 };
     function dt(l, m) {
-      const g = kt(l), P = kt(m), z = g + (P & 1) + (P >> 1), A = z, H = z - P;
-      me.a = A, me.b = H;
+      const g = kt(l), L = kt(m), z = g + (L & 1) + (L >> 1), v = z, H = z - L;
+      me.a = v, me.b = H;
     }
     function ft(l, m) {
-      const g = Ve(l), R = Ve(m), P = g - (R >> 1) & 65535, z = R + P - 32768 & 65535;
-      me.a = z, me.b = P;
+      const g = Ve(l), R = Ve(m), L = g - (R >> 1) & 65535, z = R + L - 32768 & 65535;
+      me.a = z, me.b = L;
     }
-    function An(l, m, g, R, P, z, A) {
-      const H = A < 16384, k = g > P ? P : g;
+    function An(l, m, g, R, L, z, v) {
+      const H = v < 16384, k = g > L ? L : g;
       let U = 1, j, Z;
       for (; U <= k; ) U <<= 1;
       for (U >>= 1, j = U, U >>= 1; U >= 1; ) {
         Z = 0;
-        const G = Z + z * (P - j), X = z * U, J = z * j, K = R * U, $ = R * j;
+        const G = Z + z * (L - j), X = z * U, J = z * j, K = R * U, $ = R * j;
         let ie, le, oe, ue;
         for (; Z <= G; Z += J) {
           let ne = Z;
@@ -8176,7 +8179,7 @@ class hu extends Co {
             H ? dt(l[ne + m], l[se + m]) : ft(l[ne + m], l[se + m]), ie = me.a, l[se + m] = me.b, l[ne + m] = ie;
           }
         }
-        if (P & U) {
+        if (L & U) {
           let ne = Z;
           const ee = Z + R * (g - j);
           for (; ne <= ee; ne += $) {
@@ -8188,9 +8191,9 @@ class hu extends Co {
       }
       return Z;
     }
-    function rn(l, m, g, R, P, z, A, H, k) {
+    function rn(l, m, g, R, L, z, v, H, k) {
       let U = 0, j = 0;
-      const Z = A, G = Math.trunc(R.value + (P + 7) / 8);
+      const Z = v, G = Math.trunc(R.value + (L + 7) / 8);
       for (; R.value < G; )
         for (Ae(U, j, g, R), U = Ge.c, j = Ge.lc; j >= 14; ) {
           const J = U >> j - 14 & 16383, K = m[J];
@@ -8213,7 +8216,7 @@ class hu extends Co {
               throw new Error("THREE.EXRLoader: hufDecode issues");
           }
         }
-      const X = 8 - P & 7;
+      const X = 8 - L & 7;
       for (U >>= X, j -= X; j > 0; ) {
         const J = m[U << 14 - j & 16383];
         if (J.len)
@@ -8223,8 +8226,8 @@ class hu extends Co {
       }
       return !0;
     }
-    function It(l, m, g, R, P, z) {
-      const A = { value: 0 }, H = g.value, k = st(m, g), U = st(m, g);
+    function It(l, m, g, R, L, z) {
+      const v = { value: 0 }, H = g.value, k = st(m, g), U = st(m, g);
       g.value += 4;
       const j = st(m, g);
       if (g.value += 4, k < 0 || k >= 65537 || U < 0 || U >= 65537)
@@ -8234,7 +8237,7 @@ class hu extends Co {
       const X = R - (g.value - H);
       if (Ne(l, g, X, k, U, Z), j > 8 * (R - (g.value - H)))
         throw new Error("THREE.EXRLoader: Something wrong with hufUncompress");
-      Ue(Z, k, U, G), rn(Z, G, l, g, j, U, z, P, A);
+      Ue(Z, k, U, G), rn(Z, G, l, g, j, U, z, L, v);
     }
     function ts(l, m, g) {
       for (let R = 0; R < g; ++R)
@@ -8247,35 +8250,35 @@ class hu extends Co {
       }
     }
     function ss(l, m) {
-      let g = 0, R = Math.floor((l.length + 1) / 2), P = 0;
+      let g = 0, R = Math.floor((l.length + 1) / 2), L = 0;
       const z = l.length - 1;
-      for (; !(P > z || (m[P++] = l[g++], P > z)); )
-        m[P++] = l[R++];
+      for (; !(L > z || (m[L++] = l[g++], L > z)); )
+        m[L++] = l[R++];
     }
     function Qs(l) {
       let m = l.byteLength;
       const g = new Array();
       let R = 0;
-      const P = new DataView(l);
+      const L = new DataView(l);
       for (; m > 0; ) {
-        const z = P.getInt8(R++);
+        const z = L.getInt8(R++);
         if (z < 0) {
-          const A = -z;
-          m -= A + 1;
-          for (let H = 0; H < A; H++)
-            g.push(P.getUint8(R++));
+          const v = -z;
+          m -= v + 1;
+          for (let H = 0; H < v; H++)
+            g.push(L.getUint8(R++));
         } else {
-          const A = z;
+          const v = z;
           m -= 2;
-          const H = P.getUint8(R++);
-          for (let k = 0; k < A + 1; k++)
+          const H = L.getUint8(R++);
+          for (let k = 0; k < v + 1; k++)
             g.push(H);
         }
       }
       return g;
     }
-    function ua(l, m, g, R, P, z) {
-      let A = new DataView(z.buffer);
+    function ua(l, m, g, R, L, z) {
+      let v = new DataView(z.buffer);
       const H = g[l.idx[0]].width, k = g[l.idx[0]].height, U = 3, j = Math.floor(H / 8), Z = Math.ceil(H / 8), G = Math.ceil(k / 8), X = H - (Z - 1) * 8, J = k - (G - 1) * 8, K = { value: 0 }, $ = new Array(U), ie = new Array(U), le = new Array(U), oe = new Array(U), ue = new Array(U);
       for (let ee = 0; ee < U; ++ee)
         ue[ee] = m[l.idx[ee]], $[ee] = ee < 1 ? 0 : $[ee - 1] + Z * G, ie[ee] = new Float32Array(64), le[ee] = new Uint16Array(64), oe[ee] = new Uint16Array(Z * 64);
@@ -8286,7 +8289,7 @@ class hu extends Co {
         for (let ae = 0; ae < Z; ++ae) {
           ae == Z - 1 && (ye = X);
           for (let he = 0; he < U; ++he)
-            le[he].fill(0), le[he][0] = P[$[he]++], pr(K, R, le[he]), mr(le[he], ie[he]), gr(ie[he]);
+            le[he].fill(0), le[he][0] = L[$[he]++], pr(K, R, le[he]), mr(le[he], ie[he]), gr(ie[he]);
           fa(ie);
           for (let he = 0; he < U; ++he)
             yr(ie[he], oe[he], ae * 64);
@@ -8298,19 +8301,19 @@ class hu extends Co {
             fe = ue[ae][Me];
             for (let it = 0; it < j; ++it) {
               const _e = it * 64 + (Me & 7) * 8;
-              A.setUint16(fe + 0 * he, oe[ae][_e + 0], !0), A.setUint16(fe + 2 * he, oe[ae][_e + 1], !0), A.setUint16(fe + 4 * he, oe[ae][_e + 2], !0), A.setUint16(fe + 6 * he, oe[ae][_e + 3], !0), A.setUint16(fe + 8 * he, oe[ae][_e + 4], !0), A.setUint16(fe + 10 * he, oe[ae][_e + 5], !0), A.setUint16(fe + 12 * he, oe[ae][_e + 6], !0), A.setUint16(fe + 14 * he, oe[ae][_e + 7], !0), fe += 16 * he;
+              v.setUint16(fe + 0 * he, oe[ae][_e + 0], !0), v.setUint16(fe + 2 * he, oe[ae][_e + 1], !0), v.setUint16(fe + 4 * he, oe[ae][_e + 2], !0), v.setUint16(fe + 6 * he, oe[ae][_e + 3], !0), v.setUint16(fe + 8 * he, oe[ae][_e + 4], !0), v.setUint16(fe + 10 * he, oe[ae][_e + 5], !0), v.setUint16(fe + 12 * he, oe[ae][_e + 6], !0), v.setUint16(fe + 14 * he, oe[ae][_e + 7], !0), fe += 16 * he;
             }
           }
           if (j != Z)
             for (let Me = 8 * ee; Me < 8 * ee + se; ++Me) {
               const it = ue[ae][Me] + 8 * j * 2 * he, _e = j * 64 + (Me & 7) * 8;
               for (let bt = 0; bt < ye; ++bt)
-                A.setUint16(it + bt * 2 * he, oe[ae][_e + bt], !0);
+                v.setUint16(it + bt * 2 * he, oe[ae][_e + bt], !0);
             }
         }
       }
       const ne = new Uint16Array(H);
-      A = new DataView(z.buffer);
+      v = new DataView(z.buffer);
       for (let ee = 0; ee < U; ++ee) {
         g[l.idx[ee]].decoded = !0;
         const se = g[l.idx[ee]].type;
@@ -8318,59 +8321,59 @@ class hu extends Co {
           for (let ye = 0; ye < k; ++ye) {
             const fe = ue[ee][ye];
             for (let ae = 0; ae < H; ++ae)
-              ne[ae] = A.getUint16(fe + ae * 2 * se, !0);
+              ne[ae] = v.getUint16(fe + ae * 2 * se, !0);
             for (let ae = 0; ae < H; ++ae)
-              A.setFloat32(fe + ae * 2 * se, Q(ne[ae]), !0);
+              v.setFloat32(fe + ae * 2 * se, Q(ne[ae]), !0);
           }
       }
     }
-    function da(l, m, g, R, P, z) {
-      const A = new DataView(z.buffer), H = g[l], k = H.width, U = H.height, j = Math.ceil(k / 8), Z = Math.ceil(U / 8), G = Math.floor(k / 8), X = k - (j - 1) * 8, J = U - (Z - 1) * 8, K = { value: 0 };
+    function da(l, m, g, R, L, z) {
+      const v = new DataView(z.buffer), H = g[l], k = H.width, U = H.height, j = Math.ceil(k / 8), Z = Math.ceil(U / 8), G = Math.floor(k / 8), X = k - (j - 1) * 8, J = U - (Z - 1) * 8, K = { value: 0 };
       let $ = 0;
       const ie = new Float32Array(64), le = new Uint16Array(64), oe = new Uint16Array(j * 64);
       for (let ue = 0; ue < Z; ++ue) {
         let ne = 8;
         ue == Z - 1 && (ne = J);
         for (let ee = 0; ee < j; ++ee)
-          le.fill(0), le[0] = P[$++], pr(K, R, le), mr(le, ie), gr(ie), yr(ie, oe, ee * 64);
+          le.fill(0), le[0] = L[$++], pr(K, R, le), mr(le, ie), gr(ie), yr(ie, oe, ee * 64);
         for (let ee = 8 * ue; ee < 8 * ue + ne; ++ee) {
           let se = m[l][ee];
           for (let ye = 0; ye < G; ++ye) {
             const fe = ye * 64 + (ee & 7) * 8;
             for (let ae = 0; ae < 8; ++ae)
-              A.setUint16(se + ae * 2 * H.type, oe[fe + ae], !0);
+              v.setUint16(se + ae * 2 * H.type, oe[fe + ae], !0);
             se += 16 * H.type;
           }
           if (j != G) {
             const ye = G * 64 + (ee & 7) * 8;
             for (let fe = 0; fe < X; ++fe)
-              A.setUint16(se + fe * 2 * H.type, oe[ye + fe], !0);
+              v.setUint16(se + fe * 2 * H.type, oe[ye + fe], !0);
           }
         }
       }
       H.decoded = !0;
     }
     function pr(l, m, g) {
-      let R, P = 1;
-      for (; P < 64; )
-        R = m[l.value], R == 65280 ? P = 64 : R >> 8 == 255 ? P += R & 255 : (g[P] = R, P++), l.value++;
+      let R, L = 1;
+      for (; L < 64; )
+        R = m[l.value], R == 65280 ? L = 64 : R >> 8 == 255 ? L += R & 255 : (g[L] = R, L++), l.value++;
     }
     function mr(l, m) {
       m[0] = Q(l[0]), m[1] = Q(l[1]), m[2] = Q(l[5]), m[3] = Q(l[6]), m[4] = Q(l[14]), m[5] = Q(l[15]), m[6] = Q(l[27]), m[7] = Q(l[28]), m[8] = Q(l[2]), m[9] = Q(l[4]), m[10] = Q(l[7]), m[11] = Q(l[13]), m[12] = Q(l[16]), m[13] = Q(l[26]), m[14] = Q(l[29]), m[15] = Q(l[42]), m[16] = Q(l[3]), m[17] = Q(l[8]), m[18] = Q(l[12]), m[19] = Q(l[17]), m[20] = Q(l[25]), m[21] = Q(l[30]), m[22] = Q(l[41]), m[23] = Q(l[43]), m[24] = Q(l[9]), m[25] = Q(l[11]), m[26] = Q(l[18]), m[27] = Q(l[24]), m[28] = Q(l[31]), m[29] = Q(l[40]), m[30] = Q(l[44]), m[31] = Q(l[53]), m[32] = Q(l[10]), m[33] = Q(l[19]), m[34] = Q(l[23]), m[35] = Q(l[32]), m[36] = Q(l[39]), m[37] = Q(l[45]), m[38] = Q(l[52]), m[39] = Q(l[54]), m[40] = Q(l[20]), m[41] = Q(l[22]), m[42] = Q(l[33]), m[43] = Q(l[38]), m[44] = Q(l[46]), m[45] = Q(l[51]), m[46] = Q(l[55]), m[47] = Q(l[60]), m[48] = Q(l[21]), m[49] = Q(l[34]), m[50] = Q(l[37]), m[51] = Q(l[47]), m[52] = Q(l[50]), m[53] = Q(l[56]), m[54] = Q(l[59]), m[55] = Q(l[61]), m[56] = Q(l[35]), m[57] = Q(l[36]), m[58] = Q(l[48]), m[59] = Q(l[49]), m[60] = Q(l[57]), m[61] = Q(l[58]), m[62] = Q(l[62]), m[63] = Q(l[63]);
     }
     function gr(l) {
-      const m = 0.5 * Math.cos(0.7853975), g = 0.5 * Math.cos(3.14159 / 16), R = 0.5 * Math.cos(3.14159 / 8), P = 0.5 * Math.cos(3 * 3.14159 / 16), z = 0.5 * Math.cos(5 * 3.14159 / 16), A = 0.5 * Math.cos(3 * 3.14159 / 8), H = 0.5 * Math.cos(7 * 3.14159 / 16), k = new Array(4), U = new Array(4), j = new Array(4), Z = new Array(4);
+      const m = 0.5 * Math.cos(0.7853975), g = 0.5 * Math.cos(3.14159 / 16), R = 0.5 * Math.cos(3.14159 / 8), L = 0.5 * Math.cos(3 * 3.14159 / 16), z = 0.5 * Math.cos(5 * 3.14159 / 16), v = 0.5 * Math.cos(3 * 3.14159 / 8), H = 0.5 * Math.cos(7 * 3.14159 / 16), k = new Array(4), U = new Array(4), j = new Array(4), Z = new Array(4);
       for (let G = 0; G < 8; ++G) {
         const X = G * 8;
-        k[0] = R * l[X + 2], k[1] = A * l[X + 2], k[2] = R * l[X + 6], k[3] = A * l[X + 6], U[0] = g * l[X + 1] + P * l[X + 3] + z * l[X + 5] + H * l[X + 7], U[1] = P * l[X + 1] - H * l[X + 3] - g * l[X + 5] - z * l[X + 7], U[2] = z * l[X + 1] - g * l[X + 3] + H * l[X + 5] + P * l[X + 7], U[3] = H * l[X + 1] - z * l[X + 3] + P * l[X + 5] - g * l[X + 7], j[0] = m * (l[X + 0] + l[X + 4]), j[3] = m * (l[X + 0] - l[X + 4]), j[1] = k[0] + k[3], j[2] = k[1] - k[2], Z[0] = j[0] + j[1], Z[1] = j[3] + j[2], Z[2] = j[3] - j[2], Z[3] = j[0] - j[1], l[X + 0] = Z[0] + U[0], l[X + 1] = Z[1] + U[1], l[X + 2] = Z[2] + U[2], l[X + 3] = Z[3] + U[3], l[X + 4] = Z[3] - U[3], l[X + 5] = Z[2] - U[2], l[X + 6] = Z[1] - U[1], l[X + 7] = Z[0] - U[0];
+        k[0] = R * l[X + 2], k[1] = v * l[X + 2], k[2] = R * l[X + 6], k[3] = v * l[X + 6], U[0] = g * l[X + 1] + L * l[X + 3] + z * l[X + 5] + H * l[X + 7], U[1] = L * l[X + 1] - H * l[X + 3] - g * l[X + 5] - z * l[X + 7], U[2] = z * l[X + 1] - g * l[X + 3] + H * l[X + 5] + L * l[X + 7], U[3] = H * l[X + 1] - z * l[X + 3] + L * l[X + 5] - g * l[X + 7], j[0] = m * (l[X + 0] + l[X + 4]), j[3] = m * (l[X + 0] - l[X + 4]), j[1] = k[0] + k[3], j[2] = k[1] - k[2], Z[0] = j[0] + j[1], Z[1] = j[3] + j[2], Z[2] = j[3] - j[2], Z[3] = j[0] - j[1], l[X + 0] = Z[0] + U[0], l[X + 1] = Z[1] + U[1], l[X + 2] = Z[2] + U[2], l[X + 3] = Z[3] + U[3], l[X + 4] = Z[3] - U[3], l[X + 5] = Z[2] - U[2], l[X + 6] = Z[1] - U[1], l[X + 7] = Z[0] - U[0];
       }
       for (let G = 0; G < 8; ++G)
-        k[0] = R * l[16 + G], k[1] = A * l[16 + G], k[2] = R * l[48 + G], k[3] = A * l[48 + G], U[0] = g * l[8 + G] + P * l[24 + G] + z * l[40 + G] + H * l[56 + G], U[1] = P * l[8 + G] - H * l[24 + G] - g * l[40 + G] - z * l[56 + G], U[2] = z * l[8 + G] - g * l[24 + G] + H * l[40 + G] + P * l[56 + G], U[3] = H * l[8 + G] - z * l[24 + G] + P * l[40 + G] - g * l[56 + G], j[0] = m * (l[G] + l[32 + G]), j[3] = m * (l[G] - l[32 + G]), j[1] = k[0] + k[3], j[2] = k[1] - k[2], Z[0] = j[0] + j[1], Z[1] = j[3] + j[2], Z[2] = j[3] - j[2], Z[3] = j[0] - j[1], l[0 + G] = Z[0] + U[0], l[8 + G] = Z[1] + U[1], l[16 + G] = Z[2] + U[2], l[24 + G] = Z[3] + U[3], l[32 + G] = Z[3] - U[3], l[40 + G] = Z[2] - U[2], l[48 + G] = Z[1] - U[1], l[56 + G] = Z[0] - U[0];
+        k[0] = R * l[16 + G], k[1] = v * l[16 + G], k[2] = R * l[48 + G], k[3] = v * l[48 + G], U[0] = g * l[8 + G] + L * l[24 + G] + z * l[40 + G] + H * l[56 + G], U[1] = L * l[8 + G] - H * l[24 + G] - g * l[40 + G] - z * l[56 + G], U[2] = z * l[8 + G] - g * l[24 + G] + H * l[40 + G] + L * l[56 + G], U[3] = H * l[8 + G] - z * l[24 + G] + L * l[40 + G] - g * l[56 + G], j[0] = m * (l[G] + l[32 + G]), j[3] = m * (l[G] - l[32 + G]), j[1] = k[0] + k[3], j[2] = k[1] - k[2], Z[0] = j[0] + j[1], Z[1] = j[3] + j[2], Z[2] = j[3] - j[2], Z[3] = j[0] - j[1], l[0 + G] = Z[0] + U[0], l[8 + G] = Z[1] + U[1], l[16 + G] = Z[2] + U[2], l[24 + G] = Z[3] + U[3], l[32 + G] = Z[3] - U[3], l[40 + G] = Z[2] - U[2], l[48 + G] = Z[1] - U[1], l[56 + G] = Z[0] - U[0];
     }
     function fa(l) {
       for (let m = 0; m < 64; ++m) {
-        const g = l[0][m], R = l[1][m], P = l[2][m];
-        l[0][m] = g + 1.5747 * P, l[1][m] = g - 0.1873 * R - 0.4682 * P, l[2][m] = g + 1.8556 * R;
+        const g = l[0][m], R = l[1][m], L = l[2][m];
+        l[0][m] = g + 1.5747 * L, l[1][m] = g - 0.1873 * R - 0.4682 * L, l[2][m] = g + 1.8556 * R;
       }
     }
     function yr(l, m, g) {
@@ -8392,22 +8395,22 @@ class hu extends Co {
       return ns(g), ss(g, R), new DataView(R.buffer);
     }
     function ga(l) {
-      const m = l.viewer, g = { value: l.offset.value }, R = new Uint16Array(l.columns * l.lines * (l.inputChannels.length * l.type)), P = new Uint8Array(8192);
+      const m = l.viewer, g = { value: l.offset.value }, R = new Uint16Array(l.columns * l.lines * (l.inputChannels.length * l.type)), L = new Uint8Array(8192);
       let z = 0;
-      const A = new Array(l.inputChannels.length);
+      const v = new Array(l.inputChannels.length);
       for (let J = 0, K = l.inputChannels.length; J < K; J++)
-        A[J] = {}, A[J].start = z, A[J].end = A[J].start, A[J].nx = l.columns, A[J].ny = l.lines, A[J].size = l.type, z += A[J].nx * A[J].ny * A[J].size;
+        v[J] = {}, v[J].start = z, v[J].end = v[J].start, v[J].nx = l.columns, v[J].ny = l.lines, v[J].size = l.type, z += v[J].nx * v[J].ny * v[J].size;
       const H = vn(m, g), k = vn(m, g);
       if (k >= 8192)
         throw new Error("THREE.EXRLoader: Something is wrong with PIZ_COMPRESSION BITMAP_SIZE");
       if (H <= k)
         for (let J = 0; J < k - H + 1; J++)
-          P[J + H] = Ft(m, g);
-      const U = new Uint16Array(65536), j = N(P, U), Z = st(m, g);
+          L[J + H] = Ft(m, g);
+      const U = new Uint16Array(65536), j = N(L, U), Z = st(m, g);
       It(l.array, m, g, Z, R, z);
       for (let J = 0; J < l.inputChannels.length; ++J) {
-        const K = A[J];
-        for (let $ = 0; $ < A[J].size; ++$)
+        const K = v[J];
+        for (let $ = 0; $ < v[J].size; ++$)
           An(
             R,
             K.start + $,
@@ -8423,28 +8426,28 @@ class hu extends Co {
       const X = new Uint8Array(R.buffer.byteLength);
       for (let J = 0; J < l.lines; J++)
         for (let K = 0; K < l.inputChannels.length; K++) {
-          const $ = A[K], ie = $.nx * $.size, le = new Uint8Array(R.buffer, $.end * 2, ie * 2);
+          const $ = v[K], ie = $.nx * $.size, le = new Uint8Array(R.buffer, $.end * 2, ie * 2);
           X.set(le, G), G += ie * 2, $.end += ie;
         }
       return new DataView(X.buffer);
     }
     function ya(l) {
-      const m = l.array.slice(l.offset.value, l.offset.value + l.size), g = zn(m), R = l.inputChannels.length * l.lines * l.columns * l.totalBytes, P = new ArrayBuffer(R), z = new DataView(P);
-      let A = 0, H = 0;
+      const m = l.array.slice(l.offset.value, l.offset.value + l.size), g = zn(m), R = l.inputChannels.length * l.lines * l.columns * l.totalBytes, L = new ArrayBuffer(R), z = new DataView(L);
+      let v = 0, H = 0;
       const k = new Array(4);
       for (let U = 0; U < l.lines; U++)
         for (let j = 0; j < l.inputChannels.length; j++) {
           let Z = 0;
           switch (l.inputChannels[j].pixelType) {
             case 1:
-              k[0] = A, k[1] = k[0] + l.columns, A = k[1] + l.columns;
+              k[0] = v, k[1] = k[0] + l.columns, v = k[1] + l.columns;
               for (let X = 0; X < l.columns; ++X) {
                 const J = g[k[0]++] << 8 | g[k[1]++];
                 Z += J, z.setUint16(H, Z, !0), H += 2;
               }
               break;
             case 2:
-              k[0] = A, k[1] = k[0] + l.columns, k[2] = k[1] + l.columns, A = k[2] + l.columns;
+              k[0] = v, k[1] = k[0] + l.columns, k[2] = k[1] + l.columns, v = k[2] + l.columns;
               for (let X = 0; X < l.columns; ++X) {
                 const J = g[k[0]++] << 24 | g[k[1]++] << 16 | g[k[2]++] << 8;
                 Z += J, z.setUint32(H, Z, !0), H += 4;
@@ -8457,14 +8460,14 @@ class hu extends Co {
     function wa(l) {
       const m = l.array;
       let g = l.offset.value;
-      const R = l.columns, P = l.lines, z = l.inputChannels, A = l.totalBytes, H = We.compression === "B44A_COMPRESSION", k = new Uint8Array(P * R * A), U = new Uint16Array(16);
+      const R = l.columns, L = l.lines, z = l.inputChannels, v = l.totalBytes, H = We.compression === "B44A_COMPRESSION", k = new Uint8Array(L * R * v), U = new Uint16Array(16);
       let j = 0;
       for (let Z = 0; Z < z.length; Z++) {
-        const G = z[Z], X = G.pixelType * 2, J = Math.ceil(R / G.xSampling), K = Math.ceil(P / G.ySampling), $ = G.xSampling === 1 && G.ySampling === 1;
+        const G = z[Z], X = G.pixelType * 2, J = Math.ceil(R / G.xSampling), K = Math.ceil(L / G.ySampling), $ = G.xSampling === 1 && G.ySampling === 1;
         if (G.pixelType !== 1) {
           for (let oe = 0; oe < K; oe++)
             if ($) {
-              const ue = oe * R * A + j * R;
+              const ue = oe * R * v + j * R;
               for (let ne = 0; ne < J * X; ne++)
                 k[ue + ne] = m[g++];
             } else
@@ -8485,17 +8488,17 @@ class hu extends Co {
               g += 14;
             }
             if (G.pLinear) {
-              if (I === null) {
-                I = new Uint16Array(65536);
+              if (C === null) {
+                C = new Uint16Array(65536);
                 for (let ne = 0; ne < 65536; ne++)
                   if ((ne & 31744) === 31744 || ne > 32768)
-                    I[ne] = 0;
+                    C[ne] = 0;
                   else {
                     const ee = Q(ne);
-                    I[ne] = ee <= 0 ? 0 : wt.toHalfFloat(8 * Math.log(ee));
+                    C[ne] = ee <= 0 ? 0 : wt.toHalfFloat(8 * Math.log(ee));
                   }
               }
-              for (let ne = 0; ne < 16; ne++) U[ne] = I[U[ne]];
+              for (let ne = 0; ne < 16; ne++) U[ne] = C[U[ne]];
             }
             for (let ne = 0; ne < 4; ne++) {
               const ee = oe * 4 + ne;
@@ -8506,11 +8509,11 @@ class hu extends Co {
                   const fe = U[ne * 4 + se];
                   for (let ae = 0; ae < G.ySampling; ae++) {
                     const he = ee * G.ySampling + ae;
-                    if (!(he >= P))
+                    if (!(he >= L))
                       for (let Me = 0; Me < G.xSampling; Me++) {
                         const it = ye * G.xSampling + Me;
                         if (it >= R) continue;
-                        const _e = he * R * A + j * R + it * 2;
+                        const _e = he * R * v + j * R + it * 2;
                         k[_e] = fe & 255, k[_e + 1] = fe >> 8 & 255;
                       }
                   }
@@ -8522,7 +8525,7 @@ class hu extends Co {
       return new DataView(k.buffer);
     }
     function wr(l) {
-      const m = l.viewer, g = { value: l.offset.value }, R = new Uint8Array(l.columns * l.lines * (l.inputChannels.length * l.type * 2)), P = {
+      const m = l.viewer, g = { value: l.offset.value }, R = new Uint8Array(l.columns * l.lines * (l.inputChannels.length * l.type * 2)), L = {
         version: ke(m, g),
         unknownUncompressedSize: ke(m, g),
         unknownCompressedSize: ke(m, g),
@@ -8535,18 +8538,18 @@ class hu extends Co {
         totalDcUncompressedCount: ke(m, g),
         acCompression: ke(m, g)
       };
-      if (P.version < 2)
-        throw new Error("THREE.EXRLoader: " + We.compression + " version " + P.version + " is unsupported");
+      if (L.version < 2)
+        throw new Error("THREE.EXRLoader: " + We.compression + " version " + L.version + " is unsupported");
       const z = new Array();
-      let A = vn(m, g) - 2;
-      for (; A > 0; ) {
+      let v = vn(m, g) - 2;
+      for (; v > 0; ) {
         const K = rs(m.buffer, g), $ = Ft(m, g), ie = $ >> 2 & 3, le = ($ >> 4) - 1, oe = new Int8Array([le])[0], ue = Ft(m, g);
         z.push({
           name: K,
           index: oe,
           type: ue,
           compression: ie
-        }), A -= K.length + 3;
+        }), v -= K.length + 3;
       }
       const H = We.channels, k = new Array(l.inputChannels.length);
       for (let K = 0; K < l.inputChannels.length; ++K) {
@@ -8564,27 +8567,27 @@ class hu extends Co {
         }
       }
       let j, Z, G;
-      if (P.acCompressedSize > 0)
-        switch (P.acCompression) {
+      if (L.acCompressedSize > 0)
+        switch (L.acCompression) {
           case 0:
-            j = new Uint16Array(P.totalAcUncompressedCount), It(l.array, m, g, P.acCompressedSize, j, P.totalAcUncompressedCount);
+            j = new Uint16Array(L.totalAcUncompressedCount), It(l.array, m, g, L.acCompressedSize, j, L.totalAcUncompressedCount);
             break;
           case 1:
-            const K = l.array.slice(g.value, g.value + P.totalAcUncompressedCount), $ = zn(K);
-            j = new Uint16Array($.buffer), g.value += P.totalAcUncompressedCount;
+            const K = l.array.slice(g.value, g.value + L.totalAcUncompressedCount), $ = zn(K);
+            j = new Uint16Array($.buffer), g.value += L.totalAcUncompressedCount;
             break;
         }
-      if (P.dcCompressedSize > 0) {
+      if (L.dcCompressedSize > 0) {
         const K = {
           array: l.array,
           offset: g,
-          size: P.dcCompressedSize
+          size: L.dcCompressedSize
         };
-        Z = new Uint16Array(Js(K).buffer), g.value += P.dcCompressedSize;
+        Z = new Uint16Array(Js(K).buffer), g.value += L.dcCompressedSize;
       }
-      if (P.rleRawSize > 0) {
-        const K = l.array.slice(g.value, g.value + P.rleCompressedSize), $ = zn(K);
-        G = Qs($.buffer), g.value += P.rleCompressedSize;
+      if (L.rleRawSize > 0) {
+        const K = l.array.slice(g.value, g.value + L.rleCompressedSize), $ = zn(K);
+        G = Qs($.buffer), g.value += L.rleCompressedSize;
       }
       let X = 0;
       const J = new Array(k.length);
@@ -8624,10 +8627,10 @@ class hu extends Co {
       let R = 0;
       for (; g[m.value + R] != 0; )
         R += 1;
-      const P = new TextDecoder().decode(
+      const L = new TextDecoder().decode(
         g.slice(m.value, m.value + R)
       );
-      return m.value = m.value + R + 1, P;
+      return m.value = m.value + R + 1, L;
     }
     function Ea(l, m, g) {
       const R = new TextDecoder().decode(
@@ -8682,13 +8685,13 @@ class hu extends Co {
       return Q(vn(l, m));
     }
     function xa(l, m, g, R) {
-      const P = g.value, z = [];
-      for (; g.value < P + R - 1; ) {
-        const A = rs(m, g), H = et(l, g), k = Ft(l, g);
+      const L = g.value, z = [];
+      for (; g.value < L + R - 1; ) {
+        const v = rs(m, g), H = et(l, g), k = Ft(l, g);
         g.value += 3;
         const U = et(l, g), j = et(l, g);
         z.push({
-          name: A,
+          name: v,
           pixelType: H,
           pLinear: k,
           xSampling: U,
@@ -8698,8 +8701,8 @@ class hu extends Co {
       return g.value += 1, z;
     }
     function Aa(l, m) {
-      const g = Ze(l, m), R = Ze(l, m), P = Ze(l, m), z = Ze(l, m), A = Ze(l, m), H = Ze(l, m), k = Ze(l, m), U = Ze(l, m);
-      return { redX: g, redY: R, greenX: P, greenY: z, blueX: A, blueY: H, whiteX: k, whiteY: U };
+      const g = Ze(l, m), R = Ze(l, m), L = Ze(l, m), z = Ze(l, m), v = Ze(l, m), H = Ze(l, m), k = Ze(l, m), U = Ze(l, m);
+      return { redX: g, redY: R, greenX: L, greenY: z, blueX: v, blueY: H, whiteX: k, whiteY: U };
     }
     function va(l, m) {
       const g = [
@@ -8717,8 +8720,8 @@ class hu extends Co {
       return g[R];
     }
     function Ra(l, m) {
-      const g = et(l, m), R = et(l, m), P = et(l, m), z = et(l, m);
-      return { xMin: g, yMin: R, xMax: P, yMax: z };
+      const g = et(l, m), R = et(l, m), L = et(l, m), z = et(l, m);
+      return { xMin: g, yMin: R, xMax: L, yMax: z };
     }
     function Ma(l, m) {
       const g = [
@@ -8743,12 +8746,12 @@ class hu extends Co {
       ], R = [
         "ROUND_DOWN",
         "ROUND_UP"
-      ], P = st(l, m), z = st(l, m), A = Ft(l, m);
+      ], L = st(l, m), z = st(l, m), v = Ft(l, m);
       return {
-        xSize: P,
+        xSize: L,
         ySize: z,
-        levelMode: g[A & 15],
-        roundingMode: R[A >> 4]
+        levelMode: g[v & 15],
+        roundingMode: R[v >> 4]
       };
     }
     function Pa(l, m) {
@@ -8756,14 +8759,14 @@ class hu extends Co {
       return [g, R];
     }
     function La(l, m) {
-      const g = Ze(l, m), R = Ze(l, m), P = Ze(l, m);
-      return [g, R, P];
+      const g = Ze(l, m), R = Ze(l, m), L = Ze(l, m);
+      return [g, R, L];
     }
-    function Oa(l, m, g, R, P) {
+    function Oa(l, m, g, R, L) {
       if (R === "string" || R === "stringvector" || R === "iccProfile")
-        return Ea(m, g, P);
+        return Ea(m, g, L);
       if (R === "chlist")
-        return xa(l, m, g, P);
+        return xa(l, m, g, L);
       if (R === "chromaticities")
         return Aa(l, g);
       if (R === "compression")
@@ -8789,8 +8792,8 @@ class hu extends Co {
       if (R === "timecode")
         return _a(l, g);
       if (R === "preview" || R === "deepImageState" || R === "idmanifest")
-        return g.value += P, "skipped";
-      g.value += P;
+        return g.value += L, "skipped";
+      g.value += L;
     }
     function Da(l, m) {
       const g = Math.log2(l);
@@ -8811,23 +8814,23 @@ class hu extends Co {
       return R;
     }
     function Tr(l, m, g, R) {
-      const P = new Array(l);
+      const L = new Array(l);
       for (let z = 0; z < l; z++) {
-        const A = 1 << z;
-        let H = m / A | 0;
-        R == "ROUND_UP" && H * A < m && (H += 1);
+        const v = 1 << z;
+        let H = m / v | 0;
+        R == "ROUND_UP" && H * v < m && (H += 1);
         const k = Math.max(H, 1);
-        P[z] = (k + g - 1) / g | 0;
+        L[z] = (k + g - 1) / g | 0;
       }
-      return P;
+      return L;
     }
     function ka() {
       const l = this, m = l.offset, g = { value: 0 };
       for (let R = 0; R < l.tileCount; R++) {
-        const P = et(l.viewer, m), z = et(l.viewer, m);
+        const L = et(l.viewer, m), z = et(l.viewer, m);
         m.value += 8, l.size = st(l.viewer, m);
-        const A = P * l.blockWidth, H = z * l.blockHeight;
-        l.columns = A + l.blockWidth > l.width ? l.width - A : l.blockWidth, l.lines = H + l.blockHeight > l.height ? l.height - H : l.blockHeight;
+        const v = L * l.blockWidth, H = z * l.blockHeight;
+        l.columns = v + l.blockWidth > l.width ? l.width - v : l.blockWidth, l.lines = H + l.blockHeight > l.height ? l.height - H : l.blockHeight;
         const k = l.columns * l.totalBytes, j = l.size < l.lines * k ? l.uncompress(l) : is(l);
         m.value += l.size;
         for (let Z = 0; Z < l.lines; Z++) {
@@ -8838,7 +8841,7 @@ class hu extends Co {
             g.value = G + K;
             const ie = (l.height - (1 + H + Z)) * l.outLineWidth;
             for (let le = 0; le < l.columns; le++) {
-              const oe = ie + (le + A) * l.outputChannels + $;
+              const oe = ie + (le + v) * l.outputChannels + $;
               l.byteArray[oe] = l.getter(j, g);
             }
           }
@@ -8848,12 +8851,12 @@ class hu extends Co {
     function Fa() {
       const l = this, m = l.offset, g = { value: 0 };
       for (let R = 0; R < l.height / l.blockHeight; R++) {
-        const P = et(l.viewer, m) - We.dataWindow.yMin;
-        l.size = st(l.viewer, m), l.lines = P + l.blockHeight > l.height ? l.height - P : l.blockHeight;
+        const L = et(l.viewer, m) - We.dataWindow.yMin;
+        l.size = st(l.viewer, m), l.lines = L + l.blockHeight > l.height ? l.height - L : l.blockHeight;
         const z = l.columns * l.totalBytes, H = l.size < l.lines * z ? l.uncompress(l) : is(l);
         m.value += l.size;
         for (let k = 0; k < l.lines; k++) {
-          const U = P + k, j = k * z, Z = (l.height - 1 - U) * l.outLineWidth;
+          const U = L + k, j = k * z, Z = (l.height - 1 - U) * l.outLineWidth;
           for (let G = 0; G < l.inputChannels.length; G++) {
             const X = We.channels[G].name, J = l.channelByteOffsets[X] * l.columns, K = l.decodeChannels[X];
             if (K !== void 0) {
@@ -8870,16 +8873,16 @@ class hu extends Co {
     function za() {
       const l = this, m = l.chunkOffsets, g = { value: 0 };
       for (let R = 0; R < m.length; R++) {
-        const P = { value: m[R] };
-        P.value += 4;
-        const z = et(l.viewer, P) - We.dataWindow.yMin;
-        l.size = st(l.viewer, P), l.lines = z + l.blockHeight > l.height ? l.height - z : l.blockHeight;
-        const A = l.columns * l.totalBytes, H = l.size < l.lines * A, k = l.offset;
-        l.offset = P;
+        const L = { value: m[R] };
+        L.value += 4;
+        const z = et(l.viewer, L) - We.dataWindow.yMin;
+        l.size = st(l.viewer, L), l.lines = z + l.blockHeight > l.height ? l.height - z : l.blockHeight;
+        const v = l.columns * l.totalBytes, H = l.size < l.lines * v, k = l.offset;
+        l.offset = L;
         const U = H ? l.uncompress(l) : is(l);
         l.offset = k;
         for (let j = 0; j < l.lines; j++) {
-          const Z = z + j, G = j * A, X = (l.height - 1 - Z) * l.outLineWidth;
+          const Z = z + j, G = j * v, X = (l.height - 1 - Z) * l.outLineWidth;
           for (let J = 0; J < l.inputChannels.length; J++) {
             const K = We.channels[J].name, $ = l.channelByteOffsets[K] * l.columns, ie = l.decodeChannels[K];
             if (ie !== void 0) {
@@ -8895,33 +8898,33 @@ class hu extends Co {
     }
     function _r(l, m, g, R) {
       if (g === 0) return null;
-      const P = l.slice(m, m + g);
+      const L = l.slice(m, m + g);
       switch (R) {
         case "NO_COMPRESSION":
-          return new DataView(P.buffer, P.byteOffset, P.byteLength);
+          return new DataView(L.buffer, L.byteOffset, L.byteLength);
         case "RLE_COMPRESSION": {
-          const z = new Uint8Array(Qs(P.buffer.slice(P.byteOffset, P.byteOffset + P.byteLength))), A = new Uint8Array(z.length);
-          return ns(z), ss(z, A), new DataView(A.buffer);
+          const z = new Uint8Array(Qs(L.buffer.slice(L.byteOffset, L.byteOffset + L.byteLength))), v = new Uint8Array(z.length);
+          return ns(z), ss(z, v), new DataView(v.buffer);
         }
         case "ZIPS_COMPRESSION": {
-          const z = zn(P), A = new Uint8Array(z.length);
-          return ns(z), ss(z, A), new DataView(A.buffer);
+          const z = zn(L), v = new Uint8Array(z.length);
+          return ns(z), ss(z, v), new DataView(v.buffer);
         }
         default:
           throw new Error("THREE.EXRLoader: " + R + " is unsupported for deep data");
       }
     }
     function Ba() {
-      const l = this, m = l.chunkOffsets, g = l.width, R = l.height, P = l.deepChannels, z = We.compression, A = l.multiPart, H = l.decodeChannels, k = l.outputChannels, U = l.byteArray instanceof Uint16Array;
+      const l = this, m = l.chunkOffsets, g = l.width, R = l.height, L = l.deepChannels, z = We.compression, v = l.multiPart, H = l.decodeChannels, k = l.outputChannels, U = l.byteArray instanceof Uint16Array;
       let j = -1;
-      for (let Z = 0; Z < P.length; Z++)
-        if (P[Z].name === "A") {
+      for (let Z = 0; Z < L.length; Z++)
+        if (L[Z].name === "A") {
           j = Z;
           break;
         }
       for (let Z = 0; Z < m.length; Z++) {
         const G = { value: m[Z] };
-        A && (G.value += 4);
+        v && (G.value += 4);
         const X = et(l.viewer, G) - We.dataWindow.yMin, J = ke(l.viewer, G), K = ke(l.viewer, G);
         ke(l.viewer, G);
         const $ = _r(l.array, G.value, J, z);
@@ -8936,8 +8939,8 @@ class hu extends Co {
         }
         const oe = _r(l.array, G.value, K, z), ue = [];
         let ne = 0;
-        for (let se = 0; se < P.length; se++)
-          ue.push(ne), ne += le * P[se].bytesPerSample;
+        for (let se = 0; se < L.length; se++)
+          ue.push(ne), ne += le * L[se].bytesPerSample;
         const ee = (R - 1 - X) * l.outLineWidth;
         for (let se = 0; se < g; se++) {
           const ye = se === 0 ? 0 : ie[se - 1], ae = ie[se] - ye;
@@ -8949,11 +8952,11 @@ class hu extends Co {
             if (on <= 0) break;
             let Rn = 1;
             if (j >= 0) {
-              const xt = P[j].bytesPerSample, Xt = ue[j] + bt * xt;
+              const xt = L[j].bytesPerSample, Xt = ue[j] + bt * xt;
               Rn = xt === 2 ? Q(oe.getUint16(Xt, !0)) : oe.getFloat32(Xt, !0);
             }
-            for (let xt = 0; xt < P.length; xt++) {
-              const Xt = P[xt], ls = H[Xt.name];
+            for (let xt = 0; xt < L.length; xt++) {
+              const Xt = L[xt], ls = H[Xt.name];
               if (ls === void 0) continue;
               const hs = Xt.bytesPerSample, us = ue[xt] + bt * hs, Mn = hs === 2 ? Q(oe.getUint16(us, !0)) : oe.getFloat32(us, !0);
               he[ls] += Mn * on;
@@ -8969,43 +8972,43 @@ class hu extends Co {
     }
     function Sr(l, m, g) {
       const R = {};
-      let P = !1;
+      let L = !1;
       for (; ; ) {
         const z = rs(m, g);
         if (z === "") break;
-        P = !0;
-        const A = rs(m, g), H = st(l, g), k = Oa(l, m, g, A, H);
-        k === void 0 ? console.warn(`THREE.EXRLoader: Skipped unknown header attribute type '${A}'.`) : R[z] = k;
+        L = !0;
+        const v = rs(m, g), H = st(l, g), k = Oa(l, m, g, v, H);
+        k === void 0 ? console.warn(`THREE.EXRLoader: Skipped unknown header attribute type '${v}'.`) : R[z] = k;
       }
-      return P ? R : null;
+      return L ? R : null;
     }
     function Ua(l, m, g) {
       if (l.getUint32(0, !0) != 20000630)
         throw new Error("THREE.EXRLoader: Provided file doesn't appear to be in OpenEXR format.");
-      const R = l.getUint8(4), P = l.getUint8(5), z = {
-        singleTile: !!(P & 2),
-        longName: !!(P & 4),
-        deepFormat: !!(P & 8),
-        multiPart: !!(P & 16)
+      const R = l.getUint8(4), L = l.getUint8(5), z = {
+        singleTile: !!(L & 2),
+        longName: !!(L & 4),
+        deepFormat: !!(L & 8),
+        multiPart: !!(L & 16)
       };
       g.value = 8;
-      const A = [];
+      const v = [];
       if (z.multiPart) {
         for (; ; ) {
           const H = Sr(l, m, g);
           if (H === null) break;
-          H.version = R, H.spec = z, A.push(H);
+          H.version = R, H.spec = z, v.push(H);
         }
-        if (A.length === 0)
+        if (v.length === 0)
           throw new Error("THREE.EXRLoader: No valid part headers found.");
       } else {
         const H = Sr(l, m, g);
-        H.version = R, H.spec = z, A.push(H);
+        H.version = R, H.spec = z, v.push(H);
       }
-      return A;
+      return v;
     }
-    function Ha(l, m, g, R, P, z) {
-      const A = {
+    function Ha(l, m, g, R, L, z) {
+      const v = {
         size: 0,
         viewer: m,
         array: g,
@@ -9027,32 +9030,32 @@ class hu extends Co {
       };
       switch (l.compression) {
         case "NO_COMPRESSION":
-          A.blockHeight = 1, A.uncompress = is;
+          v.blockHeight = 1, v.uncompress = is;
           break;
         case "RLE_COMPRESSION":
-          A.blockHeight = 1, A.uncompress = ma;
+          v.blockHeight = 1, v.uncompress = ma;
           break;
         case "ZIPS_COMPRESSION":
-          A.blockHeight = 1, A.uncompress = Js;
+          v.blockHeight = 1, v.uncompress = Js;
           break;
         case "ZIP_COMPRESSION":
-          A.blockHeight = 16, A.uncompress = Js;
+          v.blockHeight = 16, v.uncompress = Js;
           break;
         case "PIZ_COMPRESSION":
-          A.blockHeight = 32, A.uncompress = ga;
+          v.blockHeight = 32, v.uncompress = ga;
           break;
         case "PXR24_COMPRESSION":
-          A.blockHeight = 16, A.uncompress = ya;
+          v.blockHeight = 16, v.uncompress = ya;
           break;
         case "B44_COMPRESSION":
         case "B44A_COMPRESSION":
-          A.blockHeight = 32, A.uncompress = wa;
+          v.blockHeight = 32, v.uncompress = wa;
           break;
         case "DWAA_COMPRESSION":
-          A.blockHeight = 32, A.uncompress = wr;
+          v.blockHeight = 32, v.uncompress = wr;
           break;
         case "DWAB_COMPRESSION":
-          A.blockHeight = 256, A.uncompress = wr;
+          v.blockHeight = 256, v.uncompress = wr;
           break;
         default:
           throw new Error("THREE.EXRLoader: " + l.compression + " is unsupported");
@@ -9067,94 +9070,94 @@ class hu extends Co {
           case "G":
           case "B":
           case "A":
-            H[G.name] = !0, A.type = G.pixelType;
+            H[G.name] = !0, v.type = G.pixelType;
         }
       let k = !1, U = !1;
       if (H.Y && H.RY && H.BY)
-        A.outputChannels = 4, A.yCbCr = !0;
+        v.outputChannels = 4, v.yCbCr = !0;
       else if (H.R && H.G && H.B)
-        A.outputChannels = 4;
+        v.outputChannels = 4;
       else if (H.Y)
-        A.outputChannels = 1;
+        v.outputChannels = 1;
       else
         throw new Error("THREE.EXRLoader: file contains unsupported data channels.");
-      switch (A.outputChannels) {
+      switch (v.outputChannels) {
         case 4:
-          z == Yt ? (k = !H.A, A.format = Yt, A.colorSpace = je, A.outputChannels = 4, A.decodeChannels = { R: 0, G: 1, B: 2, A: 3 }) : z == In ? (A.format = In, A.colorSpace = je, A.outputChannels = 2, A.decodeChannels = { R: 0, G: 1 }) : z == ds ? (A.format = ds, A.colorSpace = je, A.outputChannels = 1, A.decodeChannels = { R: 0 }) : U = !0;
+          z == Yt ? (k = !H.A, v.format = Yt, v.colorSpace = je, v.outputChannels = 4, v.decodeChannels = { R: 0, G: 1, B: 2, A: 3 }) : z == In ? (v.format = In, v.colorSpace = je, v.outputChannels = 2, v.decodeChannels = { R: 0, G: 1 }) : z == ds ? (v.format = ds, v.colorSpace = je, v.outputChannels = 1, v.decodeChannels = { R: 0 }) : U = !0;
           break;
         case 1:
-          z == Yt ? (k = !0, A.format = Yt, A.colorSpace = je, A.outputChannels = 4, A.shouldExpand = !0, A.decodeChannels = { Y: 0 }) : z == In ? (A.format = In, A.colorSpace = je, A.outputChannels = 2, A.shouldExpand = !0, A.decodeChannels = { Y: 0 }) : z == ds ? (A.format = ds, A.colorSpace = je, A.outputChannels = 1, A.decodeChannels = { Y: 0 }) : U = !0;
+          z == Yt ? (k = !0, v.format = Yt, v.colorSpace = je, v.outputChannels = 4, v.shouldExpand = !0, v.decodeChannels = { Y: 0 }) : z == In ? (v.format = In, v.colorSpace = je, v.outputChannels = 2, v.shouldExpand = !0, v.decodeChannels = { Y: 0 }) : z == ds ? (v.format = ds, v.colorSpace = je, v.outputChannels = 1, v.decodeChannels = { Y: 0 }) : U = !0;
           break;
         default:
           U = !0;
       }
       if (U) throw new Error("THREE.EXRLoader: invalid output format for specified file.");
-      if (A.yCbCr && (A.format = Yt, A.outputChannels = 4, A.decodeChannels = { Y: 0, RY: 1, BY: 2 }, k = !0), A.type == 1)
-        switch (P) {
+      if (v.yCbCr && (v.format = Yt, v.outputChannels = 4, v.decodeChannels = { Y: 0, RY: 1, BY: 2 }, k = !0), v.type == 1)
+        switch (L) {
           case Vn:
-            A.getter = ba;
+            v.getter = ba;
             break;
           case Gt:
-            A.getter = vn;
+            v.getter = vn;
             break;
         }
-      else if (A.type == 2)
-        switch (P) {
+      else if (v.type == 2)
+        switch (L) {
           case Vn:
-            A.getter = Ze;
+            v.getter = Ze;
             break;
           case Gt:
-            A.getter = Sa;
+            v.getter = Sa;
         }
       else
-        throw new Error("THREE.EXRLoader: unsupported pixelType " + A.type + " for " + l.compression + ".");
-      A.columns = A.width;
-      const j = A.width * A.height * A.outputChannels;
-      switch (P) {
+        throw new Error("THREE.EXRLoader: unsupported pixelType " + v.type + " for " + l.compression + ".");
+      v.columns = v.width;
+      const j = v.width * v.height * v.outputChannels;
+      switch (L) {
         case Vn:
-          A.byteArray = new Float32Array(j), k && A.byteArray.fill(1, 0, j);
+          v.byteArray = new Float32Array(j), k && v.byteArray.fill(1, 0, j);
           break;
         case Gt:
-          A.byteArray = new Uint16Array(j), k && A.byteArray.fill(15360, 0, j);
+          v.byteArray = new Uint16Array(j), k && v.byteArray.fill(15360, 0, j);
           break;
         default:
-          console.error("THREE.EXRLoader: unsupported type: ", P);
+          console.error("THREE.EXRLoader: unsupported type: ", L);
           break;
       }
       let Z = 0;
       for (const G of l.channels)
-        A.decodeChannels[G.name] !== void 0 && (A.channelByteOffsets[G.name] = Z), Z += G.pixelType * 2;
-      if (A.totalBytes = Z, A.outLineWidth = A.width * A.outputChannels, l.spec.deepFormat) {
-        A.deepChannels = [];
+        v.decodeChannels[G.name] !== void 0 && (v.channelByteOffsets[G.name] = Z), Z += G.pixelType * 2;
+      if (v.totalBytes = Z, v.outLineWidth = v.width * v.outputChannels, l.spec.deepFormat) {
+        v.deepChannels = [];
         let G = 0;
         for (const X of l.channels) {
           const J = X.pixelType === 0 ? 4 : X.pixelType * 2;
-          A.deepChannels.push({
+          v.deepChannels.push({
             name: X.name,
             pixelType: X.pixelType,
             bytesPerSample: J
           }), G += J;
         }
-        A.deepBytesPerSample = G, A.chunkOffsets = l._chunkOffsets, A.multiPart = l.spec.multiPart, A.decode = Ba.bind(A);
+        v.deepBytesPerSample = G, v.chunkOffsets = l._chunkOffsets, v.multiPart = l.spec.multiPart, v.decode = Ba.bind(v);
       } else if (l.spec.singleTile) {
-        A.blockHeight = l.tiles.ySize, A.blockWidth = l.tiles.xSize;
-        const G = Na(l.tiles, A.width, A.height), X = Tr(G, A.width, l.tiles.xSize, l.tiles.roundingMode), J = Tr(G, A.height, l.tiles.ySize, l.tiles.roundingMode);
-        A.tileCount = X[0] * J[0];
+        v.blockHeight = l.tiles.ySize, v.blockWidth = l.tiles.xSize;
+        const G = Na(l.tiles, v.width, v.height), X = Tr(G, v.width, l.tiles.xSize, l.tiles.roundingMode), J = Tr(G, v.height, l.tiles.ySize, l.tiles.roundingMode);
+        v.tileCount = X[0] * J[0];
         for (let K = 0; K < G; K++)
           for (let $ = 0; $ < J[K]; $++)
             for (let ie = 0; ie < X[K]; ie++)
               ke(m, R);
-        A.decode = ka.bind(A);
+        v.decode = ka.bind(v);
       } else if (l.spec.multiPart)
-        A.blockWidth = A.width, A.chunkOffsets = l._chunkOffsets, A.decode = za.bind(A);
+        v.blockWidth = v.width, v.chunkOffsets = l._chunkOffsets, v.decode = za.bind(v);
       else {
-        A.blockWidth = A.width;
-        const G = Math.ceil(A.height / A.blockHeight);
+        v.blockWidth = v.width;
+        const G = Math.ceil(v.height / v.blockHeight);
         for (let X = 0; X < G; X++)
           ke(m, R);
-        A.decode = Fa.bind(A);
+        v.decode = Fa.bind(v);
       }
-      return A;
+      return v;
     }
     const os = { value: 0 }, as = new DataView(e), ja = new Uint8Array(e), cs = Ua(as, e, os), br = Math.max(0, Math.min(this.part, cs.length - 1)), We = cs[br];
     if (We.spec.multiPart || We.spec.deepFormat)
@@ -9182,13 +9185,13 @@ class hu extends Co {
       const l = rt.byteArray, m = rt.width * rt.height;
       if (this.type === Gt)
         for (let g = 0; g < m; g++) {
-          const R = g * 4, P = Q(l[R]), z = Q(l[R + 1]), A = Q(l[R + 2]), H = (1 + z) * P, k = (1 + A) * P, U = (P - H * 0.2126 - k * 0.0722) / 0.7152;
+          const R = g * 4, L = Q(l[R]), z = Q(l[R + 1]), v = Q(l[R + 2]), H = (1 + z) * L, k = (1 + v) * L, U = (L - H * 0.2126 - k * 0.0722) / 0.7152;
           l[R] = wt.toHalfFloat(Math.max(0, H)), l[R + 1] = wt.toHalfFloat(Math.max(0, U)), l[R + 2] = wt.toHalfFloat(Math.max(0, k));
         }
       else
         for (let g = 0; g < m; g++) {
-          const R = g * 4, P = l[R], z = l[R + 1], A = l[R + 2], H = (1 + z) * P, k = (1 + A) * P;
-          l[R] = Math.max(0, H), l[R + 1] = Math.max(0, (P - H * 0.2126 - k * 0.0722) / 0.7152), l[R + 2] = Math.max(0, k);
+          const R = g * 4, L = l[R], z = l[R + 1], v = l[R + 2], H = (1 + z) * L, k = (1 + v) * L;
+          l[R] = Math.max(0, H), l[R + 1] = Math.max(0, (L - H * 0.2126 - k * 0.0722) / 0.7152), l[R + 2] = Math.max(0, k);
         }
     }
     return {
@@ -9261,7 +9264,7 @@ class uu extends Co {
         case 4:
           throw new Error("THREE.HDRLoader: Memory Error: " + (D || ""));
       }
-    }, h = function(M, D, I) {
+    }, h = function(M, D, C) {
       D = D || 1024;
       let O = M.pos, F = -1, V = 0, te = "", re = String.fromCharCode.apply(null, new Uint16Array(M.subarray(O, O + 128)));
       for (; 0 > (F = re.indexOf(`
@@ -9269,7 +9272,7 @@ class uu extends Co {
         te += re, V += re.length, O += 128, re = String.fromCharCode.apply(null, new Uint16Array(M.subarray(O, O + 128)));
       return -1 < F ? (M.pos += V + F + 1, te + re.slice(0, F)) : !1;
     }, f = function(M) {
-      const D = /^#\?(\S+)/, I = /^\s*GAMMA\s*=\s*(\d+(\.\d+)?)\s*$/, N = /^\s*EXPOSURE\s*=\s*(\d+(\.\d+)?)\s*$/, O = /^\s*FORMAT=(\S+)\s*$/, F = /^\s*\-Y\s+(\d+)\s+\+X\s+(\d+)\s*$/, V = {
+      const D = /^#\?(\S+)/, C = /^\s*GAMMA\s*=\s*(\d+(\.\d+)?)\s*$/, N = /^\s*EXPOSURE\s*=\s*(\d+(\.\d+)?)\s*$/, O = /^\s*FORMAT=(\S+)\s*$/, F = /^\s*\-Y\s+(\d+)\s+\+X\s+(\d+)\s*$/, V = {
         valid: 0,
         /* indicate which fields are valid */
         string: "",
@@ -9297,10 +9300,10 @@ class uu extends Co {
 `;
           continue;
         }
-        if ((re = te.match(I)) && (V.gamma = parseFloat(re[1])), (re = te.match(N)) && (V.exposure = parseFloat(re[1])), (re = te.match(O)) && (V.valid |= 2, V.format = re[1]), (re = te.match(F)) && (V.valid |= 4, V.height = parseInt(re[1], 10), V.width = parseInt(re[2], 10)), V.valid & 2 && V.valid & 4) break;
+        if ((re = te.match(C)) && (V.gamma = parseFloat(re[1])), (re = te.match(N)) && (V.exposure = parseFloat(re[1])), (re = te.match(O)) && (V.valid |= 2, V.format = re[1]), (re = te.match(F)) && (V.valid |= 4, V.height = parseInt(re[1], 10), V.width = parseInt(re[2], 10)), V.valid & 2 && V.valid & 4) break;
       }
       return V.valid & 2 || o(3, "missing format specifier"), V.valid & 4 || o(3, "missing image size specifier"), V;
-    }, p = function(M, D, I) {
+    }, p = function(M, D, C) {
       const N = D;
       if (
         // run length encoding is not allowed so read flat
@@ -9309,11 +9312,11 @@ class uu extends Co {
       )
         return new Uint8Array(M);
       N !== (M[2] << 8 | M[3]) && o(3, "wrong scanline width");
-      const O = new Uint8Array(4 * D * I);
+      const O = new Uint8Array(4 * D * C);
       O.length || o(4, "unable to allocate buffer space");
       let F = 0, V = 0;
       const te = 4 * N, re = new Uint8Array(4), Ne = new Uint8Array(te);
-      let ut = I;
+      let ut = C;
       for (; ut > 0 && V < M.byteLength; ) {
         V + 4 > M.byteLength && o(1), re[0] = M[V++], re[1] = M[V++], re[2] = M[V++], re[3] = M[V++], (re[0] != 2 || re[1] != 2 || (re[2] << 8 | re[3]) != N) && o(3, "bad rgbe scanline format");
         let Re = 0, Ue;
@@ -9335,30 +9338,30 @@ class uu extends Co {
         ut--;
       }
       return O;
-    }, w = function(M, D, I, N) {
+    }, y = function(M, D, C, N) {
       const O = M[D + 3], F = Math.pow(2, O - 128) / 255;
-      I[N + 0] = M[D + 0] * F, I[N + 1] = M[D + 1] * F, I[N + 2] = M[D + 2] * F, I[N + 3] = 1;
-    }, _ = function(M, D, I, N) {
+      C[N + 0] = M[D + 0] * F, C[N + 1] = M[D + 1] * F, C[N + 2] = M[D + 2] * F, C[N + 3] = 1;
+    }, S = function(M, D, C, N) {
       const O = M[D + 3], F = Math.pow(2, O - 128) / 255;
-      I[N + 0] = wt.toHalfFloat(Math.min(M[D + 0] * F, 65504)), I[N + 1] = wt.toHalfFloat(Math.min(M[D + 1] * F, 65504)), I[N + 2] = wt.toHalfFloat(Math.min(M[D + 2] * F, 65504)), I[N + 3] = wt.toHalfFloat(1);
-    }, y = new Uint8Array(e);
-    y.pos = 0;
-    const S = f(y), E = S.width, b = S.height, x = p(y.subarray(y.pos), E, b);
-    let v, L, C;
+      C[N + 0] = wt.toHalfFloat(Math.min(M[D + 0] * F, 65504)), C[N + 1] = wt.toHalfFloat(Math.min(M[D + 1] * F, 65504)), C[N + 2] = wt.toHalfFloat(Math.min(M[D + 2] * F, 65504)), C[N + 3] = wt.toHalfFloat(1);
+    }, w = new Uint8Array(e);
+    w.pos = 0;
+    const x = f(w), E = x.width, b = x.height, _ = p(w.subarray(w.pos), E, b);
+    let A, P, I;
     switch (this.type) {
       case Vn:
-        C = x.length / 4;
-        const M = new Float32Array(C * 4);
-        for (let I = 0; I < C; I++)
-          w(x, I * 4, M, I * 4);
-        v = M, L = Vn;
+        I = _.length / 4;
+        const M = new Float32Array(I * 4);
+        for (let C = 0; C < I; C++)
+          y(_, C * 4, M, C * 4);
+        A = M, P = Vn;
         break;
       case Gt:
-        C = x.length / 4;
-        const D = new Uint16Array(C * 4);
-        for (let I = 0; I < C; I++)
-          _(x, I * 4, D, I * 4);
-        v = D, L = Gt;
+        I = _.length / 4;
+        const D = new Uint16Array(I * 4);
+        for (let C = 0; C < I; C++)
+          S(_, C * 4, D, C * 4);
+        A = D, P = Gt;
         break;
       default:
         throw new Error("THREE.HDRLoader: Unsupported type: " + this.type);
@@ -9366,11 +9369,11 @@ class uu extends Co {
     return {
       width: E,
       height: b,
-      data: v,
-      header: S.string,
-      gamma: S.gamma,
-      exposure: S.exposure,
-      type: L,
+      data: A,
+      header: x.string,
+      gamma: x.gamma,
+      exposure: x.exposure,
+      type: P,
       colorSpace: je,
       minFilter: nn,
       magFilter: nn,
@@ -9872,7 +9875,7 @@ class xu {
    * Create a ViewerCore instance with Three.js implementations
    */
   static createViewer(e, t) {
-    var E, b, x;
+    var E, b, _;
     Po(t.units);
     const n = new Ul(e), s = new Lt(), r = this.createCamera(t), o = this.createControls(
       r.getThreeCamera(),
@@ -9885,27 +9888,27 @@ class xu {
     }), c = new Kh(), d = new pu();
     let u;
     (((b = t.pathTracing) == null ? void 0 : b.enabled) ?? !1) && (u = new Xh());
-    const f = new gu(), p = new yu(), w = new Tu(), _ = new _u(), y = bu.convertRendererOptions(
+    const f = new gu(), p = new yu(), y = new Tu(), S = new _u(), w = bu.convertRendererOptions(
       t.renderer || {}
     );
-    (t.replaceWithScreenshotOnComplete || (x = t.pathTracing) != null && x.enabled) && (y.preserveDrawingBuffer = !0);
-    const S = {
+    (t.replaceWithScreenshotOnComplete || (_ = t.pathTracing) != null && _.enabled) && (w.preserveDrawingBuffer = !0);
+    const x = {
       renderer: n,
       scene: s,
       camera: r,
       controls: o,
       modelLoader: a,
       options: t,
-      rendererOptions: y,
+      rendererOptions: w,
       sceneSetupService: c,
       environmentService: d,
       pathTracingService: u,
       floorAlignmentService: f,
       selectionService: p,
-      anchorProjectionService: w,
-      animationService: _
+      anchorProjectionService: y,
+      animationService: S
     };
-    return new Nc(S);
+    return new Nc(x);
   }
   static createCamera(e) {
     const n = e.camera || {}, s = n.fov || n.cameraFov || 75, r = n.near || n.cameraNear || 0.1, o = n.far || n.cameraFar || 1e5, a = n.position || n.cameraPosition, c = n.target || n.cameraTarget, d = lr.create(
@@ -10231,16 +10234,16 @@ function Pu(i, e) {
     let d = null;
     const u = (p) => {
       if (i.current && t.current) {
-        const w = i.current.parentElement || i.current;
-        let { clientWidth: _, clientHeight: y } = w;
+        const y = i.current.parentElement || i.current;
+        let { clientWidth: S, clientHeight: w } = y;
         if (p && p[0]) {
-          const { width: S, height: E } = p[0].contentRect;
-          _ = Math.floor(S), y = Math.floor(E);
+          const { width: x, height: E } = p[0].contentRect;
+          S = Math.floor(x), w = Math.floor(E);
         }
-        if (c.current.width === _ && c.current.height === y)
+        if (c.current.width === S && c.current.height === w)
           return;
         d !== null && cancelAnimationFrame(d), d = requestAnimationFrame(() => {
-          t.current && i.current && (t.current.resize(_, y), c.current = { width: _, height: y });
+          t.current && i.current && (t.current.resize(S, w), c.current = { width: S, height: w });
         });
       }
     };
@@ -11202,8 +11205,8 @@ class ld {
   createAxis(e) {
     const { color: t, direction: n, length: s, origin: r, lineWidth: o, label: a } = e, c = new T.Group(), d = o / 2, u = new T.CylinderGeometry(d, d, s, 32), h = new T.MeshBasicMaterial({ color: t }), f = new T.Mesh(u, h);
     if (f.position.copy(r).add(n.clone().multiplyScalar(s / 2)), !n.equals(new T.Vector3(0, 1, 0))) {
-      const w = new T.Vector3(0, 1, 0).cross(n).normalize(), _ = Math.acos(new T.Vector3(0, 1, 0).dot(n));
-      f.setRotationFromAxisAngle(w, _);
+      const y = new T.Vector3(0, 1, 0).cross(n).normalize(), S = Math.acos(new T.Vector3(0, 1, 0).dot(n));
+      f.setRotationFromAxisAngle(y, S);
     }
     c.add(f);
     const p = cd(a, t);
@@ -11464,30 +11467,30 @@ function Td({
   gizmoControlRef: s
 }) {
   const r = $e(null), o = $e(null), a = $e(new T.Raycaster()).current, c = $e(new T.Vector2()).current, d = Rt(() => {
-    const _ = e.getObjectByName(qn), y = yd(t);
-    if (_ && y) {
-      e.remove(_);
+    const S = e.getObjectByName(qn), w = yd(t);
+    if (S && w) {
+      e.remove(S);
       return;
     }
-    if (_ || y) return;
-    const S = new gd().create();
-    S.rotation.copy(t.rotation), e.add(S);
+    if (S || w) return;
+    const x = new gd().create();
+    x.rotation.copy(t.rotation), e.add(x);
   }, [e, t]), u = Rt(() => {
-    const _ = e.getObjectByName(qn);
-    _ && e.remove(_);
+    const S = e.getObjectByName(qn);
+    S && e.remove(S);
   }, [e]), h = Rt(
-    ud((_) => {
+    ud((S) => {
       if (!s.current || !i) return;
-      go(_, i, c);
-      const y = ca(
+      go(S, i, c);
+      const w = ca(
         c,
         t,
         e,
         a
-      ), S = la(y);
-      S != null && S.userData.gizmoCube ? S.userData.gizmoCube.highlightObject(S) : e.traverse((E) => {
+      ), x = la(w);
+      x != null && x.userData.gizmoCube ? x.userData.gizmoCube.highlightObject(x) : e.traverse((E) => {
         E.userData.gizmoCube && E.userData.gizmoCube.highlightObject(null);
-      }), y.length > 0 ? d() : u();
+      }), w.length > 0 ? d() : u();
     }, 1e3 / wd),
     [
       s,
@@ -11499,26 +11502,26 @@ function Td({
       d,
       u
     ]
-  ), f = Rt((_) => {
-    r.current = Date.now(), o.current = { x: _.clientX, y: _.clientY };
+  ), f = Rt((S) => {
+    r.current = Date.now(), o.current = { x: S.clientX, y: S.clientY };
   }, []), p = Rt(
-    (_) => {
-      var y;
-      const S = _.name === Ks ? 1 : -1, E = 90 * Math.PI / 180, b = new T.Vector3(0, 0, 0), x = S * E, v = new T.Matrix4();
-      v.makeRotationZ(x), t.up.applyMatrix4(v), t.lookAt(b), (y = s.current) == null || y.gizmoControls.update();
+    (S) => {
+      var w;
+      const x = S.name === Ks ? 1 : -1, E = 90 * Math.PI / 180, b = new T.Vector3(0, 0, 0), _ = x * E, A = new T.Matrix4();
+      A.makeRotationZ(_), t.up.applyMatrix4(A), t.lookAt(b), (w = s.current) == null || w.gizmoControls.update();
     },
     [t, s]
-  ), w = Rt(
-    (_) => {
+  ), y = Rt(
+    (S) => {
       if ((r.current ? Date.now() - r.current : 0) < Ed) {
-        go(_, i, c);
-        const y = dd(
+        go(S, i, c);
+        const w = dd(
           c,
           t,
           e,
           a
         );
-        y != null && y.name && td.includes(y.name) ? p(y) : fd(y, n);
+        w != null && w.name && td.includes(w.name) ? p(w) : fd(w, n);
       }
       r.current = null, o.current = null;
     },
@@ -11535,7 +11538,7 @@ function Td({
   return {
     onMouseDown: f,
     onMouseMove: h,
-    onMouseUp: w,
+    onMouseUp: y,
     onMouseLeave: u
   };
 }
@@ -11551,59 +11554,59 @@ const _d = ({
     d,
     u,
     h
-  ), p = $e(f).current, w = $e(null), _ = Rt(() => {
+  ), p = $e(f).current, y = $e(null), S = Rt(() => {
     a && (n(), a.render(o, p));
-  }, [n, a, o, p]), y = Rt(
-    (v) => {
+  }, [n, a, o, p]), w = Rt(
+    (A) => {
       if (!i || !e) return;
-      const L = i.position.length(), C = v.clone().multiplyScalar(L), M = 400, D = new T.Matrix4();
-      D.lookAt(C, new T.Vector3(0, 0, 0), new T.Vector3(0, 1, 0));
-      const I = new T.Quaternion();
-      I.setFromRotationMatrix(D), i.quaternion.copy(I), Bu(
+      const P = i.position.length(), I = A.clone().multiplyScalar(P), M = 400, D = new T.Matrix4();
+      D.lookAt(I, new T.Vector3(0, 0, 0), new T.Vector3(0, 1, 0));
+      const C = new T.Quaternion();
+      C.setFromRotationMatrix(D), i.quaternion.copy(C), Bu(
         i,
         e,
         i.position.clone(),
-        C,
+        I,
         M,
-        _
+        S
       ), i.up.set(0, 1, 0), i.lookAt(new T.Vector3(0, 0, 0)), e.target.set(0, 0, 0), e.update();
     },
-    [i, e, _, o]
-  ), { onMouseDown: S, onMouseMove: E, onMouseUp: b, onMouseLeave: x } = Td({
+    [i, e, S, o]
+  ), { onMouseDown: x, onMouseMove: E, onMouseUp: b, onMouseLeave: _ } = Td({
     gizmoRenderer: a,
     gizmoScene: o,
     gizmoCamera: p,
-    alignCameraWithVector: y,
-    gizmoControlRef: w
+    alignCameraWithVector: w,
+    gizmoControlRef: y
   });
   return Et(() => {
-    const v = r.current;
-    if (!v || !i || !e || !a) return;
-    w.current && w.current.dispose();
-    const L = {
-      gizmoDiv: v,
+    const A = r.current;
+    if (!A || !i || !e || !a) return;
+    y.current && y.current.dispose();
+    const P = {
+      gizmoDiv: A,
       gizmoScene: o,
       gizmoRenderer: a,
       gizmoCamera: p
-    }, C = {
+    }, I = {
       mainCamera: i,
       mainControls: e,
-      renderGizmo: _
+      renderGizmo: S
     }, M = {
       syncGizmoCameraWithMain: mo,
       syncMainCameraWithGizmo: sd
     };
-    return w.current = new hd({
-      gizmoParams: L,
-      mainParams: C,
+    return y.current = new hd({
+      gizmoParams: P,
+      mainParams: I,
       syncFunctions: M,
       options: s
-    }), v.addEventListener("mousedown", S), v.addEventListener("mousemove", E), v.addEventListener("mouseup", b), v.addEventListener("mouseleave", x), () => {
-      w.current && (w.current.dispose(), w.current = null), v.removeEventListener("mousedown", S), v.removeEventListener("mousemove", E), v.removeEventListener("mouseup", b), v.removeEventListener("mouseleave", x);
+    }), A.addEventListener("mousedown", x), A.addEventListener("mousemove", E), A.addEventListener("mouseup", b), A.addEventListener("mouseleave", _), () => {
+      y.current && (y.current.dispose(), y.current = null), A.removeEventListener("mousedown", x), A.removeEventListener("mousemove", E), A.removeEventListener("mouseup", b), A.removeEventListener("mouseleave", _);
     };
-  }, [i, e, _, E, S, b]), Et(() => {
-    i && (mo(p, i, o), _());
-  }, [i, _]), /* @__PURE__ */ Te(
+  }, [i, e, S, E, x, b]), Et(() => {
+    i && (mo(p, i, o), S());
+  }, [i, S]), /* @__PURE__ */ Te(
     "div",
     {
       className: t ? `${t}` : "gizmo-default",
@@ -11810,7 +11813,7 @@ function Cd(i) {
 }
 const ks = () => new W("Viewer is not ready yet", Y.COMPONENT_NOT_MOUNTED), ha = yo(
   ({ object: i, options: e = {}, preset: t, pathTraced: n, turntable: s, animations: r, children: o }, a) => {
-    var I, N;
+    var C, N;
     const c = $e(null), d = e.preset ?? t, { activePreset: u, pickerEnabled: h, selectPreset: f } = Ou(
       d,
       e.ui
@@ -11820,70 +11823,70 @@ const ks = () => new W("Viewer is not ready yet", Y.COMPONENT_NOT_MOUNTED), ha =
       n,
       s,
       r
-    ), { viewer: w, isInitialized: _ } = Pu(c, p), y = Nu(w, _, i), S = ku(w), E = w ? Jn(w.getCamera()) : null, b = w ? ur(w.getControls()) : null, x = w ? Xo(w.getRenderer()) : null, v = Rt(() => {
-      w == null || w.requestRender();
-    }, [w]), L = ((I = e.helpers) == null ? void 0 : I.gizmo) !== void 0 && e.helpers.gizmo !== !1, C = typeof ((N = e.helpers) == null ? void 0 : N.gizmo) == "object" ? e.helpers.gizmo : {}, M = Zt(
+    ), { viewer: y, isInitialized: S } = Pu(c, p), w = Nu(y, S, i), x = ku(y), E = y ? Jn(y.getCamera()) : null, b = y ? ur(y.getControls()) : null, _ = y ? Xo(y.getRenderer()) : null, A = Rt(() => {
+      y == null || y.requestRender();
+    }, [y]), P = ((C = e.helpers) == null ? void 0 : C.gizmo) !== void 0 && e.helpers.gizmo !== !1, I = typeof ((N = e.helpers) == null ? void 0 : N.gizmo) == "object" ? e.helpers.gizmo : {}, M = Zt(
       () => Cd(e.loadingIndicator),
       [e.loadingIndicator]
-    ), D = M.enabled && (y.status === "loading" || y.status === "error");
+    ), D = M.enabled && (w.status === "loading" || w.status === "error");
     return Wa(a, () => ({
-      scene: w ? ji(w.getScene()) : null,
+      scene: y ? ji(y.getScene()) : null,
       camera: E,
-      renderer: x,
+      renderer: _,
       controls: b,
-      events: S,
+      events: x,
       loadModel: async (O) => {
-        if (!w)
+        if (!y)
           throw ks();
-        const F = typeof O == "string" ? O : new Le(O), V = await w.loadModel(F);
+        const F = typeof O == "string" ? O : new Le(O), V = await y.loadModel(F);
         if (!V.ok)
           throw V.error;
       },
       captureStill: async (O) => {
-        if (!w)
+        if (!y)
           throw ks();
-        const F = await w.captureStill(O);
+        const F = await y.captureStill(O);
         if (!F.ok)
           throw F.error;
         return F.value;
       },
       captureVideo: async (O) => {
-        if (!w)
+        if (!y)
           throw ks();
-        const F = await w.captureVideo(O);
+        const F = await y.captureVideo(O);
         if (!F.ok)
           throw F.error;
         return F.value;
       },
-      getAnimationNames: () => (w == null ? void 0 : w.getAnimationNames()) ?? [],
+      getAnimationNames: () => (y == null ? void 0 : y.getAnimationNames()) ?? [],
       playAnimations: (O) => {
-        if (!w)
+        if (!y)
           throw ks();
-        w.playAnimations(O);
+        y.playAnimations(O);
       },
       pauseAnimations: () => {
-        w == null || w.pauseAnimations();
+        y == null || y.pauseAnimations();
       },
       dispose: () => {
-        w == null || w.dispose();
+        y == null || y.dispose();
       }
-    }), [w, E, x, b, S]), /* @__PURE__ */ Te(xd, { children: /* @__PURE__ */ Te(Fu, { viewer: w, canvasRef: c, children: /* @__PURE__ */ Hn("div", { style: { position: "relative", width: "100%", height: "100%" }, children: [
+    }), [y, E, _, b, x]), /* @__PURE__ */ Te(xd, { children: /* @__PURE__ */ Te(Fu, { viewer: y, canvasRef: c, children: /* @__PURE__ */ Hn("div", { style: { position: "relative", width: "100%", height: "100%" }, children: [
       /* @__PURE__ */ Te(zu, {}),
-      L && _ && E && b && /* @__PURE__ */ Te(
+      P && S && E && b && /* @__PURE__ */ Te(
         bd,
         {
           camera: E,
           controls: b,
-          render: v,
-          placement: C.placement,
-          size: C.size
+          render: A,
+          placement: I.placement,
+          size: I.size
         }
       ),
       D && /* @__PURE__ */ Te(
         Ad,
         {
-          status: y.status === "error" ? "error" : "loading",
-          label: y.status === "error" ? M.errorLabel ?? y.error ?? "Failed to load model" : M.label,
+          status: w.status === "error" ? "error" : "loading",
+          label: w.status === "error" ? M.errorLabel ?? w.error ?? "Failed to load model" : M.label,
           color: M.color,
           backdrop: M.backdrop
         }
@@ -11927,25 +11930,25 @@ function Bd({ position: i, occlude: e = !1, children: t }) {
     if (!u)
       return;
     const h = { x: r, y: o, z: a }, f = () => {
-      const y = u.project(h, e);
-      if (y) {
-        if (!y.visible) {
+      const w = u.project(h, e);
+      if (w) {
+        if (!w.visible) {
           d.style.visibility = "hidden";
           return;
         }
-        d.style.visibility = "visible", d.style.left = `${y.left}px`, d.style.top = `${y.top}px`;
+        d.style.visibility = "visible", d.style.left = `${w.left}px`, d.style.top = `${w.top}px`;
       }
     }, p = () => {
       u.invalidate(), f();
     };
     f();
-    const w = n.getEvents(), _ = [
-      w.on("render:complete", f),
-      w.on("controls:change", f),
-      w.on("model:loaded", p)
+    const y = n.getEvents(), S = [
+      y.on("render:complete", f),
+      y.on("controls:change", f),
+      y.on("model:loaded", p)
     ];
     return window.addEventListener("resize", p), () => {
-      _.forEach((y) => y()), window.removeEventListener("resize", p);
+      S.forEach((w) => w()), window.removeEventListener("resize", p);
     };
   }, [n, r, o, a, e]);
   const c = t != null && t !== !1;