说明：  Voronoi Diagram算法实现主要运用分治法和凸包的方法来实现。 分治法： 1) 该问题的规模缩小到一定的程度就可以容易地解决 2) 该问题可以分解为若干个规模较小的相同问题，即该问题具有最优子结构性质。 3) 利用该问题分解出的子问题的解可以合并为该问题的解； 4) 该问题所分解出的各个子问题是相互独立的，即子问题之间不包含公共的子问题。
(Voronoi Diagram algorithm is mainly using the method of partition and the method of convex hull. Divide and conquer method: 1) reduced to a certain degree the problem can be easily solved 2) the problem can be broken down into several smaller same problem, that is, the problem is in the nature of optimal substructure. 3) by using the solution of problem into sub-problems can be combined for the solution of the problem 4) the decomposition of the problem each subproblem is independent of each other, between the subproblems do not contain public subproblems.)