Dynamic Bounding Volume Heirarchies

Its similar to a BSP but instead of cutting the view in to planes and finding polygons you have cuboid shapes which are nested in to larger cuboids for navigation.

• Implementation added to Godot (github)

• "Negative maximum" trick to do AABB tests in one SIMD operation
• Convex hull culling to further reduce which leaves to check

• Computing Dynamic Changes to BSP Trees (doi)
• Computing Dynamic Changes to BSP Trees (local notes)

• Incrementally removed polygons from tree and re-adds them on move