Provides various query aabb broad phase algorithms such as collision pair finding, raycast, or k_nearest, on the dinotree data structure.
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.
The dinotree_alg_data project generates some graphs using RustGnuPlot. These graphs are used to create the reports in the dinotree_report project that is a seperate dinotree project.
Analysis
Please see the dinotree_report github project for a writeup of the design and analysis of the algorithms in this project.
Rust Version
Requires rust nightly for the following features:
#![feature(test)]
#![feature(trusted_len)]
License
Licensed under the terms of MIT license and the Apache License (Version 2.0).
See LICENSE-MIT and LICENSE-APACHE for details.
Pictures
These are pictures from the inner dinotree_alg_demo project.
k_nearest
multirect
raycast
raycast f64
nbody
colfind
intersect_with
