freetype
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Freetype] x,y coords


From: Nelson H. F. Beebe
Subject: Re: [Freetype] x,y coords
Date: Mon, 29 Mar 2004 05:38:47 -0700 (MST)

Here is the complete reference to the paper briefly cited by Werner:

@String{j-J-ACM                 = "Journal of the ACM"}

@Article{Hobby:1993:GAT,
  author =       "John D. Hobby",
  title =        "Generating automatically tuned bitmaps from outlines",
  journal =      j-J-ACM,
  volume =       "40",
  number =       "1",
  pages =        "48--94",
  month =        jan,
  year =         "1993",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411",
  bibdate =      "Mon Dec 16 08:30:04 MST 1996",
  bibsource =    "Compendex database,
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib,
                 ftp://ftp.math.utah.edu/pub/tex/bib/jacm.bib,
                 Misc/JACM.bib, Theory/JACM.bib",
  abstract =     "Consider the problem of generating bitmaps from
                 character shapes given as outlines. The obvious
                 scan-conversion process does not produce acceptable
                 results unless important features such as stem widths
                 are carefully controlled during the scan-conversion
                 process. This paper describes a method for
                 automatically extracting the necessary feature
                 information and generating high-quality bitmaps without
                 resorting to hand editing. Almost all of the work is
                 done in a preprocessing step, the result of which is an
                 intermediate form that can be quickly converted into
                 bitmaps once the font size and device resolution are
                 known. A heuristically defined system of linear
                 equations describes how the ideal outlines should be
                 distorted in order to produce the best possible results
                 when scan converted in a straightforward manner. The
                 Lovasz basis reduction algorithm then reduces the
                 system of equations to a form that makes it easy to
                 find an approximate solution subject to the constraint
                 that some variables must be integers. The heuristic
                 information is of such a general nature that it applies
                 equally well to Roman fonts and Japanese Kanji.",
  acknowledgement = ack-nhfb,
  affiliation =  "AT\&T Bell Lab",
  affiliationaddress = "Murray Hill, NJ, USA",
  classification = "723.1; 722.4; 745.1; 723.2; 921.6",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "Algorithms; Computer hardware; Computer software;
                 Typesetting; Character recognition; Heuristic methods;
                 Constraint theory; Roman fonts; Feature recognition;
                 Lovasz basis reduction; Scan conversion; Tuned bitmaps;
                 Outlines; Japanese Kanji, Graphics; Algorithms; feature
                 recognition; fonts; Lovasz basis reduction;
                 scan-conversion;",
}

Subscribers to the ACM Digital Library can find it online.

-------------------------------------------------------------------------------
- Nelson H. F. Beebe                    Tel: +1 801 581 5254                  -
- University of Utah                    FAX: +1 801 581 4148                  -
- Department of Mathematics, 110 LCB    Internet e-mail: address@hidden  -
- 155 S 1400 E RM 233                       address@hidden  address@hidden -
- Salt Lake City, UT 84112-0090, USA    URL: http://www.math.utah.edu/~beebe  -
-------------------------------------------------------------------------------




reply via email to

[Prev in Thread] Current Thread [Next in Thread]