There are a few algorithms around for finding the minimal bounding rectangle (OBB) containing a given (convex) polygon.

Does anybody know about an algorithm for finding a minimal-area bounding quadrilateral (any quadrilateral, not just rectangles)?

I've been refered to this site from stackoverflow.com (original post), since the guys over there did not know the answer to this...

(PS: I'm a programmer and not a mathematician, so I would appreciate especially if you could point me to exisiting implementations if there are any... Thanks a lot!)