Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density

Date issued

2001

Journal Title

Journal ISSN

Volume Title

Publisher

University of West Bohemia

Abstract

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.

Description

Subject(s)

binární dělení prostoru, hyperobdélník

Citation

WSCG '2001: Conference proceedings: The 9-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2001: University of West Bohemia, Plzen, Czech Republic, February 5.-9., 2001, p. 237-244.
OPEN License Selector