JPH10188022A - Image processing method, its device and storage medium storing program executing the method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an image processing method, its device which generate full contour data prohibiting crossing from stroke data permitting crossing and a storage medium storing a program for executing the method. SOLUTION: The contour coordinates of two strokes of character data are read (S1), and a contour expressed by the contour coordinates is straightened (S3). Whether or not the contours of the two strokes cross with each other is judged based on the straightened contour coordinates (S7) to obtain an intersection point judged to cross (S8) and the connecting of contour points including the intersection point is changed to generate not crossing contour data (S10). The curved part of the generated contour data which does not include crossing is judged and a curve is generated based on the curved part (S19) to generate contour data.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an image processing method and apparatus for changing from contour data that allows intersection to contour data that does not allow intersection, and a storage medium that stores a program for executing the method.

[0002]

2. Description of the Related Art When it is desired to generate a large-size character or an outline character from a stroke-type character pattern vector that allows intersections, it is necessary to temporarily change from stroke-type character data that allows intersections to data of all contours that do not allow intersections. It is necessary to process after converting. And in such cases conventionally,
Bitmap data is once generated from stroke-type character vector data, and the contour of the character pattern is traced to obtain coordinate data of the entire contour of the character. Therefore, in order to improve the character quality, it is necessary to generate a bitmap with a desired character output size and then obtain the outline of the character, so that the larger the character size, the more processing time is required. There was a problem that it required.

[0003]

When the character size is increased, the size of the bitmap data is increased, and there arises a problem that the expansion memory size for expanding the pattern becomes insufficient. If the memory capacity is insufficient, it can only be expanded to a certain size, and for characters of a larger size, there is a problem that the coordinate value after generating the entire contour must be enlarged,
Depending on the size of the memory, there is a problem that the quality of the character pattern to be created must be degraded.

On the other hand, in order to speed up such character pattern processing, it is necessary to reduce the size of the bitmap image, track the outline of the character, obtain the coordinates of all outlines, and then enlarge / reduce. Since the processing was performed, the quality of the character was particularly degraded when a large-size character pattern was output.

SUMMARY OF THE INVENTION The present invention has been made in view of the above conventional example, and has an image processing method and apparatus for generating all contour data which does not allow intersection from stroke data which allows intersection, and a storage medium which stores a program for executing the method. The purpose is to provide.

Another object of the present invention is to provide an image processing method and apparatus capable of generating a high-quality image pattern at a high speed and a storage medium storing a program for executing the method.

[0007]

In order to achieve the above object, an image processing apparatus according to the present invention has the following arrangement.
That is, an image processing apparatus that generates contour data that does not allow intersection from contour data registered in units of strokes that allow intersection of contours, and a reading unit that reads contour coordinates of two strokes; Linearizing means for linearizing the outline of the two strokes; determining means for determining whether or not the outlines of the two strokes intersect based on the outline coordinates of the two strokes; Contour data generating means for obtaining intersections and changing the connection of the contour points including the intersections to generate non-intersecting contour data; and determining to judge a curve portion of the contour data not including the intersections generated by the generating means. Means,
And a curve generating means for generating a curve based on the curve portion determined by the determining means.

[0008] To achieve the above object, the image processing method of the present invention comprises the following steps. That is, an image processing method for generating contour data that does not allow intersection from contour data registered in units of strokes that allow intersection of contours, wherein a reading step of reading contour coordinates of two strokes, A linearizing step of linearizing the outline of the two strokes; a determining step of determining whether or not the outlines of the two strokes intersect based on the outline coordinates of the two strokes; A contour data generating step of obtaining an intersection and changing the connection of the contour points including the intersection to generate non-intersecting contour data;
A determination step of determining a curve portion of the contour data not including the intersection generated in the generation step; and a curve generation step of generating a curve based on the curve portion determined in the determination step. .

[0009]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Preferred embodiments of the present invention will be described below in detail with reference to the accompanying drawings.

[First Embodiment] FIG. 1 is a block diagram showing a basic configuration of an information processing system according to an embodiment of the present invention. This information processing system may be a Japanese word processor, or may be a computer system such as a workstation or a personal computer.

In FIG. 1, reference numeral 1 denotes a CPU (central processing unit).
And performs control and arithmetic processing of the entire apparatus. 2
Is a ROM (read only memory), which stores a system startup program, character pattern data for character conversion, and the like. 3 is a RAM (random access memory),
The data used for the operation of the CPU 1 and the result of the operation by the CPU 1 are temporarily stored. Reference numeral 4 denotes a KBC (keyboard control unit) which receives key input data (character code and control code) from a keyboard (KB) 5 and
To one. Reference numeral 6 denotes a CRTC (display control unit) which reads out display information stored in the RAM 3, that is, a bitmap image converted from a character code, and transfers it to the display unit 7. A display unit 7 such as a liquid crystal display or a CRT receives a bitmap image from the CRTC 6 and displays it on a display screen. 8 is a DKC (disk control unit)
And controls the reading and writing of data to and from the external storage device 9. Reference numeral 9 denotes an external storage device such as a floppy disk (FD), a hard disk (HD), or a CD-ROM. The external storage device 9 stores programs and data, and the CPU 1 can refer to the stored data as needed, or download the data to the RAM 3 and execute it. 10 is PRTC
(Printer control unit) and PRT (printer device) 1
1 is performed. A system bus 12 transmits data and control signals between the above-described components.

FIG. 2 is a memory map showing the memory configuration as viewed from the CPU 1.

This memory has a basic I / O program 21
0, an operating system 211 such as a window system, an application 212, related data 213, a work area 214, and the like, which are features of the present embodiment. The basic I / O program 210 uses R
It is stored in OM2. The operating system is stored in the HD 9, and when the power is turned on, the IPL (initialize program loading) function of the basic I / O program 210 transfers the data from the HD 9 to the RAM 3.
Is read and stored, and its operation is started.

The application program 212 and related data 213 according to this embodiment are stored in the external storage device 9.
FD or CD-ROM. Then, the program and related data are once installed in the HD from the FD or CD-ROM, and can be executed when the power is turned on or loaded from the HD into the RAM 3 by an instruction from the keyboard 5 or the like. Or, without installing to HD, directly from FD or CD-ROM
It is also possible to load and execute it on AM3.

FIG. 2 shows a memory map in a state where an operating system 211 such as a window system, an application program 212, and related data 213 are loaded into the RAM 3 and become executable. 214
Indicates a work memory used by each program.

FIG. 3 is a block diagram showing a control configuration of another system according to the present embodiment. The printer used in this system may be, for example, a laser beam printer, an ink jet printer, or an output device such as a thermal transfer.

In FIG. 3, reference numeral 31 denotes a central processing unit (CPU), which controls the entire apparatus and performs arithmetic processing. 32 is a ROM (read only memory),
This is a storage area for a system startup program and character pattern data. Reference numeral 33 denotes a RAM, which is a data storage area having no use restriction, and is an area in which each program and data are loaded and executed for each of various processes. 34
Is a PRT (printer control unit), and 35 is a PRT (printer device). Reference numeral 36 denotes a system bus, which should serve as a data path between the above-described components.

FIG. 4 is a flowchart showing processing executed in the system according to the first embodiment. The program for executing this processing is an application program 2
12 is stored.

First, in step S1, a character code, its output size, typeface, deformation information, and the like are passed, and target character data is read from the character code and typeface. The data to be read at this time is character data registered in units of strokes, and each stroke may be (core + thickness) type data as shown in FIG. 5, or as shown in FIG. Each stroke may be contour type data. If the read data is (core + thickness) type data as shown in FIG. 5, the (core + thickness) type data is converted into outline coordinates in units of one stroke. FIGS. 5 and 6 show strokes corresponding to the same contour, ○ indicates an end point, and △ indicates an intermediate point of the curve.

Next, the process proceeds to step S2, in which the width and height of the character stored in the storage device such as the ROM 2 or the HD 9 and the output size of the character requested by the interface before the start of this processing are enlarged. Perform coordinate conversion such as reduction processing and deformation processing.

Next, in step S3, if curve data exists, short vector data is generated.
At this time, the curve data is defined in advance by a cubic Bezier function, a cubic B-spline function, a secondary Bezier function, a secondary B-spline function, or the like. Here, as shown in FIG. 7, when the original points A, B, C, and D defined by the cubic Bezier function are decomposed, the point a is the midpoint of the line segment AB, and the point b is the line segment BC
, The point c is the midpoint of the line segment ab, the point x is the midpoint of the line segment ab, the point z is the midpoint of the line segment bc, the point y is the midpoint of the line segment xz, and so on. Two new Bezier composing points Axy
And yzcD. And the Bezier composing point Aax
y and yzcD are newly decomposed and finally decomposed until a preset convergence condition is satisfied. Then, the new point sequence obtained at this time becomes the point sequence of the short vector. Then, a point sequence that has been converted into a short vector from the obtained Bezier curve and a point sequence originally registered as a straight line are registered so as to maintain the order of the contour.

FIGS. 8A to 8C are views showing the state of the coordinate sequence thus registered.

FIG. 8A shows an example of a contour, and FIG. 8B shows the data structure of a contour data management information section. Each contour has a clockwise, counterclockwise, start, and end. The point number is described. FIG. 8C is a diagram showing the data configuration of the contour coordinate data table.

As the contents of registration, there is first a contour data management information section (B) indicating information of one contour, and as its constituent elements, the rotation direction (counterclockwise, clockwise) of each contour, start point number (contour coordinates) The end point number (corresponding to the address of the contour coordinate data table), the maximum coordinate value of the contour data (stroke maximum coordinate), and the minimum coordinate value (stroke minimum coordinate) are stored. There is a contour coordinate data table (C) in which contour coordinates are actually stored. In this area, “the coordinate value of the contour”, “the previous point number”, and “next point number” are stored at the locations from the start point number to the end point number indicated by the contour data management information section.

Next, the process proceeds to step S4, where it is determined whether or not the generation of outline data of all strokes for one character has been completed. When coordinate conversion and linearization of curve data are completed for all strokes of one character, step S is executed.
The process proceeds to step S5, and if there is still a stroke to be processed, the process proceeds to step S2.

From step S5, the outline data of the stroke registered in the processing up to step S4 is checked, and if the outlines intersect, a process for generating a new outline by connecting the outlines is performed. Do. In step S5, first, as shown in FIG. 8, the registered first contour data is set as reference contour data.

Next, the process proceeds to step S6, in which contour data (contour EFGH) subsequent to the reference contour data (contour ABCD) set in step S5 is set as target contour data. In step S7, it is checked whether the reference contour data and the target contour data intersect. In this determination method, the maximum coordinate value and the minimum coordinate value of the reference contour data (contour ABCD) and the maximum coordinate value and the minimum coordinate value of the target contour data (contour EFGH) are obtained from the information of each contour shown in FIG. Check if they overlap,
That is, it is determined whether or not the maximum value or the minimum value of the coordinates of the other contour data is between the maximum value and the minimum value of one contour data. If there is, it is determined that there is an intersection, and the process proceeds to step S8. If they do not overlap, it is determined that there is no intersection, and the process proceeds to search for the next target contour data in step S12.

In step S8, intersecting line segments between the reference contour data (contour ABCD) and the target contour data (contour EFGH) are searched, and if there is intersecting contour data, calculation is performed to find the intersection. In the method of obtaining the intersecting line segments, a line segment of the reference contour data and a line segment of the target contour data are checked by brute force. If the maximum coordinate or the minimum coordinate of the line segment of the reference contour data is between the maximum coordinate and the minimum coordinate of the line segment of the target contour data, that is, if they overlap, there is an intersection of the line segments for the time being. Is determined.
If it is determined that there is an intersection between the line segments,
Find the intersection of two line segments.

As shown in FIG. 9, if this intersection is between two line segments, it is finally determined that there is an intersection.
On the other hand, as shown in FIG. 10, when the intersection of two line segments is outside the straight line, it is not determined as an intersection. Then, the existence of the intersection is checked for all the line segments of the reference outline data and all the line segments of the target outline data, and when the intersection exists, calculation for obtaining the coordinate position of the intersection is performed.

Then, the process proceeds to a step S9, and a step S8
It is determined whether or not there is an intersection between the reference contour data and the target contour data. If one or more intersections have been obtained, the process proceeds to step S10, and a connection change process is performed. Also, if it is determined in step S7 that there is an intersection, but the line segment is actually checked in step S8, and there is no intersection (as in FIG. 11), the process also proceeds to step S12.

When proceeding to step S10 as described above,
This is the case where the two contour data of the reference contour data and the target contour data intersect, and the intersection determined in step S8 is added to rearrange the connection of the two contour data.

FIGS. 12A to 12C show how this rearrangement is performed.
(C) and FIGS. 13 (A) to 13 (D).

First, in the example of FIG. 12A, the intersection of the line segment DA of the reference contour data (contour ABCD) and the line segment EF of the target contour data (contour EFGH) is α, and similarly, the line segment BC The intersection of the line segment EF is β, the intersection of the line segment BC and the line segment GH is γ, and the intersection of the line segment DA and the line segment GH is δ. Then, each intersection is defined by a contour coordinate data table (FIG. 12).
(C)) at two points (for example, α1, α2, β1, β2,
γ1, γ2, etc.). Here, the reason why the intersections are stored two by two is that A → Z → D and C → Z → in order to perform reconnection when the line segment AB and the line segment CD have the intersection Z, for example.
This is because the intersection point Z is required for each new coordinate sequence, such as B. When the outline data is combined, only one start point and one end point are required for one outline. Therefore, the start point and the end point of the target outline data are set to the outline coordinate data as shown in FIG. Delete the ninth end point in the table, connect it to the start point, and reconnect it in a loop-like fashion. And FIG.
As shown in FIGS. 3 (A) to 3 (D), the work of actually changing the intersection of two pieces of contour data is performed.

FIG. 13A shows a line segment DA of reference contour data (contour ABCD) and target contour data (contour E).
Since the line segment EF of FGH) intersects at the intersection α, the reconnection is shown. Here, one connection is made by connecting the base point D of the line segment of the reference contour data, the end point F of the line segment of the target contour data, and the intersection α (α1), and then D →
Let α1 → F. Then, the other connection is made E → α2 → A by connecting the base point E of the line segment of the target contour data, the end point A of the line segment of the reference contour data, and the intersection α (α2). Then, the next point number and the immediately preceding point number in the contour coordinate data table are changed in accordance with the reconnection.

That is, in the example of FIG. 13A, the “next point number” of the point D is changed to “10” indicating the point α1, and the point α1
Is changed to “3” indicating point D, “next point number” is changed to “6” indicating point F, and “point number immediately before” of point F is changed to “3”. It has been changed to “10” indicating α1.
Similarly, the “next point number” of the point E is “11” indicating the point α2.
Is changed to “5” indicating the point E, “the next point number” is changed to “4” indicating the point A, and the “point immediately before the point A” is changed to “5” indicating the point A. "11" indicates the point α2.
Has been changed to

FIG. 13B shows a case in which the line segment EF of the line segment BC target contour data of the reference contour data shown in FIG. 12A is reconnected. In FIG. Since the line segment is divided into the line segment Eα2 and the line segment α1F, the line segment α1F having the intersection is selected as the line segment of the target contour data. Then, the line segment BC, the line segment α1F, and the intersection β are reconnected. Thus, B → β1 → F and α1
→ β2 → C. Then, the “next point number” and the “point number immediately before” in the contour coordinate data table are changed in accordance with the reconnection. This result is shown in FIG.

Similarly, in FIG. 13C, reconnection of the line segment BC of the reference contour data and the line segment GH of the target contour data is performed. Line segment β2 of each reference contour data
The reconnection between C, the line segment GH of the target contour data, and the intersection γ is updated. As a result, β2 → γ1 → H and G → γ2 → C
It will be a reconnection. Accordingly, the contour coordinate data table is also changed as shown in FIG.
Finally, in FIG. 13 (D), similarly, the line segment DA of the reference contour data and the line segment GH of the target contour data are reconnected, and the line segment Dα1 of the reference contour data is respectively obtained.
And the reconnection of the line segment γ1H of the target contour data is updated, and the reconnection of D → δ1 → H and γ1 → δ2 → α1 is performed. At the same time, the contour coordinate data table is updated as shown in FIG. And FIG.
The contour coordinate data table shown in FIG.
This is shown as a table after reconnection at 0 is completed.

Then, in step S11, the registration of a contour which has disappeared due to the change of the connection in step S10, or the registration and addition of a newly generated contour are performed. For example, in the above example, step S10
Where A → B → β1 → F → G → γ2 → C → D → δ1
As a result of the new connection of → H → E → α2 → A, the target contour data E → F → G → H has been absorbed by the reference contour data. Therefore, since the target contour data has disappeared, the fact that the values of the start point number and the end point number of the target contour data have disappeared as "-1" is displayed as shown in FIG.

Further, a new contour (α
1 → β2 → γ1 → δ) has occurred. If the state of FIG. 13D remains unchanged, there is no start point and end point and a loop is formed. Therefore, a new contour is registered by defining one of the start points and adding one end point. .
The registration of the new contour is added to the last position of the contour data management information section. Then, the rotation direction, the minimum coordinate value, and the maximum coordinate value of the contour are checked and registered as shown in FIGS. From step S7 to step S1
The processes up to 1 are processes for changing the connection between the reference contour data (contour ABCD) and the target contour data (contour EFGH), and the processing for one target contour data is ended here.

In step S12, the next candidate for the target contour data is searched. As a search method, it is checked whether another contour data exists after the target contour data targeted in step S11. If it still exists, the process proceeds to step S13, where it is determined that the target contour data has not been completed, and the process proceeds to step S14. If there is no more target contour data, step S13
In, it is determined that the target contour data has been completed, and the process proceeds to step S15.

In step S14, step S1
The target contour data searched in step 2 is registered as new contour data to be checked, and the process returns to step S7 to check the intersection with the reference contour data, and if there is an intersection, perform a process of changing the connection of the contours.

In step S15, since the processing has been completed for one piece of reference contour data (contour ABCD) in the processing so far, new reference contour data is searched. As this search method, it is checked whether or not there is contour data next to the reference contour data targeted up to step S14, and if there is, it is determined in step S16 that the reference contour data still exists, and step S17 is performed. Proceed to. However, if there is no contour to be used as the reference contour data, it is determined in step S16 that the reference contour data no longer exists, and step S1 is performed.
Proceed to 8. In step S12 or step S15,
When searching for target contour data or reference contour data, if the values of the start point and end point are not "-1",
It is determined that the contour data exists. On the other hand, "-1"
When it is determined that the contour data has disappeared, the next contour data is searched.

In step S17, step S1
The reference contour data retrieved in step 5 is registered as new contour data to be checked, and the process returns to step S6, where the intersection with the target contour data is checked, and if there is an intersection, processing for changing the connection of the contours is performed. Finally, in step S18, the contour data obtained up to step S16 is output as all contour data that does not allow intersection. At this time, not all contours registered in the contour data management information section are output. For example, in the example of FIG.
→ B → β1 → F → G → γ2 → C → D → δ1 → H → E → α
The contour of 2 → A is the contour to be registered finally, but α1
The contour data of → β2 → γ1 → δ2 → α1 is data of a contour which should not be finally registered. This determination is made as follows.

First, the number of contours registered from the beginning is stored in the contour data information section. Finally, among the contour data registered in places smaller than the number, the data in which the rotation direction of the contour has not changed is determined to be the data to be registered (in the example of FIG. 14, A → B). → β1 → F
→ G → γ2 → C → D → δ1 → H → E → α2 → A contour). Then, it is determined that the contour data registered at a location larger than the number of contours registered in advance (that is, newly registered data) is data to be registered only when the rotation direction of the contour is reversed. (In the example of FIG. 14, there is no corresponding contour).

As another example, FIGS. 15A and 15B
When there is a contour data group as shown in (1), the initial number of contours is "4". That is, the first contour data has the point numbers 0 to
4. The second contour data is composed of point numbers 5 to 9, the third contour data is composed of point numbers 10 to 14, and the fourth contour data is composed of point numbers 15 to 19. When this contour data is processed by the above algorithm, finally, FIG.
The result is as shown in FIG. In this case, since the first number of contours is "4", only the first contour is registered in a smaller place and the contour is not reversed. Also, only the last contour is registered at a place where the number of contours is larger than the first and the contour is reversed. Therefore, by finally registering only these two contours, it becomes possible to generate all the contour data that does not allow intersection as shown in FIG.

In step S19, as will be described later with reference to the flowchart of FIG.
In step 8, a group of data to be converted into curve data is extracted from the set of straight line data extracted, and a process of converting the detected data group into curve data is performed.

In this manner, the intersection of the contours is searched, the connection of the contours is changed, and only the necessary data is finally extracted to generate the contour data that does not allow intersection from the contour data that allows intersection. Becomes possible.

The details of the curve data conversion process in step S19 in FIG. 4 will be described with reference to the flowchart in FIG.

In step S21, a curved region and a straight line region are extracted from data registered as a set of straight lines. According to the method of determining a straight line area, when the length of a line segment is larger than a certain threshold length, it is determined that both ends of the line segment are end points. The example of FIG. 23 is an example in which a point indicated by a square is determined to be an end point of a straight line. When the extraction of the straight line region from the point sequence of the target contour is completed, the process proceeds to step S22. In step S22, a region that can be represented by one curve expression in the curved region is determined. This is a process for extracting a bending rate in which the direction of the point sequence changes abruptly in the curved area. In this process, the direction of the adjacent point is checked, and a point at which the angle of the difference from the direction of the next adjacent point changes by more than a certain threshold angle is extracted. In the example of FIG. 23, points indicated by black circles are the end points of the curve. In this manner, a curved region and a straight line region are extracted. In the example of FIG. 23, a point A to a point B is a curved area, a point B to a point C is a curved area, a point C to a point D is a linear area, a point D to a point E is a linear area, and a point E to a point The area from F to G is determined as a curved area, the area from F to G is determined as a curved area, and the area from G to A is determined as a curved area.

In step S23, a set of linear data determined so far as a curved region is fitted to a desired curve expression to perform an approximation. The curve equation used here is 2
It is possible to approximate to various curve equations such as a secondary B-spline curve equation, a quadratic Bezier curve equation, an arc curve equation, a cubic spline curve equation, and a cubic Bezier curve equation. For example, when a set of straight lines is represented by a cubic Bezier curve as shown in FIG. 7, first, as shown in FIG. 24, a straight line passing through an end point and a point next to the end point is obtained. Calculate whether to find the control point of the curve. At this time, as shown in FIG. 7, the number of points obtained by one Bezier decomposition is 7 points, twice is 13 points,..., N times is (3 × (2 n) +1) points. . Therefore, assuming that the number of points contained in one curved region is x, the relationship of (3 × {2 raised to the (n−1) power} +1) <x <(3 × (2 n raised to 1) +1) Find the value of n that satisfies. Then, on an extension of a straight line passing through the end point and the point adjacent thereto, the control point is placed at a point of 2 n times the distance between the end point and the adjacent point.

In the example of FIG. 24, since x = 10, the value of n that satisfies the above formula is “2”. Therefore, by setting the control points at four times the distance between the end point and the adjacent point (indicated by □), it is possible to convert a set of straight lines into a control point of a curve.

In step S24, the endpoints of the straight line determined in step S22 and the control points and endpoints of the curve determined in step S23 become a new point sequence that achieves the contour. At this time, since the data of the straight line and the curve was generated,
In order to distinguish between them, it is necessary to add a discrimination flag to the data.

Now, as shown in FIG.
Since x becomes a control point of a curve, FIG.
As shown in (B), a flag "0" is written at the end point, and a flag "1" is written at the control point of the curve.

In step S25, it is checked whether or not there is still contour data to be processed. If there is still contour data to be processed, the process proceeds to step S1, and the work of converting the set of straight line data into a set of straight line and curve data again is performed. If there is no contour data to be processed, the process ends here.

In this way, it is possible to find the contour data of a curve from the set of contour data of a straight line.

[Second Embodiment] Next, a second embodiment of the present invention will be described. The case described here is a case where, on a user-definable font editor screen or graphic editing screen, a process for eliminating the intersection is performed by a user's instruction with respect to the stroke where the intersection has occurred.

FIG. 18 is a diagram showing a case where a character or a figure is edited on a screen of a computer or a workstation according to the second embodiment of the present invention.

Then, on this screen, as shown in FIG. 19, all strokes or figures on editing are collectively converted according to a user's instruction. In this case, the intersection is checked for all the data on editing, and if there is an intersection, the data is converted into a contour type that does not allow the intersection.

As shown in FIG. 20, when the user specifies an area such as an area surrounded by a dotted line, a stroke included in the area is selected as a stroke shown by a thick line in FIG. Then, these strokes are converted into contour data that does not allow intersection.

As shown in FIG. 21, the user designates two or more strokes, such as strokes indicated by thick lines, and converts the stroke data to contour data that does not allow the intersection of the strokes. Is converted.

As described above, when a user makes an intersection of strokes while editing a character or a figure, by instructing to remove the intersection, the user can automatically perform the operation without any trouble of the user. It is possible to remove the intersection of two or more contours.

Even if the present invention is applied to a system including a plurality of devices (for example, a host computer, an interface device, a reader, a printer, etc.), an apparatus including one device (for example, a copier, a facsimile) Device).

Another object of the present invention is to supply a storage medium storing program codes of software for realizing the functions of the above-described embodiments to a system or an apparatus, and to provide a computer (or CPU) of the system or the apparatus.
Or MPU) reads and executes the program code stored in the storage medium.

In this case, the program code itself read from the storage medium realizes the functions of the above-described embodiment, and the storage medium storing the program code constitutes the present invention.

As a storage medium for supplying the program code, for example, a floppy disk, hard disk, optical disk, magneto-optical disk, CD-ROM, CD
-R, a magnetic tape, a nonvolatile memory card, a ROM, or the like can be used.

When the computer executes the readout program code, not only the functions of the above-described embodiment are realized, but also an OS (Operating System) running on the computer based on the instruction of the program code. ) Performs part or all of the actual processing, and the processing realizes the functions of the above-described embodiments.

Further, after the program code read from the storage medium is written into a memory provided in a function expansion board inserted into the computer or a function expansion unit connected to the computer, based on the instructions of the program code, The case where the CPU of the function expansion board or the function expansion unit performs part or all of the actual processing, and the function of the above-described embodiment is realized by the processing.

As described above, according to the present embodiment, it is possible to provide high-speed and high-quality generation of outline coordinates of all contours that do not allow intersection from coordinate data of strokes that allow intersection. .

The stroke data that allows intersection is outline data in units of strokes, and it is possible to provide high-speed and high-quality generation of outline coordinates that do not allow intersection from the data.

The stroke data that allows the intersection is:
It is possible to provide high-speed and high-quality outline coordinates which are (core line + thickness) type data and which do not allow intersection from the data.

[0071]

As described above, according to the present invention, it is possible to generate all contour data that does not allow intersection from stroke data that allows intersection.

Further, according to the present invention, there is an effect that a high-speed and high-quality image pattern can be generated.

[0073]

[Brief description of the drawings]

FIG. 1 is a block diagram illustrating a configuration of an information processing system according to an embodiment of the present invention.

FIG. 2 is a diagram illustrating an example of a memory map according to the embodiment;

FIG. 3 is a block diagram illustrating a configuration example of another information processing system according to the present embodiment.

FIG. 4 is a flowchart showing a process of generating contour data in the information processing system according to the embodiment.

FIG. 5 is a diagram illustrating an example of stroke data of a (core + thickness) type of stroke.

FIG. 6 is a diagram illustrating an example of outline data in units of strokes.

FIG. 7 is a diagram showing a state of third-order Bezier decomposition.

FIG. 8 is a diagram showing a structure of stroke-type data before all contours.

FIG. 9 is a diagram showing intersections of line segments.

FIG. 10 is a diagram showing a state where line segments do not intersect.

FIG. 11 is a diagram showing a state where strokes do not intersect.

FIG. 12 is a diagram showing a structure of data after an intersection is obtained.

FIG. 13 is a diagram illustrating a state in which two strokes are reconnected.

FIG. 14 is a diagram illustrating a state in which reconnection of two strokes is completed.

FIG. 15 is a diagram showing a contour and a data structure of another example of the embodiment.

FIG. 16 is a diagram showing a contour processing result and a data structure of another example of the present embodiment.

FIG. 17 is a diagram illustrating an example of all contour data that does not allow intersection.

FIG. 18 is a diagram illustrating a state in which characters and graphics are edited on a computer screen.

FIG. 19 is a diagram illustrating a state in which processing is collectively instructed on a computer screen.

FIG. 20 is a diagram illustrating a state in which a process is instructed by specifying an area.

FIG. 21 is a diagram illustrating a state in which processing is instructed by a stroke instruction.

FIG. 22 is a flowchart for generating curve data from straight line data.

FIG. 23 is a diagram showing characters obtained by converting curve data into linear data.

FIG. 24 is a diagram showing how curve data is generated from straight line data.

FIG. 25 is a diagram showing how to distinguish between straight line data and curve data.

[Explanation of symbols]

 1 CPU 2 ROM 3 RAM

──────────────────────────────────────────────────の Continued on the front page (51) Int.Cl. ⁶ Identification code FIG09G 5/24 620 G06F 15/70 335Z 15/72 355P

Claims (13)

[Claims] 1. An image processing apparatus for generating contour data that does not allow intersection from contour data registered in units of strokes that allow intersection of contours, comprising: reading means for reading contour coordinates of two strokes; Linearizing means for linearizing the contour represented by :; determining means for determining whether or not the contours of the two strokes intersect based on the contour coordinates linearized by the linearizing means; Means for determining an intersection determined to intersect by the means, and changing the connection of the contour points including the intersection to generate contour data that does not intersect; and contour data not including the intersection generated by the generating means. Determination means for determining the curve portion of the above, and a curve generation means for generating a curve based on the curve portion determined by the determination means Image processing apparatus. 2. The stroke coordinate according to claim 1, wherein the outline coordinates of the stroke indicate an outline of the stroke.
An image processing apparatus according to claim 1. 3. The outline coordinates of the stroke are (core line +
The image processing apparatus according to claim 1, wherein the data is data indicating (thickness). 4. The image according to claim 1, wherein the determination unit determines whether or not the two strokes intersect based on a maximum value and a minimum value of the outline coordinates of the two strokes. Processing equipment. 5. The outline data generating means according to claim 1, wherein said outline data generating means sequentially obtains outlines passing through an intersection of said two strokes, and generates outline data by sequentially connecting outlines in the same circumferential direction. The image processing apparatus according to any one of the preceding claims. 6. The contour data generating means according to claim 5, wherein said contour data generating means generates contour data in which a contour in a peripheral direction different from said first peripheral contour is set as a second independent contour. Image processing device. 7. An image processing method for generating contour data that does not allow intersection from contour data registered in units of strokes that allow intersection of contours, comprising: a reading step of reading contour coordinates of two strokes; A linearizing step of linearizing the contour represented by: a determining step of determining whether or not the outlines of the two strokes intersect based on the linearized outline coordinates; A contour data generating step of changing the connection of the contour points including the intersection to generate non-intersecting contour data, and determining a curve portion of the contour data not including the intersection generated in the generating step. An image processing method, comprising: a determination step of performing the determination; and a curve generation step of generating a curve based on the curve portion determined in the determination step. 8. The stroke coordinate according to claim 7, wherein the outline coordinates of the stroke indicate an outline of the stroke.
The image processing method according to 1. 9. The outline coordinates of the stroke are (core line +
The image processing method according to claim 7, wherein the data is data indicating (thickness). 10. The image according to claim 7, wherein in the determining step, it is determined whether or not the two strokes intersect based on the maximum and minimum values of the outline coordinates of the two strokes. Processing method. 11. In the contour data generating step, the second
8. The image processing method according to claim 7, wherein contours passing through intersections of two strokes are sequentially obtained, and contours in the same circumferential direction are sequentially connected to generate contour data. 12. The contour data generating step of generating contour data in which a contour in a peripheral direction different from the contour in the first peripheral direction is set as a second independent contour. Image processing method. 13. A storage medium for recording a program for executing an image processing method for generating contour data that does not allow intersection from contour data registered in units of strokes that allow intersection of contours, wherein the contour coordinates of two strokes are provided. A reading step module for reading the contour, a linearizing step module for linearizing the contour represented by the contour coordinates, and determining whether or not the contours of the two strokes intersect based on the linearized contour coordinates. A discriminating step module, a contour data generating step module for determining an intersection determined to intersect in the discriminating step module, and changing the connection of the contour points including the intersection to generate non-intersecting contour data; and the generating step module. A determining step module for determining a curve portion of the contour data not including the intersection generated in A curve generation step module for generating a curve based on the curve portion determined by Joule.