Trees MATLAB Puzzler

Given a group of trees, find the rectangular bounding box in the x-y direction that holds all the trees. Once you have that bounding box, look for the largest rectangle (by area) that can be made inside the bounding box. Of course, this rectangle can have no trees in the interior.

Since this is a more difficult problem, you may want to look at the first video to see the outline for an algorithm to solve this: