凸包，多边形面积（包装木板，uva 10652）

模板题

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2500;

struct Point
{
    double x,y;
    Point(double x=0,double y=0):x(x),y(y){}
    bool operator < (const Point& rhs) const
    {
        return x<rhs.x||(x==rhs.x&&y<rhs.y);
    }
};

typedef Point Vector;

const double eps = 1e-10;
int dcmp(double x)
{
    if(fabs(x)<eps) return 0;
    else return x<0?-1:1;
}

Vector operator - (Point A,Point B)
{
    return Vector(A.x-B.x,A.y-B.y);
}

bool operator == (Point A,Point B)
{
    return dcmp(A.x-B.x)==0&&dcmp(A.y-B.y)==0;
}

double Cross(Vector A,Vector B)
{
    return A.x*B.y-A.y*B.x;
}

int ConvexHull(Point *P,int n,Point *ans)
{
    sort(P,P+n);
    n=unique(P,P+n)-P;
    int m=0;
    for(int i=0;i<n;i++)
    {
        while(m>1&&dcmp(Cross(ans[m-1]-ans[m-2],P[i]-ans[m-2]))<=0) m--;
        ans[m++]=P[i];
    }
    int k=m;
    for(int i=n-2;i>=0;i--)
    {
        while(m>k&&dcmp(Cross(ans[m-1]-ans[m-2],P[i]-ans[m-2]))<=0) m--;
        ans[m++]=P[i];
    }
    if(n>1) m--;
    return m;
}

double Area(Point *P,int n)
{
    double ret=0;
    for(int i=1;i<n-1;i++)
        ret+=Cross(P[i]-P[0],P[i+1]-P[0]);
    return ret/2;
}

struct Circle
{
    Point c;
    double r;
    Circle(Point c=Point(),double r=0):c(c),r(r){}
    Point point(double rad)
    {
        return Point(c.x+r*cos(rad),c.y+r*sin(rad));
    }
};

double angle(Vector A)
{
    return atan2(A.y,A.x);
}

double torad(double deg)
{
    return deg/180*acos(-1);
}

Point P[maxn];
Point ans[maxn];
double sum;

int main()
{
    int T,n;
    double x,y,w,h,rad;
    scanf("%d",&T);
    while(T--)
    {
        sum=0;
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            scanf("%lf %lf %lf %lf %lf",&x,&y,&w,&h,&rad);
            rad=torad(rad);
            Point O=Point(x,y);
            double r=sqrt(w*w+h*h)/2;
            Circle C=Circle(O,r);
            Vector v1=Vector(w,h);
            Vector v2=Vector(-w,h);
            Vector v3=Vector(-w,-h);
            Vector v4=Vector(w,-h);
            double rad1=angle(v1);
            double rad2=angle(v2);
            double rad3=angle(v3);
            double rad4=angle(v4);
            int I=4*i;
            P[I]=C.point(rad1-rad);
            P[I+1]=C.point(rad2-rad);
            P[I+2]=C.point(rad3-rad);
            P[I+3]=C.point(rad4-rad);
            sum+=w*h;
        }
        n*=4;
        int m=ConvexHull(P,n,ans);
        printf("%.1lf %%\n",sum/Area(ans,m)*100);
    }
    return 0;
}