This invention relates to the building of characters (e.g., for visual display or printing) on an output medium of a device, involving the use of a font stored in a font file.
In the field of this invention it is known that the display of characters on an output medium of a device involves the use of a font, stored in a font file of some format, and comprising many glyphs each representing a character portion. If a required character glyph is not available to the device, an appropriate font file is typically obtained (e.g., via a network download). Such font files can be large, especially where a character set includes a large number of characters (such as a Chinese character font comprising in excess of 20,000 characters).
However, this approach has the disadvantage(s) that downloading such font files over a network can therefore be time consuming, and local storage on a client device may not accommodate the entire font file.
Although it is known to download to a device only those subset(s) of glyphs or metadata that the device requests, this only partly alleviates the problem, and it still requires further download(s) whenever a glyph is required that the device has not yet been requested.
A need therefore exists for a method and arrangement for font building wherein the abovementioned disadvantage(s) may be alleviated.
In accordance with a first aspect of the present invention there is provided a method of font building as claimed in claim 1.
In accordance with a second aspect of the present invention there is provided a method of operating a server for cooperating with a client for font building thereat as claimed in claim 2.
In accordance with a third aspect of the present invention there is provided an arrangement for font building as claimed in claim 15.
In accordance with a second aspect of the present invention there is provided an server arrangement for cooperating with a client for font building thereat as claimed in claim 16.
One method and arrangement for font building incorporating the present invention will now be described, by way of example only, with reference to the accompanying drawing(s), in which:
Referring firstly to
In this event, the client 110 requests a download of a subset of font glyphs (which may be significantly quicker than downloading an entire font) from the server 140; the requested subset includes glyphs for characters that it needs to display but which are not presently in its memory 120. The server 140 provides to the client 110 the requested subset.
However, in addition to the requested subset the server 140 also provides to the client one or more further glyphs that might be expected to be of use to the client. The further glyph(s) sent from the server's memory 160 to the client are determined by the server on the basis of one or more selection criteria, as will be explained in greater detail below. In a preferred implementation, the subset of glyphs can be provided in a standard format of font file (such as TrueType) which is incompletely or sparsely populated (i.e., glyphs are provided for only a subset of all characters accommodated within the font file).
For ease of use, the client 110 communicates with server 140 (sending its request, and receiving the requested and further character glyphs) via commonplace HTTP (HyperText Transfer Protocol) rather than the font server using its own protocol, as is known, to provide data.
Glyphs are stored locally at the client device (in memory, e.g. in a font file), and new glyphs are added when received from the server. Additionally, in response to resource criteria at the client device (such as storage space constraints) glyphs can be removed from the storage of the client device, with the removed glyphs determined by specified criteria (such as those least frequently used).
Thus the server 140 sends more glyphs than the client 110 requests, based on a prediction of other glyphs that the client will need in the near future. This scheme of sending slightly more glyphs than are immediately required is an attempt to minimise the number of requests the client has to make, in order to reduce the overhead of making requests.
Referring now to
Referring now to
The selection criteria algorithm for the prediction of which glyphs the client will need soon may be based on the following:
The ‘opaque data’ sent by the client with the request can also indicate which subsets of glyphs are present on the client, and also how often each of these subsets are ‘hit’. That is, how often each subset successfully supplies a glyph for display on the client screen. This hit rate data is important to the server so that it can calculate over time which glyphs are most commonly displayed by the clients that it is serving.
The server tries to adapt to the needs of the clients it serves in two ways: 1) it adjusts the number of glyphs it sends together in each ‘chunk’, to achieve an acceptable download time for the chunk (to avoid excessive delay for the user); 2) it reorganises the chunks of glyphs if their request frequency changes over time (the chunks are reorganised so that each chunk contains only the most requested/used glyphs; it is more efficient, when determing which chunks to send with a requested glyph, to send glyphs that have a high request/usage count rather than those that have a low count; this gives a greater probability that the sent chunk will in fact contain glyphs that the client might need later on; it may be that over time glyph usage changes for whatever reason, and so this will allow the server to change along with it).
It will be appreciated that the method for font building described above may be carried out in software running on one or more processors (not shown) in the server and if desired in the client device, and that the software may be provided as a computer program element carried on any suitable data carrier (also not shown) such as a magnetic or optical computer disc.
It will be understood that the method and arrangement for font building described above provides the advantage that it reduces the need for font/glyph download.
| Number | Date | Country | Kind |
|---|---|---|---|
| 0413261.9 | Jun 2004 | GB | national |