Minimum enclosing rectangle of a convex polygon proof
I've been reading about the rotating calipers algorithm for solving the minimum-area enclosing rectangle problem. It relies on a theorem: The rectangle of minimum area enclosing a convex polygon has a side collinear with one of the edges of the polygon.
Can someone explain why is this true?
Thanks in advance