| Title: | Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density |
| Authors: | Tobola, Petr Nechvíle, Karel |
| 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. |
| Issue Date: | 2001 |
| Publisher: | University of West Bohemia |
| Document type: | konferenční příspěvek conferenceObject |
| URI: | http://wscg.zcu.cz/wscg2001/Papers_2001/R321.pdf http://hdl.handle.net/11025/11275 |
| ISBN: | 80-7082-713-0 |
| ISSN: | 1213-6972 |
| Keywords: | binární dělení prostoru;hyperobdélník |
| Keywords in different language: | binary space partitioning;hyperrectangle |
| 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. |
| Rights: | © University of West Bohemia |
| Appears in Collections: | WSCG '2001: Conference proceedings |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Tobola.pdf | Plný text | 243,93 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11275Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.