Introduction - If you have any usage issues, please Google them yourself
A convex polygon P 8 vertex clockwise {v1, v2, ..., v8}, any two vertices of the segment between the weights given by the matrix D. If vi and vj are not adjacent to P on two vertices, then P is a line segment vivj called chord. Find P of a chord set T, such that T in all the strings happen to the P divided into non-overlapping triangles, and each triangle weights and the minimum (a triangular weighting of their respective weights of the edges and) .