Sorts primitives along a Morton curve and builds the hierarchy from the resulting bit patterns, which parallelizes perfectly and rebuilds in milliseconds at some cost in tree quality.
supersedescorrects · extends
classifiesspecializes · part-of
substitutes forapproximates · alternative-to
depends onrequires · validates
Colour is the family; a dashed line is the second member of it.
Drag to pan · scroll to zoom · click a node to open it
This node
approximatesis a cheaper stand-in for Surface Area HeuristicMorton order instead of a cost-driven split search
References
Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees — Karras — 2012