Browse Prior Art Database

Shape Editing of Digitized Characters

IP.com Disclosure Number: IPCOM000075452D
Original Publication Date: 1971-Sep-01
Included in the Prior Art Database: 2005-Feb-24
Document File: 2 page(s) / 32K

Publishing Venue

IBM

Related People

Ricard, JH: AUTHOR

Abstract

The algorithm generates a series of background and character points corresponding to the first column of the character. It then end-length encodes this column. The end-length code of the I line of a character is given by M(I), N(I,1), N(I,2), ....N(I,M(I)), where M(I) is the number of end lengths in the line, N(I,1) is the number of background points before the first character point, N(1,2) is the first length plus the number of points making up the first group of character points, and so on.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 75% of the total text.

Page 1 of 2

Shape Editing of Digitized Characters

The algorithm generates a series of background and character points corresponding to the first column of the character. It then end-length encodes this column. The end-length code of the I line of a character is given by M(I), N(I,1), N(I,2), ....N(I,M(I)), where M(I) is the number of end lengths in the line, N(I,1) is the number of background points before the first character point, N(1,2) is the first length plus the number of points making up the first group of character points, and so on.

The algorithm then generates the points corresponding to the second column, and so on. Referring to the flowchart, the program is initialized by setting the end-length index of all rows to 1, corresponding to the first end length. The current end length of each line, TAB(I), is set equal to the first end length, N(1,2). The polarities of P(I) of all lines are set to -1, corresponding to background. The column J to be encoded is set to 1, and K is a number for each line which indexes the end lengths.

The algorithm after the initialization is as follows: For each row the current end length TAB(I) is compared with the column number J. If J is greater, TAB(I) is replaced by the next end length of the line; and the current polarity of the row is reversed (i.e., character becomes background and background becomes character). Then the row polarities are end-length encoded. J is then increased by 1, corresponding to the next column.

The algorith...