The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Fast collision detection using QuOSPO trees
I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
Real-Time Rendering
Collision Detection for Interactive Graphics Applications
IEEE Transactions on Visualization and Computer Graphics
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Efficient collision detection of complex deformable models using AABB trees
Journal of Graphics Tools
Rapid Collision Detection by Dynamically Aligned DOP-Trees
VRAIS '98 Proceedings of the Virtual Reality Annual International Symposium
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
BD-tree: output-sensitive collision detection for reduced deformable models
ACM SIGGRAPH 2004 Papers
Fast continuous collision detection for articulated models
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Interactive Collision Detection for Deformable Models Using Streaming AABBs
IEEE Transactions on Visualization and Computer Graphics
Continuous Collision Detection for Ellipsoids
IEEE Transactions on Visualization and Computer Graphics
Industrial application of exact Boolean operations for meshes
Proceedings of the 26th Spring Conference on Computer Graphics
Development of real-time virtual environment with hierarchical construction
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
An Image-Space Approach for Collision Detection Between Multiple Volumes and a Surface
International Journal of Creative Interfaces and Computer Graphics
Hi-index | 0.00 |
We present an efficient algorithm for collision detection between static rigid objects using a dual bounding volume hierarchy which consists of an oriented bounding box (OBB) tree enhanced with bounding spheres. This approach combines the compactness of OBBs and the simplicity of spheres. The majority of distant objects are separated using the simpler sphere tests. The remaining objects are in close proximity, where some separation axes are significantly more effective than others. We select 5 from among the 15 potential separating axes for OBBs. Experimental results show that our algorithm achieves considerable speedup in most cases with respect to the existing OBB algorithms.