![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
>凸包<
DT2131
Rage, rage against the dying of the light.Do not go gentle into that good night.
展开
-
求凸包模板
//点集A[]bool comp2(Node a,Node b){//极角排序,逆时针 int temp=cross(A[0],a,b);//叉积求极角大小 if(temp==0) return dis(A[0],a)<dis(A[0],b); return temp>0;}void graham(int n)//graham法(nlogn){ point[原创 2016-08-09 18:29:11 · 321 阅读 · 0 评论 -
POJ 1113 求凸包
POJ 1113C - WallTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %llu POJ 1113DescriptionOnce upon a time there was a greedy King who ordered his chi原创 2016-08-09 18:21:00 · 330 阅读 · 0 评论 -
凸包算法分析
资料来源:http://blog.csdn.net/bone_ace/article/details/46239187http://kevinew.blog.sohu.com/14735858.html前言:首先,什么是凸包? 假设平面上有p0~p12共13个点,过某些点作一个多边形,使这个多边形能把所有点都“包”起来。当这个多边形是凸多边形转载 2016-08-09 19:08:28 · 3625 阅读 · 0 评论