**Problem:**

- Given:
- P =
- A weight function w on triangles formed by P and T.

- Find T that minimizes the sum of weights

- Example:
(Euclidean distance)
- Looks a bit like matrix chaining
- Optimal substructure
- T contains
.

. - The two subproblem solutions must be optimal or w(T) would be less.

- T contains
.
- This algorithm requires
time.
- This algorithm requires
memory.

Example of Guarding an Art Gallery