| Interface | Description |
|---|---|
| QuadtreeNode<D> |
| Class | Description |
|---|---|
| AddKt | |
| CopyKt | |
| CoverKt | |
| DataKt | |
| FindKt | |
| InternalNode<D> | |
| LeafNode<D> | |
| Quadtree<D> |
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.
|
| QuadtreeKt | |
| RemoveKt | |
| SizeKt | |
| VisitKt |