http://poj.org/problem?id=1410
判断线段是否与矩形相交(在矩形内也算相交)
只需判断线段是否与矩形的边相交
再判断线段是否在矩形内
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#define eps 1e-8
using namespace std;
struct node
{
int x1,y1;
int x2,y2;
}L[10],A,B;
int max(int a,int b) {if(a>b) return a;return b;}
int min(int a,int b) {if(a<b) return a;return b; }
double multiply1(node a,node b)
{
return (a.x1-a.x2)*(b.y1-a.y1)-(a.y1-a.y2)*(b.x1-a.x1);
}
double multiply2(node a,node b)
{
return (a.x1-a.x2)*(b.y2-a.y1)-(a.y1-a.y2)*(b.x2-a.x1);
}
bool inter(node a,node b)
{
if(max(a.x1,a.x2)>=min(b.x1,b.x2)&&
max(b.x1,b.x2)>=min(a.x1,a.x2)&&
max(a.y1,a.y2)>=min(b.y1,b.y2)&&
max(b.y1,b.y2)>=min(a.y1,a.y2)&&
multiply1(a,b)*multiply2(a,b)<=0&&
multiply1(b,a)*multiply2(b,a)<=0)
return true;
else return false;
}
int main()
{
int cas;
scanf("%d",&cas);
while(cas--)
{
int a,b,c,d;
int t,i;
int k1,k2;
int l1,l2;
scanf("%d%d",&A.x1,&A.y1);
scanf("%d%d",&A.x2,&A.y2);
scanf("%d%d%d%d",&a,&b,&c,&d);
k1=min(a,c);
k2=max(a,c);
l1=min(b,d);
l2=max(b,d);
L[0].x1=k1;L[0].y1=l1;
L[0].x2=k2;L[0].y2=l1;
L[1].x1=k2;L[1].y1=l2;
L[1].x2=k2;L[1].y2=l1;
L[2].x1=k1;L[2].y1=l2;
L[2].x2=k2;L[2].y2=l2;
L[3].x1=k1;L[3].y1=l2;
L[3].x2=k1;L[3].y2=l1;
for(i=0;i<4;i++)
{
if(inter(L[i],A))
{
printf("T\n");
break;
}
}
if(i>=4)
{
if(A.x1>k1&&A.x1<k2&&A.x2>k1&&A.x2<k2&&A.y1>l1&&A.y1<l2&&A.y2>l1&&A.y2<l2)
{
printf("T\n");
continue;
}
printf("F\n");
}
}
return 0;
}