Title: Linear BSP trees for sets of hyperrectangles with low directional density
Authors: Tobola, Petr
Nechvíle, Karel
Citation: Journal of WSCG. 2001, vol. 9, no. 1-3.
Issue Date: 2001
Publisher: Václav Skala - UNION Agency
Document type: článek
URI: http://hdl.handle.net/11025/15784
ISSN: 1213-6972 (print)
1213-6980 (CD-ROM)
1213-6964 (online)
Keywords: BSP;dělení;hyperobdélník
Keywords in different language: BSP;partitioning;hyperrectangle
Abstract in different language: 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 ful lls the low directional density condition de ned in this paper then the resultant BSP has O(n) size and it can be constructed in O(n log2 n) time in R3 . The low directional density condition de nes 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.
Rights: © Václav Skala - UNION Agency
Appears in Collections:Volume 9, number 1-3 (2001)

Files in This Item:
File Description SizeFormat 
R321.pdfPlný text243,93 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/15784

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.