@pmndrs/bvh
    Preparing search index...

    Interface SahTree

    interface SahTree {
        bounds: Float32Array;
        leafCount: number;
        maxDepth: number;
        nodeCount: number;
        nodes: ArrayBuffer;
        order: Uint32Array;
        parents: Uint32Array;
    }
    Index
    bounds: Float32Array

    [minX, minY, minZ, maxX, maxY, maxZ] around everything.

    leafCount: number
    maxDepth: number

    Levels of nodes on the longest root-to-leaf path (a lone root counts as 1). Bounds the traversal stack use.

    nodeCount: number
    nodes: ArrayBuffer

    nodeCount nodes in the layout from gpu-layout.ts. Child indices are relative to this tree.

    order: Uint32Array

    order[i] is the input primitive that must be stored at position i. A leaf's index and count refer to positions in this order.

    parents: Uint32Array

    Parent node of every node; the root has NO_PARENT. Only the refit pass reads this.