Optical kerning for multi-character sets
AssigneeApple Inc.
InventorsJacob G. Refstrup, Martin J. Murrett, Christopher E. Rudolph
Life of this patent
Estimating the term…
Abstract
A content processing application that implements a method for displaying characters at least a threshold distance apart. The method receives two consecutive characters. The method automatically identifies a distance between the two consecutive characters and moves at least one of the two consecutive characters to adjust the distance between the two consecutive characters to a threshold distance apart.
Claims20
A method of displaying characters, the method comprising:
- receiving two consecutive characters;
- automatically identifying a distance between the two consecutive characters;
- moving at least one of the two consecutive characters to adjust the distance between the two consecutive characters.
A non-transitory computer readable medium storing a program which when executed by at least one processing unit determines distances between characters, the program comprising sets of instructions for:
- determining a quantization distance for each of a plurality of characters;
- for each character, identifying a plurality of pairs of sections that each approximate part of an edge of the character, wherein the sections in a first direction are a same span as the quantization distance;
- for each character, storing data identifying the plurality of sections;
- and
- using the stored data to determine an approximate distance between the edges of two adjacent characters.
A method of determining a distance between two adjacent characters, the method comprising:
- approximating a first adjacent edge of a first character as a first sequential set of sections;
- approximating a second adjacent edge of a second character as a second sequential set of sections;
- iteratively:
- selecting a pair of sections, each pair comprising a section from the first set of sections and an section from the second set of sections, wherein in each iteration a section that is farther in the first set than in the previous iteration is selected or a section that is farther in the second set than in the previous iteration is selected;
- and
- determining a distance between the pairs of selected sections;
- and
- identifying a smallest distance between a plurality of said pairs of sections as the distance between the adjacent characters.
Dependencies are inferred from the claim text.