已知线段AB,线段CD. 先来判断直线AB与线段CD是否相交,如果不相交,那么线段AB和线段CD肯定不相交。如果直线AB和线段CD已经相交,那么继续判断直线CD与线段AB是否相交,如果不相交,那么线段AB和线段CD肯定不相交。 如果直线AB与线段CD相交,且直线CD与线段AB相交,那么可以断定线段AB和线段CD相交.
关键问题是:如何判断直线AB是否与线段CD相交呢?设直线AB的方程为:f(x,y) = 0, 当C和D点不在直线的同侧时,直线AB必然与线段CD相交,也就是说直线AB与线段CD相交的条件为:f(C) * f(D) <= 0
typedef struct point
{
float x;
float y;
}Point;
//判断直线AB是否与线段CD相交
bool lineIntersectSide(Point A, Point B, Point C, Point D)
{
// A(x1, y1), B(x2, y2)的直线方程为:
// f(x, y) = (y - y1) * (x1 - x2) - (x - x1) * (y1 - y2) = 0
float fC = (C.y - A.y) * (A.x - B.x) - (C.x - A.x) * (A.y - B.y);
float fD = (D.y - A.y) * (A.x - B.x) - (D.x - A.x) * (A.y - B.y);
if(fC * fD > 0)
return false;
return true;
}
bool sideIntersectSide(Point A, Point B, Point C, Point D)
{
if(!lineIntersectSide(A, B, C, D))
return false;
if(!lineIntersectSide(C, D, A, B))
return false;
return true;
}