Point Quadtree Demo

A Multidimensional binary search tree for storing point data where the underlying space is decomposed into four quadrants as the points are inserted. The partition positions depend on the data. For more details, see pages 28-37 and 751-755 of Samet, Foundations of Multidimensional and Metric Data Structures or, see pages 48-65 of Samet, Design and Analysis of Spatial Data Structures.