POJ 1474 Video Surveillance

这题方法非常巧妙，让我认识到了半平面的另一种用法。

方法是沿逆时针方向，把每条边抖遍历一遍去切割这个多边形，如果最后切割有公共区域，那么就说明该区域可以看到所有的边，如果没有，则不行。

至于代码，只需要写个主函数，其他模版直接上就可以了。

//
//  main.cpp
//  Richard
//
//  Created by 邵金杰 on 16/8/10.
//  Copyright © 2016年 邵金杰. All rights reserved.
//

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
#define EPS 1e-6
struct Point{
    double x,y;
    Point(double x,double y): x(x),y(y) {}
};
struct Vector{
    double x,y;
    Vector(double x,double y): x(x),y(y) {}
};
struct Seg{
    Point a,b;
    Seg(Point a,Point b): a(a),b(b) {}
};
Vector operator - (Point p,Point q)
{
    return Vector(p.x-q.x,p.y-q.y);
}
Vector operator * (Vector p,double k)
{
    return Vector(k*p.x,k*p.y);
}
double operator * (Vector p,Vector q)
{
    return p.x*q.x+p.y*q.y;
}
Point operator + (Point p,Vector q)
{
    return Point(p.x+q.x,p.y+q.y);
}
bool operator == (Point p,Point q)
{
    return p.x==q.x&&p.y==q.y;
}
double length(Vector p)
{
    return sqrt(p*p);
}
double cross(Vector p,Vector q)
{
    return p.x*q.y-p.y*q.x;
}
bool IsZero(double x)
{
    return -EPS<x&&x<EPS;
}
int sign(double x)
{
    return fabs(x)<EPS?0:x>0?1:-1;
}
double area(Vector p,Vector q)
{
    return cross(p,q)/2;
}
bool IsFormalCross(Point p1,Point p2,Point p3,Point p4)
{
    return cross(p2-p1,p3-p1)*cross(p2-p1,p4-p1)<EPS&&cross(p4-p3,p1-p3)*cross(p4-p3,p2-p3)<-EPS;
}
bool FLessEq(double a,double b)
{
    return b-a>EPS||IsZero(b-a);
}
bool PointInSeg(Point p,Seg L)
{
    double temp=cross(p-L.a,L.b-L.a);
    if(!IsZero(temp)) return false;
    if(FLessEq(min(L.a.x,L.b.x),p.x)&&FLessEq(p.x,max(L.a.x,L.b.x))
       &&FLessEq(min(L.a.y,L.b.y),p.y)&&FLessEq(p.y,max(L.a.y,L.b.y))) return true;
    return false;
}
double Distance(Point p,Seg s)
{
    return cross(p-s.a,s.b-s.a)/length(s.b-s.a);
}
pair<int,Point> CrossPoint(Seg s1,Seg s2)
{
    Point p1=s1.a;
    Point p2=s1.b;
    Point p3=s2.a;
    Point p4=s2.b;
    double a1=area(p3-p1,p4-p1);
    double a2=area(p4-p2,p3-p2);
    if(IsFormalCross(p1, p2, p3, p4)) return make_pair(0,p1+(p2-p1)*(a1/(a1+a2)));
    if(!(IsZero(cross(p2-p1,p3-p4)))){
        if(p1==p3||p1==p4)
            return make_pair(1,p1);
        if(p2==p3||p2==p4)
            return make_pair(1,p2);
        if(PointInSeg(p1, s2))
            return make_pair(2,p1);
        if(PointInSeg(p2, s2))
            return make_pair(2,p2);
        if(PointInSeg(p3, s1))
            return make_pair(3,p3);
        if(PointInSeg(p4, s1))
            return make_pair(3,p4);
        Point crosspoint=p1+(p2-p1)*(a1/(a1+a2));
        if(PointInSeg(crosspoint, s1))
            return make_pair(8,crosspoint);
        if(PointInSeg(crosspoint, s2))
            return make_pair(9,crosspoint);
        return make_pair(4,crosspoint);
    }
    if(!IsZero(Distance(p1, s2)))
        return make_pair(5,Point(0,0));
    if(PointInSeg(p1, s2))
        return make_pair(6,p1);
    if(PointInSeg(p2, s2))
        return make_pair(6,p2);
    if(PointInSeg(p3, s1))
        return make_pair(6,p3);
    if(PointInSeg(p4, s1))
        return make_pair(6,p4);
    return make_pair(7,Point(0,0));
}
typedef vector<Point> polygon;
int CutPolygon(polygon &src,Point a,Point b,polygon &result)
{
    int n=(int)src.size();
    result.clear();
    for(int i=0;i<n;i++)
    {
        Point c=src[i];
        Point d=src[(i+1)%n];
        if(sign(cross(b-a,c-a))>=0)
            result.push_back(c);
        pair<int,Point> r=CrossPoint(Seg(c,d), Seg(a,b));
        if(r.first==0||r.first==8||r.first==3)
            result.push_back(r.second);
    }
    return (int)result.size();
}
int main()
{
    int n,kase=0;
    while(scanf("%d",&n)&&n)
    {
        double x,y;
        polygon points,src,result;
        for(int i=0;i<n;i++)
        {
            scanf("%lf%lf",&x,&y);
            points.push_back(Point(x,y));
        }
        src=points;
        for(int i=n-1;i>=0;i--)
        {
            CutPolygon(src,points[(i+1)%n], points[i], result);
            src=result;
            if(result.size()==0) break;
        }
        if(kase) printf("\n");
        printf("Floor #%d\n",++kase);
        result.size()==0?printf("Surveillance is impossible.\n"):printf("Surveillance is possible.\n");
    }
    return 0;
}