Research On Delaunay Triangulation Algorithm

Based on the optimization criteria of Delaunay triangulation,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 by Python language.Finally it tested the robustness of the software through a large number of data.The Delaunay triangulation algorithm is extended to three dimensional space,two three-dimensional tetrahedral mesh algorithm and related processing methods for discrete point set are given.