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

Delualy 三角网 同时生成Vionoi多边形-Delualy also generate Vionoi polygon triangulation

根据已知点获取Voronoi三角形，使用c#进行程序的编写-Voronoi triangles according to the known access point, use c# to write the program