Minimum Cost Polygon Triangulation – Dynamic Programming A triangulation of a convex polygon is formed by drawing diagonals between non-adjacent vertices
Proving correctness of the algorithm for convex polygon minimum cost
1 Article
1