Geometry 计算几何_visualgeometry几何计算-CSDN博客

这篇博客介绍了如何利用计算几何的方法来求解四面体的体积，给出了四个顶点坐标的四面体体积计算公式，并提供了线段相交判断的算法。此外，还提及了旋转卡壳、凸包和半平面交等几何计算概念。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Geometry 计算几何

四面体体积计算（已知四个点的坐标）

struct point {
    double x, y, z;
} p[5];
double line2(point a, point b) {
    return ((a.x - b.x) * (a.x - b.x)) + ((a.y - b.y) * (a.y - b.y)) + ((a.z - b.z) * (a.z - b.z));
}
void work() {
    for (int i = 1; i <= 4; i++) cin >> p[i].x >> p[i].y >> p[i].z;

    double p12 = line2(p[1], p[2]);
    double p13 = line2(p[1], p[3]);
    double p14 = line2(p[1], p[4]);
    double p23 = line2(p[2], p[3]);
    double p24 = line2(p[2], p[4]);
    double p34 = line2(p[3], p[4]);
    double res1 = p12 * p34 * (p13 + p14 + p23 + p24 - p12 - p34);
    double res2 = p14 * p23 * (p12 + p13 + p24 + p34 - p14 - p23);
    double res3 = p13 * p24 * (p12 + p14 + p23 + p34 - p13 - p24);
    double res4 = (p12 * p13 * p23) + (p13 * p14 * p34) + (p12 * p14 * p24) + (p24 * p34 * p23);
    double v = sqrt(res1 + res2 + res3 - res4) / 12;
    printf("%.12f\n", v);
}

判断线段相交

int CrossProduct(ll x1, ll y1, ll x2, ll y2) {
    ll xx = x1 * y2;
    ll yy = y1 * x2;
    if (xx == yy) return 0;
    return xx > yy ? 1 : -1;
}

bool cek(ll x1, ll y1, ll x2, ll y2, ll x3, ll y3, ll x4, ll y4) {//两条线段的起点和终点
	return CrossProduct(x2 - x1, y2 - y1, x3 - x1, y3 - y1) * CrossProduct(x2 - x1, y2 - y1, x4 - x1, y4 - y1) <= 0 &&
           CrossProduct(x4 - x3, y4 - y3, x1 - x3, y1 - y3) * CrossProduct(x4 - x3, y4 - y3, x2 - x3, y2 - y3) <= 0;
}