The centre of polygon (多边形重心)

最新推荐文章于 2024-04-01 13:30:09 发布

zichuan123456

最新推荐文章于 2024-04-01 13:30:09 发布

阅读量1.4k

点赞数

分类专栏：计算几何文章标签： numbers each input integer up c

本文链接：https://blog.csdn.net/zichuan123456/article/details/7426139

版权

计算几何专栏收录该内容

12 篇文章 0 订阅

订阅专栏

描述

Given a polygon, your task is to find the centre of gravity for the given polygon.

输入

The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing a single integer N (3 <= N <= 1000000) indicating the number of points that form the polygon. This is followed by N lines, each containing two integers Xi and Yi (|Xi|, |Yi| <= 20000). These numbers are the coordinates of the i-th point. When we connect the points in the given order, we get a polygon. You may assume that the edges never touch each other (except the neighboring ones) and that they never cross. The area of the polygon is never zero, i.e. it cannot collapse into a single line.

输出

Print exactly one line for each test case. The line should contain exactly two numbers separated by one space. These numbers are the coordinates of the centre of gravity. Round the coordinates to the nearest number with exactly two digits after the decimal point (0.005 rounds up to 0.01). Note that the centre of gravity may be outside the polygon, if its shape is not convex. If there is such a case in the input data, print the centre anyway.

样例输入

2
4
5 0
0 5
-5 0
0 -5
4
1 1
11 1
11 11
1 11

样例输出

0.00 0.00
6.00 6.00
YYYYYYYYYYYYYYYYYYYYYYYYYYYYY

#include<stdio.h>
#include<math.h>
struct point
{
	double x,y;
}pp[1000008];
point becenter(point pnt[],int m)//借的模板；
{
	point p,s;
	double tp,area=0,tpx=0,tpy=0;
	int i;
	p.x=pnt[0].x,p.y=pnt[0].y;
	for(i=1;i<=m;i++)
	{
		s.x=pnt[i%m].x;
		s.y=pnt[i%m].y;
		tp=(p.x*s.y-s.x*p.y);
		area+=tp/2;
		tpx+=(p.x+s.x)*tp;
		tpy+=(p.y+s.y)*tp;
		p.x=s.x;p.y=s.y;
	}
	s.x=tpx/(6*area);
	s.y=tpy/(6*area);
	//printf("tpx=%.2lf tpy=%.2lf area=%.2lf\n",tpx,tpy,area);
	//printf("%.2lf %.2lf\n",s.x,s.y);
	return s;
}
int main()
{
	int i,j;
	double l,k,d,n;
	int ncase,m;
	scanf("%d",&ncase);
	while(ncase--)
	{
		scanf("%d",&m);
		for(i=0;i<m;i++)
		scanf("%lf%lf",&pp[i].x,&pp[i].y);
		point c=becenter(pp,m);
		printf("%.2lf %.2lf\n",c.x,c.y);
	}
	return 0;
}