Linear Binary Space Partitions and the Hierarchy of Object Classes
| Authors | |
|---|---|
| Year of publication | 2003 |
| Type | Article in Proceedings |
| Conference | Abstracts for the 15th Canadian Conference on Computational Geometry |
| MU Faculty or unit | |
| Citation | |
| Field | Informatics |
| Keywords | BSP; Tree; Partitioning; Object; Class; Hierarchy |
| Description | We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for such settings, which support design of effective algorithms. We extend the existing the de Berg hierarchy of classes by the definition of new classes derived from that one and we show desirability of such an extension. Moreover we propose a new algorithm, which works on generalized $\lambda$-low density scenes (defined in this paper) and provides BSP tree of linear size. The tree can be constructed in $O(n \log^2 n)$ time and space, where n is the number of objects. Moreover, we can trade-off between size and balance of the BSP tree fairly simply. |
| Related projects: |