An optimal triangulation algorithm for general polygon based on edge prior

Aiming at the problem that present polygon triangulation algorithms can't simultaneously give attention to briefness, efficiency, applicability and quality of triangulation, a new optimal triangulation algorithm for general polygon based on edge prior is proposed.Firstly, the algorithm creates triangles for edges of polygon, and then for non-constrained edges, at last, the triangulation for polygon is accomplished.The results of the triangulation are constrained Delaunay triangulation meshes.The shape of the meshes is stable, optimized.The algorithm is simple, with high efficiency and the same with random complicated polygons.The experiment results prove the rationality and efficiency of the algorithm, and have a better solution for the problems that existed in present polygon triangulation algorithms.