PM1 QuadTree Demo

PM1 Quadtree

Recursively decompose the underlying space into four equal area blocks as long as a block contains more than one line segment unless the line segments are all incident at the same vertex which is also in the same block. Each block is maximal and contains at most one vertex. For more details, see pages 365-369 and 803-806 of Samet, Foundations of Multidimensional and Metric Data Structures or, see pages 240-257 of Samet, Design and Analysis of Spatial Data Structures.


Insert mode:

Delete mode:

Search mode: