Report Number: CS-TR-82-914
Institution: Stanford University, Department of Computer Science
Title: Using string matching to compress Chinese characters
Author: Guoan, Gu
Author: Hobby, John
Date: May 1982
Abstract: 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.
http://i.stanford.edu/pub/cstr/reports/cs/tr/82/914/CS-TR-82-914.pdf