来自百度文库
理论基础
待补
实现
在平面上取一点(一般取原点)得到N个三角形 OP[i][i+1] (其中点的顺序为逆时针)
分别求出这N个三角形的重心Ci和面积Ai(注意此处面积是有向面积, 就是用叉乘求面积时保留其正负号)
求出A = A1+A2+…+AN(同样保留正负号的代数相加)
重心C = sigma(Ai+Ci)/A;
Code:任意凸多边形重心C++算法
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
struct point
{
double x;
double y;
};
point gravity(point *p, int n)
{
double area = 0;
point center;
center.x = 0;
center.y = 0;
for (int i = 0; i < n-1; i++)
{
area += (p[i].x*p[i+1].y - p[i+1].x*p[i].y)/2;
center.x += (p[i].x*p[i+1].y - p[i+1].x*p[i].y) * (p[i].x + p[i+1].x);
center.y += (p[i].x*p[i+1].y - p[i+1].x*p[i].y) * (p[i].y + p[i+1].y);
}
area += (p[n-1].x*p[0].y - p[0].x*p[n-1].y)/2;
center.x += (p[n-1].x*p[0].y - p[0].x*p[n-1].y) * (p[n-1].x + p[0].x);
center.y += (p[n-1].x*p[0].y - p[0].x*p[n-1].y) * (p[n-1].y + p[0].y);
center.x /= 6*area;
center.y /= 6*area;
return center;
}