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 works for you:

• find the center point of all your points (sum of all x / number of x's, same for y)
• take the farthest point from the center as a corner point
• project line through the 2nd farthest point in a 90° angle of the corner point
• iterate over the points of the other side of the center point and find minimum