void sort_around_point(long p[2], long pts[][2], int n) { int concave_val; pivote[0] = p[0]; pivote[1] = p[1]; qsort(pts, n, 2 * sizeof(long), cmp_points); //print_pts(pts,n); //printf("---------------------------\n"); concave_val = concave(p, pts, n); if (concave_val != -1) { concave_val = (concave_val + 1) % n; shift(pts, concave_val, n); } //print_pts(pts,n); }
double new_concave(MC *expr) { double ans = concave(expr); return ans; }