An iterative mulithreaded hybrid kdtree/mark and sweep algorithm used for broadphase detection.
Goal
Create a fast and simple to use broad-phase collision system whose running time did not depend on the size of the 2d space in which the collision finding functionality was being provided. Does not suffer from "teapot in a stadium" problem.
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.
License
Licensed under the terms of MIT license and the Apache License (Version 2.0).
See LICENSE-MIT and LICENSE-APACHE for details.