UVA - 10652 Board Wrapping (二维凸包)

大体题意：

给你n 个长方形，可以任意旋转，求得一个多边形，把长方形都包括在内，最后输出  长方形的面积和 与 多边形面积的比值！

思路：

二维凸包，将长方形的四个顶点输入，最后求得凸包便是多边形，统计下面积即可！

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;
const double eps = 1e-10;
const int maxn = 1000 + 10;
const double pi = acos(-1.0);
struct Point{
    double x,y;
    Point(double x = 0,double y = 0):x(x),y(y){}
}p[maxn<<2],tubao[maxn<<2];
typedef Point Vector;
Vector operator + (Vector A,Vector B) { return Vector(A.x+B.x,A.y+B.y); }
Vector operator - (Vector A,Vector B) { return Vector(A.x-B.x,A.y-B.y); }
Vector operator * (Vector A,double p) { return Vector(A.x*p,A.y*p); }
Vector operator / (Vector A,double p) { return Vector(A.x/p,A.y/p); }
bool operator < (const Point& a,const Point & b){
    return a.x < b.x || (fabs(a.x-b.x) < eps && a.y < b.y);
}
int dcmp(double x){
    if (fabs(x) < eps)return 0;
    return x < 0 ? -1 : 1;
}
bool operator == (const Point &a, const Point& b){
    return dcmp(a.x-b.x) == 0 && dcmp(a.y-b.y) == 0;
}
//double Dot(Vector A,Vector B) { return A.x*B.x + A.y*B.y; }
//double Length(Vector A) { return sqrt(Dot(A,A)); }
//double Angle(Vector A,Vector B) { return acos(Dot(A,B) / Length(A) / Length(B)); }
Vector Rotate(Vector A,double rad){
    return Vector(A.x*cos(rad) - A.y*sin(rad), A.x*sin(rad)+A.y*cos(rad));
}
double Cross(Vector A,Vector B) { return A.x*B.y-A.y*B.x; }
double PolygonArea(Point *p,int n){
    double area = 0;
    for (int i = 1; i < n-1; ++i){
        area += Cross(p[i]-p[0],p[i+1]-p[0]);
    }
    return area/2;
}
int ConvexHull(Point *p,int n,Point* ch){
    sort(p,p+n);
    int m = 0;
    for (int i = 0; i < n; ++i){
        while(m > 1 && Cross(ch[m-1]-ch[m-2],p[i] - ch[m-2]) <= 0)--m;
        ch[m++] = p[i];
    }
    int k = m;
    for (int i = n-2; i >= 0; --i){
        while(m > k && Cross(ch[m-1]-ch[m-2],p[i] - ch[m-2]) <= 0)--m;
        ch[m++] = p[i];
    }
    if (n > 1)--m;
    return m;
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        double S = 0;
        int cnt = 0;
        for (int i = 0; i < n; ++i){
            double x,y,w,h,f;
            scanf("%lf %lf %lf %lf %lf",&x,&y,&w,&h,&f);
            S += w*h;
            double ang = -f*pi/180;
            Vector ori = Vector(x,y);
            p[cnt++] = ori + Rotate(Vector(-w/2,-h/2),ang);
            p[cnt++] = ori + Rotate(Vector(-w/2,h/2),ang);
            p[cnt++] = ori + Rotate(Vector(w/2,-h/2),ang);
            p[cnt++] = ori + Rotate(Vector(w/2,h/2),ang);
        }
        int m = ConvexHull(p,cnt,tubao);
        double ans = PolygonArea(tubao,m);
        ans = S*100.0/ans;
        printf("%.1lf %%\n",ans);
    }
    return 0;
}