(a) A toy example of a PBP tree and (b) its corresponding partitioning of a dataset and a space.

<p>The colors indicate different levels of nodes and their corresponding hyper-spheres. The leaf nodes are omitted in the tree. When searching for the nearest neighbor of a point (large red dot), only a small number of sibling hyper-spheres (filled circles) need to be explored.