计算线段相交，面积，体积的部分代码

计算两圆相交的面积

typedef struct node
{
	int x;
	int y;
}point;

double calc(point a, double r1, point b, double r2)//计算两圆的相交面积
{
	double d = sqrt((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y));
	if (d >= r1+r2)
		return 0;
	if (r1>r2)
	{
		double tmp = r1;
		r1 = r2;
		r2 = tmp;
	}
	if(r2 - r1 >= d)
		return pi*r1*r1;
	double ang1=acos((r1*r1+d*d-r2*r2)/(2*r1*d));
	double ang2=acos((r2*r2+d*d-r1*r1)/(2*r2*d));
	return ang1*r1*r1 + ang2*r2*r2 - r1*d*sin(ang1);
}

计算两球相交的体积

const double pi=3.1415926;

double tiji(double rx1,double ry1,double rz1,double r1,double rx2,double ry2,double rz2,double r2)//参数分别是两个球的x,y,z坐标和半径r
{
    double dis = sqrt((rx1 - rx2) * (rx1 - rx2) + (ry1 - ry2) * (ry1 - ry2) + (rz1 - rz2) * (rz1 - rz2));
    double s=0;
    if (dis >= r1 + r2)
    {
        return 0;
    }
    else if (dis <= fabs(r1 - r2))
    {
        double maxn = min(r1, r2);
        s = 4.0 / 3.0 * pi * (maxn * maxn * maxn);
    }
    else
    {
        s = 0;
        double h1 = r1 - (r1 * r1 - r2 * r2 + dis * dis) / (2 * dis);
        s += (pi * h1 * h1 * (3 * r1 - h1) / 3.0);
        double h2 = r2 - (r2 * r2 - r1 * r1 + dis * dis) / (2 * dis);
        s += (pi * h2 * h2 * (3 * r2 - h2) / 3.0);
    }
    return s;
}

判断平面上两线段是否相交

#include <iostream>
#include <bits/stdc++.h>

#define inf 0x3f3f3f3f
#define mod 1000000007
#define lmax 1000
#define pi 3.141592653589793238462643383279
#define eps 1e-7

using namespace std;
typedef long long ll;
typedef int type;

int direction(int x1,int y1,int x2,int y2,int x3,int y3)//计算两向量的叉积
{
    int p1x=x3-x1;
    int p1y=y3-y1;
    int p2x=x2-x1;
    int p2y=y2-y1;
    return p1x*p2y-p2x*p1y;
}
bool segment(int x1,int y1,int x2,int y2,int x3,int y3)//判断p3是否在p1p2连成线段的内部
{
    if(min(x1,x2)<=x3&&max(x1,x2)>=x3&&min(y1,y2)<=y3&&max(y1,y2)>=y3)
        return true;
    else
        return false;
}

bool intersect(int x1,int y1,int x2,int y2,int x3,int y3,int x4,int y4)//判断p1p2和p3p4两条线段是否相交
{
    int d1=direction(x3,y3,x4,y4,x1,y1);
    int d2=direction(x3,y3,x4,y4,x2,y2);
    int d3=direction(x1,y1,x2,y2,x3,y3);
    int d4=direction(x1,y1,x2,y2,x4,y4);
    if(d1*d2<0||d3*d4<0)
        return true;
    else if(d1==0&&segment(x3,y3,x4,y4,x1,y1))
        return true;
    else if(d2==0&&segment(x3,y3,x4,y4,x2,y2))
        return true;
    else if(d3==0&&segment(x1,y1,x2,y2,x3,y3))
        return true;
    else if(d4==0&&segment(x1,y1,x2,y2,x4,y4))
        return true;
    else
        return false;
}


int main()
{
    int x1,y1,x2,y2,x3,y3,x4,y4;
    int t;
    cin>>t;
    while(t--)
    {
        cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
        if(intersect(x1,y1,x2,y2,x3,y3,x4,y4))
            cout<<"相交"<<endl;
        else
            cout<<"不相交"<<endl;
    }
    return 0;
}
/*输入
4
-1 1 1 -1 2 1 2 -1
-1 1 1 -1 2 1 0 0
2 2 4 2 2 1 2 -1
5 6 7 8 7 7 1 12
*/
/*输出
不相交
相交
不相交
相交
*/

求平面上多边形的面积

#include <iostream>
#include <bits/stdc++.h>

#define inf 0x3f3f3f3f
#define mod 1000000007
#define lmax 1000
#define pi 3.141592653589793238462643383279
#define eps 1e-7

using namespace std;
typedef long long ll;
typedef double type;
type direction(type x1,type y1,type x2,type y2)//计算以原点为起点的两向量的叉积
{
    return x1*y2-x2*y1;
}

type area(type x[],type y[],int n)//求面积
{
    type sum=0;//表示中间结果
    type squar=0;//表示多边形的面积
    if(n<3)
    {
        return -1;//点数小于三无法围成封闭图形，返回-1
    }
    else
    {
        for(int i=1; i<=n-1; i++)
        {
            sum+=direction(x[i],y[i],x[i+1],y[i+1]);
        }
        sum+=direction(x[n],y[n],x[1],y[1]);
        squar=abs(sum/2);
        return squar;
    }
}

int main()
{
    type x[lmax]= {0};//存储点的x坐标
    type y[lmax]= {0};//存储点的y坐标
    int n;//给到n个点
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        cin>>x[i]>>y[i];//输入点时需要保证按照图形边界上的点顺时针或逆时针输入
    }
    cout<<area(x,y,n)<<endl;
    return 0;
}
/*输入
4
0 0
1 2
3 2
3 0
*/
/*输出
5
*/