1[1]Cameron S A.Collision detection by four-dimensional intersection testing[J].IEEE Trans Robotics and Automat,1990;6(3):291-302
2[2]Hubbard P M.Collision Detection for Interactive Graphics Applications[J].IEEE Trans Visualization and Computer Graphics, 1995; 1 (3):218-230
3[3]Bouma H' ,Vanecek G.Collision detection and analysis in a physical based simulation[C]Jn:Eurographies Workshop on Animation and Simu lation ,Vienna, 1991:191
4[4]Thomas F,Torras C.Interference detection between non-convex polyhedra revisited with a practical aim[ClAn:Proceedings of the IEEE International Conference on Robotics and Automation,San Diegn,CA,1994: 587-594
5[5]Chazelle B,Palios L. Decomposition algorithms in geometry[C].In :Bajaj C,ed.Algebraie Geometry and its Applications, Berlin Springer: 1994:419-447
6[6]Boyse JW.lnterference detection among solids and surfaces[J].Communication of the Association of the Computing Machinery, 1979;22( 1 ):3-9
7[7]Lin MC.Canny JF.A fast algorithm for incremental distance calcula-tion[C].In :Proceedings of the IEEE International Conference nn Ro-botics and Automation,Sacramento,CA, 1991: 1008-1014
8[8]Chazelle B.Convex partitions of polyhedra:a lower bound and a worstcase optimal algorithm[J].SIAM Journal on Computing, 1984; 13:488-507
9[9]Bajaj C,Dey T. Convex decomposition of polyhedra and robustness[J]. SIAM Journal on Computing, 1992;21(2) :339-364
10[10]Gottschalk S,Lin M,Manocha D.OBB-Tree:A Hierarchical Structure for Rapid Interference Detection[C].In:Proceedings of ACM S1GGRA-PH 96, New Orlean: LA, 1996:171 - 180
