判断线段相交模板

double max(double a, double b)
{
    if (a > b)
        return a;
    return b;
}
double min(double a, double b)
{
    if (a < b)
        return a;
    return b;
}
struct Point      //保存一个点的坐标
{
    double x, y;
};
struct node      //保存一条线段的两个点的坐标
{
    Point a, b;
}P[500];
double cross(Point a, Point b, Point c)//叉积
{
    return (a.x - c.x)*(b.y - c.y) - (b.x - c.x)*(a.y - c.y);
}
bool intersect(node a,node b)
{
    if (max(a.a.x,a.b.x)<min(b.a.x, b.b.x))//根据点坐标初步判断是否相交
    {
        return false;
    }
    if (max(a.a.y, a.b.y)<min(b.a.y, b.b.y))
    {
        return false;
    }
    if (max(b.a.x, b.b.x)<min(a.a.x, a.b.x))
    {
        return false;
    }
    if (max(b.a.y, b.b.y)<min(a.a.y, a.b.y))
    {
        return false;
    }
    if (cross(b.a, a.b, a.a)*cross(a.b, b.b, a.a)<0)//线段一点与另一条线段的两点构成的线段的叉积小于0，则两线段不相交
    {
        return false;
    }
    if (cross(a.a, b.b, b.a)*cross(b.b, a.b, b.a)<0)
    {
        return false;
    }
    return true;
}