Posted in Make an algorithm
Given a set of points in plane, determine a rectangle with the smallest possible perimeter which contains all the points. The rectangle is not necessarily aligned with x or y axis.
For example:
a={(0, 0), (2, 1), (1, 2), (3, 3)}.
The smallest perimeter of rectangle is 8*sqrt{2}
