Quadtree

Capacity per leaf: 4 Animation speed: 1.0× Mode View

Show subdivision Show points Show query window

Stats

Points0

Leaves0

Internal nodes0

Max depth0

Query result0

Nodes visited0

Linear scan0

A quadtree recursively splits a 2D region into four children when a leaf overflows its capacity. Range and nearest-neighbour queries prune entire subtrees, giving O(log n) average lookup vs O(n) linear scan.