How to find an arbitrarily oriented minimum bounding box in c++

Question

So let\'s say I have a list of N pairs of positive long coordinates (points).
How do I find the smallest rectangle containing all of them?
The rectangle can also have fl

Answer 1

Maybe this paper can help: Smallest k point enclosing rectangle of arbitrary orientation