【摘要】 提出了一种简单多边形的动态Delaunay三角剖分算法,其时间复杂度为O(n).从理论上证明了算法的正确性,并利用Python语言开发了一款动态Delaunay三角网生成软件,最后通过大量数据测试了该软件的健壮性并得到实例证实.更多还原

【Abstract】 A simple dynamic polygon triangulation algorithm is proposed,its time complexity is O(n).The correctness of the algorithm is proved,and a dynamic triangular mesh generation software is developed.Finally it tested the robustness of the software through a large number of data.更多还原