Question: 2. (20 points) Let P be a convex polygon with n vertices. A triangulation of P is an addition of a set of non-crossing diagonals

2. (20 points) Let P be a convex polygon with n vertices. A triangulation of P is an addition of a set of non-crossing diagonals (which connect non-neighboring vertices of P) such that the interior of P is partitioned by the set of diagonals into a set of triangles. The weight of each diagonal is the Euclidean distance of the two vertices it connects. The weight of a triangulation is the total weight of its added diagonals. Design a dynamic programming algorithm to find a minimum weighted triangulation of P. You should make your running time as short as possible. 2. (20 points) Let P be a convex polygon with n vertices. A triangulation of P is an addition of a set of non-crossing diagonals (which connect non-neighboring vertices of P) such that the interior of P is partitioned by the set of diagonals into a set of triangles. The weight of each diagonal is the Euclidean distance of the two vertices it connects. The weight of a triangulation is the total weight of its added diagonals. Design a dynamic programming algorithm to find a minimum weighted triangulation of P. You should make your running time as short as possible
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
