论文信息 - Fast contact localisation between deformable polyhedra in motion

Fast contact localisation between deformable polyhedra in motion

This paper presents a new approach to detect and localise contact between concave deformable polyhedra. In this case there are many contact points between two polyhedra, the proposed algorithm detects and localises the contact in linear time O(n). It returns also the direction of this contact and the value of the maximum inter-penetration between the two convex-hulls of these two polyhedra.

Christian Laugier | Ammar Joukhadar | Ahmad Wabbi

[1] Alejandro M. García-Alonso,et al. Solving the collision detection problem , 1994, IEEE Computer Graphics and Applications.

[2] Andrew P. Witkin,et al. Dynamic simulation of non-penetrating flexible bodies , 1992, SIGGRAPH.

[3] Kazuo Tanie,et al. A force display system for virtual environments and its evaluation , 1992, [1992] Proceedings IEEE International Workshop on Robot and Human Communication.

[4] Ming C. Lin,et al. A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[5] Christian Laugier,et al. Dynamic modeling and its robotic applications (The Robot/spl Phi/ system) , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[6] Ammar Joukhadar. Robot : Dynamic modeling system for robotics applications , 1995 .

[7] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[8] P. Volino,et al. Efficient self‐collision detection on smoothly discretized surface animations using geometrical shape regularity , 1994 .

[9] Nadia Magnenat-Thalmann,et al. Efficient self‐collision detection on smoothly discretized surface animations using geometrical shape regularity , 1994, Comput. Graph. Forum.