Algorithm research for computing the minimum distance between two convex polyhedra in collision detection

被引：0

作者：

Jin, Hanjun

Li, Zhaohui

Wang, Yanlin

Wang, Qiong

机构：

[1] Institute of Hydroelectricity and Data Engineering, Huazhong University of Science and Technology, Wuhan 430074, China

[2] Department of Computer Science, Central China Normal University, Wuhan 430079, China

[3] Hubei Institute of Economy Management Cadre, Wuhan 430079, China

来源：

Wuhan Ligong Daxue Xuebao (Jiaotong Kexue Yu Gongcheng Ban)/Journal of Wuhan University of Technology (Transportation Science and Engineering) | 2006年 / 30卷 / 02期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：300 / 302