A New Exact Algorithm About Convex Polyhedron Minkowski Sum In Three Dimensional Speace

In scientific research and applications in the field of computer. Computationalgeometry is a relatively new discipline in the field and has excellent prospects, which aremainly discussed in the computer field representation geometry, the study aims to howmathematical models can be efficient and flexible construction geometry, as well as howto better computer models of these geometric calculations. The Minkowski Sum as animportant branch in computational geometry, it’s great significance both in theory and inpractice applications, the existing research results have been widely used in robot researchdisciplines, computer graphics disciplines, virtual simulation other fields. And how to beable to provide more effective research-based algorithm and Minkowski Sum basisalgorithm for the practical application of the theory, has been the major research areasscholars.Firstly, this paper researches the existed approach of Minkowski sum of two convexpolyhedra. Using the concept of the pole and the pole area, We research and analysis anew exact algorithm of the three-dimensional convex polyhedron.Secondly, in order to effectively carry out a new three-dimensional convexpolyhedron of Minkowski Sum algorithm, First with the summation method oftwo-dimensional convex polygons as the starting point, Seeking an efficient, and accuratemethod which is based on the content of the pole and the pole area.Then, Based on the exact Minkowski Sum in two-dimensional, In-depth study anaccurate and efficient Minkowski Sum of two Polyhedrons in three-dimensional with thepole and the pole area. From simple to complex, from straightforward to complex convexpolyhedron in three-dimensional, We achieve the solving process of the Minkowski Sumalgorithms. And improve the efficiency and definition of the algorithm by our best. Thispaper gives the detailed implementation steps and principle of the new Minkowski Sumalgorithm to seek the sum of two Polyhedrons.Finally, we validate the above algorithm and give the results. We also do some comparison and analysis with the existing algorithm.uracy and efficiency, and we compared the results with other existing algorithms.