Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density
Petr Tobola, Karel Nechvíle · Digital Library (University of West Bohemia) · 2001
We consider the problem of constructing of binary space partitions (BSP) for a set S of n hy-perrectangles in space with constant dimension. If the set S fulfills the low directional density condition defined in this paper then the resultant BSP has 0(n) size and it can be constructed in 0(n log2 n) time in 1113. The low directional density condition defines a new class of objects which we are able to construct a linear BSP for. The method is quite simple and it should be appropriate for practical implementation.