@meimu/mutracer 0.1.5 → 0.3.0

package/lib/renderer/aov.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aov.js","sourceRoot":"","sources":["../../src/renderer/aov.ts"],"names":[],"mappings":"AAEA,MAAM,CAAC,MAAM,SAAS,GAAuB,CAAC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,gBAAgB,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;AACnI,MAAM,CAAC,MAAM,iBAAiB,GAAG,UAAU,CAAC;AAC5C,kFAAkF;AAClF,4DAA4D;AAC5D,MAAM,CAAC,MAAM,UAAU,GAAG,EAAC,gBAAgB,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE;IAC9D,cAAc,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,cAAc,EAAE,EAAE;IACpE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAU,CAAC;AAC7B,IAAI,MAAM,GAAG,CAAC,CAAC;AACf,MAAM,UAAU,aAAa;IAC3B,IAAI,MAAM,IAAI,iBAAiB;QAAE,MAAM,IAAI,UAAU,CAAC,wBAAwB,CAAC,CAAC;IAChF,OAAO,MAAM,EAAE,CAAC;AAClB,CAAC;AACD,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,iBAAiB;QAAE,MAAM,IAAI,UAAU,CAAC,4CAA4C,CAAC,CAAC;IAC5I,OAAO,KAAK,CAAC;AACf,CAAC;AACD,MAAM,UAAU,OAAO,CAAC,KAAyB;IAC/C,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,KAAK,GAAG,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC;QAC5D,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;IACrB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAUD,yFAAyF;AACzF,MAAM,OAAO,UAAU;IACb,KAAK,CAAoB;IACzB,SAAS,GAAC,IAAI,GAAG,EAA8B,CAAC;IACxD,KAAK,KAAK,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC3D,QAAQ,CAAC,IAAsB;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,UAAU,KAAK,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/H,CAAC;IACD,KAAK,CAAC,IAAsB,EAAE,QAA6B;QACzD,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC5G,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ,IAAI,GAAG,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;IAC3G,CAAC;IACD,MAAM,CAAC,KAAuB;QAC5B,IAAI,CAAC,KAAK,GAAG,EAAC,GAAG,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,aAAa,EAAE,KAAK,CAAC,aAAa,EAAE,KAAK,EAAE,EAAE,cAAc,EAAE,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE;YACpJ,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAC,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,EAAC,CAAC,CAAC,EAAC,CAAC;QACjF,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,QAAQ,EAAE,EAAC,QAAQ,CAAC,CAAC;IACtH,CAAC;CACF","sourcesContent":["/** Optional primary-surface outputs, separate from beauty and OIDN guides. */\nexport type AovKind = 'depth' | 'position' | 'roughness' | 'diffuseAlbedo' | 'specularAlbedo' | 'id' | 'motion';\nexport const AOV_KINDS: readonly AovKind[] = ['depth', 'position', 'roughness', 'diffuseAlbedo', 'specularAlbedo', 'id', 'motion'];\nexport const AOV_BACKGROUND_ID = 0xffffffff;\n// Four vec4 lanes for accumulated geometry/reflectance; two for center ID/motion.\n// Depth and roughness share a lane; coverage is position.w.\nexport const AOV_LAYOUT = {accumulatedBytes: 64, centerBytes: 32,\n  depthRoughness: 0, position: 4, diffuseAlbedo: 8, specularAlbedo: 12,\n  id: 0, motion: 4} as const;\nlet nextId = 0;\nexport function allocateAovId(): number {\n  if (nextId >= AOV_BACKGROUND_ID) throw new RangeError('AOV ID space exhausted');\n  return nextId++;\n}\nexport function validateAovId(value: number): number {\n  if (!Number.isInteger(value) || value < 0 || value >= AOV_BACKGROUND_ID) throw new RangeError('AOV ID must be uint32 excluding 0xFFFFFFFF');\n  return value;\n}\nexport function aovMask(kinds: readonly AovKind[]): number {\n  let mask = 0;\n  for (const kind of kinds) {\n    const index = AOV_KINDS.indexOf(kind);\n    if (index < 0) throw new RangeError(`Unknown AOV: ${kind}`);\n    mask |= 1 << index;\n  }\n  return mask;\n}\nexport interface AovInstanceSnapshot {\n  object: number; instance: number; topology: number; vertices: number;\n  transform: Float32Array;\n}\nexport interface AovFrameSnapshot {\n  width: number; height: number; projection: string;\n  cameraEye?: Float32Array; cameraForward?: Float32Array;\n  viewProjection: Float32Array; instances: readonly AovInstanceSnapshot[];\n}\n/** Per-render history; camera pose and rigid transforms may change without resetting. */\nexport class AovHistory {\n  private frame?: AovFrameSnapshot;\n  private instances=new Map<string,AovInstanceSnapshot>();\n  clear() { this.frame = undefined; this.instances.clear(); }\n  previous(next: AovFrameSnapshot): AovFrameSnapshot | undefined {\n    const old = this.frame;\n    return old && old.width === next.width && old.height === next.height && old.projection === next.projection ? old : undefined;\n  }\n  match(next: AovFrameSnapshot, instance: AovInstanceSnapshot): AovInstanceSnapshot | undefined {\n    const old = this.previous(next) ? this.instances.get(`${instance.object}:${instance.instance}`) : undefined;\n    return old && old.topology === instance.topology && old.vertices === instance.vertices ? old : undefined;\n  }\n  accept(frame: AovFrameSnapshot) {\n    this.frame = {...frame, cameraEye: frame.cameraEye?.slice(), cameraForward: frame.cameraForward?.slice(), viewProjection: frame.viewProjection.slice(),\n      instances: frame.instances.map(i => ({...i, transform: i.transform.slice()}))};\n    this.instances.clear();\n    for (const instance of this.frame.instances) this.instances.set(`${instance.object}:${instance.instance}`,instance);\n  }\n}\n"]}

package/lib/renderer/aovDisplay.d.ts

@@ -0,0 +1,14 @@
+import { type AovKind } from './aov.js';
+/** ID lane to visualize. Default object. */
+export type AovIdComponent = 'object' | 'instance' | 'material' | 'primitive';
+export interface AovDisplayOptions {
+    depthRange: readonly [number, number];
+    positionScale: number;
+    motionScale: number;
+    idComponent: AovIdComponent;
+}
+export declare const DEFAULT_AOV_DISPLAY: AovDisplayOptions;
+export declare const AOV_ID_COMPONENTS: readonly AovIdComponent[];
+export declare function displayAovKind(channel: string): AovKind | undefined;
+export declare function validateAovDisplay(options: AovDisplayOptions): void;
+export declare function packAovDisplay(width: number, height: number, samples: number, kind: AovKind, options: AovDisplayOptions, linear: boolean): Uint32Array<ArrayBuffer>;

package/lib/renderer/aovDisplay.js

@@ -0,0 +1,32 @@
+import { AOV_KINDS } from './aov.js';
+export const DEFAULT_AOV_DISPLAY = {
+    depthRange: [0, 10], positionScale: 1, motionScale: 16, idComponent: 'object'
+};
+export const AOV_ID_COMPONENTS = ['object', 'instance', 'material', 'primitive'];
+export function displayAovKind(channel) {
+    return AOV_KINDS.find(kind => kind === channel);
+}
+export function validateAovDisplay(options) {
+    const range = options.depthRange;
+    if (!Array.isArray(range) || range.length !== 2 || !range.every(Number.isFinite) || range[0] < 0 || range[1] <= range[0])
+        throw new RangeError('aovDepthRange requires 0 <= near < far');
+    if (!range.map(Math.fround).every(Number.isFinite) || Math.fround(range[1]) <= Math.fround(range[0]))
+        throw new RangeError('aovDepthRange must remain finite and increasing in float32');
+    for (const scale of [options.positionScale, options.motionScale]) {
+        if (!Number.isFinite(scale) || !Number.isFinite(Math.fround(scale)) || Math.fround(scale) <= 0) {
+            throw new RangeError('AOV display scales must be finite and positive in float32');
+        }
+    }
+    if (!AOV_ID_COMPONENTS.includes(options.idComponent))
+        throw new RangeError('Unknown AOV ID component');
+}
+export function packAovDisplay(width, height, samples, kind, options, linear) {
+    validateAovDisplay(options);
+    const words = new Uint32Array(12), floats = new Float32Array(words.buffer);
+    words.set([width, height, samples, AOV_KINDS.indexOf(kind)]);
+    floats.set([...options.depthRange, options.positionScale, options.motionScale], 4);
+    words[8] = AOV_ID_COMPONENTS.indexOf(options.idComponent);
+    words[9] = +linear;
+    return words;
+}
+//# sourceMappingURL=aovDisplay.js.map

package/lib/renderer/aovDisplay.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aovDisplay.js","sourceRoot":"","sources":["../../src/renderer/aovDisplay.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAgB,MAAM,UAAU,CAAC;AASnD,MAAM,CAAC,MAAM,mBAAmB,GAAsB;IACpD,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,WAAW,EAAE,QAAQ;CAC9E,CAAC;AACF,MAAM,CAAC,MAAM,iBAAiB,GAA8B,CAAC,QAAQ,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;AAC5G,MAAM,UAAU,cAAc,CAAC,OAAe;IAC5C,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;AAClD,CAAC;AACD,MAAM,UAAU,kBAAkB,CAAC,OAA0B;IAC3D,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC;IACjC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;QACtH,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,CAAC;IACjE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAClG,MAAM,IAAI,UAAU,CAAC,4DAA4D,CAAC,CAAC;IACrF,KAAK,MAAM,KAAK,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QACjE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/F,MAAM,IAAI,UAAU,CAAC,2DAA2D,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IACD,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,CAAC;QAClD,MAAM,IAAI,UAAU,CAAC,0BAA0B,CAAC,CAAC;AACrD,CAAC;AACD,MAAM,UAAU,cAAc,CAAC,KAAa,EAAE,MAAc,EAAE,OAAe,EAAE,IAAa,EAAE,OAA0B,EAAE,MAAe;IACvI,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC3E,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;IACnF,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IAC1D,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;IACnB,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["import { AOV_KINDS, type AovKind } from './aov.js';\n/** ID lane to visualize. Default object. */\nexport type AovIdComponent = 'object' | 'instance' | 'material' | 'primitive';\nexport interface AovDisplayOptions {\n  depthRange: readonly [number, number];\n  positionScale: number;\n  motionScale: number;\n  idComponent: AovIdComponent;\n}\nexport const DEFAULT_AOV_DISPLAY: AovDisplayOptions = {\n  depthRange: [0, 10], positionScale: 1, motionScale: 16, idComponent: 'object'\n};\nexport const AOV_ID_COMPONENTS: readonly AovIdComponent[] = ['object', 'instance', 'material', 'primitive'];\nexport function displayAovKind(channel: string): AovKind | undefined {\n  return AOV_KINDS.find(kind => kind === channel);\n}\nexport function validateAovDisplay(options: AovDisplayOptions) {\n  const range = options.depthRange;\n  if (!Array.isArray(range) || range.length !== 2 || !range.every(Number.isFinite) || range[0] < 0 || range[1] <= range[0])\n    throw new RangeError('aovDepthRange requires 0 <= near < far');\n  if (!range.map(Math.fround).every(Number.isFinite) || Math.fround(range[1]) <= Math.fround(range[0]))\n    throw new RangeError('aovDepthRange must remain finite and increasing in float32');\n  for (const scale of [options.positionScale, options.motionScale]) {\n    if (!Number.isFinite(scale) || !Number.isFinite(Math.fround(scale)) || Math.fround(scale) <= 0) {\n      throw new RangeError('AOV display scales must be finite and positive in float32');\n    }\n  }\n  if (!AOV_ID_COMPONENTS.includes(options.idComponent))\n    throw new RangeError('Unknown AOV ID component');\n}\nexport function packAovDisplay(width: number, height: number, samples: number, kind: AovKind, options: AovDisplayOptions, linear: boolean) {\n  validateAovDisplay(options);\n  const words = new Uint32Array(12), floats = new Float32Array(words.buffer);\n  words.set([width, height, samples, AOV_KINDS.indexOf(kind)]);\n  floats.set([...options.depthRange, options.positionScale, options.motionScale], 4);\n  words[8] = AOV_ID_COMPONENTS.indexOf(options.idComponent);\n  words[9] = +linear;\n  return words;\n}\n"]}

package/lib/renderer/aovScene.d.ts

@@ -0,0 +1,21 @@
+import type Camera from '../scene/Camera.js';
+import type MeshState from '../scene/MeshState.js';
+import type MaterialState from '../scene/MaterialState.js';
+import type Geometry from '../scene/Geometry.js';
+import { AovHistory, type AovFrameSnapshot } from './aov.js';
+import { type MeshInstances } from './packedMeshInstances.js';
+import type { FlattendBVH, BLASInstance } from './bvhAccel.js';
+import type { PreparedMeshInstanceBinding } from './scenePreparation.js';
+export interface AovSceneSource {
+    instances: MeshInstances;
+    instanceBindings: PreparedMeshInstanceBinding<MeshState>[];
+    materials: MaterialState[];
+    geometries: Geometry[];
+    blases: BLASInstance[];
+}
+/** Source instance index for each GPU instance, including TLAS leaf reordering. */
+export declare function aovInstanceOrder(tlas: FlattendBVH): Uint32Array;
+export declare function packAovScene(source: AovSceneSource, tlas: FlattendBVH, camera: Camera, width: number, height: number, history: AovHistory, primitiveIds?: Uint32Array, includePrimitives?: boolean): {
+    words: Uint32Array;
+    frame: AovFrameSnapshot;
+};

package/lib/renderer/aovScene.js

@@ -0,0 +1,139 @@
+import { mat4 } from '../math.js';
+import { validateAovId } from './aov.js';
+import { PackedMeshInstances, readMeshInstance } from './packedMeshInstances.js';
+const geometryIds = new WeakMap();
+let nextGeometry = 1;
+function geometryId(geometry) {
+    let id = geometryIds.get(geometry);
+    if (id === undefined) {
+        id = nextGeometry++;
+        geometryIds.set(geometry, id);
+    }
+    return id;
+}
+/** Source instance index for each GPU instance, including TLAS leaf reordering. */
+export function aovInstanceOrder(tlas) {
+    const u = new Uint32Array(tlas.buffer), i = new Int32Array(tlas.buffer);
+    const order = new Uint32Array((tlas.instancesBuffer?.byteLength ?? 0) / 160);
+    // Native indexed HWRT stores instances linearly and has no software TLAS.
+    if (!tlas.buffer.byteLength) {
+        for (let i = 0; i < order.length; i++)
+            order[i] = i;
+        return order;
+    }
+    function visit(node) {
+        const o = node * 4, count = i[o + 3];
+        if (count >= 0) {
+            visit(node + 2);
+            visit(count);
+        }
+        else
+            for (let k = 0; k < -count; k++)
+                order[u[o + 8 + k * 4]] = u[o + 10 + k * 4];
+    }
+    if (order.length)
+        visit(0);
+    return order;
+}
+export function packAovScene(source, tlas, camera, width, height, history, primitiveIds, includePrimitives = true) {
+    const order = aovInstanceOrder(tlas);
+    const instances = source.instances;
+    const frame = { width, height,
+        projection: JSON.stringify(Array.from(camera.getProjectionMatrix(width / height))),
+        viewProjection: new Float32Array(16), instances: [] };
+    const view = mat4.create();
+    mat4.invert(view, camera.transform);
+    mat4.mul(frame.viewProjection, camera.getProjectionMatrix(width / height), view);
+    const eye = new Float32Array([camera.transform[12], camera.transform[13], camera.transform[14], 1]);
+    const length = Math.hypot(camera.transform[8], camera.transform[9], camera.transform[10]);
+    const forward = new Float32Array([-camera.transform[8] / length, -camera.transform[9] / length, -camera.transform[10] / length, 0]);
+    frame.cameraEye = eye;
+    frame.cameraForward = forward;
+    const records = [];
+    for (let gpuIndex = 0; gpuIndex < order.length; gpuIndex++) {
+        const index = order[gpuIndex];
+        const binding = source.instanceBindings[instances instanceof PackedMeshInstances ? instances.bindingIndices[index] : index];
+        const mesh = binding.mesh, geometry = mesh.geometry;
+        records.push({ object: validateAovId(mesh.aovId), instance: instances instanceof PackedMeshInstances ? instances.localIndices[index] : 0,
+            topology: geometryId(geometry) + geometry.topologyVersion * 0x100000000,
+            vertices: geometry.version, transform: new Float32Array(readMeshInstance(instances, index).transform) });
+    }
+    frame.instances = records;
+    const materialOffset = 52 + order.length * 24;
+    const primitiveOffset = materialOffset + source.materials.length;
+    const primitiveCount = primitiveIds?.length ?? tlas.buffer.byteLength / 16 + source.blases.reduce((n, b) => n + b.bvh.buffer.byteLength / 16, 0);
+    // Web targets keep the primitive tail resident; only pack the small
+    // camera/instance/material prefix when their cached primitive map is supplied.
+    const words = new Uint32Array(primitiveOffset + (includePrimitives ? primitiveCount : 0)), floats = new Float32Array(words.buffer);
+    const previous = history.previous(frame);
+    if (previous)
+        floats.set(previous.viewProjection);
+    words[16] = materialOffset;
+    words[17] = primitiveOffset;
+    const projection = new Float32Array(Array.from(camera.getProjectionMatrix(width / height)));
+    let projectionHash = 2166136261;
+    for (const word of new Uint32Array(projection.buffer))
+        projectionHash = Math.imul(projectionHash ^ word, 16777619) >>> 0;
+    words[18] = projectionHash;
+    floats.set(frame.viewProjection, 20);
+    floats.set(eye, 36);
+    floats.set(forward, 40);
+    if (previous?.cameraEye && previous.cameraForward) {
+        floats.set(previous.cameraEye, 44);
+        floats.set(previous.cameraForward, 48);
+    }
+    const objectIds = new Set();
+    for (const binding of source.instanceBindings) {
+        const id = validateAovId(binding.mesh.aovId);
+        if (objectIds.has(id))
+            throw new Error('AOV object IDs must be unique');
+        objectIds.add(id);
+    }
+    records.forEach((record, index) => {
+        const o = 52 + index * 24;
+        words[o] = record.object;
+        words[o + 1] = record.instance;
+        const old = history.match(frame, record), inverse = mat4.create();
+        if (old && mat4.invert(inverse, record.transform)) {
+            const reprojection = mat4.create();
+            mat4.mul(reprojection, old.transform, inverse);
+            floats.set(Array.from(reprojection), o + 4);
+            words[o + 2] = 1;
+        }
+    });
+    const materialIds = new Set();
+    source.materials.forEach((material, index) => {
+        const id = validateAovId(material.aovId);
+        if (materialIds.has(id))
+            throw new Error('AOV material IDs must be unique');
+        materialIds.add(id);
+        words[materialOffset + index] = id;
+    });
+    if (!includePrimitives)
+        return { words, frame };
+    words.fill(0xffffffff, primitiveOffset);
+    if (primitiveIds) {
+        words.set(primitiveIds, primitiveOffset);
+        return { words, frame };
+    }
+    let base = tlas.buffer.byteLength / 16;
+    source.blases.forEach((blas, index) => {
+        const bvh = new Uint32Array(blas.bvh.buffer), indices = source.geometries[index].indexArray;
+        const triangles = new Map();
+        for (let t = 0; t < indices.length / 3; t++)
+            triangles.set(`${indices[t * 3]},${indices[t * 3 + 1]},${indices[t * 3 + 2]}`, t);
+        for (let record = 0; record < bvh.length / 4; record++) {
+            const t = triangles.get(`${bvh[record * 4]},${bvh[record * 4 + 1]},${bvh[record * 4 + 2]}`);
+            if (t !== undefined)
+                words[primitiveOffset + base + record] = t;
+        }
+        // Explicit builder metadata disambiguates duplicate index triples.
+        const ids = blas.bvh.triangleIds;
+        if (ids)
+            for (let i = 0; i < ids.length; i += 2)
+                words[primitiveOffset + base + ids[i]] = ids[i + 1];
+        base += bvh.length / 4;
+    });
+    return { words, frame };
+}
+//# sourceMappingURL=aovScene.js.map

package/lib/renderer/aovScene.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aovScene.js","sourceRoot":"","sources":["../../src/renderer/aovScene.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,IAAI,EAAC,MAAM,YAAY,CAAC;AAKhC,OAAO,EAAa,aAAa,EAAkD,MAAM,UAAU,CAAC;AACpG,OAAO,EAAC,mBAAmB,EAAE,gBAAgB,EAAqB,MAAM,0BAA0B,CAAC;AAGnG,MAAM,WAAW,GAAG,IAAI,OAAO,EAAoB,CAAC;AACpD,IAAI,YAAY,GAAG,CAAC,CAAC;AACrB,SAAS,UAAU,CAAC,QAAkB;IACpC,IAAI,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACnC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;QAAC,EAAE,GAAG,YAAY,EAAE,CAAC;QAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAAC,CAAC;IAC7E,OAAO,EAAE,CAAC;AACZ,CAAC;AAQD,mFAAmF;AACnF,MAAM,UAAU,gBAAgB,CAAC,IAAiB;IAChD,MAAM,CAAC,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxE,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,CAAC,IAAI,CAAC,eAAe,EAAE,UAAU,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAC7E,0EAA0E;IAC1E,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;QAAC,KAAI,IAAI,CAAC,GAAC,CAAC,EAAC,CAAC,GAAC,KAAK,CAAC,MAAM,EAAC,CAAC,EAAE;YAAC,KAAK,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC;QAAC,OAAO,KAAK,CAAC;IAAC,CAAC;IACzF,SAAS,KAAK,CAAC,IAAY;QACzB,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAAC,CAAC;;YAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACpF,CAAC;IACD,IAAI,KAAK,CAAC,MAAM;QAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,OAAO,KAAK,CAAC;AACf,CAAC;AACD,MAAM,UAAU,YAAY,CAAC,MAAsB,EAAE,IAAiB,EAAE,MAAc,EACpF,KAAa,EAAE,MAAc,EAAE,OAAmB,EAAE,YAA0B,EAAE,iBAAiB,GAAG,IAAI;IACxG,MAAM,KAAK,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;IACnC,MAAM,KAAK,GAAqB,EAAC,KAAK,EAAE,MAAM;QAC5C,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC;QAClF,cAAc,EAAE,IAAI,YAAY,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAC,CAAC;IACvD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;IAChE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,cAAc,EAAE,MAAM,CAAC,mBAAmB,CAAC,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;IACjF,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,EAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,EAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC;IACjG,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;IACxF,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,GAAC,MAAM,EAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,GAAC,MAAM,EAAC,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,GAAC,MAAM,EAAC,CAAC,CAAC,CAAC,CAAC;IAC3H,KAAK,CAAC,SAAS,GAAC,GAAG,CAAC;IAAC,KAAK,CAAC,aAAa,GAAC,OAAO,CAAC;IACjD,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC;QAC3D,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC9B,MAAM,OAAO,GAAG,MAAM,CAAC,gBAAgB,CAAC,SAAS,YAAY,mBAAmB,CAAC,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC5H,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QACpD,OAAO,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,YAAY,mBAAmB,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACrI,QAAQ,EAAE,UAAU,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,eAAe,GAAG,WAAW;YACvE,QAAQ,EAAE,QAAQ,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,YAAY,CAAC,gBAAgB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,SAAS,CAAC,EAAC,CAAC,CAAC;IAC5G,CAAC;IACD,KAAK,CAAC,SAAS,GAAG,OAAO,CAAC;IAC1B,MAAM,cAAc,GAAG,EAAE,GAAG,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC;IAC9C,MAAM,eAAe,GAAG,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC;IACjE,MAAM,cAAc,GAAG,YAAY,EAAE,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;IACjJ,oEAAoE;IACpE,+EAA+E;IAC/E,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,eAAe,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACnI,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,QAAQ;QAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;IAClD,KAAK,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC;IAAC,KAAK,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC;IACxD,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,KAAK,GAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC1F,IAAI,cAAc,GAAC,UAAU,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,WAAW,CAAC,UAAU,CAAC,MAAM,CAAC;QAAE,cAAc,GAAC,IAAI,CAAC,IAAI,CAAC,cAAc,GAAC,IAAI,EAAC,QAAQ,CAAC,KAAG,CAAC,CAAC;IAClH,KAAK,CAAC,EAAE,CAAC,GAAC,cAAc,CAAC;IACzB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,cAAc,EAAC,EAAE,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAC,EAAE,CAAC,CAAC;IAAA,MAAM,CAAC,GAAG,CAAC,OAAO,EAAC,EAAE,CAAC,CAAC;IAC1C,IAAG,QAAQ,EAAE,SAAS,IAAI,QAAQ,CAAC,aAAa,EAAC,CAAC;QAAA,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAC,EAAE,CAAC,CAAC;QAAA,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,EAAC,EAAE,CAAC,CAAC;IAAA,CAAC;IAC3H,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;QAC9C,MAAM,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7C,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACxE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;QAChC,MAAM,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,EAAE,CAAC;QAC1B,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC;QACzD,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAClE,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;YAClD,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAAC,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YACnF,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAChE,CAAC;IACH,CAAC,CAAC,CAAC;IACH,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE;QAC3C,MAAM,EAAE,GAAG,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACzC,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QAC5E,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAAC,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;IAC1D,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,iBAAiB;QAAE,OAAO,EAAC,KAAK,EAAE,KAAK,EAAC,CAAC;IAC9C,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;IACxC,IAAG,YAAY,EAAC,CAAC;QAAA,KAAK,CAAC,GAAG,CAAC,YAAY,EAAC,eAAe,CAAC,CAAC;QAAA,OAAO,EAAC,KAAK,EAAC,KAAK,EAAC,CAAC;IAAA,CAAC;IAC/E,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,EAAE,CAAC;IACvC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QACpC,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC;QAC5F,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,SAAS,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,GAAC,CAAC,GAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,GAAC,CAAC,GAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrH,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;YACvD,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,GAAC,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,GAAC,CAAC,GAAC,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,GAAC,CAAC,GAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClF,IAAI,CAAC,KAAK,SAAS;gBAAE,KAAK,CAAC,eAAe,GAAG,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAClE,CAAC;QACD,mEAAmE;QACnE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC;QACjC,IAAI,GAAG;YAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;gBAAE,KAAK,CAAC,eAAe,GAAG,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QACnG,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IACH,OAAO,EAAC,KAAK,EAAE,KAAK,EAAC,CAAC;AACxB,CAAC","sourcesContent":["import {mat4} from '../math.js';\nimport type Camera from '../scene/Camera.js';\nimport type MeshState from '../scene/MeshState.js';\nimport type MaterialState from '../scene/MaterialState.js';\nimport type Geometry from '../scene/Geometry.js';\nimport {AovHistory, validateAovId, type AovFrameSnapshot, type AovInstanceSnapshot} from './aov.js';\nimport {PackedMeshInstances, readMeshInstance, type MeshInstances} from './packedMeshInstances.js';\nimport type {FlattendBVH, BLASInstance} from './bvhAccel.js';\nimport type {PreparedMeshInstanceBinding} from './scenePreparation.js';\nconst geometryIds = new WeakMap<Geometry, number>();\nlet nextGeometry = 1;\nfunction geometryId(geometry: Geometry) {\n  let id = geometryIds.get(geometry);\n  if (id === undefined) { id = nextGeometry++; geometryIds.set(geometry, id); }\n  return id;\n}\nexport interface AovSceneSource {\n  instances: MeshInstances;\n  instanceBindings: PreparedMeshInstanceBinding<MeshState>[];\n  materials: MaterialState[];\n  geometries: Geometry[];\n  blases: BLASInstance[];\n}\n/** Source instance index for each GPU instance, including TLAS leaf reordering. */\nexport function aovInstanceOrder(tlas: FlattendBVH): Uint32Array {\n  const u = new Uint32Array(tlas.buffer), i = new Int32Array(tlas.buffer);\n  const order = new Uint32Array((tlas.instancesBuffer?.byteLength ?? 0) / 160);\n  // Native indexed HWRT stores instances linearly and has no software TLAS.\n  if (!tlas.buffer.byteLength) { for(let i=0;i<order.length;i++)order[i]=i; return order; }\n  function visit(node: number) {\n    const o = node * 4, count = i[o + 3];\n    if (count >= 0) { visit(node + 2); visit(count); }\n    else for (let k = 0; k < -count; k++) order[u[o + 8 + k * 4]] = u[o + 10 + k * 4];\n  }\n  if (order.length) visit(0);\n  return order;\n}\nexport function packAovScene(source: AovSceneSource, tlas: FlattendBVH, camera: Camera,\n  width: number, height: number, history: AovHistory, primitiveIds?: Uint32Array, includePrimitives = true): {words: Uint32Array; frame: AovFrameSnapshot} {\n  const order = aovInstanceOrder(tlas);\n  const instances = source.instances;\n  const frame: AovFrameSnapshot = {width, height,\n    projection: JSON.stringify(Array.from(camera.getProjectionMatrix(width / height))),\n    viewProjection: new Float32Array(16), instances: []};\n  const view = mat4.create(); mat4.invert(view, camera.transform);\n  mat4.mul(frame.viewProjection, camera.getProjectionMatrix(width / height), view);\n  const eye = new Float32Array([camera.transform[12],camera.transform[13],camera.transform[14],1]);\n  const length = Math.hypot(camera.transform[8],camera.transform[9],camera.transform[10]);\n  const forward = new Float32Array([-camera.transform[8]/length,-camera.transform[9]/length,-camera.transform[10]/length,0]);\n  frame.cameraEye=eye; frame.cameraForward=forward;\n  const records: AovInstanceSnapshot[] = [];\n  for (let gpuIndex = 0; gpuIndex < order.length; gpuIndex++) {\n    const index = order[gpuIndex];\n    const binding = source.instanceBindings[instances instanceof PackedMeshInstances ? instances.bindingIndices[index] : index];\n    const mesh = binding.mesh, geometry = mesh.geometry;\n    records.push({object: validateAovId(mesh.aovId), instance: instances instanceof PackedMeshInstances ? instances.localIndices[index] : 0,\n      topology: geometryId(geometry) + geometry.topologyVersion * 0x100000000,\n      vertices: geometry.version, transform: new Float32Array(readMeshInstance(instances, index).transform)});\n  }\n  frame.instances = records;\n  const materialOffset = 52 + order.length * 24;\n  const primitiveOffset = materialOffset + source.materials.length;\n  const primitiveCount = primitiveIds?.length ?? tlas.buffer.byteLength / 16 + source.blases.reduce((n, b) => n + b.bvh.buffer.byteLength / 16, 0);\n  // Web targets keep the primitive tail resident; only pack the small\n  // camera/instance/material prefix when their cached primitive map is supplied.\n  const words = new Uint32Array(primitiveOffset + (includePrimitives ? primitiveCount : 0)), floats = new Float32Array(words.buffer);\n  const previous = history.previous(frame);\n  if (previous) floats.set(previous.viewProjection);\n  words[16] = materialOffset; words[17] = primitiveOffset;\n  const projection = new Float32Array(Array.from(camera.getProjectionMatrix(width/height)));\n  let projectionHash=2166136261;\n  for (const word of new Uint32Array(projection.buffer)) projectionHash=Math.imul(projectionHash^word,16777619)>>>0;\n  words[18]=projectionHash;\n  floats.set(frame.viewProjection,20);\n  floats.set(eye,36);floats.set(forward,40);\n  if(previous?.cameraEye && previous.cameraForward){floats.set(previous.cameraEye,44);floats.set(previous.cameraForward,48);}\n  const objectIds = new Set<number>();\n  for (const binding of source.instanceBindings) {\n    const id = validateAovId(binding.mesh.aovId);\n    if (objectIds.has(id)) throw new Error('AOV object IDs must be unique');\n    objectIds.add(id);\n  }\n  records.forEach((record, index) => {\n    const o = 52 + index * 24;\n    words[o] = record.object; words[o + 1] = record.instance;\n    const old = history.match(frame, record), inverse = mat4.create();\n    if (old && mat4.invert(inverse, record.transform)) {\n      const reprojection = mat4.create(); mat4.mul(reprojection, old.transform, inverse);\n      floats.set(Array.from(reprojection), o + 4); words[o + 2] = 1;\n    }\n  });\n  const materialIds = new Set<number>();\n  source.materials.forEach((material, index) => {\n    const id = validateAovId(material.aovId);\n    if (materialIds.has(id)) throw new Error('AOV material IDs must be unique');\n    materialIds.add(id); words[materialOffset + index] = id;\n  });\n  if (!includePrimitives) return {words, frame};\n  words.fill(0xffffffff, primitiveOffset);\n  if(primitiveIds){words.set(primitiveIds,primitiveOffset);return {words,frame};}\n  let base = tlas.buffer.byteLength / 16;\n  source.blases.forEach((blas, index) => {\n    const bvh = new Uint32Array(blas.bvh.buffer), indices = source.geometries[index].indexArray;\n    const triangles = new Map<string, number>();\n    for (let t = 0; t < indices.length / 3; t++) triangles.set(`${indices[t*3]},${indices[t*3+1]},${indices[t*3+2]}`, t);\n    for (let record = 0; record < bvh.length / 4; record++) {\n      const t = triangles.get(`${bvh[record*4]},${bvh[record*4+1]},${bvh[record*4+2]}`);\n      if (t !== undefined) words[primitiveOffset + base + record] = t;\n    }\n    // Explicit builder metadata disambiguates duplicate index triples.\n    const ids = blas.bvh.triangleIds;\n    if (ids) for (let i = 0; i < ids.length; i += 2) words[primitiveOffset + base + ids[i]] = ids[i+1];\n    base += bvh.length / 4;\n  });\n  return {words, frame};\n}\n"]}

package/lib/renderer/binnedSahBvh.js

@@ -187,7 +187,8 @@ export function buildBinnedSahBvh(aabbs, count) {
                     src++;
                 }
                 else {
-                    primIndices[src] = primIndices[--j];
+                    // Explicit numeric expression also supports scriptc typed-array stores.
+                    primIndices[src + 0] = primIndices[--j];
                     primIndices[j] = p;
                 }
             }

package/lib/renderer/binnedSahBvh.js.map

@@ -1 +1 @@
-{"version":3,"file":"binnedSahBvh.js","sourceRoot":"","sources":["../../src/renderer/binnedSahBvh.ts"],"names":[],"mappings":"AAAA,iEAAiE;AACjE,0DAA0D;AAC1D,iFAAiF;AACjF,+EAA+E;AAC/E,wCAAwC;AACxC,EAAE;AACF,2EAA2E;AAC3E,6EAA6E;AAC7E,6EAA6E;AAC7E,oEAAoE;AACpE,2EAA2E;AAC3E,2EAA2E;AAC3E,6EAA6E;AAC7E,mEAAmE;AACnE,kBAAkB;AAElB,MAAM,IAAI,GAAG,CAAC,CAAC;AACf,MAAM,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,MAAM,GAAG,CAAC,CAAC;AACjB,MAAM,GAAG,GAAG,IAAI,CAAC;AAcjB,4DAA4D;AAC5D,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;AAC9C,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;AAC9C,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC3C,oEAAoE;AACpE,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;AAC5C,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;AAE7C;;;GAGG;AACH,SAAS,KAAK,CAAC,MAAc,EAAE,OAAe,EAAE,KAAa;IAC3D,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,OAAO,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7C,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AACvD,CAAC;AAED,SAAS,OAAO,CACd,CAAS,EACT,IAAY,EAAE,IAAY,EAAE,IAAY,EACxC,IAAY,EAAE,IAAY,EAAE,IAAY;IAExC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACtC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACtC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAmB,EAAE,KAAa;IAClE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC5C,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC5C,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;IAC3C,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;IACrE,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC5C,IAAI,QAAQ,GAAG,GAAG,EAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,GAAG,GAAG,CAAC;IACnD,IAAI,QAAQ,GAAG,CAAC,GAAG,EAAE,QAAQ,GAAG,CAAC,GAAG,EAAE,QAAQ,GAAG,CAAC,GAAG,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;QACjC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;QACrC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IACD,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IACjE,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IACjE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IAErB,MAAM,OAAO,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC;IAC9C,MAAM,OAAO,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC;IAC9C,MAAM,OAAO,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC;IAE9C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,OAAO,IAAI,EAAE,CAAC;QACZ,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,EAAE,GAAG,SAAS,GAAG,CAAC,CAAC;YACzB,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACzE,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YACvC,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YACvC,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YACvC,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;YACvE,IAAI,IAAI,KAAK,CAAC;gBAAE,MAAM,CAAC,wCAAwC;YAE/D,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YACnC,MAAM,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YACvC,2DAA2D;YAC3D,IAAI,SAAS,KAAK,CAAC;gBAAE,MAAM;YAC3B,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAEtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBAChB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YACnB,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,GAAG,GAAG,KAAK,GAAG,SAAS,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1D,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpE,iDAAiD;gBACjD,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC5C,MAAM,EAAE,GAAG,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACvD,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC3D,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC/C,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACpD,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACpD,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACtD,CAAC;YAED,yDAAyD;YACzD,IAAI,SAAS,GAAG,GAAG,CAAC;YACpB,IAAI,QAAQ,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC;YAC9B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;gBACpC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;gBACrE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;gBACrE,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;oBAAE,SAAS;gBACjC,IAAI,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC;gBACpF,IAAI,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC;gBACpF,IAAI,KAAK,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;gBAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClC,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;oBAChC,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC3C,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,IAAI,QAAQ,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;oBACnC,MAAM,IAAI,QAAQ,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC/C,MAAM,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC;oBACjE,MAAM,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC;oBACjE,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;oBACxE,SAAS,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;gBACxF,CAAC;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;oBACxC,IAAI,IAAI,GAAG,SAAS,EAAE,CAAC;wBACrB,SAAS,GAAG,IAAI,CAAC;wBACjB,QAAQ,GAAG,IAAI,CAAC;wBAChB,OAAO,GAAG,CAAC,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;YACD,SAAS,GAAG,MAAM,GAAG,KAAK,GAAG,SAAS,GAAG,IAAI,CAAC;YAC9C,6DAA6D;YAC7D,IAAI,CAAC,CAAC,SAAS,GAAG,SAAS,GAAG,KAAK,CAAC;gBAAE,MAAM;YAE5C,wCAAwC;YACxC,MAAM,KAAK,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;YACzE,MAAM,IAAI,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;YACrE,IAAI,CAAC,GAAG,KAAK,GAAG,SAAS,EAAE,GAAG,GAAG,KAAK,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;gBAC3B,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;oBAC7D,GAAG,EAAE,CAAC;gBACR,CAAC;qBAAM,CAAC;oBACN,WAAW,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;YACD,MAAM,SAAS,GAAG,GAAG,GAAG,KAAK,CAAC;YAC9B,MAAM,UAAU,GAAG,SAAS,GAAG,SAAS,CAAC;YACzC,IAAI,SAAS,KAAK,CAAC,IAAI,UAAU,KAAK,CAAC;gBAAE,MAAM,CAAC,qBAAqB;YAErE,MAAM,CAAC,GAAG,OAAO,CAAC;YAClB,OAAO,IAAI,CAAC,CAAC;YACb,qEAAqE;YACrE,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,EAAE,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC;YACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;gBACnD,MAAM,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YAC9D,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpC,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;gBACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;wBAAE,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACvE,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;wBAAE,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACjF,CAAC;YACH,CAAC;YACD,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;YAC/C,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;YACpD,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAAC,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACnD,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClB,SAAS,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,MAAM;QACzB,SAAS,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;IAC3B,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;AAC3E,CAAC;AAYD;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,GAAiB;IAC1C,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;IAChD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IAC3C,IAAI,SAAS,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,iBAAiB,GAAG,CAAC,CAAC;IACvD,IAAI,CAAC,SAAS;QAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IAClF,MAAM,KAAK,GAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC1B,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;QACxB,OAAO,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;QAC1B,IAAI,KAAK,GAAG,QAAQ;YAAE,QAAQ,GAAG,KAAK,CAAC;QACvC,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC9B,SAAS,IAAI,CAAC,GAAG,KAAK,CAAC;QACvB,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,KAAK,GAAG,iBAAiB;gBAAE,iBAAiB,GAAG,KAAK,CAAC;QAC3D,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC;AACpE,CAAC","sourcesContent":["// Binned SAH BVH builder ported from TinyBVH's reference builder\n// (`BVH::Build( nodeIdx, depth )` in tiny_bvh.h at commit\n// 0e4584287823252cf83f0e9cd072848bec5f79c5, https://github.com/jbikker/tinybvh).\n// Copyright (c) 2024-2026 Jacco Bikker / Breda University of Applied Sciences.\n// MIT License, see src/tinybvh/LICENSE.\n//\n// Like the reference, it bins primitive centroids into 8 bins on all three\n// axes, sweeps the bins for the lowest surface area heuristic cost and stops\n// splitting when a leaf is cheaper (C_INT = C_TRAV = 1). Siblings are stored\n// next to each other: an interior node's children are leftFirst and\n// leftFirst + 1. Unlike the reference, node 1 is not left unused, the task\n// stack grows instead of turning a node into a leaf after 512 entries, and\n// arithmetic is float64: near-equal split costs can resolve differently from\n// TinyBVH's float32, giving trees of the same quality that are not\n// byte-identical.\n\nconst BINS = 8;\nconst C_INT = 1;\nconst C_TRAV = 1;\nconst FAR = 1e30;\n\nexport interface BinnedSahBvh {\n  nodeCount: number;\n  /** Per node: min x, y, z, max x, y, z. */\n  bounds: Float32Array;\n  /** Interior node: index of the left child. Leaf: first slot in primIndices. */\n  leftFirst: Uint32Array;\n  /** Primitive count of a leaf; 0 for interior nodes. */\n  primCount: Uint32Array;\n  /** Primitive indices referenced by leaves. */\n  primIndices: Uint32Array;\n}\n\n// Scratch shared by all builds; the builder is synchronous.\nconst binMin = new Float64Array(3 * BINS * 3);\nconst binMax = new Float64Array(3 * BINS * 3);\nconst binCount = new Uint32Array(3 * BINS);\n// Per split position: half area times primitive count of each side.\nconst leftCost = new Float64Array(BINS - 1);\nconst rightCost = new Float64Array(BINS - 1);\n\n/**\n * Bin of a centroid along one axis. Binning and partitioning both use this,\n * so every primitive ends up on the side whose bounds include its bin.\n */\nfunction binOf(center: number, nodeMin: number, scale: number) {\n  const bin = ((center - nodeMin) * scale) | 0;\n  return bin < 0 ? 0 : bin > BINS - 1 ? BINS - 1 : bin;\n}\n\nfunction growBin(\n  o: number,\n  minX: number, minY: number, minZ: number,\n  maxX: number, maxY: number, maxZ: number\n) {\n  binMin[o] = Math.min(binMin[o], minX);\n  binMin[o + 1] = Math.min(binMin[o + 1], minY);\n  binMin[o + 2] = Math.min(binMin[o + 2], minZ);\n  binMax[o] = Math.max(binMax[o], maxX);\n  binMax[o + 1] = Math.max(binMax[o + 1], maxY);\n  binMax[o + 2] = Math.max(binMax[o + 2], maxZ);\n}\n\n/**\n * Builds a binary BVH over axis-aligned boxes.\n * @param aabbs min x, y, z, max x, y, z for each primitive.\n * @param count number of primitives in `aabbs`.\n */\nexport function buildBinnedSahBvh(aabbs: Float32Array, count: number): BinnedSahBvh {\n  const capacity = Math.max(1, count * 2 - 1);\n  const bounds = new Float32Array(capacity * 6);\n  const leftFirst = new Uint32Array(capacity);\n  const primCount = new Uint32Array(capacity);\n  const primIndices = new Uint32Array(count);\n  if (count === 0) {\n    return { nodeCount: 0, bounds, leftFirst, primCount, primIndices };\n  }\n\n  const centers = new Float32Array(count * 3);\n  let rootMinX = FAR, rootMinY = FAR, rootMinZ = FAR;\n  let rootMaxX = -FAR, rootMaxY = -FAR, rootMaxZ = -FAR;\n  for (let i = 0; i < count; i++) {\n    const b = i * 6, c = i * 3;\n    const minX = aabbs[b], minY = aabbs[b + 1], minZ = aabbs[b + 2];\n    const maxX = aabbs[b + 3], maxY = aabbs[b + 4], maxZ = aabbs[b + 5];\n    centers[c] = (minX + maxX) * 0.5;\n    centers[c + 1] = (minY + maxY) * 0.5;\n    centers[c + 2] = (minZ + maxZ) * 0.5;\n    if (minX < rootMinX) rootMinX = minX;\n    if (minY < rootMinY) rootMinY = minY;\n    if (minZ < rootMinZ) rootMinZ = minZ;\n    if (maxX > rootMaxX) rootMaxX = maxX;\n    if (maxY > rootMaxY) rootMaxY = maxY;\n    if (maxZ > rootMaxZ) rootMaxZ = maxZ;\n    primIndices[i] = i;\n  }\n  bounds[0] = rootMinX; bounds[1] = rootMinY; bounds[2] = rootMinZ;\n  bounds[3] = rootMaxX; bounds[4] = rootMaxY; bounds[5] = rootMaxZ;\n  leftFirst[0] = 0;\n  primCount[0] = count;\n\n  const minDimX = (rootMaxX - rootMinX) * 1e-20;\n  const minDimY = (rootMaxY - rootMinY) * 1e-20;\n  const minDimZ = (rootMaxZ - rootMinZ) * 1e-20;\n\n  let newNode = 1;\n  const tasks: number[] = [];\n  let nodeIndex = 0;\n  while (true) {\n    while (true) {\n      const nb = nodeIndex * 6;\n      const nMinX = bounds[nb], nMinY = bounds[nb + 1], nMinZ = bounds[nb + 2];\n      const extentX = bounds[nb + 3] - nMinX;\n      const extentY = bounds[nb + 4] - nMinY;\n      const extentZ = bounds[nb + 5] - nMinZ;\n      const area = extentX * extentY + extentY * extentZ + extentZ * extentX;\n      if (area === 0) break; // can't split an infinitely small node.\n\n      const first = leftFirst[nodeIndex];\n      const nodePrims = primCount[nodeIndex];\n      // Every split of a single primitive leaves one side empty.\n      if (nodePrims === 1) break;\n      const scaleX = extentX > minDimX ? BINS / extentX : 0;\n      const scaleY = extentY > minDimY ? BINS / extentY : 0;\n      const scaleZ = extentZ > minDimZ ? BINS / extentZ : 0;\n\n      for (let i = 0; i < 3 * BINS * 3; i++) {\n        binMin[i] = FAR;\n        binMax[i] = -FAR;\n      }\n      binCount.fill(0);\n      for (let i = first, end = first + nodePrims; i < end; i++) {\n        const p = primIndices[i];\n        const c = p * 3, b = p * 6;\n        const minX = aabbs[b], minY = aabbs[b + 1], minZ = aabbs[b + 2];\n        const maxX = aabbs[b + 3], maxY = aabbs[b + 4], maxZ = aabbs[b + 5];\n        // Axis a, bin i: bounds at ((a * BINS) + i) * 3.\n        const bx = binOf(centers[c], nMinX, scaleX);\n        const by = BINS + binOf(centers[c + 1], nMinY, scaleY);\n        const bz = 2 * BINS + binOf(centers[c + 2], nMinZ, scaleZ);\n        binCount[bx]++; binCount[by]++; binCount[bz]++;\n        growBin(bx * 3, minX, minY, minZ, maxX, maxY, maxZ);\n        growBin(by * 3, minX, minY, minZ, maxX, maxY, maxZ);\n        growBin(bz * 3, minX, minY, minZ, maxX, maxY, maxZ);\n      }\n\n      // Sweep the bins of each axis for the lowest split cost.\n      let splitCost = FAR;\n      let bestAxis = 0, bestPos = 0;\n      for (let axis = 0; axis < 3; axis++) {\n        const extent = axis === 0 ? extentX : axis === 1 ? extentY : extentZ;\n        const minDim = axis === 0 ? minDimX : axis === 1 ? minDimY : minDimZ;\n        if (!(extent > minDim)) continue;\n        let lMinX = FAR, lMinY = FAR, lMinZ = FAR, lMaxX = -FAR, lMaxY = -FAR, lMaxZ = -FAR;\n        let rMinX = FAR, rMinY = FAR, rMinZ = FAR, rMaxX = -FAR, rMaxY = -FAR, rMaxZ = -FAR;\n        let leftN = 0, rightN = 0;\n        for (let i = 0; i < BINS - 1; i++) {\n          const l = (axis * BINS + i) * 3;\n          const r = (axis * BINS + BINS - 1 - i) * 3;\n          lMinX = Math.min(lMinX, binMin[l]); lMinY = Math.min(lMinY, binMin[l + 1]); lMinZ = Math.min(lMinZ, binMin[l + 2]);\n          lMaxX = Math.max(lMaxX, binMax[l]); lMaxY = Math.max(lMaxY, binMax[l + 1]); lMaxZ = Math.max(lMaxZ, binMax[l + 2]);\n          rMinX = Math.min(rMinX, binMin[r]); rMinY = Math.min(rMinY, binMin[r + 1]); rMinZ = Math.min(rMinZ, binMin[r + 2]);\n          rMaxX = Math.max(rMaxX, binMax[r]); rMaxY = Math.max(rMaxY, binMax[r + 1]); rMaxZ = Math.max(rMaxZ, binMax[r + 2]);\n          leftN += binCount[axis * BINS + i];\n          rightN += binCount[axis * BINS + BINS - 1 - i];\n          const lx = lMaxX - lMinX, ly = lMaxY - lMinY, lz = lMaxZ - lMinZ;\n          const rx = rMaxX - rMinX, ry = rMaxY - rMinY, rz = rMaxZ - rMinZ;\n          leftCost[i] = leftN === 0 ? FAR : (lx * ly + ly * lz + lz * lx) * leftN;\n          rightCost[BINS - 2 - i] = rightN === 0 ? FAR : (rx * ry + ry * rz + rz * rx) * rightN;\n        }\n        for (let i = 0; i < BINS - 1; i++) {\n          const cost = leftCost[i] + rightCost[i];\n          if (cost < splitCost) {\n            splitCost = cost;\n            bestAxis = axis;\n            bestPos = i;\n          }\n        }\n      }\n      splitCost = C_TRAV + C_INT * splitCost / area;\n      // Not splitting is better (also stops on non-finite bounds).\n      if (!(splitCost < nodePrims * C_INT)) break;\n\n      // In-place partition by the chosen bin.\n      const scale = bestAxis === 0 ? scaleX : bestAxis === 1 ? scaleY : scaleZ;\n      const nMin = bestAxis === 0 ? nMinX : bestAxis === 1 ? nMinY : nMinZ;\n      let j = first + nodePrims, src = first;\n      for (let i = 0; i < nodePrims; i++) {\n        const p = primIndices[src];\n        if (binOf(centers[p * 3 + bestAxis], nMin, scale) <= bestPos) {\n          src++;\n        } else {\n          primIndices[src] = primIndices[--j];\n          primIndices[j] = p;\n        }\n      }\n      const leftPrims = src - first;\n      const rightPrims = nodePrims - leftPrims;\n      if (leftPrims === 0 || rightPrims === 0) break; // should not happen.\n\n      const n = newNode;\n      newNode += 2;\n      // Child bounds are the unions of the bins on each side of the split.\n      const leftBase = n * 6, rightBase = leftBase + 6;\n      for (let k = 0; k < 3; k++) {\n        bounds[leftBase + k] = bounds[rightBase + k] = FAR;\n        bounds[leftBase + 3 + k] = bounds[rightBase + 3 + k] = -FAR;\n      }\n      for (let i = 0; i < BINS; i++) {\n        const o = (bestAxis * BINS + i) * 3;\n        const base = i <= bestPos ? leftBase : rightBase;\n        for (let k = 0; k < 3; k++) {\n          if (binMin[o + k] < bounds[base + k]) bounds[base + k] = binMin[o + k];\n          if (binMax[o + k] > bounds[base + 3 + k]) bounds[base + 3 + k] = binMax[o + k];\n        }\n      }\n      leftFirst[n] = first; primCount[n] = leftPrims;\n      leftFirst[n + 1] = j; primCount[n + 1] = rightPrims;\n      leftFirst[nodeIndex] = n; primCount[nodeIndex] = 0;\n      tasks.push(n + 1);\n      nodeIndex = n;\n    }\n    if (!tasks.length) break;\n    nodeIndex = tasks.pop()!;\n  }\n\n  return { nodeCount: newNode, bounds, leftFirst, primCount, primIndices };\n}\n\nexport interface Bvh2Layout {\n  /** Node indices in depth-first order (node, left subtree, right subtree). */\n  order: Uint32Array;\n  /** Offset of each node in vec4 units: 2 per node plus 1 per leaf primitive. */\n  offsets: Uint32Array;\n  vec4Count: number;\n  maxDepth: number;\n  maxLeafPrimitives: number;\n}\n\n/**\n * Places nodes in the depth-first BVH2 layout read by the traversal shaders:\n * the left child follows its parent and leaf primitives follow their leaf.\n */\nexport function layoutBvh2(bvh: BinnedSahBvh): Bvh2Layout {\n  const { nodeCount, leftFirst, primCount } = bvh;\n  const order = new Uint32Array(nodeCount);\n  const offsets = new Uint32Array(nodeCount);\n  let vec4Count = 0, maxDepth = 0, maxLeafPrimitives = 0;\n  if (!nodeCount) return { order, offsets, vec4Count, maxDepth, maxLeafPrimitives };\n  const stack: number[] = [0, 1];\n  let written = 0;\n  while (stack.length) {\n    const depth = stack.pop()!;\n    const node = stack.pop()!;\n    order[written++] = node;\n    offsets[node] = vec4Count;\n    if (depth > maxDepth) maxDepth = depth;\n    const prims = primCount[node];\n    vec4Count += 2 + prims;\n    if (prims) {\n      if (prims > maxLeafPrimitives) maxLeafPrimitives = prims;\n    } else {\n      stack.push(leftFirst[node] + 1, depth + 1, leftFirst[node], depth + 1);\n    }\n  }\n  return { order, offsets, vec4Count, maxDepth, maxLeafPrimitives };\n}\n"]}
+{"version":3,"file":"binnedSahBvh.js","sourceRoot":"","sources":["../../src/renderer/binnedSahBvh.ts"],"names":[],"mappings":"AAAA,iEAAiE;AACjE,0DAA0D;AAC1D,iFAAiF;AACjF,+EAA+E;AAC/E,wCAAwC;AACxC,EAAE;AACF,2EAA2E;AAC3E,6EAA6E;AAC7E,6EAA6E;AAC7E,oEAAoE;AACpE,2EAA2E;AAC3E,2EAA2E;AAC3E,6EAA6E;AAC7E,mEAAmE;AACnE,kBAAkB;AAElB,MAAM,IAAI,GAAG,CAAC,CAAC;AACf,MAAM,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,MAAM,GAAG,CAAC,CAAC;AACjB,MAAM,GAAG,GAAG,IAAI,CAAC;AAcjB,4DAA4D;AAC5D,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;AAC9C,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;AAC9C,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC3C,oEAAoE;AACpE,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;AAC5C,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;AAE7C;;;GAGG;AACH,SAAS,KAAK,CAAC,MAAc,EAAE,OAAe,EAAE,KAAa;IAC3D,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,OAAO,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7C,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AACvD,CAAC;AAED,SAAS,OAAO,CACd,CAAS,EACT,IAAY,EAAE,IAAY,EAAE,IAAY,EACxC,IAAY,EAAE,IAAY,EAAE,IAAY;IAExC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACtC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACtC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAmB,EAAE,KAAa;IAClE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC5C,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC5C,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;IAC3C,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;IACrE,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC5C,IAAI,QAAQ,GAAG,GAAG,EAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,GAAG,GAAG,CAAC;IACnD,IAAI,QAAQ,GAAG,CAAC,GAAG,EAAE,QAAQ,GAAG,CAAC,GAAG,EAAE,QAAQ,GAAG,CAAC,GAAG,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;QACjC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;QACrC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IACD,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IACjE,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IACjE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IAErB,MAAM,OAAO,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC;IAC9C,MAAM,OAAO,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC;IAC9C,MAAM,OAAO,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC;IAE9C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,OAAO,IAAI,EAAE,CAAC;QACZ,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,EAAE,GAAG,SAAS,GAAG,CAAC,CAAC;YACzB,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACzE,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YACvC,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YACvC,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YACvC,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;YACvE,IAAI,IAAI,KAAK,CAAC;gBAAE,MAAM,CAAC,wCAAwC;YAE/D,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YACnC,MAAM,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YACvC,2DAA2D;YAC3D,IAAI,SAAS,KAAK,CAAC;gBAAE,MAAM;YAC3B,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAEtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBAChB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YACnB,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,GAAG,GAAG,KAAK,GAAG,SAAS,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1D,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpE,iDAAiD;gBACjD,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC5C,MAAM,EAAE,GAAG,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACvD,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC3D,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC/C,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACpD,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACpD,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACtD,CAAC;YAED,yDAAyD;YACzD,IAAI,SAAS,GAAG,GAAG,CAAC;YACpB,IAAI,QAAQ,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC;YAC9B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;gBACpC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;gBACrE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;gBACrE,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;oBAAE,SAAS;gBACjC,IAAI,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC;gBACpF,IAAI,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC;gBACpF,IAAI,KAAK,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;gBAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClC,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;oBAChC,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC3C,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,IAAI,QAAQ,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;oBACnC,MAAM,IAAI,QAAQ,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC/C,MAAM,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC;oBACjE,MAAM,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC;oBACjE,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;oBACxE,SAAS,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;gBACxF,CAAC;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;oBACxC,IAAI,IAAI,GAAG,SAAS,EAAE,CAAC;wBACrB,SAAS,GAAG,IAAI,CAAC;wBACjB,QAAQ,GAAG,IAAI,CAAC;wBAChB,OAAO,GAAG,CAAC,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;YACD,SAAS,GAAG,MAAM,GAAG,KAAK,GAAG,SAAS,GAAG,IAAI,CAAC;YAC9C,6DAA6D;YAC7D,IAAI,CAAC,CAAC,SAAS,GAAG,SAAS,GAAG,KAAK,CAAC;gBAAE,MAAM;YAE5C,wCAAwC;YACxC,MAAM,KAAK,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;YACzE,MAAM,IAAI,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;YACrE,IAAI,CAAC,GAAG,KAAK,GAAG,SAAS,EAAE,GAAG,GAAG,KAAK,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;gBAC3B,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;oBAC7D,GAAG,EAAE,CAAC;gBACR,CAAC;qBAAM,CAAC;oBACN,wEAAwE;oBACxE,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;oBACxC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;YACD,MAAM,SAAS,GAAG,GAAG,GAAG,KAAK,CAAC;YAC9B,MAAM,UAAU,GAAG,SAAS,GAAG,SAAS,CAAC;YACzC,IAAI,SAAS,KAAK,CAAC,IAAI,UAAU,KAAK,CAAC;gBAAE,MAAM,CAAC,qBAAqB;YAErE,MAAM,CAAC,GAAG,OAAO,CAAC;YAClB,OAAO,IAAI,CAAC,CAAC;YACb,qEAAqE;YACrE,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,EAAE,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC;YACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;gBACnD,MAAM,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YAC9D,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpC,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;gBACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;wBAAE,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACvE,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;wBAAE,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACjF,CAAC;YACH,CAAC;YACD,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;YAC/C,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;YACpD,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAAC,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACnD,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClB,SAAS,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,MAAM;QACzB,SAAS,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;IAC3B,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;AAC3E,CAAC;AAYD;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,GAAiB;IAC1C,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;IAChD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IAC3C,IAAI,SAAS,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,iBAAiB,GAAG,CAAC,CAAC;IACvD,IAAI,CAAC,SAAS;QAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IAClF,MAAM,KAAK,GAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC1B,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;QACxB,OAAO,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;QAC1B,IAAI,KAAK,GAAG,QAAQ;YAAE,QAAQ,GAAG,KAAK,CAAC;QACvC,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC9B,SAAS,IAAI,CAAC,GAAG,KAAK,CAAC;QACvB,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,KAAK,GAAG,iBAAiB;gBAAE,iBAAiB,GAAG,KAAK,CAAC;QAC3D,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC;AACpE,CAAC","sourcesContent":["// Binned SAH BVH builder ported from TinyBVH's reference builder\n// (`BVH::Build( nodeIdx, depth )` in tiny_bvh.h at commit\n// 0e4584287823252cf83f0e9cd072848bec5f79c5, https://github.com/jbikker/tinybvh).\n// Copyright (c) 2024-2026 Jacco Bikker / Breda University of Applied Sciences.\n// MIT License, see src/tinybvh/LICENSE.\n//\n// Like the reference, it bins primitive centroids into 8 bins on all three\n// axes, sweeps the bins for the lowest surface area heuristic cost and stops\n// splitting when a leaf is cheaper (C_INT = C_TRAV = 1). Siblings are stored\n// next to each other: an interior node's children are leftFirst and\n// leftFirst + 1. Unlike the reference, node 1 is not left unused, the task\n// stack grows instead of turning a node into a leaf after 512 entries, and\n// arithmetic is float64: near-equal split costs can resolve differently from\n// TinyBVH's float32, giving trees of the same quality that are not\n// byte-identical.\n\nconst BINS = 8;\nconst C_INT = 1;\nconst C_TRAV = 1;\nconst FAR = 1e30;\n\nexport interface BinnedSahBvh {\n  nodeCount: number;\n  /** Per node: min x, y, z, max x, y, z. */\n  bounds: Float32Array;\n  /** Interior node: index of the left child. Leaf: first slot in primIndices. */\n  leftFirst: Uint32Array;\n  /** Primitive count of a leaf; 0 for interior nodes. */\n  primCount: Uint32Array;\n  /** Primitive indices referenced by leaves. */\n  primIndices: Uint32Array;\n}\n\n// Scratch shared by all builds; the builder is synchronous.\nconst binMin = new Float64Array(3 * BINS * 3);\nconst binMax = new Float64Array(3 * BINS * 3);\nconst binCount = new Uint32Array(3 * BINS);\n// Per split position: half area times primitive count of each side.\nconst leftCost = new Float64Array(BINS - 1);\nconst rightCost = new Float64Array(BINS - 1);\n\n/**\n * Bin of a centroid along one axis. Binning and partitioning both use this,\n * so every primitive ends up on the side whose bounds include its bin.\n */\nfunction binOf(center: number, nodeMin: number, scale: number) {\n  const bin = ((center - nodeMin) * scale) | 0;\n  return bin < 0 ? 0 : bin > BINS - 1 ? BINS - 1 : bin;\n}\n\nfunction growBin(\n  o: number,\n  minX: number, minY: number, minZ: number,\n  maxX: number, maxY: number, maxZ: number\n) {\n  binMin[o] = Math.min(binMin[o], minX);\n  binMin[o + 1] = Math.min(binMin[o + 1], minY);\n  binMin[o + 2] = Math.min(binMin[o + 2], minZ);\n  binMax[o] = Math.max(binMax[o], maxX);\n  binMax[o + 1] = Math.max(binMax[o + 1], maxY);\n  binMax[o + 2] = Math.max(binMax[o + 2], maxZ);\n}\n\n/**\n * Builds a binary BVH over axis-aligned boxes.\n * @param aabbs min x, y, z, max x, y, z for each primitive.\n * @param count number of primitives in `aabbs`.\n */\nexport function buildBinnedSahBvh(aabbs: Float32Array, count: number): BinnedSahBvh {\n  const capacity = Math.max(1, count * 2 - 1);\n  const bounds = new Float32Array(capacity * 6);\n  const leftFirst = new Uint32Array(capacity);\n  const primCount = new Uint32Array(capacity);\n  const primIndices = new Uint32Array(count);\n  if (count === 0) {\n    return { nodeCount: 0, bounds, leftFirst, primCount, primIndices };\n  }\n\n  const centers = new Float32Array(count * 3);\n  let rootMinX = FAR, rootMinY = FAR, rootMinZ = FAR;\n  let rootMaxX = -FAR, rootMaxY = -FAR, rootMaxZ = -FAR;\n  for (let i = 0; i < count; i++) {\n    const b = i * 6, c = i * 3;\n    const minX = aabbs[b], minY = aabbs[b + 1], minZ = aabbs[b + 2];\n    const maxX = aabbs[b + 3], maxY = aabbs[b + 4], maxZ = aabbs[b + 5];\n    centers[c] = (minX + maxX) * 0.5;\n    centers[c + 1] = (minY + maxY) * 0.5;\n    centers[c + 2] = (minZ + maxZ) * 0.5;\n    if (minX < rootMinX) rootMinX = minX;\n    if (minY < rootMinY) rootMinY = minY;\n    if (minZ < rootMinZ) rootMinZ = minZ;\n    if (maxX > rootMaxX) rootMaxX = maxX;\n    if (maxY > rootMaxY) rootMaxY = maxY;\n    if (maxZ > rootMaxZ) rootMaxZ = maxZ;\n    primIndices[i] = i;\n  }\n  bounds[0] = rootMinX; bounds[1] = rootMinY; bounds[2] = rootMinZ;\n  bounds[3] = rootMaxX; bounds[4] = rootMaxY; bounds[5] = rootMaxZ;\n  leftFirst[0] = 0;\n  primCount[0] = count;\n\n  const minDimX = (rootMaxX - rootMinX) * 1e-20;\n  const minDimY = (rootMaxY - rootMinY) * 1e-20;\n  const minDimZ = (rootMaxZ - rootMinZ) * 1e-20;\n\n  let newNode = 1;\n  const tasks: number[] = [];\n  let nodeIndex = 0;\n  while (true) {\n    while (true) {\n      const nb = nodeIndex * 6;\n      const nMinX = bounds[nb], nMinY = bounds[nb + 1], nMinZ = bounds[nb + 2];\n      const extentX = bounds[nb + 3] - nMinX;\n      const extentY = bounds[nb + 4] - nMinY;\n      const extentZ = bounds[nb + 5] - nMinZ;\n      const area = extentX * extentY + extentY * extentZ + extentZ * extentX;\n      if (area === 0) break; // can't split an infinitely small node.\n\n      const first = leftFirst[nodeIndex];\n      const nodePrims = primCount[nodeIndex];\n      // Every split of a single primitive leaves one side empty.\n      if (nodePrims === 1) break;\n      const scaleX = extentX > minDimX ? BINS / extentX : 0;\n      const scaleY = extentY > minDimY ? BINS / extentY : 0;\n      const scaleZ = extentZ > minDimZ ? BINS / extentZ : 0;\n\n      for (let i = 0; i < 3 * BINS * 3; i++) {\n        binMin[i] = FAR;\n        binMax[i] = -FAR;\n      }\n      binCount.fill(0);\n      for (let i = first, end = first + nodePrims; i < end; i++) {\n        const p = primIndices[i];\n        const c = p * 3, b = p * 6;\n        const minX = aabbs[b], minY = aabbs[b + 1], minZ = aabbs[b + 2];\n        const maxX = aabbs[b + 3], maxY = aabbs[b + 4], maxZ = aabbs[b + 5];\n        // Axis a, bin i: bounds at ((a * BINS) + i) * 3.\n        const bx = binOf(centers[c], nMinX, scaleX);\n        const by = BINS + binOf(centers[c + 1], nMinY, scaleY);\n        const bz = 2 * BINS + binOf(centers[c + 2], nMinZ, scaleZ);\n        binCount[bx]++; binCount[by]++; binCount[bz]++;\n        growBin(bx * 3, minX, minY, minZ, maxX, maxY, maxZ);\n        growBin(by * 3, minX, minY, minZ, maxX, maxY, maxZ);\n        growBin(bz * 3, minX, minY, minZ, maxX, maxY, maxZ);\n      }\n\n      // Sweep the bins of each axis for the lowest split cost.\n      let splitCost = FAR;\n      let bestAxis = 0, bestPos = 0;\n      for (let axis = 0; axis < 3; axis++) {\n        const extent = axis === 0 ? extentX : axis === 1 ? extentY : extentZ;\n        const minDim = axis === 0 ? minDimX : axis === 1 ? minDimY : minDimZ;\n        if (!(extent > minDim)) continue;\n        let lMinX = FAR, lMinY = FAR, lMinZ = FAR, lMaxX = -FAR, lMaxY = -FAR, lMaxZ = -FAR;\n        let rMinX = FAR, rMinY = FAR, rMinZ = FAR, rMaxX = -FAR, rMaxY = -FAR, rMaxZ = -FAR;\n        let leftN = 0, rightN = 0;\n        for (let i = 0; i < BINS - 1; i++) {\n          const l = (axis * BINS + i) * 3;\n          const r = (axis * BINS + BINS - 1 - i) * 3;\n          lMinX = Math.min(lMinX, binMin[l]); lMinY = Math.min(lMinY, binMin[l + 1]); lMinZ = Math.min(lMinZ, binMin[l + 2]);\n          lMaxX = Math.max(lMaxX, binMax[l]); lMaxY = Math.max(lMaxY, binMax[l + 1]); lMaxZ = Math.max(lMaxZ, binMax[l + 2]);\n          rMinX = Math.min(rMinX, binMin[r]); rMinY = Math.min(rMinY, binMin[r + 1]); rMinZ = Math.min(rMinZ, binMin[r + 2]);\n          rMaxX = Math.max(rMaxX, binMax[r]); rMaxY = Math.max(rMaxY, binMax[r + 1]); rMaxZ = Math.max(rMaxZ, binMax[r + 2]);\n          leftN += binCount[axis * BINS + i];\n          rightN += binCount[axis * BINS + BINS - 1 - i];\n          const lx = lMaxX - lMinX, ly = lMaxY - lMinY, lz = lMaxZ - lMinZ;\n          const rx = rMaxX - rMinX, ry = rMaxY - rMinY, rz = rMaxZ - rMinZ;\n          leftCost[i] = leftN === 0 ? FAR : (lx * ly + ly * lz + lz * lx) * leftN;\n          rightCost[BINS - 2 - i] = rightN === 0 ? FAR : (rx * ry + ry * rz + rz * rx) * rightN;\n        }\n        for (let i = 0; i < BINS - 1; i++) {\n          const cost = leftCost[i] + rightCost[i];\n          if (cost < splitCost) {\n            splitCost = cost;\n            bestAxis = axis;\n            bestPos = i;\n          }\n        }\n      }\n      splitCost = C_TRAV + C_INT * splitCost / area;\n      // Not splitting is better (also stops on non-finite bounds).\n      if (!(splitCost < nodePrims * C_INT)) break;\n\n      // In-place partition by the chosen bin.\n      const scale = bestAxis === 0 ? scaleX : bestAxis === 1 ? scaleY : scaleZ;\n      const nMin = bestAxis === 0 ? nMinX : bestAxis === 1 ? nMinY : nMinZ;\n      let j = first + nodePrims, src = first;\n      for (let i = 0; i < nodePrims; i++) {\n        const p = primIndices[src];\n        if (binOf(centers[p * 3 + bestAxis], nMin, scale) <= bestPos) {\n          src++;\n        } else {\n          // Explicit numeric expression also supports scriptc typed-array stores.\n          primIndices[src + 0] = primIndices[--j];\n          primIndices[j] = p;\n        }\n      }\n      const leftPrims = src - first;\n      const rightPrims = nodePrims - leftPrims;\n      if (leftPrims === 0 || rightPrims === 0) break; // should not happen.\n\n      const n = newNode;\n      newNode += 2;\n      // Child bounds are the unions of the bins on each side of the split.\n      const leftBase = n * 6, rightBase = leftBase + 6;\n      for (let k = 0; k < 3; k++) {\n        bounds[leftBase + k] = bounds[rightBase + k] = FAR;\n        bounds[leftBase + 3 + k] = bounds[rightBase + 3 + k] = -FAR;\n      }\n      for (let i = 0; i < BINS; i++) {\n        const o = (bestAxis * BINS + i) * 3;\n        const base = i <= bestPos ? leftBase : rightBase;\n        for (let k = 0; k < 3; k++) {\n          if (binMin[o + k] < bounds[base + k]) bounds[base + k] = binMin[o + k];\n          if (binMax[o + k] > bounds[base + 3 + k]) bounds[base + 3 + k] = binMax[o + k];\n        }\n      }\n      leftFirst[n] = first; primCount[n] = leftPrims;\n      leftFirst[n + 1] = j; primCount[n + 1] = rightPrims;\n      leftFirst[nodeIndex] = n; primCount[nodeIndex] = 0;\n      tasks.push(n + 1);\n      nodeIndex = n;\n    }\n    if (!tasks.length) break;\n    nodeIndex = tasks.pop()!;\n  }\n\n  return { nodeCount: newNode, bounds, leftFirst, primCount, primIndices };\n}\n\nexport interface Bvh2Layout {\n  /** Node indices in depth-first order (node, left subtree, right subtree). */\n  order: Uint32Array;\n  /** Offset of each node in vec4 units: 2 per node plus 1 per leaf primitive. */\n  offsets: Uint32Array;\n  vec4Count: number;\n  maxDepth: number;\n  maxLeafPrimitives: number;\n}\n\n/**\n * Places nodes in the depth-first BVH2 layout read by the traversal shaders:\n * the left child follows its parent and leaf primitives follow their leaf.\n */\nexport function layoutBvh2(bvh: BinnedSahBvh): Bvh2Layout {\n  const { nodeCount, leftFirst, primCount } = bvh;\n  const order = new Uint32Array(nodeCount);\n  const offsets = new Uint32Array(nodeCount);\n  let vec4Count = 0, maxDepth = 0, maxLeafPrimitives = 0;\n  if (!nodeCount) return { order, offsets, vec4Count, maxDepth, maxLeafPrimitives };\n  const stack: number[] = [0, 1];\n  let written = 0;\n  while (stack.length) {\n    const depth = stack.pop()!;\n    const node = stack.pop()!;\n    order[written++] = node;\n    offsets[node] = vec4Count;\n    if (depth > maxDepth) maxDepth = depth;\n    const prims = primCount[node];\n    vec4Count += 2 + prims;\n    if (prims) {\n      if (prims > maxLeafPrimitives) maxLeafPrimitives = prims;\n    } else {\n      stack.push(leftFirst[node] + 1, depth + 1, leftFirst[node], depth + 1);\n    }\n  }\n  return { order, offsets, vec4Count, maxDepth, maxLeafPrimitives };\n}\n"]}

package/lib/renderer/bvhAccel.d.ts

@@ -1,7 +1,7 @@
-import { type MeshInstances } from './meshInstances.js';
+import { type MeshInstances } from './packedMeshInstances.js';
 import Geometry from '../scene/Geometry.js';
-import { vec3 } from '../math.js';
-import { Mat4Array } from '../math.js';
+import { Box3 } from './Box3.js';
+export { Box3 } from './Box3.js';
 export declare const INSTANCE_VEC4_STRIDE = 10;
 export declare const INSTANCE_WORD_STRIDE: number;
 export type BvhLayout = 'bvh2' | 'bvh4' | 'bvh-gpu' | 'cwbvh';
@@ -13,19 +13,16 @@ export interface FlattendBVH {
     /** Largest leaf fan-out; used with maxDepth to size the traversal stack. */
     maxLeafPrimitives?: number;
     buffer: ArrayBuffer;
+    /** Source triangle IDs, (record, source triangle) pairs. */
+    triangleIds?: Uint32Array;
     /** Precomputed data without a layout field uses the legacy BVH2 layout. */
     layout?: BvhLayout;
     instancesBuffer?: ArrayBuffer;
 }
-export declare class Box3 {
-    min: vec3.Vec3Array;
-    max: vec3.Vec3Array;
-    constructor();
-}
 export interface TLASInstance {
     blasIndex: number;
     bounds: Box3;
-    transform: Mat4Array;
+    transform: Float64Array;
     materialsIndices: number[];
     displacementScale?: number;
     color?: [number, number, number];
@@ -57,12 +54,19 @@ export declare function emptyBLAS(): FlattendBVH;
  * displacement prisms along the vertex normals and store the packed ranges.
  */
 export declare function buildBLAS(geometry: Pick<Geometry, 'position' | 'indices' | 'normal'>, displacementScale?: number, trianglesDisplacement?: Float32Array): FlattendBVH;
+export declare function packLinearInstances(instances: MeshInstances, primitiveOffsets: number[], vertexOffsets: number[]): ArrayBuffer;
+/** Repack only selected source-order instance slots for hardware adapters. */
+export declare function refitLinearInstances(buffer: ArrayBuffer, instances: MeshInstances, primitiveOffsets: number[], vertexOffsets: number[], dirty: ReadonlySet<number>): TLASRefitRange[];
 /**
  * Builds a BVH2 TLAS over the instances. Leaves store
  * (instance record, BLAS offset, source instance index, 0); instance records
  * are written in leaf order to instancesBuffer.
  */
 export declare function buildTLAS(instances: MeshInstances, blases: BLASInstance[]): FlattendBVH;
+/** Bounds transport for a platform BVH builder; same padding as buildTLAS. */
+export declare function meshInstanceBounds(instances: MeshInstances): Float32Array;
+/** Pack a platform-built BVH2 hierarchy whose leaf x lane holds source indices. */
+export declare function packBuiltTLAS(instances: MeshInstances, blases: BLASInstance[], hierarchy: FlattendBVH): FlattendBVH;
 export interface TLASRefitRange {
     offset: number;
     size: number;
@@ -72,10 +76,16 @@ export interface TLASRefitResult {
     instanceRanges: TLASRefitRange[];
 }
 export declare function mergeRefitRanges(ranges: TLASRefitRange[]): TLASRefitRange[];
+/** A transactional candidate shares immutable refit topology metadata. */
+export declare function copyTLASForRefit(flattened: FlattendBVH): FlattendBVH;
 export declare function refitTLAS(flattened: FlattendBVH, instances: MeshInstances, blases: BLASInstance[], dirtySourceIndices?: ReadonlySet<number>): TLASRefitResult;
 /** Dynamic BLASes rebuild when their total node surface area doubles. */
 export declare const DYNAMIC_BLAS_REBUILD_RATIO = 2;
 /** Refit a BVH2 BLAS after vertex deformation, preserving topology. */
-export declare function refitBLAS(flattened: FlattendBVH, geometry: Pick<Geometry, 'position'> & Partial<Pick<Geometry, 'dynamic'>>): boolean;
+export declare function refitBLAS(flattened: FlattendBVH, geometry: Pick<Geometry, 'position'> & Partial<Pick<Geometry, 'dynamic'>>, displacement?: {
+    normal: Float32Array;
+    scale: number;
+    ranges: Float32Array;
+}): boolean;
 /** Writes only instance colors; TLAS topology and bounds remain untouched. */
 export declare function updateTLASInstanceColors(flattened: FlattendBVH, instances: MeshInstances, dirty: ReadonlySet<number>): TLASRefitRange[];