Claims
- 1. A method for marking segmented characters with a traversible marking head having at least one marking member, comprising the steps of:
- providing a look-up table of integers corresponding to a set of segmented characters;
- providing control for traversing said marking head in a first path capable of covering each segment of said set of segmented characters;
- receiving a string of characters to be marked;
- looking up each character of said string within said look-up table and converting each character into an integer;
- comparing each of said integers for generating a second, optimal path which bypasses traversing through any unused segments of said set; of segmented character and
- traversing said marking head through said second path while actuating each of said marking members in correspondence with said segments.
- 2. The method of claim 1 wherein each integer corresponds to a binary word, said word having a number of bits equal to the number of segments in said set of characters being printed.
- 3. The method of claim 1 wherein the number of bits in each binary word is 16.
- 4. The method of claim 1 wherein a "1" in said binary word represents the presence of a character segment.
- 5. The method of claim 1 wherein said set of segmented characters are alphanumeric.
- 6. The method of claim 1 wherein said marking head is provided with a plurality of marking members mounted in fixed adjacency with one another.
- 7. The method of claim 6 wherein said marking members are actuated to simultaneously print a plurality of segmented characters corresponding to the number of marking members.
Parent Case Info
This application claims the benefit of U.S. Provisional Application Ser. No. 60/021,105 filed Jul. 2, 1996.
US Referenced Citations (10)
Foreign Referenced Citations (2)
Number |
Date |
Country |
60-61284 |
Apr 1985 |
JPX |
1-180090 |
Jan 1989 |
JPX |