[DGD] Sparce Matrix

[balduin at uni-paderborn.de]

Hello Kevin!

> Anybody have any suggestions on how to efficiently store and search
> a large 3-D sparse matrix?

What do you need ? An octree ? A grid ? Or what else ? If we talk
about trees, do you want the indices of each node to be sparse ?
Or is it sufficient, that the tree is sparse ?
Depending on your exact problem nested arrays or nested mappings
will fit best.

If you just want to store a 3d map of uniform sized rooms, a nested 
mapping will probably suit your needs best. Just use one mapping
along the x-axis, insert there a mapping along the y-axis and in each
a mapping along z. If coords of rooms are not unique. You will have
to store a list of rooms in this mapping.

Ludger
(balduin at uni-paderborn.de)

List config page:  http://list.imaginary.com/mailman/listinfo/dgd