acm计算几何基础题目.docVIP

POJ 1113 WALL 计算几何，求凸包 这题的结果等于这个多边形构成的凸包的周长加上以所给半径为半径的圆的周长 步骤如下： 1)算法首先寻找最最靠下方的点，如果遇到y坐标相同，则寻找x坐标最小的点firstP 2)然后根据所有点相对于firstP的偏角的大小进行排序，遇到偏角相等的，只取距离 firstP最远的点(排序利用自己手写的快排) 3)然后利用Graham算法求凸包 4)最后直接求职 #include iostream #include cmath #define PI 3.1415926 #define MAX_N 1000 using namespace std; //存储原始输入的坐标值，rad是输入的半径 double cord[MAX_N + 2][2], rad; int seq[MAX_N + 2]; int stack[MAX_N + 2]; int n, top; int firstP; int realN; void swap(int pos1, int pos2) { int temp = seq[pos1]; seq[pos1] = seq[pos2]; seq[pos2] = temp; } int dir(int nodes, int node1, int node2) { double x1 = cord[node1][0], y1 = cord[node1][1]; double x2 = cord[node2][0], y2 = cord[node2][1]; double sx = cord[nodes][0], sy = cord[nodes][1]; return (x2 - sx) * (y1 - sy) - (x1 - sx) * (y2 - sy); } double getDist(int node1, int node2) { double x1 = cord[node1][0], y1 = cord[node1][1]; double x2 = cord[node2][0], y2 = cord[node2][1]; double res = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); return res; } int compare(int node1, int node2) { double x1 = cord[node1][0], y1 = cord[node1][1]; double x2 = cord[node2][0], y2 = cord[node2][1]; double sx = cord[firstP][0], sy = cord[firstP][1]; double type = dir(firstP, node1, node2); if(type == 0) { double dist1 = (x1 - sx) * (x1 - sx) + (y1 - sy) * (y1 - sy); double dist2 = (x2 - sx) * (x2 - sx) + (y2 - sy) * (y2 - sy); if(dist1 dist2) return -2; else if(dist1 == dist2) return 0; else return 2; } else if(type 0) return 1; else return -1; } void fastSort(int start, int end) { if(start end) { int curPos = start; int posS = start, posE = end + 1;