POJ 1584 A Round Peg in a Ground Hole （判断凸多边形模板）

题目链接：http://poj.org/problem?id=1584

题意：给出一个多边形和一个圆，问是否是凸多边形，若是则再问圆是否在凸多边形内部。

5 1.5 1.5 2.0
1.0 1.0
2.0 2.0
1.75 2.0
1.0 3.0
0.0 2.0
5 1.5 1.5 2.0
1.0 1.0
2.0 2.0
1.75 2.5
1.0 3.0
0.0 2.0
1

每个样例第一行n（n < 3停止） 然后给出圆的半径和圆心坐标。

后面n行每行一个点，按照逆时针或者顺时针的顺序，可能存在共线的三点。

参考博客：http://www.cnblogs.com/rainydays/archive/2011/07/05/2098102.html

套模板。

分3步：


1、判断是否是凸多边形


2、判断点是否在多边形内部


3、判断点到各边的距离是否大于等于半径


首先，若点是顺时针则reverse()改为逆时针，reverse函数就是用来把数组反向的。然后利用每3个相邻点组成的两条向量的叉积来判断，都应大于等于零。然后，判断是否在内部，利用钉子点和多边形每两个相邻点，组成两个向量。判断叉积是否全都大于0（全为逆时针）。再就是判断点到直线的距离，利用三角形面积除以底边，面积用叉积求。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
const double eps = 1e-8;
const double PI = acos(-1.0);
int sgn(double x) {
	if(fabs(x) < eps)return 0;
	if(x < 0)return -1;  
	else return 1; 
}
struct Point {  
	double x,y;
	Point(){}  
	Point(double _x,double _y) {   
		x = _x;y = _y;  
	}  
	Point operator -(const Point &b)const {
	   return Point(x - b.x,y - b.y);  
	}  
	double operator ^(const Point &b)const {
	   return x*b.y - y*b.x;  
	}    
	double operator *(const Point &b)const {   
		return x*b.x + y*b.y;  
	}  
	void transXY(double B) {   
		double tx = x,ty = y;   
		x = tx*cos(B) - ty*sin(B);   
		y = tx*sin(B) + ty*cos(B);  
	} 
};

struct Line {  
	Point s,e; 
	Line(){}  
	Line(Point _s,Point _e)  {
	   s = _s;e = _e;  
	} 
	pair<int,Point> operator &(const Line &b)const {
		Point res = s;
		if(sgn((s-e)^(b.s-b.e)) == 0) {
			if(sgn((s-b.e)^(b.s-b.e)) == 0) return make_pair(0,res);             
			else return make_pair(1,res);         
		} 
        double t = ((s-b.s)^(b.s-b.e))/((s-e)^(b.s-b.e));
		res.x += (e.x-s.x)*t;         
		res.y += (e.y-s.y)*t;         
		return make_pair(2,res);     
	} 
};

double dist(Point a,Point b) {     
	return sqrt((a-b)*(a-b)); 
}

bool inter(Line l1,Line l2) {     
    return       
    max(l1.s.x,l1.e.x) >= min(l2.s.x,l2.e.x) &&       
    max(l2.s.x,l2.e.x) >= min(l1.s.x,l1.e.x) &&       
    max(l1.s.y,l1.e.y) >= min(l2.s.y,l2.e.y) &&       
    max(l2.s.y,l2.e.y) >= min(l1.s.y,l1.e.y) &&       
    sgn((l2.s-l1.e)^(l1.s-l1.e))*sgn((l2.e-l1.e)^(l1.s-l1.e)) <= 0 &&       
    sgn((l1.s-l2.e)^(l2.s-l2.e))*sgn((l1.e-l2.e)^(l2.s-l2.e)) <= 0;   
} 

bool Seg_inter_line(Line l1,Line l2) {  //????l1?????l2??   
    return sgn((l2.s-l1.e)^(l1.s-l1.e))*sgn((l2.e-l1.e)^(l1.s-l1.e)) <= 0;  
}

bool OnSeg(Point P,Line L) {     
	return     
	sgn((L.s-P)^(L.e-P)) == 0 &&     
	sgn((P.x - L.s.x) * (P.x - L.e.x)) <= 0 &&     
	sgn((P.y - L.s.y) * (P.y - L.e.y)) <= 0; 
} 
int inConvexPoly(Point a,Point p[],int n) {  //判断点在凸多边形内部，必须为逆时针，顺时针改>0 
	for(int i = 0;i < n;i++)  {   
		if(sgn((p[i]-a)^(p[(i+1)%n]-a)) < 0)return -1;   
		else if(OnSeg(a,Line(p[i],p[(i+1)%n])))return 0;  
	}  
	return 1; 
}

bool isconvex(Point poly[],int n) {  //判断是否为凸多边形 ，顺时针逆时针皆可 
	bool s[3];  
	memset(s,false,sizeof(s));  
	for(int i = 0;i < n;i++)  {   
		s[sgn( (poly[(i+1)%n]-poly[i])^(poly[(i+2)%n]-poly[i]) )+1] = true;   
		if(s[0] && s[2])return false;  
	}  
	return true; 
} 

Point PointToLine(Point P,Line L) {     //计算点到直线的距离 
	Point result;     
	double t = ((P-L.s)*(L.e-L.s))/((L.e-L.s)*(L.e-L.s));     
	result.x = L.s.x + (L.e.x-L.s.x)*t;     
	result.y = L.s.y + (L.e.y-L.s.y)*t;     
	return result; 
}

Point poly[10100];
int main() {
	int n;
	double cr, cx, cy;
	while(~scanf("%d", &n)) {
		if(n < 3) break;
		scanf("%lf %lf %lf", &cr, &cx, &cy);
		Point c(cx, cy);
		int i, j;
		for(i = 0; i < n; i++) {
			scanf("%lf %lf", &poly[i].x, &poly[i].y);
		}
		i = 0;
		int t = 0;
		while(i < n && t == 0) {  //判断是否为顺时针 ，是的话转成逆时针 
			t = sgn((poly[i + 1] - poly[i]) ^ (poly[i + 2] - poly[i]));
			i++;
		}
		if(t < 0) reverse(poly, poly + n);
		if(!isconvex(poly, n)) {
			puts("HOLE IS ILL-FORMED");
			continue;
		}
		if(inConvexPoly(c, poly, n) != 1) {
			puts("PEG WILL NOT FIT");
			continue;
		}
		int flag = 1;
		for(i = 0; i < n; i++) {
			Line tl;
			if(i != n - 1) {
				tl = Line(poly[i], poly[i + 1]);
			}
			else {
				tl = Line(poly[i], poly[0]);
			}
			Point tp = PointToLine(c, tl);
			if(dist(c, tp) < cr) {
				flag = 0;
				break;
			}
		}
		if(flag) {
			puts("PEG WILL FIT");
		}
		else {
			puts("PEG WILL NOT FIT");
		}
	}
	return 0;
}