if (quadtree_split_by_node(t, corner, QUADTREE_DOWNRIGHT))
moved += optimally_move_tree(tree, parent, corner, ops);
- get_middle_point(corner_orig, &mid);
- tmp = quadtree_find_nearest(tree, &mid, corner_orig, NULL, 0);
- if (tmp && tmp != tree)
- trap();
-
out:
if (debug)
printf("Now moved %d nodes, %ld left\n", moved, tree->children);