Informace o publikaci
Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density
| Autoři | |
|---|---|
| Rok publikování | 2001 |
| Druh | Článek ve sborníku |
| Konference | WSCG' 2001, Conference proceedings |
| Fakulta / Pracoviště MU | |
| Citace | |
| Obor | Počítačový hardware a software |
| Klíčová slova | BSP; partitioning; hyperrectangle |
| Popis | We consider the problem of constructing of binary space partitions (BSP) for a set S of n hyperrectangles in space with constant dimension. If the set S fulfills the low directional density condition defined in this paper then the resultant BSP has O(n) size and it can be constructed effectively. 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. |
| Související projekty: |