Abstract
A box-tree is a bounding-volume hierarchy that uses axis-aligned boxes as bounding volumes. The query complexity of a box-tree with respect to a given type of query is the maximum number of nodes visited when answering such a query. We describe several new algorithms for constructing box-trees with small worst-case query complexity with respect to queries with axis-parallel boxes and with points. We also prove lower bounds on the Worst-case query complexity for box-trees, which show that our results are optimal or close to optimal. Finally, we present algorithms to convert box-trees to R-trees, resulting in R-trees with (almost) optimal query complexity.
Original language | English |
---|---|
Pages (from-to) | 291-312 |
Journal | Discrete & Computational Geometry |
Volume | 28 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2002 |
Subject classification (UKÄ)
- Computer Science