假如有10条平行的轴线，怎样判断其中有4条是共面的

简化思路

因为方向平行，只需判断4个原点是否共面：

4点共面条件: (P2-P1) × (P3-P1) · (P4-P1) = 0

代码

#include <vector> #include <algorithm> struct AxisInfo { CATCylinder_var spCylinder; CATMathPoint origin; CATMathVector direction; }; bool AreFourOriginsCoplanar(const CATMathPoint& p1, const CATMathPoint& p2, const CATMathPoint& p3, const CATMathPoint& p4, double tolerance = 1e-4) { CATMathVector v12 = p2 - p1; CATMathVector v13 = p3 - p1; CATMathVector v14 = p4 - p1; double mixed = (v12 ^ v13) * v14; return (fabs(mixed) < tolerance); } // 在10条轴线中找4条共面 void FindFourCoplanarAxes(const std::vector<AxisInfo>& axes, std::vector<std::vector<int>>& resultGroups, double tolerance = 1e-4) { int n = axes.size(); if (n < 4) return; // 遍历所有4组合 for (int i = 0; i < n - 3; i++) { for (int j = i + 1; j < n - 2; j++) { for (int k = j + 1; k < n - 1; k++) { for (int m = k + 1; m < n; m++) { if (AreFourOriginsCoplanar(axes[i].origin, axes[j].origin, axes[k].origin, axes[m].origin, tolerance)) { resultGroups.push_back({i, j, k, m}); } } } } } }

使用示例

// 准备数据（假设已从圆柱面获取轴线信息） std::vector<AxisInfo> axes; for (int i = 0; i < 10; i++) { AxisInfo info; info.spCylinder = vctCylinder[i]; info.origin = vctCylinder[i]->GetAxis().GetOrigin(); // 获取方向... axes.push_back(info); } // 找4条共面 std::vector<std::vector<int>> groups; FindFourCoplanarAxes(axes, groups); cout << "找到 " << groups.size() << " 组4条共面的轴线" << endl; for (const auto& g : groups) { cout << "组: " << g[0] << ", " << g[1] << ", " << g[2] << ", " << g[3] << endl; }