JPS62232087A - Character dot-font segmentation system - Google Patents

Abstract

PURPOSE:To enlarge or reduce a character to an optional size and to display it by automatically transforming a character dot-font data to a vector-font data. CONSTITUTION:A control part 1, through an address management part 3, reads character dot-font in a font memory 2, and searches all the strings made up of pieces of value '1' adjacent to each other with a distance of 1 in vertical (horizontal) direction, and stores the coordinates of the starting and the ending points of each string and its length in the first memory device 4. The part 1 then searches all the strings made up of pieces of value '1' adjacent to each other with a distance of 2<0.5> in the diagonal direction descending (ascending) to the right at the angle of 45 deg. against the horizontal direction, and stores the coordinates of the starting and the ending points of each string and its length in the memory device 4. One of the longest length among the strings stored in the memory device 4 is selected, and the coordinates of its starting and the ending points are stored in the second memory device 5. If there is any other string that intersects with the said one at a point, the value of the point is left in value '1' as it is. If no string intersects with said point, the value of the point concerned is made '0'. As a result, the coordinates of the starting and the ending points of the line that constitutes a character dot-font can be obtained.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a character dot/font line differentiation method for extracting line segments constituting a given character dot/font.

[Prior art and its problems]

When displaying characters on a computer display, a method is usually adopted in which the on-off status of each dot is determined by referring to character dot font data that has been registered in advance, and the font of the character is displayed. There is. An example of such a character dot font is shown in FIG. Figure 2 is vertical 16
This is an example of a dot font for "East" when the size is 16 dots horizontally. Here, to make it easier to see, only points with a value of '1' are shown as black circles. However, in this method, the dimensions of the characters are fixed, so when you try to enlarge or reduce the display, the respective dimensions will change. Therefore, it is extremely difficult to freely set the enlargement/reduction ratio to display characters of various sizes.

On the other hand, characters are considered to be a set of line segments, and the starting point of these line segments is
A method (called a vector font method) in which the coordinate values of the end point are used as data has been proposed. According to this method, the entire character can be enlarged or reduced to an arbitrary size by enlarging or reducing the lengths of all the line segments constituting the character to an appropriate size. In this way, the vector font system has the advantage of being able to easily enlarge or reduce characters to any size, but on the other hand, it has the disadvantage that the amount of data is larger than the character dot font system. Therefore, preparing vector font data for all characters in advance is not a desirable strategy from the point of view of memory efficiency.

[Purpose of the invention]

An object of the present invention is to provide a method for efficiently and automatically dividing a given character dot font into lines in order to meet such demands from the industrial world.

[Means for solving problems]

The present invention is based on a point having one of two values given on horizontal and vertical grid point coordinates, where the horizontal direction is the X axis, the vertical direction is the y axis, and the right and upward directions are positive directions. The distance l in the vertical direction with respect to the character dot font
Search for all chains consisting only of adjacent points of one of the two values, store the coordinates and lengths of the start and end points of each chain in the tgl storage, and then Search for all chains consisting only of points of one of the two values adjacent to each other at a distance l, store the coordinates and length of the start and end points of each chain in the first storage device, and then Then, search for all chains consisting only of points of one of the two values that are adjacent at a distance V7 in a diagonal direction that is downward to the right at an angle of 45 degrees with respect to the horizontal direction, and find the starting point of each chain. and the coordinates and length of the end point are stored in the first storage device, and then,
Search for all chains consisting only of points of one of the two values that are adjacent at a distance of √2 in a diagonal direction with 9 at the top right at an angle of 45 degrees to the horizontal direction, and find the starting point of each chain. and the coordinates and length of the end point in the first storage device, then select the chain with the largest length among the chains stored in the first storage device, and calculate the coordinates of the start and end point of the chain. the second
, and for each point included in the chain, if any other vertical or horizontal direction intersects the chain through the point, or a diagonal that is downward to the right at an angle of 45 degrees with respect to the horizontal direction, If there is a diagonal chain that rises to the right at an angle of 45 degrees with respect to the direction or the horizontal direction, the value of the point is set to one of the two values, otherwise the value of the point is set to the two values. Let the other value of the value be
Do this for all points included in the chain,
After that, clear the first storage device, repeat the above operation, and store the chain with the maximum length at each point in time in the second storage device, so that the value of all the points is the other of the two values. This character dot/font line differentiation method is characterized in that the coordinates of the starting point and end point of the line segment constituting the character dot font are obtained in the second storage device by repeating the process until the value is reached.

[Principle of the present invention]

The present invention will be described below with reference to the drawings.

Here, the character dot/7-ot/line differentiation method according to the present invention will be explained by taking up the "bundle" character dot/font shown in FIG. 2 (1+). First, for the given character dot font in Figure 2, search for all chains consisting only of points with value "l" that are vertically adjacent at a distance of 1, and find the start and end points of each chain. The coordinates and length of
Next, search for all chains consisting only of points with a value of "1" that are adjacent at a distance of 1 in the horizontal direction, and find the coordinates and length of the start and end points of each chain in the first place. Next, search for all chains consisting only of points with the value "1" that are adjacent at a distance v'T in a diagonal direction that is downward to the right at an angle of 45 degrees to the horizontal direction. The coordinates and lengths of the start and end points of each of these chains are stored in the first storage device, and then the coordinates and lengths of the start and end points of each chain are stored in a first storage device, and then they are placed adjacent to each other at a distance of 7 at an angle of 45 degrees to the horizontal direction, with the upper right corner being the third. Search for all chains consisting only of points with the value "1", store the coordinates and lengths of the start and end points of each chain in a first storage device, and then store them in the first storage device. Choose the longest chain among the chains. In this case, a line segment having a length of 16 and having a starting point at the point (8°0) and an ending point at the point (8, 15) is selected. After storing the coordinates of the starting point and ending point of this line segment in the second storage device, the value of each point included in this line segment is set to "O". However, points (8,5), (8,8), (8,11), (
8゜13) Regarding K, there is another line segment that passes through these points and intersects with this line segment, so leave it as is without setting it to "0" ◇As a result, the character dot font will be changed to the third Changes as shown in the figure. After this, the first storage device is cleared and the above operation is repeated again. As a result, the point (
A line segment having a length of 15 and having a starting point at point (1, 13) and an ending point at point (15, 13) is selected. After storing the coordinates of the starting point and ending point of this line segment in the second storage device, the value of each point included in this line segment is set to O'''. Since there are no other line segments that intersect with the line segment, all points become "0".As a result, the character dot font changes as shown in Figure 4.Hereafter, in the same manner,
Line segment with point (3,11) as the starting point and point <13.11) as the ending point, line segment with point (3,8) as the starting point and point (13,8) as the ending point, point (3, Line segment with starting point at 5) and ending point at point (13°5), line segment starting at point (3,10) and ending at point (3,6), starting point at point (13°10) and the line segment ending at point (13,6), point (4,2)
1 point (10
,4) as the starting point and ending point (12,2),
A line segment whose starting point is point (2,1) and whose end point is point (3,2), a line segment whose starting point is point (13,2) and its ending point is point (14,1), and a line segment whose starting point is point (13,2) and its ending point is point (14,1). 1) as the starting point and point (1゜l) as the ending point, point (15,15) as the starting point and point (1゜l) as the starting point,
Line segments having end points 5, 15) are sequentially selected, stored in the second storage device, and the process ends. In other words, the character dot for “East”
The font can be decomposed into the above 13 line segments. ◇ [Embodiment] FIG. 1 is a block diagram showing an embodiment of the present invention. The control unit 1 performs overall control and may be a general-purpose electronic computer. It is assumed that the dot font of the target character is registered in the font memory 2 in advance. Initially, a start command enters the control unit l. The control unit 1 inputs the font through the address management unit 3.
Read the character dot font in memory 2, search for all chains consisting only of points with value "1" that are adjacent at a distance of 1 in the vertical direction, and find the coordinates and length of the start and end points of each chain. The information is stored in the first storage device 4. Next, all chains consisting only of points with a value of "1" that are adjacent at a distance of 1 in the horizontal direction are searched, and the coordinates and lengths of the start and end points of each of these chains are stored in the first storage device 4. do. Next, search for all chains consisting only of points with a value of "1" that are adjacent to each other with a distance shift in a diagonal direction that is downward to the right at an angle of 45 degrees to the horizontal direction, and find the start and end points of each chain. The coordinates and length of are stored in the first storage device 4.

Next, search for all chains consisting only of points with the value "1" that are adjacent at a distance of V7 diagonally upward to the right at an angle of 45 degrees to the horizontal direction, and find the start and end points of each chain. The coordinates and length of are stored in the first storage device 4. Thereafter, the chain with the largest length is selected from among the chains stored in the first storage device 4, and the coordinates of the start and end points of that chain are stored in the second storage device 5, and the coordinates included in the chain are stored in the second storage device 5. For each point, if any other vertical or horizontal direction or horizontal direction intersects the chain through that point,
If there is a diagonal chain that goes down to the right at an angle of 5 degrees or a chain that goes up to the right at an angle of 45 degrees with respect to the horizontal direction, the value of the point is set to "1"! If not, the value of the point is set to "0", this is done for all points included in the chain, and then the first storage device 4 is cleared. By repeating the above operation and sequentially storing the chain with the largest length at each point in the second storage device 5, and repeating this until the value of all points becomes 0'', the corresponding character dot - The coordinates of the starting and ending points of the line segments that make up the font can be obtained in the second storage device 5.

Note that it is easy to implement the functions corresponding to the configurations shown in the embodiments using a normal electronic computer.

〔Effect of the invention〕

In contrast to the conventional character dot font method that uses character fonts as dot data, the method according to the present invention allows character dot font data to be efficiently and automatically converted to vector font data. By using this, it is possible to enlarge or reduce characters to any size and display them.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing one embodiment of the present invention, FIG. 2 is a diagram showing an example of a character dot font, and FIGS.
The figure is a diagram for explaining a character dot/font line differentiation method according to the present invention. DESCRIPTION OF SYMBOLS 1... Control unit, 2... Font memory, 3... Font memory address management unit, 4... First storage device, 5 ...Second
storage device. ＼−１′

Claims (1)

[Claims] A character dot consisting of a point that has one of two values given on the horizontal and vertical grid point coordinates, where the horizontal direction is the x-axis, the vertical direction is the y-axis, and the right and upward directions are positive directions. Search for all chains consisting of points of one of the two values that are adjacent to each other at a distance of 1 in the vertical direction with respect to the font, and calculate the coordinates and length of the start and end points of each chain using the first Store it in a storage device, then search for all chains consisting of points of only one of the two values that are adjacent at a distance of 1 in the horizontal direction, and calculate the coordinates and length of the start and end points of each chain. is stored in the first storage device, and then consists of only points of one of the two values that are adjacent at a distance of √2 in a diagonal direction that is downward to the right at an angle of 45 degrees to the horizontal direction. Search for all chains, store the coordinates and lengths of the start and end points of each chain in a first storage device, and then calculate the distance diagonally upward to the right at an angle of 45 degrees to the horizontal. √2
searches for all chains consisting only of adjacent points of one of the two values, stores the coordinates and lengths of the start and end points of each chain in a first storage device, and then The chain with the largest length is selected from the chains stored in the second storage device, and the coordinates of the start and end points of the chain are stored in the second storage device, and for each point included in the chain, if the Any other vertical or horizontal direction that intersects the chain through a point, or a diagonal direction that is downward to the right at an angle of 45 degrees to the horizontal direction, or a diagonal direction that is upward to the right at an angle of 45 degrees to the horizontal direction. If a chain exists, the value of the point is set to one of the two values, and if not, the value of the point is set to the other value of the two values, and this is applied to all points included in the chain. Then, clear the first storage, repeat the above operation, and store in the second storage the chain with the maximum length at each point in time, and store it in the second storage so that the value of every point is one of the binary values. A character dot/font line differentiation method characterized in that the coordinates of the starting point and end point of a line segment constituting the character dot font are obtained in a second storage device by repeating the process until the other value is reached.