Two-Dimensional Pattern Matching with Rotations


The problem of pattern matching with rotation is that of 2nding all occurrences of a twodimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such di4erent possible rotated patterns. Subsequently, given an m × m array (pattern) and an n × n array (text) over some 2nite alphabet , we present a new method… (More)
DOI: 10.1007/3-540-44888-8_2

7 Figures and Tables


  • Presentations referencing similar topics