题目:
http://poj.org/problem?id=1410
题意:
判断一个直线与矩形是否相交,在矩形内也算。
思路:
就是求4个线段相交,测试模版,注意给定的矩形两个角的坐标不保证x1<=x2&&y1>=y2。
代码:
#define EPS 1e-6
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;
}
}a,b,c,d;
struct Line
{
Point s,e;
Line() {}
Line(Point s,Point e):s(s),e(e){}
bool operator ^ (const Line & b) const
{
return
max(s.x,e.x) >= min(b.s.x,b.e.x) &&
max(b.s.x,b.e.x) >= min(s.x,e.x) &&
max(s.y,e.y) >= min(b.s.y,b.e.y) &&
max(b.s.y,b.e.y) >= min(s.y,e.y) &&
sgn((b.s-e)^(s-e))*sgn((b.e-e)^(s-e)) <= 0 &&
sgn((s-b.e)^(b.s-b.e))*sgn((e-b.e)^(b.s-b.e)) <= 0;
}
}pos,line[5];
int main()
{
int i,j,k,kk,cas,T,n;
double t;
scanf("%d",&n);
while(n--)
{
scanf("%lf%lf%lf%lf",&pos.s.x,&pos.s.y,&pos.e.x,&pos.e.y);
scanf("%lf%lf%lf%lf",&a.x,&a.y,&b.x,&b.y);
if(a.x>b.x)t=a.x,a.x=b.x,b.x=t;
if(a.y<b.y)t=a.y,a.y=b.y,b.y=t;
c.x=a.x;c.y=b.y;
d.x=b.x;d.y=a.y;
line[0].s=a;line[0].e=d;
line[1].s=a;line[1].e=c;
line[2].s=c;line[2].e=b;
line[3].s=d;line[3].e=b;
int flag=0;
for(i=0;i<4;i++)
if(line[i]^pos)
flag=1;
if(pos.s.x>=a.x&&pos.s.x<=b.x&&pos.e.x>=a.x&&pos.e.x<=b.x && pos.s.y<=a.y&&pos.s.y>=b.y&&pos.e.y<=a.y&&pos.e.y>=b.y)
flag=1;
printf("%s\n",flag?"T":"F");
}
return 0;
}