BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-82-914
       ENTRY:: June 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Using string matching to compress Chinese characters
        TYPE:: Technical Report
      AUTHOR:: Guoan, Gu
      AUTHOR:: Hobby, John
        DATE:: May 1982
       PAGES:: 18
    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.
       NOTES:: [Adminitrivia V1/Prg/19950601]
         END:: STAN//CS-TR-82-914