Investigate use of hash table for octree

[Avokadoen]

Using a hash table and a accompanying hash for each individual cell would make compression of the octree trival, altough lookup would probably be a bit slower. Cells with the same properties would get the same hash and therefore be reused implicity. Then the lookup buffer could store individual hash keys