Thursday, 2 October 2014

Minimum Cost Polygon Triangulation

A triangulation of a convex polygon is formed by drawing diagonals between non-adjacent vertices (corners) such that the diagonals never intersect. The problem is to find the cost of triangulation with the minimum cost. The cost of a triangulation is sum of the weights of its component triangles. Weight of each triangle is its perimeter […]


The post Minimum Cost Polygon Triangulation appeared first on GeeksforGeeks.






By GeeksforGeeks



Read it the full article here
Post a Comment