OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Improved Computational Methods for Ray Tracing
ACM Transactions on Graphics (TOG)
BD-tree: output-sensitive collision detection for reduced deformable models
ACM SIGGRAPH 2004 Papers
Multi-core collision detection between deformable models
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
| Hi-index | 0.00 |
We propose a model to analyze the expected running time of hierarchical collision detection that utilizes bounding volume hierarchies (BVHs). It depends on two characteristic parameters: the overlap of the root BVs and the BV diminishing factor within the hierarchies. We show that the average running time is in O(n) or even in O(log n) for realistic cases, where n is the number of leaves. Our theoretical analysis is verified by practical experiments.