I have a set of points defining a convex polygon, and would like to find the enclosing parallelogram with the minimum area using Python and/or NumPy.

Here are some possible useful resources, but I'm not able to make enough sense of them myself:
[minboundparallelogram(x,y,metric) in MATLAB](http://uk.mathworks.com/matlabcentral/fileexchange/34767-a-suite-of-minimal-bounding-objects/content/MinBoundSuite/minboundparallelogram.m)  

[Paper on a couple of proposed algorithms](ftp://ftp.icsi.berkeley.edu/pub/techreports/1994/tr-94-036.ps.gz)

Any help greatly appreciated. An O(n) solution isn't critical.