Bucket PR k-d Quadtree Demo

Recursively decompose the underlying space into two equal area blocks until the number of data points in each block does not exceed the bucket capacity. The partition axes are cycled through in the order x , y , x , y , ... The partition positions are independent of the data. For more details, see pages 74-75 of Samet, Foundations of Multidimensional and Metric Data Structures or, see pages 93-94 and 100-101 of Samet, Design and Analysis of Spatial Data Structures.