SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Spatial Data Structures: Concepts and Design Choices
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
Proceedings of the Sixth International Conference on Data Engineering
Rapid Collision Detection by Dynamically Aligned DOP-Trees
VRAIS '98 Proceedings of the Virtual Reality Annual International Symposium
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Efficient c-oriented range searching with DOP-trees
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
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.