计算几何_凸包

 

struct point{
	double x, y;
};
//多边形类
struct poly{
	static const int N = 105; //点数的最大值
	point ps[N+5]; //逆时针存储多边形的点,[0,pn-1]存储点
	int pn;  //点数
	poly() { pn = 0; }
	//加进一个点
	void push(point tp){
		ps[pn++] = tp;
	}
	//第k个位置
	int trim(int k){
		return (k+pn)%pn;
	}
	void clear(){ pn = 0; }
};
bool cmp(point d1, point d2){
	return d1.y < d2.y || (d1.y == d2.y && d1.x < d2.x);
}
//st1-->ed1叉乘st2-->ed2的值
double xmul(point st1, point ed1, point st2, point ed2){
	return (ed1.x - st1.x) * (ed2.y - st2.y) - (ed1.y - st1.y) * (ed2.x - st2.x);
}
//返回含有n个点的点集ps的凸包
poly graham(point* ps, int n){
	sort(ps, ps + n, cmp);
	poly ans;
	if(n <= 2){
		for(int i = 0; i < n; i++){
			ans.push(ps[i]);
		}
		return ans;
	}
	ans.push(ps[0]);
	ans.push(ps[1]);
	point* tps = ans.ps;
	int top = -1;
	tps[++top] = ps[0];
	tps[++top] = ps[1];
	for(int i = 2; i < n; i++){
		while(top > 0 && xmul(tps[top - 1], tps[top], tps[top - 1], ps[i]) <= 0) top--;
		tps[++top] = ps[i];
	}
	int tmp = top;  //注意要赋值给tmp！
	for(int i = n - 2; i >= 0; i--){
		while(top > tmp && xmul(tps[top - 1], tps[top], tps[top - 1], ps[i]) <= 0) top--;
		tps[++top] = ps[i];
	}
	ans.pn = top;
	return ans;
}