把点集凸包化ranham-Scan算法（使用水平序）.docVIP

把点集凸包化Granham-Scan算法（使用水平序） #includestdio.h #includestring.h #includemath.h #includealgorithm using nameaace std; const int M=100000+5; struct Point { double x,y; } p[M]; double dis(Point A,Point B) { return sqrt((B.x-A.x)*(B.x-A.x)+(B.y-A.y)*(B.y-A.y)); } bool cmp(Point a,Point b) { if (a.xb.x) return true; if (a.xb.x) return false; if (a.yb.y) return true; return false; } double Xdet(Point A,Point B,Point C) { double x1,x2,y1,y2; x1=B.x-A.x; y1=B.y-A.y; x2=C.x-A.x; y2=C.y-A.y; return x1*y2-x2*y1; //大于0在左手边，逆时针 } bool bo[M]; Point pp[M]; int stack[M]; //from 1 to t void Gram_Scan(Point *p,int n) //p从1-n,把点集土包化 n*log(n); { int i,t; sort(p+1,p+1+n,cmp); for(t=0,i=1;i=n;i++){ //合并排序 if (i1 p[i].x==p[i-1].x p[i].y==p[i-1].y) continue; p[++t]=p[i]; } n=t; t=0; memset(bo+1,true,n*sizeof(bo[0])); if (n0){ stack[++t]=1; bo[stack[t]]=false; } if (n1){ stack[++t]=2; bo[stack[t]]=false; } if (n2){ for(i=3;in;i++) if(bo[i] Xdet(p[stack[t-1]],p[stack[t]],p[i])=0) stack[++t]=i,bo[i]=false; else{ while(t=2 Xdet(p[stack[t-1]],p[stack[t]],p[i])0) bo[stack[t]]=true,t--; stack[++t]=i; bo[stack[t]]=false; } for(i=n;i=1;i--) if (bo[i] Xdet(p[stack[t-1]],p[stack[t]],p[i])=0) stack[++t]=i,bo[i]=false; else{ while(t=2Xdet(p[stack[t-1]],p[stack[t]],p[i])0) bo[stack[t]]=true,t--; stack[++t]=i; bo[stack[t]]=false; } t--; } for(i=1;i=t;i++) pp[i]=p[stack[i]]; memcpy(p+1,pp+1,t*sizeof(Point)); n=t; } 求凸点集的面积 double area(Point *p,int n) { double sum=0; int i; p[n+1]=p[1]; for(i=1;i=n;i++) sum+=p[i].x*p[i+1].y-p[i].y*p[i+1].x; return sum/2.0; } const double EPS=1e-9; const double maxn=1e6-1; const double PI=acos(-1.); const int M=100+5; const double offset=11213; #define zero(x) (((x)0?(x):-(x))EPS) struct Point{ double x,y; } p[M]; struct LINESEG{ Point st,ed; }; struct LINE{ double a,b,c; }; double dist(Point a,Point b){ return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)); } double mult