虚拟现实中连续碰撞检测算法研究
|
摘要
虚拟环境中的碰撞检测问题是触觉渲染、物理仿真、机器人的路径规划、计算机游戏以及CAD/CAM等领域中的经典问题。实现实时的、高精确度的连续碰撞检测对增强虚拟场景的沉浸感以及真实性起着非常重要的作用。由于大部分虚拟现实系统都需要进行实时的人机交互,只有连续碰撞检测的速度达到一定的帧数时,才可以流畅的进行人机交互。虚拟环境中所有图元之间的碰撞都需要准确的检测结果,否则在视觉上会产生明显的不真实感。因而,如何提高连续碰撞检测算法的速度与准确度一直都是研究的重点内容。
本论文在对各种碰撞检测算法进行全面了解的基础上,针对可变形物体之间的连续碰撞检测算法中存在的问题,进行了研究。本论文的主要研究内容包括以下几个方面：
本论文分析了在设计以及实现可变形物体之间的连续碰撞检测算法过程中需要考虑的几个因素。首先,对于物体模型的表示方式,选择了本论文所提出的算法所适用的三角形网格模型。其次,把整个连续碰撞检测过程分为两步执行,即初步检测阶段和详细检测阶段。其中,初步检测阶段主要是把可能发生碰撞的物体分在同一个子集中,然后在详细检测阶段对这些子集分别执行进一步的测试。在详细检测阶段中对于图元之间的碰撞测试,使用点面图元对检测算法和边边图元对检测算法。最后,对于可能出现的健壮性问题进行了分析,并采取了一些措施来避免产生这些问题。
详细的介绍了本论文所使用的k-DOPs包围盒以及层次包围树结构。层次包围树结构可以用于加速连续碰撞检测的初步检测阶段以及详细检查阶段。对于初步测试阶段,可以使用虚拟场景中所有物体的层次包围树来进行碰撞检测,从而剔除不可能发生碰撞的物体对；对于详细测试阶段,使用由组成物体的图元构建的层次包围树来进行碰撞检测,从而剔除那些不可能发生碰撞的图元。还详细介绍了本论文所使用的层次包围树的构建方法、执行相交测试时所使用的遍历方法以及当物体发生变形时所使用的层次包围树的更新方法。
详细的说明了本论文所提出的一种用于自碰撞检测的算法。该算法分别对自碰撞检测的曲率测试和轮廓投影线测试这两个测试条件进行了改进。对于可变形物体,根据它的几何图元之间的邻接信息使用自底向上的方法构建物体的层次包围树。在构建层次包围树的过程中,计算每一个节点内的子三角形网格区域的最小法向量锥。将最小法向量锥思想应用到轮廓投影线的自碰撞测试中,避免了轮廓投影线中各条线段之间的两两测试。同时,还根据子三角形网格区域之间的邻接信息减少自碰撞检测过程中大量不必要的检测。最后实验结果说明,该算法能较好的提高自碰撞检测的速度。
详细的阐述了本论文所提出的一种用于连续碰撞检测算法中的基于子空间的剔除算法。在连续碰撞检测过程中两个非常接近但是实际上没有发生碰撞的图元往往会产生误报。针对这种问题,首先使用基于一维子空间的剔除算法,然后对剩余的图元对使用基于二维子空间的剔除算法。若是三维空间中的两个图元在一维子空间或者二维子空间内没有发生碰撞,那么它们在三维空间中也不会发生碰撞。最后实验结果表明,该剔除算法能够显著的减少连续碰撞检测中的误报数量,从而避免了大量的三次方程的求解运算,提高了连续碰撞检测的速度。
Collision detection in the virtual environment is a classic topic in research area of haptic rendering, physical simulation, robot path planning, computer games and CAD/CAM. The real-time and high accuracy continuous collision detection plays a very important role in enhancing the immersion and improving the authenticity of the virtual environment. Since most of the virtual reality systems require real-time human-computer interaction. Only when the speed of continuous collision detection is fast enough, the systems can achieve the goal of the real-time interaction. All collisions between the primitives in the virtual environment need the accurate results, otherwise there is not realistic. Therefore, how to improve the speed and accuracy of the continuous collision detection algorithm has always been the focus of the research.
After a comprehensive understanding for a variety of collision detection algorithm, the paper studies the continuous collision detection algorithm between the deformable objects. In this paper, the main research contents are described as follows:
This paper analyzes several factors those need to be considered in the process of the design and implementation of the continuous collision detection algorithm between the deformable objects. First of all, for the representation of the object model, the algorithms proposed in this paper apply the triangular mesh model. Secondly, the whole continuous collision detection process is divided into two phases, those are the broad-phase and the narrow-phase. In the broad-phase the algorithms put the objects those may be colliding in a group, and then in the narrow-phase the algorithms perform pair-wise tests within these groups. In the narrow-phase the algorithms use vertex-face and edge-edge elementary tests between the primitives. Finally, the robustness problems that may occur are analyzed, and then some measures are taken to avoid these problems.
This paper gives a detailed description of the k-DOPs bounding box and the bounding volume hierarchies. Bounding volume hierarchies can be used to accelerate the broad-phase and the narrow-phase of the continuous collision detection. In the broad-phase, the hierarchy of all the objects in the virtual environment can be used for collision detection, thereby it can excludes those objects that are not colliding; In the narrow-phase, the hierarchy of all the primitives of the object can be used for collision detection, thereby it can excludes those primitives that are not colliding. This paper also describes the construction methods of the bounding volume hierarchies, the traversal methods of the intersection test and the update methods of the bounding volume hierarchies of the deforming objects.
This paper gives a detailed description of a self-collision detection algorithm. The algorithm improves the curvature test and contour test of the self-collision detection. The bounding volume hierarchy of the deformable objects is built by the bottom-up method based on the adjacency information between its geometric primitives. In the process of building the bounding volume hierarchy, the minimum normal cone of the sub-triangle mesh area of each node is calculated. Apply the minimum normal cone to the contour test to avoid the pair-wise test of the contour projection lines. Moreover, according to the adjacency information between sub-triangular mesh area, the algorithm can reduce a large number of unnecessary collision detection during the self-collision detection process. Finally, the experimental results demonstrate that the algorithm can improve the speed of self-collision detection.
This paper gives a detailed description of a subspace culling algorithm for continuous collision detection. When two primitives are very close and in fact there is no collision between them, they may produce a false positive in the process of continuous collision detection. In order to solve this problem, at first we use a culling algorithm based on the one-dimensional subspace, and then use the culling algorithm based on the two-dimensional subspace for the remaining primitive-pair. If two primitives in the three-dimensional space are not colliding in the one-dimensional subspace or two-dimensional subspace, then they don't collide each other in the three-dimensional space. The experimental results show that the culling algorithm can significantly reduce the number of false positives in the continuous collision detection, thus the algorithm can avoid solving a large number of the cubic equations to improve the speed of continuous collision detection.
本论文在对各种碰撞检测算法进行全面了解的基础上,针对可变形物体之间的连续碰撞检测算法中存在的问题,进行了研究。本论文的主要研究内容包括以下几个方面：
本论文分析了在设计以及实现可变形物体之间的连续碰撞检测算法过程中需要考虑的几个因素。首先,对于物体模型的表示方式,选择了本论文所提出的算法所适用的三角形网格模型。其次,把整个连续碰撞检测过程分为两步执行,即初步检测阶段和详细检测阶段。其中,初步检测阶段主要是把可能发生碰撞的物体分在同一个子集中,然后在详细检测阶段对这些子集分别执行进一步的测试。在详细检测阶段中对于图元之间的碰撞测试,使用点面图元对检测算法和边边图元对检测算法。最后,对于可能出现的健壮性问题进行了分析,并采取了一些措施来避免产生这些问题。
详细的介绍了本论文所使用的k-DOPs包围盒以及层次包围树结构。层次包围树结构可以用于加速连续碰撞检测的初步检测阶段以及详细检查阶段。对于初步测试阶段,可以使用虚拟场景中所有物体的层次包围树来进行碰撞检测,从而剔除不可能发生碰撞的物体对；对于详细测试阶段,使用由组成物体的图元构建的层次包围树来进行碰撞检测,从而剔除那些不可能发生碰撞的图元。还详细介绍了本论文所使用的层次包围树的构建方法、执行相交测试时所使用的遍历方法以及当物体发生变形时所使用的层次包围树的更新方法。
详细的说明了本论文所提出的一种用于自碰撞检测的算法。该算法分别对自碰撞检测的曲率测试和轮廓投影线测试这两个测试条件进行了改进。对于可变形物体,根据它的几何图元之间的邻接信息使用自底向上的方法构建物体的层次包围树。在构建层次包围树的过程中,计算每一个节点内的子三角形网格区域的最小法向量锥。将最小法向量锥思想应用到轮廓投影线的自碰撞测试中,避免了轮廓投影线中各条线段之间的两两测试。同时,还根据子三角形网格区域之间的邻接信息减少自碰撞检测过程中大量不必要的检测。最后实验结果说明,该算法能较好的提高自碰撞检测的速度。
详细的阐述了本论文所提出的一种用于连续碰撞检测算法中的基于子空间的剔除算法。在连续碰撞检测过程中两个非常接近但是实际上没有发生碰撞的图元往往会产生误报。针对这种问题,首先使用基于一维子空间的剔除算法,然后对剩余的图元对使用基于二维子空间的剔除算法。若是三维空间中的两个图元在一维子空间或者二维子空间内没有发生碰撞,那么它们在三维空间中也不会发生碰撞。最后实验结果表明,该剔除算法能够显著的减少连续碰撞检测中的误报数量,从而避免了大量的三次方程的求解运算,提高了连续碰撞检测的速度。
Collision detection in the virtual environment is a classic topic in research area of haptic rendering, physical simulation, robot path planning, computer games and CAD/CAM. The real-time and high accuracy continuous collision detection plays a very important role in enhancing the immersion and improving the authenticity of the virtual environment. Since most of the virtual reality systems require real-time human-computer interaction. Only when the speed of continuous collision detection is fast enough, the systems can achieve the goal of the real-time interaction. All collisions between the primitives in the virtual environment need the accurate results, otherwise there is not realistic. Therefore, how to improve the speed and accuracy of the continuous collision detection algorithm has always been the focus of the research.
After a comprehensive understanding for a variety of collision detection algorithm, the paper studies the continuous collision detection algorithm between the deformable objects. In this paper, the main research contents are described as follows:
This paper analyzes several factors those need to be considered in the process of the design and implementation of the continuous collision detection algorithm between the deformable objects. First of all, for the representation of the object model, the algorithms proposed in this paper apply the triangular mesh model. Secondly, the whole continuous collision detection process is divided into two phases, those are the broad-phase and the narrow-phase. In the broad-phase the algorithms put the objects those may be colliding in a group, and then in the narrow-phase the algorithms perform pair-wise tests within these groups. In the narrow-phase the algorithms use vertex-face and edge-edge elementary tests between the primitives. Finally, the robustness problems that may occur are analyzed, and then some measures are taken to avoid these problems.
This paper gives a detailed description of the k-DOPs bounding box and the bounding volume hierarchies. Bounding volume hierarchies can be used to accelerate the broad-phase and the narrow-phase of the continuous collision detection. In the broad-phase, the hierarchy of all the objects in the virtual environment can be used for collision detection, thereby it can excludes those objects that are not colliding; In the narrow-phase, the hierarchy of all the primitives of the object can be used for collision detection, thereby it can excludes those primitives that are not colliding. This paper also describes the construction methods of the bounding volume hierarchies, the traversal methods of the intersection test and the update methods of the bounding volume hierarchies of the deforming objects.
This paper gives a detailed description of a self-collision detection algorithm. The algorithm improves the curvature test and contour test of the self-collision detection. The bounding volume hierarchy of the deformable objects is built by the bottom-up method based on the adjacency information between its geometric primitives. In the process of building the bounding volume hierarchy, the minimum normal cone of the sub-triangle mesh area of each node is calculated. Apply the minimum normal cone to the contour test to avoid the pair-wise test of the contour projection lines. Moreover, according to the adjacency information between sub-triangular mesh area, the algorithm can reduce a large number of unnecessary collision detection during the self-collision detection process. Finally, the experimental results demonstrate that the algorithm can improve the speed of self-collision detection.
This paper gives a detailed description of a subspace culling algorithm for continuous collision detection. When two primitives are very close and in fact there is no collision between them, they may produce a false positive in the process of continuous collision detection. In order to solve this problem, at first we use a culling algorithm based on the one-dimensional subspace, and then use the culling algorithm based on the two-dimensional subspace for the remaining primitive-pair. If two primitives in the three-dimensional space are not colliding in the one-dimensional subspace or two-dimensional subspace, then they don't collide each other in the three-dimensional space. The experimental results show that the culling algorithm can significantly reduce the number of false positives in the continuous collision detection, thus the algorithm can avoid solving a large number of the cubic equations to improve the speed of continuous collision detection.
引文
1. GINO VAN DEN BERGEN. Collision Detection in Interactive 3D Environments[M]. Morgan Kaufmann Publishers Inc,2004.
2. DOBKIN DP, KIRKPATRICK DG. A Linear Algorithm for Determining the Separation of Convex Polyhedra. Journal of Algorithms [J],1985,6:381-392.
3. CHAZELLE B. An Optimal Algorithm for Intersection Three-dimensional Convex Polyhedra[C]. In Proceedings of 30th annual IEEE symposium on Foundation Computer Science,1989:586-591.
4. DAVID BARAFF. Curves Surfaces and Coherence for Non-penetrating Rigid Bodies[J]. SIGGRAPH 1990, Computer Graphics, Volume 24,4, August 1990.
5. BRIAN MIRTICH. Rigid Body Contact:Collision Detection to Force Computation[R]. MERL, Techical Report, TR-98-01, March 1998.
6. BRIAN MIRTICH. Impluse-based Dynamic Simulation of Rigid Body Systems[D]. Ph.D.thesis, University of California, Berkeley, December,1996.
7. CANNY JF. Collision Detection for Moving Polyhedra[J]. IEEE Transactions on PAM, 1986,8(2):200-209.
8. REDON S, KHEDDAR A. COQUILLART S. CONTACT:Arbitrary in-between Motions for Continuous Collision Detection[C]. In Proc. of IEEE ROMAN,2001,9.
9. REDON S, KHEHDDAR A, COQUILLART S. Fast Continuous Collision Detection between Rigid Bodies[J]. Computer Graphics Forum,2002,21(3):279-287.
10.黄通浪,唐敏,董金祥,一种快速精确的连续碰撞检测算法[J],浙江大学学报(工学版),2006,40(6)：51-54.
11.王祎,虚拟现实中碰撞检测关键技术的研究[D],博士学位论文,吉林大学,2009.
12. STEPHANE REDON, MING C. LIN, and DINESH MANOCHA, YOUNG J. KIM J. Fast Continuous Collision Detection for Articulated Models[C]. ACM Symposium on Solid and Physical Modeling, Genoa, Italy,2004:145-156.
13. MIN TAMG, SEAN CURTIS, SUNG-EUI YOON, DINESH MANOCHA. Interactive Continuous Collision Detection between Deformable Models using Connectivity-Based Culling[C]. SPM'08:ACM Solid and Physical Modeling Symposium),2008.
14. MIN TAMG, SEAN CURTIS, SUNG-EUI YOON, DINESH MANOCHA. Adjacency-based culling for continuous collision detection[J], The Visual Computer, Springer,Volume 24, Numbers7-9,2008,7:545-553.
15.唐敏,林江,童若锋,图形硬件加速的柔性物体连续碰撞检测[J].计算机学报,2010,33(10)：2022-2030.
16.杜鹏,唐敏,童若锋,多核加速的并行碰撞检测[J].计算机辅助设计与图形学学报,2011,23(5)：833-838.
17. ERICSON CHRISTER. Real-time collision detection [M]. Morgan Kaufmann Publishers Inc, 2005.
18. JIMENEZ P., THOMAS F., TORRAS C. Collision Detection:A Survey. Computers and Graphics[J],25(2):269-285,2001.
19. G. TURK. Interactive collision detection for molecular graphics[R]. TR90-014, University of North Carolina at Chapel Hill,1990.
20. M. TESCHNER, B. HEIDELBERGER, M. MUELLER, D. POMERANETS, and M. GROSS. Optimized spatial hashing for collision detection of deformable objects[C]. In Proc. of Vision, Modeling, Visualization,pp:47-54,2003.
21. R. G. LUQUE, J. L. D. COMBA and C. M. D. S. FREITAS. Broad-phase collision detection using semi-adjusting bsp-trees[C]. In SI3D '05:Proceedings of the 2005 symposium on Interactive 3D graphics and games, New York, USA,2005. ACM Press, pp:179-186.
22. COHEN, J. D., LIN, M. C., MANOCHA, D. and PONAMGI, M. K. I-COLLIDE:An interactive and exact collision detection systemfor large-scale environments[J]. In Symposium on Interactive 3D Graphics,1995,pp:189-196.
23.丁佳.大型复杂场景中快速碰撞检测技术研究,硕士学位论文[D],电子科技大学,2006,pp：57-65.
24. DANIEL S. COMING and OLIVER G. STAADT, KINETIC. Sweep and Prune for Collision Detection[C], Workshop on Virtual Reality Interaction and Physical Simulation,2005.
25. LIN M.C. Efficient Collision Detection for Animation and Robotics[D]. PhD thesis, University of California, Berkeley,1993.
26. BRIAN MIRTICH. Ⅴ-Clip:Fast and Robust Polyhedral Collision Detection[J], ACM Transactions on Graphics, Vol.17, No.3, July 1998, Pages 177-208.
27. Lin MC, Manocha D. Fast interference detection between geometric models[J]. the Visual Computer,11(10):pp.542-561,1995.
28. Chung K, Wang W. Quick collision detection of polytopes in virtual environments[C]. In: Proceedings of the ACM Symposium on Virtual Reality Software and Technology, Hong Kong, July 1996:125-132.
29. S. A. Ehmann and M. C. Lin. Accelerated proximity queries between convex polyhedral using multi-level Voronoi marching[C]. In Proceedings IEEE IROS,2000.
30. Ponamgi MK, Cohen JD, Lin MC, Manocha D. Incremental algorithms for collision detection between polyhedral models[C]. In SIVE 95, The First Workshop on Simulation and Interaction in Virtual Environments,1995,1:84-91.
31. Ehmann S, Lin MC. Accurate and fast proximity queries between polyhedra using convex surface decomposition[C]. In Proceedings of the Eurographics Conference, Manchester, 2001:500-510.
32. Gilbert EG, Johnson DW, Keerthi SS. A fast procedure for computing the distance between objects in three-dimensional space[J]. IEEE Journal on Robotics and Automation, 1998,4:193-203.
33. Gilbert EG, Foo CP, Computing the Distance Between General Convex Objects in 3D Space[J]. IEEE Transactions on Robotics and Automation,1900,6(1):53-61.
34. Cameron S. Enhancing GJK:Computing minimum and penetration distances between convex polyhedron[C]. IEEE International Conference on Robotics and Automation,1997.
35. Bergen GVD. A Fast and Robust GJK Implementation for Collision Detection of Convex Objects[J]. Journal of Graphics Tools, Volume 4, Issue 2:7-25,1999.
36. S. SURI. Analyzing Bounding Boxes for Object Intersection[J]. ACM. Transactions on Graphics, Vol.18,1999, NO.3, July:257-277.
37.张茂军,虚拟现实系统[M].科学出版社,2001,第一版,2-8.
38. Volino, P., and Thalmann, N., M. Efficient self-collision detection on smoothly discretized surface animations using geometrical shape regularity[J]. Computer Graphics Forum, 1994,13(3):155-166.
39. Provot, X. Collision and self-collision handling in cloth model dedicated to design garment[J]. Graphics Interface,1997:177-189.
40. O'SULLIVAN C, DINGLIANA J. Realtime collision detection and response using sphere-trees[C]. In Proceedings of the Spring Conference on Computer Graphics, Bratislava, 1999:83-92.
41. Hubbard, P.M.. Approximating polyhedra with spheres for time critical collision detection[J]. ACM Transactions on Graphics,1996,15(3).179-210.
42. Hubbard, P.M.. Collision detection for interactive graphics applications[J]. IEEE Trans. Visual. Comput. Graph, 1(3):218-230,Sep 1995.
43. I. Palmer and R. Grimsdale. Collision detection for animation using sphere-trees[C]. Comput. Graph. Forum,14(2):105-116, June 1995.
44. LARSSON T, MOLLER TA. Collision detection for continuously deforming bodies[C]. In Proceedings of Eurographics'2001,pp:325-333.
45. Van Den Bergen. Efficient collision detection of complex deformable models using AABB trees[J]. Journal of Graphics Tools,2(4),1-13,1997.
46. GOTTACHALK S, LIN MC, MANOCHA D. OBB-Tree:A Hierarchical Structure for Rapid Interference Detection[C]. the Proceedings of ACM SIGGRAPH'96,1996:171-180.
47. ZACHMANN G. Rapid collision detection by dynamically aligned DOP-Trees[C]. In Proceedings of IEEE, VRAIS'98, Atlanta, Georgia, March 1998:90-97.
48. James T.Klosowski.,Efficient Collision Detection Using Bounding Volume Hierarchies of k-Dops[J]. IEEE Transactions on Visualization and Computer Graphics, Vol.4, No.1,1998, 26-27.
49. HE T. Fast collision detection using QuOSPO trees[C]. In Proceedings of the 1999 symposium on Interactive 3D graphics,1999:55-62.
50. WAN HG, FAN ZW, GAO SM, PENG QS, A parallel collision detection algorithm based on hybrid bounding volume hierarchy[C]. In Proceedings of CAD&Graphics'2001, Kunming, China,2001:521-528.
51. CAMERON S. A comparison of two fast algorithms for computing the distance between convex polyhedra[J]. IEEE Transactions on Robotics and Automation,1997,13(6):915-920.
52. PAYNE B A, TOGA A W. Distance field manipulation of surface models [J]. IEEE Computer Graphics and Applications,12(1),1992.
53. A. GUEZIEC. MESHSWEEPER. Dynamic point to polygonal mesh distance and applications[J]. IEEE Transactions on Visualization and Computer Graphics,7(1):47-60, 2001.
54. S. MAUCH. A fast algorithm for computing the closest point and distance transfonn[R]. Technical Report Caltech ASCI/2000.077, Applied and Computational Mathematics, California Institute of Technology,2000.
55. C. SIGG, R. PEIKERT, and M. GROSS. Signed distance transform using graphics hardware[C]. In Proc. of IEEE Visualization. IEEE,2003.
56. FRISKEN S. F, PERRY R. N, ROCKWOOD A. P, JONES T. R. Adaptively sampled distance fields:A general representation of shape for computer graphics[C]. Computer Graphics Proceedings,2000, pp:249-254.
57. UNO S., SLATER M. The sensitivity of presence to collision response[C]. In Proc. of IEEE Virtual Reality Annual International Symposium (VRAIS) (Albuquerque, New Mexico, Mar.01-05 1997), pp.95-103.
58. BARZEL R., HUGHES J., WOOD D. N.. Plausible motion simulation for computer graphics animation[C]. In Proceedings of the Eurographics Workshop Computer Animation and Simulation(1996), Springer, pp.183-197.
59. M. TESCHNER, S. KIMMERLE, B. HEIDELBERGER, G. ZACHMANN, L. RAGHUPATHI. Collision Detection for Deformable Objects[J]. Computer Graphics Forum, 24(1),61-81, March 2005.
60. S. GUY and G. DEBUNNE. Monte-carlo collision detection[R]. Technical Report RR-5136, INRIA,2004.
61. L. RAGHUPATHI, L. GRISONI, F. FAURE, D. MARCHAL, M.P. CANI. An intestine surgery simulator:Real-time collision processing and visualization[J]. IEEE Transactions on Visualization and Computer Graphics,10(6),708-718,2004.
62. S. KIMMERLE, M. NESME, and F. FAURE. Hierarchy accelerated stochastic collision detection[C]. In Proceedings of Vision, Modeling, Visualization,307-314,2004.
63.金汉均,李朝晖,张晓亮,郭亚军.基于遗传算法的凸多面体间碰撞检测算法研究[J],华中师范大学学报(自然科学版),Vo l.40,No.1,2006.
64. WANG TIANZHU. Adaptive Stochastic Collision Detection between Deformable Objects using Particle Swarm Optimization[C]. In Proceedings of EvoWorkshops 2006, EvoIASP, Budapest, Hungary, April 10-12. LNCS, Vol.3907/2006:450-459.
65. M.C Lin, D. Manocha. Interactive geometric computations using graphics hardware[C]. International Conference on Robotics and Automation,2002:201-205.
66. Bridson, R., Fedkiw, R., and Anderson, J.. Robust treament for collisions, contact and friction for cloth animation[C]. Proc. of ACM SIGGRAPH,2002:594-603.
67. Grinspun, E., and Schroder, P. Normal bounds for subdivision-surface interference detection[J]. In IEEE Visualization'01, IEEE Computer Society,2001:333-340.
68. Schvartzman, S.C., Gascon, J., and Otaduy, M. A. Bounded normal trees for reduced deformations of triangulated surfaces[C]. In Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, ACM,2009:75-82.
69. Schvartzman, S.C., Perez, A.G., and Otaduy M.A. Star-contours for efficient hierarchical self-collision detection[C]//In ACM Trans, on Graphics (Proc. of ACM SIGGRAPH),2010, 29(4):8.
70.陆睿,刘卉.基于完全二叉树BVH的自碰撞检测算法[J].计算机应用与软件,2012年,第12期：282-285.
71. Hutter, M., and Fuhrmann, A. Optimized continuous collision detection for deformable triangle meshes[C]. Proc. WSCG07,2007:25-32.
72. Wong, W. S.-K., and Baciu, G. A randomized marking scheme for continuous collision detection in simulation of deformable surfaces.[C]. Proc. of ACM VRCIA,2006:181-188.
73. Curtis, S., Tamstorf, R., and Manocha, D. Fast collision detection for deformable models using representative-triangles[C]. In SI3D'08: Proceedings of the 2008 Symposium on Interactive 3D graphics and games,2008:61-69.
74. Tang, M., Manocha, D., and Tong, R. Fast continuous collision detection using deforming non-penetration filters[C]. In Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, ACM,2010:7-13.
75. Tang, C., Li, S., and Wang, G., P. Reduced deforming filter culling for fast continuous collision detection[C]. Proceedings of the 17th ACM Symposium on Virtual Reality Software and Technology,2010:79-82.
76. Zhang, X., Redon, S., Lee, M., and Kim, Y. J. Continuous collision detection for articulated models using taylor models and temporal culling[J]. ACM Transactions on Graphics (Proceedings of SIGGRAPH 2007),26(3), July 2007.
77. Barbic, J.,and James, D. L. Subspace self-collision culling[J]. ACM Trans. on Graphics (SIGGRAPH 2010),2010,29(4):81:1-81:9.
78. Zachmann G., Langetepe E. Geometric data structures for computer graphics[C]. In Tutorial at ACM SIGGRAPH. ACM 27-31, July 2003.
79. ROUSSOPOULOS N., LEIFKER D. Direct spatial search on pictorial databases using packed R-trees[C]. In Proceedings of ACM-SIGMOD 1985 International Conference on Management of Data (Austin, Texas, May28-31 1985), pp.17-31.
80. GOLDSMITH J., SALMON J. Automatic creation of object hierarchies for ray tracing[J]. IEEE Computer Graphics and Applications,7,5 (May 1987),14-20.
81. MEZGER J., KIMMERLE S., ETZMUSS O. Hierarchical Techniques in Collision Detection for Cloth Animation[J]. Journal of WSCG 11,2 (2003),322-329.
82. ZACHMANN G. Minimal hierarchical collision detection[C]. In Proc. ACM Symposium on Virtual Reality Software and Technology (VRST) (Hong Kong, China, Nov.11-13,2002), pp. 121-128.
83. VOLINO P., MAGNENAT-THALMANN N. Collision and Self-Collision Detection:Efficient and Robust Solutions for Higly Deformable Surfaces. In Comp. Animation and Simulation. 1995, Springer Verlag, pp.55-65.
84. GOVINDARAJU, N., KNOTT, D., JAIN, N., KABUL, I., TAMSTORF, R.,GAYLE, R., LIN, M., AND MANOCHA, D. Interactive collision detection between deformable models using chromatic decomposition[J]. ACM Trans, on Graphics (Proc. of ACM SIGGRAPH) 24,3, 991-999,2005.
85. HEO, J.-P., SEONG, J.-K., KIM, D., OTADUY, M. A., HONG, J.-M.,TANG, M., AND YOON, S.-E. FASTCD:Fracturing-aware stable collision detection[C]. In ACM SIGGRAPH /Eurographics Symposium on Computer Animation.2010,149-158.
86. LOMBARDO, J.-C., PAULE CANI, M., AND NEYRET, F. Real-time collision detection for virtual surgery[J]. In Computer Animation.26-28,1999.
87. MATHIAS, E. AND GU, L. Hierarchical spatial hashing for real-time collision detection[C]. In IEEE International Conference on Shape Modeling and Applications.61-70,2007.
88. NEALEN, A., MULLER, M., KEISER, R., BOXERMAN, E., AND CARLSON, M. Physically based deformable models in computer graphics [C]. Computer Graphics Forum 25, 4,809-836,2006.
89. SUD, A., GOVINDARAJU, N., GAYLE, R., KABUL, I., AND MANOCHA,D. Fast proximity computation among deformable models using discrete voronoi diagrams[C]. Proc. of ACM SIGGRAPH,1144-1153,2006.
90. Tyson Brochu, Essex Edwards, Robert Bridson. Efficient geometrically exact continuous collision detection[J]. ACM Transactions on Graphics, v.31 n.4,1-7,2012.
91. Xinyu Zhang, Kim Y. J. Simple Culling Methods for Continuous Collision Detection of Deforming Triangles[J]. IEEE Transactions on Visualization and Computer Graphics,18(7), 1146-1155, July 2012.
92. Min Tang, Kim Y. J., Manocha D. Continuous collision detection for non-rigid contact computations using local advancement[C]. IEEE International Conference on Robotics and Automation,4016-4021, May 2010.
93. Min Tang, Manocha D., Sung-Eui Yoon, etc. VolCCD:Fast continuous collision culling between deforming volume meshes[J]. ACM Transactions on Graphics,30(5), October 2011.
94. Jia Pan, Chitta S., Manocha D. FCL:A general purpose library for collision and proximity queries[C]. IEEE International Conference on Robotics and Automation,3859-3866, May 2012.
95. Duksu Kim, Jae-Pil Heo, Jaehyuk Huh, etc. HPCCD:Hybrid Parallel Continuous Collision Detection using CPUs and GPUs[C]. Computer Graphics Forum,28(7),1791-1800, October 2009.
96. Xinyu Zhang, Minkyoung Lee, Kim Y. J. Interactive continuous collision detection for non-convex polyhedral[J]. The Visual Computer.22(9),749-760,2006.
97. Peng Du, Min Tang, Ruofeng Tong. Fast continuous collision culling with deforming noncollinear filters[J]. Computer Animation and Virtual Words, Volume 23, Issue 3-4, 375-383,2012.
98. Changxi Zheng, Doug L. James. Energy-based self-collision culling for arbitrary mesh deformations[J]. ACM Transactions on Graphics,31(4), July 2012.
99. Min Tang, Kim Y. J., Manocha D. C2A:controlled conservative advancement for continuous collision detection of polygonal models[C]. IEEE international conference on Robotics and Automation,356-361,2009.
100. Jen-Duo Liu, Ming-Tat Ko, Ruei-Chuan Chang. Collision avoidance in cloth animation[J]. The Visual Computer,12(5),234-243,1996.
101. Chen Tang, Sheng Li, Guopin Wang. Fast continuous collision detection using parallel filter in subspace[C]. I3D'11 Symposium on Interactive 3D Graphics and Games,71-80,2011.
102. Jung-Woo Chang, Wenping Wang, Myung-Soo Kim. Efficient collision detection using a dual OBB-sphere bounding volume hierarchy[J]. Computer-Aided Design,42(1),50-57,2010.
103. Min Tang, Dinesh Manocha, Ruofeng Tong. MCCD:Multi-core collision detection between deformable models using front-based decomposition[J]. Graphical Models,72(2),7-23, March 2010.
104. Jia Pan, Dinesh Manocha. GPU-Based Parallel Collision Detection for Real-Time Motion Planning[J]. Algorithmic Foundations of Robotics Ⅸ, Volume 68,211-228,2011.
105. Fuchang Liu, Takahiro Harada, Youngeun Lee, Young J. Kim. Real-time collision culling of a million bodies on graphics processing units[J]. ACM Transactions on Graphics,29(6), December 2010.
106. Jia Pan, Dinesh Manocha. GPU-based parallel collision detection for fast motion planning[J]. The International Journal of Robotics Research,31(2),187-200,2012.
107. Taubig, H. Bauml, B., Frese, U. Real-time swept volume and distance computation for self collision detection[C]. International Conference on Intelligent Robots and Systems (IROS), 1585-1592,2011.
2. DOBKIN DP, KIRKPATRICK DG. A Linear Algorithm for Determining the Separation of Convex Polyhedra. Journal of Algorithms [J],1985,6:381-392.
3. CHAZELLE B. An Optimal Algorithm for Intersection Three-dimensional Convex Polyhedra[C]. In Proceedings of 30th annual IEEE symposium on Foundation Computer Science,1989:586-591.
4. DAVID BARAFF. Curves Surfaces and Coherence for Non-penetrating Rigid Bodies[J]. SIGGRAPH 1990, Computer Graphics, Volume 24,4, August 1990.
5. BRIAN MIRTICH. Rigid Body Contact:Collision Detection to Force Computation[R]. MERL, Techical Report, TR-98-01, March 1998.
6. BRIAN MIRTICH. Impluse-based Dynamic Simulation of Rigid Body Systems[D]. Ph.D.thesis, University of California, Berkeley, December,1996.
7. CANNY JF. Collision Detection for Moving Polyhedra[J]. IEEE Transactions on PAM, 1986,8(2):200-209.
8. REDON S, KHEDDAR A. COQUILLART S. CONTACT:Arbitrary in-between Motions for Continuous Collision Detection[C]. In Proc. of IEEE ROMAN,2001,9.
9. REDON S, KHEHDDAR A, COQUILLART S. Fast Continuous Collision Detection between Rigid Bodies[J]. Computer Graphics Forum,2002,21(3):279-287.
10.黄通浪,唐敏,董金祥,一种快速精确的连续碰撞检测算法[J],浙江大学学报(工学版),2006,40(6)：51-54.
11.王祎,虚拟现实中碰撞检测关键技术的研究[D],博士学位论文,吉林大学,2009.
12. STEPHANE REDON, MING C. LIN, and DINESH MANOCHA, YOUNG J. KIM J. Fast Continuous Collision Detection for Articulated Models[C]. ACM Symposium on Solid and Physical Modeling, Genoa, Italy,2004:145-156.
13. MIN TAMG, SEAN CURTIS, SUNG-EUI YOON, DINESH MANOCHA. Interactive Continuous Collision Detection between Deformable Models using Connectivity-Based Culling[C]. SPM'08:ACM Solid and Physical Modeling Symposium),2008.
14. MIN TAMG, SEAN CURTIS, SUNG-EUI YOON, DINESH MANOCHA. Adjacency-based culling for continuous collision detection[J], The Visual Computer, Springer,Volume 24, Numbers7-9,2008,7:545-553.
15.唐敏,林江,童若锋,图形硬件加速的柔性物体连续碰撞检测[J].计算机学报,2010,33(10)：2022-2030.
16.杜鹏,唐敏,童若锋,多核加速的并行碰撞检测[J].计算机辅助设计与图形学学报,2011,23(5)：833-838.
17. ERICSON CHRISTER. Real-time collision detection [M]. Morgan Kaufmann Publishers Inc, 2005.
18. JIMENEZ P., THOMAS F., TORRAS C. Collision Detection:A Survey. Computers and Graphics[J],25(2):269-285,2001.
19. G. TURK. Interactive collision detection for molecular graphics[R]. TR90-014, University of North Carolina at Chapel Hill,1990.
20. M. TESCHNER, B. HEIDELBERGER, M. MUELLER, D. POMERANETS, and M. GROSS. Optimized spatial hashing for collision detection of deformable objects[C]. In Proc. of Vision, Modeling, Visualization,pp:47-54,2003.
21. R. G. LUQUE, J. L. D. COMBA and C. M. D. S. FREITAS. Broad-phase collision detection using semi-adjusting bsp-trees[C]. In SI3D '05:Proceedings of the 2005 symposium on Interactive 3D graphics and games, New York, USA,2005. ACM Press, pp:179-186.
22. COHEN, J. D., LIN, M. C., MANOCHA, D. and PONAMGI, M. K. I-COLLIDE:An interactive and exact collision detection systemfor large-scale environments[J]. In Symposium on Interactive 3D Graphics,1995,pp:189-196.
23.丁佳.大型复杂场景中快速碰撞检测技术研究,硕士学位论文[D],电子科技大学,2006,pp：57-65.
24. DANIEL S. COMING and OLIVER G. STAADT, KINETIC. Sweep and Prune for Collision Detection[C], Workshop on Virtual Reality Interaction and Physical Simulation,2005.
25. LIN M.C. Efficient Collision Detection for Animation and Robotics[D]. PhD thesis, University of California, Berkeley,1993.
26. BRIAN MIRTICH. Ⅴ-Clip:Fast and Robust Polyhedral Collision Detection[J], ACM Transactions on Graphics, Vol.17, No.3, July 1998, Pages 177-208.
27. Lin MC, Manocha D. Fast interference detection between geometric models[J]. the Visual Computer,11(10):pp.542-561,1995.
28. Chung K, Wang W. Quick collision detection of polytopes in virtual environments[C]. In: Proceedings of the ACM Symposium on Virtual Reality Software and Technology, Hong Kong, July 1996:125-132.
29. S. A. Ehmann and M. C. Lin. Accelerated proximity queries between convex polyhedral using multi-level Voronoi marching[C]. In Proceedings IEEE IROS,2000.
30. Ponamgi MK, Cohen JD, Lin MC, Manocha D. Incremental algorithms for collision detection between polyhedral models[C]. In SIVE 95, The First Workshop on Simulation and Interaction in Virtual Environments,1995,1:84-91.
31. Ehmann S, Lin MC. Accurate and fast proximity queries between polyhedra using convex surface decomposition[C]. In Proceedings of the Eurographics Conference, Manchester, 2001:500-510.
32. Gilbert EG, Johnson DW, Keerthi SS. A fast procedure for computing the distance between objects in three-dimensional space[J]. IEEE Journal on Robotics and Automation, 1998,4:193-203.
33. Gilbert EG, Foo CP, Computing the Distance Between General Convex Objects in 3D Space[J]. IEEE Transactions on Robotics and Automation,1900,6(1):53-61.
34. Cameron S. Enhancing GJK:Computing minimum and penetration distances between convex polyhedron[C]. IEEE International Conference on Robotics and Automation,1997.
35. Bergen GVD. A Fast and Robust GJK Implementation for Collision Detection of Convex Objects[J]. Journal of Graphics Tools, Volume 4, Issue 2:7-25,1999.
36. S. SURI. Analyzing Bounding Boxes for Object Intersection[J]. ACM. Transactions on Graphics, Vol.18,1999, NO.3, July:257-277.
37.张茂军,虚拟现实系统[M].科学出版社,2001,第一版,2-8.
38. Volino, P., and Thalmann, N., M. Efficient self-collision detection on smoothly discretized surface animations using geometrical shape regularity[J]. Computer Graphics Forum, 1994,13(3):155-166.
39. Provot, X. Collision and self-collision handling in cloth model dedicated to design garment[J]. Graphics Interface,1997:177-189.
40. O'SULLIVAN C, DINGLIANA J. Realtime collision detection and response using sphere-trees[C]. In Proceedings of the Spring Conference on Computer Graphics, Bratislava, 1999:83-92.
41. Hubbard, P.M.. Approximating polyhedra with spheres for time critical collision detection[J]. ACM Transactions on Graphics,1996,15(3).179-210.
42. Hubbard, P.M.. Collision detection for interactive graphics applications[J]. IEEE Trans. Visual. Comput. Graph, 1(3):218-230,Sep 1995.
43. I. Palmer and R. Grimsdale. Collision detection for animation using sphere-trees[C]. Comput. Graph. Forum,14(2):105-116, June 1995.
44. LARSSON T, MOLLER TA. Collision detection for continuously deforming bodies[C]. In Proceedings of Eurographics'2001,pp:325-333.
45. Van Den Bergen. Efficient collision detection of complex deformable models using AABB trees[J]. Journal of Graphics Tools,2(4),1-13,1997.
46. GOTTACHALK S, LIN MC, MANOCHA D. OBB-Tree:A Hierarchical Structure for Rapid Interference Detection[C]. the Proceedings of ACM SIGGRAPH'96,1996:171-180.
47. ZACHMANN G. Rapid collision detection by dynamically aligned DOP-Trees[C]. In Proceedings of IEEE, VRAIS'98, Atlanta, Georgia, March 1998:90-97.
48. James T.Klosowski.,Efficient Collision Detection Using Bounding Volume Hierarchies of k-Dops[J]. IEEE Transactions on Visualization and Computer Graphics, Vol.4, No.1,1998, 26-27.
49. HE T. Fast collision detection using QuOSPO trees[C]. In Proceedings of the 1999 symposium on Interactive 3D graphics,1999:55-62.
50. WAN HG, FAN ZW, GAO SM, PENG QS, A parallel collision detection algorithm based on hybrid bounding volume hierarchy[C]. In Proceedings of CAD&Graphics'2001, Kunming, China,2001:521-528.
51. CAMERON S. A comparison of two fast algorithms for computing the distance between convex polyhedra[J]. IEEE Transactions on Robotics and Automation,1997,13(6):915-920.
52. PAYNE B A, TOGA A W. Distance field manipulation of surface models [J]. IEEE Computer Graphics and Applications,12(1),1992.
53. A. GUEZIEC. MESHSWEEPER. Dynamic point to polygonal mesh distance and applications[J]. IEEE Transactions on Visualization and Computer Graphics,7(1):47-60, 2001.
54. S. MAUCH. A fast algorithm for computing the closest point and distance transfonn[R]. Technical Report Caltech ASCI/2000.077, Applied and Computational Mathematics, California Institute of Technology,2000.
55. C. SIGG, R. PEIKERT, and M. GROSS. Signed distance transform using graphics hardware[C]. In Proc. of IEEE Visualization. IEEE,2003.
56. FRISKEN S. F, PERRY R. N, ROCKWOOD A. P, JONES T. R. Adaptively sampled distance fields:A general representation of shape for computer graphics[C]. Computer Graphics Proceedings,2000, pp:249-254.
57. UNO S., SLATER M. The sensitivity of presence to collision response[C]. In Proc. of IEEE Virtual Reality Annual International Symposium (VRAIS) (Albuquerque, New Mexico, Mar.01-05 1997), pp.95-103.
58. BARZEL R., HUGHES J., WOOD D. N.. Plausible motion simulation for computer graphics animation[C]. In Proceedings of the Eurographics Workshop Computer Animation and Simulation(1996), Springer, pp.183-197.
59. M. TESCHNER, S. KIMMERLE, B. HEIDELBERGER, G. ZACHMANN, L. RAGHUPATHI. Collision Detection for Deformable Objects[J]. Computer Graphics Forum, 24(1),61-81, March 2005.
60. S. GUY and G. DEBUNNE. Monte-carlo collision detection[R]. Technical Report RR-5136, INRIA,2004.
61. L. RAGHUPATHI, L. GRISONI, F. FAURE, D. MARCHAL, M.P. CANI. An intestine surgery simulator:Real-time collision processing and visualization[J]. IEEE Transactions on Visualization and Computer Graphics,10(6),708-718,2004.
62. S. KIMMERLE, M. NESME, and F. FAURE. Hierarchy accelerated stochastic collision detection[C]. In Proceedings of Vision, Modeling, Visualization,307-314,2004.
63.金汉均,李朝晖,张晓亮,郭亚军.基于遗传算法的凸多面体间碰撞检测算法研究[J],华中师范大学学报(自然科学版),Vo l.40,No.1,2006.
64. WANG TIANZHU. Adaptive Stochastic Collision Detection between Deformable Objects using Particle Swarm Optimization[C]. In Proceedings of EvoWorkshops 2006, EvoIASP, Budapest, Hungary, April 10-12. LNCS, Vol.3907/2006:450-459.
65. M.C Lin, D. Manocha. Interactive geometric computations using graphics hardware[C]. International Conference on Robotics and Automation,2002:201-205.
66. Bridson, R., Fedkiw, R., and Anderson, J.. Robust treament for collisions, contact and friction for cloth animation[C]. Proc. of ACM SIGGRAPH,2002:594-603.
67. Grinspun, E., and Schroder, P. Normal bounds for subdivision-surface interference detection[J]. In IEEE Visualization'01, IEEE Computer Society,2001:333-340.
68. Schvartzman, S.C., Gascon, J., and Otaduy, M. A. Bounded normal trees for reduced deformations of triangulated surfaces[C]. In Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, ACM,2009:75-82.
69. Schvartzman, S.C., Perez, A.G., and Otaduy M.A. Star-contours for efficient hierarchical self-collision detection[C]//In ACM Trans, on Graphics (Proc. of ACM SIGGRAPH),2010, 29(4):8.
70.陆睿,刘卉.基于完全二叉树BVH的自碰撞检测算法[J].计算机应用与软件,2012年,第12期：282-285.
71. Hutter, M., and Fuhrmann, A. Optimized continuous collision detection for deformable triangle meshes[C]. Proc. WSCG07,2007:25-32.
72. Wong, W. S.-K., and Baciu, G. A randomized marking scheme for continuous collision detection in simulation of deformable surfaces.[C]. Proc. of ACM VRCIA,2006:181-188.
73. Curtis, S., Tamstorf, R., and Manocha, D. Fast collision detection for deformable models using representative-triangles[C]. In SI3D'08: Proceedings of the 2008 Symposium on Interactive 3D graphics and games,2008:61-69.
74. Tang, M., Manocha, D., and Tong, R. Fast continuous collision detection using deforming non-penetration filters[C]. In Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, ACM,2010:7-13.
75. Tang, C., Li, S., and Wang, G., P. Reduced deforming filter culling for fast continuous collision detection[C]. Proceedings of the 17th ACM Symposium on Virtual Reality Software and Technology,2010:79-82.
76. Zhang, X., Redon, S., Lee, M., and Kim, Y. J. Continuous collision detection for articulated models using taylor models and temporal culling[J]. ACM Transactions on Graphics (Proceedings of SIGGRAPH 2007),26(3), July 2007.
77. Barbic, J.,and James, D. L. Subspace self-collision culling[J]. ACM Trans. on Graphics (SIGGRAPH 2010),2010,29(4):81:1-81:9.
78. Zachmann G., Langetepe E. Geometric data structures for computer graphics[C]. In Tutorial at ACM SIGGRAPH. ACM 27-31, July 2003.
79. ROUSSOPOULOS N., LEIFKER D. Direct spatial search on pictorial databases using packed R-trees[C]. In Proceedings of ACM-SIGMOD 1985 International Conference on Management of Data (Austin, Texas, May28-31 1985), pp.17-31.
80. GOLDSMITH J., SALMON J. Automatic creation of object hierarchies for ray tracing[J]. IEEE Computer Graphics and Applications,7,5 (May 1987),14-20.
81. MEZGER J., KIMMERLE S., ETZMUSS O. Hierarchical Techniques in Collision Detection for Cloth Animation[J]. Journal of WSCG 11,2 (2003),322-329.
82. ZACHMANN G. Minimal hierarchical collision detection[C]. In Proc. ACM Symposium on Virtual Reality Software and Technology (VRST) (Hong Kong, China, Nov.11-13,2002), pp. 121-128.
83. VOLINO P., MAGNENAT-THALMANN N. Collision and Self-Collision Detection:Efficient and Robust Solutions for Higly Deformable Surfaces. In Comp. Animation and Simulation. 1995, Springer Verlag, pp.55-65.
84. GOVINDARAJU, N., KNOTT, D., JAIN, N., KABUL, I., TAMSTORF, R.,GAYLE, R., LIN, M., AND MANOCHA, D. Interactive collision detection between deformable models using chromatic decomposition[J]. ACM Trans, on Graphics (Proc. of ACM SIGGRAPH) 24,3, 991-999,2005.
85. HEO, J.-P., SEONG, J.-K., KIM, D., OTADUY, M. A., HONG, J.-M.,TANG, M., AND YOON, S.-E. FASTCD:Fracturing-aware stable collision detection[C]. In ACM SIGGRAPH /Eurographics Symposium on Computer Animation.2010,149-158.
86. LOMBARDO, J.-C., PAULE CANI, M., AND NEYRET, F. Real-time collision detection for virtual surgery[J]. In Computer Animation.26-28,1999.
87. MATHIAS, E. AND GU, L. Hierarchical spatial hashing for real-time collision detection[C]. In IEEE International Conference on Shape Modeling and Applications.61-70,2007.
88. NEALEN, A., MULLER, M., KEISER, R., BOXERMAN, E., AND CARLSON, M. Physically based deformable models in computer graphics [C]. Computer Graphics Forum 25, 4,809-836,2006.
89. SUD, A., GOVINDARAJU, N., GAYLE, R., KABUL, I., AND MANOCHA,D. Fast proximity computation among deformable models using discrete voronoi diagrams[C]. Proc. of ACM SIGGRAPH,1144-1153,2006.
90. Tyson Brochu, Essex Edwards, Robert Bridson. Efficient geometrically exact continuous collision detection[J]. ACM Transactions on Graphics, v.31 n.4,1-7,2012.
91. Xinyu Zhang, Kim Y. J. Simple Culling Methods for Continuous Collision Detection of Deforming Triangles[J]. IEEE Transactions on Visualization and Computer Graphics,18(7), 1146-1155, July 2012.
92. Min Tang, Kim Y. J., Manocha D. Continuous collision detection for non-rigid contact computations using local advancement[C]. IEEE International Conference on Robotics and Automation,4016-4021, May 2010.
93. Min Tang, Manocha D., Sung-Eui Yoon, etc. VolCCD:Fast continuous collision culling between deforming volume meshes[J]. ACM Transactions on Graphics,30(5), October 2011.
94. Jia Pan, Chitta S., Manocha D. FCL:A general purpose library for collision and proximity queries[C]. IEEE International Conference on Robotics and Automation,3859-3866, May 2012.
95. Duksu Kim, Jae-Pil Heo, Jaehyuk Huh, etc. HPCCD:Hybrid Parallel Continuous Collision Detection using CPUs and GPUs[C]. Computer Graphics Forum,28(7),1791-1800, October 2009.
96. Xinyu Zhang, Minkyoung Lee, Kim Y. J. Interactive continuous collision detection for non-convex polyhedral[J]. The Visual Computer.22(9),749-760,2006.
97. Peng Du, Min Tang, Ruofeng Tong. Fast continuous collision culling with deforming noncollinear filters[J]. Computer Animation and Virtual Words, Volume 23, Issue 3-4, 375-383,2012.
98. Changxi Zheng, Doug L. James. Energy-based self-collision culling for arbitrary mesh deformations[J]. ACM Transactions on Graphics,31(4), July 2012.
99. Min Tang, Kim Y. J., Manocha D. C2A:controlled conservative advancement for continuous collision detection of polygonal models[C]. IEEE international conference on Robotics and Automation,356-361,2009.
100. Jen-Duo Liu, Ming-Tat Ko, Ruei-Chuan Chang. Collision avoidance in cloth animation[J]. The Visual Computer,12(5),234-243,1996.
101. Chen Tang, Sheng Li, Guopin Wang. Fast continuous collision detection using parallel filter in subspace[C]. I3D'11 Symposium on Interactive 3D Graphics and Games,71-80,2011.
102. Jung-Woo Chang, Wenping Wang, Myung-Soo Kim. Efficient collision detection using a dual OBB-sphere bounding volume hierarchy[J]. Computer-Aided Design,42(1),50-57,2010.
103. Min Tang, Dinesh Manocha, Ruofeng Tong. MCCD:Multi-core collision detection between deformable models using front-based decomposition[J]. Graphical Models,72(2),7-23, March 2010.
104. Jia Pan, Dinesh Manocha. GPU-Based Parallel Collision Detection for Real-Time Motion Planning[J]. Algorithmic Foundations of Robotics Ⅸ, Volume 68,211-228,2011.
105. Fuchang Liu, Takahiro Harada, Youngeun Lee, Young J. Kim. Real-time collision culling of a million bodies on graphics processing units[J]. ACM Transactions on Graphics,29(6), December 2010.
106. Jia Pan, Dinesh Manocha. GPU-based parallel collision detection for fast motion planning[J]. The International Journal of Robotics Research,31(2),187-200,2012.
107. Taubig, H. Bauml, B., Frese, U. Real-time swept volume and distance computation for self collision detection[C]. International Conference on Intelligent Robots and Systems (IROS), 1585-1592,2011.