凸包算法-判断凸多边形是否相交.docVIP

/* 凸包算法 判断凸多边形是否相交 */ #include stdio.h #include stdlib.h #include math.h #define MaxNode 100015 #define INFint stack[MaxNode]; int top; typedef struct TPoint { double x; double y; }TPoint; TPoint black[2005], white[2005]; TPoint p0; typedef struct TPloygon { TPoint p[2005]; int n; }TPolygon; TPolygon covtexb, covtexw; typedef struct TSegment { TPoint p1; TPoint p2; }TSegment; void swap(TPoint point[], int i, int j) { TPoint tmp; tmp = point[i]; point[i] = point[j]; point[j] = tmp; } double max(double x, double y) { //比较两个数的大小，返回大的数 if(x y) return x; else return y; } double min(double x, double y) { //比较两个数的大小，返回小的数 if(x y) return x; else return y; } double multi(TPoint p1, TPoint p2, TPoint p0) { return (p1.x - p0.x) * (p2.y - p0.y) - (p2.x - p0.x) * (p1.y - p0.y); } double distanc(TPoint p1, TPoint p2) { return sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y)); } int cmp(const void *a, const void *b) { TPoint *c = (TPoint *)a; TPoint *d = (TPoint *)b; double k = multi(*c, *d, p0); if(k 0) return 1; else if(k == 0 distanc(*c, p0) = distanc(*d, p0)) return 1; else return -1; } void grahamScan(TPoint point[], int n) { //Graham扫描求凸包 int i, u; //将最左下的点调整到p[0]的位置 u = 0; for(i = 1;i = n - 1;i++){ if((point[i].y point[u].y) || (point[i].y == point[u].y point[i].x point[u].x)) u = i; } swap(point, 0, u); p0 = point[0]; //将平p[1]到p[n - 1]按按极角排序，可采用快速排序 qsort(point + 1, n - 1, sizeof(point[0]), cmp); for(i = 0;i = 2;i++) stack[i] = i; top = 2; for(i = 3;i = n - 1;i++){ while(multi(point[i], point[stack[top]], point[stack[top - 1]]) = 0){ if(top == 0)break; top--; } top++; stack[top] = i; } } bool isIntersected(TPoint s1, TPoint e1, TPoint s2, TPoint e2) { //判断线段是否相交 //1.快速排斥