Advertisement
Published in:
2009 | OriginalPaper | Chapter
Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy
Authors : Mark de Berg, Peter Hachenberger
Published in: Experimental Algorithms
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.