Implementations of spatial indexes in Haskell?

Are there any good implementations of spatial indexes in Haskell such as R-tree, kd-tree,开发者_如何学Python etc...

The only implementations I'm aware of are the spacepart package, which seems to be incomplete and abandoned, and the KdTree package, which as you might guess has no ambitions beyond providing a kd-tree type.

This is something that's been on my TODO list for a while, since there have been several occasions where I wanted a spatial index data structure, but didn't want one badly enough to stop everything and write a decent implementation on the spot.

The Glome Raytracer uses a bounding interval hierarchy.

It well modularized too, so you'll probably want to start with GlomeTrace and GlomeVec.

I'm doing collision testing via point/volume queries and ray intersections. It seems to perform very well.

there is a RTree package on Hackage. It is tested, but it's not as sophisticated as the containers package.