如何在c ++中找到任意定向的最小边界框

#include<iostream>
#include<vector>
#include<algorithm>

struct Point {
    int x;
    int y;
};

int main() {
    std::vector<Point> points = { {1, 2}, {3, 4}, {5, 6}, {7, 8} };

    int min_x = INT_MAX;
    int min_y = INT_MAX;
    int max_x = INT_MIN;
    int max_y = INT_MIN;

    for (const auto& point : points) {
        min_x = std::min(min_x, point.x);
        min_y = std::min(min_y, point.y);
        max_x = std::max(max_x, point.x);
        max_y = std::max(max_y, point.y);
    }

    Point min_point = { min_x, min_y };
    Point max_point = { max_x, max_y };

    std::cout << "Minimum Bounding Box: ("<< min_point.x << ", "<< min_point.y << ") - ("<< max_point.x << ", "<< max_point.y << ")\n";

    return 0;
}