Hash functions for 3D points

I have been trying to implement the solution to 3-cell marking problem that I discussed earlier. In order to avoid duplicate points of intersection while counting number of intersections of a random ray from the barycenter of each tetrahedron I need to use set representation to store the intersection points.

C++ requires using a hash function for doing comparision while inserting an element in the set. Since my elements are three dimensional, I need to find out an effective hash function for multi-dimensional structures.

So, this post will contain an active list of hash functions that I find on internet proposed for multidimensional structures.

Written on 13 Mar 2015