Geometric hashing - Definition and Overview

In computer science, geometric hashing is a method for efficiently finding geometric objects of the same or similar shape, even though they may be rotated or otherwise transformed. Each object is represented as a set of triangles scaled so that one edge has size one, and these triangles are stored in an ordinary hash table.

Geometric hashing is used in computer vision and structural alignment of proteins.

References

• Wolfson, H.J. & Rigoutsos, I (1997). Geometric Hashing: An Overview. IEEE Computational Science and Engineering, 4(4), 10-21. Also available on-line from http://www.math.tau.ac.il/~wolfson/on-line-articles.html