Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy

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-trees and box-trees.

• Type: Conference
• Year: 2009
• Where: WEA
• Authors: Mark de Berg, Peter Hachenberger
• Keywords: Algorithms, Box Orientations, C-oriented Rotated-box Tree, C-rb-tree Uses Boxes, WEA 2009