If the node is a leaf, then the range is determined by scanning the range of scalar data in n cells in the dataset. The implication is that there are no direct lists of cell ids per leaf node, instead the cell ids are implicitly known. Set the branching factor for the tree. This is the number of children per tree node.
Larger values mean shallower trees, less memory usage, but worse performance.
The value of this ivar may change each time the locator is built. Set the maximum allowable level for the tree. Frees memory and resets object as appropriate. Construct the scalar tree from the dataset provided. Checks build times and modified time from input and reconstructs the tree if necessaery.