fortune扫描线算法生成voronoi图的演示代码，可以动态观察算法运行，对原理的理解有很大的帮助！ ,This routing briefly describes what a Voronoi diagram is and provides an interactive demonstration of how these can be created using Fortune s plain-sweep algorithm.

利用Voronoi图及其对偶Delaunay三角网研究平面离散点集拓扑邻近稳定区域的计算方法，给出拓扑邻近稳定区域的概念，证明点的拓扑邻近稳定区域必须满足的两个条件，给出点的拓扑邻近稳定区域定量计算模型，并通过试验证明其正确性。-A method to maintain the neighboring relations between each two points in discrete points set is studied based on the delaunay triangul

GIS算法课件:Delaunay三角网与Voronoi图算法，绝对适合GIS新手-GIS algorithm courseware: Delaunay triangulation and Voronoi diagram algorithm, and is suitable for novice GIS

从excel中导入点数据，通过先构建delaunay三角网再生成voronoi图-Import point data the excel, through the first build Delaunay triangulation and then generate Voronoi diagram