Subject: Re: [boost] new library (space partitioning)
From: Thorsten Ottosen (thorsten.ottosen_at_[hidden])
Date: 2010-07-28 04:27:09
Adam Wulkiewicz skrev:
> I've implemented:
> - k-dimensional generalizations of STL containers (used by some space
> partitioning data structures)
> - k-dimensional space partitioning data structures
> - regular grid
> - kd-tree
> - something I've called regular tree,
> it's k-dimensional generalization of quadtree/octree,
> so for k=2 it's quadtree, for k=3 it's octree,
> for k=4 it's 16tree and so on.
> - k-dimensional euclidean algebra/geometry data structures
> - points, vectors etc.,
> - unit tests.
I'm very interested as such data-structures also play a role in AI and
You may also consider BSP trees now that you are at it.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk