You are given a convex polygon P on n vertices in the plane (specified by their x and y coordinates). A triangulation of P is a collection of n − 3 diagonals of P such that no two diagonals intersect (except possibly at their endpoints). Notice that a triangulation splits the polygon’s interior into n − 2 disjoint triangles. The cost of a triangulation is the sum of the lengths of the diagonals in it. Give an efficient algorithm for finding a triangulation of minimum cost. (Hint: Label the vertices of P by 1,..., n, starting from an arbitrary vertex and walking clockwise. For 1 ≤ i ≤ j ≤ n, let the subproblem A(i, j) denote the minimum cost triangulation of the polygon spanned by vertices i, i + 1,..., j.)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.