This parameter is always passed as `NULL`.
fprintf(stderr, "after adding edge points, n:%d->%d\n",n, nz);
n = nz;
x = y;
- qt = QuadTree_new_from_point_list(dim, nz, max_qtree_level, y, NULL);
+ qt = QuadTree_new_from_point_list(dim, nz, max_qtree_level, y);
} else {
- qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x, NULL);
+ qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x);
}
}
graph = NULL;
int dim = 3;
if (!x) return NULL;
- qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x, NULL);
+ qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x);
free(x);
scheme = COLOR_LAB;
color_blend_rgb2lab(color_scheme, maxcolors, &colors);
assert(colors);
- qt = QuadTree_new_from_point_list(cdim, maxcolors, max_qtree_level, colors, NULL);
+ qt = QuadTree_new_from_point_list(cdim, maxcolors, max_qtree_level, colors);
assert(qt);
} else {
return ERROR_BAD_COLOR_SCHEME;
#ifdef TIME
start = clock();
#endif
- qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x, NULL);
+ qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x);
#ifdef TIME
qtree_new_cpu += ((double) (clock() - start))/CLOCKS_PER_SEC;
if (USE_QT) {
max_qtree_level = oned_optimizer_get(qtree_level_optimizer);
- qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x, NULL);
+ qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x);
}
#ifdef TIME
start2 = clock();
if (USE_QT) {
max_qtree_level = oned_optimizer_get(qtree_level_optimizer);
- qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x, NULL);
+ qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x);
}
#endif
if (USE_QT) {
- qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x, NULL);
+ qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x);
}
/*
nsuper_avg = 0;
if (USE_QT) {
- qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x, NULL);
+ qt = QuadTree_new_from_point_list(dim, n, max_qtree_level, x);
}
for (i = 0; i < n; i++){
for (i = 0; i < 4; i++) counts[i] /= n;
}
-QuadTree QuadTree_new_from_point_list(int dim, int n, int max_level, double *coord, double *weight){
+QuadTree QuadTree_new_from_point_list(int dim, int n, int max_level, double *coord){
/* form a new QuadTree data structure from a list of coordinates of n points
coord: of length n*dim, point i sits at [i*dim, i*dim+dim - 1]
- weight: node weight of lentgth n. If NULL, unit weight assumed.
*/
double *xmin, *xmax, *center, width;
QuadTree qt = NULL;
width *= 0.52;
qt = QuadTree_new(dim, center, width, max_level);
- if (weight){
- for (i = 0; i < n; i++){
- qt = QuadTree_add(qt, &(coord[i*dim]), weight[i], i);
- }
- } else {
- for (i = 0; i < n; i++){
- qt = QuadTree_add(qt, &(coord[i*dim]), 1, i);
- }
+ for (i = 0; i < n; i++){
+ qt = QuadTree_add(qt, &(coord[i*dim]), 1, i);
}
void QuadTree_print(FILE *fp, QuadTree q);
-QuadTree QuadTree_new_from_point_list(int dim, int n, int max_level, double *coord, double *weight);
+QuadTree QuadTree_new_from_point_list(int dim, int n, int max_level, double *coord);
double point_distance(double *p1, double *p2, int dim);