Data compression with finite windows
Communications of the ACM
| Hi-index | 0.02 |
A new method for font compression is introduced and compared to existing methods. A very compact representation is achieved by using a variant of McCreight''s string matching algorithm to compress the bounding contour. Results from an actual implementation are given showing the improvement over other methods and how this varies with resolution and character complexity. Compression ratios of up to 150 are achieved for Chinese characters.