Dynamic Tree Improvements

Dynamic Tree Insertion Dynamic tree insertion can be expensive if you try to optimize for some metric such as the surface area heuristic (SAH). The SAH tries find a node configuration that minimizes the total surface area of all internal nodes. The idea is to create fewer node visits for ray casts on average.
Insertion affects the surface area incrementally so it is essentially a greedy algorithm no matter how exhausive the search.