@tinypoly/gpu-renderer 0.0.0-stage → 0.0.1

package/dist/bvh.js

@@ -0,0 +1,296 @@
+/**
+ * Binned SAH bounding volume hierarchy, built straight into the layout the shader reads: eight words per node, the
+ * first four a minimum corner and a left child or leaf start, the last four a maximum corner and a right child or
+ * triangle count, matching `struct BvhNode` in `wgsl/bvh.wgsl.ts`.
+ *
+ * The bounds are computed from the same `Float32Array` the shader traverses, so every corner is already a float and
+ * needs no widening. Building from double precision positions, as the CPU renderer does, would need each minimum
+ * rounded down and each maximum rounded up before they reach the GPU.
+ */
+/** Words per node in the packed buffer. */
+export const NODE_WORDS = 8;
+/** Triangles a leaf may hold. */
+const MAX_LEAF_SIZE = 4;
+/** Candidate split positions evaluated per axis. */
+const BIN_COUNT = 12;
+/** What descending one more level costs, relative to intersecting one triangle. */
+const TRAVERSAL_COST = 0.125;
+/**
+ * Deepest node the builder produces. The shader traverses with a fixed stack, and one entry per level is enough
+ * because a node only pushes its far child. Depth is capped rather than trusted.
+ */
+export const MAX_BVH_DEPTH = 32;
+/** Per-triangle bounds and centroids, the only inputs the split needs. */
+function triangleBounds(positions, triangleCount) {
+    const min = new Float32Array(triangleCount * 3);
+    const max = new Float32Array(triangleCount * 3);
+    const centroid = new Float64Array(triangleCount * 3);
+    for (let triangle = 0; triangle < triangleCount; triangle++) {
+        for (let axis = 0; axis < 3; axis++) {
+            const a = positions[triangle * 9 + axis];
+            const b = positions[triangle * 9 + 3 + axis];
+            const c = positions[triangle * 9 + 6 + axis];
+            min[triangle * 3 + axis] = Math.min(a, b, c);
+            max[triangle * 3 + axis] = Math.max(a, b, c);
+            centroid[triangle * 3 + axis] = (a + b + c) / 3;
+        }
+    }
+    return { min, max, centroid };
+}
+export function buildBvh(positions, triangleCount) {
+    const order = new Uint32Array(triangleCount);
+    for (let i = 0; i < triangleCount; i++)
+        order[i] = i;
+    if (triangleCount === 0)
+        return { nodes: new ArrayBuffer(0), nodeCount: 0, order, maxDepth: 0 };
+    const { min, max, centroid } = triangleBounds(positions, triangleCount);
+    // The heuristic may split down to one triangle per leaf, so the pool starts at the common case and grows.
+    let nodes = new ArrayBuffer(Math.max(4, Math.ceil(triangleCount / 2)) * NODE_WORDS * 4);
+    let floats = new Float32Array(nodes);
+    let ints = new Int32Array(nodes);
+    const reserve = (needed) => {
+        if (needed * NODE_WORDS * 4 <= nodes.byteLength)
+            return;
+        const grown = new ArrayBuffer(Math.max(needed, Math.ceil(nodes.byteLength / (NODE_WORDS * 4) * 1.6))
+            * NODE_WORDS * 4);
+        new Float32Array(grown).set(floats);
+        nodes = grown;
+        floats = new Float32Array(nodes);
+        ints = new Int32Array(nodes);
+    };
+    // The pending ranges, four integers each: start, count, node and depth. Typed, so the loop allocates nothing.
+    let stack = new Int32Array(4 * 2 * MAX_BVH_DEPTH + 8);
+    let top = 1;
+    const bins = new Bins();
+    let nodeCount = 1;
+    let maxDepth = 0;
+    stack[0] = 0;
+    stack[1] = triangleCount;
+    stack[2] = 0;
+    stack[3] = 0;
+    while (top) {
+        top--;
+        const start = stack[top * 4], count = stack[top * 4 + 1], node = stack[top * 4 + 2], depth = stack[top * 4 + 3];
+        const end = start + count;
+        if (depth > maxDepth)
+            maxDepth = depth;
+        // The node's bounds and its centroids' bounds, in one pass. Doubles, so the corners are exactly the floats read.
+        let minX = Infinity, minY = Infinity, minZ = Infinity, maxX = -Infinity, maxY = -Infinity, maxZ = -Infinity;
+        let cMinX = Infinity, cMinY = Infinity, cMinZ = Infinity, cMaxX = -Infinity, cMaxY = -Infinity, cMaxZ = -Infinity;
+        for (let i = start; i < end; i++) {
+            const triangle = order[i] * 3;
+            let value = min[triangle];
+            if (value < minX)
+                minX = value;
+            value = min[triangle + 1];
+            if (value < minY)
+                minY = value;
+            value = min[triangle + 2];
+            if (value < minZ)
+                minZ = value;
+            value = max[triangle];
+            if (value > maxX)
+                maxX = value;
+            value = max[triangle + 1];
+            if (value > maxY)
+                maxY = value;
+            value = max[triangle + 2];
+            if (value > maxZ)
+                maxZ = value;
+            value = centroid[triangle];
+            if (value < cMinX)
+                cMinX = value;
+            if (value > cMaxX)
+                cMaxX = value;
+            value = centroid[triangle + 1];
+            if (value < cMinY)
+                cMinY = value;
+            if (value > cMaxY)
+                cMaxY = value;
+            value = centroid[triangle + 2];
+            if (value < cMinZ)
+                cMinZ = value;
+            if (value > cMaxZ)
+                cMaxZ = value;
+        }
+        const word = node * NODE_WORDS;
+        floats[word] = minX;
+        floats[word + 1] = minY;
+        floats[word + 2] = minZ;
+        floats[word + 4] = maxX;
+        floats[word + 5] = maxY;
+        floats[word + 6] = maxZ;
+        let split = -1;
+        if (count > MAX_LEAF_SIZE && depth + 1 < MAX_BVH_DEPTH) {
+            bins.centroidMin[0] = cMinX;
+            bins.centroidMin[1] = cMinY;
+            bins.centroidMin[2] = cMinZ;
+            bins.centroidMax[0] = cMaxX;
+            bins.centroidMax[1] = cMaxY;
+            bins.centroidMax[2] = cMaxZ;
+            split = partition(order, centroid, min, max, start, end, area(minX, minY, minZ, maxX, maxY, maxZ), bins);
+        }
+        if (split < 0) {
+            // A leaf points into `order` instead of into the node array, which the sign of the first link tells apart.
+            ints[word + 3] = -1 - start;
+            ints[word + 7] = count;
+            continue;
+        }
+        reserve(nodeCount + 2);
+        const left = nodeCount++;
+        const right = nodeCount++;
+        ints[word + 3] = left;
+        ints[word + 7] = right;
+        if ((top + 2) * 4 > stack.length) {
+            const grown = new Int32Array(stack.length * 2);
+            grown.set(stack);
+            stack = grown;
+        }
+        // Left first, then right, so the right side is built first, as the order the tree was always built in.
+        stack.set([start, split - start, left, depth + 1, split, end - split, right, depth + 1], top * 4);
+        top += 2;
+    }
+    return { nodes: nodes.slice(0, nodeCount * NODE_WORDS * 4), nodeCount, order, maxDepth };
+}
+/** Surface area, the cost the split heuristic weighs each side by. Empty bounds cost nothing. */
+function area(minX, minY, minZ, maxX, maxY, maxZ) {
+    const x = maxX - minX, y = maxY - minY, z = maxZ - minZ;
+    return x < 0 || y < 0 || z < 0 ? 0 : 2 * (x * y + y * z + z * x);
+}
+/** Scratch space for one split, kept across every node so binning allocates nothing. */
+class Bins {
+    centroidMin = new Float64Array(3);
+    centroidMax = new Float64Array(3);
+    /** Six doubles per bin and axis: the minimum corner, then the maximum. */
+    bounds = new Float64Array(3 * BIN_COUNT * 6);
+    counts = new Int32Array(3 * BIN_COUNT);
+    rightArea = new Float64Array(BIN_COUNT);
+    rightCount = new Int32Array(BIN_COUNT);
+    scale = new Float64Array(3);
+    reset() {
+        const bounds = this.bounds;
+        for (let i = 0; i < bounds.length; i += 6) {
+            bounds[i] = bounds[i + 1] = bounds[i + 2] = Infinity;
+            bounds[i + 3] = bounds[i + 4] = bounds[i + 5] = -Infinity;
+        }
+        this.counts.fill(0);
+    }
+}
+/**
+ * Reorders `order` in place so the range splits in two, and returns where the right side starts, or -1 when no split
+ * beats keeping the range as a leaf. Bins the centroids on all three axes in one pass and sweeps the surface area
+ * heuristic on each.
+ */
+function partition(order, centroid, min, max, start, end, parentArea, bins) {
+    if (parentArea <= 0)
+        return -1;
+    const { centroidMin, centroidMax, bounds, counts, rightArea, rightCount, scale } = bins;
+    let binned = false;
+    for (let axis = 0; axis < 3; axis++) {
+        const extent = centroidMax[axis] - centroidMin[axis];
+        // Every centroid sits at the same place on this axis: no split here separates anything.
+        scale[axis] = extent > 0 ? BIN_COUNT / extent : 0;
+        binned ||= extent > 0;
+    }
+    if (!binned)
+        return -1;
+    bins.reset();
+    for (let i = start; i < end; i++) {
+        const triangle = order[i] * 3;
+        const x0 = min[triangle], y0 = min[triangle + 1], z0 = min[triangle + 2];
+        const x1 = max[triangle], y1 = max[triangle + 1], z1 = max[triangle + 2];
+        for (let axis = 0; axis < 3; axis++) {
+            if (scale[axis] === 0)
+                continue;
+            const bin = axis * BIN_COUNT + binOf(centroid[triangle + axis], centroidMin[axis], scale[axis]);
+            const at = bin * 6;
+            counts[bin]++;
+            if (x0 < bounds[at])
+                bounds[at] = x0;
+            if (y0 < bounds[at + 1])
+                bounds[at + 1] = y0;
+            if (z0 < bounds[at + 2])
+                bounds[at + 2] = z0;
+            if (x1 > bounds[at + 3])
+                bounds[at + 3] = x1;
+            if (y1 > bounds[at + 4])
+                bounds[at + 4] = y1;
+            if (z1 > bounds[at + 5])
+                bounds[at + 5] = z1;
+        }
+    }
+    // Splitting costs a traversal step, so a split only wins when it beats shading the whole range as one leaf.
+    let bestCost = end - start, bestAxis = -1, bestBin = -1;
+    for (let axis = 0; axis < 3; axis++) {
+        if (scale[axis] === 0)
+            continue;
+        // Sweeping once from each side turns the heuristic into two passes instead of one per candidate split.
+        let minX = Infinity, minY = Infinity, minZ = Infinity, maxX = -Infinity, maxY = -Infinity, maxZ = -Infinity;
+        let running = 0;
+        for (let bin = BIN_COUNT - 1; bin > 0; bin--) {
+            const at = (axis * BIN_COUNT + bin) * 6;
+            if (bounds[at] < minX)
+                minX = bounds[at];
+            if (bounds[at + 1] < minY)
+                minY = bounds[at + 1];
+            if (bounds[at + 2] < minZ)
+                minZ = bounds[at + 2];
+            if (bounds[at + 3] > maxX)
+                maxX = bounds[at + 3];
+            if (bounds[at + 4] > maxY)
+                maxY = bounds[at + 4];
+            if (bounds[at + 5] > maxZ)
+                maxZ = bounds[at + 5];
+            running += counts[axis * BIN_COUNT + bin];
+            rightArea[bin] = area(minX, minY, minZ, maxX, maxY, maxZ);
+            rightCount[bin] = running;
+        }
+        minX = minY = minZ = Infinity;
+        maxX = maxY = maxZ = -Infinity;
+        running = 0;
+        for (let bin = 0; bin < BIN_COUNT - 1; bin++) {
+            const at = (axis * BIN_COUNT + bin) * 6;
+            if (bounds[at] < minX)
+                minX = bounds[at];
+            if (bounds[at + 1] < minY)
+                minY = bounds[at + 1];
+            if (bounds[at + 2] < minZ)
+                minZ = bounds[at + 2];
+            if (bounds[at + 3] > maxX)
+                maxX = bounds[at + 3];
+            if (bounds[at + 4] > maxY)
+                maxY = bounds[at + 4];
+            if (bounds[at + 5] > maxZ)
+                maxZ = bounds[at + 5];
+            running += counts[axis * BIN_COUNT + bin];
+            if (!running || !rightCount[bin + 1])
+                continue;
+            const cost = TRAVERSAL_COST
+                + (area(minX, minY, minZ, maxX, maxY, maxZ) * running + rightArea[bin + 1] * rightCount[bin + 1]) / parentArea;
+            if (cost < bestCost) {
+                bestCost = cost;
+                bestAxis = axis;
+                bestBin = bin;
+            }
+        }
+    }
+    if (bestAxis < 0)
+        return -1;
+    const pivot = centroidMin[bestAxis];
+    const bestScale = scale[bestAxis];
+    let left = start;
+    for (let i = start; i < end; i++) {
+        if (binOf(centroid[order[i] * 3 + bestAxis], pivot, bestScale) <= bestBin) {
+            const swap = order[i];
+            order[i] = order[left];
+            order[left] = swap;
+            left++;
+        }
+    }
+    // The sweep only proposes splits both sides occupy, so this is a guard against rounding, not an expected outcome.
+    return left === start || left === end ? -1 : left;
+}
+function binOf(value, origin, scale) {
+    return Math.min(BIN_COUNT - 1, Math.max(0, Math.floor((value - origin) * scale)));
+}
+//# sourceMappingURL=bvh.js.map

package/dist/bvh.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvh.js","sourceRoot":"","sources":["../src/bvh.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,2CAA2C;AAC3C,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC;AAE5B,iCAAiC;AACjC,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB,oDAAoD;AACpD,MAAM,SAAS,GAAG,EAAE,CAAC;AAErB,mFAAmF;AACnF,MAAM,cAAc,GAAG,KAAK,CAAC;AAE7B;;;GAGG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,EAAE,CAAC;AAWhC,0EAA0E;AAC1E,SAAS,cAAc,CAAC,SAAuB,EAAE,aAAqB;IACpE,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;IAChD,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;IAErD,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,aAAa,EAAE,QAAQ,EAAE,EAAE,CAAC;QAC5D,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,SAAS,CAAC,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;YACzC,MAAM,CAAC,GAAG,SAAS,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;YAC7C,MAAM,CAAC,GAAG,SAAS,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;YAE7C,GAAG,CAAC,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,GAAG,CAAC,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,QAAQ,CAAC,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,SAAuB,EAAE,aAAqB;IACrE,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,aAAa,CAAC,CAAC;IAE7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAErD,IAAI,aAAa,KAAK,CAAC;QACrB,OAAO,EAAE,KAAK,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAEzE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,cAAc,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;IACxE,0GAA0G;IAC1G,IAAI,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;IACxF,IAAI,MAAM,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;IACrC,IAAI,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IAEjC,MAAM,OAAO,GAAG,CAAC,MAAc,EAAE,EAAE;QACjC,IAAI,MAAM,GAAG,UAAU,GAAG,CAAC,IAAI,KAAK,CAAC,UAAU;YAAE,OAAO;QAExD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;cAChG,UAAU,GAAG,CAAC,CAAC,CAAC;QAEpB,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,KAAK,GAAG,KAAK,CAAC;QACd,MAAM,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC,CAAC;IAEF,8GAA8G;IAC9G,IAAI,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,GAAG,CAAC,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,MAAM,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;IACxB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,KAAK,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC;IACzB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEb,OAAO,GAAG,EAAE,CAAC;QACX,GAAG,EAAE,CAAC;QAEN,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAChH,MAAM,GAAG,GAAG,KAAK,GAAG,KAAK,CAAC;QAE1B,IAAI,KAAK,GAAG,QAAQ;YAAE,QAAQ,GAAG,KAAK,CAAC;QAEvC,iHAAiH;QACjH,IAAI,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC;QAC5G,IAAI,KAAK,GAAG,QAAQ,EAAE,KAAK,GAAG,QAAQ,EAAE,KAAK,GAAG,QAAQ,EAAE,KAAK,GAAG,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,QAAQ,CAAC;QAElH,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;YAE1B,IAAI,KAAK,GAAG,IAAI;gBAAE,IAAI,GAAG,KAAK,CAAC;YAC/B,KAAK,GAAG,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YAC1B,IAAI,KAAK,GAAG,IAAI;gBAAE,IAAI,GAAG,KAAK,CAAC;YAC/B,KAAK,GAAG,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YAC1B,IAAI,KAAK,GAAG,IAAI;gBAAE,IAAI,GAAG,KAAK,CAAC;YAC/B,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtB,IAAI,KAAK,GAAG,IAAI;gBAAE,IAAI,GAAG,KAAK,CAAC;YAC/B,KAAK,GAAG,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YAC1B,IAAI,KAAK,GAAG,IAAI;gBAAE,IAAI,GAAG,KAAK,CAAC;YAC/B,KAAK,GAAG,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YAC1B,IAAI,KAAK,GAAG,IAAI;gBAAE,IAAI,GAAG,KAAK,CAAC;YAC/B,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC3B,IAAI,KAAK,GAAG,KAAK;gBAAE,KAAK,GAAG,KAAK,CAAC;YACjC,IAAI,KAAK,GAAG,KAAK;gBAAE,KAAK,GAAG,KAAK,CAAC;YACjC,KAAK,GAAG,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YAC/B,IAAI,KAAK,GAAG,KAAK;gBAAE,KAAK,GAAG,KAAK,CAAC;YACjC,IAAI,KAAK,GAAG,KAAK;gBAAE,KAAK,GAAG,KAAK,CAAC;YACjC,KAAK,GAAG,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YAC/B,IAAI,KAAK,GAAG,KAAK;gBAAE,KAAK,GAAG,KAAK,CAAC;YACjC,IAAI,KAAK,GAAG,KAAK;gBAAE,KAAK,GAAG,KAAK,CAAC;QACnC,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,GAAG,UAAU,CAAC;QAE/B,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QACpB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QACxB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QACxB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QACxB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QACxB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QAExB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;QAEf,IAAI,KAAK,GAAG,aAAa,IAAI,KAAK,GAAG,CAAC,GAAG,aAAa,EAAE,CAAC;YACvD,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAC5B,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QAC3G,CAAC;QAED,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,2GAA2G;YAC3G,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YAC5B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YACvB,SAAS;QACX,CAAC;QAED,OAAO,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAEvB,MAAM,IAAI,GAAG,SAAS,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,SAAS,EAAE,CAAC;QAE1B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QACtB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAEvB,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAE/C,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACjB,KAAK,GAAG,KAAK,CAAC;QAChB,CAAC;QAED,uGAAuG;QACvG,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QAClG,GAAG,IAAI,CAAC,CAAC;IACX,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,GAAG,UAAU,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAC3F,CAAC;AAED,iGAAiG;AACjG,SAAS,IAAI,CAAC,IAAY,EAAE,IAAY,EAAE,IAAY,EAAE,IAAY,EAAE,IAAY,EAAE,IAAY;IAC9F,MAAM,CAAC,GAAG,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;IAExD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACnE,CAAC;AAED,wFAAwF;AACxF,MAAM,IAAI;IACC,WAAW,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,WAAW,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC3C,0EAA0E;IACjE,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC;IAC7C,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;IACvC,SAAS,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;IACxC,UAAU,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;IACvC,KAAK,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAErC,KAAK;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrD,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC;QAC5D,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;CACF;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,KAAkB,EAAE,QAAsB,EAAE,GAAiB,EAAE,GAAiB,EACjG,KAAa,EAAE,GAAW,EAAE,UAAkB,EAAE,IAAU;IAC1D,IAAI,UAAU,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IAE/B,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IACxF,IAAI,MAAM,GAAG,KAAK,CAAC;IAEnB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QAErD,wFAAwF;QACxF,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,KAAK,MAAM,GAAG,CAAC,CAAC;IACxB,CAAC;IAED,IAAI,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,CAAC;IAEvB,IAAI,CAAC,KAAK,EAAE,CAAC;IAEb,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACzE,MAAM,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QAEzE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;YACpC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YAEhC,MAAM,GAAG,GAAG,IAAI,GAAG,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YAChG,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;YAEnB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YAEd,IAAI,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;gBAAE,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YACrC,IAAI,EAAE,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;gBAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YAC7C,IAAI,EAAE,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;gBAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YAC7C,IAAI,EAAE,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;gBAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YAC7C,IAAI,EAAE,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;gBAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YAC7C,IAAI,EAAE,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;gBAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,4GAA4G;IAC5G,IAAI,QAAQ,GAAG,GAAG,GAAG,KAAK,EAAE,QAAQ,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;IAExD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QAEhC,uGAAuG;QACvG,IAAI,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC;QAC5G,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,IAAI,GAAG,GAAG,SAAS,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YAC7C,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAExC,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YACzC,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,OAAO,IAAI,MAAM,CAAC,IAAI,GAAG,SAAS,GAAG,GAAG,CAAC,CAAC;YAC1C,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAC1D,UAAU,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;QAC5B,CAAC;QAED,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,QAAQ,CAAC;QAC9B,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC;QAC/B,OAAO,GAAG,CAAC,CAAC;QAEZ,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,SAAS,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YAC7C,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAExC,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YACzC,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,OAAO,IAAI,MAAM,CAAC,IAAI,GAAG,SAAS,GAAG,GAAG,CAAC,CAAC;YAE1C,IAAI,CAAC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC;gBAAE,SAAS;YAE/C,MAAM,IAAI,GAAG,cAAc;kBACvB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,OAAO,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;YAEjH,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;gBACpB,QAAQ,GAAG,IAAI,CAAC;gBAChB,QAAQ,GAAG,IAAI,CAAC;gBAChB,OAAO,GAAG,GAAG,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IAE5B,MAAM,KAAK,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IACpC,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;IAClC,IAAI,IAAI,GAAG,KAAK,CAAC;IAEjB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,CAAC;YAC1E,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAEtB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YACnB,IAAI,EAAE,CAAC;QACT,CAAC;IACH,CAAC;IAED,kHAAkH;IAClH,OAAO,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACpD,CAAC;AAED,SAAS,KAAK,CAAC,KAAa,EAAE,MAAc,EAAE,KAAa;IACzD,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;AACpF,CAAC"}

package/dist/bvhBuilder.d.ts

@@ -0,0 +1,72 @@
+import { type PackedBvh } from "./bvh.js";
+/** What the page sends the worker: its own copy of the positions, transferred. */
+export interface BvhRequest {
+    id: number;
+    positions: Float32Array;
+    triangleCount: number;
+}
+/** The hierarchy back, its buffers transferred, or why it could not be built. */
+export type BvhResponse = {
+    id: number;
+    nodes: ArrayBuffer;
+    nodeCount: number;
+    order: Uint32Array;
+    maxDepth: number;
+} | {
+    id: number;
+    error: string;
+};
+/**
+ * What the renderer needs from a worker: the shape of a Web `Worker`. Any transport that carries structured clones and
+ * transfer lists fits, such as a `worker_threads` thread behind an adapter.
+ */
+export interface BvhWorker {
+    postMessage(message: BvhRequest, transfer?: Transferable[]): void;
+    terminate(): void;
+    onmessage: ((event: {
+        data: BvhResponse;
+    }) => void) | null;
+    onerror: ((event: {
+        message?: string;
+        preventDefault?(): void;
+    }) => void) | null;
+}
+export type BvhWorkerFactory = () => BvhWorker;
+/**
+ * Below this many triangles the hierarchy is built on the page: it takes a few milliseconds, less than copying the
+ * positions to a worker and the hierarchy back.
+ */
+export declare const BVH_WORKER_MIN_TRIANGLES = 50000;
+/** The worker this package ships, next to this module. Replace it when the bundler cannot follow the URL. */
+export declare function createDefaultBvhWorker(): BvhWorker;
+/** The worker's side of the exchange, apart from the worker itself so it can be run anywhere. */
+export declare function respondToBvhRequest(request: BvhRequest): {
+    response: BvhResponse;
+    transfer: Transferable[];
+};
+/**
+ * Builds hierarchies in a worker, so a large scene does not hold the page while it is split. The worker is started on
+ * the first build that needs it and kept for the next ones. If it cannot be started or fails to load, every build from
+ * then on happens on the page, with the same result: the worker only moves the work, it never changes it.
+ */
+export declare class BvhBuilder {
+    private readonly enabled;
+    private readonly createWorker;
+    private readonly minTriangles;
+    private worker;
+    private failed;
+    private disposed;
+    private next;
+    private readonly pending;
+    constructor(enabled: boolean, createWorker?: BvhWorkerFactory, minTriangles?: number);
+    /** Whether builds go to the worker: it is enabled and has not failed. */
+    get usesWorker(): boolean;
+    build(positions: Float32Array, triangleCount: number): Promise<PackedBvh>;
+    /** Stops the worker. Builds still waiting for it reject with an `AbortError`. */
+    dispose(): void;
+    private connect;
+    private receive;
+    /** The worker is gone for good: what it was building, and everything after, is built on the page instead. */
+    private fail;
+}
+//# sourceMappingURL=bvhBuilder.d.ts.map

package/dist/bvhBuilder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvhBuilder.d.ts","sourceRoot":"","sources":["../src/bvhBuilder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAY,KAAK,SAAS,EAAE,MAAM,UAAU,CAAC;AAEpD,kFAAkF;AAClF,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,YAAY,CAAC;IACxB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,iFAAiF;AACjF,MAAM,MAAM,WAAW,GACnB;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,WAAW,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,WAAW,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,GAC3F;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAElC;;;GAGG;AACH,MAAM,WAAW,SAAS;IACxB,WAAW,CAAC,OAAO,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC;IAClE,SAAS,IAAI,IAAI,CAAC;IAClB,SAAS,EAAE,CAAC,CAAC,KAAK,EAAE;QAAE,IAAI,EAAE,WAAW,CAAA;KAAE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC;IAC3D,OAAO,EAAE,CAAC,CAAC,KAAK,EAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,cAAc,CAAC,IAAI,IAAI,CAAA;KAAE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC;CAClF;AAED,MAAM,MAAM,gBAAgB,GAAG,MAAM,SAAS,CAAC;AAE/C;;;GAGG;AACH,eAAO,MAAM,wBAAwB,QAAS,CAAC;AAE/C,6GAA6G;AAC7G,wBAAgB,sBAAsB,IAAI,SAAS,CAKlD;AAED,iGAAiG;AACjG,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,UAAU,GAAG;IAAE,QAAQ,EAAE,WAAW,CAAC;IAAC,QAAQ,EAAE,YAAY,EAAE,CAAA;CAAE,CAa5G;AASD;;;;GAIG;AACH,qBAAa,UAAU;IAQnB,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,YAAY;IAC7B,OAAO,CAAC,QAAQ,CAAC,YAAY;IAT/B,OAAO,CAAC,MAAM,CAA0B;IACxC,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,IAAI,CAAK;IACjB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA8B;gBAGnC,OAAO,EAAE,OAAO,EAChB,YAAY,GAAE,gBAAyC,EACvD,YAAY,SAA2B;IAE1D,yEAAyE;IACzE,IAAI,UAAU,IAAI,OAAO,CAExB;IAED,KAAK,CAAC,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC;IAiBzE,iFAAiF;IACjF,OAAO;IAUP,OAAO,CAAC,OAAO;IAyBf,OAAO,CAAC,OAAO;IAaf,6GAA6G;IAC7G,OAAO,CAAC,IAAI;CAoBb"}

package/dist/bvhBuilder.js

@@ -0,0 +1,126 @@
+import { buildBvh } from "./bvh.js";
+/**
+ * Below this many triangles the hierarchy is built on the page: it takes a few milliseconds, less than copying the
+ * positions to a worker and the hierarchy back.
+ */
+export const BVH_WORKER_MIN_TRIANGLES = 50_000;
+/** The worker this package ships, next to this module. Replace it when the bundler cannot follow the URL. */
+export function createDefaultBvhWorker() {
+    if (typeof Worker === "undefined")
+        throw new Error("Web Workers are unavailable here: pass `createBvhWorker`, or `bvhWorker: false`.");
+    return new Worker(new URL("./bvhWorker.js", import.meta.url), { type: "module" });
+}
+/** The worker's side of the exchange, apart from the worker itself so it can be run anywhere. */
+export function respondToBvhRequest(request) {
+    try {
+        const bvh = buildBvh(request.positions, request.triangleCount);
+        return {
+            response: { id: request.id, ...bvh },
+            transfer: [bvh.nodes, bvh.order.buffer],
+        };
+    }
+    catch (error) {
+        const message = error instanceof Error ? error.message : String(error);
+        return { response: { id: request.id, error: message }, transfer: [] };
+    }
+}
+/**
+ * Builds hierarchies in a worker, so a large scene does not hold the page while it is split. The worker is started on
+ * the first build that needs it and kept for the next ones. If it cannot be started or fails to load, every build from
+ * then on happens on the page, with the same result: the worker only moves the work, it never changes it.
+ */
+export class BvhBuilder {
+    enabled;
+    createWorker;
+    minTriangles;
+    worker = null;
+    failed = false;
+    disposed = false;
+    next = 0;
+    pending = new Map();
+    constructor(enabled, createWorker = createDefaultBvhWorker, minTriangles = BVH_WORKER_MIN_TRIANGLES) {
+        this.enabled = enabled;
+        this.createWorker = createWorker;
+        this.minTriangles = minTriangles;
+    }
+    /** Whether builds go to the worker: it is enabled and has not failed. */
+    get usesWorker() {
+        return this.enabled && !this.failed && !this.disposed;
+    }
+    build(positions, triangleCount) {
+        if (this.disposed)
+            return Promise.reject(abortError());
+        const worker = this.usesWorker && triangleCount >= this.minTriangles ? this.connect() : null;
+        if (!worker)
+            return Promise.resolve(buildBvh(positions, triangleCount));
+        const id = this.next++;
+        // The page still uploads the positions, so the worker gets a copy it can own.
+        const copy = positions.slice(0, triangleCount * 9);
+        return new Promise((resolve, reject) => {
+            this.pending.set(id, { positions, triangleCount, resolve, reject });
+            worker.postMessage({ id, positions: copy, triangleCount }, [copy.buffer]);
+        });
+    }
+    /** Stops the worker. Builds still waiting for it reject with an `AbortError`. */
+    dispose() {
+        this.disposed = true;
+        this.worker?.terminate();
+        this.worker = null;
+        for (const pending of this.pending.values())
+            pending.reject(abortError());
+        this.pending.clear();
+    }
+    connect() {
+        if (this.worker)
+            return this.worker;
+        let worker;
+        try {
+            worker = this.createWorker();
+        }
+        catch (error) {
+            this.fail(error instanceof Error ? error.message : String(error));
+            return null;
+        }
+        worker.onmessage = event => this.receive(event.data);
+        worker.onerror = event => {
+            event.preventDefault?.();
+            this.fail(event.message || "the worker failed to load");
+        };
+        this.worker = worker;
+        return worker;
+    }
+    receive(response) {
+        const pending = this.pending.get(response.id);
+        if (!pending)
+            return;
+        this.pending.delete(response.id);
+        if ("error" in response)
+            pending.reject(new Error(`GPU renderer: building the BVH failed: ${response.error}`));
+        else
+            pending.resolve({
+                nodes: response.nodes, nodeCount: response.nodeCount, order: response.order, maxDepth: response.maxDepth,
+            });
+    }
+    /** The worker is gone for good: what it was building, and everything after, is built on the page instead. */
+    fail(reason) {
+        if (!this.failed)
+            console.warn(`GPU renderer: the BVH worker is unavailable (${reason}); building on the main thread instead.`);
+        this.failed = true;
+        this.worker?.terminate();
+        this.worker = null;
+        const waiting = [...this.pending.values()];
+        this.pending.clear();
+        for (const pending of waiting) {
+            try {
+                pending.resolve(buildBvh(pending.positions, pending.triangleCount));
+            }
+            catch (error) {
+                pending.reject(error instanceof Error ? error : new Error(String(error)));
+            }
+        }
+    }
+}
+function abortError() {
+    return Object.assign(new Error("The renderer was disposed."), { name: "AbortError" });
+}
+//# sourceMappingURL=bvhBuilder.js.map

package/dist/bvhBuilder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvhBuilder.js","sourceRoot":"","sources":["../src/bvhBuilder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAkB,MAAM,UAAU,CAAC;AA2BpD;;;GAGG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,MAAM,CAAC;AAE/C,6GAA6G;AAC7G,MAAM,UAAU,sBAAsB;IACpC,IAAI,OAAO,MAAM,KAAK,WAAW;QAC/B,MAAM,IAAI,KAAK,CAAC,kFAAkF,CAAC,CAAC;IAEtG,OAAO,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,gBAAgB,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAyB,CAAC;AAC5G,CAAC;AAED,iGAAiG;AACjG,MAAM,UAAU,mBAAmB,CAAC,OAAmB;IACrD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;QAE/D,OAAO;YACL,QAAQ,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE;YACpC,QAAQ,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;SACxC,CAAC;IACJ,CAAC;IAAC,OAAM,KAAK,EAAE,CAAC;QACd,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEvE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IACxE,CAAC;AACH,CAAC;AASD;;;;GAIG;AACH,MAAM,OAAO,UAAU;IAQF;IACA;IACA;IATX,MAAM,GAAqB,IAAI,CAAC;IAChC,MAAM,GAAG,KAAK,CAAC;IACf,QAAQ,GAAG,KAAK,CAAC;IACjB,IAAI,GAAG,CAAC,CAAC;IACA,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IAEtD,YACmB,OAAgB,EAChB,eAAiC,sBAAsB,EACvD,eAAe,wBAAwB;QAFvC,YAAO,GAAP,OAAO,CAAS;QAChB,iBAAY,GAAZ,YAAY,CAA2C;QACvD,iBAAY,GAAZ,YAAY,CAA2B;IAAG,CAAC;IAE9D,yEAAyE;IACzE,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;IACxD,CAAC;IAED,KAAK,CAAC,SAAuB,EAAE,aAAqB;QAClD,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC;QAEvD,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,IAAI,aAAa,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QAE7F,IAAI,CAAC,MAAM;YAAE,OAAO,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC,CAAC;QAExE,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACvB,8EAA8E;QAC9E,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;QAEnD,OAAO,IAAI,OAAO,CAAY,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YAChD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;YACpE,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,aAAa,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;IACL,CAAC;IAED,iFAAiF;IACjF,OAAO;QACL,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QAEnB,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAAE,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC;QAE1E,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAEO,OAAO;QACb,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC;QAEpC,IAAI,MAAiB,CAAC;QAEtB,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QAC/B,CAAC;QAAC,OAAM,KAAK,EAAE,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAElE,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,CAAC,SAAS,GAAG,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAErD,MAAM,CAAC,OAAO,GAAG,KAAK,CAAC,EAAE;YACvB,KAAK,CAAC,cAAc,EAAE,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,2BAA2B,CAAC,CAAC;QAC1D,CAAC,CAAC;QAEF,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QAErB,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,OAAO,CAAC,QAAqB;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAE9C,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAEjC,IAAI,OAAO,IAAI,QAAQ;YAAE,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,0CAA0C,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;;YAC1G,OAAO,CAAC,OAAO,CAAC;gBACnB,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,SAAS,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ;aACzG,CAAC,CAAC;IACL,CAAC;IAED,6GAA6G;IACrG,IAAI,CAAC,MAAc;QACzB,IAAI,CAAC,IAAI,CAAC,MAAM;YACd,OAAO,CAAC,IAAI,CAAC,gDAAgD,MAAM,yCAAyC,CAAC,CAAC;QAEhH,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QAEnB,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAE3C,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QAErB,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC;YACtE,CAAC;YAAC,OAAM,KAAK,EAAE,CAAC;gBACd,OAAO,CAAC,MAAM,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED,SAAS,UAAU;IACjB,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,4BAA4B,CAAC,EAAE,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;AACxF,CAAC"}

package/dist/bvhWorker.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=bvhWorker.d.ts.map

package/dist/bvhWorker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvhWorker.d.ts","sourceRoot":"","sources":["../src/bvhWorker.ts"],"names":[],"mappings":""}

package/dist/bvhWorker.js

@@ -0,0 +1,8 @@
+// The worker `createDefaultBvhWorker` starts: it builds one hierarchy per message, off the page's thread.
+import { respondToBvhRequest } from "./bvhBuilder.js";
+const scope = self;
+scope.onmessage = event => {
+    const { response, transfer } = respondToBvhRequest(event.data);
+    scope.postMessage(response, transfer);
+};
+//# sourceMappingURL=bvhWorker.js.map

package/dist/bvhWorker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvhWorker.js","sourceRoot":"","sources":["../src/bvhWorker.ts"],"names":[],"mappings":"AAAA,0GAA0G;AAC1G,OAAO,EAAE,mBAAmB,EAAqC,MAAM,iBAAiB,CAAC;AAEzF,MAAM,KAAK,GAAG,IAGb,CAAC;AAEF,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,EAAE;IACxB,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,mBAAmB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAE/D,KAAK,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;AACxC,CAAC,CAAC"}

package/dist/camera.d.ts

@@ -0,0 +1,29 @@
+import { Matrix4 } from "three";
+import type { CameraState } from "./upstream.js";
+/**
+ * Everything the renderer derives from a camera snapshot. Rays are cast through the inverse of the camera's own
+ * projection, so zoom, film offsets, `setViewOffset` and any custom projection come out exactly as Three draws them,
+ * and so do the near and far planes, which clip a camera ray the way they clip a rasterized fragment.
+ */
+export interface CameraMatrices {
+    /** Column-major, as Three stores them. */
+    cameraWorld: number[];
+    view: number[];
+    projection: number[];
+    inverseProjection: number[];
+    orthographic: boolean;
+    near: number;
+    far: number;
+    /** Vertical field of view in degrees, for the lens; 50 when the snapshot has none. */
+    fov: number;
+    position: number[];
+}
+/** The camera's projection: the snapshot's own when it has one, otherwise rebuilt from its parameters. */
+export declare function cameraProjection(camera: CameraState, aspect: number): Matrix4;
+export declare function cameraMatrices(camera: CameraState, width: number, height: number): CameraMatrices;
+/** A column-major 4x4 matrix times a point, with the w it produced. */
+export declare function transform4(matrix: ArrayLike<number>, x: number, y: number, z: number, w?: number): number[];
+/** A point in clip space back to world space, through the camera that produced it. */
+export declare function clipToWorld(camera: CameraMatrices, clip: readonly number[]): number[];
+export declare function worldToClip(camera: CameraMatrices, point: readonly number[]): number[];
+//# sourceMappingURL=camera.d.ts.map

package/dist/camera.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"camera.d.ts","sourceRoot":"","sources":["../src/camera.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAyC,MAAM,OAAO,CAAC;AACvE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAEjD;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,0CAA0C;IAC1C,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,YAAY,EAAE,OAAO,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;IACZ,sFAAsF;IACtF,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,0GAA0G;AAC1G,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAW7E;AAED,wBAAgB,cAAc,CAAC,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,cAAc,CAgBjG;AAED,uEAAuE;AACvE,wBAAgB,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,SAAI,GAAG,MAAM,EAAE,CAOtG;AAED,sFAAsF;AACtF,wBAAgB,WAAW,CAAC,MAAM,EAAE,cAAc,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,CAKrF;AAED,wBAAgB,WAAW,CAAC,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,CAItF"}

package/dist/camera.js

@@ -0,0 +1,48 @@
+import { Matrix4, OrthographicCamera, PerspectiveCamera } from "three";
+/** The camera's projection: the snapshot's own when it has one, otherwise rebuilt from its parameters. */
+export function cameraProjection(camera, aspect) {
+    if (camera.projectionMatrix)
+        return new Matrix4().fromArray(camera.projectionMatrix);
+    const projection = camera.type === "orthographic"
+        ? new OrthographicCamera(camera.left, camera.right, camera.top, camera.bottom, camera.near, camera.far)
+        : new PerspectiveCamera(camera.fov ?? 50, camera.aspect ?? aspect, camera.near, camera.far);
+    projection.zoom = camera.zoom ?? 1;
+    projection.updateProjectionMatrix();
+    return projection.projectionMatrix;
+}
+export function cameraMatrices(camera, width, height) {
+    const world = new Matrix4().fromArray(camera.matrixWorld);
+    const projection = cameraProjection(camera, width / height);
+    const orthographic = camera.type === "orthographic" || (projection.elements[11] === 0 && projection.elements[15] === 1);
+    return {
+        cameraWorld: world.toArray(),
+        view: world.clone().invert().toArray(),
+        projection: projection.toArray(),
+        inverseProjection: projection.clone().invert().toArray(),
+        orthographic,
+        near: camera.near,
+        far: camera.far,
+        fov: camera.fov ?? 50,
+        position: [camera.matrixWorld[12], camera.matrixWorld[13], camera.matrixWorld[14]],
+    };
+}
+/** A column-major 4x4 matrix times a point, with the w it produced. */
+export function transform4(matrix, x, y, z, w = 1) {
+    return [
+        matrix[0] * x + matrix[4] * y + matrix[8] * z + matrix[12] * w,
+        matrix[1] * x + matrix[5] * y + matrix[9] * z + matrix[13] * w,
+        matrix[2] * x + matrix[6] * y + matrix[10] * z + matrix[14] * w,
+        matrix[3] * x + matrix[7] * y + matrix[11] * z + matrix[15] * w,
+    ];
+}
+/** A point in clip space back to world space, through the camera that produced it. */
+export function clipToWorld(camera, clip) {
+    const view = transform4(camera.inverseProjection, clip[0], clip[1], clip[2], clip[3]);
+    const w = view[3] || 1e-30;
+    return transform4(camera.cameraWorld, view[0] / w, view[1] / w, view[2] / w).slice(0, 3);
+}
+export function worldToClip(camera, point) {
+    const view = transform4(camera.view, point[0], point[1], point[2]);
+    return transform4(camera.projection, view[0], view[1], view[2], view[3]);
+}
+//# sourceMappingURL=camera.js.map

package/dist/camera.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"camera.js","sourceRoot":"","sources":["../src/camera.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,OAAO,CAAC;AAsBvE,0GAA0G;AAC1G,MAAM,UAAU,gBAAgB,CAAC,MAAmB,EAAE,MAAc;IAClE,IAAI,MAAM,CAAC,gBAAgB;QAAE,OAAO,IAAI,OAAO,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;IAErF,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,KAAK,cAAc;QAC/C,CAAC,CAAC,IAAI,kBAAkB,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC;QACvG,CAAC,CAAC,IAAI,iBAAiB,CAAC,MAAM,CAAC,GAAG,IAAI,EAAE,EAAE,MAAM,CAAC,MAAM,IAAI,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;IAE9F,UAAU,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC;IACnC,UAAU,CAAC,sBAAsB,EAAE,CAAC;IAEpC,OAAO,UAAU,CAAC,gBAAgB,CAAC;AACrC,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,MAAmB,EAAE,KAAa,EAAE,MAAc;IAC/E,MAAM,KAAK,GAAG,IAAI,OAAO,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IAC1D,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC;IAC5D,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,KAAK,cAAc,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IAExH,OAAO;QACL,WAAW,EAAE,KAAK,CAAC,OAAO,EAAE;QAC5B,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE;QACtC,UAAU,EAAE,UAAU,CAAC,OAAO,EAAE;QAChC,iBAAiB,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE;QACxD,YAAY;QACZ,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,GAAG,EAAE,MAAM,CAAC,GAAG;QACf,GAAG,EAAE,MAAM,CAAC,GAAG,IAAI,EAAE;QACrB,QAAQ,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;KACnF,CAAC;AACJ,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,UAAU,CAAC,MAAyB,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAC,GAAG,CAAC;IAC1F,OAAO;QACL,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC;QAC9D,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC;QAC9D,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC;QAC/D,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC;KAChE,CAAC;AACJ,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,WAAW,CAAC,MAAsB,EAAE,IAAuB;IACzE,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;IAE3B,OAAO,UAAU,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3F,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,MAAsB,EAAE,KAAwB;IAC1E,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnE,OAAO,UAAU,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3E,CAAC"}