构建离散点集的Voronoi图，算法大致流程:先构建Delaunay TIN,然后连接相邻三角形的重心记得Voronoi图，然后基于TIN的拓扑，构建Voronoi多边形的拓扑关系。-Construction of discrete point set Voronoi diagram algorithm for general processes: first, to build Delaunay TIN, then remember that the focus of a triangle c

膨胀法Voronoi图的c算法，并且使用并行计算进行改进-Voronoi diagram expansion method