1Pilar Herrero,Chris Greenhalgh,Angélica Antonio. Modelling the Sensory Abilities of Intelligent Virtual Agents[J] 2005,Autonomous Agents and Multi - Agent Systems(3):361～385
2Avril Q, Gouranton V, Arnaldi B. Dynamic adapta- tion of broad phase collision detection algorithms [C] // IEEE International Symposium on Virtual Reality Innovation. Singapore: IEEE Computer Society Pub- lishing, 2011:41-47.
3Zhao W, Li L. A new K-DOPs collision detection al- gorithms improved by GA [C]// lth International Conference on Wireless Communications and Applica- tions. Sanya: Springer Verlag Publishing, 2012: 58- 68.
4Anderson M, Ronan B, Daniel T. Efficient collision detection with in deforming spherical sliding contact [J]. IEEE Transactions on Visualization and Computer Graphics, 2007,13(3) : 518-529.
5Spillmann J, Becket M, Teschner M. Efficient up- dates of bounding sphere hierarchies for geometrically deformable models [J]. Journal of Visual Communica- tion and Image Representation, 2007,18 ( 2 ) : 101-108.
6Luque R, Comba J, Freitas C. Broad-phase coIIision detection using semi-adjusting BSP-trees [C]//Sym- posium on Interactive 3D Graphics and Games. Wash- ington: Association for Computing Machinery Pub- lishing, 2005 : 179-186.
7Naylor B F. Interactive solid geometry via partitioning trees [C]//in Graphics Interface. Toronto : Canadian In- formation Processing Publishing, 1992 : 11-18.
8Bentley J L, Friedman J H. Data structures for range searching [J]. Computing surveys, 1979,11 (4) : 397- 409.
9Wong T H, Leach G, Zambetta F. Virtual subdivi- sion for GPU based collision detection of deformable objects using a uniform grid [J]. Visual Computer, 2012, 28:829-838.
10Fujimotoa K, Kimuraa N, Moriyaa T. Method for fast detecting the intersection of a plane and a cube in an octree structure to find point sets within a convex region Intelligent Robots and Computer Vision [C]// Algorithms and Techniques, Burlingame. Burlingame.. SPIE Publishing, 2012 : 1-10.
