Bucket size. If there are n <= k points left, we put them in the same bucket. Else, we continue constructing the tree recursively. This should save storage space and accelerate queries. The best value for k is probably dataset and application dependent. k = 0 => the tree is not bucketized. k = 50 might be a good default value.

Vantage point finding heuristic quality.