JPS63118989A - graphic display device - 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 the Invention The present invention relates to a graphic display device that fills in closed areas written in an image memory.

2. Description of the Related Art Conventional graphic display devices include, for example, Japanese Patent Application Laid-open No. 60-24
No. 5085 and Japanese Unexamined Patent Publication No. 132271/1983.

FIG. 6 or FIG. 8 shows a configuration diagram of a conventional graphic display device.

Referring to FIG. 6 as a first conventional example, 101 is an image memory, 1o2 is a boundary tracking means for tracking the boundary of a closed area on the image memory, and 103 is all closed area boundary coordinate data detected by the boundary tracking means. 104 is a filled area determining means for determining a filled area from the boundary data; 106 is an image memo 1J1;
This is a filling means for filling out 01.

In the conventional graphic display device configured as described above, when filling out the concave polygon BODE as shown in FIG. The obtained boundary data is stored in the boundary data storage memo IJ103.

Next, the lowest point (point 2C with the smallest Y coordinate value) is selected from the vertex data on the boundary data storage memo 17103 by the filled area determining means 104.

For both line segments CB and CD on the left side of the lowest point, the filled area determination means 104 determines the filled area up to the next lowest point E, and the filled area is filled in by the filling means 106 (FIG. 7). a). .

When the filling is completed to the lowest point K next to C, CB, C
Fill in the space between both lines D and both lines ED and ICCD in the same manner as above until the lowest point next to E (Figure 7b).
. Next, the line segments for both persons E and B are filled in in the same manner as described above (FIG. 7C), and the filling is completed when the highest point M is reached.

Next, FIG. 8, which is a second conventional example, will be explained. Figure 8 2
01 corresponds to 101, 202 to 102, 204 to 104, and 205 to 105 in FIG. 6, respectively. 206 is a vertex data storage memory that stores the vertex data obtained by the boundary tracking means 202.

In the conventional graphic display device configured as described above, processing is performed in the order shown in FIG. 9, for example. First, from the vertex data on the vertex data storage memory 206, the filled area determining means 2
04, the desired filled area F on the image memory 201
Define GHI (Figure 9 1!L). Next, while tracking the boundary B by the boundary tracking means 202, the filled area FG is
The area up to the right end position IH of I (I) is filled by the filling means 206. In the filling, the exclusive OR of the existing dot data and the filling pattern data is calculated (FIG. 9b). Next, the boundary is Perform the same filling process as above for the CD (Figure 9C).DR, IC
If we perform the same filling process for people (Fig. 9d)
, e), the final result in Fig. 9f is obtained. Note that the same result can be obtained no matter which boundary you start filling.

Problems to be Solved by the Invention However, the configuration shown in FIG. 6 requires a boundary data storage memory 103 to store all the boundary coordinate data of the closed area, resulting in an enormous amount of hardware. It had

In addition, in the configuration shown in FIG. 8, the amount of hardware is smaller than in FIG. 6, but the area outside the closed area from the boundary BODE of the closed area to the right end IH of the desired filling area FGHI is also filled. Therefore, an overflow occurs,
Furthermore, since the filling means 205 performs filling by calculating the exclusive OR of the existing dot data and the filling pattern data, if some information has already been written within the filling range of the image memory, that part The problem is that the expected results cannot be obtained due to the influence of previously written information.

In view of this, the present invention is capable of filling only within a specified closed area with a minimum amount of hardware that does not require memory to store all boundary data, and with operations other than exclusive OR. The object of the present invention is to provide a graphic display device that enables the following.

Means for Solving the Problems The present invention provides a boundary tracing means for tracing the boundary of a closed area on an image memory, a certain point detected by the boundary tracing means, a point before the point on the boundary, and a point detected by the boundary tracing means. a filling determination means for determining whether or not a point on the boundary is a filling start point based on the positional relationship of three adjacent points of the next point; and a point corresponding to the point determined to be a filling start point by the filling determining means. This graphic display device includes a filling end point detection means for detecting a filling end point, and a filling means for drawing filling data between the filling start point and the filling end point.

Effect of the Invention The present invention has the above-described configuration, and has a filling determination means for determining whether or not to perform filling only based on the positional relationship between three adjacent points on the boundary, and a filling end point detecting means, so that all boundary data can be processed. Memo IJ't to store
- It is possible to perform filling only within a specified closed area and with operations other than exclusive OR with the minimum amount of hardware that is not required.

Embodiment FIG. 1 shows a configuration diagram of a graphic display device in an embodiment of the present invention. In Figure 1, 1 is 10 in Figure 6.
1, 2 corresponds to 102, and 5 corresponds to 106, respectively. 7 determines whether or not a point on the boundary becomes the filling start point based on the positional relationship between a certain point on the boundary of the closed area and three adjacent points: the point before and the next point on the boundary. Reference numeral 8 denotes a filling end point detecting means for detecting all filling end points corresponding to the point determined as a filling start point by the filling determining means 7.

The operation of the graphic display device of this embodiment configured as described above will be described below. FIG. 5 is a diagram showing the flow of filling processing. In Figure 5, S is the starting point, G
indicates the point at which it is to be determined whether it is the filling start point, F indicates the point before G, H indicates the next point after G, and G' indicates the filling end point corresponding to G. GF is the positional relationship of F with respect to G, and GH is the positional relationship of H with respect to G expressed by numbers 6o to 7.

The numbers 0 to 7 indicate the positional relationships corresponding to 0 to 7 in FIG. 4, and 0 to 7 in FIG. 4 correspond to the coordinate positions in FIG. 3, respectively. First, a point on the boundary of a closed area of the image memory 1 is defined as a starting point S. The coordinate values of S are set as the coordinate values of F, and the next point is searched for by the boundary tracing means 2 on the leftward inner side of the boundary and is designated as G. Find the next point H of G in the same way as above.

The positional relationship of the three points found in this way is 1≦GH≦(GF-1) ・・・・・・(1
), the filling determination means 7 determines that G is the filling start point, and the filling end point detecting means 8 detects the filling end point G"z corresponding to G, and then G-G The positional relationship between OF+G and H, where the filling in between ' is done by the filling means 6, is as described above (1
) does nothing unless the inequality is satisfied. Next, the current G
, H are substituted into each of F and G, and the next point H after G is determined in the same manner as described above until F and S are matched, and the determination is repeated. If, for example, the concave polygon BCDIC in Fig. 2 is filled in using the method described above, the person will be drawn from the starting point BCDIC.
The spaces between Be and Be are filled in with gold (Fig. 2 &.

b), do nothing between CDs (C in Figure 2), fill in again between DICs (D in Figure 2), and complete the filling without doing anything in between E (θ in Figure 2). This is the procedure.

As described above, according to this embodiment, a point on the boundary becomes the filling start point based on the positional relationship between a certain point on the boundary of the closed area, the previous point on the boundary, and the next point on the boundary. By providing a filling determination means for determining whether or not , and a filling end point detecting means for detecting a filling end point corresponding to a point determined to be a filling start point, it is possible to eliminate the need for a memory to store all boundary data. Not filling closed areas with minimum hard amount? In addition, as shown in Figure 2, only the specified closed area is filled in once, so processing is efficient without waste, and filling using operations other than exclusive OR is possible. can also be easily performed.

In this embodiment, in FIG. 6, the boundary trace is a counterclockwise inner trace, but it may also be a clockwise inner trace. However, in the case of clockwise rotation, the filling direction in Figure 2 will also be clockwise (in the order of AEDCH), and the fourth
In the figure, numbers 1 to 7 must be assigned in order counterclockwise with 0 as the reference.

As described in detail, according to the present invention, it is possible to realize filling of a closed area with a minimum amount of hardware without requiring memory to store all boundary data. Since filling is performed only once for each object, it can be processed efficiently without waste, and it is possible to perform filling using not only the exclusive OR operation but also other operations, which has a great practical effect.

[Brief explanation of the drawing]

FIG. 1 is a configuration diagram of a graphic display device according to an embodiment of the present invention, FIG. 2 is a progress diagram of an example of filling in according to the present invention, FIG. 4 is a diagram of the positional relationship between two adjacent points, and FIG. 3
The diagram shows the coordinate values for each positional relationship in Figure 4,
FIG. 5 is a flow diagram of an embodiment of the present invention, FIG.
FIG. 8 is a block diagram of a conventional graphic display device, FIG. 7 is a progress diagram of an example of filling in the conventional example of FIG. 6, and FIG.
The figure is a progress chart of an example in which filling is performed in the conventional example of FIG. 1.101.201 --- Image memory, 2,10
2゜202... Boundary tracking means, 103...
... Boundary data storage memo 17.104, 204...
...Filled area determination means, 5,105,205...
...Filling means, 206... Vertex data storage memory, 7... Filling determination means, 8...
...Filling end point detection means. Name of agent: Patent attorney Toshio Nakao and 1 other person No. 1
Figure 2 (d) (e) Figure 3 (χ, V+Q (7/, Boo 1) Figure 4 Figure 5 Figure 6/θ4 Figure 7 (α) (b) (O) Figure 8 Shout Figure 9

Claims (1)

[Claims] A boundary tracking means for tracking the boundary of a closed area on an image memory, and a positional relationship between a certain point detected by the boundary tracking means and three adjacent points, the previous point and the next point on the boundary. Filling determining means for determining whether a point on the boundary is a filling starting point; Filling end point detecting means for detecting a filling end point corresponding to a point determined as a filling starting point by the filling determining means; A graphic display device comprising: a filling means for drawing filling data between the filling start point and the filling end point.