JPS60128569A - Drawing smear-out system - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Application of the Invention] The present invention relates to graphic/image processing, and particularly to a graphic filling method suitable for filling the inside of a closed area according to a color code given to a boundary pixel.

[Background of the invention]

Conventionally, figure filling methods include a first method in which internal points of a closed region are specified in advance, the connection relationship between the closed region including the specified pixels and the runs of the run-length code is checked, and only the connected portions are filled. , when drawing a closed figure as a series of closed line segments, generate dots in the image memory corresponding to the coordinate values of the start and end points of each line segment, and at the same time check the direction of these dots one by one. There is a second method in which data for filling is stored in a work memory, and after drawing the closed figure, the data in the work memory is scanned and the closed figure is filled in using a parity pit method.

In the first method, it is necessary to specify the inside of the closed area, and when the area branches upward as shown in Figure 1, the direction of decreasing raster number, and as shown in Figure 2. If the area branches downward, the processing must be divided in the direction in which the raster number increases, so the area containing pixel 1 shown in Figure 3 is 4
．． First, there is the problem that processing takes time.

In addition, in the second method, in order to create the data necessary for filling, it is necessary to check the directionality of every boundary pixel forming the closed area, and the sequence of broken line segments forming the closed area is required. If the start and end points are not consecutive to each other, a sorting process is required to make them continuous, and when filling an arbitrary closed area in the image memory, it is necessary to perform a sorting process to make them continuous. The difference is that it is necessary to track the contour pixels that form the closed region, which requires a long processing time.

Note that the first and second methods are detailed in the following materials.

First method: Journal of the Institute of Electronics and Communication Engineers VOL, J63-D,
No. 10, pp. 899-906, 1980 "Coloring method for part surface images using run-length codes" Second method: JP-A-55-10656 "Method and device for filling in figures" [Object of the invention] The present invention The purpose of this invention is to provide a figure filling method that enables high-speed filling of the interior of an arbitrary closed area in figure/image processing.

[Summary of the invention]

Requirements for figure filling processing include: (a) being able to fill in arbitrary figures; (b) being able to implement it with a gait-capacity memory; and (C) being fast.

Therefore, in the present invention, focusing on the fact that the area to be filled in is a pixel other than the color code of the boundary pixel of the closed area, raster scanning is performed to detect a continuous section of pixels, and the raster to be filled and the previous one are The connection relationship between each section of the raster is checked, and if there is a connection relationship, the same fill information as the previous raster is given, and if there is no connection relationship, the two sections of the previous raster sandwiching that section from both sides. If both are on, turn off the fill information for that section, otherwise turn on the fill information for that section, and set the start point of each section one raster at a time for pixels for which fill information is on. The feature is that the section is filled in according to the color code of the pixel immediately before the pixel.

[Embodiments of the invention]

Hereinafter, one embodiment of the present invention will be described with reference to FIG. 4, taking a binary image as an example.
This will be explained with reference to FIGS. 5, 6, 7, and 8.

FIG. 4 is a block diagram of an example of the overall configuration of a filling method for realizing the present invention. In FIG. 4, reference numeral 2 denotes an image memory in which an image to be filled is stored.

3 is a raster scanning section of the image memory 2, which scans in units of one raster. , 4 is a continuous pixel section detecting unit which detects continuous sections of white images as one group in data for one raster, and stores the start and end pixel positions of the detected sections in the section information storage memory 5. In addition to this, the section information storage memory 5 stores fill information for each section. Reference numeral 6 denotes a section information storage memory for storing the same data as the section information storage memory 5 for the raster immediately before the raster.

Reference numeral 7 denotes a comparison circuit that refers to the start and end pixel positions of the sections stored in the section information storage memories 5 and 6 and examines the connection relationship between the sections between two consecutive rasters. Based on this comparison, the fill information in the section information storage memory 6 is referred to, and the fill information is set for each section in the section information storage memory 5. 8 refers to the start point and end point pixel positions for each section of the raster in the section information storage memory 5, the fill information, and the color code of the pixel located one position before the start point pixel in the image memory 2. This is a fill processing unit that fills in an area. When the above processing is completed for all sections stored in the section information storage memory 5, the contents of the one section information storage memory 5 are transferred to the section information storage memory 6. At this time, the contents stored in the section information storage memory 6 are discarded and replaced with new contents. Furthermore, the contents of the section information storage memory 6 for the first rask include information that the number of sections is 1 and that the range is not filled in from the first dot to the final dot.

FIG. 5 is an explanatory diagram of the operation of the continuous pixel section detection section 4 of FIG. 4. Reference numeral 9 represents image data for [Rask] in the image memory 2. 10 indicates a continuous section of white pixels, and 11 indicates a boundary pixel of a closed area. The raster scan circuit 3 sequentially scans the image data 9 from the left, and the continuous pixel section detecting section 4 stores the starting point and ending point positions of the section 10 in sections 13 and 14 in the section information storage memory 5, respectively. 12 is an area for storing fill information. At this point, nothing is stored in the fill information storage area 12 in the section information storage memory 5, but the fill information storage area 12 for each section of the previous raster is stored in the section information storage memory 6.
Fill information is stored in .

FIG. 6 is an explanatory diagram of the operation of the connection determination unit 7, which compares the pixel position information of the start and end points of the sections stored in the section information storage memories 5 and 6, and examines the connection relationship between each section.

For example, when checking the connection relationship between a certain section 16 in the one section information storage memory 5 and each section 15 in the section information storage memory 6, it is checked whether a condition of no connection is satisfied.

Now, the pixel positions of the start and end points of section 15 of the (j-1) raster are respectively s, -11EJ-t -J raster section 1
Let the pixel positions of the starting point and ending point of 6 be Sj+E, respectively.
The conditions are: (1) E h < 81-t (in the case of (A) in Figure 6), or (2) EJ-, < S, (in the case of (B) in Figure 6) either holds true. It is to be. When either of these conditions is satisfied, it is determined that there is no connection relationship. vice versa,
If this condition is not met, it is determined that the two sections have a connected relationship.

FIGS. 7 and 8 are explanatory diagrams of a method for determining whether to fill in the section 16 in cases where there is a connection relationship and cases where there is no connection relationship.

First, FIG. 7 shows a certain section 16 in the section information storage memory 5.
A case is shown in which there is a connection relationship between and a certain section 17 in the section information storage memory 6. In this case, the same fill information as the section 17 of the (j-1) raster for which it has already been determined whether to fill or not is stored in the fill information storage area 12 of the section in the section information storage memory 5. .

That is, if section 17 is filled in, section 16 is also filled in, and if section 17 is not filled in, section 1 is filled in.
6 also indicates that it is not filled in.

Next, FIG. 8 shows a certain section 1 in the section information storage memory 5.
6 is not connected to any section in the section information storage memory 6. In this case, the section 1 of the (j-1) raster that sandwiches the section 16 of the j raster from both sides
8 and 19 are detected, and when sections 18 and 19 are both filled, it is determined that section 16 is not filled, otherwise it is determined that section 16 is filled, and corresponds to section 16 in section information storage memory 5. The fill information is stored in the fill information storage area 12.

When processing has been completed for all sections in the section information storage memory 5 according to the above procedure, the filling unit 8 in FIG. Fill the section with the color code of the previous pixel. Thereafter, the contents of the one section information storage memory 5 are transferred to the section information storage memory 6. At this time, the old data in the section information storage memory 6 is discarded.

By performing the above processing one raster at a time in the direction in which the raster number increases, it becomes possible to fill in the closed area.

In addition, if a part of the closed area is degenerated, this degenerated part is parallel to the raster scanning direction, and there is a closed area below this degenerated part, as shown in FIG. 9, the above-mentioned In this method, the area 21 is filled in and a contradiction occurs. When considering such a closed area as a filling target, as shown in FIG. Write this label to the pixel data label storage area. As a result, the areas 21 and 22 are given the same label, and in the process of filling, the connection determination unit 7 in FIG. 4 performs a process of not filling out the section having this specific label.

In addition, in this embodiment, the section information storage memory for two sides is (j-
1) Although it is fixed for raster and j raster, it is more desirable to use them alternately, since this can reduce the number of times data is moved.

According to this embodiment, since filling is performed sequentially in raster units based on a simple determination, there is no need to track outline pixels as in the conventional method, and high-speed filling processing is possible.

In addition, since it is only necessary to use 12 rasters of memory to store the start and end pixel positions and fill information of a section where pixels are continuous, the same capacity can be used regardless of the size of one image data as long as the number of sections is the same. You can fill in the image using memory, reducing memory capacity.

〔Effect of the invention〕

As is clear from the above description, according to the present invention, it is possible to fill in arbitrary figures at high speed by simple determination. Specifically, when the graphic data of the boundary forming the closed region' is not given, that is, when filling in arbitrary closed regions within image data, the speed is more than 5 times faster than conventional contour tracking methods. It was done. Further, when filling in the area, it is sufficient that the closed area exists, and there is no need for the data forming the closed area to be continuous, and there are no restrictions. Furthermore, if the rectangular area in which the filled area exists is limited, the area to be processed is the processing target, and when the white pixel area is labeled as a preprocessing for filling, the processing target is twice that of the conventional method. By limiting the area, a speed increase of more than 10 times was achieved.

[Brief explanation of the drawing]

Figure 1 is an explanatory diagram of the case where the area branches upward in the conventional method, Figure 2 is an explanatory diagram of the case where the area branches downward in the conventional method, and Figure 3 is the case where the area is divided in the conventional method. An explanatory diagram. FIG. 4 is an overall configuration diagram showing an embodiment of the present invention, FIG. 5 is an explanatory diagram of a storage area corresponding to a continuous pixel section of the present invention, FIG. 6 is an explanatory diagram of a non-connection condition, and FIG. FIG. 8 is an explanatory diagram of the filling determination according to the present invention, and FIG. 9 is an explanatory diagram of the closed area pattern according to the present invention. 1... Pixel, 2... Image memory, 3... Rask scan section, 4... Continuous pixel section detection section, 5, 6...
Section information storage memory, 7... Connection determination section, 8... Filling processing section, 9... Image data, 12... Filling information storage area, 13... Starting point position storage area, 1
4...End point position storage area, 20...Closed area to fill, 23...UfJt Figure ""fJ, 2Figure 3 Figure 4 Figure 5 Figure Z 6th CJ4) UIJ ---11 111・○ ○----O
○ ・(A) /6S ■ 7 Figure ゝ-/6

Claims (1)

[Claims] A raster scan is performed on image data in which a closed area exists, a continuous interval of pixels other than the color code of the boundary pixels of the closed area is detected, and the start and end points of the continuous interval are detected in two consecutive rasters. Check the connection relationship of pixel positions, set fill information for each continuous section of the subsequent raster according to the connection relationship, and fill in the pixels for which the fill information is set for each raster. Characteristic shape filling method.