JP3089906B2 - Drawing equipment - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a drawing apparatus which performs a pattern filling process when converting input data into raster information.

[0002]

2. Description of the Related Art In recent years, computer graphics and digital
In the TP, a process of converting input data, for example, vector information, into raster information such as a pixel map (bitmap) and outputting it to a gradation or color display or printer is performed. In such an apparatus, a process of painting the inside of a vector graphic using a certain pattern is performed. For example, JP-A-3-1
JP-A-71379 describes the creation of a pattern used for filling.

[0003] For example, in Japanese Patent Application Laid-Open No. 63-136278, a pattern filling process is performed by holding a pattern used for filling as a pixel map pattern and transferring this pattern to a region to be filled. ing. Furthermore, in order to support a filled area of an arbitrary shape, a mask pattern for determining whether or not to draw a pattern for each bit is also held as a bitmap. A method has been developed in which pixel map data and mask pattern data are logically operated, and the result is used to paint.

However, the pattern used for filling is 1
In many cases, the type is not a type, and a very large memory is required to hold bitmap data for a pixel map and a mask corresponding to each of a plurality of fill patterns. In addition, since it is necessary to perform a logical operation on the mask bits for each pixel at the time of drawing, the time required for filling the pattern is long.

[0005]

SUMMARY OF THE INVENTION The present invention has been made in view of the above-mentioned circumstances, and has been developed in consideration of the above-described circumstances. A memory used in a drawing apparatus which performs a pattern filling process when converting input data into raster information is described. It is an object of the present invention to provide a drawing apparatus capable of performing high-speed processing while greatly reducing the number of pixels.

[0006]

According to the present invention, in a drawing apparatus, an edge list generating means for generating an edge list from input data, a pattern storage unit for storing a pattern used for filling as an edge list, A pattern merging unit configured to merge the edge list generated by the list generating unit with the edge list of the pattern stored in the pattern storage unit; and performing an output process using the edge list merged by the pattern merging unit. And an output processing means for performing a fill drawing using the pattern used for the fill. The pattern merging means may be configured to have a function of storing the merged edge list in the pattern storage unit as a pattern to be used for new filling.

[0007]

According to the present invention, the amount of memory required to store the pattern data used for filling can be reduced by storing the pattern data used for filling in the pattern storage unit as data called an edge list. Further, at the time of drawing a pattern, the edge list of the pattern data stored in the pattern storage unit and the edge list of the input pattern to be filled are merged by a pattern merging unit, and each is merged according to the merged edge list. By performing drawing processing between edges, a desired image can be obtained. At this time, since the filling process only performs the merging process of the edge list, the filling drawing by the pattern can be performed at a higher speed than the case where the logical operation is performed for each pixel. The edge list can be composed of coordinate data, run-length data, and corresponding color information. Similarly, by storing the edge list that has been merged by the pattern merging unit in the pattern storage unit, it is possible to register the pattern data used for filling.

[0008]

FIG. 1 is a block diagram of a system including an embodiment of a drawing apparatus according to the present invention. In the figure, 1 is a parameter storage unit, 2 is a drawing input unit, 3 is a vector generation unit, 4 is a font data storage unit, 5 is an edge list generation unit, 6 is a clip processing unit, 7 is a clip memory, and 8 is a coloring process. , 9 is a pattern memory, 10 is an edge list merge unit, 11 is a page memory, 12 is a rasterize unit, 13
Is a buffer memory, and 14 is an output device.

The drawing input unit 2 receives an external input and interprets a command. Input commands include primitive drawing commands such as drawing graphics and characters, clip instructions, and drawing parameter commands for setting parameters. If the received command is a drawing parameter command, a set command is sent to the parameter storage unit 1 to set a value in the parameter. FIG. 2 is an explanatory diagram of an example of a parameter. As parameters to be set, for example,
As shown in FIG. 2, the elements of the transformation matrix used for coordinate transformation, the color of the figure to be drawn, the pattern number of the fill pattern, the current coordinate value used for specifying relative coordinates, the line width of the line to be drawn, and Line end shape, connection shape at the connection point when connecting the line to be drawn, typeface when drawing characters, whether to output to the output device as the output destination of the generated edge list or register it as a pattern used for filling Information. of course,
Other parameters exist, but are omitted here.

When the command received by the drawing input unit 2 is a primitive drawing command including a clip command, the drawing command is sent to the vector generating unit 3. The primitive drawing commands include graphics drawing, character drawing, and the like. In the case of graphics drawing, vector data is sent, and in the case of character drawing, a character code is sent to the vector generation unit 3.

In the case of drawing graphics, the vector generation unit 3 performs processing by dividing vector data into a fill process and a stroke process. The fill process is a process of filling a designated area. The stroke process is a process of drawing a straight line, a curve, and the like. In the case of the fill process, only the coordinate conversion is performed using the conversion matrix set in the parameter storage unit 1, and the vector data is sent to the edge list generation unit 5. In the case of stroke processing, after performing coordinate conversion, a stroke contour vector is generated using line attributes such as line width, line end shape, and connection shape set in the parameter storage unit 1. To the edge list generation unit 5. In the case of drawing a character, the vector font data stored in the font data storage unit 4 is extracted according to the character code and the typeface set in the parameter storage unit 1, coordinate conversion is performed using a conversion matrix, and the edge list The vector data is sent to the generation unit 5.

The edge list generating section 5 performs scan conversion on vector data to generate a list of run-length data. Here, the run length is data of a list structure in which a pair of coordinates of a start point and an end point inside a drawing primitive is sorted by the coordinate value for each scan line. Hereinafter, this is called an edge list. Of course, it may be so-called run-length data having data of the starting point and the length.

The clip processing section 6 processes the vector data indicating the clip area in the same manner as in the case of drawing graphics, thereby generating a clip edge list and storing it in the clip memory 7 in advance. By comparing the clip edge list with the edge list of the drawing primitive and correcting the coordinate values of the start point and end point outside the clipping area to the coordinates of the edge of the clip area,
Perform clip processing. The edge list on which the clip processing has been performed is sent to the coloring processing unit 8.

The coloring processing section 8 includes a parameter storage section 1
Is a constant color depending on the device, a pointer to a color value address where the constant color is stored is given to each edge list. If the pattern is to be painted, the pattern number set in the parameter storage unit 1 is referred to, and the edge list of the pattern generated in advance is compared with the input edge list, thereby obtaining
Performs a filling process using a pattern. Thereafter, the edge list is sent to the edge list merging unit 10.

The edge list merging unit 10 refers to the output destination set in the parameter storage unit 1 and performs processing for page output to an output device and for registration as a pattern used for filling. In the case of page output, the positional relationship between the edge list of the entire page already stored in the page memory 11 and the edge list of the currently input primitive is compared. The edge list stored in the page memory 11 is re-created with priority given to the edge list
Until the data of one page is completed, the page memory 11
To be stored. When registering as a pattern,
The edge list of the designated pattern and the edge list of the primitive stored in the pattern memory 9 are merged by the same merge method as in the page output, and the pattern edge list of the pattern memory 9 is recreated and stored in the pattern memory 9. .

The rasterizing unit 12 includes a page memory 11
, The edge list for one page is read out for each scan line, and the result of raster development for each scan line is written to the buffer memory 13. The output device 14 reads and outputs raster data from the buffer memory 13 in synchronization with the scanning of the printer. Various output devices such as a printer and a display can be used as the output device 14. Further, it is also possible to transmit the data to another workstation via a network or the like, or to store the data in a storage device as it is. The buffer memory 13 may be used as appropriate according to the output device 14.
It is not necessary if it is not necessary.

The process of generating an edge list generated by the edge list generation unit 5 will be described. FIG. 3 is an explanatory diagram of an example of generation of an edge list. When vector data of a curve having a certain width as shown in FIG. 3A is input to the edge list generation unit 5, addresses of a start point and an end point are obtained for each scan line, here, a horizontal line. . The horizontal line in FIG. 3A is a scan line,
Black circles on the left and right of the scan line indicate the start point and the end point. The obtained coordinates of the start point and the end point are, as shown in FIG. 3B, the y coordinate of the scan line and the x point of the start point and the end point.
An edge list is created by combining information such as coordinates, increments of color addresses, and pointers to color addresses.

The operation of the clip processing performed by the clip processing section 6 will be described. 4 and 5 are flowcharts showing an example of the operation of the clip processing unit 6, and FIG. 6 is an explanatory diagram of the relationship between two sections. In the clip processing unit 6,
Based on the clip edge list stored in the clip memory 7, clip processing is performed on the edge list generated by the edge list generation unit 5. Clip processing is performed for each scan line. 4 and 5,
The clip processing for one scan line is shown. In the following description, the clip edge list cell indicates one section to be clipped. The edge list cell indicates one section to be drawn from the start point to the end point. It is assumed that these clip edge list cells and edge list cells are arranged in ascending order of coordinates. Clip processing is
According to the relationship between the sections of the clip edge list cell and the edge list cell, corresponding processing is performed. As shown in FIG. 6, the section between the two cells is classified into six cases. The image is output only in the section specified by the clip edge list cell, and the images in the other sections are deleted.

First, in S21 of FIG. 4, it is determined whether or not there is a clip edge list cell on a scan line to be processed. There may be a plurality of sections to be clipped in one scan line. If there is no clip edge list cell, there is no need to perform clip processing, so in step S22, all edge list cells of the scan line are deleted, and the processing of the scan line ends. If there is a clip edge list cell, the first clip edge list cell existing on the scan line is extracted in S23,
Make the current clip edge list cell.

Next, in S24, it is determined whether or not there is an edge list cell in the scan line. if,
If there is no edge list cell, there is no primitive to be drawn, so in step S25, the clip edge list cell is released, and the processing of the scan line ends. If there is an edge list cell, in step S26, the first edge list cell existing on the scan line is extracted and set as the current edge list cell.

Based on the current clip edge list cell and the current edge list cell set as described above, the start point of the clip edge list cell is csx, the end point is cex in S27, and the edge list cell is The start point is sx and the end point is ex. Hereinafter, clip processing is performed based on the positional relationship of the coordinates.

In step S29, the start point csx of the clip edge list cell is compared with the end point ex of the edge list cell. If the start point csx of the clip edge list cell is larger, that is, the relationship shown in FIG. Indicates that the current edge list cell does not overlap the clip edge list cell, so there is no image to output, and in S30, the current edge list cell is deleted and the next edge list cell is deleted. The current edge list cell is set, and the process proceeds to S41.

If the condition of S29 is not satisfied, the program goes to S3
1, the start point csx of the clip edge list cell
Is greater than or equal to the start point of the edge list cell, the end point cex of the clip edge list cell is greater than the end point of the edge list cell, and the start point csx of the clip edge list cell is less than or equal to the end point ex of the edge list cell. It is determined whether or not. This condition is such that, as shown in FIG. 6B, the start point of the clip edge list cell is in the section of the edge list cell, and the end point of the edge list cell is in the section of the clip edge list cell. The case of the positional relationship is determined. In this case, only the overlapping portion of the edge list cell and the clip edge list cell must be valid, and the other portions need to be deleted. In S32, the section of the edge list cell is set to the start of the clip edge list cell. The start point sx of the edge list cell is set to the start point csx of the clip edge list cell so as to extend from the point csx to the end point ex of the edge list cell, and the process proceeds to S41.

If the condition of S31 is not satisfied,
33, the start point cs of the clip edge list cell
x is equal to or less than the start point sx of the edge list cell, and
It is determined whether or not the end point cex of the clip edge list cell is equal to or larger than the end point ex of the edge list cell. This condition indicates a case where the section of the edge list cell is included in the section of the clip edge list cell as shown in FIG. In this case, since all the edge list cells are valid, in S34, the process proceeds to S41 with the next edge list cell as the current edge list cell in order to shift to the processing of the next edge list cell.

If the condition of S33 is not satisfied, S
At 35, the starting point cs of the clip edge list cell
x is greater than or equal to the start point sx of the edge list cell, and
It is determined whether the end point cex of the clip edge list cell is equal to or smaller than the end point ex of the edge list cell. This condition indicates a case where a section of a clip edge list cell is included in a section of an edge list cell as shown in FIG. In this case, at least the section of the clip edge list cell among the edge list cells is valid. In S36, first, the start point sx of the edge list cell is set to the start point csx of the clip edge list cell, and the end point ex of the edge list cell is set so that the section of the clip edge list cell is valid among the sections of the edge list cell. Is set as the end point cex of the edge list cell. In addition, it is necessary to determine the relationship between the edge list cell having a larger coordinate than the clip edge list cell and another clip edge list cell. Therefore, an edge list cell of the remaining portion is created and inserted as the next edge list cell, and is made the current edge list cell. The start point of the created edge list cell is the next point after the end point of the clip edge list cell, and the end point is the end point of the original edge list cell. Then, the process proceeds to S41 with the next clip edge list cell as the current clip edge list cell. By the subsequent processing, the newly created edge list cell is compared with the next clip edge list cell.

If the condition of S35 is not satisfied, the program proceeds to S3
7, the start point csx of the clip edge list cell
Is less than or equal to the start point sx of the edge list cell, the end point cex of the clip edge list cell is less than or equal to the end point ex of the edge list cell, and the end point cex of the clip edge list cell is greater than or equal to the end point ex of the edge list cell. It is determined whether there is. This condition is such that the end point of the clip edge list cell is in the section of the edge list cell and the start point of the edge list cell is in the section of the clip edge list cell as shown in FIG. The case of the positional relationship is determined. In this case, a section from the start point of the edge list cell to the end point of the clip edge list cell is valid. For other sections, it is necessary to determine the next and subsequent clip edge list cells. Therefore, in S38, first, the end point ex of the edge list cell is set to the end point ce of the clip edge list cell.
x, and the end point e of the original edge list cell from the next point after the end point cex of the clip edge list cell.
Create a new edge list cell with a section up to x and insert it next to the current edge list cell,
Make this the current edge list cell. Then, the next clip edge list cell is set as the current clip edge list cell, and the process proceeds to S41. By the subsequent processing, the newly created edge list cell is compared with the next clip edge list cell.

If the condition of S37 is not satisfied, the program proceeds to S3
At 9, it is determined whether the end point cex of the clip edge list cell is less than or equal to the start point sx of the edge list cell. Under this condition, as shown in FIG. 6F, no edge list cell is included in the section of the current clip edge list cell. However, since there is a possibility that there is a section overlapping with another clip edge list cell, S40
In, processing is continued with the next clip edge list cell as the current clip edge list cell.

After performing the processing of each of the above-described conditions, S41
, The current clip edge list cell is null
1, that is, whether or not the clip edge list of the scan line has been completed. If the clip edge list has been completed, the remaining edge list is not output and thus all are deleted, and the processing of the scan line is terminated. If the current clip edge list cell exists, in S42,
It is determined whether or not the current edge list cell is null, that is, whether or not the edge list cell of the scan line has been completed. If the edge list cell has been completed, the processing of the scan line is terminated. If the current clip edge list cell and the current edge list cell exist, the process returns to S27,
The determination process is repeated.

In this manner, the clip processing for one scan line is performed. Such processing for one scan line is repeated, and clip processing for each primitive is performed. The edge list on which the clip processing has been performed is sent to the coloring processing unit 8.

Next, the painting process performed in the coloring unit 8 will be described. As described above, the pattern filling is performed by comparing the pattern edge list generated in advance and stored in the pattern memory 9 with the edge list sent from the clip processing unit 6.
By performing the merging, a filling process using a pattern is performed.

First, the pattern edge list will be described. FIG. 7 is an explanatory diagram of an example of the pattern edge list. The pattern edge list is an edge list of a pattern used for filling, and the configuration of the edge list itself is almost the same as that shown in FIG. That is, the cells of one edge list are the scan line y
It has information such as coordinates, x-coordinate of a start point, x-coordinate of an end point, increment of a color address, a pointer to a color address, and the like. In addition, the pattern edge list has the size of one pattern and the offset coordinates of the origin when the pattern is arranged. For example, in the example shown in FIG. 7A, the size of one pattern is 10 × 8, in which the bottom 8 and the height 6
There is a triangle. A pattern edge list of such a pattern is as shown in FIG. Here, the value of the offset is (0, 0).

Next, the pattern merging process will be described. 8 to 10 are flowcharts showing an example of a pattern edge list merging process, and FIG. 11 is an explanatory diagram of a relationship between an edge list cell and a pattern edge list cell. Based on the pattern edge list stored in the pattern memory 9, the inside of the primitive is painted out with a pattern. Primitives are given in the form of an edge list as described above. The pattern is also given in the form of a pattern edge list. In the following processing, the pattern is expanded to the maximum width of the scan line, and then merged by comparison with the edge list. Here, the edge list cell indicates one section to be drawn from the start point to the end point, and the start point is sx and the end point is ex. Also,
The pattern edge list cell indicates a section from the start point to the end point of the pattern, where the start point is psx and the end point is pex. It is assumed that these edge list cells and pattern edge list cells are arranged in ascending order of coordinates. The size of the pattern is
The x direction is offsetx, and the y direction is offset.

First, in S51 of FIG. 8, it is determined whether or not the scan line sl of the edge list has exceeded the size of the primitive, that is, whether or not the area to be painted has been completed. I do. If the scan line sl is a line to be painted, S52
At the scan line pl in the pattern edge list
Ask for. Scan line pl of pattern edge list
Sets scan line sl of the edge list to pattern y
The remainder is obtained by dividing by the direction magnitude offsety. In S53, it is determined whether or not a pattern edge list cell exists on the scan line pl of the pattern edge list. If the pattern edge list cell does not exist, it is not necessary to perform the pattern filling process. In S54, the scan line sl in the edge list is incremented, and the process returns to S51. If the pattern edge list cell exists, in S55, the pattern edge list cell existing on the scan line pl of the pattern edge list is repeatedly developed so as to fill the scan line. That is, so that the pattern is repeatedly arranged over the entire scan line,
For the start point psx and end point pex of the pattern edge list,
A pattern edge list of the entire scan line is created by connecting the offsetsx of the pattern in the x direction repeatedly and repeatedly. Then, the first pattern edge list cell is taken out and set as the current pattern edge list cell.

In S56, it is determined whether or not there is an edge list cell in the scan line sl of the edge list. If not, there is no area to be filled, so in step S57, the scan line s in the edge list
Increment l and return to S51. If an edge list cell exists, in S58, the first edge list cell is set as the current edge list cell, and the following comparison processing is performed.

Steps S59 to S79 are processing for comparing the current edge list cell with the current pattern edge list cell. In S59, the start point and the end point of the current pattern edge list cell are set to psx and pex, respectively. In S60, the start point and end point of the current edge list cell are set to sx and ex, respectively. Based on these values, the processing is performed by dividing the sections into the relations as shown in FIG.

In S61, when the start point psx of the pattern edge list cell is larger than the end point ex of the edge list cell, that is, in the case of FIG. 11A, it is determined that no pattern exists in the edge list cell. Therefore, the pattern is not merged into the edge list cell, and in S62, the process proceeds to S77 with the next edge list cell as the current edge list cell.

In S63, the start point psx of the pattern edge list cell is equal to or larger than the start point sx of the edge list cell, the end point pex of the pattern edge list cell is larger than the end point ex of the edge list cell, and It is determined whether the cell start point psx is equal to or less than the end point ex of the edge list cell. This condition corresponds to the case shown in FIG. 11B, and is a case where a partial section including the start point of the pattern edge list cell is included in the edge list cell. In this case, a portion where the section of the edge list cell and the section of the pattern edge list cell overlap is an area to be filled with the pattern. In S64, first, the end point of the edge list cell is set to a point before the start point psx of the pattern edge list cell, that is, a section smaller than the start point of the pattern edge list cell is determined as psx-1. Then, the start point sx of the new edge list cell is set as the start point psx of the pattern edge list cell,
An edge list is created in which the end point ex is set as the end point ex of the original edge list cell and other attributes such as color are the same as those of the pattern edge list cell, and inserted next to the current edge list. By this processing, the end point ex of the edge list cell
Since the processing up to this point is completed, the next edge list cell after the inserted new edge list cell is set as the current edge list cell, and the process proceeds to S77. At this time, the remaining part of the pattern edge list cell is compared with the next edge list cell, so that the current pattern edge list cell remains unchanged.

In S65, the start point psx of the pattern edge list cell is equal to or larger than the start point sx of the edge list cell, the end point pex of the pattern edge list cell is equal to the end point ex of the edge list cell, and It is determined whether the cell start point psx is equal to or less than the end point ex of the edge list cell. This condition is shown in FIG.
This corresponds to the case shown in FIG. 1 (C), in which the section of the pattern edge list cell is included in the edge list cell, and both end points match. Also in this case, a portion where the section of the edge list cell and the section of the pattern edge list cell overlap is an area to be filled with the pattern. In S66, first, the end point of the edge list cell is set to a point before the start point psx of the pattern edge list cell, that is, ps
A section smaller than the start point of the pattern edge list cell is determined as x-1. Then, the start point sx of the new edge list cell is set to the start point ps of the pattern edge list cell.
x, and the end point ex of the original edge list cell
Then, an edge list is created in which other attributes such as color are the same as those of the pattern edge list cell, and inserted next to the current edge list. By this processing, the processing up to the end point ex of the edge list cell ends, so that the next edge list cell after the inserted new edge list cell is set as the current edge list cell. Further, since the pattern edge list cell has also reached the end point pex, the next pattern edge list cell is set as the current pattern edge list cell, and S7
Proceed to 7.

In S67, it is determined whether or not the start point psx of the pattern edge list cell is equal to or larger than the start point sx of the edge list cell, and whether the end point pex of the pattern edge list cell is smaller than the end point ex of the edge list cell. . This condition corresponds to the case shown in FIG. 11D, where the pattern edge list cell is included in the edge list cell. In this case, the section of the pattern edge list cell is an area to be filled with the pattern. S
At 68, first, the end point of the edge list cell is set to a point before the start point psx of the pattern edge list cell, that is, a section smaller than the start point of the pattern edge list cell is determined as psx-1. Then, in order to set the section of the pattern edge list cell as a new edge list cell, the start point sx is set to the start point p of the pattern edge list cell.
sx, the end point ex as the end point pex of the pattern edge list cell, and an edge list in which other attributes such as color are the same as those of the pattern edge list cell are created and inserted next to the current edge list. By this processing, the processing up to the end point pex of the pattern edge list cell among the edge list cells is completed, but the remaining section is unprocessed, so the new edge list of the remaining section, that is, the start point sx is set to the pattern The next point pe after the end point of the edge list cell
x + 1, an edge list cell having the end point ex as the end point ex of the current edge list cell is created, inserted next to the previously inserted edge list cell, and this edge list cell is set as the current edge list cell. Is performed. In the new edge list of the remaining section, attributes such as colors are the same as those of the original edge list. On the other hand, the next pattern edge list cell is set as the current pattern edge list cell, and the process proceeds to the next pattern edge list cell. Then, the process proceeds to S77.

At S69, it is determined whether or not the start point psx of the pattern edge list cell is equal to or less than the start point sx of the edge list cell, and whether the end point pex of the pattern edge list cell is larger than the end point ex of the edge list cell. . This condition corresponds to the case shown in FIG. 11E, in which the section of the pattern edge list cell includes an edge list cell. In this case, the pattern is developed in all the sections of the edge list cell. In S70, the start point sx and the end point ex of the edge list cell are left as they are, and other attributes such as color are the same as those of the pattern edge list cell. This means that the section of the edge list cell has been painted. Then, the next edge list cell is set as the current edge list cell, and S77
Proceed to. At this time, the pattern edge list cell remains as it is.

In S71, it is determined whether or not the start point psx of the pattern edge list cell is equal to or less than the start point sx of the edge list cell, and whether the end point pex of the pattern edge list cell is equal to the end point ex of the edge list cell. .
This condition corresponds to the case shown in FIG. 11F, in which the section of the pattern edge list cell includes the edge list cell and the end points are equal. Also in this case, the pattern is developed in all the sections of the edge list cell. In S72, the start point sx of the edge list cell,
The end point ex is left as it is, and other attributes such as color are the same as those of the pattern edge list cell. This means that the section of the edge list cell has been painted. Then, the next edge list cell is set as the current edge list cell, and the next pattern edge list cell is set as the current pattern edge list cell, and the processing shifts to the processing of the next edge list cell and the pattern edge list cell.
Then, the process proceeds to S77.

In S73, the start point psx of the pattern edge list cell is less than or equal to the start point sx of the edge list cell, the end point pex of the pattern edge list cell is smaller than the end point ex of the edge list cell, and It is determined whether or not the cell end point pex is equal to or greater than the start point sx of the edge list cell. This condition corresponds to the case shown in FIG. 11 (G), and the area from the start point of the edge list cell to the end point of the pattern edge list cell is a region to be filled with the pattern. In S74, first, a new edge list cell having a region to be filled, that is, a start point sx of an edge list cell as a start point and an end point pex of a pattern edge list cell as an end point is created. Other attributes such as the color of the created edge list cell are attributes of the pattern edge list cell. Insert the created edge list cell before the current edge list cell. Then, the start point of the current edge list cell is set to a point next to the end point pex of the pattern edge list cell, that is, pex + 1, and the remaining sections are determined. Further, the next pattern edge list cell is set as the current pattern edge list cell, and the process proceeds to S77.

In step S75, if the end point pex of the pattern edge list cell is smaller than the start point sx of the edge list cell, that is, if there is no overlapping portion as shown in FIG. Since it means that the current edge list cell is not painted depending on the list cell, in S76, the process proceeds to S77 with the next pattern edge list cell as the current pattern edge list cell.

When the processing for each section described above is completed, S77
, The current pattern edge list cell is null
1, that is, whether or not a pattern edge list cell exists in the scan line pl of the pattern edge list. If there is no scan line, the process of the scan line is terminated, so in step S78, the scan line sl in the edge list is incremented, and the process returns to step S51 to perform the process for the next scan line. If the pattern edge list cell exists, in S79, the current edge list cell is null, that is,
It is determined whether an edge list cell exists in the scan line sl of the edge list. If not,
Since there is no section to be filled in the scan line, in S80, the scan line sl in the edge list is incremented, the process returns to S51, and the process for the next scan line is performed. If there is a pattern edge list cell and an edge list cell, the process returns to S59, and the processing corresponding to the section of each cell is repeated.

In this way, based on the pattern edge list, by merging with the edge list, the inside of the primitive can be painted out with the pattern. When the processing for each primitive is completed, the edge list merge unit 10 merges the edge list created for each primitive into the edge list for each page.
The edge list for each page is stored in the page memory 11, and when the merging of the primitives for one page is completed, the rasterizing unit 12 reads the edge list for each scan line and develops the dots into dots. It is sent to the output device 14.

FIG. 12 is an explanatory diagram of an example of the output result. In the figure, since the color cannot be represented, the hatching is changed to express the color difference. In the example shown in FIG. 12, after the inside of the circle is filled with a certain color (represented by hatching in the downward right direction in the figure), the output image obtained by filling the inside with the pattern shown in FIG. Is shown. As shown in FIG. 12, an image in which the triangle shown in FIG. 7A repeatedly appears inside the circle is obtained.

[0047]

As is apparent from the above description, according to the present invention, in a drawing apparatus for converting input data into raster information, when performing a filling process using a pattern, the input data and the pattern are stored in an edge list. By storing as data and performing fill processing by merging between edge lists, the memory for the pattern can be significantly reduced, and there is no need to perform logical operations for each pixel during drawing, so high-speed fill processing There is an effect that it becomes possible.

[Brief description of the drawings]

FIG. 1 is a block diagram of a system including an embodiment of a drawing apparatus according to the present invention.

FIG. 2 is an explanatory diagram of an example of a parameter.

FIG. 3 is an explanatory diagram of an example of generation of an edge list.

FIG. 4 is a flowchart illustrating an example of the operation of the clip processing unit 6.

FIG. 5 is a flowchart illustrating an example of the operation of the clip processing unit 6.

FIG. 6 is an explanatory diagram of a relationship between two sections.

FIG. 7 is an explanatory diagram of an example of a pattern edge list.

FIG. 8 is a flowchart illustrating an example of a merge process of a pattern edge list.

FIG. 9 is a flowchart illustrating an example of a merge process of a pattern edge list.

FIG. 10 is a flowchart illustrating an example of a merge process of a pattern edge list.

FIG. 11 is an explanatory diagram of a relationship between an edge list cell and a pattern edge list cell.

FIG. 12 is an explanatory diagram of an example of an output result.

[Explanation of symbols]

1 parameter storage unit, 2 drawing input unit, 3 vector generation unit, 4 font data storage unit, 5 edge list generation unit, 6 clip processing unit, 7 clip memory, 8
Coloring processing unit, 9 pattern memories, 10 edge list merging units, 11 page memories, 12 rasterizing units, 13 buffer memories, 14 output devices.

Claims (2)

(57) [Claims] 1. An edge list generation means for generating an edge list from input data, a pattern storage unit for storing a pattern used for filling as an edge list, an edge list generated by the edge list generation means, and the pattern A pattern merging unit configured to merge the edge list of the pattern stored in the storage unit; and an output processing unit configured to perform an output process using the edge list merged by the pattern merging unit. A drawing apparatus for performing fill drawing using a pattern. 2. The pattern merge unit according to claim 1, wherein the pattern merging means has a function of storing the merged edge list as a pattern used for a new filling in the pattern storage unit. Drawing device.