given a region partitioned into a small number of pixels (future post cmpvevta), enumerate glyphs. two possible colors, denoted background and foreground. simplest enumeration: with N pixels, 2^N glyphs.
more complicated: avoid glyphs the same after translation. avoid rotations, so text written sideways or upside down does not change meaning. avoid reflections, making life easier for dyslexics.
only one connected component of foreground pixels. strictly more (or less) than half the pixels are foreground. or, avoid glyphs the same after inversion, swapping foreground and background. (this might be useful for designing symbols for fairy chess, where we want both a black and white version of symbols.)
avoid not only "same" but also similar, within a given Hamming distance. maximize the number of distinct symbols.
No comments :
Post a Comment