How many different possible triangulations can be constructed for a regular hexagon?
How many triangles will the triangulation of a simple polygon with sides contain?
Suppose a convex polygon has vertices . In any triangulation we can assign a weight to each triangle to be the length of its perimeter. Let the cost of a triangulation be the sum of the weights of its component triangles. Write an algorithm to find a triangulation with the minimum cost.
If the minimum cost of triangulation for a convex polygon with the the coordinates below, what is the value of ?