Geometric Hashing, Continued
To test for a match:            [O(n3) time]
for each pair (s,t) of scene points
   Find transformation with origin at s, + X-axis through t;
   for each transformed scene point u
     if u falls in an occupied pattern bin [tested using hashing]
       Increment the vote for that pattern transformation;
   Report a match if some transformation gets enough votes;
CS409 - Spring 2000
12