Matching algorithms for finite point sets in plane

Given two sets P and Q of n and m (⩽n) labeled points, respectively, in plane, the matching problem considered here is to determine all occurrences of Q in P when Q is allowed to be translated. An occasional lower bound of Ω[(n-m)m+nlog n] is shown for this problem. For the matching the authors study five different algorithms based on the techniques of dynamic programming, point-line duality, instance matching, list traversal, and radix matching