No solid plans yet. Mostly I wanted to get some kind of start on a collection of space partitioning data structures.
Some ideas - haddock documentation - automated tests - bounding volume hierarchies. - Extend into 3D My current use of the quadtree is for collision detection. Though also being able to effectively satisfy other types of requests would be great. -Corey O'Connor On Tue, Jan 27, 2009 at 7:52 PM, Artyom Shalkhakov <[email protected]> wrote: > Hello, > > 2009/1/27 Corey O'Connor <[email protected]>: >> http://hackage.haskell.org/cgi-bin/hackage-scripts/package/data-spacepart >> >> The goal of this package is to be a collection of space partitioning >> data structures. Currently, however, there is only a simple quadtree >> implementation. > > Are you going to experiment with kd-trees, octrees and other spatial > acceleration data structures? Is it for raytracing or for collision > detection, or > maybe for 3d graphics on consumer hardware? > > Cheers, > Artyom Shalkhakov. > _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
