Efficient Collision Detection of Complex Deformable Models using AABB Trees
暂无分享,去创建一个
[1] Gabriel Zachmann,et al. Rapid collision detection by dynamically aligned DOP-trees , 1998, Proceedings. IEEE 1998 Virtual Reality Annual International Symposium (Cat. No.98CB36180).
[2] Yoshifumi Kitamura,et al. A simple and efficient method for accurate collision detection among deformable polyhedral objects in arbitrary motion , 1995, Proceedings Virtual Reality Annual International Symposium '95.
[3] Philip M. Hubbard,et al. Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.
[4] M. Levas. OBBTree : A Hierarchical Structure for Rapid Interference Detection , .
[5] Donald P. Greenberg,et al. Improved Computational Methods for Ray Tracing , 1984, TOGS.
[6] Richard L. Grimsdale,et al. Collision Detection for Animation using Sphere‐Trees , 1995, Comput. Graph. Forum.
[7] Ken Shoemake,et al. Uniform Random Rotations , 1992, Graphics Gems III.
[8] Tomas Akenine-Möller,et al. A Fast Triangle-Triangle Intersection Test , 1997, J. Graphics, GPU, & Game Tools.
[9] Joseph S. B. Mitchell,et al. Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..
[10] Hugh J. Watson,et al. Using EIS to respond to dynamic business conditions , 1995, Decis. Support Syst..
[11] S B MitchellJoseph,et al. Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998 .