up to 2k 1pixels in length the central plateau for strings longer than 2k 1 pixels and preserves the already thin lines and the voids character separations in the strings of pixels assume k 2 and that there are six pixel strings having lengths of 1 2 3 4 5 and 6 pixels if a 2 a a 1 b a 0 c a 1 d and a 2 e the coefficients are selected to satisfy the following conditions for the string of one pixel c u2260 other c 5 1 c 5 2 c 5 3 c 5 4 c 5 5 for the string of two pixels a b u2260 c 5 1 other c 5 2 c 5 3 c 5 4 c 5 5 for the string of three pixels b c d u2260 c 5 1 c 5 2 other c 5 3 c 5 4 c 5 5 for the string of four pixels a b c d u2260 c 5 1 c 5 2 c 5 3 other c 5 4 c 5 5 for the string of five or more pixels a b c d e u2260 c 5 1 c 5 2 c 5 3 c 5 4 other c 5 5 c 5 i represents the addition of the numbers a i in the combinations of order i with 5 elements a b c d and e the solution to this set of conditions locates the centers of pixel strings up to 2k 1 pixels in length and the center plateau for pixel strings.