Locality-preserving hashing

In computer science, a locality preserving hashing is a hash function f that maps a point or points in a multidimensional coordinate space to a scalar value, such that if we have three points A, B and C such that

$|A-B|<|B-C|\Rightarrow |f(A)-f(B)|<|f(B)-f(C)|$.

External links

• Locality-preserving hashing in multidimensional spaces