 
 		double3 centriod = computeCentriod(v1, v2, v3);
 
+		
 		int* nearest_points = (int*)malloc(sizeof(int) * 20);
 
 		findNearestPoints(centriod, seeds_pointer, seeds_nb, nearest_points, 20);
+
+		if (tid == 0)
+		{
+			test_dis[0] = v1.x;
+			test_dis[1] = v1.y;
+			test_dis[2] = v1.z;
+			test_dis[3] = v2.x;
+			test_dis[4] = v2.y;
+			test_dis[5] = v2.z;
+			test_dis[6] = v3.x;
+			test_dis[7] = v3.y;
+			test_dis[8] = v3.z;
+
+			test_centriod[0] = centriod.x;
+			test_centriod[1] = centriod.y;
+			test_centriod[2] = centriod.z;
+
+			test_index[21] = seeds_nb;
+
+			for (int i = 0; i < 20; ++i)
+			{
+				test_index[i] = nearest_points[i];
+			}
+		}
+		return;
 
 		double* polygon = (double*)malloc(sizeof(double) * 10 * 4);
 		int vertex_nb;

				index[j + 1] = store_index;
				break;
			}

		}
	}
	for (int i = 0; i < nearest_points_nb; ++i)

	{
		double3 seeds_pos = { seeds_pointer[i * 3 + 0], seeds_pointer[i * 3 + 1], seeds_pointer[i * 3 + 2] };
		distance_from_centroid[i] = computeDistance(centriod, seeds_pos);
		
	}
	double* test = (double*)malloc(sizeof(double) * 100);
	test[0] = 0.01;
	free(test);
	free(distance_from_centroid);
	return;
	//һ洢±
	int* index = (int*)malloc(sizeof(int) * seeds_nb);
	for (int i = 0; i < seeds_nb; ++i)
