@voluma/vlam 0.2.1 → 0.2.3

package/dist/formats/lcc.js

@@ -1,14 +1,14 @@
 var dt = Object.defineProperty;
-var wt = (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) => wt(e, typeof t != "symbol" ? t + "" : t, n);
-import { w as gt } from "../splat-data-BZM5dhhx.js";
+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 { M as Ct, L as yt } from "../splat-mesh-types-8QDjTbZO.js";
-import { t as ct, a as Q } from "../loading-wLo8vRbA.js";
-import { w as D } from "../logging-BfPdd7NJ.js";
-import { p as vt, a as xt, b as bt, c as k, d as W } from "../ply-header-BwgExCn-.js";
-const U = 32, O = 64, j = 1 << 24;
+import { M as Ct, L as yt } from "../splat-mesh-types-CTN_duw2.js";
+import { t as ct, a as W } from "../loading-wLo8vRbA.js";
+import { w as z } from "../logging-BfPdd7NJ.js";
+import { p as xt, a as vt, b as bt, c as k, d as j } from "../ply-header-BwgExCn-.js";
+const F = 32, O = 64, K = 1 << 24;
 function Lt(e) {
   return e === 1 ? 3 : e === 2 ? 8 : 15;
 }
@@ -24,56 +24,56 @@ function Et(e) {
   const s = t.totalLevel;
   if (!Number.isSafeInteger(s) || s < 1)
     throw new Error(`LCC manifest declares an invalid totalLevel: ${String(s)}.`);
-  const i = s, r = t.indexDataSize, c = 4 + i * 16;
-  if (r !== c)
+  const i = s, l = t.indexDataSize, c = 4 + i * 16;
+  if (l !== c)
     throw new Error(
-      `LCC manifest indexDataSize is ${String(r)}, but ${i} levels imply ${c}.`
+      `LCC manifest indexDataSize is ${String(l)}, but ${i} levels imply ${c}.`
     );
-  const u = t.splats;
-  if (!Array.isArray(u) || u.length !== i)
+  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 w of u)
-    if (!Number.isSafeInteger(w) || w < 0)
-      throw new Error(`LCC manifest "splats" contains an invalid count: ${String(w)}.`);
-  const l = t.totalSplats;
-  if (!Number.isSafeInteger(l) || l < 0)
-    throw new Error(`LCC manifest declares an invalid totalSplats: ${String(l)}.`);
-  const a = Z(t, "cellLengthX"), f = Z(t, "cellLengthY");
-  if (a <= 0 || f <= 0)
+  for (const g of a)
+    if (!Number.isSafeInteger(g) || g < 0)
+      throw new Error(`LCC manifest "splats" contains an invalid count: ${String(g)}.`);
+  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((w) => w !== 0))
+  if (Array.isArray(d) && d.some((g) => g !== 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((w) => w !== 1))
+  if (Array.isArray(m) && m.some((g) => g !== 1))
     throw new Error(
       `LCC manifest "scale" is non-identity (${JSON.stringify(m)}), which is not supported.`
     );
-  const p = t.boundingBox, $ = N(p == null ? void 0 : p.min, "boundingBox.min"), b = N(p == null ? void 0 : p.max, "boundingBox.max"), g = t.attributes;
-  if (!Array.isArray(g)) throw new Error('LCC manifest is missing "attributes".');
+  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 w of g)
-    typeof (w == null ? void 0 : w.name) == "string" && (!Array.isArray(w.min) || w.min.length < 3 || C.set(w.name, {
-      min: N(w.min, `attributes.${w.name}.min`),
-      max: N(w.max, `attributes.${w.name}.max`)
+  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 x = (w) => {
-    const v = C.get(w);
-    if (!v) throw new Error(`LCC manifest is missing the "${w}" attribute range.`);
-    return v;
+  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);
   return {
-    totalSplats: l,
+    totalSplats: r,
     totalLevel: i,
-    cellLengthX: a,
+    cellLengthX: u,
     cellLengthY: f,
     indexDataSize: c,
-    splats: u,
+    splats: a,
     bounds: { min: $, max: b },
     fileType: L,
-    scale: x("scale"),
+    scale: v("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,
@@ -87,7 +87,7 @@ function St(e) {
   if (!Array.isArray(t) || !t.some((o) => o !== 0)) return;
   const n = e.epsg;
   return {
-    origin: N(t, "offset"),
+    origin: P(t, "offset"),
     epsg: Number.isSafeInteger(n) && n > 0 ? n : void 0
   };
 }
@@ -109,95 +109,95 @@ function Mt(e, t) {
       `LCC index.bin is ${e.byteLength} bytes, not a multiple of indexDataSize ${n}.`
     );
   const s = new DataView(e), i = [];
-  for (let r = 0; r < e.byteLength; r += n) {
+  for (let l = 0; l < e.byteLength; l += n) {
     const c = [];
-    for (let u = 0; u < o; u++) {
-      const l = r + 4 + u * 16, a = s.getUint32(l, !0), f = s.getBigUint64(l + 4, !0);
+    for (let a = 0; a < o; a++) {
+      const r = l + 4 + a * 16, u = s.getUint32(r, !0), f = s.getBigUint64(r + 4, !0);
       if (f > BigInt(Number.MAX_SAFE_INTEGER))
         throw new Error(
           `LCC index.bin has a byte offset beyond Number.MAX_SAFE_INTEGER: ${f}.`
         );
-      const h = s.getUint32(l + 12, !0);
-      if (h !== a * U)
+      const h = s.getUint32(r + 12, !0);
+      if (h !== u * F)
         throw new Error(
-          `LCC index.bin level ${u} declares ${a} splats but ${h} bytes (expected ${a * U}).`
+          `LCC index.bin level ${a} declares ${u} splats but ${h} bytes (expected ${u * F}).`
         );
-      c.push({ count: a, byteOffset: Number(f), byteSize: h });
+      c.push({ count: u, byteOffset: Number(f), byteSize: h });
     }
     i.push({
-      cellX: s.getUint16(r, !0),
-      cellY: s.getUint16(r + 2, !0),
+      cellX: s.getUint16(l, !0),
+      cellY: s.getUint16(l + 2, !0),
       levels: c
     });
   }
   return i;
 }
-function Ut(e) {
+function Ft(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 r = e >>> 10 * o & 1023;
-    n[i] = (r - 511) * Tt, o++;
+    const l = e >>> 10 * o & 1023;
+    n[i] = (l - 511) * Tt, 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 re(e, t, n, o) {
-  var x;
+  var v;
   const s = t.stride;
-  if (s !== U && s !== U + O)
+  if (s !== F && s !== F + O)
     throw new Error(`LCC chunk declares an unsupported ${s}-byte record.`);
-  if (((x = t.sh) == null ? void 0 : x.source) === "inline" && s === U)
+  if (((v = t.sh) == null ? void 0 : v.source) === "inline" && s === F)
     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(
       `LCC chunk is ${e.byteLength} bytes, not a multiple of the ${s}-byte record.`
     );
   const i = e.byteLength / s;
-  if (i > j)
+  if (i > K)
     throw new Error(
-      `LCC chunk holds ${i} splats, above the supported maximum of ${j}.`
+      `LCC chunk holds ${i} splats, above the supported maximum of ${K}.`
     );
-  const r = new DataView(e), c = new Float32Array(i * 3), u = new Uint8Array(i * 4), l = new Float32Array(i * 6), a = 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], g = h[2] - f[2];
+  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] = r.getFloat32(L, !0), c[y * 3 + 1] = r.getFloat32(L + 4, !0), c[y * 3 + 2] = r.getFloat32(L + 8, !0), u[y * 4 + 0] = a[L + 12], u[y * 4 + 1] = a[L + 13], u[y * 4 + 2] = a[L + 14], u[y * 4 + 3] = a[L + 15];
-    const [w, v, F, M] = Ut(r.getUint32(L + 22, !0));
-    gt(
-      l,
+    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(
+      r,
       y,
-      d + $ * (r.getUint16(L + 16, !0) / 65535),
-      m + b * (r.getUint16(L + 18, !0) / 65535),
-      p + g * (r.getUint16(L + 20, !0) / 65535),
-      w,
-      v,
-      F,
+      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
     );
   }
   o == null || o.throwIfAborted();
-  const C = t.sh ? Ft(e, n, t.sh, i, s) : void 0;
+  const C = t.sh ? Ut(e, n, t.sh, i, s) : void 0;
   return {
     count: i,
     positions: c,
-    colors: u,
-    covariances: l,
+    colors: a,
+    covariances: r,
     ...C ? { shPacked: C } : {}
   };
 }
-function Ft(e, t, n, o, s) {
-  const i = Lt(n.bands), r = new Uint32Array(o * i);
+function Ut(e, t, n, o, s) {
+  const i = Lt(n.bands), l = new Uint32Array(o * i);
   if (n.source === "inline") {
-    const l = new DataView(e);
-    for (let a = 0; a < o; a++) {
-      const f = a * s + U;
+    const r = new DataView(e);
+    for (let u = 0; u < o; u++) {
+      const f = u * s + F;
       for (let h = 0; h < i; h++)
-        r[a * i + h] = l.getUint32(f + h * 4, !0);
+        l[u * i + h] = r.getUint32(f + h * 4, !0);
     }
-    return K(r, n);
+    return Z(l, n);
   }
   if (!t) throw new Error("LCC chunk expected shcoef.bin bytes but none were fetched.");
   const c = o * O;
@@ -205,15 +205,15 @@ function Ft(e, t, n, o, s) {
     throw new Error(
       `LCC shcoef.bin range is ${t.byteLength} bytes; expected ${c} for ${o} splats.`
     );
-  const u = new DataView(t);
-  for (let l = 0; l < o; l++) {
-    const a = l * O;
+  const a = new DataView(t);
+  for (let r = 0; r < o; r++) {
+    const u = r * O;
     for (let f = 0; f < i; f++)
-      r[l * i + f] = u.getUint32(a + f * 4, !0);
+      l[r * i + f] = a.getUint32(u + f * 4, !0);
   }
-  return K(r, n);
+  return Z(l, n);
 }
-function K(e, t) {
+function Z(e, t) {
   const n = t.requantizeTo;
   if (!n || mt(t.range, n))
     return { bands: t.bands, packed: e, range: t.range };
@@ -221,13 +221,13 @@ function K(e, t) {
     e[o] = pt(e[o], t.range, n);
   return { bands: t.bands, packed: e, range: n };
 }
-function Z(e, t) {
+function J(e, t) {
   const n = e[t];
   if (typeof n != "number" || !Number.isFinite(n))
     throw new Error(`LCC manifest field "${t}" is not a finite number.`);
   return n;
 }
-function N(e, t) {
+function P(e, t) {
   if (!Array.isArray(e) || e.length < 3)
     throw new Error(`LCC manifest "${t}" must have three numbers.`);
   return e.slice(0, 3).map((o) => {
@@ -236,54 +236,54 @@ function N(e, t) {
     return o;
   });
 }
-function q() {
+function H() {
   return new E.Matrix4().set(-1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1);
 }
 function le(e) {
-  e.matrix.copy(q()), e.matrix.decompose(e.position, e.quaternion, e.scale), e.matrixWorldNeedsUpdate = !0;
+  e.matrix.copy(H()), e.matrix.decompose(e.position, e.quaternion, e.scale), e.matrixWorldNeedsUpdate = !0;
 }
 const Bt = 128e3;
 async function ce(e, t, n) {
-  const o = Et(e), s = (w) => {
-    const v = t.resolve(w);
-    if (v === null) throw new Error(`LCC dataset is missing "${w}".`);
-    return v;
-  }, i = s("data.bin"), r = t.resolve("environment.bin"), c = Mt(
-    await It(s("index.bin"), n, "manifest"),
+  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"),
     o
   );
-  Nt(c, o);
-  const u = o.fileType === "Quality" ? Ct : 0, l = n.shBands ?? u, a = Math.min(l, u), f = a === 0 ? void 0 : a, h = f === void 0 ? null : s("shcoef.bin"), d = [], m = [], p = (w, v) => (d.push(w), m.push(v), d.length - 1), $ = [], b = /* @__PURE__ */ new Set();
-  let g = 0;
+  Pt(c, o);
+  const a = o.fileType === "Quality" ? Ct : 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 w = 0; w < c.length; w++) {
-    const v = c[w];
-    let F = 0;
+  for (let g = 0; g < c.length; g++) {
+    const x = c[g];
+    let U = 0;
     for (let S = 0; S < C; S++) {
-      const T = v.levels[S].count;
+      const T = x.levels[S].count;
       if (T > 0) {
-        F = T;
+        U = T;
         break;
       }
     }
-    const M = Math.max(1, Math.ceil(F / Bt));
+    const M = Math.max(1, Math.ceil(U / Bt));
     for (let S = 0; S < M; S++) {
       const T = new Array(C).fill(
         void 0
       );
-      let B = -1, H = 0;
-      for (let P = 0; P < C; P++) {
-        const _ = v.levels[P];
-        if (_.count === 0) continue;
-        const R = Math.floor(S * _.count / M), I = Math.floor((S + 1) * _.count / M);
-        if (I === R) continue;
-        const ft = `${i}#c${v.cellX}_${v.cellY}-l${P}${M > 1 ? `.${S}` : ""}`, G = p(ft, {
+      let B = -1, G = 0;
+      for (let I = 0; I < C; I++) {
+        const R = x.levels[I];
+        if (R.count === 0) continue;
+        const N = Math.floor(S * R.count / M), _ = Math.floor((S + 1) * R.count / M);
+        if (_ === N) continue;
+        const ft = `${i}#c${x.cellX}_${x.cellY}-l${I}${M > 1 ? `.${S}` : ""}`, Q = p(ft, {
           format: "lcc-bin",
           lcc: {
             kind: "splats",
-            start: _.byteOffset + R * U,
-            length: (I - R) * U,
-            stride: U,
+            start: R.byteOffset + N * F,
+            length: (_ - N) * F,
+            stride: F,
             scale: o.scale,
             ...f === void 0 ? {} : {
               sh: {
@@ -298,22 +298,22 @@ async function ce(e, t, n) {
             }
           }
         });
-        T[P] = { file: G, offset: 0, count: I - R }, B = G, H = I - R;
+        T[I] = { file: Q, offset: 0, count: _ - N }, B = Q, G = _ - N;
       }
-      B >= 0 && (b.add(B), g += H), $.push({ bounds: Rt(v, o), lods: T, budgetGroup: w });
+      B >= 0 && (b.add(B), w += G), $.push({ bounds: Nt(x, o), lods: T, budgetGroup: g });
     }
   }
-  const x = await _t(t, o);
-  if (x > 0 && r !== null) {
-    const w = at(o), v = p(`${r}#env`, {
+  const v = await Rt(t, o);
+  if (v > 0 && l !== null) {
+    const g = at(o), x = p(`${l}#env`, {
       format: "lcc-bin",
       lcc: {
         kind: "environment",
         start: 0,
-        length: x * w,
+        length: v * g,
         // From `fileType`, never from whether SH is enabled: a Quality
         // environment record is 96 bytes even when its SH is being skipped.
-        stride: w,
+        stride: g,
         scale: o.envScale,
         ...f === void 0 ? {} : {
           sh: {
@@ -328,9 +328,9 @@ async function ce(e, t, n) {
         }
       }
     });
-    b.add(v), g += x, $.push({
+    b.add(x), w += v, $.push({
       bounds: V(o),
-      lods: [{ file: v, offset: 0, count: x }]
+      lods: [{ file: x, offset: 0, count: v }]
     });
   }
   const y = {
@@ -341,7 +341,7 @@ async function ce(e, t, n) {
     counts: o.splats.slice(0, C),
     lodLevels: C,
     bounds: V(o)
-  }, L = await Pt(t);
+  }, L = await It(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
@@ -373,19 +373,19 @@ async function ce(e, t, n) {
     bounds: V(o),
     pinnedFiles: b,
     // Worst case is every cell resident at its finest level, plus the sky.
-    maxResidentSplats: (o.splats[0] ?? n.budget) + x,
+    maxResidentSplats: (o.splats[0] ?? n.budget) + v,
     // 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, g),
+    minimumCoverageSplats: Math.max(1, w),
     // Same Z-up frame as .lcc2; bounds stay source-local and matrixWorld
     // handles the conversion.
-    formatTransform: q(),
+    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 }] } } : {}
   };
 }
-async function Pt(e) {
+async function It(e) {
   for (const t of ["collision.lci", "Collision.lci"]) {
     const n = await e.size(t);
     if (n !== null && Number.isSafeInteger(n) && n > 0)
@@ -394,9 +394,9 @@ async function Pt(e) {
   return null;
 }
 function at(e) {
-  return e.fileType === "Quality" ? U + O : U;
+  return e.fileType === "Quality" ? F + O : F;
 }
-function Rt(e, t) {
+function Nt(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]),
@@ -414,18 +414,18 @@ function V(e) {
     new E.Vector3(n[0], n[1], n[2])
   );
 }
-function Nt(e, t) {
+function Pt(e, t) {
   for (let n = 0; n < t.totalLevel; n++) {
     let o = 0;
     for (const c of e) o += c.levels[n].count;
-    const s = t.splats[n], i = s - o, r = Math.max(4, Math.ceil(s * 1e-3));
-    if (i < 0 || i > r)
+    const s = t.splats[n], i = s - o, l = Math.max(4, Math.ceil(s * 1e-3));
+    if (i < 0 || i > l)
       throw new Error(
         `LCC index.bin level ${n} totals ${o} splats, but the manifest declares ${String(t.splats[n])}.`
       );
   }
 }
-async function _t(e, t) {
+async function Rt(e, t) {
   const n = await e.size("environment.bin");
   if (n === null || !Number.isSafeInteger(n) || n <= 0) return 0;
   const o = at(t);
@@ -435,54 +435,54 @@ async function _t(e, t) {
     );
   return n / o;
 }
-async function It(e, t, n) {
+async function _t(e, t, n) {
   let o;
   try {
     o = await fetch(e, ct(t.request, t.signal));
   } catch (s) {
-    throw Q(s, { phase: n, url: e });
+    throw W(s, { phase: n, url: e });
   }
   if (!o.ok)
-    throw Q(new Error(`Failed to load ${e}: HTTP ${o.status}`), {
+    throw W(new Error(`Failed to load ${e}: HTTP ${o.status}`), {
       phase: n,
       url: e,
       status: o.status
     });
   return o.arrayBuffer();
 }
-const zt = 3, Dt = 0.1, J = 0.1, Ot = 500;
+const Dt = 3, zt = 0.1, tt = 0.1, Ot = 500;
 function ae(e, t, n, o = 0) {
   var $, b;
-  const s = e, i = s.root.splatFiles.map((g) => {
-    const C = t.resolve(g);
-    if (C === null) throw new Error(`LCC2 dataset is missing the tile "${g}".`);
+  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;
-  }), r = [], c = [];
-  let u = 0;
-  const l = (g, C) => {
+  }), l = [], c = [];
+  let a = 0;
+  const r = (w, C) => {
     var M;
-    const x = (M = g.data) == null ? void 0 : M["3dgs"];
-    if (!x) throw new Error("LCC2 node is missing 3dgs data.");
-    const y = r.length;
-    r.push(null);
-    const L = u, w = [], v = g.child ? Object.values(g.child) : [];
-    if (v.length === 0)
-      c[u] = y, u++;
+    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;
+    l.push(null);
+    const L = a, g = [], x = w.child ? Object.values(w.child) : [];
+    if (x.length === 0)
+      c[a] = y, a++;
     else
-      for (const S of v) w.push(l(S, C + 1));
-    const F = v.length === 0 ? L + 1 : u;
-    return r[y] = {
-      file: x.name,
-      offset: x.start,
-      count: x.count,
-      bounds: X(g.boundingBox),
+      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: w,
+      children: g,
       leafStart: L,
-      leafEnd: F
+      leafEnd: U
     }, y;
-  }, a = Object.values(s.root.child ?? {}).map((g) => l(g, 1)), f = new Yt(r, a, c, s.totalLevels - 1, n), h = new Set(a.map((g) => r[g].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 && D(`LCC2 root references env tile #${d}, which the manifest does not list.`), m && h.add(m.file);
+  }, 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;
   return {
     source: f,
@@ -495,46 +495,46 @@ function ae(e, t, n, o = 0) {
       format: "sog",
       ...p ? { sog: { packShBands: p } } : {}
     })),
-    bounds: X(s.root.boundingBox),
+    bounds: q(s.root.boundingBox),
     pinnedFiles: h,
     maxResidentSplats: s.lodSplats[0] ?? n.budget,
     minimumCoverageSplats: Math.max(
       1,
-      a.reduce((g, C) => g + r[C].count, 0)
+      u.reduce((w, C) => w + l[C].count, 0)
     ),
     ...kt(s, t),
     ...m ? { environment: m } : {},
     ...p ? { shBands: p } : {},
     // Match the established XGRIDS LCC and Spark viewer coordinate frame.
     // Bounds remain source-local and matrixWorld handles the conversion.
-    formatTransform: q()
+    formatTransform: H()
   };
 }
 function kt(e, t) {
   const n = e.root.meshFiles;
   if (!n || n.length === 0) return {};
   const o = /* @__PURE__ */ new Map(), s = (c) => {
-    var l;
-    const u = (l = c.data) == null ? void 0 : l.mesh;
-    u && !o.has(u.name) && o.set(u.name, X(c.boundingBox));
-    for (const a of Object.values(c.child ?? {})) s(a);
+    var r;
+    const a = (r = c.data) == null ? void 0 : r.mesh;
+    a && !o.has(a.name) && o.set(a.name, q(c.boundingBox));
+    for (const u of Object.values(c.child ?? {})) s(u);
   };
   s(e.root);
-  const i = o.size > 0 ? [...o].map(([c, u]) => ({ file: c, bounds: u })) : n.map((c, u) => ({ file: u })), r = [];
-  for (const { file: c, bounds: u } of i) {
-    const l = n[c];
-    if (l === void 0) {
-      D(`LCC2 node references mesh file ${c}, which the manifest does not list.`);
+  const i = o.size > 0 ? [...o].map(([c, a]) => ({ file: c, bounds: a })) : n.map((c, a) => ({ file: a })), l = [];
+  for (const { file: c, bounds: a } of i) {
+    const r = n[c];
+    if (r === void 0) {
+      z(`LCC2 node references mesh file ${c}, which the manifest does not list.`);
       continue;
     }
-    const a = t.resolve(l);
-    if (a === null) {
-      D(`LCC2 dataset is missing the collision mesh "${l}"; skipping it.`);
+    const u = t.resolve(r);
+    if (u === null) {
+      z(`LCC2 dataset is missing the collision mesh "${r}"; skipping it.`);
       continue;
     }
-    r.push({ url: a, ...u ? { bounds: u } : {} });
+    l.push({ url: u, ...a ? { bounds: a } : {} });
   }
-  return r.length > 0 ? { collision: { meshes: r } } : {};
+  return l.length > 0 ? { collision: { meshes: l } } : {};
 }
 class Yt {
   constructor(t, n, o, s, i) {
@@ -556,69 +556,97 @@ class Yt {
     A(this, "scratchBox", new E.Box3());
     A(this, "scratchSize", new E.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 r = o.length;
-    this.cellFinestLevel = new Int32Array(r), this.cellLevel = new Int32Array(r).fill(s), this.changedAt = new Float64Array(r);
-    for (let c = 0; c < r; c++)
+    const l = o.length;
+    this.cellFinestLevel = new Int32Array(l), this.cellLevel = new Int32Array(l).fill(s), this.changedAt = new Float64Array(l);
+    for (let c = 0; c < l; c++)
       this.cellFinestLevel[c] = t[o[c]].level;
-    this.cellRootChild = new Uint32Array(r), n.forEach((c, u) => {
-      const l = t[c];
-      for (let a = l.leafStart; a < l.leafEnd; a++) this.cellRootChild[a] = u;
+    this.cellRootChild = new Uint32Array(l), n.forEach((c, a) => {
+      const r = t[c];
+      for (let u = r.leafStart; u < r.leafEnd; u++) this.cellRootChild[u] = a;
     });
   }
   computeDesiredRuns(t, n, o) {
-    const s = this.updateCellLevels(t, n, o), i = Int32Array.from(this.cellLevel), r = this.rootChildren.map((h) => this.subtreeCutTotal(h, i));
-    let c = r.reduce((h, d) => h + d, 0);
-    const u = (h, d) => {
+    const s = this.updateCellLevels(t, n, o), i = Int32Array.from(this.cellLevel), l = this.rootChildren.map((h) => this.subtreeCutTotal(h, i));
+    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 - r[m], r[m] = p;
-    }, l = [...this.cellNodes.keys()].sort(
+      c += p - l[m], l[m] = p;
+    }, r = [...this.cellNodes.keys()].sort(
       (h, d) => s[d] - s[h]
     );
-    for (let h = 0; h < l.length && c > this.budget; ) {
-      const d = l[h];
-      i[d] < this.coarsest ? u(d, 1) : h++;
+    for (let h = 0; h < r.length && c > this.budget; ) {
+      const d = r[h];
+      i[d] < this.coarsest ? a(d, 1) : h++;
     }
-    const a = this.budget * 0.85;
-    for (let h = l.length - 1; h >= 0 && c < a; ) {
-      const d = l[h];
+    const u = this.budget * 0.85;
+    for (let h = r.length - 1; h >= 0 && c < u; ) {
+      const d = r[h];
       if (i[d] > this.cellFinestLevel[d]) {
-        if (u(d, -1), c > this.budget) {
-          u(d, 1);
+        if (a(d, -1), c > this.budget) {
+          a(d, 1);
           break;
         }
       } else
         h--;
     }
     const f = [];
-    return this.collectCut(i, (h) => f.push(tt(this.nodes[h]))), f;
+    return this.collectCut(i, (h) => f.push(X(this.nodes[h]))), f;
   }
   coarsestRunsFor(t, n) {
     const o = [];
     for (const s of this.rootChildren) {
       const i = this.nodes[s];
-      i.leafStart < n && i.leafEnd > t && o.push(tt(i));
+      i.leafStart < n && i.leafEnd > t && o.push(X(i));
     }
     return o;
   }
+  /**
+   * Coarsest root-child runs covering in-view finest cells. An empty frustum
+   * falls back to the nearest cell's root child so a skyward start still paints
+   * something rather than releasing an empty hold.
+   */
+  coverageRunsFor(t, n) {
+    const o = this.cellNodes.length;
+    if (o === 0) return [];
+    const s = new Uint8Array(this.rootChildren.length);
+    let i = !1, l = 0, c = Number.POSITIVE_INFINITY;
+    for (let r = 0; r < o; r++) {
+      const f = this.nodes[this.cellNodes[r]].bounds.distanceToPoint(t);
+      f < c && (c = f, l = r), this.cellIntersectsFrustum(n, r) && (s[this.cellRootChild[r]] = 1, i = !0);
+    }
+    i || (s[this.cellRootChild[l]] = 1);
+    const a = [];
+    for (let r = 0; r < this.rootChildren.length; r++)
+      s[r] === 1 && a.push(X(this.nodes[this.rootChildren[r]]));
+    return a;
+  }
+  /** 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;
+  }
+  cellIntersectsFrustum(t, n) {
+    return t.intersectsBox(this.expandCellBox(n));
+  }
   /** Distance (frustum-penalized) to each finest cell's node bounds. */
   cellDistanceOf(t, n, o) {
-    const s = this.nodes[this.cellNodes[o]], i = s.bounds.distanceToPoint(t);
-    return this.scratchBox.copy(s.bounds), s.bounds.getSize(this.scratchSize), this.scratchBox.expandByScalar(this.scratchSize.length() * Dt), n.intersectsBox(this.scratchBox) ? i : i * zt;
+    const i = this.nodes[this.cellNodes[o]].bounds.distanceToPoint(t);
+    return this.cellIntersectsFrustum(n, o) ? i : i * Dt;
   }
   /** Advances each cell's dwelled level toward the distance target. */
   updateCellLevels(t, n, o) {
-    const { lodBaseDistance: s, lodMultiplier: i } = this, r = new Float64Array(this.cellNodes.length);
+    const { lodBaseDistance: s, lodMultiplier: i } = this, l = new Float64Array(this.cellNodes.length);
     for (let c = 0; c < this.cellNodes.length; c++) {
-      const u = this.cellDistanceOf(t, n, c);
-      r[c] = u;
-      const l = this.cellFinestLevel[c];
-      let a = Math.min(this.coarsest, Math.max(l, this.cellLevel[c]));
-      for (; a < this.coarsest && u > s * i ** a * (1 + J); ) a++;
-      for (; a > l && u <= s * i ** (a - 1) * (1 - J); ) a--;
-      a !== this.cellLevel[c] && o - this.changedAt[c] >= Ot && (this.cellLevel[c] = a, this.changedAt[c] = o);
+      const a = this.cellDistanceOf(t, n, c);
+      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);
     }
-    return r;
+    return l;
   }
   /** Splat total of one subtree's cut for the given per-cell levels. */
   subtreeCutTotal(t, n) {
@@ -641,19 +669,19 @@ class Yt {
     const s = this.nodes[t];
     if (s.children.length > 0) {
       let i = this.coarsest;
-      for (let r = s.leafStart; r < s.leafEnd; r++) {
-        const c = n[r];
+      for (let l = s.leafStart; l < s.leafEnd; l++) {
+        const c = n[l];
         c < i && (i = c);
       }
       if (i < s.level) {
-        for (const r of s.children) this.visitCut(r, n, o);
+        for (const l of s.children) this.visitCut(l, n, o);
         return;
       }
     }
     o(t);
   }
 }
-function tt(e) {
+function X(e) {
   return {
     file: e.file,
     level: e.level,
@@ -663,7 +691,7 @@ function tt(e) {
     leafEnd: e.leafEnd
   };
 }
-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])
@@ -671,9 +699,9 @@ function X(e) {
 }
 const et = ["vertex_indices", "vertex_index"];
 function Vt(e) {
-  const t = vt(e), n = t.element("vertex");
+  const t = xt(e), n = t.element("vertex");
   if (!n) throw new Error('Not a mesh PLY: no "vertex" element.');
-  xt(n, ["x", "y", "z"], ["float", "float32"], "Mesh PLY vertex"), bt(n, e.byteLength);
+  vt(n, ["x", "y", "z"], ["float", "float32"], "Mesh PLY vertex"), bt(n, e.byteLength);
   const o = Xt(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);
@@ -685,12 +713,12 @@ function Vt(e) {
   };
 }
 function Xt(e, t) {
-  const n = new DataView(e, t.offset), o = k(t, "x"), s = k(t, "y"), i = k(t, "z"), r = new Float32Array(t.count * 3);
+  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);
   for (let c = 0; c < t.count; c++) {
-    const u = c * t.stride;
-    r[c * 3] = n.getFloat32(u + o, !0), r[c * 3 + 1] = n.getFloat32(u + s, !0), r[c * 3 + 2] = n.getFloat32(u + i, !0);
+    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 r;
+  return l;
 }
 function qt(e, t, n) {
   if (t.count === 0) return new Uint32Array(0);
@@ -707,31 +735,31 @@ function qt(e, t, n) {
     throw new Error(
       `Mesh PLY "face" element is missing an index list (${et.join(" or ")}).`
     );
-  const i = W(s.countType), r = W(s.itemType), c = new DataView(e), u = e.byteLength;
-  let l = new Uint32Array(t.count * 3), a = 0, f = t.offset;
+  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 > u) throw new Error(nt(h));
+    if (f + i > a) throw new Error(nt(h));
     const d = ot(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 * r > u) throw new Error(nt(h));
+    if (f += i, f + d * l > a) throw new Error(nt(h));
     const m = Math.max(0, d - 2);
-    if (a + m * 3 > l.length) {
-      const b = new Uint32Array(Math.max(l.length * 2, a + m * 3));
-      b.set(l.subarray(0, a)), l = b;
+    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;
     }
     let p = 0, $ = 0;
     for (let b = 0; b < d; b++) {
-      const g = ot(c, f + b * r, s.itemType, r);
-      if (g < 0 || g >= n)
+      const w = ot(c, f + b * l, s.itemType, l);
+      if (w < 0 || w >= n)
         throw new Error(
-          `Mesh PLY face ${h} references vertex ${g}, but the file has ${n}.`
+          `Mesh PLY face ${h} references vertex ${w}, but the file has ${n}.`
         );
-      b === 0 ? p = g : b >= 2 && (l[a++] = p, l[a++] = $, l[a++] = g), $ = g;
+      b === 0 ? p = w : b >= 2 && (r[u++] = p, r[u++] = $, r[u++] = w), $ = w;
     }
-    f += d * r;
+    f += d * l;
   }
-  return a === l.length ? l : l.slice(0, a);
+  return u === r.length ? r : r.slice(0, u);
 }
 function nt(e) {
   return `Truncated PLY file: the "face" element ends inside face ${e}.`;
@@ -760,11 +788,11 @@ function ot(e, t, n, o) {
       throw new Error(`Unsupported PLY index type: "${n}" (${o} bytes).`);
   }
 }
-const Ht = 1819045731, st = 2, z = 48, it = 40, ut = 3, ht = 3, rt = ut * 4, Gt = ht * 4;
+const Ht = 1819045731, st = 2, D = 48, it = 40, ut = 3, ht = 3, rt = ut * 4, Gt = ht * 4;
 function Qt(e) {
-  if (e.byteLength < z)
+  if (e.byteLength < D)
     throw new Error(
-      `collision.lci is truncated: ${e.byteLength} bytes, need at least ${z}.`
+      `collision.lci is truncated: ${e.byteLength} bytes, need at least ${D}.`
     );
   const t = new DataView(e), n = t.getUint32(0, !0);
   if (n !== Ht)
@@ -780,63 +808,63 @@ function Qt(e) {
     t.getFloat32(12, !0),
     t.getFloat32(16, !0),
     t.getFloat32(20, !0)
-  ), r = new E.Vector3(
+  ), l = new E.Vector3(
     t.getFloat32(24, !0),
     t.getFloat32(28, !0),
     t.getFloat32(32, !0)
-  ), c = t.getFloat32(36, !0), u = t.getFloat32(40, !0), l = t.getUint32(44, !0), a = z + l * it;
-  if (s !== a)
+  ), c = t.getFloat32(36, !0), a = t.getFloat32(40, !0), r = t.getUint32(44, !0), u = D + r * it;
+  if (s !== u)
     throw new Error(
-      `collision.lci headerLen ${s} does not match ${l} mesh headers (expected ${a}).`
+      `collision.lci headerLen ${s} does not match ${r} mesh headers (expected ${u}).`
     );
   if (e.byteLength < s)
     throw new Error(
       `collision.lci is truncated: header claims ${s} bytes, file has ${e.byteLength}.`
     );
-  if (!(c > 0) || !(u > 0))
+  if (!(c > 0) || !(a > 0))
     throw new Error(
-      `collision.lci cell lengths must be positive (got ${c} × ${u}).`
+      `collision.lci cell lengths must be positive (got ${c} × ${a}).`
     );
-  const f = new E.Box3(i.clone(), r.clone()), h = [];
+  const f = new E.Box3(i.clone(), l.clone()), h = [];
   let d = s;
-  for (let m = 0; m < l; m++) {
-    const p = z + m * it, $ = t.getUint32(p, !0), b = t.getUint32(p + 4, !0), g = Number(t.getBigUint64(p + 8, !0)), C = Number(t.getBigUint64(p + 16, !0)), x = t.getUint32(p + 24, !0), y = t.getUint32(p + 28, !0), L = t.getUint32(p + 32, !0);
-    if (!Number.isSafeInteger(g) || !Number.isSafeInteger(C))
+  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 (g !== d)
+    if (w !== d)
       throw new Error(
-        `collision.lci mesh ${m} data offset ${g} is not contiguous (expected ${d}).`
+        `collision.lci mesh ${m} data offset ${w} is not contiguous (expected ${d}).`
       );
-    if (x * rt + y * Gt + L !== C)
+    if (v * rt + y * Gt + L !== C)
       throw new Error(
-        `collision.lci mesh ${m} size ${C} != ${x}*12 + ${y}*12 + BVH ${L}.`
+        `collision.lci mesh ${m} size ${C} != ${v}*12 + ${y}*12 + BVH ${L}.`
       );
-    const v = g + C;
-    if (v > e.byteLength)
+    const x = w + C;
+    if (x > e.byteLength)
       throw new Error(
-        `collision.lci mesh ${m} extends to byte ${v}, past file length ${e.byteLength}.`
+        `collision.lci mesh ${m} extends to byte ${x}, past file length ${e.byteLength}.`
       );
-    const F = new Float32Array(e, g, x * ut), M = g + x * rt, S = new Uint32Array(e, M, y * ht);
+    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 >= x)
+      if (B >= v)
         throw new Error(
-          `collision.lci mesh ${m} face index ${B} is out of range (vertexCount ${x}).`
+          `collision.lci mesh ${m} face index ${B} is out of range (vertexCount ${v}).`
         );
     }
     h.push({
       cellX: $,
       cellY: b,
       data: {
-        vertexCount: x,
+        vertexCount: v,
         triangleCount: y,
         // Copy so the returned arrays outlive a transferred/detached buffer
         // and are not views into the BVH-adjacent region.
-        positions: F.slice(),
+        positions: U.slice(),
         indices: S.slice()
       },
-      bounds: Wt($, b, c, u, f)
-    }), d = v;
+      bounds: Wt($, b, c, a, f)
+    }), d = x;
   }
   if (d !== e.byteLength)
     throw new Error(
@@ -846,17 +874,17 @@ function Qt(e) {
     version: o,
     bounds: f,
     cellLengthX: c,
-    cellLengthY: u,
+    cellLengthY: a,
     tiles: h
   };
 }
 function Wt(e, t, n, o, s) {
-  const i = s.min.x + e * n, r = s.min.y + t * o;
+  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(r, s.max.y), s.min.z),
+    new E.Vector3(Math.min(i, s.max.x), Math.min(l, s.max.y), s.min.z),
     new E.Vector3(
       Math.min(i + n, s.max.x),
-      Math.min(r + o, s.max.y),
+      Math.min(l + o, s.max.y),
       s.max.z
     )
   );
@@ -869,7 +897,7 @@ async function ue(e, t = {}) {
   (s = t.signal) == null || s.throwIfAborted();
   const o = [];
   for (const i of n)
-    i.status === "fulfilled" ? o.push(...i.value) : D("Skipping a collision mesh that failed to load:", i.reason);
+    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) {
@@ -878,10 +906,10 @@ async function jt(e, t) {
     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((r) => ({
-      url: `${e.url}#c${r.cellX}_${r.cellY}`,
-      data: r.data,
-      bounds: r.bounds
+    return Qt(o).tiles.map((l) => ({
+      url: `${e.url}#c${l.cellX}_${l.cellY}`,
+      data: l.data,
+      bounds: l.bounds
     }));
   const s = Vt(o);
   return [
@@ -901,22 +929,22 @@ function Kt(e) {
 }
 function he(e, t) {
   Zt(e);
-  const { positions: n, indices: o, vertexCount: s, triangleCount: i } = e, r = new Uint8Array(s);
-  for (let l = 0; l < s; l++)
-    r[l] = t.containsPoint(
-      n[l * 3],
-      n[l * 3 + 1],
-      n[l * 3 + 2]
+  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(
+      n[r * 3],
+      n[r * 3 + 1],
+      n[r * 3 + 2]
     ) ? 1 : 0;
   const c = new Uint8Array(i);
-  let u = 0;
-  for (let l = 0; l < i; l++) {
-    const a = o[l * 3], f = o[l * 3 + 1], h = o[l * 3 + 2];
-    (r[a] === 1 || r[f] === 1 || r[h] === 1) && (c[l] = 1, u++);
+  let a = 0;
+  for (let r = 0; r < i; r++) {
+    const u = o[r * 3], f = o[r * 3 + 1], h = o[r * 3 + 2];
+    (l[u] === 1 || l[f] === 1 || l[h] === 1) && (c[r] = 1, a++);
   }
   return {
-    inside: lt(e, c, 1, u),
-    outside: lt(e, c, 0, i - u)
+    inside: lt(e, c, 1, a),
+    outside: lt(e, c, 0, i - a)
   };
 }
 function Zt(e) {
@@ -938,26 +966,26 @@ function Zt(e) {
 }
 function lt(e, t, n, o) {
   const s = new Int32Array(e.vertexCount).fill(-1), i = new Uint32Array(o * 3);
-  let r = 0, c = 0;
-  for (let l = 0; l < e.triangleCount; l++)
-    if (t[l] === n)
-      for (let a = 0; a < 3; a++) {
-        const f = e.indices[l * 3 + a];
+  let l = 0, c = 0;
+  for (let r = 0; r < e.triangleCount; r++)
+    if (t[r] === n)
+      for (let u = 0; u < 3; u++) {
+        const f = e.indices[r * 3 + u];
         let h = s[f];
-        h < 0 && (h = r++, s[f] = h), i[c++] = h;
+        h < 0 && (h = l++, s[f] = h), i[c++] = h;
       }
-  const u = new Float32Array(r * 3);
-  for (let l = 0; l < e.vertexCount; l++) {
-    const a = s[l];
-    a < 0 || (u[a * 3] = e.positions[l * 3], u[a * 3 + 1] = e.positions[l * 3 + 1], u[a * 3 + 2] = e.positions[l * 3 + 2]);
+  const a = new Float32Array(l * 3);
+  for (let r = 0; r < e.vertexCount; r++) {
+    const u = s[r];
+    u < 0 || (a[u * 3] = e.positions[r * 3], a[u * 3 + 1] = e.positions[r * 3 + 1], a[u * 3 + 2] = e.positions[r * 3 + 2]);
   }
-  return { vertexCount: r, triangleCount: o, positions: u, indices: i };
+  return { vertexCount: l, triangleCount: o, positions: a, indices: i };
 }
 export {
   le as applyLcc2ToThreeTransform,
   ae as buildLcc2Scene,
   ce as buildLccScene,
-  q as createLcc2ToThreeMatrix,
+  H as createLcc2ToThreeMatrix,
   ue as loadCollisionMeshTiles,
   Qt as parseCollisionLci,
   re as parseLccChunk,