JPS61248172A - Graph painting-out system - Google Patents

Abstract

PURPOSE:To execute the highly speedy painting-out of a graph by plural pieces of color information by underpainting, first, the graph as a whole with the color code in which the number of the same color area goes to be maximum, unifying and ouyputting the same color area concerning other respective color codes and executing the painting-out. CONSTITUTION:A rectangular list data preparing part 13 summarizes a small rectangle which is continuous in the (x) direction based upon the information of a displaying position information memory 11 and a color information memory 12, and stores the coordinate value of the peak of part unifying rectangles Aade, edfg, etc., and the color code. The color code of areas edi-mBn-xg, in which the number of the small rectangle of the same code comes to be maximum, is detected by a base color detecting part 15, and in order to underpaint, first, the whole with the color code, the peak coordinate value of the color code and squares ABCD is stored in a plot information storing memory 16. The rectangle of other same color code is unified in the Y direction, the polygon is formed by a polygon is formed by a polygon forming part 18 and the data are stored in the memory 16. At a displaying part 17, the painting-out graphic signal is successively generated and stored in the built-in frame memory.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Application of the Invention] The present invention relates to graphic display, and particularly to a graphic Ik filling method suitable for filling a graphic formed of adjacent small areas.

[Background of the invention]

Conventionally, when drawing a fill-in figure based on color information and display position, fill-in data is transferred for each individual area, and the relationship between each area is not considered.

For example, as described in the Tektronix Model 4115B Graphic Command Manual, a single pattern or a single color index can be used to
A crush command is provided. Therefore, when a figure is drawn by repeatedly outputting the filling of a small area, a large amount of data is transferred and it takes time to display. Furthermore, storing display information in a file requires a large amount of storage capacity.

For binary figures, a method has been proposed in which areas of equivalent values are integrated and filled in, and J-D, Foleyand A.
, Van Damll@Fundamentals
ofInteractiveComputerQr
aphics” (Addison Wesley, 1
982), p. 451, but the processing method for multicolored figures is not considered.

[Purpose of the invention]

An object of the present invention is to enable high-speed filling using a plurality of color information in graphic display. The object of the present invention is to provide a method for wiping out figures.

[Summary of the invention]

In the present invention, adjacent areas of the same color are searched from fill color information and display position information, integrated and stored, and after first undercoating the entire figure with a color code that maximizes the number of areas of the same color, For each color code, the same color area within the figure is output in an integrated manner and filled in.

[Embodiments of the invention]

An embodiment of the present invention will be described below with reference to the drawings.

As shown in FIG. 1, a case will be considered in which a rectangle ABCD composed of a large number of small rectangles Aabc, etc. is displayed on a part of the display screen 5. Each small rectangle is divided in the X direction, belongs to one of nine sections (and nine sections in ζ), and has the length of this one section,
It is assumed that each rectangle has a different width in the X direction.

In the figure, the presence or absence of diagonal lines or the direction of diagonal lines represents the color code of each small rectangle. The display position of each small rectangle Aabc, etc. is given by vertex coordinate values A, a, b, c, etc.

FIG. 2 is a block diagram of an apparatus using the fill-in method according to the present invention. 11 is a next display position information memory which stores the xy coordinate values of the display position of each small rectangle, and 12 is a color information memory which stores the fill color code of each small rectangle. The rectangle list data creation unit 13 searches for continuity of each small rectangle in the X direction for each section based on the information in 11.12, and performs partial integration that combines consecutive small rectangles for each section. Rectangles Aade, edfg, gfhl), etc. are obtained, rectangle list data consisting of the coordinate values and color codes of the vertices of the integrated rectangles is created, and the rectangle list data is stored in the rectangle list memory 14.
to be memorized. Based on the list, the base color detection unit 15 detects the color code of the area edijk1m13nopqrstuvwxg in which the number of small rectangles with the same code is the largest in the rectangle ABCD in the example of FIG. In order to underpaint with a code, the color code and the vertex coordinate values of the rectangle ABCD and the color code are stored in the plot information storage memory 16.

18 searches the list and forms a polygon by sequentially integrating in the Y direction rectangles with the same color code that are partially integrated in the X direction (for example, 4m1kjide) that have a color code that is not stored in the memory 6. It is a polygon forming part. The data of the formed polygon (vertex coordinates and color code) is stored in the polygon coordinate value storage memory 19. Polygonization (i.e. area integration)
After completion, it is stored in the memory 16. The rectangle list data corresponding to the polygon is deleted from the list by the control unit 20. Repeat this operation, and after completing all polygonization, 1
6 is transferred to a display section 17 having a rask scan type display device, where it sequentially generates fill-in graphic signals and stores them in a built-in one-frame memory.
l.

The operation of the rectangular list data creation section 20 will be explained using FIGS. 3 and 4. Figure 3 is a specific example of a filled figure. j9, 21, and 22 are rectangular areas of the same color integrated in the X direction in the 5th section in the X direction. @1 in the rectangle list at this time is It is shown in Figure 4. The rectangle list includes color cells 25 and 26 that store the color code of a continuous area in the X direction, the X coordinate value of the end point of the area, etc., and its control unit 27.
Consists of. If the ;J- rectangle of color code C- continues up to the X coordinate value X, and similarly the rectangle of color code C1 continues from X to X, a color cell is created as follows. 27 of the color cell 25 is the right end position of the continuous area, 28
A color code is set in , and a pointer to the next color cell 26 is set in 29 . Similarly, the rightmost position is at 30 of color cell 26)
The color code C, is set in lb, 31, and then, if there is no continuous area, the pointer value of 32 is set to 0. The number of these color cells is stored in 23, and the pointer to the first color cell is stored in 24. The above operation is performed in interval j==
1-Create a rectangular list (1) in which continuous areas in the X direction are collectively stored by performing operations up to l and m. The detection unit 15 calculates the total number of color cells of the same code in all sections from the list, that is,
Contains the same code.

The color code with the maximum number within the entire area of rectangles integrated in the X direction is detected as the base color code of rectangle ABCD. As mentioned above, this base color code and the pre-given vertex A.

The coordinates of B, C, and D are input into the plot information storage memory.

Next, polygonization of areas of color codes other than the base color will be described. First, a color code other than the pace color is detected from the color cells in the jth section, and a search is made to see if a continuous power 2- cell exists in the next j+1th section. The search is performed in order from the first color cell of the section, and the next (j+2)th section is similarly searched for the first color cell detected. If there are two or more rectangles of the same color in the next section, as shown in the shaded area in Figure 5, the search continues for the 33rd rectangle indicated by the first detected color cell, and the 34th rectangle is found in another area. Search again as a polygon.

The coordinate values of the rectangle vertices are sequentially stored in the memory 19 each time they are detected. The coordinate values of the vertices of the polygon 40 in FIG. 6 are a' and b' along the outline, as shown at 42.

c/ , d/ , e/ , fl , g/ , j, /
JrllllC is stored. When a continuous rectangle 41 is detected in the next section of this polygon 40, the vertex coordinate value 43 of 41 is inserted at position 44 at the bottom of q', r', S', and t'. The vertex coordinate values of the polygon obtained by integrating the vertex coordinates 40 and 41 are stored in the memory 19 along the contour.

If there is no continuous area, stop searching and store memory 1.
9 and the color code are stored in the memory 16.

The rectangle list data control unit 20 deletes the color cell corresponding to the rectangle stored in the memory 19 and the color cell of the base color from the list. Therefore, the objects of continuous area search are only color cells corresponding to rectangles that have not been polygonized.

In this way, following the vertex coordinates and color codes of quadrilaterals A, B, C, and D, polygon edi such as polygon Am1kjide is
The color codes and vertex coordinates of polygons other than jh1m13nopqrstuvwxfg are sequentially stored in the memory 16.

The data in the memory 16 is sent to the display unit 17 in the order in which it is stored.The display unit, which has a circuit (not shown) that fills in the inside of the polygon indicated by each vertex coordinate with an accompanying color code, first uses a rectangle ABCDt-base code. A signal representing the filled figure is generated and stored in a frame memory (not shown). Then sequentially polygon sdijk1m13nop
A signal representing a figure obtained by filling in each polygon other than qrstuvwxfg with a desired code is generated and overwritten in the frame memory.

If the number of small rectangles in the square to be displayed is large and the continuous area is small, reducing the amount of data transferred by creating the list is not effective. In this embodiment, when the total number of color cells is 374 or more, which is the total number of small rectangles, the conventional method of transferring each small rectangle is used.

The reduction rate of display information storage capacity and display time according to this embodiment can be estimated as follows.

Total number of small rectangles: mXn, number of polygon areas (= number of color codes) Time required to set colors when displaying 2:1 Display time per vertex of polygon: b1 Data length for expressing coordinate values Let's say twenty. The display time To in the case of all small rectangular output is To = (a + 4 b ) mn and the storage capacity Po is Po = 4 cmn. The number of vertices per region in the case of polygonized output is 4V;T71, assuming that the region is close to a square. In this case, the display time Tl and storage capacity pm using this embodiment are as follows: Tl = ak + 4b (k-1)v active period 1-4-4bP
1=4 c (k-1) v Kosi becomes +4 c. Therefore, the reduction rate is: Display time: Storage capacity: n. Furthermore, in this embodiment, when polygonized output is performed for all color codes without undercoating with the base color, the display time TI, storage capacity P2 expansion, T1=ak+4b&p! =4c2, and the reduction rate will be respectively.

It was actually displayed in t-21 colors on three rectangular sides of 28×1B, 28×28, and 18×28 small rectangles. Total number of small rectangles: 1792
, the total number of areas was 83. The estimation of the reduction rate at this time is T s / T using the method of this embodiment.

=0.17. P'l /Pa = 0.20, T snow /To = 0.19, Ps / without undercoating
Although Pa = 0.21, the actual measurement was TI/T using the method of this embodiment.

=0.23 (CPU time), Ps/Pa =0
．． 18. When not undercoating, Ts /T6 = 0.2
4. Pa/Po=o, ta. Further, the time reduction rate for U8 was 0.19 using the method of this embodiment, and 0.22 when no undercoating was applied.

In this embodiment, the total number of regions of the same code in the Y direction integrated in the X direction is determined for each section of the rectangle ABCD to be displayed, and the color code of the largest one is used as the base code. The amount of data necessary to generate the fill signal is sent from the memory 16 to the display section 17 in proportion to the number of vertices of the polygon sent. Therefore, strictly speaking,
All polygons integrated in the x-y directions may be found, and the color code of the polygon with the minimum number of vertices may be used as the base code. However, the method described in the above embodiment is effective in quickly obtaining results close to this exact method.

〔Effect of the invention〕

According to the present invention, it is possible to integrate consecutive areas of the same color and perform undercoating using the maximum number of area color codes, thereby increasing the speed of figure filling. Additionally, the memory capacity required to store display information could be reduced. The display speed varies slightly depending on the type of graphic terminal used, but the CPU time is 1/1/2 that of the conventional one.
The effect is that the USE time can be reduced by 10 to 1/4, the USE time can be reduced to 1/10 to 115, and the storage capacity can be reduced to less than 175 compared to the conventional one.

[Brief explanation of the drawing]

Fig. 1 is a specific example of a filled figure, Fig. 2 is an overall configuration diagram of a display device according to the present invention, Fig. 3 is an explanatory diagram of same color area integration, Fig. 4 is an explanatory diagram of a rectangular list, and Fig. 5 is a continuous diagram. FIG. 6 is an explanatory diagram of the storage of polygon vertex coordinate values. 11... Display position information memory, 12... Color information memory, 13... Rectangle list data creation section, 14...
・Rectangular list memory, 15...Base color detection section,
16... Plot information storage memory, 17... Display section, 18... Polygon forming section, 19... Polygon coordinate value storage memory, 30... Rectangle list data control section, 250,000 l Figure 3

Claims (1)

[Claims] 1. In the process of filling and displaying a figure formed based on fill color code information and display position information, the color code information and the display position information for the entire display figure are searched in advance, and the Extract areas with the same color code adjacent to each other in a figure, integrate them, and store them. First, underpaint the entire figure with the color code of one integrated area, and then apply each other color code to the same color area. A figure filling method that is characterized by integrating and outputting the shapes and displaying them as filled. 2. The figure filling method of item 1, in which the one integrated area is an area where the number of areas before integration is approximately the maximum.