A quadtree recursively partitions two-dimensional space into squares, dividing each square into four equally-sized squares. Each distinct point exists in a unique leaf node; coincident points are represented by a linked list. Quadtrees can accelerate various spatial operations, such as the Barnes–Hut approximation for computing many-body forces, collision detection, and searching for nearby points.
ehtick / d3-quadtree Goto Github PK
View Code? Open in Web Editor NEWThis project forked from d3/d3-quadtree
Two-dimensional recursive spatial subdivision.
Home Page: https://observablehq.com/collection/@d3/d3-quadtree
License: ISC License