crashcat docs
    Preparing search index...

    Enumeration BvhSplitStrategy

    bvh split strategies

    Index

    Enumeration Members

    Enumeration Members

    AVERAGE: 1

    AVERAGE: Split at arithmetic mean of centers.

    • Fast: O(n) iteration to compute mean
    • Can create unbalanced splits on skewed distributions
    CENTER: 0

    CENTER: Split at midpoint of center bounds.

    • Fast: O(n) with simple min/max computation
    • Good balance for most geometries
    SAH: 2

    SAH: Surface Area Heuristic with binning.

    • Slow: O(n) with high constant factor (binning + cost evaluation)
    • Best quality: optimal expected query cost
    • Use for static meshes queried many times