https://github.com/d3/d3-quadtree

Two-dimensional recursive spatial subdivision.
https://github.com/d3/d3-quadtree

Last synced: about 2 months ago
JSON representation

Two-dimensional recursive spatial subdivision.

• Host: GitHub
• URL: https://github.com/d3/d3-quadtree
• Owner: d3
• License: isc
• Created: 2015-07-02T17:30:41.000Z (over 9 years ago)
• Default Branch: main
• Last Pushed: 2023-10-06T15:12:04.000Z (12 months ago)
• Last Synced: 2024-05-17T05:01:55.424Z (5 months ago)
• Language: JavaScript
• Homepage: https://d3js.org/d3-quadtree
• Size: 266 KB
• Stars: 229
• Watchers: 11
• Forks: 51
• Open Issues: 8
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# d3-quadtree



A [quadtree](https://en.wikipedia.org/wiki/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](https://en.wikipedia.org/wiki/Barnes–Hut_simulation) for computing many-body forces, collision detection, and searching for nearby points.

## Resources

- [Documentation](https://d3js.org/d3-quadtree)

- [Examples](https://observablehq.com/collection/@d3/d3-quadtree)

- [Releases](https://github.com/d3/d3-quadtree/releases)

- [Getting help](https://d3js.org/community)