计算几何——凸包总结
问题的描述:
二维平面内,给定N个散乱的点,求一个最小凸边形(凸包),使得N个点都不在凸多边形外。
解决方法2:Andrew 算法
1.找出坐标最小的点。首先按照x坐标大小或y坐标大小进行排序(如果x坐标一样,y坐标就从小到大排序或如果y坐标一样,x坐标就从小到大排序)
2.Andrew算法的主要思路:分成两次求凸包,先从左到右一遍,再从右到左一遍(或先下到上一遍,再从上到下一遍)。
3.进行叉乘进行判断。向量a与向量b进行叉乘,如果结果为正则a在b的右边,反之在左边。
Wall POJ - 1113
Once upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's castle. The King was so greedy, that he would not listen to his Architect's proposals to build a beautiful brick wall with a perfect shape and nice tall towers. Instead, he ordered to build the wall around the whole castle using the least amount of stone and labor, but demanded that the wall should not come closer to the castle than a certain distance. If the King finds that the Architect has used more resources to build the wall than it was absolutely necessary to satisfy those requirements, then the Architect will loose his head. Moreover, he demanded Architect to introduce at once a plan of the wall listing the exact amount of resources that are needed to build the wall.
Your task is to help poor Architect to save his head, by writing a program that will find the minimum possible length of the wall that he could build around the castle to satisfy King's requirements.
The task is somewhat simplified by the fact, that the King's castle has a polygonal shape and is situated on a flat ground. The Architect has already established a Cartesian coordinate system and has precisely measured the coordinates of all castle's vertices in feet.Input
The first line of the input file contains two integer numbers N and L separated by a space. N (3 <= N <= 1000) is the number of vertices in the King's castle, and L (1 <= L <= 1000) is the minimal number of feet that King allows for the wall to come close to the castle.
Next N lines describe coordinates of castle's vertices in a clockwise order. Each line contains two integer numbers Xi and Yi separated by a space (-10000 <= Xi, Yi <= 10000) that represent the coordinates of ith vertex. All vertices are different and the sides of the castle do not intersect anywhere except for vertices.Output
Write to the output file the single number that represents the minimal possible length of the wall in feet that could be built around the castle to satisfy King's requirements. You must present the integer number of feet to the King, because the floating numbers are not invented yet. However, you must round the result in such a way, that it is accurate to 8 inches (1 foot is equal to 12 inches), since the King will not tolerate larger error in the estimates.
Sample Input
9 100 200 400 300 400 300 300 400 300 400 400 500 400 500 200 350 200 200 200Sample Output
1628Hint
结果四舍五入就可以了
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
double pi=acos(-1.0);
struct node
{
double x;
double y;
} q[1010];
node p[1010];
int r,cnt;
int mult(node a,node b,node c)
{
return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
void Andrew(int n)
{
r=0;
for(int i=0; i<n; i++)
{
while(r>1&&mult(p[r-2],p[r-1],q[i])<=0)
r--;
p[r++]=q[i];
}
cnt=r;
for(int i=n-1; i>=0; i--)//
{
while(r>cnt&&mult(p[r-2],p[r-1],q[i])<=0)
r--;
p[r++]=q[i];
}
}
int cmp(node a,node b)
{
if(a.x==b.x)
return a.y<b.y;
return a.x<b.x;
}
int main()
{
int n,l;
while(~scanf("%d%d",&n,&l))
{
for(int i=0; i<n; i++)
scanf("%lf%lf",&q[i].x,&q[i].y);
sort(q,q+n,cmp);
Andrew(n);
double ans=2*pi*l;
for(int i=1; i<r; i++)
ans+=sqrt((p[i].x-p[i-1].x)*(p[i].x-p[i-1].x)+(p[i].y-p[i-1].y)*(p[i].y-p[i-1].y));
printf("%.0f\n",ans);
}
return 0;
}