"685352" . . . "RIV/00216224:14330/01:00005213!RIV/2002/GA0/143302/N" . "2"^^ . . "Plzen" . "P(GV201/98/K041), Z(MSM 143300003)" . "Plzen" . . "237" . . "0"^^ . "2"^^ . "0"^^ . "14330" . "Nechv\u00EDle, Karel" . . . . . "80-7082-712-4" . "BSP, partitioning, hyperrectangle"@en . "WSCG' 2001, Conference proceedings" . "Tobola, Petr" . . . . "[B8A0EE1788E7]" . . "8"^^ . . "Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density"@en . "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."@en . . "2001-01-01+01:00"^^ . . "RIV/00216224:14330/01:00005213" . "Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density" . . "Z\u00E1pado\u010Desk\u00E1 univerzita v Plzni" . "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." . "Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density"@en . . "Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density" . .