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.
-
Notifications
You must be signed in to change notification settings - Fork 50
Two-dimensional recursive spatial subdivision.
License
d3/d3-quadtree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Two-dimensional recursive spatial subdivision.
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published