JPS5838988A - Graphic generator - 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 The present invention provides a graphic generation device that has a function of creating a graphic larger than one display screen and inputting or deleting characters in the graphic in a document editing device containing graphics. It is related to.

In a graphic generation device using a rask scanning type CRT display, as shown in FIG. 1, data input through an input unit 1 such as a keyboard is stored in a datum 2 file 2 as a character code and a graphic compression code. The character generating section 3 and the graphic generating section 4 convert the encoded information in the data buffer 2 into a bit pattern for display and store it in the pattern memory 6. 6 is a CRT, and 7 is an auxiliary memory. In this method, in order to generate a graphic on one screen or more, a pattern memory 5 corresponding to the size of the graphic is required. A high-speed semiconductor RAM is used as the pattern memory 6, but it is expensive if it is several times that of one screen. Furthermore, when deleting a character pattern input after a graphic is generated, there is a drawback that the graphic must be generated again in order to perform a subtraction of the original graphic of the deleted portion.

In general, a graphics generator uses a low-speed, large-capacity auxiliary memory (such as a magnetic disk) to store created graphics and text. Although it is possible to generate the entire graphic pattern using only the auxiliary memory, the generation speed is significantly slower.

The present invention can efficiently generate a figure larger than one screen by using one screen's worth of pattern memory and a part of the auxiliary memory. The object of the present invention is to provide a graphic generation device that can easily perform processing such as restoration and originalization.

FIG. 2 shows a block diagram of a graphic generator according to an embodiment of the present invention. The character code and graphic compression code input through the input unit 11 are stored in the data buffer 12. As shown in FIG. 3, the page memory 16 divides one figure, which is the maximum size of a figure, into a plurality of blocks, and one word (16 bits) is allocated to each block.

The character light is stored in a predetermined block of the page memory 16.

The graphic generation unit 14 secures a graphic area in the page memory 16 from the graphic compression code in the data buffer 12, generates a graphic pattern for each program, and stores the code shown in FIG. 4a in the page memory 16. Write in each block. A portion corresponding to the display area of the page memory 15 is converted into the code shown in FIG. 4 and written into the code refresh memory 16. The pattern memory address code of BiTO-13 indicates the starting address of the pattern memory 18 where the bit pattern corresponding to the block is fully stored.

FIG. 6 shows the structure of the pattern memory. Normally, the pattern memory 18 stores character patterns necessary for display among the character patterns stored in the auxiliary memory 19. Pattern memory 18. pattern memory 1
Too many blocks (the number of blocks required for one screen) after the address GADD are used as a graphic pattern storage area, and the area before the address GADD is a character pattern exclusive area in which the minimum required character patterns are stored.

Next, a process for generating a graphic pattern in units of blocks will be explained using FIG.

Here, TM is page memory, CM is code refresh memory, BM is block memory, PM is pattern memory, and A
M is an auxiliary memory, BC is a block counter, 'SP/Haspace code, and GC' is a graphic identification code. First, a space code sp' (a type of character code) is written in an area of the page memory 16 corresponding to the graphic area. The graphic pattern for one block is first generated in the block memory 17 as shown in FIG. The blocks are stored in order from the lower block in the graphic pattern storage area. At the same time, a code as shown in FIG. 4a is written in the corresponding block of the page layout 15. In this way, graphic patterns are generated block by block, and when the graphic pattern storage area of the pattern memory 18 becomes full:) l;J', the graphic generation section 14 generates the pattern memory written in the page memory 16. The graphic patterns in the pattern memory 18 are transferred to the auxiliary memory 19 based on the serial numbers 1 to 1000. In the auxiliary memory 19, graphic patterns are arranged in a form corresponding to the page memory 16, as shown in FIG. When the transfer is completed, the next block to be generated is used again starting from the lowest block position in the graphic pattern storage area of the pattern memory 18 (the serial number becomes 1001). 7a shows a case where a new figure is generated, but when another figure is superimposed on an already generated block as shown in b, the code of the corresponding block in the negative memory 15 is
Since trt5 is N, II, BtT14
The graphic pattern corresponding to the serial number of ~BiTO is read from the pattern memory 18 or the auxiliary memory 19 into the program memory 17, the newly generated graphic is superimposed, and then returned to the original position.

When the generation of all figures is completed, B1T14 of the page memory 16 is
~B i To serial numbers are no longer required, and for identification with character codes, all blocks with BiTt5 set to "1" are given graphic identification codes ゜, GC' (B1T1
4-BiTO are all 11”).

In order to display a figure, the figure pattern included in the display area is transferred from the auxiliary memory 19 to the pattern memory 18, and the first address of the figure pattern/storage address of each block is written into the code refresh memory 16.

As shown in FIG. 7C, when entering characters into a figure, execute the process shown in FIG. 8C. In other words, while B1T16i of the corresponding block of the page memory 16 is set to "1", B1T1
4-Write the character code to BiTO. Bt'rt 6
Since there is no figure in the '0' block, you can just write the character code as is.

As shown in Figure 7d, if you want to delete the input characters, press the 8th button.
Execute figure d. That is, check B1T15f of the corresponding block in the page memory 16, and if it is 0"T and S, the subene code sp'2, and if it is "1", the original figure exists, so the figure identification code GC' is written. When displayed, the original shape of the deleted character part is restored.

As described above, according to the present invention, by having a page memory for one block-coded page, a pattern memory that can store graphics for one screen, and a low-speed, large-capacity auxiliary memory, the entire page can be stored. To quickly generate figures larger than one screen without requiring a pattern memory. In addition, editing processing such as inputting and deleting characters within graphics is easy, and the present invention can be applied to document editing devices that include graphics, which is necessary in the field of office automation, which is expected to develop in the future.

[Brief explanation of the drawing]

Fig. 1 is a block diagram of a conventional figure generator, and Fig. 2 is a block diagram of a conventional figure generator.
A block diagram of a figure generator in an embodiment of the present invention,
FIG. 3 is a diagram showing the configuration of a page memory and a food reflex memory; FIG. 4a; FIG. b is a diagram showing the code structure of one block in the page memory and code reflex memory, respectively; FIG. 6 is a diagram showing a storage method for storing block-based graphic patterns in the pattern memory; FIG. FIGS. 7a to 7d are diagrams showing various examples of graphic pattern generation, and FIGS. 8a and 8d are diagrams showing the processing of the graphic generation device according to the present invention. 11...Input section, 12...Mountain/data buffer, 13...Character generation section, 14...Graphic generation section, 16...Page memory , 16...
Code refresh memory, 17...Proton memory, 18...Pattern memory, 19...Auxiliary memory for CRT, 20...CRT. Name of agent: Patent attorney Toshio Nakao and one other person
Auxiliary memory ((2) (b) (C
) (d＞

Claims (1)

[Claims] A data buffer that stores character codes and graphic compression codes, a memory that divides the maximum graphic area into a plurality of blocks and stores character or graphic encoding information and graphic presence/absence information in each block; A block memory for storing figure patterns, a pattern memory for storing one screen's worth of figure or character patterns in blocks, and a display refresher that stores addresses for accessing the figure turns memory in blocks. A code refresh memory that is read in synchronization with the cycle, an auxiliary memory that can store the maximum figure/turn, and a data memory that stores the page memory, block memory, and pattern memory based on the contents of the data memory. A figure generation unit Nr 0 is characterized by having a figure generation unit that generates a figure pattern in an auxiliary memory by using