A Simple Pattern Matching Algorithm
				for each pattern point p    for each scene point s      Determine translation so that p falls on s;      count = 0;      for each translated pattern point q        Find the scene point r closest to q;        if (r is “close enough” to q) count++;      Remember which p,s gives max count;
		O(mn) O(mn) O(m2n2) O(m2n) O(mn) T = O(m2n2)
					CS409 - Spring 2000		4