@pmndrs/bvh
    Preparing search index...

    Interface BvhPrimitiveLayout

    A primitive tree's data (the nodes in the GPU layout, the records in tree order).

    interface BvhPrimitiveLayout {
        bounds: Float32Array;
        end: number;
        kind: BvhPrimitiveKind;
        mode: BvhSegmentMode;
        nodeCount: number;
        nodes: ArrayBuffer;
        primitiveCount: number;
        primitives: ArrayBuffer;
        start: number;
    }
    Index
    bounds: Float32Array

    Box around every primitive, [minX, minY, minZ, maxX, maxY, maxZ] (inverted when empty).

    end: number

    For segments: how the entries pair up ('segments' for points, where it means nothing).

    nodeCount: number
    nodes: ArrayBuffer

    nodeCount 64-byte nodes (GPU_LAYOUT_NODE_WORD); node 0 is the root. Empty for a tree of no primitives.

    primitiveCount: number
    primitives: ArrayBuffer

    primitiveCount records in tree order: POINT_RECORD_BYTES or SEGMENT_RECORD_BYTES each.

    start: number

    The entries the tree covers, [start, end).