RSS News FeedSpatial hash function
Message-ID:<4b11c6c6$0$269$14726298@news.sunsite.dk>
Subject:
Spatial hash-function
Date:Sun, 29 Nov 2009 01:56:26 +0100
When designing a hash-function one normaly wants to distribute the keys evenly in the array. But assume that the hashfunction should be used to create buckets of points in 3D space. Points that are neighbors should be located in the same bucket, while points far away from each other should be located in different buckets. Further the max and min location of points are known. As an example the points: (1,2,3), (4,3,2), (4,6,1) should hash to a bucket different than the points (10,20,30), (40,30,20), (40,60,10). Where do I find more information on creating this kind of hash-function that hash neighboring 3D points to the same bucket?