US3646571A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of encoding graphical data
Assignee: Typagraph Corp
•
Filing: 1970-03-18
•
Granted: 1972-02-29
•
Expires: 1990-03-18
Abstract
Abstract A method of encoding graphical data to be displayed by an output terminal where the output terminal has plural modes of operation and procedures are undertaken to select, using past history and future anticipated operation, the fastest and most efficient mode of operation. In the faster modes, part of the information defining the location to be reached and the symbol to be displayed are stored and remembered. In these modes less information need be transmitted to the terminal to execute a move and successive moves are thereby executed faster. The optimum mode may be selected by examining previous location information to predict a possible mode change.
Inventors
- 👤 George Y Kurata
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 10:05
CPC Classifications
G; G06; G06K; G06K15/00; G06K15/22
Claims Analysis
Total Claims: 56
Claim 1
Independent Claim
109 words
For machine implementation, a method of encoding graphical data to be displayed by an output terminal, wherein the terminal responds to a stream of characters representing said data, comprising the operations of: 1. calculating the number of moves required for the terminal to reach the next desired graphical point, 2. selecting from several operating modes the optimum mode for moving toward said point, in each of said several modes at least one character being stored and permitting a character stream to subsequently omit the stored character; and 3. generating a character stream to operate the terminal in the optimum mode to obtain maximum information density in the character stream.
Claim 2
Dependent Claim
109 words
For machine implementation, a method of encoding graphical data to be displayed by an output terminal, wherein the terminal responds to a stream of characters representing said data, comprising the operations of: 1. calculating the number of moves required for the terminal to reach the next desired graphical point, 2. selecting from several operating modes the optimum mode for moving toward said point, in each of said several modes at least one character being stored and permitting a character stream to subsequently omit the stored character; and 3. generating a character stream to operate the terminal in the optimum mode to obtain maximum information density in the character stream.
Claim 3
Dependent Claim
37 words
selecting from several operating modes the optimum mode for moving toward said point, in each of said several modes at least one character being stored and permitting a character stream to subsequently omit the stored character; and
Claim 4
Dependent Claim
37 words
selecting from several operating modes the optimum mode for moving toward said point, in each of said several modes at least one character being stored and permitting a character stream to subsequently omit the stored character; and
Claim 5
Dependent Claim
14 words
selecting from several operating modes the optimum mode for moving toward said point; and
Claim 6
Dependent Claim
14 words
selecting from several operating modes the optimum mode for moving toward said point; and
Claim 7
Dependent Claim
36 words
comparing foR each location in the character stream the new characters with the stored values of the characters defining the immediately preceding move to ascertain if any of the new characters are different from those preceding,
Claim 8
Dependent Claim
36 words
comparing foR each location in the character stream the new characters with the stored values of the characters defining the immediately preceding move to ascertain if any of the new characters are different from those preceding,
Claim 9
Dependent Claim
44 words
The method of claim 1 wherein said optimum mode is selected for executing a first move toward said graphical point, the method further including: repeating operations (1) through (3) to command an additional move if said first move is insufficient to reach said point.
Claim 10
Dependent Claim
75 words
selecting from several operating modes the optimum mode for moving toward said point, the operation of selecting the optimum mode including: examining a given number of preceding moves to find for each location in the character stream any characters which are the same for each move; and after finding the same character in said given number of preceding moves, changing to a mode capable of transmitting a greater information density than the current mode; and
Claim 11
Dependent Claim
75 words
selecting from several operating modes the optimum mode for moving toward said point, the operation of selecting the optimum mode including: examining a given number of preceding moves to find for each location in the character stream any characters which are the same for each move; and after finding the same character in said given number of preceding moves, changing to a mode capable of transmitting a greater information density than the current mode; and
Claim 12
Dependent Claim
12 words
generating a character stream to operate the terminal in the optimum mode.
Claim 13
Dependent Claim
12 words
generating a character stream to operate the terminal in the optimum mode.
Claim 14
Dependent Claim
57 words
The method of claim 1 wherein: the calculated number of moves represents a given number of steps in two coordinate directions, the size of each step not exceeding the maximum possible number of increments movable by the terminal in one move, and a remainder, the size of the remainder not exceeding the above said number of increments.
Claim 15
Dependent Claim
29 words
selecting an operating mode for said first move which compresses the new characters in a character stream of as few characters as possible to obtain maximum information density, and
Claim 16
Dependent Claim
29 words
selecting an operating mode for said first move which compresses the new characters in a character stream of as few characters as possible to obtain maximum information density, and
Claim 17
Dependent Claim
124 words
generating a character stream to operate the terminal in the optimum mode, wherein at least one step precedes execution of the remainder and for each step the symbol encoded in the character stream represents a blank so that after each step no symbol is visually displayed by the output terminal, with the symbol and the increments of the remainder being encoded in the character stream and executed together in the final move; and wherein the operation of selecting the optimum mode includes: setting to zero the step in one coordinate direction if the incremental distance represented by said step is sufficient to reach said point; and encoding said incremental distance represented by said step in said character stream only when moving through said remainder.
Claim 18
Dependent Claim
124 words
generating a character stream to operate the terminal in the optimum mode, wherein at least one step precedes execution of the remainder and for each step the symbol encoded in the character stream represents a blank so that after each step no symbol is visually displayed by the output terminal, with the symbol and the increments of the remainder being encoded in the character stream and executed together in the final move; and wherein the operation of selecting the optimum mode includes: setting to zero the step in one coordinate direction if the incremental distance represented by said step is sufficient to reach said point; and encoding said incremental distance represented by said step in said character stream only when moving through said remainder.
Claim 19
Dependent Claim
21 words
generating a character stream to operate the terminal in the optimum mode to obtain maximum information density in the character stream.
Claim 20
Dependent Claim
21 words
generating a character stream to operate the terminal in the optimum mode to obtain maximum information density in the character stream.
Claim 21
Dependent Claim
22 words
repeating operations (1) through (3) to command an additional move if said first move is insufficient to reach the desired new point.
Claim 22
Dependent Claim
22 words
repeating operations (1) through (3) to command an additional move if said first move is insufficient to reach the desired new point.
Claim 23
Dependent Claim
39 words
The method of claim 3 wherein a symbol is to be displayed at said point and the symbol and the increments of the remainder are encoded together in the character stream and are executed together in the final move.
Claim 24
Dependent Claim
43 words
The method of claim 4 wherein at least one step precedes execution of the remainder and for each step the symbol encoded in the character stream represents a blank so that after each step no symbol is visually displayed by the output terminal.
Claim 25
Dependent Claim
68 words
The method of claim 1 wherein the operation of selecting the optimum mode further includes: examining a given number of preceding moves to find for each location in the character stream any characters which are the same for each move; and after finding the same character in said given number of preceding moves, changing to a mode capable of transmitting a greater information density than the current mode.
Claim 26
Dependent Claim
22 words
The method of claim 6 wherein the process of examining said given number of preceding moves is performed for three such moves.
Claim 27
Dependent Claim
31 words
The method of claim 3 wherein the operation of selecting the optimum mode includes: examining the total number of steps and selecting the optimum mode based on the number of steps.
Claim 28
Dependent Claim
56 words
The method of claim 5 wherein the operation of selecting the optimum mode includes: setting to zero the step in one coordinate direction if the incremental distance represented by said step is sufficient to reach said point; and encoding said incremental distance represented by said step in said character stream only when moving through said remainder.
Claim 29
Dependent Claim
121 words
A reiterative process for machine implementation wherein graphical data in the form of points at which symbols are to be plotted, each point being expressed in terms of x and y coordinate distances from a common origin is encoded to be displayed by an incremental graphical display terminal receptive to characters expressing point location by x and y displacements from the immediately preceding point and by a quadrant direction from the immediately preceding point and by a symbol to be displayed at the print location and wherein the display terminal has plural operating modes, in each mode at least one respective character being stored and permitting a character stream to subsequently omit the stored character, said process comprising the operations of:
Claim 30
Dependent Claim
121 words
A reiterative process for machine implementation wherein graphical data in the form of points at which symbols are to be plotted, each point being expressed in terms of x and y coordinate distances from a common origin is encoded to be displayed by an incremental graphical display terminal receptive to characters expressing point location by x and y displacements from the immediately preceding point and by a quadrant direction from the immediately preceding point and by a symbol to be displayed at the print location and wherein the display terminal has plural operating modes, in each mode at least one respective character being stored and permitting a character stream to subsequently omit the stored character, said process comprising the operations of:
Claim 31
Dependent Claim
98 words
The process of claim 10 wherein the operation of analyzing the data further includes: calculating the net distances Delta x and Delta y in each coordinate axis direction from the immediately preceding point to the new point; determining the quadrant of the new point with respect to the preceding point; determining a step size in x and y (dx and dy) for said first move of the display terminal; and calculating the number of steps required to move within one step size of the new point leaving a remainder to be moved of less than one step size.
Claim 32
Dependent Claim
26 words
The process of claim 11 including utilizing a mode in which either dx or dy is stored if the number of steps exceeds a given number.
Claim 33
Dependent Claim
11 words
The process of claim 12 wherein said given number is one.
Claim 34
Dependent Claim
33 words
The process of claim 11 wherein the operation of analyzing the data further includes: setting the symbol to a blank if the distance to the new point is greater than one step size.
Claim 35
Dependent Claim
30 words
The process of claim 14 wherein the operation of analyzing the data further includes: ascertaining whether said Delta x and Delta y are both even multiples of the step sizes.
Claim 36
Dependent Claim
35 words
The process of claim 15 wherein the operation of analyzing the data further includes: setting the symbol to a blank if Delta x and Delta y are not both even multiples of the step sizes.
Claim 37
Dependent Claim
48 words
The process of claim 15 wherein the operation of analyzing the data further includes: setting the symbol to a blank if Delta x and Delta y are both even multiples of the step sizes; and reducing the number of steps by one to avoid overshooting the new point.
Claim 38
Dependent Claim
61 words
The process of claim 11 wherein the operation of selecting an operating mode includes: comparing a given character for each of several preceding moves to determine for each location in the character stream if the character is identical for each move; and utilizing an operating mode in which the given character is stored if the character is determined to be identical.
Claim 39
Dependent Claim
17 words
The process of claim 18 wherein the given character is compared for each of three preceding moves.
Claim 40
Dependent Claim
27 words
The process of claim 11 wherein the operation of selecting an operating mode includes: examining the current mode to determine whether either dx or dy is stored.
Claim 41
Dependent Claim
69 words
The process of claim 20 wherein the operation of selecting an operating mode further includes: using the current mode if, upon examining the current mode, one of dx and dy is found to be stored; and attempting to change modes to a mode in which one of dx or dy is stored if, upon examining the current mode, neither one of dx or dy is found to be stored.
Claim 42
Dependent Claim
75 words
The process of claim 21 wherein the operation of attempting to change modes includes: comparing for each location in the character stream a given character for each of several preceding moves to determine if the given character is identical for each move; utilizing an operating mode in which the given character is stored if the character is found to be identical; and using the current mode if the character is not found to be identical.
Claim 43
Dependent Claim
20 words
The process of claim 22 wherein the operation of comparing a given character compares the character for three preceding moves.
Claim 44
Dependent Claim
47 words
The process of claim 11 wherein the operation of selecting an operating mode includes: resetting counters keeping track of the last three moves to zero, if the number of steps is greater than one; and using a mode in which one of dx or dy is stored.
Claim 45
Dependent Claim
63 words
The process of claim 24 wherein the operation of selecting an operating mode further includes: determining whether either dx or dy is zero; if either dx or dy is zero, then using a mode having the zero character of dx or dy stored; and if neither dx or dy is zero, then using a mode in which either dx or dy is stored.
Claim 46
Dependent Claim
57 words
The process of claim 11 wherein the operation of selecting an operating mode includes: setting to zero the step in one coordinate direction if the net incremental distance represented by said step is sufficient to reach said point, and encoding said incremental distance represented by said step in said character stream only when moving through said remainder.
Claim 47
Dependent Claim
32 words
For machine implementation, a method of encoding graphical data to be displayed by an output terminal, wherein the terminal responds to a stream of characters representing said data, comprising the operations of:
Claim 48
Dependent Claim
32 words
For machine implementation, a method of encoding graphical data to be displayed by an output terminal, wherein the terminal responds to a stream of characters representing said data, comprising the operations of:
Claim 49
Dependent Claim
22 words
The method of claim 27 wherein the process of examining said given number of preceding moves is performed for three such moves.
Claim 50
Dependent Claim
57 words
The method of claim 27 wherein: the calculated number of moves represents a given number of steps in two coordinate directions, the size of each step not exceeding the maximum possible number of increments movable by the terminal in one move, and a remainder, the size of the remainder not exceeding the above said number of increments.
Claim 51
Dependent Claim
39 words
The method of claim 29 wherein a symbol is to be displayed at said point and the symbol and the increments of the remainder are encoded together in the character stream and are executed together in the final move.
Claim 52
Dependent Claim
43 words
The method of claim 30 wherein at least one step precedes execution of the remainder and for each step the symbol encoded in the character stream represents a blank so that after each step no symbol is visually displayed by the output terminal.
Claim 53
Dependent Claim
32 words
The method of claim 29 wherein the operation of selecting the optimum mode further includes: examining the total number of steps and selecting the optimum mode based on the number of steps.
Claim 54
Dependent Claim
57 words
The method of claim 31 wherein the operation of selecting the optimum mode further includes: setting to zero the step in one coordinate direction if the incremental distance represented by said step is sufficient to reach said point; and encoding said incremental distance represented by said step in said character stream only when moving through said remainder.
Claim 55
Dependent Claim
20 words
For machine implementation, a method of encoding graphical data to be displayed by an output terminal comprising the operations of:
Claim 56
Dependent Claim
20 words
For machine implementation, a method of encoding graphical data to be displayed by an output terminal comprising the operations of:
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1975-02-28 | 1975-08-30 | 1976-02-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1979-02-28 | 1979-08-30 | 1980-02-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1983-02-28 | 1983-08-30 | 1984-02-29 | $7700.00 | Window Closed / Lapsed |