JPS6361383A - Painting-out graphic drawing method - Google Patents

Abstract

PURPOSE:To easily obtain painting-out data by storing boundary information to show that a painting-out boundary point is obtained, into the memory area of a frame buffer corresponding to a painting-out boundary point. CONSTITUTION:In the memory area 3a of a frame buffer 3 corresponding to the point of a painting-out boundary line BL, boundary information showing that a painting-out boundary point is obtained is stored. A data converting part 4 synchronizes and scans the respective memory areas 3a of the frame buffer 3 with the raster scan of a beam in a CRT 2, outputs the color stored in the memory area corresponding to an odd number-th painting-out boundary point concerning one horizontal line to the CRT 2 during the period from the odd number-th boundary point to the next boundary point and executes the painting-out with the color during the period.

Description

DETAILED DESCRIPTION OF THE INVENTION <Industrial Application Field> The present invention relates to a fill-in graphic drawing method, and in particular to a fill-in figure drawing method in a display device that stores an image in a frame buffer, reads the image from the frame buffer, and displays it on a display screen. It relates to a figure drawing method.

<Prior Art> In a graphic display device, it is required to fill an area surrounded by a predetermined outline with a predetermined color.

In drawing such a filled-in figure, if the outline shape is a rectangle or a circle, it can be filled in relatively easily. However, if the contour line has an arbitrary shape, it is quite difficult to fill it without leaving any unfilled areas.

For this reason, a filling method that does not leave any unfilled areas has been proposed. FIG. 3 is an explanatory diagram of a conventional fill-in figure drawing method. In this method, (a1 contour line 11 (see FIG. 3 (see Al)) is drawn on the display screen in a specific color (boundary color).

(blThen, there is one point P inside the contour line 11,
(See Figure 3 (B)).

(c) After coloring, the color information of each pixel is sequentially checked in the horizontal direction from point P (see the solid line arrow in FIG. 3(B)), and the color information is filled in until the specified boundary color is detected. Note that filling is performed by storing color information indicating a filling color (for example, a boundary color) in a storage area of an image memory corresponding to each picture element until a boundary color is detected.

(dl) Then, if the boundary color is detected, in other words, if the boundary is reached, it will be shifted by one pixel vertically upward (the third
(See figure (C)). .

(81) Then, repeat the process from C1 until the boundary color is detected in the horizontally opposite direction.

(fl step (Once the filling in the vertical upward direction is completed by repeating the processing from cl to tel, step from point P in the direction of the dotted line arrow in Figure 3 (C) (repeating the processing from C1 onwards to fill in the Perform drawing.

<The problem that the invention is trying to solve> However,
In such a conventional method, the process of calculating fill-in data is complicated, and since the fill-in takes only the border color into consideration, the line 12 (see FIG. 3 (D)) of the same color as the border color is the outline. If the line 11 intersects with the line 11, the line 12 is determined to be a boundary and an unpainted area is left.

It is therefore an object of the present invention to provide a method for drawing a filled-in figure that can simplify the calculation of filled-in data and that does not leave any unfilled areas.

Means for Solving the Problems> FIG. 1 is a block diagram of a graphic display device that implements the present invention.

1 is a display processor, 2 is a CRT, 3 is a frame buffer having one storage area 3a corresponding to one picture element, and 4 is data for converting the color information of the read data according to the boundary information. The conversion unit 5 is a lookup table. Each storage area 3a has a total of 4 bits: 3 bits (0th to 2nd bits) for storing color information and 1 bit (3rd pit) for storing boundary information indicating whether the corresponding picture element is a filled boundary point. It is configured.

Further, in the CRT2, BL is a filled boundary line, and AR is a filled figure.

Effect> Boundary information indicating that the point is a fill-in boundary point is stored in the storage area 3a of the frame buffer 3 corresponding to the point on the fill-in boundary line BL.

The data converter 4 converts each storage area of the frame buffer 3 into a CR.
Scanning is performed in synchronization with the raster scan of the beam at T2, and the color stored in the storage area corresponding to the odd-numbered filling boundary point for one horizontal line is transferred to the CRT2 from the odd-numbered boundary point to the next boundary point. , and fill in the space between them with the corresponding color.

Embodiment FIG. 1 is a block diagram of a graphic display device implementing the present invention.

1 is a display processor, 2 is a CRT, 3 is a frame buffer having one storage area 3a corresponding to one picture element, 4 is a data conversion unit for conversion, and 5 is a lookup table.

Each storage area 3a of the frame buffer 3 is used for storing color information.
It consists of a total of 4 bits: bits (0th to 2nd bits) and 1 pit (3rd bit) that stores boundary information indicating whether the corresponding picture element is a filled boundary point. Note that the 4-bit data stored in each storage area will be referred to as pixel data hereinafter.

The data converter 4 converts each storage area of the frame buffer 3 into a CR.
The beam is scanned horizontally in synchronization with the Lascous scan of the beam at T2, and the color stored in the storage area corresponding to the odd-numbered filling boundary point for one horizontal line is transferred from the odd-numbered boundary point to the next boundary point. C as a color between
Output to RT2 and fill in the space with the corresponding color.

Note that the data conversion unit 4 (except for the area between the odd-numbered boundary point and the next boundary point) draws the remaining portions in the color specified by the color information stored in the corresponding storage area of the frame buffer 4.

FIG. 2 is a flowchart of the processing of the data converter 4.

Hereinafter, the filling process of the present invention will be explained according to FIGS. 1 and 2.

(1) First, let 1→i, l−*j. However, j indicates a scan line number, and l indicates the position of a picture element (storage area) in the horizontal direction.

(2) Next, 0→F, O→N. However, F is a flag indicating whether the current scan position exists between an odd-numbered filled boundary point and the next boundary point, and N is 1
This is the number of filled boundary points on the scan line up to the current scan position.

(3) Next, the jth scan line (horizontal scan line)
The pixel data is read from the storage area corresponding to the first picture element.

(4) Contents of the third bit of pixel data (boundary information)
is checked to determine whether the pixel is a filled boundary point. Note that if the boundary information is "1" (see the mouth in the frame buffer 3 in FIG. 1), it is a boundary point,
If it is "0", it is not a boundary.

(5) If it is not a boundary point, check whether F=1. That is, it is checked whether the current pixel exists between the odd filled boundary point and the next boundary point. Tat! If F=1, it exists between the boundary points, and F=
If it is O, it does not exist.

(6) If it does not exist (if F = 0), look up the red, blue, and green color component data indicated by the color information that is the lower 3 bits (0th to 2nd bits) of the pixel data. 5, each color component data is input to the CRT 2, and the corresponding pixel portion is drawn in a predetermined color.

(7) Next, check whether the conversion process for one scan line has been completed.

(8) If not completed, increment 1 by one step by i + 1→l, and repeat the process from step (3) onwards.

(9) On the other hand, in the check in step (7), if the conversion process for one scan line has been completed, check whether the conversion process for all scan lines has been completed;
If the conversion processing for all scan lines has been completed, the processing from step (1) onward is repeated.

(I[01, Kaji, if all scan lines have not been processed, 1→i, j+1→J, and then step (2)
Repeat the following process.

(111) On the other hand, if the boundary information is "1" in the judgment in step (4) (if the current pixel is a filled-in boundary point), the number of boundary points is counted up by N+1-N.

(After counting up 13N, check whether N is odd or even.

(+3) If N is an odd number, set it as 1-F.

(14) Next, the color information C of the lower three bits of the pixel data is stored.

(After 151L, the red, blue, and green color component data indicated by the color information C are read from the lookup table 5, each color component data is input to the CRT 2, and the corresponding pixel portion is drawn in a predetermined color. Thereafter, step (7) ) and repeat the process.

Incidentally, if F=1 in step (5), the process of the fourth step is performed. As a result, the area between the odd-numbered boundary point and the next boundary point is drawn in the stored color (the color of the odd-numbered boundary point).

(I[9 On the other hand, if N is an even number in step (IE), 0→F.

(1?1) Next, the red, blue, and green color component data indicated by the color information, which is the lower three bits of the current pixel data, are read from the lookup table 5, and each color component data is transferred to the CRT.
2 and draw the corresponding pixel part in a predetermined color. Thereafter, the processing from step (7) onwards is repeated.

<Effects of the Invention> According to the present invention, boundary information indicating that the frame buffer is a filled boundary point is stored in a storage area of a frame buffer corresponding to a filled boundary point, and each storage area of the frame buffer is scan in synchronization with the raster scan of 1 horizontal line, and from the odd-numbered border point to the next border point with the color indicated by the color information stored in the storage area corresponding to the odd-numbered filled border point. Since it is configured to be filled in, the filled data can be easily obtained, and there will be no unfilled areas.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a graphic display device that implements the present invention, FIG. 2 is a flowchart of the process of the present invention, and FIG. 3 is an explanatory diagram of a conventional method. 1. Display processor, 2. CRT. 3. Frame buffer, 4. Data conversion section, 5. Lookup table patent applicant Fanuc Corporation agent Patent attorney wi Fuji Chiki Figure 3

Claims (1)

[Scope of Claims] A filling figure drawing method in a display device that stores an image in a frame buffer having one storage area corresponding to one picture element, reads the image from the frame buffer and displays it on a display screen, comprising: Boundary information indicating that the boundary point is a filled boundary point is stored in the storage area of the frame buffer corresponding to the boundary point, and each storage area of the frame buffer is scanned in synchronization with the raster scan of the beam, and for one horizontal line. A filling figure drawing method characterized in that the area from the odd-numbered boundary point to the next boundary point is filled with a color specified by color information stored in a storage area corresponding to the odd-numbered boundary point.