Geometric Problems with Application to Hashing
Douglas E. Comer, Michael J. O’Donnell · SIAM Journal on Computing · 1982
Efficient algorithms are presented for two geometric problems. Both problems involve finding the best projection of a set of points from two-space onto a line, with two different notions of “best”. The key technique is to identify critical angles in between which the functions to be optimized have nice trigonometric forms that can be solved exactly. Applications to hashing arise when we look for the best linear combination of two hashing functions.