JPH09305778A - Polygon duplex device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To duplex a polygon such as the contour data of outline font without damaging the original shape for modifying or bolding a character font. SOLUTION: This device is provided with a vector calculating means 21 for calculating the vector of length of a fixed value directed toward the outside of an input polygon from the side data of the input polygon applied to an input device 10, polygon duplexing means 22 for applying parallel translation to the respective sides of the input polygon based on the obtained vector, intersection calculating means 23 for finding the apexes of the duplexed polygon based on the side data after parallel translation, and polygon duplexing suppressing means 24 for suppressing the protrusion of vertexes of the duplexed polygon corresponding to the distance between the apexes of the input polygon and the duplexed polygon.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a polygon duplication device for duplicating a contour of a given polygon, and more particularly to a polygon duplication device used for thickening an outline font having contour data. .

[0002]

2. Description of the Related Art As a method of thickening a given character, it is general to fill each region of a line representing the skeleton of the character with a region of a predetermined width on both sides of the line. At this time, if the paths are connected at an angle,
A blank area may appear on the outer corner side of the connection portion of the thick line for each path, and may be unsightly. In order not to make the connecting portion between the paths forming the outline of the characters thicker when they are thickened, for example, Japanese Patent Laid-Open No. 5-313638.
The publication discloses a technique for filling a gap between the ends of thick lines. FIG. 6 shows a method for obtaining a bold font from outline data representing a skeleton of a character.
It is a figure explaining the character thickening method based on the technique of 13638 number description.

First, a connection method for filling the ends of thick lines is designated (step 61), and if necessary, outline data is subjected to affine transformation such as enlargement / reduction / transformation (step 62). Then, a thick line is drawn for the first pass (path 1) of the outline data (step 63), and N = 1 is set as a parameter indicating the number of passes for which the bold line drawing is completed (step 64).

Next, it is judged whether or not the value of N has reached the total number of passes forming the outline of the character to be thickened (step 65). A process (connection process) for filling the gap between the thick line ends between the path and the first path is performed (step 69), and the thick line processing is ended. On the other hand, if N is smaller than the total number of passes in step 65, N is incremented by 1 (step 66), and the N-1th pass (the pass drawn by the bold line last time) and the Nth pass (the draw by the bold line this time). A process (connection process) is performed to fill the space between the thick line ends of the connection part with the path (step 67), the thick line drawing is executed for the Nth path (step 68), and the process returns to step 65.

In this way, the outline font is thickened, and the gaps between the thick line ends are filled. Here, FIGS. 7A to 7C respectively show
The connection method for filling the gap between the ends of the thick lines is shown.
In the connection method shown in FIG. 7A, two paths 71 are connected to each other at an angle (right angle in the figure) and a thick line drawing area 72 having a predetermined width is set on both sides of the path 71. In this case, the area 73 (dotted line portion in the drawing) sandwiched between the extension line of the thick line drawing area 72 corresponding to each path 71 and the thick line drawing area 72 is filled, so that the bent portion at the connection point of the path 71 is filled. The gap between the ends of the thick line formed on the outside is filled. In addition, in the example shown in FIG. 7B, an isosceles triangular region 7 connecting the vertices of a long rectangular thick line drawing region 72 corresponding to each path 71.
By filling 4 (dotted line portion in the figure), the gap between the ends of the thick line is filled. Similarly, in the case shown in FIG. 7 (c),
A fan-shaped area 7 is formed by connecting the vertices of the thick line drawing area 72 with an arc.
By filling 5 (dotted line portion in the drawing), the gap between the thick line ends is filled.

However, the above-described character thickening method has a problem that it is difficult to apply it to character data having only the outline of the character, not the skeleton of the character. In the case of character data that has only contours, the insides of the contours are often painted in some way, and when the above-described character thickening method is applied, the edges of the bold line drawing area are not represented by paths. Therefore, it is difficult to directly apply the filling method to the inside of the area surrounded by the path. In addition, since which of the connection methods shown in FIGS. 7A to 7C is to be applied is determined before the processing for filling the space between the thick line ends is performed, it is expected by the thickening processing. The result may not be obtained. That is, character data that has only outlines is often prepared separately according to the typeface such as Mincho or Gothic, but when filling the gap between the thick line ends by a predetermined connection method. ,
Sometimes the characteristics of these typefaces are lost.

FIG. 8 is a diagram for explaining these problems. For example, the outline data 81 in the Mincho typeface of the radical of the Kanji character is as shown in FIG. 8A. If the outline data 81 is simply used as a set of paths and thickening processing is performed, In FIG. 8 (b), a thick line drawing area 82 as shown by the shaded area is obtained. 8C and 8D show that the gaps between the ends of the thick lines at the connecting portions of the paths are filled. FIG. 8C shows a method of filling a space between the ends of a thick line with a triangle (see FIG.
The connection processing was performed in (b)), and the characteristics of the typeface as the Mincho typeface are lost. On the other hand, FIG. 8D shows the connection processing performed by the method of filling the area surrounded by the extension lines of the thick line drawing area (see FIG. 7A).
Although the characteristics as the Mincho type are maintained, when the connecting process is performed on the polygonal figure 83 having an acute angle as shown in FIG. 8 (e) by this method, it is filled by the connecting process at the acute angle part. The area becomes protruding, giving an unnatural impression, and when there is another figure or contour data in the vicinity, the area intersects with each other, which causes a display disorder when a filling process is performed. Furthermore, FIG. 8 (c),
As shown in (d), an unfilled region remains inside the contour data 81.

[0008]

SUMMARY OF THE INVENTION An object of the present invention is to perform polygon duplication for an outline font having contour data and the like, and to easily fill the inside of the outline font enlarged by the duplication. It is an object of the present invention to provide a polygonal duplexer capable of performing the dualization while maintaining the characteristics of each typeface such as Mincho typeface and Gothic typeface.

[0009]

The polygon doubling device of the present invention is a polygon doubling device for doubling a given input polygon into polygons having different sizes, and doubling the contour of the input polygon. It includes polygonal contour doubling means, and polygonal doubling suppressing means for deforming the shape of the polygon after doubling so that the difference in shape characteristics between the input polygon and the polygon after doubling does not become large.

In the present invention, the polygon contour doubling means corresponds, for example, to each side of the input polygon and a vector calculating means for calculating a vector toward the outside of the input polygon for each side of the input polygon. It has a polygonal duplication unit that moves in parallel according to a vector, and an intersection point calculation unit that finds an intersection point between the moved sides. Further, the polygon doubling suppressing means, for example, when the distance between the vertex of the input polygon and the vertex of the polygon after doubling corresponding to the vertices is a certain value or more, the vertex in the polygon after doubling Is moved toward the vertex of the input polygon, and the end point of the line segment obtained by translating the corresponding side of the input polygon is added as a new vertex of the doubled polygon. To be done.

In the present invention, an outline font represented by contour data is regarded as polygon data, and polygons of different sizes (doubled polygons) are generated from the contour of a given polygon. Therefore, it is intended to expand outline fonts and the like.
Just by doubling the contour, as in the case shown in FIG. 8 (e), the protrusion of the apex occurs at the acute angle portion. Therefore, in the present invention, the polygonal duplication suppressing means is provided to suppress the protrusion of the apex. I have to. Specifically, the position of the vertex in the duplicated polygon is shifted according to the distance between the vertex in the original polygon (input polygon) and the vertex in the duplicated polygon corresponding to this vertex. There is. This prevents the difference between the shapes of the input polygon and the duplicated polygon from becoming larger than necessary.

In the present invention, since the duplicated polygon is also represented by polygon data, it is possible to easily perform the filling process for the duplicated polygon. Also, since the outline is duplicated, the characteristics of the typeface are retained.

[0013]

Next, an embodiment of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram showing the configuration of a polygon duplexing apparatus according to an embodiment of the present invention. This polygon duplication device is roughly classified into an input device 10 for inputting a polygon to be processed, such as a keyboard, a data processing device 20 operated by program control, and a storage device for storing polygon information. 30 and an output device 40 such as a display device.

The data processing device 20 calculates a vector for each side of a polygon to be processed (input polygon), vector calculation means 21 for calculating a vector toward the outside of the polygon, and each side of the polygon is a polygon. The polygon doubling means 22 that moves parallel to the outside of the object, the intersection calculating means 23 that calculates the mutual intersection of the parallel-moved edges, and the distance between the parallel-translated edges and the original vertex of the input polygon. When the distance is equal to or greater than a certain value, the intersection point is moved in the direction of the vertex of the original polygon to thereby prevent the protrusion of the vertex after duplexing. There is. The storage device 30 also includes a coordinate value storage unit 31 that stores the coordinate values of each vertex of the polygon, and the vector calculation means 2.
The vector storage unit 32 stores the vector calculated in 1. The vector calculating means 21, the polygon doubling means 22 and the intersection calculating means 23 constitute a polygon contour doubling means.

Next, the operation of the polygon duplexer will be described. FIG. 2 is a flowchart showing the flow of processing,
3A to 3C are diagrams for explaining the process performed by the vector calculating means 21, and FIG. 4 is a diagram for explaining the process performed by the polygon duplexing suppressing means 24.

Data such as an outline font having contour data is given to the input device 10 as an input polygon represented by the contour data. Then, the polygon data input to the input device 10 is converted into the coordinate data of the vertices on the xy coordinate system and stored in the coordinate value storage unit 31 as polygon input processing (step 10).
1). Then, the vector calculation means 21 calculates the maximum and minimum values of the y-coordinates of the vertices of the polygon (step 102), and passes through the midpoint between the calculated maximum and minimum values of the y-coordinates and the x-axis. A straight line L parallel to is calculated (step 10
3). In FIG. 3A, the polygon 5 arranged in the xy coordinate system is used.
0 and a straight line L calculated for this polygon 50 are shown.

Next, the vector calculation means 21 finds all the intersections of the straight line L and each side of the polygon (step 104),
The coordinates of the obtained intersections are stored in the coordinate value storage unit 31, and the sides of the polygon having the intersection c with the smallest x coordinate value are obtained (step 105). Then, of the two end points of the obtained side (the side including the intersection c), the direction from the smaller y-coordinate value to the larger y-coordinate value is defined as the direction of this side, and the direction toward the left 90 degrees is defined with respect to this direction. A vector v having a predetermined length is calculated and stored in the vector storage unit 32 (step 106). In Fig. 3 (b),
A polygon 50 and a vector v calculated from the side including the intersection point c are shown. As for the remaining sides, a vector having a predetermined length in the left 90 ° direction is calculated for each side and stored in the vector storage unit 32 (step 1).
07). At this time, the orientation of each side is determined so that the orientations are continuous with reference to the orientation determined for the side including the intersection c in step 106. FIG. 3C shows the direction of each side and the vector thus obtained for each side.

Then, the control is transferred to the polygon duplication means 22, and the polygon duplication means 22 translates the sides of the polygon in parallel by the directions and distances represented by the corresponding vectors calculated by the vector calculation means 21. , In the coordinate value storage unit 31 (step 108). Then, the control is transferred to the intersection calculation means 23, and the intersection calculation means 23 obtains the intersections of the two sides which are adjacent to each other in the original polygon after the parallel movement (step 109). It is determined whether or not there is an intersection between the edges (step 110). If there is an intersection, the process proceeds to step 112. If there is no intersection, the side after translation is extended to obtain the intersection (step 111) and the process proceeds to step 112. Step 11
In 2, the intersection calculation means 23 stores the intersection obtained as described above in the coordinate value storage unit 31 as the vertex of the new polygon by duplication.

Then, the control is transferred to the polygonal duplication suppressing means 24, and the polygonal duplication suppressing means 24 carries out step 109.
The distance between the vertex of the doubled polygon obtained in step 1 and the corresponding vertex of the original polygon (input polygon) is obtained (step 11).
3) It is determined whether or not the distance is larger than a predetermined constant value (step 114). When the distance is less than the fixed value, the process directly proceeds to step 116, and when the distance is more than the fixed value, the vertex of the doubled polygon is set as the vertex of the original polygon corresponding to the vertex of the doubled polygon. The protrusion of the apex is suppressed by moving to a position where the distance from the apex of the original polygon is a predetermined value on the line segment connecting the. Further, the coordinates of both end points of the line segment obtained by simply translating the sides of the original polygon are added to the vertex data (step 115), and the process proceeds to step 116.
FIG. 5 is a diagram for explaining the suppression of the protrusion of the apex,
The protrusion P of the newly generated doubled polygon 52 is suppressed by moving in the direction of the corresponding vertex Q of the original polygon 51 (illustration, vertex P ′). It is shown. Further, a vertex R is newly added based on the end points of the line segment obtained by moving the sides of the original polygon in parallel.

In step 116, it is determined whether the above steps 118 to 115 have been performed for all the vertices. If all the vertices have been processed, the output device 40 outputs the doubled polygon as the processing result.
To complete the process, and if there are unprocessed vertices, the process returns to step 108 to complete the process for all vertices of the polygon until step 1
The processing from 08 to step 115 is repeated.

FIG. 5 is a diagram showing the polygon thus doubled. Here, it is shown that a duplicated polygon 55 is obtained with the contour data 54 representing the pan lid of the radical of the Chinese character in Mincho type as the input polygon. In the present embodiment, the duplicated polygon 55 is also represented as polygon data. Therefore, when filling the inside of the duplicated polygon 55, a well-known polygon filling algorithm can be used. It is possible and easy to fill. Further, as shown in FIG. 5, duplication is performed while maintaining the characteristics of each typeface such as Mincho typeface and Gothic typeface.

[0023]

As described above, according to the present invention, there is provided in the polygon contour doubling means, for example, a vector calculating means for calculating a vector for translating each side of the input polygon toward the outside of the input polygon. Since the polygons are duplicated by parallelizing the sides of the input polygon based on the vector provided, the polygons after duplication can be obtained as polygon data, and fill processing can be performed easily. ,
There is an effect that the font data can be duplicated while maintaining the characteristics of the typeface such as Mincho typeface and Gothic typeface. Also, by providing a polygon duplication suppressing means that brings the vertex of the duplicated polygon closer to the vertex of the input polygon according to the distance between the vertex of the duplicated polygon and the input polygon, The difference in polygonal shape does not become large, and there is an effect that unnecessary protrusion of the apex is prevented.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of a polygonal duplexer according to an embodiment of the present invention.

FIG. 2 is a flowchart illustrating an operation of the polygon duplexing device of FIG.

3 (a) to 3 (c) are diagrams for explaining processing in a vector calculation means.

FIG. 4 is a diagram illustrating a process performed by polygon duplexing suppressing means.

5 is a diagram illustrating a processing result by the polygon duplexing device in FIG. 1;

FIG. 6 is a flowchart showing processing in a conventional character thickening method.

7A to 7C are diagrams illustrating a connection method for filling a gap between thick line ends.

8A is a diagram showing the contour data of a pot lid of a kanji radical in Mincho type, and FIGS. 8B to 8D are the contour data of FIG. 8A processed by a conventional character thickening method. Figure showing the result of (e)
FIG. 6 is a diagram showing a result of processing a polygon having an acute angle by a conventional method.

[Explanation of symbols]

 10 Input Device 20 Data Processing Device 30 Storage Device 31 Coordinate Value Storage Unit 32 Vector Storage Unit 40 Output Device 21 Vector Calculation Means 22 Polygon Duplexing Means 23 Intersection Calculating Means 24 Polygon Duplexing Suppressing Means 101-116 Steps

Claims (5)

[Claims] 1. A polygon duplication device for duplicating a given input polygon into polygons of different sizes, said polygon contour duplicating means for duplicating the contour of said input polygon, and said input polygon. A polygon doubling device, comprising: polygon doubling suppressing means for deforming the shape of the polygon after doubling so that a difference in shape characteristics from the polygon after doubling does not become large. 2. The polygon contour doubling means corresponds to each side of the input polygon and a vector calculation means for calculating a vector toward the outside of the input polygon for each side of the input polygon. The polygon duplexing device according to claim 1, further comprising: polygon duplexing means that translates in accordance with a vector; and intersection calculation means that determines an intersection of the sides after translation. 3. The vector calculating means calculates a vector directed to the outside of the input polygon from the positional relationship between a straight line having an intersection with the side of the input polygon and the side of the input polygon. The polygonal duplexer according to 1. 4. The polygon according to claim 1, wherein the polygon duplication suppressing unit performs processing according to a distance between the vertex of the input polygon and the vertex of the polygon after duplication corresponding to the vertex. Redundant device. 5. The polygon duplication suppressing means determines that the polygon after duplication has a distance between a vertex of the input polygon and a vertex of the polygon after duplication corresponding to the vertex that is equal to or greater than a certain value. The vertex of the input polygon is shifted toward the vertex of the input polygon, and the end point of the line segment obtained by translating the corresponding side of the input polygon is added as a new vertex of the polygon after doubling. The polygonal duplexer according to claim 1, which is used.