A new approach to point pattern matching

An approach to planar point pattern matching is presented in which the point sets are first transformed to the canonical forms, under affine transformation, and then two canonical forms are compared directly. A method for transforming a set of n points to a canonical form in O(n) time and an average O(n) time algorithm for finding a matching between canonical forms of two point sets are proposed.<<ETX>>