poj 2451 Uyuw's Concert

题意：在一个正方形区域内，划几条线，问线内最后剩下的面积。

题解：半平面交的裸题。

算法：排序增量法求半平面交，复杂度O（nlogn）（摘自《ACM-ICPC程序设计系列 计算几何及应用》）

step1：将所有的半平面按照极角排序，排序过程还要将平行的半平面去重

step2：使用一个双端队列deque，加入极角最小的两个半平面

step3：扫描过程每次考虑一个新的半交面：

A：while deque 顶端两个半平面的交点在当前半平面外：删除deque顶端的半平面

B：while deque 底部两个半平面的交点在当前半平面外：删除deque底部的半平面

C：将当前半平面加入deque顶端

step4：删除deque两端延伸出的多余半平面：

A：while deque 顶端两个半平面的交点在底部半平面外：删除deque顶端的半平面

B：while deque 底部两个半平面的交点在顶端半平面外：删除deque底部的半平面

step5：按顺序求取deque中相邻半平面的交点，得到n和半平面交出的凸多边形

代码（刘汝佳的模板）

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define N 50005

using namespace std;

const double eps=1e-8;

int dcmp(double x) {
    if (x<eps&&x>-eps) return 0;
    return (x>0)?1:-1;
}
struct Point 
{
    double x,y;
    Point(double X=0,double Y=0)
	{
        x=X,y=Y;
    }
};

struct Line
{
    Point p;
    Point v;
    double ang;
    Line(Point P=Point(0,0),Point V=Point(0,0)) {
        p=P,v=V;
        ang=atan2(v.y,v.x);
    }
    bool operator < (const Line &a) const {
        return ang<a.ang;
    }
};
Point operator + (Point a,Point b) {return Point(a.x+b.x,a.y+b.y);}
Point operator - (Point a,Point b) {return Point(a.x-b.x,a.y-b.y);}
Point operator * (Point a,double b) {return Point(a.x*b,a.y*b);}

int n,l,r,m,cnt;
double ans;
Line L[N],q[N];
Point p[N],poly[N];

double Cross(Point a,Point b) {
    return a.x*b.y-a.y*b.x;
}
Point GLI(Point P,Point v,Point Q,Point w) {
    Point u=P-Q;
    double t=Cross(w,u)/Cross(v,w);
    return P+v*t;
}
bool Onleft(Line m,Point P) {
    Point w=P-m.p;
    return dcmp(Cross(m.v,w))>0;
}
void halfp(){
    sort(L+1,L+n+1);
    cnt=0;
    q[l=r=1]=L[1];
    for (int i=2;i<=n;++i) {
        while (l<r&&!Onleft(L[i],p[r-1])) --r;
        while (l<r&&!Onleft(L[i],p[l])) ++l;
        q[++r]=L[i];
        if (dcmp(Cross(q[r].v,q[r-1].v))==0) {
            --r;
            if (Onleft(q[r],L[i].p))
                q[r]=L[i];
        }
        if (l<r)
            p[r-1]=GLI(q[r-1].p,q[r-1].v,q[r].p,q[r].v);
    }
    while (l<r&&!Onleft(q[l],p[r-1]))
        --r;
    if (r-l<=1) return;
    p[r]=GLI(q[r].p,q[r].v,q[l].p,q[l].v);
    for (int i=l;i<=r;++i) poly[++cnt]=p[i];
}
double Area() {
    double ans=0;
    for (int i=2;i<cnt;++i)
        ans+=Cross(poly[i]-poly[1],poly[i+1]-poly[1]);
    return fabs(ans) / 2;
}

int main() {
    scanf("%d",&n);
    for (int i=1;i<=n;++i) 
	{
        Point P,Q;
		double a,b,c,d;
        scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
        P=Point(a,b);
		Q=Point(c,d);
        L[i]=Line(P,Q - P);
    }
    L[++n]=Line(Point(0,0),Point(10000,0));
    L[++n]=Line(Point(10000, 0),Point(0, 10000));
    L[++n]=Line(Point(10000,10000),Point(-10000,0));
    L[++n]=Line(Point(0, 10000),Point(0,-10000));
    halfp();
    printf("%.1lf\n",Area());
    return 0;
}