Point pattern matching using convex hull edges

Algorithms for matching two sets of points in a plane are given. These algorithms search in the parameter space and find the transformation parameters that can match the most points in two sets. Since an exhaustive search for the best parameters is not affordable as the number of points in the sets become large, a subset selection method is given in order to reduce the search domain. Subsets are chosen as points on the boundary of the convex hulls of the sets. The algorithms are tested on generated and real data, and their performance is compared.