|
|||||
|
|
| 碰撞检测中计算两凸多面体间最短距离的算法研究 | |
| 引用本文： | 金汉均,李朝晖,王彦林,汪琼.碰撞检测中计算两凸多面体间最短距离的算法研究[J].武汉理工大学学报(交通科学与工程版),2006,30(2):300-302,346. |
| 作者姓名： | 金汉均 李朝晖 王彦林 汪琼 |
| 作者单位： | 1. 华中科技大学水电与数字化工程学院,武汉,430074;华中师范大学计算机科学系,武汉,430079 2. 华中科技大学水电与数字化工程学院,武汉,430074 3. 华中师范大学计算机科学系,武汉,430079 4. 湖北省经济管理干部学院,武汉,430079 |
| 摘 要： | 提出了一种计算两凸多面体问最短距离的算法．该算法用物体三维空间顶点坐标的凸包表示凸多面体，采用非线性规划方法来计算两凸多面体同最短距离，并通过最短距离来判断两凸多面体是否发生碰撞．实例证明这种方法的有效性． |
| 关 键 词： | 凸物体 凸包 碰撞检测 非线性规划 优化 |
| 收稿时间： | 2005-11-12 |
| 修稿时间： | 2005-11-12 |
Algorithm Research for Computing the Minimum Distance Between Two Convex Polyhedra in Collision Detection |
|
| Jin Hanjun,Li Zhaohui,Wang Yanlin,Wang Qiong.Algorithm Research for Computing the Minimum Distance Between Two Convex Polyhedra in Collision Detection[J].journal of wuhan university of technology(transportation science&engineering),2006,30(2):300-302,346. | |
| Authors: | Jin Hanjun Li Zhaohui Wang Yanlin Wang Qiong |
| Abstract: | An algorithm for computing the minimum distance between two convex polyhedra is presented. The algorithm is applied to polyhedral objects which can be represented as convex hulls of its value of vertices in three-dimensional space. Nonlinear programming techniques are then employed to computer the minimum distance between two convex polyhedra, and according to the minimum distance, it can be concluded whether or not the objects will collide. The algorithm of collision detecting presented in this paper improves the efficiency of collision detecting by simulation experiences. |
| Keywords: | Convex polyhedron Convex hull Collision detection Nonlinear programm ing Optimization |
| 本文献已被 维普 万方数据 等数据库收录！ | |