该程序实现了Delaunay三角剖分的过程，能够对任意多边形实现三角化，效果不错。-program of the Delaunay triangulation process, to the arbitrary polygon triangulation achieve good results.

给定一系列坐标定点，先判定能否构成凸多边形，然后进行最优三角剖分-Given a series of fixed-point coordinates, first determine whether the composition of convex polygons, then the optimal triangulation

动态规划----多边形的最优三角剖分 输入测试用例个数 和 各个点的坐标 输出弦长最短的边的总和-Optimal Dynamic Programming---- polygon triangulation input test case number and the coordinates of each point of the output side of the chord length of the sum of the shortest

To find a triangulation of minimal total edge length. That is, an input polygon or the convex hull of an input point set must be subdivided into triangles that meet edge-to-edge and vertex-to-vertex, in such a way as to minimize the sum of the perime