A generic, n-dimensional quadtree for fast neighbor lookups on multiple axes.

N-Tree

A quadtree-like structure of arbitrary arity

Overview

Provides the Region trait and NTree type, usable for quickly indexing data based on multiple attributes and finding nearest neighbors by many metrics, such as 3-dimensional collision detection.

Examples

See the test fixtures for an example quadtree implementation created as a simple specialization of n-tree.