给出一个圆心和半径描述的圆,以及若干个点形成的多边形
问多边形是否是凸多边形,还有圆是否在凸多边形内
多边行的点不多,开1000足矣,是按顺序给出的,但有顺时针也有逆时针
先判断多边形是不是凸的,不是直接输出 HOLE IS ILL-FORMED
然后判断圆心在不在凸多边形内,还要圆心到边的距离小于等于半径,可以输出 PEG WILL FIT
不行输出 PEG WILL NOT FIT
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const int N=1000+10;
//Point定义
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;
}
///绕原点旋转角度B(弧度值),后x,y的变化
void transXY(double B)
{
double tx=x,ty=y;
x=tx*cos(B)-ty*sin(B);
y=tx*sin(B)+ty*cos(B);
}
}p[N];
//两点描述直线
struct Line
{
Point s,e;
Line(){}
Line(Point _s,Point _e) { s = _s;e = _e; }
//两直线相交求交点
//第一个值为0表示直线重合,为1表示平行,为0表示相交,为2是相交
//只有第一个值为2时,交点才有意义
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)); }
//点到直线上最近的点
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;
}
//判断凸多边形
//允许共线边
//点可以是顺时针给出也可以是逆时针给出
//点的编号0~n-1
//返回-1为逆时针,返回1为顺时针
int 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 0;
}
if(s[0]) return 1;
else return -1;
}
//判断点在线段上
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;
}
//*判断点在凸多边形内
//k为-1代表逆时针,1代表顺时针
//点的编号:0~n-1
//返回值:
//-1:点在凸多边形外
//0:点在凸多边形边界上
//1:点在凸多边形内
int inConvexPoly(Point a,Point p[],int n,int k)
{
if(k==-1)
{
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;
}
else
{
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;
}
}
int main()
{
int n;
double r;
Point c;
while(~scanf("%d",&n))
{
if(n<3) break;
scanf("%lf%lf%lf",&r,&c.x,&c.y);
for(int i=0;i<n;i++)
scanf("%lf%lf",&p[i].x,&p[i].y);
int k=isconvex(p,n);
if(!k)
{
printf("HOLE IS ILL-FORMED\n");
continue;
}
if(inConvexPoly(c,p,n,k)==-1)
{
printf("PEG WILL NOT FIT\n");
continue;
}
bool flag=true;
for(int i=0;i<n;i++)
{
Line l=Line(p[i],p[(i+1)%n]);
Point pl=PointToLine(c,l);
if(sgn(dist(pl,c)-r)==-1)
{
flag=false;
break;
}
}
if(flag) printf("PEG WILL FIT\n");
else printf("PEG WILL NOT FIT\n");
}
return 0;
}