先判断是不是凸包 然后判断点是否在多边形内 最后判断圆心和各边的距离
#include<cstdio>
#include<cmath>
#include<algorithm>
#define eps 1e-10
using namespace std;
struct Point
{
double x,y;
Point (double x = 0,double y = 0):x(x),y(y){}
};
typedef Point Vector;
typedef Point point;
int dcmp(double x)
{
if(fabs(x) < eps)return 0;
else return x < 0 ? -1 : 1;
}
Vector operator -(Vector A,Vector B)
{
return Vector(A.x-B.x,A.y-B.y);
}
double Dot(Vector A, Vector B)//点积
{
return A.x*B.x+A.y*B.y;
}
double Length(Vector A)
{
return sqrt(Dot(A,A));
}
double Cross(Vector A, Vector B)
{
return A.x*B.y -A.y*B.x;
}
double DistanceToLine(Point P, Point A, Point B)
{
Vector v1 = B - A, v2 = P - A;
return fabs(Cross(v1,v2)/Length(v1));
}
int cmp(point a,point b)//排序参数x从小到大排 x相同y从小到大排
{
if(a.x<b.x)return 1;
if(a.x==b.x&&a.y>b.y)return 1;
return 0;
}
int ConvexHull(point *p,int n,point *ch)//Andrew法寻找凸包 必须先排序
{
int m = 0;
for(int i = 0; i < n; i++)//寻找下凸包
{
while(m > 1 && Cross(ch[m-1] - ch[m-2],p[i] - ch[m-2]) < 0 )m--;
ch[m++] = p[i];
}
int k = m;
for(int i = n-2; i >= 0; i--)//寻找上凸包
{
while(m > k && Cross(ch[m-1] - ch[m-2],p[i]-ch[m-2]) < 0 )m--;
ch[m++] = p[i];
}
if(n > 1)m--;
return m;
}
bool isPointPolygon(Point p,Point *ch,int n)//这里的判断比较简单 因为前面已经判断是凸包了 所以只需要判断叉积是否都为小于零就可以知道点是否多边形内了
{
for(int i = 0; i < n; i++)
{
int flag = dcmp(Cross(ch[(i+1)%n] - ch[i],p - ch[i]));
if(flag == -1)return false;
}
return true;
}
int main()
{
#ifdef LOCAL
freopen("in.txt","r",stdin);
#endif // LOCAL
struct Point peg;
double r;
int N;
while(scanf("%d",&N))
{
if(N < 3)break;
scanf("%lf%lf%lf",&r,&peg.x,&peg.y);
Point Hole[N],ch[N];
for(int i = 0; i < N; i++)
scanf("%lf%lf",&Hole[i].x,&Hole[i].y);
sort(Hole,Hole+N,cmp);
int m = ConvexHull(Hole,N,ch);
if(m != N)
{
printf("HOLE IS ILL-FORMED\n");
continue;
}
bool isfit = true;
for(int i = 0; i < m && isfit; i++)//判断圆心到凸包每条边的距离
{
double d = DistanceToLine(peg,ch[i],ch[(i+1)%m]);
if(fabs(r - d)< eps || r-d < 0)continue;
else isfit = false;
}
if(isfit && isPointPolygon(peg,ch,m))
printf("PEG WILL FIT\n");
else printf("PEG WILL NOT FIT\n");
}
return 0;
}