说明：  从Voronoi结构所脱胎的计算几何来看，Voronoi图是对平面n个离散点而言的，它把平面分为几个区，每一个区包括一个点，该点所在的区是到该点距离最近点的集合。
(From the perspective of a Voronoi structure have spun out of the computational geometry, Voronoi diagram is for plane n discrete points, it put the plane is divided into several districts, each district includes a point, the point of the area where is the nearest to the point at which point set.)