Minkowski sum algorithm of convex polyhedron based on three-dimensional convex hull
Qian Zhao · Journal of Yanshan University · 2015
In the calculation of the exact collision detection between the actual object,the traditional Minkowski sum algorithm are difficult to directly obtain data required for operation,so there needs for large amounts of data pre-processing. In order to improve the computing speed,reduce the amount of data processing,a new calculation method of 3D convex hull is designed and used to calculate the Minkowski sum of two spatial convex polyhedrons directly through their point cloud information. And the Minkowski sum boundary information is represented by the calculated results of convex hull face set. A detailed description of the algorithm is given and the complexity of the algorithm is analyzed. The results show that the algorithm is effectiveness through comparing the experimental data.