CHARACTER GENERATION UNDER GRID CONSTRAINTS

An original and fast filling algorithm based on vertical scan line sweep and contour tracking of a presorted shape description allows filling of character shapes with real subpixel resolution. Identical parts of a character lying at a different phase in respect to the grid will have a dissimilar discrete look. Grid constraints are applied in order to force given parts of a character (stems, serifs) to attain identical phasing. So that several constraints may be applied, degrees of freedom are provided in the form of stretchable null-segments inserted at particular locations in the character outline description.


Published in:
Computer Graphics (ACM), 21, 4, 243-252
Year:
1987
Keywords:
Laboratories:




 Record created 2007-01-31, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)