Collision Detection

Spatial Hashing Motivation: large grids are usually very sparse –we need to store data only for non-empty cells –but we need fast O(1) access based on (x,y,z) Given point p=(x,y,z) laying within cell c=(i,j,k) wedefine spatial hashing function as hash(i,j,k) = (ip 1xor jp 2xor jp 3) mod n Where p 1, p 2, p 3are large prime numbers and n isthe size of hash table Hash collision are solved with buckets