Abstract
We introduce a new type of bounding-volume hierarchy, the c-oriented rotated-box tree, or c-rb-tree for short. A c-rb-tree uses boxes as bounding volumes, whose orientations come from a fixed set of predefined box orientations. We theoretically and experimentally compare our new c-rb-tree to two existing bounding-volumes hierarchies, namely c-dop-tree and box-trees. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
De Berg, M., & Hachenberger, P. (2009). Rotated-box trees: A lightweight c-oriented bounding-volume hierarchy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5526 LNCS, pp. 63–75). https://doi.org/10.1007/978-3-642-02011-7_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
