@babylonjs/core 9.12.0 → 9.13.0

package/Meshes/GaussianSplatting/gaussianSplattingSortWorker.d.ts

@@ -0,0 +1,39 @@
+/** This file must only contain pure code and pure imports */
+/**
+ * Message commands exchanged with the Gaussian Splatting depth-sort worker. Every message carries a
+ * `command` field naming the intended work, instead of inferring it from which payload is present.
+ */
+export declare const GaussianSplattingSortWorkerCommand: {
+    /** Main -> worker: set the source splat centers (stride 4: xyz + 1). */
+    readonly POSITIONS: "positions";
+    /** Main -> worker: patch a contiguous sub-range of the existing source splat centers in place. */
+    readonly POSITIONS_UPDATE: "positionsUpdate";
+    /** Main -> worker: set the compound-mesh rig node matrices. */
+    readonly PART_MATRICES: "partMatrices";
+    /** Main -> worker: set the compound-mesh per-splat rig node indices. */
+    readonly PART_INDICES: "partIndices";
+    /** Main -> worker: set the active source-splat ranges (flat [start0, count0, ...]). */
+    readonly INTERVALS: "intervals";
+    /** Main -> worker: sort the active splats for a camera view. */
+    readonly SORT: "sort";
+    /** Worker -> main: a completed sort result. */
+    readonly SORTED: "sorted";
+};
+/**
+ * Depth-sort web worker body for Gaussian Splatting meshes.
+ *
+ * The function is self-contained: it is serialized with `Function.prototype.toString()` and run
+ * inside a `Blob`-backed `Worker`, so it must not reference anything from its enclosing module
+ * (including {@link GaussianSplattingSortWorkerCommand} — the command literals are duplicated here).
+ *
+ * The intended work for each message is selected explicitly via its `command` field:
+ * - `positions`    set source splat centers (stride 4: xyz + 1).
+ * - `partMatrices` set compound-mesh rig node matrices.
+ * - `partIndices`  set compound-mesh per-splat rig node indices.
+ * - `intervals`    set active source-splat ranges (flat [start0, count0, ...]); persisted across sorts.
+ * - `sort`         sort the active splats for `{ worldMatrix, cameraForward, cameraPosition, depthMix,
+ *                  cameraId, sortRequestId }` and post back a `sorted` result.
+ *
+ * @param self - the worker global scope
+ */
+export declare const GaussianSplattingSortWorker: (self: Worker) => void;

package/Meshes/GaussianSplatting/gaussianSplattingSortWorker.js

@@ -0,0 +1,308 @@
+/** This file must only contain pure code and pure imports */
+/**
+ * Message commands exchanged with the Gaussian Splatting depth-sort worker. Every message carries a
+ * `command` field naming the intended work, instead of inferring it from which payload is present.
+ */
+export const GaussianSplattingSortWorkerCommand = {
+    /** Main -> worker: set the source splat centers (stride 4: xyz + 1). */
+    POSITIONS: "positions",
+    /** Main -> worker: patch a contiguous sub-range of the existing source splat centers in place. */
+    POSITIONS_UPDATE: "positionsUpdate",
+    /** Main -> worker: set the compound-mesh rig node matrices. */
+    PART_MATRICES: "partMatrices",
+    /** Main -> worker: set the compound-mesh per-splat rig node indices. */
+    PART_INDICES: "partIndices",
+    /** Main -> worker: set the active source-splat ranges (flat [start0, count0, ...]). */
+    INTERVALS: "intervals",
+    /** Main -> worker: sort the active splats for a camera view. */
+    SORT: "sort",
+    /** Worker -> main: a completed sort result. */
+    SORTED: "sorted",
+};
+/**
+ * Depth-sort web worker body for Gaussian Splatting meshes.
+ *
+ * The function is self-contained: it is serialized with `Function.prototype.toString()` and run
+ * inside a `Blob`-backed `Worker`, so it must not reference anything from its enclosing module
+ * (including {@link GaussianSplattingSortWorkerCommand} — the command literals are duplicated here).
+ *
+ * The intended work for each message is selected explicitly via its `command` field:
+ * - `positions`    set source splat centers (stride 4: xyz + 1).
+ * - `partMatrices` set compound-mesh rig node matrices.
+ * - `partIndices`  set compound-mesh per-splat rig node indices.
+ * - `intervals`    set active source-splat ranges (flat [start0, count0, ...]); persisted across sorts.
+ * - `sort`         sort the active splats for `{ worldMatrix, cameraForward, cameraPosition, depthMix,
+ *                  cameraId, sortRequestId }` and post back a `sorted` result.
+ *
+ * @param self - the worker global scope
+ */
+export const GaussianSplattingSortWorker = function (self) {
+    let positions;
+    let depthMix;
+    let partIndices;
+    let partMatrices;
+    // Active source-splat intervals as flat [start0, count0, start1, count1, ...]. Persisted between
+    // sort requests and refreshed by the main thread via the `intervals` message.
+    let intervals = null;
+    // Reusable counting-sort scratch buffers (grown on demand, never per-sort allocations).
+    let sortSourceIndices; // active source splat index for each compact slot
+    let sortDepths; // view-space depth for each compact slot
+    let sortKeys; // depth-derived integer bucket key for each compact slot
+    let sortCounts; // counting-sort histogram (one entry per bucket)
+    self.onmessage = (e) => {
+        // The intended work is selected explicitly via the message `command` field. These string
+        // literals must match GaussianSplattingSortWorkerCommand above (this body is serialized in
+        // isolation and cannot reference the shared constant).
+        const command = e.data.command;
+        if (command === "positions") {
+            positions = e.data.positions;
+        }
+        else if (command === "positionsUpdate") {
+            // Patch only the changed sub-range in place, avoiding a full re-copy/transfer of the entire
+            // (potentially hundreds-of-MB) position buffer on every streamed LOD decode.
+            if (positions && e.data.data) {
+                positions.set(e.data.data, e.data.offset);
+            }
+        }
+        else if (command === "partMatrices") {
+            partMatrices = e.data.partMatrices;
+        }
+        else if (command === "partIndices") {
+            partIndices = e.data.partIndices;
+        }
+        else if (command === "intervals") {
+            intervals = e.data.intervals;
+        }
+        else if (command === "sort") {
+            const cameraId = e.data.cameraId;
+            const sortRequestId = e.data.sortRequestId;
+            const rangeVersion = e.data.rangeVersion;
+            const globalWorldMatrix = e.data.worldMatrix;
+            const cameraForward = e.data.cameraForward;
+            const cameraPosition = e.data.cameraPosition;
+            depthMix = e.data.depthMix;
+            if (!positions || !cameraForward) {
+                // Sort request arrived before positions were initialized — return the buffer unchanged so the main thread can unlock _canPostToWorker.
+                self.postMessage({ command: "sorted", depthMix, cameraId, sortRequestId, rangeVersion }, [depthMix.buffer]);
+                return;
+            }
+            // Feature flags are forwarded by the main thread on each sort request (the worker body is
+            // serialized in isolation and cannot read shared statics directly). useCountingSort defaults to
+            // true; set it false to fall back to the legacy comparison sort.
+            const useCountingSort = e.data.useCountingSort !== false;
+            const logSortPerformance = !!e.data.logSortPerformance;
+            // Resolve the active interval set. The main thread always sends an `intervals` message,
+            // but fall back to "all source splats" if a sort somehow arrives before it.
+            const activeIntervals = intervals;
+            const totalSplats = positions.length / 4;
+            let renderSplatCount = totalSplats;
+            if (activeIntervals) {
+                renderSplatCount = 0;
+                for (let rangeIndex = 1; rangeIndex < activeIntervals.length; rangeIndex += 2) {
+                    renderSplatCount += activeIntervals[rangeIndex];
+                }
+            }
+            const vertexCountPadded = Math.max((renderSplatCount + 15) & ~0xf, 16);
+            // depth = dot(cameraForward, worldPos - cameraPos)
+            const camDot = cameraForward[0] * cameraPosition[0] + cameraForward[1] * cameraPosition[1] + cameraForward[2] * cameraPosition[2];
+            const computeDepthCoeffs = (m) => {
+                return [
+                    cameraForward[0] * m[0] + cameraForward[1] * m[1] + cameraForward[2] * m[2],
+                    cameraForward[0] * m[4] + cameraForward[1] * m[5] + cameraForward[2] * m[6],
+                    cameraForward[0] * m[8] + cameraForward[1] * m[9] + cameraForward[2] * m[10],
+                    cameraForward[0] * m[12] + cameraForward[1] * m[13] + cameraForward[2] * m[14] - camDot,
+                ];
+            };
+            // Optional, flag-gated sort timing (a simple wall-clock delta logged to the worker console).
+            const perf = globalThis.performance;
+            const sortStart = logSortPerformance && perf ? perf.now() : 0;
+            try {
+                if (useCountingSort) {
+                    // ===== Fast O(n) counting (radix) sort =====
+                    // Output view: the even 32-bit words of the depthMix buffer hold the sorted source indices
+                    // (the main thread reads indexMix[2*j]); the odd words are left unused.
+                    const outIndices = new Uint32Array(depthMix.buffer);
+                    // Grow the reusable scratch buffers when the active count increases (kept across sorts).
+                    if (!sortSourceIndices || sortSourceIndices.length < renderSplatCount) {
+                        const capacity = Math.max(renderSplatCount, 16);
+                        sortSourceIndices = new Uint32Array(capacity);
+                        sortDepths = new Float32Array(capacity);
+                        sortKeys = new Uint32Array(capacity);
+                    }
+                    // Compound (rig) meshes give each splat its own world transform via its part: depth uses the
+                    // splat's part coefficients. Single meshes use the one global world matrix. Both produce
+                    // depths in the same camera-forward space, so all active splats sort together correctly.
+                    const compound = !!(partMatrices && partIndices);
+                    let depthCoeffs = [];
+                    let partLen = 0;
+                    let a = 0;
+                    let b = 0;
+                    let c = 0;
+                    let d = 0;
+                    if (compound) {
+                        depthCoeffs = partMatrices.map((m) => computeDepthCoeffs(m));
+                        partLen = partIndices.length;
+                    }
+                    else {
+                        const coeff = computeDepthCoeffs(globalWorldMatrix);
+                        a = coeff[0];
+                        b = coeff[1];
+                        c = coeff[2];
+                        d = coeff[3];
+                    }
+                    // Pass 1: gather the active source indices, compute each splat's view-space depth (signed
+                    // distance from the camera along the forward axis), and track the depth range. The compound
+                    // branch is hoisted out of the inner loop so the hot path stays straight-line.
+                    let writeIndex = 0;
+                    let minDepth = Infinity;
+                    let maxDepth = -Infinity;
+                    const rangeWords = activeIntervals ? activeIntervals.length : 2;
+                    for (let r = 0; r < rangeWords; r += 2) {
+                        const start = activeIntervals ? activeIntervals[r] : 0;
+                        const end = start + (activeIntervals ? activeIntervals[r + 1] : totalSplats);
+                        if (compound) {
+                            for (let sourceIndex = start; sourceIndex < end; sourceIndex++) {
+                                const o = 4 * sourceIndex;
+                                const coeff = depthCoeffs[partIndices[sourceIndex < partLen ? sourceIndex : partLen - 1]];
+                                const depth = coeff[0] * positions[o] + coeff[1] * positions[o + 1] + coeff[2] * positions[o + 2] + coeff[3];
+                                sortSourceIndices[writeIndex] = sourceIndex;
+                                sortDepths[writeIndex] = depth;
+                                writeIndex++;
+                                if (depth < minDepth) {
+                                    minDepth = depth;
+                                }
+                                if (depth > maxDepth) {
+                                    maxDepth = depth;
+                                }
+                            }
+                        }
+                        else {
+                            for (let sourceIndex = start; sourceIndex < end; sourceIndex++) {
+                                const o = 4 * sourceIndex;
+                                const depth = a * positions[o] + b * positions[o + 1] + c * positions[o + 2] + d;
+                                sortSourceIndices[writeIndex] = sourceIndex;
+                                sortDepths[writeIndex] = depth;
+                                writeIndex++;
+                                if (depth < minDepth) {
+                                    minDepth = depth;
+                                }
+                                if (depth > maxDepth) {
+                                    maxDepth = depth;
+                                }
+                            }
+                        }
+                    }
+                    // Counting (radix) sort by a depth-derived integer key — O(n) vs the legacy comparison sort.
+                    // Bucket bit depth follows PlayCanvas: round(log2(n/4)) clamped to [10, 20]. The farthest splat
+                    // gets key 0 so the ascending counting sort yields back-to-front order for alpha blending.
+                    const compareBits = Math.max(10, Math.min(20, Math.round(Math.log2(Math.max(1, renderSplatCount) / 4))));
+                    const bucketCount = 2 ** compareBits + 1;
+                    if (!sortCounts || sortCounts.length !== bucketCount) {
+                        sortCounts = new Uint32Array(bucketCount);
+                    }
+                    else {
+                        sortCounts.fill(0);
+                    }
+                    const range = maxDepth - minDepth;
+                    if (!(range > 1e-12)) {
+                        // All active splats share a depth (or none are active): identity order, single bucket.
+                        for (let k = 0; k < renderSplatCount; k++) {
+                            sortKeys[k] = 0;
+                        }
+                        sortCounts[0] = renderSplatCount;
+                    }
+                    else {
+                        const scale = (bucketCount - 1) / range;
+                        const maxKey = bucketCount - 1;
+                        for (let k = 0; k < renderSplatCount; k++) {
+                            // maxDepth -> 0 (rendered first), minDepth -> bucketCount-1 (rendered last). Clamp
+                            // against float rounding (a tiny `range` makes `scale` huge), which could otherwise
+                            // produce key >= bucketCount and corrupt the histogram with out-of-bounds writes.
+                            let key = ((maxDepth - sortDepths[k]) * scale) >>> 0;
+                            if (key > maxKey) {
+                                key = maxKey;
+                            }
+                            sortKeys[k] = key;
+                            sortCounts[key]++;
+                        }
+                    }
+                    // Prefix-sum the histogram into bucket end offsets, then scatter source indices into place.
+                    for (let i = 1; i < bucketCount; i++) {
+                        sortCounts[i] += sortCounts[i - 1];
+                    }
+                    for (let k = 0; k < renderSplatCount; k++) {
+                        const dest = --sortCounts[sortKeys[k]];
+                        outIndices[2 * dest] = sortSourceIndices[k];
+                    }
+                    // Pad the remainder up to the 16-multiple with the reserved (invisible) splat index 0.
+                    for (let dest = renderSplatCount; dest < vertexCountPadded; dest++) {
+                        outIndices[2 * dest] = 0;
+                    }
+                }
+                else {
+                    // ===== Legacy comparison sort: pack (index, ~depthBits) into each 64-bit lane and sort it =====
+                    const indices = new Uint32Array(depthMix.buffer);
+                    const floatMix = new Float32Array(depthMix.buffer);
+                    // Build the compact list of source-splat indices to sort.
+                    if (activeIntervals) {
+                        let writeIndex = 0;
+                        for (let rangeIndex = 0; rangeIndex < activeIntervals.length; rangeIndex += 2) {
+                            const start = activeIntervals[rangeIndex];
+                            const count = activeIntervals[rangeIndex + 1];
+                            for (let sourceIndex = start; sourceIndex < start + count; sourceIndex++) {
+                                indices[2 * writeIndex++] = sourceIndex;
+                            }
+                        }
+                        // Pad up to a multiple of 16 with the reserved (invisible) splat index 0.
+                        for (; writeIndex < vertexCountPadded; writeIndex++) {
+                            indices[2 * writeIndex] = 0;
+                        }
+                    }
+                    else {
+                        for (let j = 0; j < vertexCountPadded; j++) {
+                            indices[2 * j] = j;
+                        }
+                    }
+                    if (partMatrices && partIndices) {
+                        // Precompute depth coefficients for each rig node.
+                        const depthCoeffs = partMatrices.map((m) => computeDepthCoeffs(m));
+                        // NB: For performance reasons, we assume that part indices are valid.
+                        const length = partIndices.length;
+                        for (let j = 0; j < vertexCountPadded; j++) {
+                            const sourceIndex = indices[2 * j];
+                            // NB: We need this 'min' because the vertex array is padded, not partIndices.
+                            const partIndex = partIndices[Math.min(sourceIndex, length - 1)];
+                            const coeff = depthCoeffs[partIndex];
+                            floatMix[2 * j + 1] =
+                                coeff[0] * positions[4 * sourceIndex + 0] + coeff[1] * positions[4 * sourceIndex + 1] + coeff[2] * positions[4 * sourceIndex + 2] + coeff[3];
+                            // Invert the depth bits (bitwise not) so the ascending sort renders back to front.
+                            indices[2 * j + 1] = ~indices[2 * j + 1];
+                        }
+                    }
+                    else {
+                        const [a, b, c, d] = computeDepthCoeffs(globalWorldMatrix);
+                        for (let j = 0; j < vertexCountPadded; j++) {
+                            const sourceIndex = indices[2 * j];
+                            floatMix[2 * j + 1] = a * positions[4 * sourceIndex + 0] + b * positions[4 * sourceIndex + 1] + c * positions[4 * sourceIndex + 2] + d;
+                            indices[2 * j + 1] = ~indices[2 * j + 1];
+                        }
+                    }
+                    depthMix.sort();
+                }
+            }
+            catch (sortError) {
+                // Transient data inconsistency (e.g. partIndices/partMatrices mismatch during addPart/removePart rebuild).
+                // Return the buffer unsorted so the main thread can unlock _canPostToWorker and retry next frame.
+                // Logger is unavailable inside the worker — console is the only option.
+                // eslint-disable-next-line no-console
+                console.error("Gaussian splat sort worker encountered an error (will retry next frame):", sortError);
+            }
+            if (logSortPerformance && perf) {
+                // eslint-disable-next-line no-console
+                console.log(`[GaussianSplatting] ${useCountingSort ? "counting" : "legacy"} sort: ${renderSplatCount} splats in ${(perf.now() - sortStart).toFixed(2)}ms`);
+            }
+            self.postMessage({ command: "sorted", depthMix, cameraId, sortRequestId, rangeVersion }, [depthMix.buffer]);
+        }
+    };
+};
+//# sourceMappingURL=gaussianSplattingSortWorker.js.map

package/Meshes/GaussianSplatting/gaussianSplattingSortWorker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gaussianSplattingSortWorker.js","sourceRoot":"","sources":["../../../../../dev/core/src/Meshes/GaussianSplatting/gaussianSplattingSortWorker.ts"],"names":[],"mappings":"AAAA,6DAA6D;AAI7D;;;GAGG;AACH,MAAM,CAAC,MAAM,kCAAkC,GAAG;IAC9C,wEAAwE;IACxE,SAAS,EAAE,WAAW;IACtB,kGAAkG;IAClG,gBAAgB,EAAE,iBAAiB;IACnC,+DAA+D;IAC/D,aAAa,EAAE,cAAc;IAC7B,wEAAwE;IACxE,YAAY,EAAE,aAAa;IAC3B,uFAAuF;IACvF,SAAS,EAAE,WAAW;IACtB,gEAAgE;IAChE,IAAI,EAAE,MAAM;IACZ,+CAA+C;IAC/C,MAAM,EAAE,QAAQ;CACV,CAAC;AAEX;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,UAAU,IAAY;IAC7D,IAAI,SAAuB,CAAC;IAC5B,IAAI,QAAuB,CAAC;IAC5B,IAAI,WAAuB,CAAC;IAC5B,IAAI,YAA4B,CAAC;IACjC,iGAAiG;IACjG,8EAA8E;IAC9E,IAAI,SAAS,GAA0B,IAAI,CAAC;IAC5C,wFAAwF;IACxF,IAAI,iBAA8B,CAAC,CAAC,kDAAkD;IACtF,IAAI,UAAwB,CAAC,CAAC,yCAAyC;IACvE,IAAI,QAAqB,CAAC,CAAC,yDAAyD;IACpF,IAAI,UAAuB,CAAC,CAAC,iDAAiD;IAE9E,IAAI,CAAC,SAAS,GAAG,CAAC,CAAM,EAAE,EAAE;QACxB,yFAAyF;QACzF,2FAA2F;QAC3F,uDAAuD;QACvD,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QAC/B,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;YAC1B,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;QACjC,CAAC;aAAM,IAAI,OAAO,KAAK,iBAAiB,EAAE,CAAC;YACvC,4FAA4F;YAC5F,6EAA6E;YAC7E,IAAI,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC3B,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC9C,CAAC;QACL,CAAC;aAAM,IAAI,OAAO,KAAK,cAAc,EAAE,CAAC;YACpC,YAAY,GAAG,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;QACvC,CAAC;aAAM,IAAI,OAAO,KAAK,aAAa,EAAE,CAAC;YACnC,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;QACrC,CAAC;aAAM,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;YACjC,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;QACjC,CAAC;aAAM,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;YACjC,MAAM,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;YAC3C,MAAM,YAAY,GAAG,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;YACzC,MAAM,iBAAiB,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;YAC7C,MAAM,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;YAC3C,MAAM,cAAc,GAAG,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;YAE7C,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;YAE3B,IAAI,CAAC,SAAS,IAAI,CAAC,aAAa,EAAE,CAAC;gBAC/B,uIAAuI;gBACvI,IAAI,CAAC,WAAW,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC5G,OAAO;YACX,CAAC;YAED,0FAA0F;YAC1F,gGAAgG;YAChG,iEAAiE;YACjE,MAAM,eAAe,GAAG,CAAC,CAAC,IAAI,CAAC,eAAe,KAAK,KAAK,CAAC;YACzD,MAAM,kBAAkB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC;YAEvD,wFAAwF;YACxF,4EAA4E;YAC5E,MAAM,eAAe,GAAG,SAAS,CAAC;YAClC,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;YACzC,IAAI,gBAAgB,GAAG,WAAW,CAAC;YACnC,IAAI,eAAe,EAAE,CAAC;gBAClB,gBAAgB,GAAG,CAAC,CAAC;gBACrB,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,eAAe,CAAC,MAAM,EAAE,UAAU,IAAI,CAAC,EAAE,CAAC;oBAC5E,gBAAgB,IAAI,eAAe,CAAC,UAAU,CAAC,CAAC;gBACpD,CAAC;YACL,CAAC;YACD,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,gBAAgB,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAEvE,mDAAmD;YACnD,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAElI,MAAM,kBAAkB,GAAG,CAAC,CAAe,EAAY,EAAE;gBACrD,OAAO;oBACH,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC3E,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC3E,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;oBAC5E,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM;iBAC1F,CAAC;YACN,CAAC,CAAC;YAEF,6FAA6F;YAC7F,MAAM,IAAI,GAAI,UAAkD,CAAC,WAAW,CAAC;YAC7E,MAAM,SAAS,GAAG,kBAAkB,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAE9D,IAAI,CAAC;gBACD,IAAI,eAAe,EAAE,CAAC;oBAClB,8CAA8C;oBAC9C,2FAA2F;oBAC3F,wEAAwE;oBACxE,MAAM,UAAU,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;oBAEpD,yFAAyF;oBACzF,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,gBAAgB,EAAE,CAAC;wBACpE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;wBAChD,iBAAiB,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;wBAC9C,UAAU,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;wBACxC,QAAQ,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;oBACzC,CAAC;oBAED,6FAA6F;oBAC7F,yFAAyF;oBACzF,yFAAyF;oBACzF,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,YAAY,IAAI,WAAW,CAAC,CAAC;oBACjD,IAAI,WAAW,GAAe,EAAE,CAAC;oBACjC,IAAI,OAAO,GAAG,CAAC,CAAC;oBAChB,IAAI,CAAC,GAAG,CAAC,CAAC;oBACV,IAAI,CAAC,GAAG,CAAC,CAAC;oBACV,IAAI,CAAC,GAAG,CAAC,CAAC;oBACV,IAAI,CAAC,GAAG,CAAC,CAAC;oBACV,IAAI,QAAQ,EAAE,CAAC;wBACX,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;wBAC7D,OAAO,GAAG,WAAW,CAAC,MAAM,CAAC;oBACjC,CAAC;yBAAM,CAAC;wBACJ,MAAM,KAAK,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,CAAC;wBACpD,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;wBACb,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;wBACb,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;wBACb,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACjB,CAAC;oBAED,0FAA0F;oBAC1F,4FAA4F;oBAC5F,+EAA+E;oBAC/E,IAAI,UAAU,GAAG,CAAC,CAAC;oBACnB,IAAI,QAAQ,GAAG,QAAQ,CAAC;oBACxB,IAAI,QAAQ,GAAG,CAAC,QAAQ,CAAC;oBACzB,MAAM,UAAU,GAAG,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;wBACrC,MAAM,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACvD,MAAM,GAAG,GAAG,KAAK,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;wBAC7E,IAAI,QAAQ,EAAE,CAAC;4BACX,KAAK,IAAI,WAAW,GAAG,KAAK,EAAE,WAAW,GAAG,GAAG,EAAE,WAAW,EAAE,EAAE,CAAC;gCAC7D,MAAM,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC;gCAC1B,MAAM,KAAK,GAAG,WAAW,CAAC,WAAW,CAAC,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;gCAC1F,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gCAC7G,iBAAiB,CAAC,UAAU,CAAC,GAAG,WAAW,CAAC;gCAC5C,UAAU,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC;gCAC/B,UAAU,EAAE,CAAC;gCACb,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oCACnB,QAAQ,GAAG,KAAK,CAAC;gCACrB,CAAC;gCACD,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oCACnB,QAAQ,GAAG,KAAK,CAAC;gCACrB,CAAC;4BACL,CAAC;wBACL,CAAC;6BAAM,CAAC;4BACJ,KAAK,IAAI,WAAW,GAAG,KAAK,EAAE,WAAW,GAAG,GAAG,EAAE,WAAW,EAAE,EAAE,CAAC;gCAC7D,MAAM,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC;gCAC1B,MAAM,KAAK,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gCACjF,iBAAiB,CAAC,UAAU,CAAC,GAAG,WAAW,CAAC;gCAC5C,UAAU,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC;gCAC/B,UAAU,EAAE,CAAC;gCACb,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oCACnB,QAAQ,GAAG,KAAK,CAAC;gCACrB,CAAC;gCACD,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oCACnB,QAAQ,GAAG,KAAK,CAAC;gCACrB,CAAC;4BACL,CAAC;wBACL,CAAC;oBACL,CAAC;oBAED,6FAA6F;oBAC7F,gGAAgG;oBAChG,2FAA2F;oBAC3F,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzG,MAAM,WAAW,GAAG,CAAC,IAAI,WAAW,GAAG,CAAC,CAAC;oBACzC,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;wBACnD,UAAU,GAAG,IAAI,WAAW,CAAC,WAAW,CAAC,CAAC;oBAC9C,CAAC;yBAAM,CAAC;wBACJ,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACvB,CAAC;oBAED,MAAM,KAAK,GAAG,QAAQ,GAAG,QAAQ,CAAC;oBAClC,IAAI,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC;wBACnB,uFAAuF;wBACvF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC;4BACxC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBACpB,CAAC;wBACD,UAAU,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC;oBACrC,CAAC;yBAAM,CAAC;wBACJ,MAAM,KAAK,GAAG,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;wBACxC,MAAM,MAAM,GAAG,WAAW,GAAG,CAAC,CAAC;wBAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC;4BACxC,mFAAmF;4BACnF,oFAAoF;4BACpF,kFAAkF;4BAClF,IAAI,GAAG,GAAG,CAAC,CAAC,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;4BACrD,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;gCACf,GAAG,GAAG,MAAM,CAAC;4BACjB,CAAC;4BACD,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;4BAClB,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;wBACtB,CAAC;oBACL,CAAC;oBAED,4FAA4F;oBAC5F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;wBACnC,UAAU,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACvC,CAAC;oBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC;wBACxC,MAAM,IAAI,GAAG,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;wBACvC,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;oBAChD,CAAC;oBAED,uFAAuF;oBACvF,KAAK,IAAI,IAAI,GAAG,gBAAgB,EAAE,IAAI,GAAG,iBAAiB,EAAE,IAAI,EAAE,EAAE,CAAC;wBACjE,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC7B,CAAC;gBACL,CAAC;qBAAM,CAAC;oBACJ,iGAAiG;oBACjG,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;oBACjD,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;oBAEnD,0DAA0D;oBAC1D,IAAI,eAAe,EAAE,CAAC;wBAClB,IAAI,UAAU,GAAG,CAAC,CAAC;wBACnB,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,eAAe,CAAC,MAAM,EAAE,UAAU,IAAI,CAAC,EAAE,CAAC;4BAC5E,MAAM,KAAK,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;4BAC1C,MAAM,KAAK,GAAG,eAAe,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;4BAC9C,KAAK,IAAI,WAAW,GAAG,KAAK,EAAE,WAAW,GAAG,KAAK,GAAG,KAAK,EAAE,WAAW,EAAE,EAAE,CAAC;gCACvE,OAAO,CAAC,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,WAAW,CAAC;4BAC5C,CAAC;wBACL,CAAC;wBACD,0EAA0E;wBAC1E,OAAO,UAAU,GAAG,iBAAiB,EAAE,UAAU,EAAE,EAAE,CAAC;4BAClD,OAAO,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;wBAChC,CAAC;oBACL,CAAC;yBAAM,CAAC;wBACJ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE,CAAC;4BACzC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;wBACvB,CAAC;oBACL,CAAC;oBAED,IAAI,YAAY,IAAI,WAAW,EAAE,CAAC;wBAC9B,mDAAmD;wBACnD,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;wBACnE,sEAAsE;wBACtE,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;wBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE,CAAC;4BACzC,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;4BACnC,8EAA8E;4BAC9E,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;4BACjE,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;4BACrC,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gCACf,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;4BACjJ,mFAAmF;4BACnF,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;wBAC7C,CAAC;oBACL,CAAC;yBAAM,CAAC;wBACJ,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,CAAC;wBAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE,CAAC;4BACzC,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;4BACnC,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;4BACvI,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;wBAC7C,CAAC;oBACL,CAAC;oBAED,QAAQ,CAAC,IAAI,EAAE,CAAC;gBACpB,CAAC;YACL,CAAC;YAAC,OAAO,SAAS,EAAE,CAAC;gBACjB,2GAA2G;gBAC3G,kGAAkG;gBAClG,wEAAwE;gBACxE,sCAAsC;gBACtC,OAAO,CAAC,KAAK,CAAC,0EAA0E,EAAE,SAAS,CAAC,CAAC;YACzG,CAAC;YAED,IAAI,kBAAkB,IAAI,IAAI,EAAE,CAAC;gBAC7B,sCAAsC;gBACtC,OAAO,CAAC,GAAG,CAAC,uBAAuB,eAAe,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,UAAU,gBAAgB,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/J,CAAC;YAED,IAAI,CAAC,WAAW,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QAChH,CAAC;IACL,CAAC,CAAC;AACN,CAAC,CAAC","sourcesContent":["/** This file must only contain pure code and pure imports */\r\n\r\nimport { type Nullable } from \"core/types\";\r\n\r\n/**\r\n * Message commands exchanged with the Gaussian Splatting depth-sort worker. Every message carries a\r\n * `command` field naming the intended work, instead of inferring it from which payload is present.\r\n */\r\nexport const GaussianSplattingSortWorkerCommand = {\r\n    /** Main -> worker: set the source splat centers (stride 4: xyz + 1). */\r\n    POSITIONS: \"positions\",\r\n    /** Main -> worker: patch a contiguous sub-range of the existing source splat centers in place. */\r\n    POSITIONS_UPDATE: \"positionsUpdate\",\r\n    /** Main -> worker: set the compound-mesh rig node matrices. */\r\n    PART_MATRICES: \"partMatrices\",\r\n    /** Main -> worker: set the compound-mesh per-splat rig node indices. */\r\n    PART_INDICES: \"partIndices\",\r\n    /** Main -> worker: set the active source-splat ranges (flat [start0, count0, ...]). */\r\n    INTERVALS: \"intervals\",\r\n    /** Main -> worker: sort the active splats for a camera view. */\r\n    SORT: \"sort\",\r\n    /** Worker -> main: a completed sort result. */\r\n    SORTED: \"sorted\",\r\n} as const;\r\n\r\n/**\r\n * Depth-sort web worker body for Gaussian Splatting meshes.\r\n *\r\n * The function is self-contained: it is serialized with `Function.prototype.toString()` and run\r\n * inside a `Blob`-backed `Worker`, so it must not reference anything from its enclosing module\r\n * (including {@link GaussianSplattingSortWorkerCommand} — the command literals are duplicated here).\r\n *\r\n * The intended work for each message is selected explicitly via its `command` field:\r\n * - `positions`    set source splat centers (stride 4: xyz + 1).\r\n * - `partMatrices` set compound-mesh rig node matrices.\r\n * - `partIndices`  set compound-mesh per-splat rig node indices.\r\n * - `intervals`    set active source-splat ranges (flat [start0, count0, ...]); persisted across sorts.\r\n * - `sort`         sort the active splats for `{ worldMatrix, cameraForward, cameraPosition, depthMix,\r\n *                  cameraId, sortRequestId }` and post back a `sorted` result.\r\n *\r\n * @param self - the worker global scope\r\n */\r\nexport const GaussianSplattingSortWorker = function (self: Worker) {\r\n    let positions: Float32Array;\r\n    let depthMix: BigInt64Array;\r\n    let partIndices: Uint8Array;\r\n    let partMatrices: Float32Array[];\r\n    // Active source-splat intervals as flat [start0, count0, start1, count1, ...]. Persisted between\r\n    // sort requests and refreshed by the main thread via the `intervals` message.\r\n    let intervals: Nullable<Uint32Array> = null;\r\n    // Reusable counting-sort scratch buffers (grown on demand, never per-sort allocations).\r\n    let sortSourceIndices: Uint32Array; // active source splat index for each compact slot\r\n    let sortDepths: Float32Array; // view-space depth for each compact slot\r\n    let sortKeys: Uint32Array; // depth-derived integer bucket key for each compact slot\r\n    let sortCounts: Uint32Array; // counting-sort histogram (one entry per bucket)\r\n\r\n    self.onmessage = (e: any) => {\r\n        // The intended work is selected explicitly via the message `command` field. These string\r\n        // literals must match GaussianSplattingSortWorkerCommand above (this body is serialized in\r\n        // isolation and cannot reference the shared constant).\r\n        const command = e.data.command;\r\n        if (command === \"positions\") {\r\n            positions = e.data.positions;\r\n        } else if (command === \"positionsUpdate\") {\r\n            // Patch only the changed sub-range in place, avoiding a full re-copy/transfer of the entire\r\n            // (potentially hundreds-of-MB) position buffer on every streamed LOD decode.\r\n            if (positions && e.data.data) {\r\n                positions.set(e.data.data, e.data.offset);\r\n            }\r\n        } else if (command === \"partMatrices\") {\r\n            partMatrices = e.data.partMatrices;\r\n        } else if (command === \"partIndices\") {\r\n            partIndices = e.data.partIndices;\r\n        } else if (command === \"intervals\") {\r\n            intervals = e.data.intervals;\r\n        } else if (command === \"sort\") {\r\n            const cameraId = e.data.cameraId;\r\n            const sortRequestId = e.data.sortRequestId;\r\n            const rangeVersion = e.data.rangeVersion;\r\n            const globalWorldMatrix = e.data.worldMatrix;\r\n            const cameraForward = e.data.cameraForward;\r\n            const cameraPosition = e.data.cameraPosition;\r\n\r\n            depthMix = e.data.depthMix;\r\n\r\n            if (!positions || !cameraForward) {\r\n                // Sort request arrived before positions were initialized — return the buffer unchanged so the main thread can unlock _canPostToWorker.\r\n                self.postMessage({ command: \"sorted\", depthMix, cameraId, sortRequestId, rangeVersion }, [depthMix.buffer]);\r\n                return;\r\n            }\r\n\r\n            // Feature flags are forwarded by the main thread on each sort request (the worker body is\r\n            // serialized in isolation and cannot read shared statics directly). useCountingSort defaults to\r\n            // true; set it false to fall back to the legacy comparison sort.\r\n            const useCountingSort = e.data.useCountingSort !== false;\r\n            const logSortPerformance = !!e.data.logSortPerformance;\r\n\r\n            // Resolve the active interval set. The main thread always sends an `intervals` message,\r\n            // but fall back to \"all source splats\" if a sort somehow arrives before it.\r\n            const activeIntervals = intervals;\r\n            const totalSplats = positions.length / 4;\r\n            let renderSplatCount = totalSplats;\r\n            if (activeIntervals) {\r\n                renderSplatCount = 0;\r\n                for (let rangeIndex = 1; rangeIndex < activeIntervals.length; rangeIndex += 2) {\r\n                    renderSplatCount += activeIntervals[rangeIndex];\r\n                }\r\n            }\r\n            const vertexCountPadded = Math.max((renderSplatCount + 15) & ~0xf, 16);\r\n\r\n            // depth = dot(cameraForward, worldPos - cameraPos)\r\n            const camDot = cameraForward[0] * cameraPosition[0] + cameraForward[1] * cameraPosition[1] + cameraForward[2] * cameraPosition[2];\r\n\r\n            const computeDepthCoeffs = (m: Float32Array): number[] => {\r\n                return [\r\n                    cameraForward[0] * m[0] + cameraForward[1] * m[1] + cameraForward[2] * m[2],\r\n                    cameraForward[0] * m[4] + cameraForward[1] * m[5] + cameraForward[2] * m[6],\r\n                    cameraForward[0] * m[8] + cameraForward[1] * m[9] + cameraForward[2] * m[10],\r\n                    cameraForward[0] * m[12] + cameraForward[1] * m[13] + cameraForward[2] * m[14] - camDot,\r\n                ];\r\n            };\r\n\r\n            // Optional, flag-gated sort timing (a simple wall-clock delta logged to the worker console).\r\n            const perf = (globalThis as { performance?: { now(): number } }).performance;\r\n            const sortStart = logSortPerformance && perf ? perf.now() : 0;\r\n\r\n            try {\r\n                if (useCountingSort) {\r\n                    // ===== Fast O(n) counting (radix) sort =====\r\n                    // Output view: the even 32-bit words of the depthMix buffer hold the sorted source indices\r\n                    // (the main thread reads indexMix[2*j]); the odd words are left unused.\r\n                    const outIndices = new Uint32Array(depthMix.buffer);\r\n\r\n                    // Grow the reusable scratch buffers when the active count increases (kept across sorts).\r\n                    if (!sortSourceIndices || sortSourceIndices.length < renderSplatCount) {\r\n                        const capacity = Math.max(renderSplatCount, 16);\r\n                        sortSourceIndices = new Uint32Array(capacity);\r\n                        sortDepths = new Float32Array(capacity);\r\n                        sortKeys = new Uint32Array(capacity);\r\n                    }\r\n\r\n                    // Compound (rig) meshes give each splat its own world transform via its part: depth uses the\r\n                    // splat's part coefficients. Single meshes use the one global world matrix. Both produce\r\n                    // depths in the same camera-forward space, so all active splats sort together correctly.\r\n                    const compound = !!(partMatrices && partIndices);\r\n                    let depthCoeffs: number[][] = [];\r\n                    let partLen = 0;\r\n                    let a = 0;\r\n                    let b = 0;\r\n                    let c = 0;\r\n                    let d = 0;\r\n                    if (compound) {\r\n                        depthCoeffs = partMatrices.map((m) => computeDepthCoeffs(m));\r\n                        partLen = partIndices.length;\r\n                    } else {\r\n                        const coeff = computeDepthCoeffs(globalWorldMatrix);\r\n                        a = coeff[0];\r\n                        b = coeff[1];\r\n                        c = coeff[2];\r\n                        d = coeff[3];\r\n                    }\r\n\r\n                    // Pass 1: gather the active source indices, compute each splat's view-space depth (signed\r\n                    // distance from the camera along the forward axis), and track the depth range. The compound\r\n                    // branch is hoisted out of the inner loop so the hot path stays straight-line.\r\n                    let writeIndex = 0;\r\n                    let minDepth = Infinity;\r\n                    let maxDepth = -Infinity;\r\n                    const rangeWords = activeIntervals ? activeIntervals.length : 2;\r\n                    for (let r = 0; r < rangeWords; r += 2) {\r\n                        const start = activeIntervals ? activeIntervals[r] : 0;\r\n                        const end = start + (activeIntervals ? activeIntervals[r + 1] : totalSplats);\r\n                        if (compound) {\r\n                            for (let sourceIndex = start; sourceIndex < end; sourceIndex++) {\r\n                                const o = 4 * sourceIndex;\r\n                                const coeff = depthCoeffs[partIndices[sourceIndex < partLen ? sourceIndex : partLen - 1]];\r\n                                const depth = coeff[0] * positions[o] + coeff[1] * positions[o + 1] + coeff[2] * positions[o + 2] + coeff[3];\r\n                                sortSourceIndices[writeIndex] = sourceIndex;\r\n                                sortDepths[writeIndex] = depth;\r\n                                writeIndex++;\r\n                                if (depth < minDepth) {\r\n                                    minDepth = depth;\r\n                                }\r\n                                if (depth > maxDepth) {\r\n                                    maxDepth = depth;\r\n                                }\r\n                            }\r\n                        } else {\r\n                            for (let sourceIndex = start; sourceIndex < end; sourceIndex++) {\r\n                                const o = 4 * sourceIndex;\r\n                                const depth = a * positions[o] + b * positions[o + 1] + c * positions[o + 2] + d;\r\n                                sortSourceIndices[writeIndex] = sourceIndex;\r\n                                sortDepths[writeIndex] = depth;\r\n                                writeIndex++;\r\n                                if (depth < minDepth) {\r\n                                    minDepth = depth;\r\n                                }\r\n                                if (depth > maxDepth) {\r\n                                    maxDepth = depth;\r\n                                }\r\n                            }\r\n                        }\r\n                    }\r\n\r\n                    // Counting (radix) sort by a depth-derived integer key — O(n) vs the legacy comparison sort.\r\n                    // Bucket bit depth follows PlayCanvas: round(log2(n/4)) clamped to [10, 20]. The farthest splat\r\n                    // gets key 0 so the ascending counting sort yields back-to-front order for alpha blending.\r\n                    const compareBits = Math.max(10, Math.min(20, Math.round(Math.log2(Math.max(1, renderSplatCount) / 4))));\r\n                    const bucketCount = 2 ** compareBits + 1;\r\n                    if (!sortCounts || sortCounts.length !== bucketCount) {\r\n                        sortCounts = new Uint32Array(bucketCount);\r\n                    } else {\r\n                        sortCounts.fill(0);\r\n                    }\r\n\r\n                    const range = maxDepth - minDepth;\r\n                    if (!(range > 1e-12)) {\r\n                        // All active splats share a depth (or none are active): identity order, single bucket.\r\n                        for (let k = 0; k < renderSplatCount; k++) {\r\n                            sortKeys[k] = 0;\r\n                        }\r\n                        sortCounts[0] = renderSplatCount;\r\n                    } else {\r\n                        const scale = (bucketCount - 1) / range;\r\n                        const maxKey = bucketCount - 1;\r\n                        for (let k = 0; k < renderSplatCount; k++) {\r\n                            // maxDepth -> 0 (rendered first), minDepth -> bucketCount-1 (rendered last). Clamp\r\n                            // against float rounding (a tiny `range` makes `scale` huge), which could otherwise\r\n                            // produce key >= bucketCount and corrupt the histogram with out-of-bounds writes.\r\n                            let key = ((maxDepth - sortDepths[k]) * scale) >>> 0;\r\n                            if (key > maxKey) {\r\n                                key = maxKey;\r\n                            }\r\n                            sortKeys[k] = key;\r\n                            sortCounts[key]++;\r\n                        }\r\n                    }\r\n\r\n                    // Prefix-sum the histogram into bucket end offsets, then scatter source indices into place.\r\n                    for (let i = 1; i < bucketCount; i++) {\r\n                        sortCounts[i] += sortCounts[i - 1];\r\n                    }\r\n                    for (let k = 0; k < renderSplatCount; k++) {\r\n                        const dest = --sortCounts[sortKeys[k]];\r\n                        outIndices[2 * dest] = sortSourceIndices[k];\r\n                    }\r\n\r\n                    // Pad the remainder up to the 16-multiple with the reserved (invisible) splat index 0.\r\n                    for (let dest = renderSplatCount; dest < vertexCountPadded; dest++) {\r\n                        outIndices[2 * dest] = 0;\r\n                    }\r\n                } else {\r\n                    // ===== Legacy comparison sort: pack (index, ~depthBits) into each 64-bit lane and sort it =====\r\n                    const indices = new Uint32Array(depthMix.buffer);\r\n                    const floatMix = new Float32Array(depthMix.buffer);\r\n\r\n                    // Build the compact list of source-splat indices to sort.\r\n                    if (activeIntervals) {\r\n                        let writeIndex = 0;\r\n                        for (let rangeIndex = 0; rangeIndex < activeIntervals.length; rangeIndex += 2) {\r\n                            const start = activeIntervals[rangeIndex];\r\n                            const count = activeIntervals[rangeIndex + 1];\r\n                            for (let sourceIndex = start; sourceIndex < start + count; sourceIndex++) {\r\n                                indices[2 * writeIndex++] = sourceIndex;\r\n                            }\r\n                        }\r\n                        // Pad up to a multiple of 16 with the reserved (invisible) splat index 0.\r\n                        for (; writeIndex < vertexCountPadded; writeIndex++) {\r\n                            indices[2 * writeIndex] = 0;\r\n                        }\r\n                    } else {\r\n                        for (let j = 0; j < vertexCountPadded; j++) {\r\n                            indices[2 * j] = j;\r\n                        }\r\n                    }\r\n\r\n                    if (partMatrices && partIndices) {\r\n                        // Precompute depth coefficients for each rig node.\r\n                        const depthCoeffs = partMatrices.map((m) => computeDepthCoeffs(m));\r\n                        // NB: For performance reasons, we assume that part indices are valid.\r\n                        const length = partIndices.length;\r\n                        for (let j = 0; j < vertexCountPadded; j++) {\r\n                            const sourceIndex = indices[2 * j];\r\n                            // NB: We need this 'min' because the vertex array is padded, not partIndices.\r\n                            const partIndex = partIndices[Math.min(sourceIndex, length - 1)];\r\n                            const coeff = depthCoeffs[partIndex];\r\n                            floatMix[2 * j + 1] =\r\n                                coeff[0] * positions[4 * sourceIndex + 0] + coeff[1] * positions[4 * sourceIndex + 1] + coeff[2] * positions[4 * sourceIndex + 2] + coeff[3];\r\n                            // Invert the depth bits (bitwise not) so the ascending sort renders back to front.\r\n                            indices[2 * j + 1] = ~indices[2 * j + 1];\r\n                        }\r\n                    } else {\r\n                        const [a, b, c, d] = computeDepthCoeffs(globalWorldMatrix);\r\n                        for (let j = 0; j < vertexCountPadded; j++) {\r\n                            const sourceIndex = indices[2 * j];\r\n                            floatMix[2 * j + 1] = a * positions[4 * sourceIndex + 0] + b * positions[4 * sourceIndex + 1] + c * positions[4 * sourceIndex + 2] + d;\r\n                            indices[2 * j + 1] = ~indices[2 * j + 1];\r\n                        }\r\n                    }\r\n\r\n                    depthMix.sort();\r\n                }\r\n            } catch (sortError) {\r\n                // Transient data inconsistency (e.g. partIndices/partMatrices mismatch during addPart/removePart rebuild).\r\n                // Return the buffer unsorted so the main thread can unlock _canPostToWorker and retry next frame.\r\n                // Logger is unavailable inside the worker — console is the only option.\r\n                // eslint-disable-next-line no-console\r\n                console.error(\"Gaussian splat sort worker encountered an error (will retry next frame):\", sortError);\r\n            }\r\n\r\n            if (logSortPerformance && perf) {\r\n                // eslint-disable-next-line no-console\r\n                console.log(`[GaussianSplatting] ${useCountingSort ? \"counting\" : \"legacy\"} sort: ${renderSplatCount} splats in ${(perf.now() - sortStart).toFixed(2)}ms`);\r\n            }\r\n\r\n            self.postMessage({ command: \"sorted\", depthMix, cameraId, sortRequestId, rangeVersion }, [depthMix.buffer]);\r\n        }\r\n    };\r\n};\r\n"]}

package/Meshes/geometry.js

@@ -7,6 +7,7 @@ import { SceneLoaderFlags } from "../Loading/sceneLoaderFlags.js";
 import { BoundingInfo } from "../Culling/boundingInfo.js";
 
 import { Tools } from "../Misc/tools.pure.js";
+import { Logger } from "../Misc/logger.js";
 import { Tags } from "../Misc/tags.js";
 import { extractMinAndMax } from "../Maths/math.functions.js";
 import { EngineStore } from "../Engines/engineStore.js";
@@ -682,23 +683,37 @@ export class Geometry {
             return;
         }
         scene.addPendingData(this);
-        scene._loadFile(this.delayLoadingFile, (data) => {
-            if (!this._delayLoadingFunction) {
-                return;
-            }
-            this._delayLoadingFunction(JSON.parse(data), this);
-            this.delayLoadState = 1;
-            this._delayInfo = [];
-            scene.removePendingData(this);
-            const meshes = this._meshes;
-            const numOfMeshes = meshes.length;
-            for (let index = 0; index < numOfMeshes; index++) {
-                this._applyToMesh(meshes[index]);
+        void (async () => {
+            try {
+                const data = await scene._loadDelayedFileAsync(this.delayLoadingFile, false, true);
+                if (!this._delayLoadingFunction) {
+                    // The geometry was disposed while the load was in flight; still release the pending data so the scene can become ready.
+                    scene.removePendingData(this);
+                    return;
+                }
+                this._delayLoadingFunction(JSON.parse(data), this);
+                this.delayLoadState = 1;
+                this._delayInfo = [];
+                scene.removePendingData(this);
+                const meshes = this._meshes;
+                const numOfMeshes = meshes.length;
+                for (let index = 0; index < numOfMeshes; index++) {
+                    this._applyToMesh(meshes[index]);
+                }
+                if (onLoaded) {
+                    onLoaded();
+                }
             }
-            if (onLoaded) {
-                onLoaded();
+            catch (error) {
+                // Remove the pending data so the scene can still become ready.
+                // The state is intentionally left as LOADING so a persistently failing file is not re-fetched every frame.
+                scene.removePendingData(this);
+                // Don't log when the scene is being disposed: in-flight requests are aborted as part of normal teardown.
+                if (!scene.isDisposed) {
+                    Logger.Error(`Unable to delay load geometry "${this.id}" from "${this.delayLoadingFile}": ${error}`);
+                }
             }
-        }, undefined, true);
+        })();
     }
     /**
      * Invert the geometry to move from a right handed system to a left handed one.