geometric hashing

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

<< Previous

Word Browser

Next >>

mamba
flag of cayman islands
coat of arms of the cayman islands
mckeeva bush
hawthorne effect
bruce dinwiddy
pound hill, crawley
maximum rocknroll
bridget driscoll
ponthieu
raf church fenton

an encyclopaedia of occultism
nararn sin
tincture of iodine
cross posting
protein structural alignment
vilyam genrikovich fisher
blind alley
lene marlin
herb ellis
hunting (disambiguation)
ultra personal computer

native schools
diving physics
greenacres
hunting (engineering)
soy milk
nuclear accident terminology
paw paw
culture of croatia
tiksi
al khisas
charge (youth)

charge (warfare)
gerhard domagk
sass jordan
plymouth argyle f.c. season 2003 04
translation (physics)
carrollton, maryland
brooks
robbie
jet (band)
shau kei wan
andrea chnier