@voluma/vlam 0.3.0 → 0.3.4

package/dist/formats/lcc.js

@@ -1,19 +1,19 @@
-var dt = Object.defineProperty;
-var gt = (e, t, n) => t in e ? dt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var A = (e, t, n) => gt(e, typeof t != "symbol" ? t + "" : t, n);
-import { w as wt } from "../splat-data-BZM5dhhx.js";
-import { a as mt, r as pt } from "../sh-pack-D5wAe5gg.js";
-import * as E from "three/webgpu";
-import { L as Ct } from "../lod-scheduler-B0a_uBlv.js";
-import { t as ct, a as W } from "../loading-wLo8vRbA.js";
-import { M as yt } from "../splat-mesh-types-BZIko-_9.js";
+var gt = Object.defineProperty;
+var wt = (e, t, n) => t in e ? gt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var A = (e, t, n) => wt(e, typeof t != "symbol" ? t + "" : t, n);
+import { w as mt } from "../splat-data-BZM5dhhx.js";
+import { a as pt, r as Ct } from "../sh-pack-D5wAe5gg.js";
+import * as S from "three/webgpu";
+import { L as yt } from "../lod-scheduler-ChoZyEeq.js";
+import { t as at, a as W } from "../loading-wLo8vRbA.js";
+import { M as vt } from "../splat-mesh-types-BZIko-_9.js";
 import { w as z } from "../logging-BfPdd7NJ.js";
-import { c as xt, a as vt, b as bt, p as k, d as j } from "../ply-header-B9WllbPg.js";
-const F = 32, O = 64, K = 1 << 24;
-function Lt(e) {
+import { c as xt, a as bt, b as Lt, p as Y, d as j } from "../ply-header-B9WllbPg.js";
+const T = 32, O = 64, K = 1 << 24;
+function Et(e) {
   return e === 1 ? 3 : e === 2 ? 8 : 15;
 }
-function Et(e) {
+function St(e) {
   const t = e, n = String(t.version ?? "");
   if (!/^[2345]\./.test(n))
     throw new Error(
@@ -33,38 +33,38 @@ function Et(e) {
   const a = t.splats;
   if (!Array.isArray(a) || a.length !== i)
     throw new Error(`LCC manifest "splats" must list one count per level (${i}).`);
-  for (const g of a)
-    if (!Number.isSafeInteger(g) || g < 0)
-      throw new Error(`LCC manifest "splats" contains an invalid count: ${String(g)}.`);
+  for (const p of a)
+    if (!Number.isSafeInteger(p) || p < 0)
+      throw new Error(`LCC manifest "splats" contains an invalid count: ${String(p)}.`);
   const r = t.totalSplats;
   if (!Number.isSafeInteger(r) || r < 0)
     throw new Error(`LCC manifest declares an invalid totalSplats: ${String(r)}.`);
   const u = J(t, "cellLengthX"), f = J(t, "cellLengthY");
   if (u <= 0 || f <= 0)
     throw new Error("LCC manifest cell lengths must be positive.");
-  const h = St(t), d = t.shift;
-  if (Array.isArray(d) && d.some((g) => g !== 0))
+  const h = $t(t), d = t.shift;
+  if (Array.isArray(d) && d.some((p) => p !== 0))
     throw new Error(
       `LCC manifest "shift" is non-zero (${JSON.stringify(d)}), which is not supported.`
     );
-  const m = t.scale;
-  if (Array.isArray(m) && m.some((g) => g !== 1))
+  const w = t.scale;
+  if (Array.isArray(w) && w.some((p) => p !== 1))
     throw new Error(
-      `LCC manifest "scale" is non-identity (${JSON.stringify(m)}), which is not supported.`
+      `LCC manifest "scale" is non-identity (${JSON.stringify(w)}), which is not supported.`
     );
-  const p = t.boundingBox, $ = P(p == null ? void 0 : p.min, "boundingBox.min"), b = P(p == null ? void 0 : p.max, "boundingBox.max"), w = t.attributes;
-  if (!Array.isArray(w)) throw new Error('LCC manifest is missing "attributes".');
-  const C = /* @__PURE__ */ new Map();
-  for (const g of w)
-    typeof (g == null ? void 0 : g.name) == "string" && (!Array.isArray(g.min) || g.min.length < 3 || C.set(g.name, {
-      min: P(g.min, `attributes.${g.name}.min`),
-      max: P(g.max, `attributes.${g.name}.max`)
+  const m = t.boundingBox, $ = P(m == null ? void 0 : m.min, "boundingBox.min"), x = P(m == null ? void 0 : m.max, "boundingBox.max"), g = t.attributes;
+  if (!Array.isArray(g)) throw new Error('LCC manifest is missing "attributes".');
+  const y = /* @__PURE__ */ new Map();
+  for (const p of g)
+    typeof (p == null ? void 0 : p.name) == "string" && (!Array.isArray(p.min) || p.min.length < 3 || y.set(p.name, {
+      min: P(p.min, `attributes.${p.name}.min`),
+      max: P(p.max, `attributes.${p.name}.max`)
     }));
-  const v = (g) => {
-    const x = C.get(g);
-    if (!x) throw new Error(`LCC manifest is missing the "${g}" attribute range.`);
-    return x;
-  }, y = C.get("shcoef") ?? Y, L = $t(t.fileType, y);
+  const b = (p) => {
+    const v = y.get(p);
+    if (!v) throw new Error(`LCC manifest is missing the "${p}" attribute range.`);
+    return v;
+  }, C = y.get("shcoef") ?? V, L = At(t.fileType, C);
   return {
     totalSplats: r,
     totalLevel: i,
@@ -72,18 +72,18 @@ function Et(e) {
     cellLengthY: f,
     indexDataSize: c,
     splats: a,
-    bounds: { min: $, max: b },
+    bounds: { min: $, max: x },
     fileType: L,
-    scale: v("scale"),
+    scale: b("scale"),
     // A Portable capture has no SH at all; keep a benign range so the type
     // stays total rather than sprinkling optionality through the loader.
-    shcoef: y,
-    envScale: C.get("envscale") ?? Y,
-    envShcoef: C.get("envshcoef") ?? Y,
+    shcoef: C,
+    envScale: y.get("envscale") ?? V,
+    envShcoef: y.get("envshcoef") ?? V,
     georeference: h
   };
 }
-function St(e) {
+function $t(e) {
   const t = e.offset;
   if (!Array.isArray(t) || !t.some((o) => o !== 0)) return;
   const n = e.epsg;
@@ -92,18 +92,18 @@ function St(e) {
     epsg: Number.isSafeInteger(n) && n > 0 ? n : void 0
   };
 }
-function $t(e, t) {
+function At(e, t) {
   if (e === "Portable" || e === "Quality") return e;
-  if (e === void 0) return At(t) ? "Portable" : "Quality";
+  if (e === void 0) return Mt(t) ? "Portable" : "Quality";
   throw new Error(
     `Unsupported LCC fileType: "${String(e)}" (expected Portable or Quality).`
   );
 }
-function At(e) {
+function Mt(e) {
   return e.min.every((t) => t === 0) && e.max.every((t) => t === 0 || t === 1);
 }
-const Y = { min: [0, 0, 0], max: [0, 0, 0] };
-function Mt(e, t) {
+const V = { min: [0, 0, 0], max: [0, 0, 0] };
+function Ft(e, t) {
   const { indexDataSize: n, totalLevel: o } = t;
   if (e.byteLength === 0 || e.byteLength % n !== 0)
     throw new Error(
@@ -119,9 +119,9 @@ function Mt(e, t) {
           `LCC index.bin has a byte offset beyond Number.MAX_SAFE_INTEGER: ${f}.`
         );
       const h = s.getUint32(r + 12, !0);
-      if (h !== u * F)
+      if (h !== u * T)
         throw new Error(
-          `LCC index.bin level ${a} declares ${u} splats but ${h} bytes (expected ${u * F}).`
+          `LCC index.bin level ${a} declares ${u} splats but ${h} bytes (expected ${u * T}).`
         );
       c.push({ count: u, byteOffset: Number(f), byteSize: h });
     }
@@ -133,24 +133,24 @@ function Mt(e, t) {
   }
   return i;
 }
-function Ft(e) {
+function Tt(e) {
   const t = e >>> 30 & 3, n = [0, 0, 0, 0];
   let o = 0;
   for (let i = 0; i < 4; i++) {
     if (i === t) continue;
     const l = e >>> 10 * o & 1023;
-    n[i] = (l - 511) * Tt, o++;
+    n[i] = (l - 511) * Ut, o++;
   }
   const s = n[0] ** 2 + n[1] ** 2 + n[2] ** 2 + n[3] ** 2;
   return n[t] = Math.sqrt(Math.max(0, 1 - s)), [n[3], n[0], n[1], n[2]];
 }
-const Tt = 1 / (511 * Math.SQRT2);
-async function le(e, t, n, o) {
-  var v;
+const Ut = 1 / (511 * Math.SQRT2);
+async function ce(e, t, n, o) {
+  var b;
   const s = t.stride;
-  if (s !== F && s !== F + O)
+  if (s !== T && s !== T + O)
     throw new Error(`LCC chunk declares an unsupported ${s}-byte record.`);
-  if (((v = t.sh) == null ? void 0 : v.source) === "inline" && s === F)
+  if (((b = t.sh) == null ? void 0 : b.source) === "inline" && s === T)
     throw new Error("LCC chunk asks for inline SH but its records have no room for it.");
   if (e.byteLength % s !== 0)
     throw new Error(
@@ -161,40 +161,40 @@ async function le(e, t, n, o) {
     throw new Error(
       `LCC chunk holds ${i} splats, above the supported maximum of ${K}.`
     );
-  const l = new DataView(e), c = new Float32Array(i * 3), a = new Uint8Array(i * 4), r = new Float32Array(i * 6), u = new Uint8Array(e), { min: f, max: h } = t.scale, d = f[0], m = f[1], p = f[2], $ = h[0] - f[0], b = h[1] - f[1], w = h[2] - f[2];
-  for (let y = 0; y < i; y++) {
-    o && (y & 65535) === 0 && y > 0 && (await new Promise((S) => setTimeout(S, 0)), o.throwIfAborted());
-    const L = y * s;
-    c[y * 3 + 0] = l.getFloat32(L, !0), c[y * 3 + 1] = l.getFloat32(L + 4, !0), c[y * 3 + 2] = l.getFloat32(L + 8, !0), a[y * 4 + 0] = u[L + 12], a[y * 4 + 1] = u[L + 13], a[y * 4 + 2] = u[L + 14], a[y * 4 + 3] = u[L + 15];
-    const [g, x, U, M] = Ft(l.getUint32(L + 22, !0));
-    wt(
+  const l = new DataView(e), c = new Float32Array(i * 3), a = new Uint8Array(i * 4), r = new Float32Array(i * 6), u = new Uint8Array(e), { min: f, max: h } = t.scale, d = f[0], w = f[1], m = f[2], $ = h[0] - f[0], x = h[1] - f[1], g = h[2] - f[2];
+  for (let C = 0; C < i; C++) {
+    o && (C & 65535) === 0 && C > 0 && (await new Promise((F) => setTimeout(F, 0)), o.throwIfAborted());
+    const L = C * s;
+    c[C * 3 + 0] = l.getFloat32(L, !0), c[C * 3 + 1] = l.getFloat32(L + 4, !0), c[C * 3 + 2] = l.getFloat32(L + 8, !0), a[C * 4 + 0] = u[L + 12], a[C * 4 + 1] = u[L + 13], a[C * 4 + 2] = u[L + 14], a[C * 4 + 3] = u[L + 15];
+    const [p, v, E, U] = Tt(l.getUint32(L + 22, !0));
+    mt(
       r,
-      y,
+      C,
       d + $ * (l.getUint16(L + 16, !0) / 65535),
-      m + b * (l.getUint16(L + 18, !0) / 65535),
-      p + w * (l.getUint16(L + 20, !0) / 65535),
-      g,
-      x,
-      U,
-      M
+      w + x * (l.getUint16(L + 18, !0) / 65535),
+      m + g * (l.getUint16(L + 20, !0) / 65535),
+      p,
+      v,
+      E,
+      U
     );
   }
   o == null || o.throwIfAborted();
-  const C = t.sh ? Ut(e, n, t.sh, i, s) : void 0;
+  const y = t.sh ? Bt(e, n, t.sh, i, s) : void 0;
   return {
     count: i,
     positions: c,
     colors: a,
     covariances: r,
-    ...C ? { shPacked: C } : {}
+    ...y ? { shPacked: y } : {}
   };
 }
-function Ut(e, t, n, o, s) {
-  const i = Lt(n.bands), l = new Uint32Array(o * i);
+function Bt(e, t, n, o, s) {
+  const i = Et(n.bands), l = new Uint32Array(o * i);
   if (n.source === "inline") {
     const r = new DataView(e);
     for (let u = 0; u < o; u++) {
-      const f = u * s + F;
+      const f = u * s + T;
       for (let h = 0; h < i; h++)
         l[u * i + h] = r.getUint32(f + h * 4, !0);
     }
@@ -216,10 +216,10 @@ function Ut(e, t, n, o, s) {
 }
 function Z(e, t) {
   const n = t.requantizeTo;
-  if (!n || mt(t.range, n))
+  if (!n || pt(t.range, n))
     return { bands: t.bands, packed: e, range: t.range };
   for (let o = 0; o < e.length; o++)
-    e[o] = pt(e[o], t.range, n);
+    e[o] = Ct(e[o], t.range, n);
   return { bands: t.bands, packed: e, range: n };
 }
 function J(e, t) {
@@ -238,53 +238,53 @@ function P(e, t) {
   });
 }
 function H() {
-  return new E.Matrix4().set(-1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1);
+  return new S.Matrix4().set(-1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1);
 }
-function ce(e) {
+function ae(e) {
   e.matrix.copy(H()), e.matrix.decompose(e.position, e.quaternion, e.scale), e.matrixWorldNeedsUpdate = !0;
 }
-const Bt = 128e3;
-async function ae(e, t, n) {
-  const o = Et(e), s = (g) => {
-    const x = t.resolve(g);
-    if (x === null) throw new Error(`LCC dataset is missing "${g}".`);
-    return x;
-  }, i = s("data.bin"), l = t.resolve("environment.bin"), c = Mt(
-    await _t(s("index.bin"), n, "manifest"),
+const It = 128e3;
+async function ue(e, t, n) {
+  const o = St(e), s = (v) => {
+    const E = t.resolve(v);
+    if (E === null) throw new Error(`LCC dataset is missing "${v}".`);
+    return E;
+  }, i = s("data.bin"), l = t.resolve("environment.bin"), c = Ft(
+    await Dt(s("index.bin"), n, "manifest"),
     o
   );
-  Pt(c, o);
-  const a = o.fileType === "Quality" ? yt : 0, r = n.shBands ?? a, u = Math.min(r, a), f = u === 0 ? void 0 : u, h = f === void 0 ? null : s("shcoef.bin"), d = [], m = [], p = (g, x) => (d.push(g), m.push(x), d.length - 1), $ = [], b = /* @__PURE__ */ new Set();
-  let w = 0;
-  const C = o.totalLevel;
-  for (let g = 0; g < c.length; g++) {
-    const x = c[g];
+  Rt(c, o);
+  const a = o.fileType === "Quality" ? vt : 0, r = n.shBands ?? a, u = Math.min(r, a), f = u === 0 ? void 0 : u, h = f === void 0 ? null : s("shcoef.bin"), d = [], w = [], m = (v, E) => (d.push(v), w.push(E), d.length - 1), $ = [], x = /* @__PURE__ */ new Set();
+  let g = 0;
+  const y = o.totalLevel;
+  for (let v = 0; v < c.length; v++) {
+    const E = c[v];
     let U = 0;
-    for (let S = 0; S < C; S++) {
-      const T = x.levels[S].count;
-      if (T > 0) {
-        U = T;
+    for (let M = 0; M < y; M++) {
+      const B = E.levels[M].count;
+      if (B > 0) {
+        U = B;
         break;
       }
     }
-    const M = Math.max(1, Math.ceil(U / Bt));
-    for (let S = 0; S < M; S++) {
-      const T = new Array(C).fill(
+    const F = Math.max(1, Math.ceil(U / It));
+    for (let M = 0; M < F; M++) {
+      const B = new Array(y).fill(
         void 0
       );
-      let B = -1, G = 0;
-      for (let I = 0; I < C; I++) {
-        const R = x.levels[I];
+      let k = -1, G = 0;
+      for (let I = 0; I < y; I++) {
+        const R = E.levels[I];
         if (R.count === 0) continue;
-        const N = Math.floor(S * R.count / M), _ = Math.floor((S + 1) * R.count / M);
+        const N = Math.floor(M * R.count / F), _ = Math.floor((M + 1) * R.count / F);
         if (_ === N) continue;
-        const ft = `${i}#c${x.cellX}_${x.cellY}-l${I}${M > 1 ? `.${S}` : ""}`, Q = p(ft, {
+        const dt = `${i}#c${E.cellX}_${E.cellY}-l${I}${F > 1 ? `.${M}` : ""}`, Q = m(dt, {
           format: "lcc-bin",
           lcc: {
             kind: "splats",
-            start: R.byteOffset + N * F,
-            length: (_ - N) * F,
-            stride: F,
+            start: R.byteOffset + N * T,
+            length: (_ - N) * T,
+            stride: T,
             scale: o.scale,
             ...f === void 0 ? {} : {
               sh: {
@@ -299,22 +299,23 @@ async function ae(e, t, n) {
             }
           }
         });
-        T[I] = { file: Q, offset: 0, count: _ - N }, B = Q, G = _ - N;
+        B[I] = { file: Q, offset: 0, count: _ - N }, k = Q, G = _ - N;
       }
-      B >= 0 && (b.add(B), w += G), $.push({ bounds: Nt(x, o), lods: T, budgetGroup: g });
+      k >= 0 && (x.add(k), g += G), $.push({ bounds: Pt(E, o), lods: B, budgetGroup: v });
     }
   }
-  const v = await Rt(t, o);
-  if (v > 0 && l !== null) {
-    const g = at(o), x = p(`${l}#env`, {
+  const b = await _t(t, o);
+  let C;
+  if (b > 0 && l !== null) {
+    const v = ut(o), E = m(`${l}#env`, {
       format: "lcc-bin",
       lcc: {
         kind: "environment",
         start: 0,
-        length: v * g,
+        length: b * v,
         // From `fileType`, never from whether SH is enabled: a Quality
         // environment record is 96 bytes even when its SH is being skipped.
-        stride: g,
+        stride: v,
         scale: o.envScale,
         ...f === void 0 ? {} : {
           sh: {
@@ -329,25 +330,22 @@ async function ae(e, t, n) {
         }
       }
     });
-    b.add(x), w += v, $.push({
-      bounds: V(o),
-      lods: [{ file: x, offset: 0, count: v }]
-    });
+    x.add(E), g += b, C = { file: E };
   }
-  const y = {
+  const L = {
     leaves: $,
     chunkUrls: d,
     // Per-level splat totals; index 0 is the finest. Informational here (the
     // pool and coverage floor are sized explicitly below), but kept accurate.
-    counts: o.splats.slice(0, C),
-    lodLevels: C,
-    bounds: V(o)
-  }, L = await It(t);
+    counts: o.splats.slice(0, y),
+    lodLevels: y,
+    bounds: tt(o)
+  }, p = await Nt(t);
   return {
     // Classic LCC cells are broad XY tiles. Keep their priority independent of
     // frustum crossings so an orbit does not demote a sharp tile as it leaves
     // one edge, then rebuild it when the same tile re-enters the other edge.
-    source: new Ct(y, {
+    source: new yt(L, {
       ...n,
       // Classic LCC cells are broad XY tiles. Keep their priority independent of
       // frustum crossings so an orbit does not demote a sharp tile as it leaves
@@ -368,25 +366,26 @@ async function ae(e, t, n) {
       forceFinestWhenFits: !1
     }),
     chunkUrls: d,
-    chunkOptions: m,
+    chunkOptions: w,
     shBands: f ?? 0,
     chunkKind: "file",
-    bounds: V(o),
-    pinnedFiles: b,
+    bounds: tt(o),
+    pinnedFiles: x,
     // Worst case is every cell resident at its finest level, plus the sky.
-    maxResidentSplats: (o.splats[0] ?? n.budget) + v,
+    maxResidentSplats: (o.splats[0] ?? n.budget) + b,
     // Full coarse coverage is each cell's coarsest level plus the sky - the
     // budget floor below which even the substitute levels cannot all fit.
-    minimumCoverageSplats: Math.max(1, w),
+    minimumCoverageSplats: Math.max(1, g),
     // Same Z-up frame as .lcc2; bounds stay source-local and matrixWorld
     // handles the conversion.
     formatTransform: H(),
     // Optional classic-LCC collision mesh file. One descriptor for the whole
     // `.lci`; `loadCollisionMeshes` expands it into per-cell triangle tiles.
-    ...L !== null ? { collision: { meshes: [{ url: L }] } } : {}
+    ...p !== null ? { collision: { meshes: [{ url: p }] } } : {},
+    ...C !== void 0 ? { environment: C } : {}
   };
 }
-async function It(e) {
+async function Nt(e) {
   for (const t of ["collision.lci", "Collision.lci"]) {
     const n = await e.size(t);
     if (n !== null && Number.isSafeInteger(n) && n > 0)
@@ -394,28 +393,28 @@ async function It(e) {
   }
   return null;
 }
-function at(e) {
-  return e.fileType === "Quality" ? F + O : F;
+function ut(e) {
+  return e.fileType === "Quality" ? T + O : T;
 }
-function Nt(e, t) {
+function Pt(e, t) {
   const { min: n, max: o } = t.bounds, s = n[0] + e.cellX * t.cellLengthX, i = n[1] + e.cellY * t.cellLengthY;
-  return new E.Box3(
-    new E.Vector3(Math.min(s, o[0]), Math.min(i, o[1]), n[2]),
-    new E.Vector3(
+  return new S.Box3(
+    new S.Vector3(Math.min(s, o[0]), Math.min(i, o[1]), n[2]),
+    new S.Vector3(
       Math.min(s + t.cellLengthX, o[0]),
       Math.min(i + t.cellLengthY, o[1]),
       o[2]
     )
   );
 }
-function V(e) {
+function tt(e) {
   const { min: t, max: n } = e.bounds;
-  return new E.Box3(
-    new E.Vector3(t[0], t[1], t[2]),
-    new E.Vector3(n[0], n[1], n[2])
+  return new S.Box3(
+    new S.Vector3(t[0], t[1], t[2]),
+    new S.Vector3(n[0], n[1], n[2])
   );
 }
-function Pt(e, t) {
+function Rt(e, t) {
   for (let n = 0; n < t.totalLevel; n++) {
     let o = 0;
     for (const c of e) o += c.levels[n].count;
@@ -426,20 +425,20 @@ function Pt(e, t) {
       );
   }
 }
-async function Rt(e, t) {
+async function _t(e, t) {
   const n = await e.size("environment.bin");
   if (n === null || !Number.isSafeInteger(n) || n <= 0) return 0;
-  const o = at(t);
+  const o = ut(t);
   if (n % o !== 0)
     throw new Error(
       `LCC environment.bin is ${n} bytes, not a multiple of the ${o}-byte ${t.fileType} record.`
     );
   return n / o;
 }
-async function _t(e, t, n) {
+async function Dt(e, t, n) {
   let o;
   try {
-    o = await fetch(e, ct(t.request, t.signal));
+    o = await fetch(e, at(t.request, t.signal));
   } catch (s) {
     throw W(s, { phase: n, url: e });
   }
@@ -451,40 +450,40 @@ async function _t(e, t, n) {
     });
   return o.arrayBuffer();
 }
-const Dt = 3, zt = 0.1, tt = 0.1, Ot = 500;
-function ue(e, t, n, o = 0) {
-  var $, b;
-  const s = e, i = s.root.splatFiles.map((w) => {
-    const C = t.resolve(w);
-    if (C === null) throw new Error(`LCC2 dataset is missing the tile "${w}".`);
-    return C;
+const zt = 3, Ot = 0.1, et = 0.1, kt = 500;
+function he(e, t, n, o = 0) {
+  var $, x;
+  const s = e, i = s.root.splatFiles.map((g) => {
+    const y = t.resolve(g);
+    if (y === null) throw new Error(`LCC2 dataset is missing the tile "${g}".`);
+    return y;
   }), l = [], c = [];
   let a = 0;
-  const r = (w, C) => {
-    var M;
-    const v = (M = w.data) == null ? void 0 : M["3dgs"];
-    if (!v) throw new Error("LCC2 node is missing 3dgs data.");
-    const y = l.length;
+  const r = (g, y) => {
+    var U;
+    const b = (U = g.data) == null ? void 0 : U["3dgs"];
+    if (!b) throw new Error("LCC2 node is missing 3dgs data.");
+    const C = l.length;
     l.push(null);
-    const L = a, g = [], x = w.child ? Object.values(w.child) : [];
-    if (x.length === 0)
-      c[a] = y, a++;
+    const L = a, p = [], v = g.child ? Object.values(g.child) : [];
+    if (v.length === 0)
+      c[a] = C, a++;
     else
-      for (const S of x) g.push(r(S, C + 1));
-    const U = x.length === 0 ? L + 1 : a;
-    return l[y] = {
-      file: v.name,
-      offset: v.start,
-      count: v.count,
-      bounds: q(w.boundingBox),
-      level: s.totalLevels - C,
-      children: g,
+      for (const F of v) p.push(r(F, y + 1));
+    const E = v.length === 0 ? L + 1 : a;
+    return l[C] = {
+      file: b.name,
+      offset: b.start,
+      count: b.count,
+      bounds: q(g.boundingBox),
+      level: s.totalLevels - y,
+      children: p,
       leafStart: L,
-      leafEnd: U
-    }, y;
-  }, u = Object.values(s.root.child ?? {}).map((w) => r(w, 1)), f = new Yt(l, u, c, s.totalLevels - 1, n), h = new Set(u.map((w) => l[w].file)), d = (b = ($ = s.root.data) == null ? void 0 : $.env) == null ? void 0 : b.name, m = d !== void 0 && i[d] !== void 0 ? { file: d } : void 0;
-  d !== void 0 && m === void 0 && z(`LCC2 root references env tile #${d}, which the manifest does not list.`), m && h.add(m.file);
-  const p = o >= 1 ? o : void 0;
+      leafEnd: E
+    }, C;
+  }, u = Object.values(s.root.child ?? {}).map((g) => r(g, 1)), f = new Vt(l, u, c, s.totalLevels - 1, n), h = new Set(u.map((g) => l[g].file)), d = (x = ($ = s.root.data) == null ? void 0 : $.env) == null ? void 0 : x.name, w = d !== void 0 && i[d] !== void 0 ? { file: d } : void 0;
+  d !== void 0 && w === void 0 && z(`LCC2 root references env tile #${d}, which the manifest does not list.`), w && h.add(w.file);
+  const m = o >= 1 ? o : void 0;
   return {
     source: f,
     chunkUrls: i,
@@ -494,24 +493,24 @@ function ue(e, t, n, o = 0) {
     // `.sog` extension, so the chunk loader cannot sniff the parser from the URL.
     chunkOptions: i.map(() => ({
       format: "sog",
-      ...p ? { sog: { packShBands: p } } : {}
+      ...m ? { sog: { packShBands: m } } : {}
     })),
     bounds: q(s.root.boundingBox),
     pinnedFiles: h,
     maxResidentSplats: s.lodSplats[0] ?? n.budget,
     minimumCoverageSplats: Math.max(
       1,
-      u.reduce((w, C) => w + l[C].count, 0)
+      u.reduce((g, y) => g + l[y].count, 0)
     ),
-    ...kt(s, t),
-    ...m ? { environment: m } : {},
-    ...p ? { shBands: p } : {},
+    ...Yt(s, t),
+    ...w ? { environment: w } : {},
+    ...m ? { shBands: m } : {},
     // Match the established XGRIDS LCC and Spark viewer coordinate frame.
     // Bounds remain source-local and matrixWorld handles the conversion.
     formatTransform: H()
   };
 }
-function kt(e, t) {
+function Yt(e, t) {
   const n = e.root.meshFiles;
   if (!n || n.length === 0) return {};
   const o = /* @__PURE__ */ new Map(), s = (c) => {
@@ -537,7 +536,7 @@ function kt(e, t) {
   }
   return l.length > 0 ? { collision: { meshes: l } } : {};
 }
-class Yt {
+class Vt {
   constructor(t, n, o, s, i) {
     A(this, "budget");
     A(this, "lodBaseDistance");
@@ -554,8 +553,8 @@ class Yt {
     A(this, "changedAt");
     /** Index into {@link rootChildren} of the subtree containing each cell. */
     A(this, "cellRootChild");
-    A(this, "scratchBox", new E.Box3());
-    A(this, "scratchSize", new E.Vector3());
+    A(this, "scratchBox", new S.Box3());
+    A(this, "scratchSize", new S.Vector3());
     this.nodes = t, this.rootChildren = n, this.cellNodes = o, this.coarsest = s, this.budget = i.budget, this.lodBaseDistance = i.lodBaseDistance, this.lodMultiplier = i.lodMultiplier;
     const l = o.length;
     this.cellFinestLevel = new Int32Array(l), this.cellLevel = new Int32Array(l).fill(s), this.changedAt = new Float64Array(l);
@@ -571,8 +570,8 @@ class Yt {
     let c = l.reduce((h, d) => h + d, 0);
     const a = (h, d) => {
       i[h] = i[h] + d;
-      const m = this.cellRootChild[h], p = this.subtreeCutTotal(this.rootChildren[m], i);
-      c += p - l[m], l[m] = p;
+      const w = this.cellRootChild[h], m = this.subtreeCutTotal(this.rootChildren[w], i);
+      c += m - l[w], l[w] = m;
     }, r = [...this.cellNodes.keys()].sort(
       (h, d) => s[d] - s[h]
     );
@@ -625,7 +624,7 @@ class Yt {
   /** Finest-cell AABB expanded by {@link FRUSTUM_MARGIN}, written into scratch. */
   expandCellBox(t) {
     const n = this.nodes[this.cellNodes[t]];
-    return this.scratchBox.copy(n.bounds), n.bounds.getSize(this.scratchSize), this.scratchBox.expandByScalar(this.scratchSize.length() * zt), this.scratchBox;
+    return this.scratchBox.copy(n.bounds), n.bounds.getSize(this.scratchSize), this.scratchBox.expandByScalar(this.scratchSize.length() * Ot), this.scratchBox;
   }
   cellIntersectsFrustum(t, n) {
     return t.intersectsBox(this.expandCellBox(n));
@@ -633,7 +632,7 @@ class Yt {
   /** Distance (frustum-penalized) to each finest cell's node bounds. */
   cellDistanceOf(t, n, o) {
     const i = this.nodes[this.cellNodes[o]].bounds.distanceToPoint(t);
-    return this.cellIntersectsFrustum(n, o) ? i : i * Dt;
+    return this.cellIntersectsFrustum(n, o) ? i : i * zt;
   }
   /** Advances each cell's dwelled level toward the distance target. */
   updateCellLevels(t, n, o) {
@@ -643,9 +642,9 @@ class Yt {
       l[c] = a;
       const r = this.cellFinestLevel[c];
       let u = Math.min(this.coarsest, Math.max(r, this.cellLevel[c]));
-      for (; u < this.coarsest && a > s * i ** u * (1 + tt); ) u++;
-      for (; u > r && a <= s * i ** (u - 1) * (1 - tt); ) u--;
-      u !== this.cellLevel[c] && o - this.changedAt[c] >= Ot && (this.cellLevel[c] = u, this.changedAt[c] = o);
+      for (; u < this.coarsest && a > s * i ** u * (1 + et); ) u++;
+      for (; u > r && a <= s * i ** (u - 1) * (1 - et); ) u--;
+      u !== this.cellLevel[c] && o - this.changedAt[c] >= kt && (this.cellLevel[c] = u, this.changedAt[c] = o);
     }
     return l;
   }
@@ -693,19 +692,19 @@ function X(e) {
   };
 }
 function q(e) {
-  return new E.Box3(
-    new E.Vector3(e.min[0], e.min[1], e.min[2]),
-    new E.Vector3(e.max[0], e.max[1], e.max[2])
+  return new S.Box3(
+    new S.Vector3(e.min[0], e.min[1], e.min[2]),
+    new S.Vector3(e.max[0], e.max[1], e.max[2])
   );
 }
-const et = ["vertex_indices", "vertex_index"];
-function Vt(e) {
+const nt = ["vertex_indices", "vertex_index"];
+function Xt(e) {
   const t = xt(e), n = t.element("vertex");
   if (!n) throw new Error('Not a mesh PLY: no "vertex" element.');
-  vt(n, ["x", "y", "z"], ["float", "float32"], "Mesh PLY vertex"), bt(n, e.byteLength);
-  const o = Xt(e, n), s = t.element("face");
+  bt(n, ["x", "y", "z"], ["float", "float32"], "Mesh PLY vertex"), Lt(n, e.byteLength);
+  const o = qt(e, n), s = t.element("face");
   if (!s) throw new Error('Not a mesh PLY: no "face" element.');
-  const i = qt(e, s, n.count);
+  const i = Ht(e, s, n.count);
   return {
     vertexCount: n.count,
     triangleCount: i.length / 3,
@@ -713,15 +712,15 @@ function Vt(e) {
     indices: i
   };
 }
-function Xt(e, t) {
-  const n = new DataView(e, t.offset), o = k(t, "x"), s = k(t, "y"), i = k(t, "z"), l = new Float32Array(t.count * 3);
+function qt(e, t) {
+  const n = new DataView(e, t.offset), o = Y(t, "x"), s = Y(t, "y"), i = Y(t, "z"), l = new Float32Array(t.count * 3);
   for (let c = 0; c < t.count; c++) {
     const a = c * t.stride;
     l[c * 3] = n.getFloat32(a + o, !0), l[c * 3 + 1] = n.getFloat32(a + s, !0), l[c * 3 + 2] = n.getFloat32(a + i, !0);
   }
   return l;
 }
-function qt(e, t, n) {
+function Ht(e, t, n) {
   if (t.count === 0) return new Uint32Array(0);
   if (t.offset < 0)
     throw new Error(
@@ -731,41 +730,41 @@ function qt(e, t, n) {
     throw new Error(
       'Unsupported mesh PLY: the "face" element mixes scalar properties with its index list.'
     );
-  const o = et.find((h) => t.listProperties.has(h)), s = o ? t.listProperties.get(o) : void 0;
+  const o = nt.find((h) => t.listProperties.has(h)), s = o ? t.listProperties.get(o) : void 0;
   if (!s)
     throw new Error(
-      `Mesh PLY "face" element is missing an index list (${et.join(" or ")}).`
+      `Mesh PLY "face" element is missing an index list (${nt.join(" or ")}).`
     );
   const i = j(s.countType), l = j(s.itemType), c = new DataView(e), a = e.byteLength;
   let r = new Uint32Array(t.count * 3), u = 0, f = t.offset;
   for (let h = 0; h < t.count; h++) {
-    if (f + i > a) throw new Error(nt(h));
-    const d = ot(c, f, s.countType, i);
+    if (f + i > a) throw new Error(ot(h));
+    const d = st(c, f, s.countType, i);
     if (d < 0)
       throw new Error(`Mesh PLY face ${h} declares a negative vertex count (${d}).`);
-    if (f += i, f + d * l > a) throw new Error(nt(h));
-    const m = Math.max(0, d - 2);
-    if (u + m * 3 > r.length) {
-      const b = new Uint32Array(Math.max(r.length * 2, u + m * 3));
-      b.set(r.subarray(0, u)), r = b;
+    if (f += i, f + d * l > a) throw new Error(ot(h));
+    const w = Math.max(0, d - 2);
+    if (u + w * 3 > r.length) {
+      const x = new Uint32Array(Math.max(r.length * 2, u + w * 3));
+      x.set(r.subarray(0, u)), r = x;
     }
-    let p = 0, $ = 0;
-    for (let b = 0; b < d; b++) {
-      const w = ot(c, f + b * l, s.itemType, l);
-      if (w < 0 || w >= n)
+    let m = 0, $ = 0;
+    for (let x = 0; x < d; x++) {
+      const g = st(c, f + x * l, s.itemType, l);
+      if (g < 0 || g >= n)
         throw new Error(
-          `Mesh PLY face ${h} references vertex ${w}, but the file has ${n}.`
+          `Mesh PLY face ${h} references vertex ${g}, but the file has ${n}.`
         );
-      b === 0 ? p = w : b >= 2 && (r[u++] = p, r[u++] = $, r[u++] = w), $ = w;
+      x === 0 ? m = g : x >= 2 && (r[u++] = m, r[u++] = $, r[u++] = g), $ = g;
     }
     f += d * l;
   }
   return u === r.length ? r : r.slice(0, u);
 }
-function nt(e) {
+function ot(e) {
   return `Truncated PLY file: the "face" element ends inside face ${e}.`;
 }
-function ot(e, t, n, o) {
+function st(e, t, n, o) {
   switch (n) {
     case "char":
     case "int8":
@@ -789,31 +788,31 @@ function ot(e, t, n, o) {
       throw new Error(`Unsupported PLY index type: "${n}" (${o} bytes).`);
   }
 }
-const Ht = 1819045731, st = 2, D = 48, it = 40, ut = 3, ht = 3, rt = ut * 4, Gt = ht * 4;
-function Qt(e) {
+const Gt = 1819045731, it = 2, D = 48, rt = 40, ht = 3, ft = 3, lt = ht * 4, Qt = ft * 4;
+function Wt(e) {
   if (e.byteLength < D)
     throw new Error(
       `collision.lci is truncated: ${e.byteLength} bytes, need at least ${D}.`
     );
   const t = new DataView(e), n = t.getUint32(0, !0);
-  if (n !== Ht)
+  if (n !== Gt)
     throw new Error(
       `Not a collision.lci: expected magic "coll", got 0x${n.toString(16).padStart(8, "0")}.`
     );
   const o = t.getUint32(4, !0);
-  if (o !== st)
+  if (o !== it)
     throw new Error(
-      `Unsupported collision.lci version ${o} (expected ${st}).`
+      `Unsupported collision.lci version ${o} (expected ${it}).`
     );
-  const s = t.getUint32(8, !0), i = new E.Vector3(
+  const s = t.getUint32(8, !0), i = new S.Vector3(
     t.getFloat32(12, !0),
     t.getFloat32(16, !0),
     t.getFloat32(20, !0)
-  ), l = new E.Vector3(
+  ), l = new S.Vector3(
     t.getFloat32(24, !0),
     t.getFloat32(28, !0),
     t.getFloat32(32, !0)
-  ), c = t.getFloat32(36, !0), a = t.getFloat32(40, !0), r = t.getUint32(44, !0), u = D + r * it;
+  ), c = t.getFloat32(36, !0), a = t.getFloat32(40, !0), r = t.getUint32(44, !0), u = D + r * rt;
   if (s !== u)
     throw new Error(
       `collision.lci headerLen ${s} does not match ${r} mesh headers (expected ${u}).`
@@ -826,46 +825,46 @@ function Qt(e) {
     throw new Error(
       `collision.lci cell lengths must be positive (got ${c} × ${a}).`
     );
-  const f = new E.Box3(i.clone(), l.clone()), h = [];
+  const f = new S.Box3(i.clone(), l.clone()), h = [];
   let d = s;
-  for (let m = 0; m < r; m++) {
-    const p = D + m * it, $ = t.getUint32(p, !0), b = t.getUint32(p + 4, !0), w = Number(t.getBigUint64(p + 8, !0)), C = Number(t.getBigUint64(p + 16, !0)), v = t.getUint32(p + 24, !0), y = t.getUint32(p + 28, !0), L = t.getUint32(p + 32, !0);
-    if (!Number.isSafeInteger(w) || !Number.isSafeInteger(C))
-      throw new Error(`collision.lci mesh ${m} has an unsafe data offset/size.`);
-    if (w !== d)
+  for (let w = 0; w < r; w++) {
+    const m = D + w * rt, $ = t.getUint32(m, !0), x = t.getUint32(m + 4, !0), g = Number(t.getBigUint64(m + 8, !0)), y = Number(t.getBigUint64(m + 16, !0)), b = t.getUint32(m + 24, !0), C = t.getUint32(m + 28, !0), L = t.getUint32(m + 32, !0);
+    if (!Number.isSafeInteger(g) || !Number.isSafeInteger(y))
+      throw new Error(`collision.lci mesh ${w} has an unsafe data offset/size.`);
+    if (g !== d)
       throw new Error(
-        `collision.lci mesh ${m} data offset ${w} is not contiguous (expected ${d}).`
+        `collision.lci mesh ${w} data offset ${g} is not contiguous (expected ${d}).`
       );
-    if (v * rt + y * Gt + L !== C)
+    if (b * lt + C * Qt + L !== y)
       throw new Error(
-        `collision.lci mesh ${m} size ${C} != ${v}*12 + ${y}*12 + BVH ${L}.`
+        `collision.lci mesh ${w} size ${y} != ${b}*12 + ${C}*12 + BVH ${L}.`
       );
-    const x = w + C;
-    if (x > e.byteLength)
+    const v = g + y;
+    if (v > e.byteLength)
       throw new Error(
-        `collision.lci mesh ${m} extends to byte ${x}, past file length ${e.byteLength}.`
+        `collision.lci mesh ${w} extends to byte ${v}, past file length ${e.byteLength}.`
       );
-    const U = new Float32Array(e, w, v * ut), M = w + v * rt, S = new Uint32Array(e, M, y * ht);
-    for (let T = 0; T < S.length; T++) {
-      const B = S[T];
-      if (B >= v)
+    const E = new Float32Array(e, g, b * ht), U = g + b * lt, F = new Uint32Array(e, U, C * ft);
+    for (let M = 0; M < F.length; M++) {
+      const B = F[M];
+      if (B >= b)
         throw new Error(
-          `collision.lci mesh ${m} face index ${B} is out of range (vertexCount ${v}).`
+          `collision.lci mesh ${w} face index ${B} is out of range (vertexCount ${b}).`
         );
     }
     h.push({
       cellX: $,
-      cellY: b,
+      cellY: x,
       data: {
-        vertexCount: v,
-        triangleCount: y,
+        vertexCount: b,
+        triangleCount: C,
         // Copy so the returned arrays outlive a transferred/detached buffer
         // and are not views into the BVH-adjacent region.
-        positions: U.slice(),
-        indices: S.slice()
+        positions: E.slice(),
+        indices: F.slice()
       },
-      bounds: Wt($, b, c, a, f)
-    }), d = x;
+      bounds: jt($, x, c, a, f)
+    }), d = v;
   }
   if (d !== e.byteLength)
     throw new Error(
@@ -879,21 +878,21 @@ function Qt(e) {
     tiles: h
   };
 }
-function Wt(e, t, n, o, s) {
+function jt(e, t, n, o, s) {
   const i = s.min.x + e * n, l = s.min.y + t * o;
-  return new E.Box3(
-    new E.Vector3(Math.min(i, s.max.x), Math.min(l, s.max.y), s.min.z),
-    new E.Vector3(
+  return new S.Box3(
+    new S.Vector3(Math.min(i, s.max.x), Math.min(l, s.max.y), s.min.z),
+    new S.Vector3(
       Math.min(i + n, s.max.x),
       Math.min(l + o, s.max.y),
       s.max.z
     )
   );
 }
-async function he(e, t = {}) {
+async function fe(e, t = {}) {
   var s;
   const n = await Promise.allSettled(
-    e.meshes.map((i) => jt(i, t))
+    e.meshes.map((i) => Kt(i, t))
   );
   (s = t.signal) == null || s.throwIfAborted();
   const o = [];
@@ -901,18 +900,18 @@ async function he(e, t = {}) {
     i.status === "fulfilled" ? o.push(...i.value) : z("Skipping a collision mesh that failed to load:", i.reason);
   return o;
 }
-async function jt(e, t) {
-  const n = await fetch(e.url, ct(t.request, t.signal));
+async function Kt(e, t) {
+  const n = await fetch(e.url, at(t.request, t.signal));
   if (!n.ok)
     throw new Error(`HTTP ${n.status} for collision mesh ${e.url}`);
   const o = await n.arrayBuffer();
-  if (Kt(e.url))
-    return Qt(o).tiles.map((l) => ({
+  if (Zt(e.url))
+    return Wt(o).tiles.map((l) => ({
       url: `${e.url}#c${l.cellX}_${l.cellY}`,
       data: l.data,
       bounds: l.bounds
     }));
-  const s = Vt(o);
+  const s = Xt(o);
   return [
     {
       url: e.url,
@@ -921,15 +920,15 @@ async function jt(e, t) {
     }
   ];
 }
-function Kt(e) {
+function Zt(e) {
   try {
     return new URL(e, "https://example.invalid/").pathname.toLowerCase().endsWith(".lci");
   } catch {
     return e.toLowerCase().includes(".lci");
   }
 }
-function fe(e, t) {
-  Zt(e);
+function de(e, t) {
+  Jt(e);
   const { positions: n, indices: o, vertexCount: s, triangleCount: i } = e, l = new Uint8Array(s);
   for (let r = 0; r < s; r++)
     l[r] = t.containsPoint(
@@ -944,11 +943,11 @@ function fe(e, t) {
     (l[u] === 1 || l[f] === 1 || l[h] === 1) && (c[r] = 1, a++);
   }
   return {
-    inside: lt(e, c, 1, a),
-    outside: lt(e, c, 0, i - a)
+    inside: ct(e, c, 1, a),
+    outside: ct(e, c, 0, i - a)
   };
 }
-function Zt(e) {
+function Jt(e) {
   if (e.positions.length < e.vertexCount * 3)
     throw new Error(
       `partitionTriangleMesh: positions hold ${e.positions.length} floats, too few for ${e.vertexCount} vertices.`
@@ -965,7 +964,7 @@ function Zt(e) {
       );
   }
 }
-function lt(e, t, n, o) {
+function ct(e, t, n, o) {
   const s = new Int32Array(e.vertexCount).fill(-1), i = new Uint32Array(o * 3);
   let l = 0, c = 0;
   for (let r = 0; r < e.triangleCount; r++)
@@ -983,16 +982,16 @@ function lt(e, t, n, o) {
   return { vertexCount: l, triangleCount: o, positions: a, indices: i };
 }
 export {
-  ce as applyLcc2ToThreeTransform,
-  ue as buildLcc2Scene,
-  ae as buildLccScene,
+  ae as applyLcc2ToThreeTransform,
+  he as buildLcc2Scene,
+  ue as buildLccScene,
   H as createLcc2ToThreeMatrix,
-  he as loadCollisionMeshTiles,
-  Qt as parseCollisionLci,
-  le as parseLccChunk,
-  Mt as parseLccIndex,
-  Et as parseLccManifest,
-  Vt as parseMeshPly,
-  fe as partitionTriangleMesh
+  fe as loadCollisionMeshTiles,
+  Wt as parseCollisionLci,
+  ce as parseLccChunk,
+  Ft as parseLccIndex,
+  St as parseLccManifest,
+  Xt as parseMeshPly,
+  de as partitionTriangleMesh
 };
 //# sourceMappingURL=lcc.js.map