# d3-quadtree

**Repository Path**: mirrors_d3/d3-quadtree

## Basic Information

- **Project Name**: d3-quadtree
- **Description**: Two-dimensional recursive spatial subdivision.
- **Primary Language**: Unknown
- **License**: ISC
- **Default Branch**: main
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-08-08
- **Last Updated**: 2026-02-28

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# d3-quadtree

<a href="https://d3js.org"><img src="https://github.com/d3/d3/raw/main/docs/public/logo.svg" width="256" height="256"></a>

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)