旋转卡壳卡卡

关于旋转卡壳的比较详细的介绍，这里有两篇文章（支持原创，拒绝转载）

http://blog.sina.com.cn/s/blog_4afd4f7c010004y4.html
http://www.cppblog.com/staryjy/archive/2010/09/25/101412.html
这两篇适合于不知道旋转卡壳为何物时入门用。

 

另外，这里有关于旋转卡壳详尽的解释与应用说明（包括点集的直径，凸多边形的宽，两凸包的最远距离，两凸包的最近距离等）http://cgm.cs.mcgill.ca/~orm/rotcal.html
不要因为都是英文而不想看，而去看中文版的，大牛的博客都是写给他们自娱自乐然后让一帮小弟膜拜的，仔细看一下原版会有很大帮助。中文版的只在于理解，而不能深刻理解。

然后就是我的旋转卡壳了，poj2187这个题可以直接水过，不用旋转卡壳就可以，toj2847就必须要用卡壳了

 

/*TOJ2847*/ //这题数据有点问题，两个点的时候标程中是又加上了（0，0）这个点，然后再计算的。详见Forum #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> using namespace std; #define EPS 1e-9 #define max(a,b) ((a)>(b) ? (a) : (b)) #define min(a,b) ((a)<(b) ? (a) : (b)) #define feq(a,b) (fabs((a)-(b))<EPS)//a==b #define fbg(a,b) ((a) > EPS+(b)) //a > b #define fsm(a,b) ((b) > EPS+(a)) //a < b #define fbgeq(a,b) ((a) >= (b)-EPS) //a >= b #define fsmeq(a,b) ((b) >= (a)-EPS) //a <= b struct Point{ double x,y; Point(){} Point(double _x,double _y):x(_x),y(_y){} void input(){ scanf("%lf%lf",&x,&y); } }; const int MAXN = 100110; inline double pdis(Point a,Point b){ return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)); } inline double difcross(Point p0,Point p1,Point p2){ return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y); } inline double dis(Point a,Point b){ return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y); } inline double rotate_caliper(Point ps[],int n){ //printf("n = %d/n",n); double ans = 0; ps[n] = ps[0]; int p,q = 1; for(int p = 0; p < n; ++p){ while(fabs(difcross(ps[q],ps[p],ps[p+1]))+EPS < fabs(difcross(ps[q+1],ps[p],ps[p+1]))){ q = (q+1)%n; } //printf("ans = %lf q= %d/n",ans,q); ans = max(ans,max(dis(ps[p],ps[q]),dis(ps[p+1],ps[q+1]))); } return sqrt(ans); } Point p0; int graham[MAXN],top,n; Point points[MAXN],p[MAXN]; inline int cmp(Point a, Point b) { double k = difcross(p0, a, b); if(feq(k,0) && fbg(pdis(a, p0) , pdis(b, p0)))return 1; else if( k > EPS ) return 1; return 0; } inline void ConvexHull(){ int i,u = 0; for(i = 1; i < n; i++){ if(fsm(points[i].y , points[u].y)||feq(points[i].y , points[u].y) &&fsm(points[i].x , points[u].x) )u = i; } swap(points[0],points[u]); p0 = points[0]; sort( points+1, points + n, cmp ); if(n <= 2){ top = n; for(int i = 0;i < n; ++i){ p[i] = points[i]; } return; } graham[0] = 0; graham[1] = 1; graham[2] = 2; top = 2; for( i = 3; i < n; i++){ while(difcross(points[i],points[graham[top]],points[graham[top-1]]) > EPS){ top--; if(top == 0)break; } graham[++top] = i; } top ++; for(int i = 0;i < top; ++i){ p[i] = points[graham[i]]; } } int main(){ while(scanf("%d",&n) != EOF){ if(n == 0)break; for(int i = 0; i < n; ++i) points[i].input(); if(n == 2){ n ++; points[n-1] = Point(0,0); } ConvexHull(); double ans = rotate_caliper(p,top); printf("%.2lf/n",ans); } return 0; }

 

以上就是求点集直径（最远点对）的应用，而下面我们就解决旋转卡壳求两个凸包的最近距离的问题。
1.  Compute the vertex with minimum y coordinate for P (call it yminP) and the vertex with maximum y coordinate for Q (call it ymaxQ).
2. Construct two lines of support LP and LQ for the polygons at yminP and ymaxQ such that the polygons lie to the right of their respective lines of support. Then LP and LQ have opposite direction, and yminP and ymaxQ form an anti-podal pair between the polygons.
3. Compute dist(yminP,ymaxQ) and keep it as the minimum.
4. Rotate the lines clockwise until one of them coincides with an edge of its polygon.
5. If only one line coincides with an edge, then the vertex-edge anti-podal pair distance should be computed along with the new vertex-vertex anti-podal pairA distance. Both distances are compared the current minimum, which is updated if necessary. If both lines of support coincide with edges, then the situation is somewhat more complex. If the edges "overlap", that is if one can construct a line perpendicular to both edges and intersecting both edges (but not at vertices), then the edge-edge distance should be computed. Otherwise the three new vertex-vertex anti-podal pair distances are computed. All distances are compared to the current minimum which is updated if necessary.
6. Repeat steps 4 and 5, until the lines reach (yminP, ymaxQ) again.
7. Output the minimum distance.

这是英文版的最近点对的算法，简单翻译一下：
1、两个凸多边形，记为P和Q，计算出P中y坐标最小的点（记为yminP） ，还有Q中y坐标最大的点（记为ymaxQ）；
2、分别过yminP和yminQ做直线，并且使两条直线平行（旋转卡壳的过程中始终保持平行），记为LP和LQ，此时凸多边形分别位于LP和LQ的右边。LP和LQ具有相反的方向，yminP和ymaxQ就构成了一对对踵点（对踵点的概念google一下）
3、计算yminP和ymaxQ的距离，存入最小距离（记为minimum）；
4、顺时针旋转直线（两条直线都旋转），直到其中一条直线与多边形的某条边重合。
5、如果此时只有一条直线与多边形的一条边重合，假如说LP和P的某一条边（记为e）重合，那么可能的最近的点就是当前LQ与Q相交的那个顶点到e的最短距离（点到线段的最短距离）；如果LP和LQ都与多边形的某条边重合，那么如果有一条直线可以同时相交于这两个边并且垂直于这两条边，那么LP和LQ之间的距离即为可能的最近距离，否则就计算点到线段的距离（这一步可以简化为：两条边分别为p1p2,q1q2,就计算p1到q1q2的最短距离，p2到q1q2的最短距离，q1到p1p2的最短距离，q2到p1p2的最短距离，然后取四个值的最小值），得到最小值以后，更新minimum
6、重复4和5，直到回到初始状态
7、输出最小距离
算法结束；

下面是应用实例：

 

/*POJ3608*/ //求两个凸包的最近点对，传说中的经典问题，旋转卡壳的终极应用。 #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> using namespace std; #define min(a,b) ((a) < (b) ? (a) : (b)) #define EPS 1e-8 const int MAXN = 10010; struct Point{ double x,y; Point(){} Point(double _x,double _y):x(_x),y(_y){} void input(){ scanf("%lf%lf",&x,&y); } }; inline double pdis(Point a,Point b){ return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)); } inline double dotcross(Point p0,Point p1,Point p2){ return (p1.x-p0.x)*(p2.x-p0.x)+(p1.y-p0.y)*(p2.y-p0.y); } inline double difcross(Point p0,Point p1,Point p2){ return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y); } Point p[MAXN],q[MAXN]; int np,nq; inline double p2segline(Point a,Point p1,Point p2){ return fabs(difcross(a,p1,p2))/pdis(p1,p2); } inline double p2seg(Point a,Point p1,Point p2){ if(dotcross(p1,p2,a) < -EPS)return pdis(a,p1); if(dotcross(p2,p1,a) < -EPS)return pdis(a,p2); return p2segline(a,p1,p2); } inline double FourPoints(Point p1,Point p2,Point q1,Point q2){ //double ans; double ans1 = min(p2seg(p1,q1,q2),p2seg(p2,q1,q2)); double ans2 = min(p2seg(q1,p1,p2),p2seg(q2,p1,p2)); return min(ans1,ans2); } inline double solve(Point *p,Point *q,int np,int nq){ p[np] = p[0]; q[nq] = q[0]; int sp = 0,sq = 0; for(int i = 0; i < np; ++i){ if(p[i].y + EPS < p[sp].y)sp = i; } for(int i = 0; i < nq; ++i){ if(q[i].y + EPS < q[sq].y)sq = i; } double tmp,ans = 1e99; for(int i = 0; i < np; ++i){ while((tmp = difcross(q[sq],p[sp],p[sp+1]) - difcross(q[sq+1],p[sp],p[sp+1])) < -EPS) sq = (sq+1)%nq; if(tmp > EPS){ ans = min(ans,p2seg(q[sq],p[sp],p[sp+1])); } else ans = min(ans,FourPoints(p[sp],p[sp+1],q[sq],q[sq+1])); sp = (sp+1)%np; } return ans; } inline double NearestPoints(Point *p,Point *q,int np,int nq){ return min(solve(p,q,np,nq),solve(q,p,nq,np)); } int main(){ while(scanf("%d%d",&np,&nq) != EOF){ if(np == 0 && nq == 0)break; for(int i = 0; i < np; ++i)p[i].input(); for(int i = 0; i < nq; ++i)q[i].input(); double ans = NearestPoints(p,q,np,nq); printf("%lf/n",ans); } return 0; }