Documentation - v19.16.0-dev
    Preparing search index...
    • Builds a tree over boxes, top-down by the surface area heuristic: each node splits its leaves where the sum, over both sides, of their box area times their count is the lowest, among 16 bins of the leaves' centres per axis. Pure, on typed arrays: runs in a worker as well.

      Parameters

      • leafBoxes: Float32Array

        6 floats per leaf (min xyz, max xyz); one leaf at least. Kept as the subtree's leafBoxes.

      Returns BoxSubtree