| 摘要 |
PROBLEM TO BE SOLVED: To array character strings to be matched to the length of existent character blocks. SOLUTION: From a length L of the character block, a font size S of a character string and the number N of characters, according to the calculation expression of K1=(L-S×N)/(N-1) and K1=(L-S×N)/(N-1), a temporary interval K1 is found, the character strings are located and temporarily displayed at the temporary interval K1, and a real length L1 of the temporarily displayed character string is acquired by scanning the pixels of the temporarily displayed character string. According to the expression of M=(L-L1)/(N-1), a correction value M to the temporary interval K1 is found, the sum of the temporary interval K1 and the correction value M is determined as a final interval K, and the character string is located at the determined final interval K.
|
