第4章 分治策略.ppt

1 void closest(POINT X[], A_POINT Y[], int low, int high, POINT a, POINT b, float d) 2 { 3 int i, j, k, m; 4 POINT al, bl, ar, br; 5 float dl, dr; 6 if ((high-low)==1) // n=2,calculate directly 7 (a = X[low], b = X[high], d = dist(X[low],X[high])); 8 else if ((high-low)==2) { // n=3,calculate directly 9 dl = dist(X[low],X[low+1]); 10 dr = dist(X[low],X[low+2]); 11 d = dist(X[low+1],X[low+2]); 12 if ((dl=dr) (dl=d)) 13 (a = X[low], b = X[low+1], d = dl); 14 else if (dr=d) 15 (a = X[low], b = X[low+2], d = dr); 16 else 17 (a = X[low+1], b = X[low+2]); 18 } 2D Closest-Pair Algorithm 19 else { // n3 Divede and Conquer 20 A_POINT *SL = new A_POINT[(high-low)/2+1]; A_POINT *SR = new A_POINT[(high-low)/2]; // divide X into two subarray by m 22 m = (high + low) / 2; 23 j = k = 0; 24 for (i=0; i high-low+1; i++) 25 if (Y[i].index = m) // collect the elements of auxiliary array of left subarray of X 26 SL[j++] = Y[i]; 27 else // collect the elements of auxiliary array of right subarray of X SR[k++] = Y[i]; // calculate the closest-pair of left subarray of X closest(X, SL, low, m, al, bl, dl); // calculate the closest-pair of right subarray of X 30 closest(X, SR, m+1, high, ar, br, dr); 2D Closest-Pair Algorithm 31 if (dldr) // combination 32 (a = al, b = bl, d = dl); 33 else 34 (a = ar, b = br, d = dr); 35 POINT *Z = new POINT[high-low+1]; 36 k =0; // collect the points within the two strips of width d of L from Y 37 for (