Rotating Scoreboard POJ - 3335

This year, ACM/ICPC World finals will be held in a hall in form of a simple polygon. The coaches and spectators are seated along the edges of the polygon. We want to place a rotating scoreboard somewhere in the hall such that a spectator sitting anywhere on the boundary of the hall can view the scoreboard (i.e., his line of sight is not blocked by a wall). Note that if the line of sight of a spectator is tangent to the polygon boundary (either in a vertex or in an edge), he can still view the scoreboard. You may view spectator’s seats as points along the boundary of the simple polygon, and consider the scoreboard as a point as well. Your program is given the corners of the hall (the vertices of the polygon), and must check if there is a location for the scoreboard (a point inside the polygon) such that the scoreboard can be viewed from any point on the edges of the polygon.

Input
The first number in the input line, T is the number of test cases. Each test case is specified on a single line of input in the form n x1 y1 x2 y2 … xn yn where n (3 ≤ n ≤ 100) is the number of vertices in the polygon, and the pair of integers xi yi sequence specify the vertices of the polygon sorted in order.

Output
The output contains T lines, each corresponding to an input test case in that order. The output line contains either YES or NO depending on whether the scoreboard can be placed inside the hall conforming to the problem conditions.

Sample Input
2
4 0 0 0 1 1 1 1 0
8 0 0 0 2 1 2 1 1 2 1 2 2 3 2 3 0
Sample Output
YES
NO

Think：求多边形的核，半平面交模板题

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std;
#define eps 1e-8
const int MAXN=10010;
int n;
double r;
int cCnt,curCnt;
struct point{
    double x,y;
};
point points[MAXN],p[MAXN],q[MAXN];
void getline(point x,point y, double &a, double &b, double &c){
    a=y.y-x.y;
    b=x.x-y.x;
    c=y.x*x.y-x.x*y.y;
}
void initial(){
    for (int i=1;i<=n;i++)
        p[i]=points[i];
    p[n+1]=p[1];
    p[0]=p[n];
    cCnt=n;
}
point intersect(point x,point y,double a,double b,double c){
    double u=fabs(a*x.x+b*x.y+c);
    double v=fabs(a*y.x+b*y.y+c);
    point pt;
    pt.x=(x.x*v+y.x*u)/(u+v);
    pt.y=(x.y*v+y.y*u)/(u+v);
    return pt;
}
void cut(double a,double b,double c){
    curCnt=0;
    int i;
    for (i=1;i<=cCnt;i++){
        if (a*p[i].x+b*p[i].y+c>=0)
            q[++curCnt]=p[i];
        else{
            if (a*p[i-1].x+b*p[i-1].y+c>0){
                q[++curCnt]=intersect(p[i],p[i-1],a,b,c);
            }
            if (a*p[i+1].x+b*p[i+1].y+c>0){
                q[++curCnt]=intersect(p[i],p[i+1],a,b,c);
            }
        }
    }
    for (i=1;i<=curCnt;i++)
        p[i]=q[i];
    p[curCnt+1]=q[1];
    p[0]=p[curCnt];
    cCnt=curCnt;
}

void solve(){
    initial();
    for (int i=1;i<=n;i++){
        double a,b,c;
        getline(points[i],points[i+1],a,b,c);
        cut(a,b,c);
    }
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for (int i=1;i<=n;i++){
            scanf("%lf%lf",&points[i].x,&points[i].y);
        }
        points[n+1]=points[1];
        solve();
        if (cCnt<1){
            printf("NO\n");
        }
        else{
            printf("YES\n");
        }
    }
    return 0;
}