JPS6017569A - Method and device for painting out of closed area - Google Patents

Abstract

PURPOSE:To allow painting out without increasing memory capacity by housing only a relative location between advancing pixels as data permitting the tracing back of a reverse sequence when painting out is deadlocked, while painting out the pixels. CONSTITUTION:A host computer 1 defines the close area within an image memory 4, and designates an arbitrary point within the close area in a painting out circuit 2. The painting out circuit 2 starts from this designated point, selects the pixels required to be painted out adjacent to the circuit 2 according to the required search direction sequence, and causes a relative location storage memory 3 to store this selected move direction to the pixels. In case of selecting the following pixels required to be painted out, and in case where all the adjacent pixels can not be selected, the pixels required to be painted out are searched while tracing the move direction data stored in the relative location storage memory 3 in a stored order.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical field to which the invention pertains] The present invention relates to CR-1' (Cathode Ray-
1ubc) The image is displayed on the display device and 1. (b) relates to a method for efficiently converting closed regions, and (b) relates to a device that can be used directly in the 7j method.

1 Explanation of the Prior Art 1 Surrounding an area with line segments and coloring the inside with a certain color 4) is widely used today, such as in the field of computer graphics. It is one of the techniques. Therefore, although many methods have already been devised, these techniques still leave unsatisfactory points in terms of efficiency.

For example, an example of a method of filling in a closed area carried out in a conventional RastaSni type CRi display device will be described below with reference to FIG.

In Figure 1, the closed region is indicated by a black circle, which is given by pixels with a value of a, and the inside of this region is represented by a black circle.
) Naru (Take what you want to fill in directly.

When a point (x, V) of (+breath) in a closed region is given, filling () is performed using the following algorithm.

111' (River (! (1lM'! resu1011 f
ill (X, V all 5.b-)egin: f read pixel (x, y) ≠ao
r rCad pixel (x, V) r-bt
hen Ite(1in write pix(!l (x , y , b ) 1'
0g1on fill(x +l , V S a , 1
1) rc+gion fill (x-1, V, a
, b) region fill (x, y-+-1,
a,b)1'e(lioll ft1l(X,
V-1, a, b) nd As shown in Fig. 2, the following algorithm is based on the following algorithm: Check whether it is stored or not.
This process is performed for all pixels in the open area (but the above algorithm is a so-called recursive one in which the leave routine is read out as a subroutine within the leave routine. Therefore, In the maximum case, the stack level can reach 1q, which is the total number of pixels in the open area, which poses a problem in terms of practical use.

1. Purpose of the present invention] The present invention solves these drawbacks (1) The purpose of the present invention is to prevent stack overflow by using a simple algorithm, An object of the present invention is to provide a method and apparatus for filling in a closed area.

U Summary of the present invention] The outline of the method for filling in an open area according to the present invention is as follows: 1. Defining a closed area to be filled in Select the starting pixels according to a predetermined search direction order, and store the moving direction to the selected pixels in the selected order. Select the next filling pixel from the pixels consisting of the T culm. In this case, if you cannot select all the adjacent pixels of pixel A, you should go back and fill in the data in the moving direction that was memorized in the previous step. Search for a file - ``1.

[In the example, explanation 1 The present invention will be explained below with reference to the drawings.

In Figure 3, one Bikku Le is in the center, and adjacent to it are 1 Lower 1. There is a diagram C showing the search order in the four directions on the right. For example, first search the direction of・The order of the directions of −2 and 33 represents the search 4 loops. FIG. 4 is a diagram showing an example of the configuration of the device according to the present invention. FIG. 7 is a diagram showing the operation of method i15 J: and v; according to the invention.

Figure 3 is a diagram for explaining the operation of the relative position storage mechanism. Figure 7 is a diagram showing the overall operation of the h-method J3 and the device according to the present invention. be.

) 1, zu, In Figure 4, C1'1 goes to Hos 1.
--- Data (゛), the operation of the entire device can be controlled by
It is something to be done. 2 is painted, 5 (circuit line 8i,
In fact, it is composed of a bartow by a microphone (J is a microphone [-1). 33 is a relative position memory system ('If' 1 and 4 are image nu[suC, c';i< r
There is one for storing the 1tiii image shown above. It should be noted that FIG. 4 [JOi'C] is drawn 2I by omitting C8, etc., which display the contents of this image memory 4. This is because even if these descriptions are 4i:, there is no problem in understanding the present invention.

Using the closed area shown in FIG. 5 as an example in the apparatus described above, the operation of filling the closed area will be explained below.

(b) The host combination coater 1 has, for example, an image memory 4
A pixel with value a indicated by a black circle inside (-defines a closed region, and also fills the filling circuit 2 with an arbitrary point within the closed region (x, y
).

The filling circuit 2 fills each pixel within the closed area Tl' as follows.

(2) Assume that the point (x, y) in the closed area designated by the host combi coater 1 is at the position @'c as shown in FIG. There, the filling circuit 2 is first shown in Figure 3.
The digits of adjacent pixels in the direction of =.0 are read out from the image frame 4 and the contents of I noise are examined. In this case, the contents of the adjacent pixel f1 (value a, , Sl is 1) (because there is no ゛, the pixel A3 TJ [,
Write Ato 1 No. 11 Kuchi 1) corresponding to the position of
.

Furthermore, J-data indicating the direction of movement is sent to a predetermined node address in the relative position storage memory 33. ! Insert. That is, in this case, since the direction is m-0, "0" is inserted.

In addition, in the example of FIG. 3, the search movement direction is 4 directions 'P', so the relative position memory 3 can store the signal to 2 pins 1 in order to memorize the 4 movement directions. There must be a monkey C. When this operation is completed, the operation moves on to examining the contents of the next four adjacent pixels.

■ When checking the contents of the next adjacent pixel after proceeding to the pixel [+, check from the direction of m = 0 as in the case of (). Therefore, the contents of C and pixel f2 are checked,
In this case, the content of pixel f2 is not 1 direct a or +tb'r, so the image memory 4's pixel [2 has a value of 1] is written, and the relative position memory 3 stores the data in ■. The data of "0"' is flashed to 7 addresses by one increment. After the king, examine the contents of the next adjacent pixel.

② By repeating this operation, as shown in FIG. 5, the pixels [I to [fia I up to 6] are filled in and painted/filled. Next, when we check the direction of m = 0 from pixel f6, the value of that pixel is a, so next we will check the direction of m = 1 as shown in Figure 3, but this direction is also now , (Write straight 11 C, came pixel C) Since it is there, it will no longer be the target of filling in (No. Therefore, the direction of the next survey target is M as shown in Figure 3.
=2 directions C'. Since this direction has not been filled in yet,
11b is written to □ and [0.

(2) The next vixel to be filled starting from pixel [8 has a value a in the direction m-0, so the vixel [9] in the 1j direction with rn = 1 becomes the object to be filled.

Thereafter, as shown in FIG. 5, the pixels 91 to g5 in the m-1 direction are filled in.

Pixel g50 The next pixel to be filled is m=Q,
1.2 directions are all (ifi a or (), so
The vixel g6 in the direction m = 3 becomes a filled pair.

■ The pixel to be filled next to pixel g6 is m
Since the direction of =0 does not yet have the value a or (3 units) C, the pixels g7 to Q9L'r are filled out. To search for an unfilled area next to pixel g9, use the following operation.

■ Biku (in G9, all directions of m-0, 1, 2, and 3 have the value a or 1). In this case, the relative position 1ff (the direction for each address stored in the storage memory [3) It operates to trace back the data (...-0, 1.2.3) in order.In other words, the relative position memory 3 is filled with each pixel [1 to f9 to QI-, g9]. The orientation data is stored in the order in which it was selected.This is shown in Figure 6 (1).Here, if we go back one address in the relative position storage memory V, we find pixel g day. All the values in the four directions are either a or 1), so we go back one step further and find that Loic 1 = Ruri, and (-
Ro5 is coming. Similarly, pixel 9□ is all C reconnaissance a in the 141j direction.
Or because it is 1) Pict! It goes back to Ruri 6. x, -1
When going back to the t'l 'jj relative position memory me(su3'-C address), the contents stored in the previous j7 address are erased in sequence. That is, here, as shown in FIG. J'(
The movement directions from ls to 06 are deleted.

(2) Returning to the position of pixel 96, the pixel h1 located in the direction rn-1 has not yet been filled in, so this pixel h is targeted for filling. In addition,
In this case, the relative position memory 3 stores the information shown in FIG. 6 (11).
As shown in the figure, the moving direction (m...1) of this pixel h is newly stored at the address where the moving direction of g6 was stored.

(2) By repeating the same operations as above, pixels h2 to h6 are filled in as shown in FIG. Then, to select the next pixel of pixel h6, all the surrounding pixels are (directly a or b), and the address of the relative position storage memory 3 shown in FIG. , return in order to the path of the arrow in FIG.

■ From then on, as mentioned above, 11L is activated by the operation in step 4.
3, b, , i, and then returns to the starting point, vicicle (x, y). In addition, the operation so far is as follows.
As shown in FIG. The filling operation ends with all of the addresses cleared. In other words, when the j' address of the relative position memory L returns to the initial position, it means that all (filling) is completed.

Figure 17 shows the operation just described, ``11-'', and the re-explanation of ``-1-'' will be omitted. It is a nos value.

The operation of the method and device according to the present invention is described in detail below. In the above explanation, J5 states that the investigation is carried out from each pixel to the next pixel in the order shown in Figure 3. However, the present invention is not limited to this (), and the present invention can be realized even if the order is changed arbitrarily.

Also, in the above, the search direction has been explained as four directions: J - Down, Nor, Right, but it is not limited to this. Take it,
The present invention is also applicable to eight directions. In this case,
The relative position storage system 3 is required to be capable of storing 3-bit signals.

1. Effects of the present invention] As described above, according to the present invention, the vehicle travels all over the place, and when it comes to a dead end, it uses data that allows it to trace the route in reverse - only the relative position between the pixels it advances C1 is stored. If you set it to 0, you can fill it to 1 without unnecessarily increasing the capacity.

Furthermore, since it is a simple algorithm, the hardware that constitutes it can be considered simple.

[Brief explanation of the drawing]

Figure 1 is a diagram explaining the operation of filling in an open area using conventional direction painting, Figure 2 is a diagram showing how to fill in an open area using the conventional method, Figure 2 is a diagram showing how to fill in an open area in four adjacent directions, and Figure 3 is a diagram showing how to fill in an open area using one pixel as the center. Adjacent 10 T: A diagram showing the search order in the four left and right directions, FIG. 4 is a diagram showing a qualification example of the device according to the present invention, and FIG. 5 is a diagram showing the operation of the device according to the present invention. , FIG. 6 is a diagram for explaining the operation of the relative position storage memory, and FIG. 7 is a diagram showing )[1-] of the entire device. 1... Hoss (-combination) - evening, 2... Filling circuit, 3... Relative position memory, 4... Image menu. 1st f7'!, Z Figure 772-2' tn= r =---m=. ↓ 111=3 茅 4 fig.

Claims (1)

[Claims] <1) In the method of filling in the inside of a closed area, C1 defines a closed area to be filled, and starting from a dying point in this closed area, pixels to be filled adjacent to this are defined in a predetermined manner. a step of selecting according to the search direction order; a step of storing the moving direction to the selected pixel in the selected order; and a step of selecting the next filled pixel from the pixel consisting of A method for filling in a closed area, comprising: when all r adjacent pixels cannot be selected, searching for pixels to be filled while sequentially going back through the data in the moving direction stored in the above step. (2) An image memory that stores a closed area to be filled in, a Hos I-combicoater that defines a closed area to be filled in this image memory, and outputs data at any point within the closed area; Start from an arbitrary point and select the adjacent filling pixels according to a predetermined search surface order - a filling circuit and a relative that stores the movement direction to the selected pixel in the selected order. and a position memory memory, and when a pixel to be filled is selected, a data is written into the address j' of the image memory at the corresponding position. At the same time, data in the direction e7j is written to the address of the relative position storage memory in the order of selection, and if all the pixels to be filled next are not selected r,
A filling device for an open AJILT, which searches for a pixel to be filled by 4 while sequentially going back through the data in a certain movement direction stored in the relative position storage memory.