原理:如果两条线段相交,那么必须跨立,就是以一条线段为标准,另一条线段的两端点一定在这条线段的两段
也就是说a b两点在线段cd的两端,c d两点在线段ab的两端
struct point()
{
double x,y;
};
double multi(point a,point b,point c)//abxac,ab(b.x-a.x,b.y-a.y),ac(c.x-a.x,c.y-a.y)
{
return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);
}
bool isintersected(point a,point b,point c,point d)//判断两条线段是否相交
{
double u,v,w,z;
u=multi(a,b,c);
v=mutil(a,b,d);
w=mulit(c,d,b);
z=multi(c,d,a);
return (u*v<=0.00000001&&w*z<=0.00000001)//1相交0不相交
}