给出平面上两条线段的两个端点,判断这两条线段是否相交(有一个公共点或有部分重合认为相交)。 如果相交,输出"Yes",否则输出"No"。
Input
第1行:一个数T,表示输入的测试数量(1 <= T <= 1000) 第2 - T + 1行:每行8个数,x1,y1,x2,y2,x3,y3,x4,y4。(-10^8 <= xi, yi <= 10^8) (直线1的两个端点为x1,y1 | x2, y2,直线2的两个端点为x3,y3 | x4, y4)
Output
输出共T行,如果相交输出"Yes",否则输出"No"。
Input示例
2 1 2 2 1 0 0 2 2 -1 1 1 1 0 0 1 -1
Output示例
Yes No
判断两线段是否相交我们需要两个实验:
1:快速排斥实验
假设两线段ab和cd是矩形m,n的对角线,如果m和n不相交,那么ab和cd一定不相交
2:跨立实验
如果两条线段相交,那么两条线段一定跨立;
#include<iostream>
#include<algorithm>
using namespace std;
const double eps=1e-6;
struct point
{
double x,y;
};
bool panduan(point a,point b,point c,point d)
{
if(min(a.x, b.x) > max(c.x, d.x) || min(a.y, b.y) > max(c.y, d.y) || min(c.x, d.x) > max(a.x, b.x) || min(c.y, d.y) > max(a.y, b.y) )//快速排斥实验
return 0;
double h, i, j, k;
h = (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);//c.b.a//跨立实验
i = (b.x - a.x) * (d.y - a.y) - (b.y - a.y) * (d.x - a.x);//d.b.a
j = (d.x - c.x) * (a.y - c.y) - (d.y - c.y) * (a.x - c.x);//a.d.c
k = (d.x - c.x) * (b.y - c.y) - (d.y - c.y) * (b.x - c.x);//b.d.c
return h*i<=eps&&j*k<=eps;
}
int main()
{
point a,b,c,d;
int t;
cin>>t;
while(t--)
{
cin>>a.x>>a.y>>b.x>>b.y>>c.x>>c.y>>d.x>>d.y;
if(panduan(a,b,c,d))
{
cout<<"Yes"<<endl;
}
else cout<<"No"<<endl;
}
return 0;
}