JPH03189877A - Bit map managing system - Google Patents

Abstract

PURPOSE:To accelerate display when a graphic is added or deleted by changing only a second bit map conforming to directly superimposed graphic elements, and rewriting a first bit map corresponding to a change result. CONSTITUTION:A display device 111 displays plural graphic elements by superimposing, and such display is performed based on the first bit map 121. Also, the second bit map 131 is prepared at every graphic element, and the names of the graphic elements superimposed just on and under a corresponding graphic element are stored in each element of the second bit map 131. When a new graphic is added on the graphic being displayed by superimposing, or one of the graphic being displayed by superimposing is deleted on the display device 111, the second bit map 131 conforming to the graphic elements superimposed just on and under a remarked graphic element is changed, and the rewrite of the first bit map 121 is performed corresponding to the change result. In such a way, it is possible to accelerate the display when adding or deleting the graphic.

Description

[Detailed Description of the Invention] [Table of Contents] Overview Industrial Field of Use Conventional Technology Problems to be Solved by the Invention Means for Solving the Problems Action Examples Effects of the Invention [Summary] Conversational type that performs big input Regarding the bitmap management method that efficiently adds and deletes figures on the display screen in a figure processing system, it is possible to overlap multiple figure elements with the aim of speeding up the display when adding or deleting figures. In a bitmap management method for displaying graphical elements, a display device that displays graphical elements, a first bitmap that stores display information for each pixel that makes up the display screen of the display device, and a bitmap that corresponds to each of the plurality of graphical elements. For each element, there are a plurality of second bitmaps that store graphic element names that directly overlap with the corresponding graphic element, and when adding or deleting a graphic element to the display on the display device, this graphic element is stored. The bitmap management means changes the second bitmap corresponding to a graphic element that directly overlaps with the first bitmap, and rewrites the first bitmap in accordance with the result of this change.

[Industrial application field]

The present invention relates to a bitmap management method for efficiently adding and deleting graphics on a display screen in an interactive graphics processing system that performs pick input.

(Prior art) In general, characters and figures are created using CAD.
In an interactive processing system in which updates are directly operated by an operator, it is necessary to display figures and the like at high speed in response to pick input using a mouse or the like.

Conventionally, as a method for displaying figures and characters on the screen of a display device, a method using a bitmap in which each display pixel corresponds to one bit or several bits of image data has been widely used.

For example, color information for each pixel (for example, 20-bit data expressed in RGB) is written into a memory called a video RAM. In the display control device, this digital data color information is R (red).

Each pixel of G (green) and B (blue) is converted into analog data and displayed on a display device such as a cathode ray tube (CRT). Therefore, when overwriting a new figure on a figure displayed on the screen, it is only necessary to rewrite the above-mentioned bitmap, which enables high-speed display processing and has the advantage that it can be achieved with relatively simple control. be.

[Problem to be solved by the invention]

By the way, in the conventional method described above, when deleting or adding a figure located in the middle when overwriting figures etc., it is necessary to perform the process of writing all the figures on the bitmap from the beginning each time. , there was a problem that it took time to add and delete shapes.

For example, on the display screen shown in Figure 6, first display a rectangle A, then overwrite this figure with a triangle B, and then insert a rectangle C between the rectangle A and the triangle B. Consider a case where In this case, it is not possible to determine the priority among these shapes simply by referring to the data on the bitmap, so rectangular shape A
, quadrilateral figure C3, triangle figure B, and so on. Therefore, as the number of graphic elements increases, processing time increases. If graphic processing takes a long time, it causes a delay in response in an interactive processing system, which is not favorable for operation, and a system that can speed up processing has been desired.

The present invention was created in view of these points, and an object of the present invention is to provide a bitmap management system that speeds up the display when adding or deleting figures.

[Means to solve the problem]

FIG. 1 is a block diagram of the principle of the bitmap management method of the present invention.

In the figure, a display device 111 in a bitmap management method in which a plurality of graphical elements are displayed in an overlapping manner displays graphical elements.

The first bitmap 121 stores display information of each pixel forming the display screen of the display device 111.

Each of the plurality of second bitmaps 131 corresponds to a plurality of graphic elements, and stores, for each element, a graphic element name that directly overlaps with the corresponding graphic element.

When adding or deleting a graphical element to the display of the display device 111, the bitmap management means 141 changes the second bitmap 131 corresponding to the graphical element that directly overlaps this graphical element, and also changes the second bitmap 131 corresponding to the graphical element that directly overlaps this graphical element. The first bitmap 121 is rewritten according to the result.

Therefore, as a whole, only the second bitmap 131 corresponding to directly overlapping graphic elements is changed, and the first bitmap 121 is rewritten according to the result of this change, thereby adding a graphic element.

Configured to make changes.

[For production]

The display device Ill displays a plurality of graphical elements in an overlapping manner, and this display is performed based on the first bitmap 121. In addition, a second bitmap 131 is prepared for each graphical element, and each element of this second bitmap 131 stores the name of the graphical element that is one layer above and one layer below the corresponding graphical element. I'll keep it.

A new figure can be added on top of a figure that is displayed in an overlapping manner on the display device 111, or one of the figures that are displayed in an overlapping manner.
If you want to delete one element, the one above and one above the graphic element of interest.
The second bitmap 131 corresponding to the graphic elements that overlap one another is changed, and the first bitmap 121 is rewritten according to the result of this change. Thereafter, the display device 1 is displayed based on this rewritten first bitmap 121.
11 is displayed.

In the present invention, when adding or deleting a graphical element, the first bitmap 121 corresponding to the display can be rewritten by changing only the second bitmap 131 corresponding to directly overlapping graphical elements. Because it is possible to
There is no need to rewrite the first bitmap 121 for all graphics according to the priority when adding or deleting.

(Example) Hereinafter, an example of the present invention will be described in detail based on the drawings.

FIG. 2 shows the configuration of an embodiment to which the attribute setting method in interactive graphic processing of the present invention is applied.

In FIG. 2, 211 is a display section, 213 is a display control section, 221 is a big input section, 223 is an instruction input section, 231 is a bitmap management section, 241 is an input/output control section, and 251 is a data 261 represents a main bitmap, and 271 represents an element bitmap.

The BIC input unit 221 includes a light pen, an input tablet,
It is composed of a mouse or the like, and can specify any element on the display screen of the display unit 211 with a simple operation. The instruction input unit 223 is used for inputting operation instructions and manually inputting various data through key operations. For example, it is also possible to input numerical values of the horizontal and vertical coordinates of arbitrary coordinates within the display screen described above. The display control unit 213 controls the display unit 211 based on the main bitmap 261 (details will be described later).
Controls the display of characters and figures.

The main bitmap 261 stores all pixel data corresponding to the display screen of the display unit 211, and when there are multiple graphical elements to be displayed on the same pixel, the main bitmap 261 stores the data of all the pixels corresponding to the display screen of the display unit 211. Stores the pixel data of the top graphic element.

Each of the element bitmaps 271 corresponds to graphic elements in an l-to-l ratio, and stores pixel data of a graphic of interest, coordinate data indicating the range of the graphic of interest, and size data.

Further, the bitmap management section 231 has a management table 23 internally.
31 Graphic element management table address-list 2352 Graphic element management table 237 is included, as well as a main bitmap 261 that stores data for each pixel on the display screen and multiple bitmaps that store pixel data for each display element in a predetermined unit. An element bitmap 271 is created.

The management table 233 is for managing addresses regarding the display of the interactive processing system of the embodiment, and a specific example thereof is shown in Table 1.

Also includes class addresses. Examples are shown in Table 2.

In Table 2, rPIC-1 and rPIC-2J indicate each of the displayed graphic elements, and indicate a storage state including the start address of the element bitmap 271 in one-to-one correspondence. Note that this graphic element management table 237
rearranges the arrangement based on the priority order of graphic elements so that they can always be searched in the order of highest priority.

The graphic element management table address list 235 stores the addresses of each graphic element information stored in the graphic element management table 237, and an example thereof is shown in Table 3.

The third graphical element management table 237 has areas corresponding to each of a plurality of display figures, each area stores information regarding the corresponding graphical element, and this includes the corresponding element bitmap 271. In the front cylinder 3 table, the "element name" is an identification code given to each graphic element, and is used for management within the system and correspondence with displayed graphics.

In addition, "rPIc-1 pointer" etc. are areas corresponding to each graphical element shown in Table 2 (PIC-1, PIC-2, etc.)
This is a pointer pointing to the start address of .

The human output control unit 251 controls input and output of data and instructions between each component. For example, the pick input section 221
Alternatively, when a figure drawing instruction is inputted by the instruction input section 223, this instruction is sent to the bin map management section 231.

The data processing unit 251 performs predetermined arithmetic processing on input data or enlarges or reduces displayed figures.

It performs various graphic processing such as movement, and the results of this processing are written to the main bitmap 261 and then displayed on the display section 211 via the display control section 213.

Next, the operation of the embodiment of the present invention described above will be explained.

FIG. 3 shows a specific example of data stored in the main bitmap 261 and each element bitmap 271.

FIG. 5A shows the stored contents of a main bitmap having a size of, for example, 8 pixels in the vertical direction and 9 pixels in the horizontal direction, and the number corresponding to each pixel indicates the graphic element with the highest priority.

Note that "0" corresponds to the case where there is no graphic element to be displayed.

) shows the stored contents of the element bitmap 271 corresponding to element 1, which has the minimum size necessary to express the figure of interest, its starting position X, Y, and horizontal size X. (=3), vertical size Y (=5>) as additional information.If the upper left coordinates of the main bitmap are (0,0), the start value if X '' 2, the start position Y=3 becomes.

In addition, the bitmap shown in Figure (b) stores "0" in elements where this graphic element does not exist, and if there is an element on that bit that has a higher priority than this graphic element. The graphic element name (element number) of the next higher order is set in the upper 2 bytes, and if there is a graphic element with a lower priority than this graphic element, the name of one or less graphic elements is set in the lower 2 bytes. In addition, if this graphical element has the highest priority, the top 2
The name of this graphic element is stored in the byte, and if the priority of this graphic element is the lowest, the name of this graphic element is stored in the lower two bytes. In the figure, A of A/B indicates the upper two bytes, and B indicates the lower two bytes.

(C) is an element bitmap 271 corresponding to element 2.
The details of the stored contents are the same as in the case of the graphic element 1 shown in FIG.

FIG. 4 shows the operating procedure when adding a new graphic element 4. The operator operates the pick input section 22I or the instruction input section 223 to instruct the creation of a new figure,
Instructions to that effect, coordinate data, etc. are sent to the bitmap management section 2.
31.

First, the bitmap management unit 231 creates the graphic element management table 237 corresponding to the graphic element 4, incorporates it into the link structure in priority order (step 411), and also creates the graphic element management table 237 corresponding to the graphic element 4 in the graphic element management table 237. The start address of the area is stored in the graphic element management table address list 235 (step 412).

Next, the bitmap management unit 231 determines the range of the bitmap in which the graphic element 4 is developed, prepares the element bitmap 271 that can store it, and (step 413
), the element (pixel position) at which graphic element 4 is drawn on the main bitmap 261 is determined (step 414).

Next, the lower two bytes of the element that depicts the graphic element 4 in the element bitmap 271 corresponding to the graphic element 4 are obtained (step 415). Specifically, the graphic element name (
In the example shown in FIG. 3(a), this is one of the graphic elements 1 to 3 (hereinafter referred to as the existing graphic element), and the priority is compared between this set graphic element and the present graphic element 4. , and perform the processing according to each of the following cases.

(2) If there is no existing graphic element (if "0" is set on the main bitmap 261), this graphic element 4 is set in the lower two bytes of the element of interest in the element bitmap 271 of the graphic element 4.

■If the existing graphic element has a lower priority, then the graphic element 4
The lower priority graphic element name is set in the lower two bytes of the element of interest in the element bitmap 271, and the graphic element 4 is set in the upper two bytes of the corresponding element in the element bitmap 271 of the lower priority graphic element. Set.

■If the existing graphic element has a higher priority and there is a graphic element with a lower priority than graphic element 4 in this focused element,
The name of the lower priority graphic element is set in the lower two bytes of the element of interest in the element bitmap 271 of graphic element 4, and the element bitmap 2 of the lower priority graphic element is set.
Graphic element 4 is set in the upper two bytes of the corresponding element of 71.

■If the existing graphic element has a higher priority and there is no graphic element with a lower priority than graphic element 4 in this element of interest, the lower two bytes of the element of interest in the element bitmap 271 of graphic element 4 are Set element 4.

Next, the upper two bytes of the element that depicts the graphic element 4 in the element bitmap 271 corresponding to the graphic element 4 are obtained (step 416). Specifically, processing is performed according to each of the following cases.

(2) If there is no existing graphic element (if "0" is set on the main bitmap 261), this graphic element 4 is set in the upper two bytes of the element of interest in the element bitmap 271 of the graphic element 4.

■If the existing graphic element has a lower priority, then the graphic element 4
This graphical element 4 is set in the upper two bytes of the element of interest in the element bitmap 271 of .

■If the existing graphic element has a higher priority, the graphic element 4
The graphic elements that overlap one above are displayed in the graphic element management table address table 235 and the graphic element management table 23.
7, and set the name of the graphic element that overlaps one above in the upper two bytes of the element of interest in the element bitmap 271 of graphic element 4, and also set the name of the graphic element that overlaps one above it. Graphic element 4 is set in the lower two bytes of the corresponding element in element bitmap 271.

Next, the bitmap management unit 231 selects the top two elements in the element bitmap 271 of the graphic element 4 obtained in step 416.
The element to which this graphic element 4 is set (the element with the highest priority of graphic element 4) is extracted from the bytes, and this graphic element name 4 is set to the corresponding element on the main bitmap 261. (Step 417).

Furthermore, in the element bitmap 271 corresponding to the graphic element 4, rQJ is set to elements other than the element drawing the graphic element 4, and the graphic addition process is completed.

Further, FIG. 5 shows the operating procedure when deleting an existing graphic element (for example, graphic element 2).

First, the bitmap management unit 231 detects the graphic element management table address list 235 and obtains the address of the area corresponding to graphic element 2 in the graphic element management table 237 (step 511).

Furthermore, the element bitmap 271 of the graphic element 2 is obtained with reference to the graphic element management table 237 (step 512), and the element bitmap 271 of the graphic element 2 in this element bitmap 271 is obtained.
Find the element in which is expanded (step 513).

Next, the bitmap management unit 231 determines whether the upper two bytes of the element obtained in step 513 are the main graphic element 2 (step 514), and if the upper two bytes indicate the main graphic element 2, (affirmative judgment) is the lower 2 of the same element
Depending on whether the byte is "2" or not, the following process (1) or (2) is performed to set the main bitmap 261 (step 515).

(2) When the lower two bytes are this graphic element 2, it is determined that there is no graphic element below this graphic element, and "0" is written to the same element in the main bitmap 261.

■If the lower 2 bytes are other than this graphic element 2, set the graphic element name indicated by the lower 2 bytes above in the same element of the main bitmap 261, and set the same element bitmap 271 of the lower graphic element. Set the lower graphical element itself to the element.

Further, if the upper two bytes of the element obtained in step 513 are other than the present graphic element 2 (negative determination in step 514), the bitmap management unit 231 stores the element bitmap 271 of the upper graphic element in the graphic element management table. It is obtained from the address list 235 (step 516).

Next, the bitmap management unit 231 performs the following process ■ or ■ depending on whether the lower two bytes of the element bitmap 271 of the graphic element 2 are "2", and The element bitmap 271 of is changed (step 517).

■If the lower 2 bytes are "2", the lower 2 bytes of the same element in the element bitmap 217 of the upper figure obtained in step 516
(Set the own graphic element name in the byte).

■If the lower two bytes are other than "2", the value is the element bit map 217 of the upper figure obtained in step 516.
and set the element bitmap 217 of the lower figure to the lower 2 bytes of the figure element management table address table 23.
5 and sets the graphic element name of the higher-order graphic in the upper two bytes of the same element in the element bitmap 271 that has been found (step 517).

Next, the bitmap management unit 231 deletes the element bitmap 271 of the graphic element 2, and also deletes the portion related to the graphic element 2 from the graphic element management table address list 235 and the graphic element management table 237 (step 518L) The deletion process for element 2 ends.

In this way, when multiple graphical elements overlap, information on the graphical elements that overlap in the element of interest is set in the element bitmap 271 for each graphical element, and when adding or deleting graphical elements, The element bitmap 271 of the overlapping adjacent figures is obtained from the figure element management table address list 235 and the figure element management table 237 and is changed. Furthermore, if the graphical element to be added or deleted here is at the top level, the main bitmap 261 is changed.

Therefore, when adding or deleting a figure, it is only necessary to change the element bitmap 271 of the figure element one above or below the present figure, and processing speed can be increased. In particular, by tracing the graphic element management table address table 235 and the graphic element management table 237, the corresponding element bitmap 271 can be obtained.
Since the element bitmap 271 can be directly determined without searching and determining the entire element bitmap 271, high-speed big input can be realized regardless of the number of graphic elements created.

In addition, in the embodiment of the present invention, the graphic element management table 23
7 stores the address of the element bitmap 271, but the graphic element management table address list 2
The address itself of the element bitmap 271 may be stored in 35, and the corresponding element bitmap 271 may be obtained at once.

〔Effect of the invention〕

As described above, according to the present invention, a graphic element can be added by directly changing only the second bitmap corresponding to a graphic element that matches the type, and rewriting the first bitmap according to the result of this change.

It is extremely useful in practical terms because it reduces the amount of information to be changed and speeds up the display when adding or deleting figures.

[Brief explanation of drawings]

FIG. 1 is a principle block diagram of the bitmap management method of the present invention, FIG. 2 is a block diagram of an embodiment to which the bitmap management method of the present invention is applied, FIG. 3 is an explanatory diagram of a bitmap of an embodiment, and FIG. 5 and 5 are explanatory diagrams of the operation of one embodiment, and FIG. 6 is an explanatory diagram of a specific example of graphical display. In the figure, 111 is a display device, 121 is a first bitmap, 131 is a second bitmap, 141 is a bitmap management means, 211 is a display section, 213 is a display control section, 221 is a big input section, 223 is an instruction input section , 231 is a bitmap management section, 233 is a management table, 235 is a graphic element management table address list, 237
is a graphic element management table, 241 is an input/output control section, 251 is a data processing section, 261 is a main bitmap, and 27] is an element bitmap. Book 4-Lang's waste Iripu O-vri diagram Fig. 1 Fig. 6-Ayse-eum) Chestnut's f8 cat\ and four-) 65 ya) Row's Shenkai'F word hrLρtsu 4th Figure (C) 1 aguhi, bumarame ε°-F ma huo, tru clear ≧ri Figure 3 Kazumi, 1 minute by Naka of the 61st edition, θSa Figure 5

Claims (1)

[Claims] (1) In a bitmap management method for displaying multiple graphical elements in an overlapping manner, a display device (111) that displays the graphical elements; and a display of each pixel that constitutes the display screen of the display device (111). A first bitmap (121) that stores information, and corresponding to each of the plurality of graphical elements, for each element,
a plurality of second bitmaps (131) that store graphic element names directly overlapping with corresponding graphic elements; the second bitmap (131) corresponding to a graphical element that directly overlaps the element;
a bitmap management means (141) for changing the first bitmap (121) and rewriting the first bitmap (121) according to the change result.