Overview
This crate hopes to provide an efficient 2D space partitioning data structure and useful query algorithms to perform on it in a hopefully simple cohesive api.
It is a hybrid between a KD Tree and Sweep and Prune.
Uses no_std
, but uses the alloc
crate.
Please see the dinotree-book which is a work in-progress high level explanation and analysis of this crate.
Inner projects
The dinotree_alg_demo inner project is meant to show case the use of these algorithms. It depends on the piston 2d engine to draw to the screen.
Analysis
Please see the book for a work in progress writeup of the design and analysis of the algorithms in this project.
Screenshot
Screen capture from the inner dinotree_alg_demo project.
Example
use rect;
use *;