Generalized Approzimate Algorithms for Point Set Congruence

We address the question of determining if two point sets are congruent. This task consists of defining the concept of point congruence, and developing algorithms that test for it. We introduce the (e,κ)-map, a device which pictorially represents the degree of congruence between two point sets. Point set congruence has been studied by previous researchers, but we feel that our definitions offer a more general and powerful approach to the problem. By using the paradigm of approximate algorithms, we are able to construct the (e,κ)-map efficiently.