| 摘要 |
PURPOSE:To obtain a method to efficiently compress font data by providing a process to convert the font data so as to increase either 0 or 1 of bit map font data, and a process to encode the continuous length of increased data and unincreased data in converted data setting the amount of increased data as 0. CONSTITUTION:It is assumed that original font data is (mXn) dot fonts, and it is enclosed with (m+2)X(n+2) dots. Thence, such pattern is scanned sequentially by using a matrix pattern of 2X2. When it coincides with either of patterns 502-509, the dot of the font data located at a position in accordance with the dot 510 of the matrix 501 is converted to white (0). While, when noncoincidence is obtained between them, the dot of the font data for the dot 510 is converted to black (1). |
