判断线段是否相交和求平面四点的面积

本文链接：https://blog.csdn.net/m0_52398496/article/details/123005425

struct Point{
    db x;
    db y;
};
 
bool isRectCross(Point p1,Point p2,Point q1,Point q2) {
    return min(p1.x,p2.x) <= max(q1.x,q2.x) &&
           min(q1.x,q2.x) <= max(p1.x,p2.x) &&
           min(p1.y,p2.y) <= max(q1.y,q2.y) &&
           min(q1.y,q2.y) <= max(p1.y,p2.y);
}
 
bool isLineSegmentCross(Point P1,Point P2,Point Q1,Point Q2) {
    return (
            ((Q1.x-P1.x)*(Q1.y-Q2.y)-(Q1.y-P1.y)*(Q1.x-Q2.x)) * ((Q1.x-P2.x)*(Q1.y-Q2.y)-(Q1.y-P2.y)*(Q1.x-Q2.x)) < 0 &&
            ((P1.x-Q1.x)*(P1.y-P2.y)-(P1.y-Q1.y)*(P1.x-P2.x)) * ((P1.x-Q2.x)*(P1.y-P2.y)-(P1.y-Q2.y)*(P1.x-P2.x)) < 0
    );
}
 
double triangle(const Point &A, const Point &B, const Point &C) {
    double a = sqrt((B.x - C.x) * (B.x - C.x) + (B.y - C.y) * (B.y - C.y));
    double b = sqrt((A.x - C.x) * (A.x - C.x) + (A.y - C.y) * (A.y - C.y));
    double c = sqrt((A.x - B.x) * (A.x - B.x) + (A.y - B.y) * (A.y - B.y));
    double p = (a+b+c)/2.0;
    return sqrt(p * (p - a) * (p - b) * (p - c));
}

signed main()
{
	IOS;
	Point a,b,c,d;
	cin>>a.x>>a.y>>b.x>>b.y>>c.x>>c.y>>d.x>>d.y;
	if(isRectCross(a,b,c,d)&&isLineSegmentCross(a,b,c,d)) //不相交
	{
		db sum = triangle(a,b,c)+triangle(a,b,d); //四边形分成两个三边行
		printf("%.6lf\n",sum);
	}
	else cout<<0<<"\n"; //相交
	return 0;
}