Data partitioning is an important step of parallel algorithm design. The load balance and efficiency of data partitioning is the precondition for improvement of parallel algorithm efficiency. For aggregated distributed point sets, the traditional Delaunay triangulation parallel algorithm can't ensure the balance and the execution's efficiency of the partitioning result. In view of the problems above, this paper we proposed a partitioning method using dynamic strips based on the idea of equally strips partitioning method in traditional Delaunay Triangulation construction and we titled it Dynamic Strip Partitioning Method. The detailed steps of this algorithm are as follows. First, the minimum bounding rectangle of the point data set should be obtained and the point set is roughly split using regular slim strips in the same direction. Then the number of points in every strip would be counted and the neighbor strips are merged into a partition region from the first strip in the sequence following a certain regulation. The boundaries of some strips should be moved dynamically if the total amount of points in these strips reached the load threshold value. In order to promote the efficiency of partitioning and reduce the boundaries movement, a rule of "move half points a time" has been used. We tested the speed-up of the Delaunay Triangulation parallel algorithm using the artificial point sets and tested the performance of the Delaunay triangulation parallel algorithm using the real test area point sets in the multi-kernel parallel computing systems. The results of the experiments showed that the method of dynamic strips partitioning can help to get high and stable speed-up of the Delaunay triangulation parallel algorithm and the data distributional pattern and size has less influence to it. Delaunay triangulation parallel algorithm based on dynamic strips partitioning method can get high efficiency and the speed-up effect is superior to the traditional method.