A simple octree implementation I planned on using in my boids simluation. I moved to a kdtree to improve nearest neighbor search performance.
Note: This is not intended to be a library, you probably shouldn't use it.
A simple octree implementation in Haskell to be used in my boids simluation.