POJ 1279 Art Gallery

 //求多边形内核的面积

#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
const double EP=1e-8;
struct Point{
    double x, y;
    Point(){}
    Point(double a, double b):x(a),y(b){}
};
int n;
Point p[1505];
void change(){
     Point temp[1800];
     int i;
     for(i=0;i<=n;i++){
         temp[i]=p[n-i];
     }
     for(i=0;i<=n;i++){
         p[i]=temp[i];
     }
}
double x_mult(Point sp, Point ep, Point op){
    return (sp.x-op.x)*(ep.y-op.y)-(sp.y-op.y)*(ep.x-op.x);
}
Point intersect(Point u1,Point u2,Point v1,Point v2){
      Point res=u1;
      double t=((u1.x-v1.x)*(v1.y-v2.y)-(u1.y-v1.y)*(v1.x-v2.x))/
               ((u1.x-u2.x)*(v1.y-v2.y)-(u1.y-u2.y)*(v1.x-v2.x));
     res.x+=(u2.x-u1.x)*t;
     res.y+=(u2.y-u1.y)*t;
     return res;
}
void cpy(Point *now, Point *p1, int num){
    for(int i=0; i<=num; i++)
    now[i]=p1[i];
}
double area(Point *p1, int num){
       double ans=0;
       for(int i=2;i<num;i++){
            ans+=x_mult(p1[i],p1[i-1],p1[0]);
       }
       ans/=2.0;
       return ans;
}
double solve(){
    int len=n, i, j;
    Point now[1505];
    Point tmp[1505];
    cpy(now, p, n);
    for(i=0; i<n; i++){
        int num=0;
        for(j=0; j<len; j++){
            if(x_mult(now[j], p[i+1], p[i])<EP)
                tmp[num++]=now[j];
            if(x_mult(now[j],p[i+1], p[i])*x_mult(now[j+1],p[i+1], p[i])<-EP)
                tmp[num++]=intersect(p[i], p[i+1], now[j], now[j+1]);
        }
        len=num;
        tmp[num]=tmp[0];
        cpy(now, tmp, len);
    }
    return area(now, len);
}

int main(){
    //freopen("1.txt", "r", stdin);
    int T, i;
    scanf("%d", &T);
    while(T--){
        scanf("%d", &n);
        for(i=0; i<n; i++)
            scanf("%lf%lf", &p[i].x, &p[i].y);
        p[n]=p[0];
        if(area(p,n)>EP)
            change();
        double ans=solve();
        printf("%.2f\n", fabs(ans));
    }
    return 0;
}