In fact, this issue is essentially regarded as a geometry problem, but still and Optimum Order of dynamic programming algorithm is very similar.
Itself is a closed polygon line segments connected end to end by a closed curve composition. All the points inside the polygon is enclosed inside of the polygon is called; polygon itself constitutes a polygon boundary; belong remaining outside the polygon. When a simple polygon and a closed convex set of internal structure, to call this a convex polygon.
Defined : polygon triangulation is to be set mutually spaced polygonal cross strings triangle T.
Optimal Triangulation convex polygon problem : Given a convex polygon P = {v0, v1, v2 , v3, .., vn-1}, and the string is defined by the triangular sides of the polygon consisting of the weight function w. Triangulation requires determination of the convex polygon so that the weight corresponding to the triangulation, i.e. the weights of the triangulation of the triangle and the smallest.