This paper considers the computer vision problem of testing whether two equal cardinality points sets A and B in the plane are -congruent. We say that A and B are -congruent if there exists an isometry I and bijection l:A → B such that dist(I(a), l(a)) , for all a ε A. Since known methods for this problem are expensive, we develop approximate decision algorithms that are considerably faster than the known decision algorithms, and have bounds on their imprecision. Our approach reduces the problem to that of computing maximum flows on a series of graphs with integral capacities.