最小权重三角划分。输入一个多边形顶点坐标，输出具有最小权重的三角划分。(The minimum-weight triangulation problem is the problem of finding 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