CN100578542C - Graphic processing system and method for storing texture data in graphic processing system - Google Patents
Graphic processing system and method for storing texture data in graphic processing system Download PDFInfo
- Publication number
- CN100578542C CN100578542C CN200710123324A CN200710123324A CN100578542C CN 100578542 C CN100578542 C CN 100578542C CN 200710123324 A CN200710123324 A CN 200710123324A CN 200710123324 A CN200710123324 A CN 200710123324A CN 100578542 C CN100578542 C CN 100578542C
- Authority
- CN
- China
- Prior art keywords
- texture
- tile
- texture tile
- grade
- mip
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Image Generation (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
Systems and methods for border color handling in a graphics processing unit are disclosed. In one embodiment, the system includes a border color register that stores at least one border color pointer. A border color pointer indicates an address in an external memory at which border color information is located. Border color information is populated within external memory and retrieved by the texture cache controller if the texture filter unit requires a border color for texture mapping operations.
Description
Technical field
The invention relates to graphics process, and particularly about the system and the method for graphical data operation.
Background technology
Background technology as is known, the computer graphical disposal system need be handled mass data, comprising texture (texture) data.Texture is have one (u, the v) digitized video of coordinate space (being generally rectangle).The I addressing unit of texture is texel (texel), is assigned specific (u, v) a coordinate according to its position.In texture (mapping) computing, the surface that texture is mapped to graph model presents model to set up the purpose image.In the purpose image, texel is positioned at (x, y) the preferred coordinate place in the coordinate system.The purpose of texture is for providing actual look on the surface of object.
Exist in the system storage in data texturing is common, system storage is a common source.In many computer systems, other elements may be attempted the data that access used by graphic system or utilize shared system bus, and two kinds of situations may cause the data time of graphic system to increase.In addition, request may spend the excessive time for other reasons from the data of system storage.Therefore, the access system storer may have the usefulness depression effect to graphic system.
In the modern computer figure, texture processing can comprise many dissimilar texture technology, comprises a cube mapping (cubic mapping), mip mapping (mipmapping) and the various opposite sex (anisotropic) mapping.Because it is very complicated and a large amount of to carry out texture processing required arithmetic and logical operation, make that the use of texture processing special circuit necessitates except the circuit that is used for other graphics process computings.Therefore, these texture processing special circuits can comprise the hardware gate (gate) of the formation Graphics Processing Unit of apparent number percent.
Texture must need be paid expensive cost on calculating and storage access.A kind of technology of improving data accessibility is via the texture quick access to memory that is exclusively used in the storing texture data, before data need be carried out texture processing, data texturing is offered the texture quick access to memory from system storage, provide graphics system required data texturing whereby, and reduce needs the access system storer.This mode can reduce again and the relevant problem of memory latency (latency).Yet, owing to management and the storage to data texturing is not very efficient, so even use the texture quick access to memory, memory latency still continues to become problem.Therefore, there are the needs that texture is improved in memory storage as brick (tile) data in the industry.
Summary of the invention
The form (slice-major format) that the embodiment that the present invention discloses is provided for based on texture tile compresses the also system and the method for storing texture diagram data (texture map data).
One embodiment of the present of invention comprise graphic system, and it comprises the texture administrative unit of basis based on format organization's texture maps data of texture tile, and wherein the texture maps data are crossed over a mip grade (mip level) at least.In addition, graphic system also comprises the texture quick access to memory, and wherein the texture quick access to memory is coupled to the texture administrative unit, and in order to receive the texture maps data through reorganization from the texture administrative unit.Wherein said texture administrative unit comprises: the data texturing formatter, in order to according to based on the texture tile in the described texture maps data of the format permutation of texture tile, the texture tile that wherein has identical mip grade is grouped and is stored in together, if have identical mip grade all described texture tile summation less than one the picture brick size, the described texture tile that then will have described identical mip grade is stored in the described picture brick; The calculation of parameter logic module is in order to calculate the parameter of each texture tile in the described texture maps data; And the address calculation logic module, calculate the memory cache address of each texture tile in the described texture maps data in order to use described parameter.
Another embodiment of the present invention is included in the method for storing texture diagram data in the graphic process unit, and described method can roughly be summarized by following steps: according to the texture tile grouping of mip grade with the texture maps data, the texture tile that wherein has identical mip grade is grouped and is stored in together; If the summation of the size of a plurality of described texture tile then is arranged in a plurality of texture tile in the described picture brick according to mode flags less than a picture brick; Calculating is about the parameter of each described texture tile of each mip grade; Calculate the storage address of each texture tile in the texture maps data according to previous step institute parameters calculated; And will be stored in the texture quick access to memory through the texture tile of reorganization.
Another embodiment of the present invention is included in the method for storing texture diagram data in the graphic process unit, and described method can roughly be summarized by following steps: in order to texture tile is the texture tile of master's form reorganization texture maps data, and the texture tile that wherein has the same detail grade is grouped and is stored in together; If have the same detail grade all texture tile total amount less than the picture brick size, the texture tile that then will have the same detail grade is stored in the same picture brick; Calculating is about the parameter of each texture tile, and wherein these parameters are to calculate at each detail grade; Base calculates the new memory address of each texture tile in the texture maps data according to institute's parameters calculated; And will be stored in the texture quick access to memory through the texture tile and the new memory address of reorganization.
When checking following graphic and embodiment, other system of the present invention, method, feature and benefit will be conspicuous for those skilled in the art or become apparent.All these additional system, method, feature and benefit are that intention is included in this description, in category of the present invention, and by claims protected of enclosing.
Description of drawings
Fig. 1 is the calcspar of the embodiment of multi-graphics processor system.
Fig. 2 illustrates some primary element of the data texturing management in the computer graphics system.
Fig. 3 is the calcspar of illustrative examples expressivity L2 memory cache organized formats.
32 textures of Fig. 4 illustrative examples expressivity are as brick.
Fig. 5 describes to be used to carry out the process flow diagram based on the embodiment of the compression method of texture tile as the brick data texturing.
Fig. 6 A explanation is used for the pattern 0 of the embodiment of Fig. 5.
Fig. 6 B explanation is used for the pattern 1 of the embodiment of Fig. 5.
Fig. 7 describes in order to texture tile, and to be main form be stored in embodiment in the texture quick access to memory with the volume textures pinup picture.
Fig. 8 describes to be used to carry out the process flow diagram based on another embodiment of the compression method of texture tile as the brick data texturing.
Embodiment
After having summarized various viewpoint of the present invention, existing will be in detail referring to as graphic in illustrated description of the invention.Though will graphicly describe the present invention in conjunction with these, and be not intended to the present invention is limited to disclosed one or more embodiment of this paper.Be included in the spirit of the present invention that defines by the claims of enclosing and in the category all substitute, modification and equipollent but be intended to contain.
Disclosed system of the present invention and method can be used for managing effectively and the tissue texture data so that (for example) texture filter when handling required any data texturing in graphic system, can be easy to acquisition.Usually, receive the data texturing of numerous different-formats and size, if do not take into account in the size of these data or the use that the composition mode may cause texture quick access to memory resource than inefficiency from system storage.This kind be inefficient leads therefore one and postpones for existing too much when the acquisition data texturing.Understandably, the acquisition texture causes delay in handling these data as the delay of brick data (texture tiling data).Therefore exist more efficiently storing texture as the needs of the system and the method for brick data, to reach fast processing graph data in the computer graphical environment.
Therefore, the present invention discloses according to the form based on texture tile and compresses the also system and the method for storing texture diagram data.Mip pinup picture (mipmap) typically refers to the predetermined gathering of the image of following main texture.The predetermined gathering of these images only is the duplicate of main texture low resolution.When observe from a distance particular artifact so that object and on every side texture become more hour, the mip pinup picture is useful.When observing the less version of object, can switch to a mip pinup picture image that is fit to based on level of resolution, to present the texture resolution that is fit to grade.Compare with real-time calculating,, reproduce the required time of object so use the mip pinup picture to reduce owing to only need search pre-fixing simply.
Each mip grade in the mip pinup picture chain all is assigned a detail grade, and (level ofdetail, LOD) value is with the indication level of resolution.The LOD value is high more, and image is more little and resolution is low more.Anticipate promptly, along with object is more and more far away apart from the observer, the complexity of object (for example in texture) thereupon diminishes.For the purpose of nomenclature used in the present invention, use interchangeably between term " detail grade " and the term " mip grade ".For given demonstration, may store a plurality of surfaces.Each of these surfaces is stored in a continuous manner.In addition, these surperficial texture maps data can Several Methods be stored.Lift a limiting examples, can be according to the form storing texture data of " based on mip ".That is the organizational form of the texture tile of data texturing is that first texture tile of each mip grade (for example, texture tile 0) is stored in together.Therefore, texture tile 0 of the texture tile 0 of the texture tile 0 of mip grade 1, mip grade 2, mip grade 3 etc. is stored in together all in a continuous manner.This process extends to next texture tile (for example texture tile 1) of all mip grades, or the like.Perhaps, can be according to the mip grade or with the form storing texture data of " based on texture tile ".Therefore, texture tile 2 of the texture tile 1 of the texture tile 0 of mip grade 1, mip grade 1, mip grade 1 etc. all is stored in together.Anticipate promptly, all texture tile with identical mip grade are stored in together all in a continuous manner.This process extends to all texture tile of next the highest mip grade, or the like.
Usually the texture maps data are to store according to the form based on mip.Embodiments of the invention concentrate on the method for form storing texture data of usefulness " based on texture tile ".As further described herein, embodiments of the invention pass through data " extruding " or compressed together, so that less texture tile does not occupy the interior whole texture of texture quick access to memory as brick, and then increased the efficient of acquisition data texturing, storage space whereby avoids waste.
Usually, texture tile is meant the 2D image that is used to reproduce the 3D object.Texel (texel) is the 2D point in the image, and is the fundamental construction piece (building block) that is used for the texture space of graphics process.Texel is usually by two coordinates (u and v) come addressing.Texture is represented by the array of texel usually.In the texture process, can carry out texture and seek to find out each texel center and where drop on go the texture.Because texturizing surfaces may be at any distance and place, orientation with respect to the observer, so a pixel is not usually directly corresponding to a texel, must use the optimum color that certain filtered version is determined pixel, yet invalid or incorrect filtration will present as finished image.
Usually, when volume (volume) texture mechanism was discussed, certain attributes was common.At first, when reproducing volume textures, on basis piecewise, reproduce each texture tile usually respectively.When reading a volume texture, usually with the moving direction of random fashion execution about grain surface.When specifying texture sample, three coordinates are assigned to 3D (three-dimensional) texture (that is, volume textures).The change of coordinate in each of three dimensions equates on probability usually.Therefore, the object probability that moves through a given texture tile is usually identical with object mobile probability in same texture tile.As an illustration, suppose that a 3D texture is by (r) coordinate space defines for u, v, and the change on u and the v direction can cause needing to sample, and the change on the r direction can cause needing to sample across a plurality of texture tile in given texture tile.Therefore, the texture tile that will be in the adjacency of identical mip grade as far as possible closely is stored in each other and is the preferable practice in the memory cache, so that allow more effective data acquisition.Ideally, these can be stored in same in the texture quick access to memory in abutting connection with texture tile and get soon in the page or leaf (page), and even in same fast line taking (line).Usually, the different views on particular texture surface will be contained the texture tile and the mip grade of certain quantity.Therefore, the reproduction target array of the texture tile that the generation of a view can be by comprising the mip grade of crossing over certain number is set up.As limiting examples, a certain view may comprise that texture tile 0 is to texture tile 5 and mip grade 1 to 3.Therefore, this view is encompassed in six texture tile and crosses over three different mip grades.Can be for assisting in ensuring that by the texture tile of certain integer and the mip grade intercepting particular figure of certain integer, data texturing can save as the array of 2D (two dimension) mip pinup picture.In addition, data texturing can be put in order to according to the mip grade texture tile being grouped in together and being stored.Therefore, all texture tile that are in a certain given mip grade can be stored in together, and all texture tile that are in next low mip grade also can be grouped and be stored in together.In this way, use the form storing texture sheet of " based on texture tile ".Though three dimensions (x, y, z) go up included texture tile and the number of the mip grade of being crossed over for arbitrarily, be generally 2 certain powers (power) of tieing up through the volume textures of mip mapping.As an example, volume textures figure may be 2048 * 2048 * 2048 or 211 * 211 * 211 pixels.At least one benefit of some embodiment described herein is that data texturing can be subjected to preferable management and storage according to the above characteristic of discussing.
Now referring to Fig. 1, it illustrates the simplification calcspar of computer system 100.Computer system 100 comprises CPU 102, system storage 104 and graphic system 110.CPU 102 can carry out various functions, comprises determining to produce the information (such as the observation point position) of graphic presentation.System storage 104 stores various data, comprises the graphic display data such as data texturing 106.Based on CPU 102 determined information and in system storage 104 stored data, graphic system 110 produces and is used for display device 130 video data of (such as, monitor).Texture is used for object is added texture.Graphic system 110 is reproduced the texture tile of 3D object, and texture tile is got up to form object through " piling up " basically.In case set up the 3D texture, just texture is added into object to form image, make object be able to veining whereby.
CPU 102 files a request to graphic system 110 via system interface 108, comprises the also request of display graphics information of handling.Figure request from CPU 102 receives and offers front end (front end) processor 112 by graphic system 110, and front-end processor 112 produces the pixel stream that contains pixel coordinate.
The information about pixel coordinate that front-end processor 112 produces provides to texture filter 118 via data texturing administrative unit 114 and texture quick access to memory system 116.Data texturing administrative unit 114 is from front-end processor 112 reception information, and organizes data data being sent to texture quick access to memory system 116 before storing.
Texture filter 118 is subsequently by carrying out (for example) bilinear filtering, Trilinear Filtering or its data texturing that makes up filtering information and produce each pixel.Except that known texture filter element (such as linear interpolation and totalizer), texture filter 118 also comprises that programmable table filtrator (table filter) is to provide the particular filter operation in conjunction with other texture filter elements.Data texturing is the component that is sent to the final color data of frame buffer 120, and it is used for producing show image on display device 130.
Texture quick access to memory system 116 can comprise a plurality of memory caches, comprises (for example) grade 1 (L1) memory cache and grade 2 (L2) memory cache.Texture information is stored with each texel, and texel is used to be defined in the color data that the pixel coordinate place shows during graphics process.Data texturing flow to data texturing administrative unit 114 from system storage 104, and flow to texture quick access to memory system 116 subsequently, flow to texture filter 118 again.Should notice that for some embodiment data texturing administrative unit 114 can be incorporated in the texture quick access to memory system 116.
Now referring to Fig. 2, it illustrates some primary element of the data texturing administrative unit in computer graphics system.Should note having omitted for describing non-essential some element of data texturing administrative unit for concise and to the point purpose.Computer graphics system 210 comprises that data are compressed and reorganization before being forwarded to texture quick access to memory system 116 in order to receive the data texturing administrative unit 212 of data texturing 106.For some embodiment, data texturing administrative unit 212 comprises data texturing formatter 218, calculation of parameter logic module 220 and address calculation logic module 214.
Briefly referring to Fig. 3, it is the calcspar of the L2 memory cache organized formats of an embodiment.As previously discussed, texture quick access to memory system 116 can comprise a plurality of memory caches, comprises (for example) L1 memory cache and L2 memory cache.L2 memory cache 310 can comprise a plurality of L2 pages or leaves 315, and each page or leaf 315 can be divided into a plurality of L2 data lines 320, and each L2 data line 320 is further divided into even number block 340 and odd number block 330.Even number block 340 is used to handle the data texturing from even number pipeline or fast line taking, and odd number block 330 is used to handle the data texturing from odd number pipeline or fast line taking.In in odd number block 330, even number block 340 each, L2 is divided into thesaurus (bank) 350 again.Although each block that is disclosed as comprises two thesauruss, it will be understood by a person skilled in the art that memory cache can comprise more or less thesaurus.Although the L2 data line 320 shown in should noting comprises 2 blocks, 4 thesauruss and 8 pages or leaves, it will be understood by a person skilled in the art that with given example to have the memory cache of block, thesaurus, page or leaf and passage of different frameworks still in the category of this disclosure.In addition, L2 memory cache 310 can comprise a plurality of L2 data lines 320, comprises (for example) 64,128,256 or 512.In addition, each L2 data line 320 can have the width of variation, comprises the width of (for example) 128,256,512,1024 or 2048 positions.
Now referring to Fig. 4, it is that the texture of 32BPP (position/pixel) of an embodiment is as brick (hereinafter to be referred as the picture brick).Each page or leaf 360 among Fig. 4 further is divided into a plurality of picture bricks.With example explanation, each of showing among Fig. 4 is 16kB as brick 420, each further is divided into a plurality of passages again as brick 420.In the example of being showed, comprise 8 * 8 arrangement of passages as brick 420, totally 64 passages are numbered Ch 0 to Ch 63.At last, each passage 430 further is divided into each texel again.In the example of being showed, each passage 430 comprises that 8 * 8 texel of 64 texel altogether arranges.For the disclosed embodiment of this paper, the texture tile in the texture maps data is stored in the picture brick 420.
Referring again to Fig. 2, data texturing formatter 218 receives data texturing 106 and comes tissue texture to help that data are captured more efficient methods in the future.The texture tile that data texturing formatter 218 is arranged in the data texturing is grouped in together so that be in the texture tile of identical mip grade.Texture tile is arranged according to cumulative mip grade (that is, level of resolution decrescence).With the method, texture tile is arranged according to the form of " based on texture tile ".In addition, in this way with the texture tile " extruding " of data texturing or be compressed in the picture brick, so that do not occupy each as brick and stay untapped storage space less than each texture tile as the brick size.Therefore, if all texture tile of a given mip grade can hold to single picture brick, then only be used for storing all texture tile of compressed this mip grade as brick with one.
As if in order to texture tile being main form reorganization data texturing and it is compressed together, just can determine and the interior relevant parameter of each texture tile of each mip grade by calculation of parameter logic module 220.These parameters are used for determining the address of each texture tile in the data texturing that reorganization is arranged after a while, so that information can capture from the texture quick access to memory in the future.Each of 220 pairs of following parameters of all mip rating calculation of calculation of parameter logic module: all texture tile sizes, texture width, texture height, texture tile index number (index, N), x of first texture tile (that is, texture tile 0) and y skew and x value of striding (stride value).The value of all texture tile sizes is for storing the required number as brick of all texture tile with same detail grade.All texture tile in a certain given mip grade can be " squeezed. " or be compressed under the situation of single picture brick, and all texture tile sizes values are set at zero so that indicate this kind configuration.In case after the value of all parameters is calculated and finished, just will be worth to pass and send to address calculation logic module 214.Address calculation logic module 214 these values of reception and calculating comprise the address of all texture tile of data texturing, so that these data can extracted from texture quick access to memory system 116 in the future.
Address calculation logic module 214 is calculated following parameter: (x, y) the required total number as brick of all texture tile in coordinate and the storing texture diagram data of each texture tile of the x of residue texture tile and y skew, each mip grade.In case reset all data texturings and determined new address information, just prepared the storing texture data.New (x, y) coordinate and can be passed the texture quick access to memory system 116 that send to each mip rank correlation as the total number of brick.Data texturing administrative unit 114 is coupled to texture quick access to memory system 116.Should be appreciated that it is main form compression and tissue that the data texturing that is stored in the texture quick access to memory now needs in order to texture tile, so that reduce the access time and finally reduce memory latency.
In addition, because the effective storage of data texturing in storer, the required amount of computational resources of acquisition data is reduced.Also should be appreciated that because texture tile is aimed at suitable storage address, so the required address calculation logic module of acquisition data is simplified.Finally, the present invention discloses a kind of substituted volume texture mapping form, and it can use by the identical parameters that is used for the volume textures pinup picture well known by persons skilled in the art and be implemented.The form of this alternative texture mapping form is based on based on the form of texture tile.
Fig. 5 describes to be used to carry out the process flow diagram based on the embodiment of the compression method of texture tile of texture as the brick data.In following steps, can determine various parameters, it is the address of each texture tile of piecing the storage of (tiling) form together of master in order to texture tile that described parameter is used to calculate according to some embodiment subsequently.With the method storing texture sheet effectively, so that more efficient data access is provided.The big I of maximum volume texture is set at size 2k * 2k * 2k among some embodiment.For some embodiment, can be set at a predetermined number (such as 12) by maximum number and further simplify address computation the mip grade.For following parameter is to come calculating parameter at each mip grade.For the purpose of the employed nomenclature of this paper, index number N is the number that is used to refer to texture tile.In addition, index number d is used to refer to the mip grade.As limiting examples, Slice[0] [d] be meant the texture tile [0] that is in mip grade d.
As the width of brick and highly be to measure, and measure resolution according to BPP (bit perpixel, the position of every pixel) with pixel.For the purpose of the employed nomenclature of this paper, term BPP can use interchangeably with term BPE (bit per element, the position of every element).Each BPP value will have corresponding picture brick width and picture brick height.As limiting examples, 32 BPP value (position/pixel) is corresponding to the picture brick width (TileWidth) of 64 pixels and the picture brick height (TileHeight) of 64 pixels.Following table 1 explanation is for the difference of various BPP values as the brick width and highly:
Table 1 is for the TileWidth and the TileHeight value of various BPE values
| BPE | TileWidth | eTW | TileHeight | eTH |
| 128 | 32 | 5 | 32 | 5 |
| 64 | 64 | 6 | 32 | 5 |
| 32 | 64 | 6 | 64 | 6 |
| 16 | 128 | 7 | 64 | 6 |
| 8 | 128 | 7 | 128 | 7 |
| 4 | 256 | 8 | 128 | 7 |
| 1 | 512 | 9 | 256 | 8 |
Parameter eTW in the table 1 is corresponding to the required figure place of expression TileWidth.For example, need 5 to store TileWidth value 32.Equally, parameter eTH is corresponding to the required figure place of expression TileHeight.As following further argumentation, parameter eTW and eTH are used for bitwise operation (bit-wise operation).Should note the disclosed embodiment for this paper, the BPE value will be for specific.Based on this value, just know corresponding picture brick width and height.
Method starts from step 510, according to the mip grade texture tile in the texture maps is divided into groups.Then, in step 520, a plurality of texture tile are arranged in the same picture brick according to mode flags.In step 530, at the parameter of each mip rating calculation: all texture tile sizes (to represent), texture width, texture height and texture tile index number as the brick number about each texture tile.The value of texture tile size is the size of the size of all texture tile of null representation less than the picture brick.In the case,, make texture tile not occupy whole picture brick individually, and also do not stay untapped storage space, so that this is treated to is preferable as the storage of brick data texturing further " extruding " or be compressed in the single picture brick.If the summation of all texture tile of a certain mip grade greater than a picture brick, is then aimed at they's texture tile with the picture brick, and calculate the number that stores the required picture brick of these texture tile.Otherwise, if the summation of determining all texture tile is less than a picture brick, then texture width and height value are aimed at two exponential (power), and the value of all texture tile sizes is set at zero, with indication a plurality of texture tile can be stored or " extruding " in single picture brick.Above parameter can be calculated at each mip grade, and the number of mip grade is with the size of apparent volume texture mapping and decide.As limiting examples, suppose the volume textures size is set at the size of 2k * 2k * 2k, then can be at d=0 to 11, totally 12 mip grades are calculated parameter described above.
Calculate following parameter: slice[0 subsequently] x skew, the slice[0 of (that is, first texture tile of each mip grade)] y skew and the x value of striding.Should notice the value of these parameters will be decided on which kind of pattern of selection.In the embodiment of Fig. 5, two kinds of main patterns can be used for carrying out the storage based on texture tile of texture as the brick data, as indicated by mode flags.In first pattern (that is, pattern=0), first texture tile of each mip grade d (that is, slice[0]) do not aim at zero.Anticipate promptly the slice[0 of each mip grade] do not aim at the leftmost border as brick of storing texture sheet.In second pattern (that is, pattern=1), first texture tile of each mip grade d (that is, slice[0]) aim at zero.Anticipate promptly the slice[0 of each mip grade] aim at the leftmost border as brick of storing texture sheet.Referring to Fig. 6 A and 6B, its explanation is used for two kinds of patterns of the embodiment of Fig. 5 briefly.In Fig. 6 A, show, do not aim at the leftmost border of picture brick 610 as first texture tile of each mip grade in the brick bat 610 (that is, slice[0]).This situation is corresponding to pattern 0.On the contrary, Fig. 6 B first texture tile of showing each mip grade is aimed at the leftmost border of picture brick 620.This situation is corresponding to pattern 1.Should be appreciated that the number of texture tile that the visual representation object is required and mip grade and use more or less texture tile.
Referring again to Fig. 5, the x value of striding is to look what pattern (pattern 0 or pattern 1) to be currently used for texture calculating based on the storage of texture tile as the brick data.If utilize pattern 0, the value of using x skew (pass through XoffsetMipSlice[0] [d] expression) and calculating x and stride (by following XStrideMip[d] expression) as brick width, eTW based on following relational expression then:
XStrideMip[d]=(1＜＜eTW)-XOffsetMipSlice[0] [d]; Pattern 0
Operator "＜＜" is represented shift left operation by turn.If utilize pattern 1 (that is, the slice[0 of each mip grade wherein] aim at), then be worth XStrideMip[d with the leftmost border of picture brick] only equal to look like the value (seeing in the above table 1) of brick width (TileWidth).
Parameter X OffsetMipSlice[0] skew of first texture tile (that is slice[0]) on directions X of a certain mip grade d of [d] expression.In addition, value YOffsetMipSlice[0] slice[0 of a certain mip grade d of [d] expression] skew on the Y direction.Using the slice[0 of each mip grade] under the situation of (first texture tile) pattern 1 of aiming at the leftmost border of pixel brick, the value that x is offset is set to zero; Otherwise, use previous x value of striding of calculating to calculate the value of x skew.In addition, if the value of x skew is not an exponential texture pixel of two, then value is rounded to exponential value near two.For the value of x skew, calculate XOffsetMipSlice[0 based on following relational expression subsequently] [d]:
For pattern 1, XOffsetMipSlice[0] [d]=0
For pattern 0, XOffsetMipSlice[0] [d]=
XOffsetMipS lice[0][d]-1+(N[d-1]＜＜ew[d-1])&((1＜＜eXStrideMip[d]-1)-1)
Also consider that alignment pattern is that pattern 0 or pattern 1 are come calculated value YOffsetMipSlice[d].If utilize pattern 1, then come determined value YOffsetMipSlice[d by following relational expression]:
For pattern 1, YOffsetMipSlice[0] [d]=
YOffsetMipSlice[0][d-1]+(((N[d-1]＜＜ew[d-1])+(1＜＜eTW)-1)＞＞eTW)＜＜eh[d-1]
For pattern 0, YOffsetMipSlice[0] [d]=
YOffsetMipSlice[0][d]＝YOffsetMipSlice[0][d-1]+(n[d-1]＜＜(ew[d-1]+eh[d-1]-eXStrideMip[d-1]))
In step 540, calculate the storage address of each texture tile in the texture maps based on above institute parameters calculated.Subsequently at the skew of each texture tile N of x and a certain mip grade of y direction calculating.As discussed above, parameter X OffsetMipSlice[N] indication a certain mip grade the skew of texture tile N on directions X.In addition, value YOffsetMipSlice[N] be the skew of texture tile N on the Y direction of a certain mip grade.These skews are used to calculate new (x, y) coordinate of each texture tile.Make the slice[0 of each mip grade] skew on x and y direction and storage address zero or be that the address of two exponential is aimed at.For the skew on the x direction is zero embodiment, (each mip grade) slice[0] will always aim at the left margin of picture brick.In addition, the x value of striding will equal picture brick width TileWidth.Finally, should note if the size of a plurality of texture tile less than a picture brick, then with they's texture tile " extruding " or be compressed in the single picture brick, so that each texture tile can not occupy whole picture brick separately.In order to texture tile is that main mode is carried out compression, and the texture tile that wherein will have identical mip grade point is grouped in together.Finally, in step 550, the texture tile through resetting is stored in the texture quick access to memory to be used for acquisition in the future.
Referring to Fig. 6 A, its explanation is used to calculate the different parameters of the address of each texture tile that is in different mip grades.The slice[0 of each mip grade] skew can aim at zero or aim at the address value that is two exponential.In specific words, can indicate the purpose of two kinds of different modes to be used to store.Pattern 0 can be used for indicating the slice[0 of each mip grade] do not aim at zero (that is, do not aim at the leftmost border of picture brick).
Now referring to Fig. 7, it describes to be used for the volume textures pinup picture is that main form is stored in the embodiment in the texture quick access to memory in order to texture tile.As demonstrated, be main form storing texture sheet in order to texture tile, the texture tile that wherein is in identical mip grade is stored in together in a continuous manner.Also should be appreciated that texture tile " extruding " or compressed together, so that can not occupy whole picture brick, thereby stay the storage space of waste less than each texture tile as brick.As depicted in figure 7, texture tile also is stored in the interior continuous page (page N is to the page (N+2)) of texture quick access to memory.As earlier discussed, the texture tile that will be in identical mip grade in storer closely is stored in and is generally useful together, texture tile preferably can be stored in same get soon in the page and even be stored in the same fast line taking (if may), so can accelerate data access and finally cause the minimizing of memory latency.
Fig. 8 describes to be used to carry out the process flow diagram based on another embodiment of the compression method of texture tile as the brick data texturing.Method starts from step 810, and the texture tile in the texture maps data is reset according to the form based on texture tile.Then, in step 820, look like the brick size if having the big or small summation of all texture tile of same detail grade less than one, the texture tile that then will have the same detail grade is stored in the picture brick.In step 830, calculate parameter about each texture tile.In step 840, calculate the new memory address of each texture tile in the texture maps data subsequently according to institute's parameters calculated in the step 830.Finally, in step 850, the texture tile through resetting is stored in the texture quick access to memory together with new storage address.
Can understand as those skilled in the art, the logic that any processing description in the process flow diagram or step are interpreted as representing to comprise one or more executable instruction of implementing specific logical function, the fragment or the part of procedure code, and alternate embodiment is included in the category of preferred embodiment of the present invention, and is wherein visual included functional and showed to be different from or the order discussed is carried out function (comprise in fact simultaneously or backward is carried out).
In addition, should emphasize that embodiment described above only is the example of possible embodiment.Under the situation that does not deviate from principle of the present invention, can carry out many variations and modification to embodiment described above.All these modifications and variation are intended to be included in the category of the present invention and by claims in this article to be protected.
For example, based on description provided by the present invention, it will be understood by a person skilled in the art that embodiment comprises Graphics Processing Unit, Graphics Processing Unit comprises the texture administrative unit, the texture administrative unit is in order to come the tissue texture diagram data according to the form based on texture tile, and wherein the texture maps data are crossed at least one mip grade.In addition, graphic system comprises the texture quick access to memory, and wherein the texture quick access to memory is coupled to the texture administrative unit, and in order to receive the texture maps data through reorganization from the texture administrative unit.
In certain embodiments, Graphics Processing Unit more comprises the data texturing formatter, and its basis is based on the texture tile in the format permutation texture maps data of texture tile; The calculation of parameter logic module, it is in order at each the texture tile calculating parameter in the texture maps data; And the address calculation logic module, it determines the memory cache address of each texture tile in the texture maps data in order to use institute's parameters calculated.
In other embodiments, the data texturing formatter further can be in order to be stored in a plurality of texture tile in the same picture brick under as the situation of brick less than one in texture tile.In other embodiments, the data texturing formatter can be according to the texture tile in pattern 0 or the pattern 1 arrangement texture maps data, wherein first texture tile of pattern 0 each mip grade of indication is aimed at the leftmost border of the picture brick of storing texture sheet, and wherein first texture tile of pattern 1 each mip grade of indication is not aimed at the leftmost border as brick of storing texture sheet.
In other embodiments, parameter comprises the texture tile index number with texture tile size, texture width, texture height and each texture tile of representing as the brick number.For some embodiment, parameter more comprises the x skew of texture tile 0, and it indicates the address offset of first texture tile on the x direction of each mip grade; The y skew of texture tile 0, it indicates the skew of first texture tile on the y direction of each mip grade; And the x value of striding, it indicates the overall width of each set of the texture tile of each mip grade.For some embodiment, be at each mip rating calculation parameter.For some embodiment, if pattern is 1, then the x offset setting with first texture tile is 0.For some embodiment, if pattern is 0, then the x skew with first texture tile is rounded to two exponential.For some embodiment, the memory cache address of each texture tile in the texture maps data comprises new value x, and it indicates the x coordinate of each texture tile; New value y, it indicates the y coordinate of each texture tile; And picture brick index number, the total number of the required picture brick of all texture tile in its indication storing texture diagram data.
According to other embodiments of the invention, be provided for the method for storing texture diagram data in graphic process unit, and method can roughly be summarized by following steps: be grouped in together according to the texture tile of mip grade with the texture maps data; According to mode flags a plurality of texture tile are arranged in the same picture brick; Calculating is about the parameter of each texture tile of each mip grade; Calculate the storage address of each texture tile in the texture maps data according to institute's parameters calculated; And the texture tile through resetting is stored in the texture quick access to memory.
In certain embodiments, arrange texture tile and more be included in mode flags and be set under 1 the situation, aim at first texture tile of each mip grade along the leftmost border as brick of storing texture sheet.In some embodiment, the mode of arranging texture tile more is included in mode flags and is set under 0 the situation, along first texture tile of accurate each the mip grade of rightmost bound pair of the last texture tile in next low mip grade.In certain embodiment, calculating parameter comprises calculating texture width; Calculate the texture height; Calculate each texture tile size as brick; Calculate the texture tile index number of each texture tile; Calculate the x skew of texture tile 0, it indicates the address offset of first texture tile on the x direction of each mip grade; Calculate the y skew of texture tile 0, it indicates the address offset of first texture tile on the y direction of each mip grade; And calculating the x value of striding, it indicates the overall width of each set of the texture tile of each mip grade.For some embodiment, the storage address of calculating each texture tile in the texture maps data comprises calculates new value x, and it indicates the x coordinate of each texture tile; Calculate new value y, it indicates the y coordinate of each texture tile; And calculate as the brick index total number of the picture brick that all texture tile in its indication storing texture diagram data are required.
According to other embodiments of the invention, be provided for the method for storing texture diagram data in graphic process unit, and method can roughly be summarized by following steps: in order to texture tile is the texture tile that main form is reset the texture maps data, and the texture tile that wherein has the same detail grade is grouped in together; If the summation of all texture tile with same detail grade is less than the size of a picture brick, the texture tile that then will have a same detail grade is stored in the picture brick; At the parameter of each detail grade calculating about each texture tile; Calculate the new memory address of each texture tile in the texture maps data according to institute's parameters calculated; And texture tile and the new memory address through resetting be stored in the texture quick access to memory.
For some embodiment, the parameter of calculating about each texture tile comprises that calculating stores the number of the required picture brick of all texture tile with same detail grade; Calculate the size of texture; Calculate the texture tile index number of each texture tile; Calculate the x skew of texture tile 0, it indicates the address offset of first texture tile on the x direction of each detail grade; Calculate the y skew of texture tile 0, it indicates the address offset of first texture tile on the y direction of each detail grade; And calculating the x value of striding, it indicates the overall width of each set of the texture tile of each detail grade.For some embodiment, the texture tile that will have the same detail grade is stored in one as more comprising edge first texture tile as accurate each detail grade of rightmost bound pair of brick in the brick.For some embodiment, the texture tile that will have the same detail grade is stored in one as more comprising in the brick: first texture tile of aiming at each detail grade is immediately following after the last texture tile of next low detail grade.For some embodiment, calculating new memory address comprises each (x, y) the required total number as brick of all texture tile in coordinate and the calculating storing texture diagram data through the rearrangement texture tile that calculates each mip grade.
Being simply described as follows of symbol in the accompanying drawing:
100: computer system
102：CPU
104: system storage
106: data texturing
108: system interface
110: graphic system
112: FEP
114: the data texturing administrative unit
116: the texture quick memory system
118: texture filter
120: frame buffer
130: display device
210: computer graphics system
212: the data texturing administrative unit
Claims (12)
1. graphic system is characterized in that it comprises:
The texture administrative unit, in order to the format organization texture maps data of basis based on texture tile, wherein said texture maps data are crossed at least one mip grade; And
The texture quick access to memory, wherein said texture quick access to memory is coupled to described texture administrative unit, and in order to receive the described texture maps data behind tissue from described texture administrative unit;
Wherein said texture administrative unit comprises:
The data texturing formatter, in order to according to based on the texture tile in the described texture maps data of the format permutation of texture tile, the texture tile that wherein has identical mip grade is grouped and is stored in together, if have identical mip grade all described texture tile summation less than one the picture brick size, the described texture tile that then will have described identical mip grade is stored in the described picture brick;
The calculation of parameter logic module is in order to calculate the parameter of each texture tile in the described texture maps data; And
The address calculation logic module is calculated the memory cache address of each texture tile in the described texture maps data in order to use described parameter.
2. graphic system according to claim 1 is characterized in that, described data texturing formatter is arranged texture tile in the described texture maps data according to a pattern 0 or a pattern 1,
First texture tile of wherein said pattern 0 each described mip grade of expression is aimed at the leftmost border of the described picture brick that stores described texture tile; And
Described first texture tile of wherein said pattern 1 each described mip grade of expression is not aimed at the described leftmost border of the described picture brick that stores described texture tile.
3. graphic system according to claim 1 is characterized in that, described parameter comprises:
The texture tile size of calculating with the number of described picture brick;
The texture width;
The texture height;
The texture tile index number of described each texture tile;
The x skew of texture tile 0, it indicates the address offset of first texture tile on the x direction of each described mip grade;
The y skew of texture tile 0, it indicates the address offset of described first texture tile on the y direction of each described mip grade; And
The x value of striding, it indicates the overall width of each set of the texture tile of each described mip grade;
Wherein said parameter is calculated at each described mip grade.
4. graphic system according to claim 1 is characterized in that, the described memory cache address of each texture tile in the described texture maps data comprises:
New value x, the x coordinate of described each texture tile of its indication;
New value y, the y coordinate of described each texture tile of its indication; And
Picture brick index number, its indication store the required total number as brick of all described texture tile in the described texture maps data.
5. the method for a storing texture diagram data in graphic process unit is characterized in that it comprises:
According to the texture tile grouping of mip grade with the texture maps data, the texture tile that wherein has identical mip grade is grouped and is stored in together;
If the summation of the size of a plurality of described texture tile then is arranged in a plurality of described texture tile in the described picture brick according to mode flags less than a picture brick;
Parameter at each each described texture tile of mip rating calculation;
Storage address according to each texture tile in the described texture maps data of described calculation of parameter; And
To be stored in the texture quick access to memory through the described texture tile after arranging.
6. according to claim 5 in graphic process unit the method for storing texture diagram data, it is characterized in that, arrange texture tile and more be included in described mode flags and be set under 1 the situation, aim at first texture tile of each mip grade along the leftmost border of the described picture brick that stores described texture tile; Be set in described mode flags under 0 the situation, along first texture tile of accurate each the mip grade of rightmost bound pair of the last texture tile in next low mip grade.
7. according to claim 5 in graphic process unit the method for storing texture diagram data, it is characterized in that calculating parameter comprises:
Calculate the texture width;
Calculate the texture height;
Calculating texture tile size, the value of described texture tile size is the number of the required picture brick of all texture tile that store described each mip grade;
Calculate the texture tile index number of each texture tile;
Calculate the x skew of texture tile 0, it indicates the address offset of first texture tile on the x direction of each mip grade;
Calculate the y skew of texture tile 0, it indicates the address offset of described first texture tile on the y direction of each mip grade; And
Calculate the x value of striding, it indicates the overall width of each set of the texture tile of each mip grade.
8. according to claim 5 in graphic process unit the method for storing texture diagram data, it is characterized in that the storage address of calculating each texture tile in the described texture maps data comprises:
Calculate new value x, it indicates the x coordinate of each texture tile;
Calculate new value y, it indicates the y coordinate of each texture tile; And
Calculating is as the brick index number, and its indication stores the required total number as brick of all described texture tile in the described texture maps data.
9. the method for a storing texture diagram data in graphic process unit is characterized in that it comprises:
According to based on the texture tile in the format permutation texture maps data of texture tile, the texture tile that wherein has the same detail grade is grouped and is stored in together;
If have described same detail grade all described texture tile summation less than one the picture brick size, the described texture tile that then will have described same detail grade is stored in the described picture brick;
Calculating is about the parameter of each texture tile, and wherein said parameter is to calculate at each detail grade;
New memory address according to each texture tile in the described texture maps data of described calculation of parameter; And
Described texture tile and new memory address through arranging are stored in the texture quick access to memory.
10. according to claim 9 in graphic process unit the method for storing texture diagram data, it is characterized in that the parameter of calculating about each texture tile comprises:
Calculate and store the required number of all texture tile as brick with described same detail grade;
Calculate the size of described texture maps data;
Calculate the texture tile index number of each texture tile;
Calculate the x skew of texture tile 0, it indicates the address offset of first texture tile on the x direction of each detail grade;
Calculate the y skew of texture tile 0, it indicates the address offset of described first texture tile on the y direction of each detail grade; And
Calculate the x value of striding, it indicates the overall width of each set of the texture tile of each detail grade.
11. according to claim 9 in graphic process unit the method for storing texture diagram data, it is characterized in that, the described texture tile that will have a described same detail grade be stored in described as more comprise in the brick following manner one of them:
First texture tile along accurate each detail grade of the rightmost bound pair of described picture brick; And
Aim at first texture tile of each detail grade, so that described first texture tile is immediately following after the last texture tile of next low detail grade.
12. according to claim 9 in graphic process unit the method for storing texture diagram data, it is characterized in that, calculate the new memory address and comprise:
Calculate x, the y coordinate of each texture tile of each mip grade through arranging; And
Calculate the required total number of all described texture tile that stores in the described texture maps data as brick.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US81505306P | 2006-06-20 | 2006-06-20 | |
| US60/815,053 | 2006-06-20 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101122997A CN101122997A (en) | 2008-02-13 |
| CN100578542C true CN100578542C (en) | 2010-01-06 |
Family
ID=39022707
Family Applications (3)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2007101120142A Pending CN101145239A (en) | 2006-06-20 | 2007-06-19 | Graphics processing unit and method for border color handling |
| CN200710123324A Active CN100578542C (en) | 2006-06-20 | 2007-06-20 | Graphic processing system and method for storing texture data in graphic processing system |
| CN2007101233278A Active CN101114376B (en) | 2006-06-20 | 2007-06-20 | Method for reducing memory collision and computer system for processing graphics |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2007101120142A Pending CN101145239A (en) | 2006-06-20 | 2007-06-19 | Graphics processing unit and method for border color handling |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101233278A Active CN101114376B (en) | 2006-06-20 | 2007-06-20 | Method for reducing memory collision and computer system for processing graphics |
Country Status (2)
| Country | Link |
|---|---|
| CN (3) | CN101145239A (en) |
| TW (3) | TWI395152B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8368701B2 (en) * | 2008-11-06 | 2013-02-05 | Via Technologies, Inc. | Metaprocessor for GPU control and synchronization in a multiprocessor environment |
| TWI474280B (en) * | 2010-04-21 | 2015-02-21 | Via Tech Inc | System and method for improving throughput of a graphics processing unit |
| US9230517B2 (en) | 2012-05-31 | 2016-01-05 | Microsoft Technology Licensing, Llc | Virtual surface gutters |
| DE102015115605A1 (en) * | 2014-09-16 | 2016-03-17 | Jeffrey A. Bolz | Techniques for passing on dependencies in an API |
| CN106611401B (en) | 2015-10-22 | 2020-12-25 | 阿里巴巴集团控股有限公司 | Method and device for storing image in texture memory |
| CN112381715B (en) * | 2020-11-16 | 2024-04-09 | 航天科工(北京)空间信息应用股份有限公司 | Method and device for parallel generation of map tiles by mass remote sensing images |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1564203A (en) * | 2004-04-12 | 2005-01-12 | 浙江大学 | Fast drawing forest method of graded hierarchical assembling depth paste-up atlas |
| CN1625757A (en) * | 2002-02-01 | 2005-06-08 | 皇家飞利浦电子股份有限公司 | Stepless 3d texture mapping in computer graphics |
| CN1624723A (en) * | 2003-02-21 | 2005-06-08 | 威盛电子股份有限公司 | Single level MIP filtering algorithm for anisotropic texturing |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5765182A (en) * | 1995-04-13 | 1998-06-09 | Lsi Logic Corporation | Interleaving memory on separate boards |
| US5828382A (en) * | 1996-08-02 | 1998-10-27 | Cirrus Logic, Inc. | Apparatus for dynamic XY tiled texture caching |
| US6552723B1 (en) * | 1998-08-20 | 2003-04-22 | Apple Computer, Inc. | System, apparatus and method for spatially sorting image data in a three-dimensional graphics pipeline |
| US6300953B1 (en) * | 1998-10-15 | 2001-10-09 | Nvidia | Apparatus and method for grouping texture cache requests |
| US6266733B1 (en) * | 1998-11-12 | 2001-07-24 | Terarecon, Inc | Two-level mini-block storage system for volume data sets |
| US7050063B1 (en) * | 1999-02-11 | 2006-05-23 | Intel Corporation | 3-D rendering texture caching scheme |
| US6650333B1 (en) * | 1999-06-09 | 2003-11-18 | 3Dlabs Inc., Ltd. | Multi-pool texture memory management |
| US6825848B1 (en) * | 1999-09-17 | 2004-11-30 | S3 Graphics Co., Ltd. | Synchronized two-level graphics processing cache |
| US7053904B1 (en) * | 2003-12-15 | 2006-05-30 | Nvidia Corporation | Position conflict detection and avoidance in a programmable graphics processor |
-
2007
- 2007-06-19 CN CNA2007101120142A patent/CN101145239A/en active Pending
- 2007-06-20 TW TW096122072A patent/TWI395152B/en active
- 2007-06-20 CN CN200710123324A patent/CN100578542C/en active Active
- 2007-06-20 CN CN2007101233278A patent/CN101114376B/en active Active
- 2007-06-20 TW TW096122024A patent/TWI367455B/en active
- 2007-06-20 TW TW096122026A patent/TWI341976B/en active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1625757A (en) * | 2002-02-01 | 2005-06-08 | 皇家飞利浦电子股份有限公司 | Stepless 3d texture mapping in computer graphics |
| CN1624723A (en) * | 2003-02-21 | 2005-06-08 | 威盛电子股份有限公司 | Single level MIP filtering algorithm for anisotropic texturing |
| CN1564203A (en) * | 2004-04-12 | 2005-01-12 | 浙江大学 | Fast drawing forest method of graded hierarchical assembling depth paste-up atlas |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101114376B (en) | 2010-06-23 |
| TWI395152B (en) | 2013-05-01 |
| CN101114376A (en) | 2008-01-30 |
| CN101122997A (en) | 2008-02-13 |
| TW200819987A (en) | 2008-05-01 |
| TWI341976B (en) | 2011-05-11 |
| TWI367455B (en) | 2012-07-01 |
| TW200809691A (en) | 2008-02-16 |
| TW200821988A (en) | 2008-05-16 |
| CN101145239A (en) | 2008-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7965296B2 (en) | Systems and methods for storing texture map data | |
| US7898551B2 (en) | Systems and methods for performing a bank swizzle operation to reduce bank collisions | |
| US8970583B1 (en) | Image space stylization of level of detail artifacts in a real-time rendering engine | |
| CN100578542C (en) | Graphic processing system and method for storing texture data in graphic processing system | |
| JP2637931B2 (en) | Computer system for texture mapping | |
| US7042462B2 (en) | Pixel cache, 3D graphics accelerator using the same, and method therefor | |
| JP5163981B2 (en) | Apparatus and method for texture detail level calculation | |
| KR101639852B1 (en) | Pixel value compaction for graphics processing | |
| CN111179394A (en) | Point cloud scene rendering method, device and equipment | |
| EP3144897A1 (en) | Demand based texture rendering in a tile based rendering system | |
| US7439983B2 (en) | Method and apparatus for de-indexing geometry | |
| US7245302B1 (en) | Processing high numbers of independent textures in a 3-D graphics pipeline | |
| US20110169850A1 (en) | Block linear memory ordering of texture data | |
| CN107509067B (en) | A kind of free view-point image composition method of high-speed high-quality amount | |
| EP1026636A2 (en) | Image processing | |
| KR20160068204A (en) | Data processing method for mesh geometry and computer readable storage medium of recording the same | |
| US20070052718A1 (en) | Texturing 3-dimensional computer graphic images | |
| CN110738719A (en) | Web3D model rendering method based on visual range hierarchical optimization | |
| CN113835753B (en) | Techniques for performing accelerated point sampling in a texture processing pipeline | |
| KR101433951B1 (en) | Coordinate computations for non-power of 2 texture maps | |
| CN106991643B (en) | Real-time line checking method and real-time line checking system with low resource consumption | |
| CN105225199A (en) | A kind of method and system of equidistant cylindrical surface projecting in real time | |
| US20040012586A1 (en) | Image processing apparatus and method of same | |
| GB2625798A (en) | Retrieving a block of data items in a processor | |
| GB2625799A (en) | Applying texture processing to a block of fragments in a graphics processing unit |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |