A [[Binary Spatial Partitioning Tree]] is a [[Data Structure]] for [[Spatial Partitioning]] using a [[Binary Tree]]. This recursively divides space into two halves. This differs from a [[Bounding Volume Hierarchy]] as there is *no overlapping* between two partitions on the same level. This type of tree worlds directly on objects ([[Triangular Mesh|Mesh]] / [[Triangle|Triangles]]). The construction of a BSP [[Tree]] is expensive, making it best for static objects.i