Faster two-dimensional pattern matching with rotations
The most efficient currently known algorithms for two-dimensional pattern matching with rotations have a worst case time complexity of O(n(2)m(3)), where the size of the text is n x n and the size of the pattern is m x m. In this paper we present a new algorithm for the problem whose running time is 0(n(2),m(2)). (c) 2006 Published by Elsevier B.V.
two-dimensional pattern matching rotation design and analysis of algorithms