Linear size binary space partitions for fat objects

Abstract

We describe a new method for constructing binary space partitions for scenes in arbitrary dimensions. If the objects in the scene are fat (that is, they are not extremely long and skinny) then the BSP has linear size and it can be constructed in O(n log2 n) time, where n is the number of objects. In fact, the method produces a linear size BSP for a more general class of scenes, namely scenes that satisfy the boundingbox-fitness condition--a property that we suspect many realistic scenes exhibit. The method is very simple and should perform well in practice.