KR20060084753A - Graphics rendering system and method - Google Patents

Abstract

The graphics rendering system and the graphics rendering method are applied to an environment for graph generation and image processing. When a graph code is input to the graphic rendering system, the graph code is a graph code within the graphic rendering system to retrieve one or more data records corresponding to the graph code and to send the retrieved one or more data records to an image generation module. Analyzed by the processing module. Here, the data is in command form and is requested for outputting the completed graph / image. The image generation module includes an image generation program for interpreting and executing the instructions. The image planet program decodes the configuration, structure and ratio of the graph / image from the graph code, and applies the graph / image generation parameter obtained from the information provided by the data corresponding to the graph code without look-up table mapping used in the prior art. Generate the requested graph / image accordingly.

Graphics, rendering, images, graph code, parameters

Description

GRAPHICS RENDERING SYSTEM AND METHOD}

1 is a block diagram showing the basic structure of a conventional image processing apparatus.

2 is a block diagram showing the structure of the graphic rendering system of the present invention.

3 (a) is a structural diagram of a single-layer graph code.

3 (b) is a structural diagram of a multi-layer graph code.

FIG. 4A is a structural diagram of a database in the graphic rendering system shown in FIG. 2 when using an indexing technique.

4B is a structural diagram of graph codes divided to obtain classification prefix codes and classification trailing codes.

FIG. 4C is a structural diagram of a database in the graphic rendering system shown in FIG. 2 without using an indexing technique.

5 (a) is a command structure diagram of data.

FIG. 5B is a structural diagram showing a combined state of application instructions and graph codes for a graph / image double combination or one or more image combinations of different types.

FIG. 6 is a flowchart illustrating a graphic rendering method using the graphic rendering system illustrated in FIG. 2.

FIG. 7 is a flowchart illustrating a specific example of a data retrieval process in the graphic rendering method of FIG. 6.

FIG. 8 is a flowchart illustrating another specific example of a data retrieval process in the graphic rendering method of FIG. 6.

FIG. 9 is a flowchart specifically illustrating a command execution process by an image generating program for generating a graph / image in the graphic rendering method of FIG. 6.

10 is a flowchart showing a process of generating a graph from an image by a graphic rendering system and method according to an exemplary embodiment of the present invention.

FIG. 11 is a structural diagram of a database of the graphic rendering system illustrated in FIG. 10 when using an indexing technique.

FIG. 12 is a view showing an image acquired by the graphic rendering system after executing the graphic rendering method illustrated in FIG. 10.

13 is a flowchart showing a process of generating a graph from an image by a graphic rendering system and method according to another exemplary embodiment of the present invention.

FIG. 14 is a diagram illustrating an image acquired by a graphic rendering system after performing the graphic rendering method illustrated in FIG. 13.

15 is a flowchart showing a process of generating a graph from an image by a graphic rendering system and method according to another exemplary embodiment of the present invention.

FIG. 16 illustrates an image obtained by the graphic rendering system after performing the graphic rendering method illustrated in FIG. 15.

The present invention relates to a graphics rendering system and method, and more particularly, to a system and method for generating graphics in a display unit of an electronic device.

As shown in FIG. 1, in a conventional procedure for generating an image for an image, the image processing apparatus 900 may generate graphics / image data from the image database 902 to generate an image of the output image 903. Where the program 901 reads the lookup table mapping to read the image data 904, 905, 906 previously stored in the image database 902 to display an image on the output image 903. To utilize. During the image generation process, all image data 904, 905, 906 is stored in the image database 902 in advance so that the program 901 can find the necessary image data 904, 905, 906 when executing the program 901. It is required to store the graphic / image data for each picture or all graphic / image object data for the picture in the image database 902.

The prior art for image generation utilizes lookup table mapping and previews all graphic / image objects for a picture or graphics / image data for each picture in the image database prior to performing image generation and picture composition. Is required to store. This graphical rendering method requires very large data storage space. Moreover, for similar image objects, there are a large number of repetitive image data and parameters in corresponding image files. This wastes a lot of image storage space, which affects the image generation rate due to the time required to read the data.

In the case of displaying two pictures consecutively, after the first picture is displayed, without changing the background image of these two pictures, if the second picture simply adds some image objects to the first picture, If made, the prior art cannot transform only the added image objects to convert the first picture to the second picture. In other words, although the second picture has the same background image and color as the first picture, although the second picture differs only in the added image objects, instead of partially changing the first picture. The prior art will essentially replace the entire picture in order to display the second picture. In particular, all the image objects that make up the second picture need to be read and displayed to form the second picture as a whole. Such a method for displaying successive images causes a large number of repetitive image data and parameters to be stored in the image file, which wastes a lot of image storage space and affects the speed for generating successive images. .

In addition, according to the conventional graphic rendering technique, it is necessary to store a record of each necessary graphic / image data in the image database in advance and to store graphic / image data for each picture or all graphic / image object data for the picture. Do. This is so that the necessary information can be found in the image database when executing the program.

Accordingly, to solve such a problem, an object of the present invention is to provide a graphics rendering system and method that can reduce the use of image storage space without affecting the image generation rate.

In order to solve the above disadvantages of the prior art, it is an object of the present invention to provide a graphics rendering system and method applied to the environment for graph generation and image processing. Here, when a graph code is input to the graphic rendering system, in order to generate and obtain the requested graph / image according to a graph / image generation parameter, the configuration, structure, and ratio of the graph / image correspond to the graph code. It may be complexed from the graph code by the graphics rendering system according to the graph / image generation parameters provided by the data.

Another object of the present invention is to provide a graphic rendering system and method applied to an environment for graph generation and image processing. Here, using lookup table mapping, obtaining a graph / image from an image database, constructing a graph / image automatically or manually from the image database, or every image or image of every image in the image database. It is not necessary to store each record of the requested graph / image data in advance for the graph / image object data.

It is another object of the present invention to provide a graphics rendering system and method applied to an environment for graph generation and image processing. Here, the graph code is analyzed by a graph code processing module of the graphic rendering system to obtain one or more data records corresponding to the graph codes and to transfer the one or more data records to an image generation module, and then the image generation. When the module acquires the data, all of the acquired data is in command form and is requested to output the completed graph / image.

It is another object of the present invention to provide a graphics rendering system and method applied to an environment for graph generation and image processing. Here, an image generating program in the image generating module is used to interpret and execute the above commands, and the image generating program is a graph for each lookup data which is essentially corresponding to a request for any lookup data and one specific graph / image in the image database. Without the code, by using the graph / image generation parameter obtained according to the information provided by the data corresponding to the graph code to decode the configuration, structure and ratio of the graph / image from the graph code, the requested graph / image May be generated and obtained according to the graph / image generation parameter.

The present invention according to the above and other objects provides a graphical surface system and method applied to the environment for graph generation and image processing. When a graph code is input to the graphics rendering system, the graphics rendering system analyzes the graph code to retrieve one or more data records corresponding to the graph code, and a graph / image provided by the data corresponding to the graph code. Decode the configuration, structure and ratio of the graph / image from the graph code according to the generation parameter. In this way, the graphics rendering system can use the lookup table mapping to obtain a graph / image from an image database or configure the graph / image automatically or manually from the image database without having to configure the graph / image. Accordingly generate and obtain the requested graph / image.

The graphic rendering system according to the present invention includes a graph code processing module, a database and an image generation module. During an image generation process, a graph code is input to the graphic rendering system, and the graph code processing module of the graphic rendering system analyzes the graph code to retrieve one or more data records corresponding to the graph code, and the one or more retrieved ones. Send the data record to the image generation module. After the image generation module acquires the data, all of the acquired data is in command format and is requested to output the completed graph / image. The image generation program in the image generation module is used to interpret and execute these instructions. The image generating program is adapted to decode the configuration, structure, and ratio of the graph / image from the graph code without the need for any lookup table and each graph code essentially corresponding to one particular graph / image in the image database. Use the graph / image generation parameters obtained according to the information provided by the data corresponding to the code. In this way, the requested graph / image may be generated and obtained by the image generating program according to the graph / image generating parameter.

2 is a system block diagram illustrating the technology of a graphics rendering system according to the present invention. As shown in FIG. 2, the graphic rendering system 1 of the present invention comprises a graph code processing module 2, a database 3, and an image generating module 4, wherein the graphic rendering system 1. May be a hardware chip, or computer software stored in a memory device of a computer system.

When a graph code is input to the graphic rendering system 1, the graph code processing module 2 in the graphic rendering system 1 analyzes the graph code according to the information in the database 3 and corresponds to the graph code. Locate one or more data records and send one or more data records to the image generation module 4; After the image generation module 4 acquires the data, all of the acquired data is in command form and is required to output a complete graph / image. An image generating program 41 in the image generating module 4 is used to interpret and execute the instructions. The image generating program 41 uses a graph / image generation parameter obtained according to the information provided by the data corresponding to the graph code, without requiring any lookup table and any one graph / image in the image database. Decode the configuration, structure, and ratio of the graph / image from the graph code without necessarily having each graph code corresponding to, and the essential graph / image is decoded by the image generating program 41 according to the graph / image generating parameter. Created and obtained.

The principle of graph code selection depends on the visual position of the graph. In order from outside to inside, top to bottom, and left to right, the graph / image and corresponding graph code are set up and processed. If required, one graph code may be set to include a plurality of n1 segments of code. In the embodiment of the present invention, for example, n1 is for explaining the state of the graph code selection, but is not limited to two. In the case where one graph code includes two segments, the graph code can be divided to obtain one segment as a prefix code and another segment as a trailing code. That is, the graph code consists of the front and rear codes. If the selected prefix and trailing codes are each further processed, the graph code may be considered to have a structure of a single layer graph code including the prefix code and the trailing code. Depending on the configuration of the graph / image, if the graph / image consists of the outside and the inside, the potential code represents the outside and the trailing code represents the inside. If the graph / image consists of a left part and a right part, the potential code represents a left part and the rear code represents a right part. If the graph / image includes a top and a bottom, the potential code represents the top and the back code represents the bottom.                     

If the composition of the graph / image is complicated, the graph code representing the graph / image may be classified into a layer by layer structure according to the degree of complexity. In addition to the single layer structure described above, the selected potential and trailing codes can each be further processed according to the complexity of the graph / image. As shown in Fig. 3 (a) showing the structure of the single layer graph code, if the selected potential and trailing codes can be further processed respectively, the graph code 5 is the potential code 51 and the potential code 52. It is considered to include the structure of a single layer graph code comprising. Regardless of whether the graph code has a single layer structure (shown in FIG. 3 (a)) or a multi-layer structure (shown in FIG. 3 (b)), the code selection method and principle are the same and only the number of layers is different.

As shown in Fig. 3B, the graph code has a multilayer structure. If the composition of the graph / image is complicated, the graph code representing the graph / image may be classified into a layer by layer structure according to the degree of complexity. First, the graph code is divided into a first-layer potential code and a first-layer trailing code. The first-layer potential code is then further divided into a 2-1 layer potential code and a 2-2 layer trailing code. Similarly, the first-layer trailing cord is further divided into a 2-3 layer prefix cord and a 2-4 layer trailing cord. For the third layer, a set of 3-1 layer potential cords and a 3-2 layer backend cord, a set of 3-3 layer potential cords and a 3-4 layer backend cord, a 3-5 layer potential cord and a 3-6 layer backend The same principle applies to obtaining a set of cords, and a set of 3-7 layer prefix codes and a 3-8 layer trailing code. The principle and method of operation for graph codes having three or more layers is similar to the operation principle and method applied to graph codes having a single layer, and thus a more detailed description is omitted here.

When using the indexing technique, the graph code can be set to include a plurality of n2 segments, where n2 is a natural number, for example, for graph code selection, but not limited to two. As shown in Fig. 3 (a) with n2 = 2, when the graph code 5 includes two segments, the graph code 5 converts one segment into a prefix code 51 and a trailing code. As 52 it may be divided to obtain another segment. In the indexing technique, the prefix code 51 functions as an index code, and the back code 52 functions as a correspondence code. The graph code 5 comprises the preceding code 51 and the trailing code 52; In other words, the graph code 5 includes the potential code 51 and the corresponding code 52. The principle of selection of graph codes depends on the visual position of the graphs in order from outside to inside, top to bottom, and left to right. In the embodiment of the present invention, according to the request of classification and segmentation of the graph / image, the potential code 51 may be set to n3 bits, for example, n3 = 10, 15 or 20, that is, the potential code ( 51 may be 10 bits, 15 bits or 20 bits. The trailing code 52 may be set to n4 bits, for example, n4 = 15,20 or 25, that is, the trailing code 52 may be 15 bits, 20 bits or 25 bits. The prefix code 51 serving as an index is used to create an index table and to create an index address area file. The rear end code 52 functions as a corresponding code. There are a plurality of data records in the address area, each of which is represented by a trailing code 52 having d bits, which represents '(e-1) <(d / 8) <= (e)'. Can be combined as a satisfying letter e. For example, where d = 15 and e = 2, that is, two characters. If there are c data records in the address area, it may be c * e characters. In the embodiment of the present invention, for the sake of convenience of explanation, the corresponding code (postfix code 52) is stored for use only as a comparison reference for the entered graph code. After finding the data corresponding to the graph code, there is some information obtained by referring to the graph / image generation parameter. The graph / image generation parameter may be in the form of a command and may be processed by an image generation program for graph / image generation. Each data record must correspond to a corresponding code and must have exactly the same segment structure as the corresponding code. Therefore, the data segment can also be set to the e character structure. In an embodiment of the invention, c, d and e are natural numbers. With such indexing techniques, only the search of the same index code is required, so throughput and efficiency can be improved regardless of the acquisition opportunity of the same index code depending on the complexity of the graph / image classification.

FIG. 4A is a schematic diagram showing the configuration of a database of the graphic rendering system shown in FIG. 2 when using an indexing technique. If using an indexing technique, there may be an index table 31 and corresponding code grouping 32 in the database, as shown in FIG. 4 (a), where the index table 31 corresponds to the same index code. The index code 311 of the corresponding code group A1, B1 ... and the home address j, k .... In an embodiment of the present invention, index code 311 includes index codes A, B, ..., and corresponding code grouping 32 corresponds to corresponding code group A1, B1 ..., and Contains data that follows the corresponding code. For example, the corresponding code grouping 32 includes a corresponding code group A1 corresponding to an index code A, where the corresponding code group A1 corresponds to data xxxx, ****, ## corresponding to the same index A. Corresponding codes a1, a2, a3 having each ## together. And the corresponding code grouping 32 further includes a corresponding code group B1 corresponding to the index code B, wherein the corresponding code group B1 includes data &&&&, $$$$, + corresponding to the same index code B. +++ includes corresponding codes b1, b2, b3 with each one. As shown in Fig. 4A, the index table 31 includes the index codes A, B ..., the home address j of the corresponding code group A1, and the home address k of the corresponding code group B1. do. The corresponding code grouping 32 includes a corresponding code group A1 and a corresponding code group B1, where the corresponding code group A1 includes a corresponding code a1, a2, a3 corresponding to the same index code A, and the corresponding code group (B1) includes corresponding codes b1, b2, b3 corresponding to the same index code (B). The home address j in the index table 31 is the home address of the corresponding codes a1, a2, a3 in the corresponding code group A1 corresponding to the same index code A. The home address k in the index table 31 is the home address of the corresponding codes b1, b2, b3 in the corresponding code group B1 corresponding to the same index code B.

The graph code includes a prefix code and a trailing code, wherein in an embodiment of the present invention, the prefix code is an index code and the trailing code is a corresponding code. By using the above-mentioned indexing technique, the file for the two character corresponding code is simply formed and the index table is created by the home address of the corresponding code group corresponding to the same index code. The index table includes an index code and a home address of a corresponding code group corresponding to the same index code, where the data corresponding to the corresponding code group and the corresponding code constitute the corresponding code grouping. Each time a graph code including an index code (potential code) and a corresponding code (postfix code) is input, a search is performed in the index table to find the home address of the corresponding code group corresponding to the index (potential code). The search is then performed for one or more corresponding codes in the corresponding code grouping (including one or more corresponding code groups corresponding to the same home address) according to the home address in the index table to obtain the required corresponding code, thereby Following data can be obtained. Further, after the data acquisition, regardless of the graph code coinciding with the data, the acquired data includes one or more data records and is all instructions, for the image generating program 41 to decode and execute the instructions. As such, the image generating program 41 decodes and executes the instructions. The program is for processing data. In order to achieve the most efficient data processing, the data (ie acquired data corresponding to the graph code) is designed to include instructions that can be executed by the image generating program 41. 5A is a schematic diagram showing an instruction structure of data. As shown in Fig. 5A, the data is designed to be in an instruction form. After appropriately analyzing the acquired data corresponding to the graph code, data 35 includes a configuration command 351, a configuration command 352, and a graph command 353. The construction command 351 describes the correlation of the proportional distribution between the graphs constituting the picture, for example, the proportional distribution of the graph head and the graph body of the graph / image in the picture. The shape command 352 describes a data configuration that results in a bit structure processed by the image generating program prior to the last graph / image data acquisition to save space and make all kinds of possible situations. The graph command 353 is used to produce a graph for constructing the image to generate a graph / image.

When the graph code is input to the graphics rendering system 1, an analysis is made to obtain the prefix code and the back code, and correct configuration graphs can be obtained via the image generating module 4. . The size and profile of the shape graph constituting the image can be changed and set by the user in an artificial intelligence manner. The program for generating a graph constituting the image is called an image generating program, where the size of the graph can be freely modified.

For ease of sorting on the graph configuration when not using the indexing technique, the graph code 5 may also be set to n5 segments, where n5 is a natural number. In an embodiment of the invention, for example, n5 = 2, ie graph code 5 comprises two segments. 4 (b) is a schematic diagram showing a graph code divided to obtain a classification potential and a classification rear end. As shown in Fig. 4B, two segments of the graph code 5 'are separated to have one segment as the prefix code 51' and the other segment as the trailing code 52 '. In the embodiment of the present invention, the potential code 51 'is a classification potential, and the rear code 52' is a classification rear end. The graph code 5 'includes the potential code 51' and a trailing code 52 '. In other words, the graph code 5 'includes the sorting potential 51' and the sorting back 52 '. By combining the sorting potential 51 '(potential code 51') and sorting rear 52 '(postfix 52'), the combination graph sorting code 5 '(including sorting potential and sorting back) is used for graph code 5'. Obtained. The principle of selection of graph codes depends on the visual position of the graphs in order from outside to inside, top to bottom, and left to right. In an embodiment of the present invention, according to the requirement of classification and segmentation of the graph / image, the classification potential 51 '(potential code 51') may be set to n6 bits, for example, n6 = 10, 15 or 20, i.e., the sorting potential 51 'may be 10 bits, 15 bits or 20 bits. The classification code 52 '(postfix 52') may be set to n7 bits, for example n7 = 15,20 or 25, i.e., the classification trailing 52 'is 15 bits, 20 bits or 25 bits. Can be. The potential code 51 'functions as a sorting potential 51', and the rear code 52 'functions as a sorting rearward 52'. Each combination graph classification code 5 'corresponds to an address of a place where data corresponding to the combination graph classification code 5' is stored.

FIG. 4C is a schematic diagram showing the configuration of a database of the graphic rendering system shown in FIG. 2 when the indexing technique is not used. As shown in Fig. 4C, when no indexing technique is used, the data area 34 constituting the data, the data address 341 of the data area 34, and the combination graph classification code are stored in the database. There may be an address table 31 that includes. There is an f data record in the data area 34, wherein if each data record is set to g characters, the address of each data record corresponds to any combination graph classification code 5 ', and the f data record represents the entire f * g character. Each of the data corresponds to a specific combination graph classification code.

If no indexing technique is used, each time a graph code 5 ', i.e., a combination graph classification code 5' is entered, a search in the address table 33 is performed in the data area 34 according to the combination graph classification code 5 '. Is performed to obtain a data address 341. A search is then performed in the data area 34 to obtain data according to the data address from the address table 33, thereby obtaining data corresponding to the combination graph classification code. Regardless of which combination graph classification code matches the data, eventually one or more data records can be obtained and all instructions. Since the image generating program 41 is used to decode and execute the instruction, the image generating program 41 decodes and executes the instructions. The program is for processing data. In order to achieve the most efficient data processing, the data (ie acquired data corresponding to the combination graph classification code) is designed to include instructions that can be executed by the image generating program 41.

5A is a schematic diagram showing an instruction structure of data. As shown in Fig. 5A, data is designed to be in an instruction form. After appropriately analyzing the acquired data corresponding to the graph code, the data 35 is designed to include a configuration command 351, a configuration command 352, and a graph command 353.

Therefore, regardless of whether the indexing technique is used or not, the instruction structure of the data is the same. In other words, the instruction structure of the data shown in FIG. 5 (a) applies to both situations with or without employing indexing techniques.

When the graph code is input to the graphics rendering system 1, an analysis is made to obtain the prefix code and the back code, and correct configuration graphs can be obtained via the image generating module 4. . The size and profile of the shape graph constituting the image can be changed and set by the user in an artificial intelligence manner. The program for generating a graph constituting the image is called an image generating program 41, where the size of the graph can be freely modified.

The image generation program 41 serves as a graph / image generation factory such that the graph / image satisfies all special requirements. When configuration instructions, shape instructions, and graph instructions are defined in the data, even if the ratio of the graph configuration and the size of the graph / image of the image are required, the graph / image is generated to acquire and output an image by executing the instruction. For a graph / image superimposition combination or two pictures of different types or for several pictures, the user needs to use a parameter informing the image generating program 41 to generate the required picture.

Fig. 5B is a schematic diagram showing a combination of application instructions and graph codes for a graph / image superimposition combination or a plurality of different types of images. As shown in Fig. 5 (b), an application instruction of n8 characters (n8 is a natural number) may be added in front of graph code 5 to inform the image generating program 41 and to generate a correction graph / image required by the user. Can be. Since a graph / image is generated by the image generating program 41, the user has already set parameters in the application instruction P to control the state of the graph / image superimposition combination or the combination of other types of images and to control some images. Simply select and set.

FIG. 6 is a flowchart showing processing steps of the graphic rendering method of the graphic rendering system 1 of FIG. 2. As shown in FIG. 6, first, in step 11, the graph code is input to the graphic rendering system 1. Then proceed to step 12.

In step 12, the graph code is analyzed by a graph code processing module 2 in the graphic rendering system 1 and the graph code processing module 2 corresponds to a graph code according to the information in the database 3. One or more data records are found and transmitted to the image generation module 4. Then proceed to step 13.

In step 13, when the image generation module 4 acquires data, all the data is in the form of instructions and is required to output a complete graph / image. The image generating program 41 in the image generating module 4 is used to decode and execute such instructions. The image generating program 41 uses a graph / image generation parameter obtained according to the information provided by the data corresponding to the graph code, in order to decode the graph / image ratio, configuration and structure from the graph code. The required graph / image is generated and obtained by the image generating program 41 according to the graph / image generating parameter.                     

FIG. 7 is a flowchart illustrating a detailed process of a data retrieval step of the graphic rendering method of FIG. 6. If an indexing technique is used, the graph code includes a prefix code and a trailing code, where the prefix code functions as an index code and the trailing code functions as a correspondence code. By using the above-mentioned indexing technique, a file for a two-character corresponding code is simply formed and an index table is created by the home address of the corresponding code group corresponding to the same index code. The index table includes an index code and a home address of a corresponding code group corresponding to the same index code, where the data corresponding to the corresponding code group and the corresponding code constitute the corresponding code grouping.

As shown in Fig. 7, after the graph code is input to the graphic rendering system 1, in step 121, the graph code includes an index code (potential code) and a corresponding code (postfix code), and an index table A search is performed in (31) to find the home address of the corresponding code grouping 32 according to the index (potential code). The process then proceeds to step 122.

In step 122, a search is performed for one or more corresponding codes of corresponding code grouping 32 (including a corresponding code group consisting of one or more corresponding codes corresponding to the same home address) according to the home address in the index table. The code can be obtained, thereby obtaining data following the corresponding code. In addition, after the data acquisition, the acquired data includes one or more data records and is all instructions, regardless of the graph code coinciding with the data, and the image generating program 41 decodes and executes the instructions.

FIG. 8 is a flowchart illustrating another detailed process of the searching step of the graphic rendering method of FIG. 6. If no indexing technique is used, the graph code includes a prefix code and a trailing code, that is, the graph code includes the sort potential and sort tail. By the combination of the sorting potential (potential code) and sorting postfix (postfix code), the combination graph sorting code (including sorting potential and sorting postfix) is obtained for the graph code. Each combination graph classification code corresponds to an address of a place where data corresponding to the combination graph classification code is stored. If no indexing technique is used, in the database 3 there is an address table 33 comprising a data region 34 constituting the data, a data address 341 of the data region 34 and a combination graph classification code. There may be.

As shown in Fig. 8, in step 221, a graph code, i.e., a combination graph classification code, is input to the graphic rendering system 1, and then a search is performed in the address table 33, according to the combination graph classification code. Acquire a data address 341 of the data area 34. The process then proceeds to step 222.

In step 222, a search is performed in data area 34 to obtain data according to data address 341, thereby obtaining data corresponding to the combination graph classification code. After data acquisition, regardless of whether the combination graph classification code matches the data, eventually one or more data records can be obtained and all instructions. The image generating program 41 decodes and executes an instruction.                     

FIG. 9 is a flowchart illustrating a detailed procedure of steps for executing a command using an image generating program to generate a graphic / image in the graphic rendering method of FIG. 6. The data obtained corresponding to the graph code is appropriately analyzed, and the data is composed of a configuration command 351, a configuration command 352, and a graph command ( 353). The configuration command 351 is a relation between a proportional distribution between graphs constituting one image, for example, a proportional distribution of a graph head and a graph body of a graph / image in an image. Indicates. The shape command 352 represents the data shape and, in order to save space, all kinds of possible in one bit structure to be processed by the image generating program 41 before obtaining the final graph / image data. It creates a situation. The graph command 353 is used to produce graphs for constructing the image following generation of graphs / images.

As shown in FIG. 9, after the image generating module 4 acquires the data, the data includes the configuration command 351, the shape command 352, and the graph command 353. First, in step 131, the image generating program 41 in the image generating module 4 is configured to obtain a proportional distribution relationship between graphs constituting the image, for example, the ratio between the graphs, Execute configuration command 351. The process then proceeds to step 132.

In step 132, the image generating program 41 executes the shape command 352 to realize the data shape. The process then proceeds to step 133.

In step 133, the image generating program 41 executes the graph command 353 to produce graphs for constructing the image so as to generate graphs / images.

10 is a flow chart illustrating a procedure for generating graphs in one image using a graphics rendering system and method according to a preferred embodiment of the present invention. As shown in Fig. 10, first in step 61, one graph code is input into the graphic rendering system 1. The process then proceeds to step 62.

In step 62, since the graph code w includes the index code w1 (potential code) and the corresponding code (correspondence code) v1 (suffix code), the correspondence corresponding to the index code w1 (potential code) as shown in FIG. A search is performed in the index table 301 to find the home address k1 of code group v, where the index table 301 is as shown in FIG. 11 and the corresponding code v1 is the corresponding. Located in code group v. Then proceed to step 63.

In step 63, the correspondence code grouping (correspondence code grouping) according to the home address k1 in the index table 301, so that it can find the necessary correspondence code v1 and thereby obtain the data z1 following the correspondence code v1. A search is performed on the corresponding codes of the corresponding code group v in 302 (with corresponding code groups including one or more corresponding codes corresponding to the same home address). In such an embodiment, the data z1 includes 16 bits and is all instructions. This will cause the image generating program 41 to interpret and execute the instructions. Then proceed to step 64.

In step 64, the image generating program 41 in the image generating module 4 executes the configuration instruction 351 of the data z1 so as to obtain a proportional distribution relationship between the graphs constituting one image. . In this embodiment, an image in a left-right pattern is obtained. That is, the image includes a left half and a right half having the same size. Then proceed to step 65.

In step 65, the image generating program 41 executes the shape command 352 to implement the data shape. In the above embodiment, a graph in the left half surface of the image and another graph in the right half surface of the image are obtained. In addition, the position and size of both graphs are obtained. Then proceed to step 66.

In step 66, the image generating program 41 executes the graph command 353 to produce graphs for constructing the image so as to generate graphs / images. In this embodiment, as shown in Fig. 12, a solid circle will be created in the left half of the image and a solid triangle will be created in the right half of the image.

The embodiment utilizing the indexing technique can be implemented in a similar way as not using the indexing technique, so the latter case is not described herein any further.

13 is a flow chart illustrating a procedure for generating graphs in one image using a graphics rendering system and method according to another preferred embodiment of the present invention. In this embodiment, two graph codes will be input. That is, the first picture will be created, then the second picture will be created and superimposed over the first picture. In the case where two pictures overlap each other, an application command P must be added to the front of each of the two graph codes to clarify the overlap condition. In such an embodiment, the graphs in the second picture will overlap and cover the graphs in the first picture, so after these overlapping pictures are completed, the graphs in the first picture are completed. Only by those uncovered parts will it be visible.

As shown in Fig. 13, first in step 71, a combination of (graph code w + application instruction x) and a combination of (graph code u + application instruction y) is input into the graphic rendering system 1. Then proceed to step 72.

In step 72, a combination of graph code w + application instruction x is first performed. Since the fraudulent application instruction x is not one graph code, only the graph code w is left to be processed. The graph code w includes the index code w1 (potential code) and the corresponding code v1 (suffix code), thereby finding the home address k1 of the corresponding code group v corresponding to the index code w1 (potential code). First, the search may be performed in the index table 301. The index table is as shown in FIG. The corresponding code v1 is located in the corresponding code group v. Then proceed to step 73.

In step 73, the corresponding code grouping 302 (same home) according to the home address k1 in the index table 301 so as to find the necessary corresponding code v1 and thereby obtain the data z1 following the corresponding code v1. Search for corresponding codes in the corresponding code group v) (with corresponding code groups comprising one or more corresponding codes corresponding to an address). In this embodiment, the data z1 is 16 bits and all commands, and the image generating program 41 will interpret and execute the commands. Then proceed to step 74.

In step 74, the image generating program 41 in the image generating module 4 executes the configuration instruction 351 of the application instruction x and the data z1. In the embodiment, from the application instruction x, when one generated picture is superimposed on another picture, the covered part of the graphs of the following picture is not shown, whereas only the uncovered part of the following picture is shown. Only it is realized to be seen. By executing the configuration command 351 of the data z1, the proportional distribution relationship between the graphs constituting one image is obtained. In this embodiment, from the configuration instruction 351 of the data z1, the image is present in a left-right pattern, i.e., the image is realized to have a left half and a right half of the same size. . Then proceed to step 75.

In step 75, the image generating program 41 executes the shape command 352 to realize the data shape. In this embodiment, one graph is obtained in the left half surface of the image and another graph in the right half surface of the image. Also the position and size of the two graphs are obtained. Then proceed to step 76.

In step 76, the image generating program 61 executes the graph command 353 to produce graphs for constructing the image so as to generate graphs / images. In this embodiment, as shown in Fig. 12, a circle hatched in the left half of the image and a triangle hatched in the right half of the image will be generated. Then proceed to step 77.

In step 77, a combination of graph code u and application instruction y is processed. Since the application instruction y is not one graph code, only the graph code u is left to be processed. The graph code u includes an index code u1 (potential code) and a corresponding code t1 (suffix code), so that the home address r1 of the corresponding code group t corresponding to the index code u1 (potential code) as shown in FIG. A search may be performed within the index table 301 to find. Here, the index table 301 is as shown in FIG. The corresponding code t1 is located in the corresponding code group t. Then proceed to step 78.

In step 78, the corresponding code grouping 302 according to the home address r1 in the index table 301 so that the necessary corresponding code t1 can be found and thereby data z2 following the corresponding code t1 can be obtained. A search is performed for the corresponding codes of the corresponding code group t in the corresponding code group t (with corresponding code groups containing one or more corresponding codes corresponding to the same home address). In this embodiment, the data z2 contains 16 bits and all instructions, so that the image generating program 41 will interpret and execute the instructions. The process then proceeds to step 79.

In step 79, the image generating program 41 in the image generating module 4 executes the application instruction y and the configuration instruction 351 of the data z2. In the embodiment, from the application instruction y, the generated second picture is superimposed on the first picture, and the superimposed part of the graphs of the first and second pictures is only shown by the graphs of the second picture. Is realized. By executing the configuration command 351 of the data z2, the proportional distribution relationship between the graphs constituting one image is obtained. In this embodiment, it is realized that the image exists in the left-right pattern, that is, the image includes a left half surface and a right half surface of the same size. Then proceed to step 80.

In step 80, the image generating program 41 executes the shape command 352 to realize the data shape. In this embodiment, one graph is obtained in the left half surface of the image and another graph in the right half surface of the image. Also the position and size of all of the graphs are obtained. Then proceed to step 81.

In step 81, the image generating program 41 executes the graph command 353 to produce graphs for constructing the image so as to generate graphs / images. In this embodiment, a hatched rectangle in the left half of the image and another hatched rectangle in the right half of the image will be created. Since the embodiment includes two images overlapping, the application instructions x and y must be executed to obtain the overlapping image as shown in FIG.

As such an embodiment utilizing the indexing technique can be spherical in a similar manner without using the indexing technique, the latter case is not described herein any further.

15 is a flowchart illustrating a procedure for generating graphs in one image by a graphic rendering system and method according to another embodiment of the present invention. In the above embodiment, two graph codes will be input, thereby generating two pictures at the same time, and the image superimposition condition is considered. In the case of a condition of overlapping graphs within the two pictures, an application instruction must be added to the front of each of the two graph codes to clarify the overlapping condition. In this embodiment, the graphs in the second picture will be overlaid on the graphs in the first picture and the superimposed portion of the graphs of the first and second pictures will be shown by the graphs in the first picture. . That is, the graphs in the second picture are relatively transparent relative to the graphs in the first picture within the overlapped portions of the graphs of the first and second pictures.

As shown in FIG. 15, in step 90, a combination of (graph code w + application instruction p1) and a combination of (graph code u + application instruction p2) is input into the graphic rendering system 1. Then proceed to step 91.

In step 91, the combination of the graph code w + application instruction p1 and the combination of the graph code u + application instruction p2 are processed simultaneously. Since the application instructions p1 and p2 are not graph codes, only the graph codes w and u are left to be processed. The graph code w includes an index code w1 (potential code) and a corresponding code v1 (suffix code), and the graph code u includes the index code u1 (potential code) and a corresponding code t1 (suffix code). The index table 301 to find the home address k1 of the corresponding code group v corresponding to the index code w1 (potential code) and to find the home address r1 of the corresponding code group t corresponding to the index code u1 (potential code). The search may be performed within). Here, the index table is as shown in FIG. The corresponding code v1 is located in the corresponding code group v, and the corresponding code t1 is located in the corresponding code group t. Then proceed to step 92.

In step 92, the home addresses k1 and r1 in the index table 301 can be found so that the necessary corresponding codes v1, t1 can be found and thereby the data z1, z2 following the corresponding codes v1, t1, respectively, can be obtained. In accordance with the corresponding code grouping 302 performs a search for the corresponding codes of the corresponding code groups v and t (with corresponding code groups comprising one or more corresponding codes corresponding to the same home address). In this embodiment, the data z1 and z2 each contain 16 bits and all instructions, so that the image generating program 41 will interpret and execute the instructions. Subsequently, step 93 proceeds.

In step 93, the image generating program 41 in the image generating module 4 executes configuration instructions of the application instructions p1, p2 and the data z1, z2. In the embodiment, from the application instructions, when the graphs in the second picture are superimposed on the graphs in the first picture, the superimposed portions of the graphs in the first and second pictures are shown by the graphs in the first picture. Is realized. That is, the graphs in the second picture are relatively transparent relative to the graphs in the first picture within the overlapped portions of the graphs in the first and second pictures, respectively. By executing the configuration instructions of the data z1 and z2, respectively, a proportional distribution relationship between the graphs constituting the images, respectively, is obtained. In the above embodiment, from the configuration instructions of the data z1, z1, the two pictures are embodied so that they exist in the left-right pattern. That is, each of the two images includes a left half surface and a right half surface of the same size. Subsequently, step 94 proceeds.

In step 94, the image generating program 41 executes each of the shape instructions to realize the data shape. In this embodiment, one graph is obtained in the left half surface of each of the two images and another graph is obtained in the right half surface of each of the two images. Also the position and size of the two graphs are obtained. Then proceed to step 95.

In step 95, the image generating program 41 executes the graph commands to produce graphs for constructing each of the two images, so as to generate graphs / images. In this embodiment, as shown in Fig. 12, one hatched circle in the left half of the first image and one hatched triangle in the right half of the first image will be generated as shown in Fig. 14. In addition, hatched rectangles are generated in the left and right half faces of the second image, respectively. In the embodiment, the two pictures are superimposed, and the graphs in the second picture are relatively transparent relative to the graphs in the first picture in the overlapped portion of the graphs of the first and second pictures, respectively, so that the application instruction p1 , p2 may be performed, and the obtained superimposed image will be shown in FIG.

Although the embodiment includes simultaneously inputting two graph codes and two application instructions, the same principle applies also when two or more graph codes and application instructions are input at the same time. Therefore, it is not explained anymore here.

In addition, the above embodiment utilizing the indexing technique can be implemented in a similar manner without using the indexing technique to obtain the desired image, so the latter case is not described herein any further.

According to the embodiments described above, the graphics rendering system and method according to the present invention is applied to graph generation and image processing. When a graph code is entered into the graphics rendering system, it is analyzed by the graphics rendering system to find one or more data records corresponding to the graph code and provided by the data corresponding to the graph code. Decode the combination, structure, and ratio of graph / images from the graph code according to graph / image generation parameters corresponding to the information. As a result, the graphics rendering system does not need to use lookup table mapping to obtain graphics / images from an image database or configure graphs / images from the image database in an automated or manual manner. Generate and obtain the necessary graph images in accordance with image generation parameters. Therefore, according to the graphic rendering system and method according to the present invention, one graph code is input into the graphic rendering system, wherein the combination, structure, and ratio of graph / images are obtained according to information obtained by data corresponding to the graph code. It is decoded from the graph code. This allows the generation and acquisition of the necessary graphs / images. Thus there is no need to use lookup table mapping to obtain graphs / images from the image database, and there is no need to construct graphs / images from the image database in an automated or manual manner. Moreover, the graph code processing module in the graphic rendering system analyzes the graph code to find one or more data records corresponding to the graph code, and passes the one or more data records to the image generation module. . When the image generation module acquires the data, the acquired data are all in command form and are required to output complete graphs / images. Furthermore, the combination, structure, and ratio of graphs / images, as long as the gray code is present, do not need any lookup table and do not have to have graph codes for each of the graphs / images that essentially correspond to any graph / image in the image database. Can be decoded from the graph code, and the required graph / images can be generated and obtained depending on the graph / image generation parameters.

So far the present invention has been described using the preferred embodiments. However, it should be understood that the scope of the present invention is not limited to the disclosed embodiments. On the contrary, the invention is intended to cover various modifications and similar arrangements. Therefore, the following claims should be construed broadly to encompass all such modifications and similar constructions.

Claims (27)

In the graphic rendering method applied to the graphics rendering system for graph generation and image processing, Inputting at least one graph code into the graphics rendering system and analyzing the graph code to retrieve at least one data record corresponding to the input graph code; And After the graphic rendering system obtains the data necessary to output the completed graph / image and includes instructions, the graphic rendering according to the graph / image generation parameter to generate and obtain the requested graph / image. A second step of interpreting and executing the instructions through a system; Including, And the information provided by said data includes graph / image generation parameters. The method of claim 1, wherein the graph code, And an index code and a corresponding code. The method of claim 1, wherein the graph code, And a multi-layered structure of at least two layers, comprising an index code and a corresponding code. The method of claim 1, wherein the graphic code, And a classification prefix code and a classification prefix code. The method of claim 1, wherein the graph code, And a classification prefix code and a classification postfix code, said graphics rendering method having a multi-layered structure of at least two layers. The method of claim 1, The second step of acquiring the data and executing the instructions, Performing a search in an index table to retrieve a home address of a corresponding code group according to the index code using the graph code including an index code and a corresponding code; And The index table including index codes and home addresses of corresponding code groups corresponding to the same index codes, followed by corresponding code groups corresponding to the same index codes and corresponding codes in the corresponding code groups. Using the following data, a search is performed according to the home address in an index table for at least one corresponding code in the corresponding code group having a corresponding code group comprising one or more corresponding codes corresponding to the same home addresses Retrieving the requested corresponding code and obtaining data following the corresponding code; More, The acquired data includes command words, and the instructions are interpreted and executed by an image generating program. The method of claim 1, The second step of acquiring the data and executing the instructions, The combination graph is provided as a combination graph classification code, and includes a classification potential code and a classification trailing code, wherein each combination graph classification code uses a graph code respectively corresponding to an address where data corresponding to the combination graph classification code is stored. After a graph classification code is input, performing a search in an address table for searching a data address of a data area according to the combination graph classification code; And Performing a data search in a data area according to the data address to obtain at least one data record corresponding to the combination graph classification code; More, The address table includes a combination graph classification code and a data address of a data area, the data area includes data, the obtained data includes instructions, and the instructions are interpreted and executed by an image generating program. Characteristic graphics rendering method. The method of claim 1, The second step of acquiring the data and executing the instructions, An image generating program in the image generating module of the graphic rendering system, executing step 2-1 of executing a configuration command for obtaining a relation of proportional distribution between graphs constituting an image; Performing a shape command through the image generation program to identify a data structure; And A second to third step of executing a graph command for producing a graphic constituting the image to generate a graph / image through the image generating program; More, And wherein the shape command causes the graph data to be each bit structure processed by the image generating program prior to obtaining all the graph data. The method of claim 8, In the step 2-1 of executing the configuration command through the image generating program, Executing an application command through an image generating program in the image generating module; The application instruction provides an image parameter, and the image generation program determines a display state of at least one image displayed on a display image according to the image parameter. The method of claim 9, And a display state of the display image includes one of a combination of dual images, a separate display of images, and a continuous display of images. In the graphic rendering method applied to the graphics rendering system for graph generation and image processing, Input at least one graph code into the graphics rendering system, retrieve at least one data record corresponding to the graph code and transmit the retrieved at least one data record to an image generation module according to the information in the database Analyzing the input graph code through a graph code processing module in a rendering system; And Interpreting and executing the instructions through an image generating program in the image generating module after the image generating module obtains data that is requested to output a completed graph / image and includes instructions; Including, The information provided by the data includes a graph / image generation parameter, and the data, the configuration, structure and ratio of the graph / image, such that the image generation program generates the requested graph / image according to the graph / image generation parameter. Graphics rendering method. The method of claim 11, wherein the graph code, And an index code and a corresponding code. 12. The method of claim 11, wherein the graph code. And a multi-layered structure of at least two layers, comprising an index code and a corresponding code. The method of claim 11, wherein the graph code, And a classification prefix code and a classification prefix code. The method of claim 11, wherein the graph code, And a classification prefix code and a classification postfix code, said graphics rendering method having a multi-layered structure of at least two layers. The method of claim 11, The second step of acquiring the data and executing the instructions, Performing a search in an index table to retrieve a home address of a corresponding code group according to the index code using the graph code including an index code and a corresponding code; And The index table including index codes and home addresses of corresponding code groups corresponding to the same index codes, followed by corresponding code groups corresponding to the same index codes and corresponding codes in the corresponding code groups. Using the following data, a search is performed according to the home address in an index table for at least one corresponding code in the corresponding code group having a corresponding code group comprising one or more corresponding codes corresponding to the same home addresses Retrieving the requested corresponding code and obtaining data following the corresponding code; More, The acquired data includes command words, and the instructions are interpreted and executed by an image generating program. The method of claim 11, The second step of acquiring the data and executing the instructions, The combination graph is provided as a combination graph classification code, and includes a classification potential code and a classification trailing code, wherein each combination graph classification code uses a graph code respectively corresponding to an address where data corresponding to the combination graph classification code is stored. After a graph classification code is input, performing a search in an address table for searching a data address of a data area according to the combination graph classification code; And Performing a data search in a data area according to the data address to obtain at least one data record corresponding to the combination graph classification code; More, The address table includes a combination graph classification code and a data address of a data area, the data area includes data, the obtained data includes instructions, and the instructions are interpreted and executed by an image generating program. Characterized by a graphics rendering method. The method of claim 11, The second step of acquiring the data and executing the instructions, An image generating program in the image generating module of the graphic rendering system, executing step 2-1 of executing a configuration command for obtaining a relation of proportional distribution between graphs constituting an image; Performing a shape command through the image generation program to identify a data structure; And A second to third step of executing a graph command for producing a graphic constituting the image to generate a graph / image through the image generating program; More, And wherein the shape command causes the graph data to be each bit structure processed by the image generating program prior to obtaining all the graph data. The method of claim 18, In the step 2-1 of executing the configuration command through the image generating program, Executing an application command through an image generating program in the image generating module; The application instruction provides an image parameter, and the image generation program determines a display state of at least one image displayed on a display image according to the image parameter. 20. The method of claim 19, wherein the display state of the display image comprises one of a combination of dual images, a separate display of images, and a continuous display of images. In the graphic rendering system for graph generation and image processing, A database for storing at least one graph code containing information; In accordance with information corresponding to the graph code stored in the database to receive the graph code, retrieve at least one data record corresponding to the graph code, and send the retrieved at least one data record to an image generation module. A graph code processing module for analyzing the graph code; And Receive the data including instructions from the graph code processing module, obtain the configuration, structure and ratio of the graph / image from the graph code according to the graph / image generation parameters provided by the data and obtain the requested graph / image An image generation module for interpreting and executing the instructions to generate according to the graph / image generation parameter; Graphical rendering system comprising a. The method of claim 21, wherein the image generation module, Obtain the configuration, structure, and ratio of the graph / image from the graph code according to the graph / image generation parameter provided by the data transmitted from the graph code processing module and assign the requested graph / image to the graph / image generation parameter. And an image generating program for interpreting and executing the instructions to generate accordingly. The method of claim 21, wherein the database, An index table comprising index codes and home addresses of corresponding code groups corresponding to the same index codes; And A corresponding code grouping comprising data corresponding to the corresponding code groups corresponding to the same index codes and corresponding codes in the corresponding code groups; Graphical rendering system comprising a. The method of claim 21, wherein the database, An address table comprising combination graph classification codes and data addresses of a data area; And A data area containing data; Including, After a combination graph classification code is input, a search is performed in the address table to obtain a data address of the data area according to the combination graph classification code, and a search is performed in a data area to obtain data according to the data address. And obtaining the data corresponding to the combination graph classification code. The method of claim 23, wherein the database, An address table comprising combination graph classification codes and data addresses of a data area; And A data area containing data; More, After the combination graph classification code is input, a search is performed in the address table for obtaining a data address of the data area according to the combination graph classification code, and a search in a data area for obtaining data according to the data address is performed. And the data obtained corresponds to the combination graph classification code. The method of claim 21, And the graphic rendering system is a hardware chip. The method of claim 21, And the graphics rendering system is computer software stored in a memory device of the computer system.

Images