CN100349186C - Shadow production method and device for adjustment shadow space arithmetic - Google Patents
Shadow production method and device for adjustment shadow space arithmetic Download PDFInfo
- Publication number
- CN100349186C CN100349186C CNB2005100998610A CN200510099861A CN100349186C CN 100349186 C CN100349186 C CN 100349186C CN B2005100998610 A CNB2005100998610 A CN B2005100998610A CN 200510099861 A CN200510099861 A CN 200510099861A CN 100349186 C CN100349186 C CN 100349186C
- Authority
- CN
- China
- Prior art keywords
- depth
- degree
- shadow
- algorithm
- value
- 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)
Abstract
The present invention discloses a method and a device of shade generation of an adaptive shade space algorithm. When shade space is rendered to a frame, the efficacy of the algorithm which is respectively carried out between a depth pass algorithm and a depth failure algorithm to the frame is inferred by the statistics of the number of depth pass and depth pass. Accordingly, a relative better algorithm of the two algorithms can be used as a shadow space algorithm of a next frame.
Description
Technical field
The invention relates to a shadow volume calculation method and a device, particularly about using shadow volume calculation method and the device of the degree of depth by adaptability by algorithm and degree of depth failure algorithm.
Background technology
In the three dimensionality drafting system, the extra technology of needs of describing of shade is handled, briefly will find out those pixels that are arranged in shade exactly, these technology include shadow volume (shadow volume), shadow maps (shadow mapping) ... or the like.
The method of shadow volume mainly is that the definition space that shade is covered becomes shadow volume, judges which partly is to be positioned at shadow volume on the picture.Shown in Figure 1A, suppose light by light source A irradiation, and veil B resistance shelves are therein, so the scope that light crested thing B is covered is shadow volume S, shadow volume S can define with positive (front face) and the back side (back face).When the object 0 on the picture will be projected in display plane G and goes up, can observe out that to have only between position D and position E partly be within shadow volume S, all the other partly are to be positioned at outside the shadow volume.
In view of the above, as long as the shadow volume on the picture is defined out, can be judged just whether each pixel is arranged in shadow volume on the picture.Yet on the picture of three dimensionality image projecting at two-dimensions the time, must to note the relation of the position between each object in the three dimensionality image, only show in the picture of two-dimensions to be positioned at foremost image partly.Therefore the three dimensionality object need describe when being painted into the two-dimensions plane which pixel object that (raster) painted can be projected in and at the depth value of those pixels.Because three dimensionality is depicted in the two-dimensions plane successively to liking, therefore drafting system can write down each pixel shown degree of depth at present, for can knowing description, by rendered object with respect to a degree of depth (on the rendered object) that is projected pixel be projected the shown degree of depth of pixel (in the map sheet buffer zone) and be hereinafter referred to as the degree of depth to be measured and the tested degree of depth at this.Therefore when the degree of depth to be measured during, be positioned at the front that is projected the present shown position of pixel, be projected pixel and need change demonstration into, and be projected the corresponding tested degree of depth need of pixel and replace with the degree of depth to be measured by rendered object by rendered object less than the tested degree of depth.Therefore when the corresponding degree of depth to be measured of some pixels was arranged in shadow volume, this pixel must be described with the shade look.Above-mentioned depth test can be general depth test or rough depth test, and general depth test is to be that unit tests with single pixel, and rough depth test can be a plurality of pixels in the block test simultaneously.When rough depth test, the degree of depth to be measured and the tested degree of depth respectively have a plurality of, therefore when the minimum degree of depth to be measured during greater than the tested degree of depth of maximum, then the result of rough depth test is full degree of depth failure, and when the maximum degree of depth to be measured during less than the tested degree of depth of minimum, then the result of rough depth test passes through for the full degree of depth.If the result of depth test is not that then the result of rough depth test was for judging when the full degree of depth was failed or the degree of depth is passed through entirely roughly.When the result of rough depth test for judging, then test with general depth test again.
Carrying out above-mentioned three dimensionality object projection in the process of two-dimensions picture, generally is earlier the three dimensionality object to be defined with a plurality of polygons, carries out above-mentioned depth test with polygon again.Similarly, each shadow volume also is to be defined by a plurality of polygons earlier, includes to represent positive front polygon and the backfacing polygon of representing the back side, finds out which degree of depth to be measured again and is arranged in the positive polygon shadow volume that is defined with backfacing polygon.
Because it is quite consuming time to utilize the ray tracing technology to produce the method for shade, especially under a plurality of veils and a plurality of light source, therefore need more efficient method to handle.Masterplate (stencil) shadow volume method is adopt to upgrade the masterplate buffer zone to carry out one and simply advance/go out Calculation Method with simple and easy such operation, and it is to adopt to carry out in the front of shadow volume (front-face) with the polygonal depth test in the back side (back-face) to decide pixel in shade.For example, in the enforcement of stencil shadow space-wise, the value of masterplate buffer zone is that the depth test according to front polygon and backfacing polygon is incremented or successively decreases, if therefore last masterplate value is 0, then pixel is not in shade.
In the depth test of shadow volume, the tested degree of depth is called the degree of depth greater than the situation of the degree of depth to be measured to be passed through, otherwise is called as degree of depth failure.In view of the above, mainly be divided into two kinds of shadow space arithmetics on the update rule of masterplate buffer zone, one for the degree of depth by (Z pass) algorithm, another then is the degree of depth (Z fail) algorithm of failing.The degree of depth by algorithm be only to the degree of depth by upgrading the masterplate buffer zone, when the degree of depth pass through be the front polygon time, the value of masterplate buffer zone can be incremented, and when the degree of depth pass through be backfacing polygon the time, the value of masterplate buffer zone can be successively decreased.Otherwise degree of depth failure algorithm is only the degree of depth to be failed to upgrade the masterplate buffer zone, when degree of depth failure be the front polygon time, the value of masterplate buffer zone can be successively decreased, and when the degree of depth fail be backfacing polygon the time, the value of masterplate buffer zone can be incremented.
Be to be respectively the synoptic diagram of the degree of depth shown in Figure 1B and Fig. 1 C by algorithm and degree of depth failure algorithm.The irradiation of light source A has formed three shadow volumes because of stopping of veil B, C and D, object E and F drop on respectively the interior of shadow volume with outside.In the degree of depth when the algorithm, corresponding to the stencil value of E ' point be+1+1=2, be arranged in shadow volume, and be+1+1-1-1=0 corresponding to the masterplate value of F ' point, be positioned at outside the shadow volume, the masterplate value that E ' puts and F ' puts was updated 6 times altogether.Relatively, when degree of depth failure algorithm, corresponding to the stencil value of E ' point be+1-1+1+1=2, be arranged in shadow volume, and be 0 corresponding to the masterplate value of F ' point, be positioned at outside the shadow volume, the masterplate value that E ' point and F ' put was updated 4 times altogether.Apparently, above-mentioned visual angle is comparatively suitable with degree of depth failure algorithm, when as seen watching with identical visual angle, adopts different shadow space arithmetics can obtain identical result, but causes different operands.In addition, the scene of being seen when the visual angle changes also can be different, and therefore the shadow space arithmetic that is suitable for also might be different.For example watch at the I of Fig. 1 D point, originally covered at E ' point and the F ' point that Fig. 1 C saw, becoming what see is e ' point and f ' point.Need upgrade 7 times with degree of depth failure algorithm, being respectively e ' point needs 3 times, and f ' point needs 4 times.Need upgrade 3 times by algorithm with the degree of depth, being respectively e ' point needs 3 times, and f ' point needs 0 time.In view of the above, comparatively suitable with the degree of depth by algorithm.
Fig. 1 E given an example in several continuous map sheets (frame) with the degree of depth by with the relativeness of degree of depth failure to masterplate value update times, the update times that the map sheet degree of depth that has is passed through is many, the update times of the map sheet degree of depth failure that has is many.If it is inapplicable all will to have many map sheets with degree of depth failure algorithm, therefore need a kind of new design to reduce the update times of masterplate value.
Observe above-mentioned example, though can find that the degree of depth is all identical with the degree of depth failure conclusion that algorithm drew by algorithm, operand is variant, that is to say the difference because of the person's of looking view direction, and both operands are also different.Generally be to select one by algorithm or degree of depth failure algorithm among both on using in the degree of depth, therefore the computing cost is easy to become very big because of the different of viewing angle with the frequency range that upgrades the masterplate buffer zone, therefore the method that needs a kind of solution to carry out computing with the depth test that is fit to.
Summary of the invention
A purpose of the present invention be when depth test the statistics degree of depth by with the quantity of degree of depth failure, decide the deep space algorithm of next map sheet according to smaller between the two.
Another object of the present invention be when depth test, add up the full degree of depth by with the quantity of full degree of depth failure, decide the deep space algorithm of next map sheet according to smaller between the two.
In view of the above, the present invention proposes a kind of plotting unit with adjustment shadow space calculation logic, it is characterized in that, this plotting unit with adjustment shadow space calculation logic comprises:
One drawing unit, this drawing unit are to come a color existing map sheet with these a plurality of pixels, add up a degree of depth by a value and a degree of depth fail values when wherein being included in a default shadow space arithmetic the color existing shadow volume of this map sheet; And
One selected cell, this selected cell is after with this default shadow space arithmetic this map sheet coloured silk being showed shadow volume in the drawing unit, a kind of as this default shadow space arithmetic from a degree of depth according to this degree of depth by selecting algorithm and the degree of depth failure algorithm by statistical value and this degree of depth failure statistical value, wherein if the degree of depth by statistical value greater than this degree of depth failure statistical value, then select this degree of depth failure algorithm as this default shadow volume algorithm, if this degree of depth is not more than this degree of depth failure statistical value by statistical value, then select this degree of depth by algorithm as this default shadow volume algorithm.
Wherein above-mentioned selected cell is a software, and this software is to be selected from one of following group: driver, software application are called out the interface.
Wherein above-mentioned drawing unit comprises record and upgrades a depth value and a masterplate value corresponding to each this pixel, and wherein this masterplate value is in order to define the pixel of the shadow volume that is positioned at this map sheet.
Wherein above-mentioned drawing unit now comprises with a plurality of shadow volume polygons the coloured silk of this shadow volume this corresponding this depth value of a plurality of pixels institutes is carried out a depth test, to upgrade this corresponding this masterplate value of a plurality of pixel institutes, wherein these a plurality of shadow volume polygons are in order to present shadow volume.
Wherein above-mentioned depth test comprises a rough depth test and a general depth test, and this general depth test is to test one by one with single pixel, and this rough depth test is to be that a block is tested simultaneously with a plurality of pixels.
The result of wherein above-mentioned rough depth test be this pixel of whole district's piece be the full degree of depth by, full degree of depth failure with can't judge in a kind of.
The result of wherein above-mentioned rough depth test is for can't judge the time, and then this pixel of this block is carried out general depth test in addition.
Wherein above-mentioned drawing unit also is included in this depth test, the pixel quantity accumulative total that each shadow volume polygon degree of depth is passed through is passed through statistical value to count this degree of depth, and the pixel quantity of each shadow volume polygon degree of depth failure is added up to count this degree of depth failure statistical value.
The wherein above-mentioned degree of depth is that this corresponding this masterplate value of pixel institute that each shadow volume polygon degree of depth is passed through is upgraded by algorithm, and this degree of depth failure algorithm is that this corresponding this masterplate value of pixel institute of each shadow volume polygon degree of depth failure is upgraded.
Description of drawings
For further specifying concrete technology contents of the present invention, below in conjunction with embodiment and accompanying drawing describes in detail as after, wherein:
Figure 1A to Fig. 1 E is the synoptic diagram of prior art;
Fig. 2 is the schematic flow sheet of a specific embodiment of the present invention;
Fig. 3 is the schematic flow sheet of another specific embodiment of the present invention;
Fig. 4 is the function block schematic diagram of a specific embodiment more of the present invention;
Fig. 5 is the relative merits comparison diagram of the present invention compared to Fig. 1 E.
Embodiment
Shade generation device and method that the present invention is a kind of adjustment shadow space arithmetic in this direction of inquiring into.In order to understand the present invention up hill and dale, detailed structure will be proposed in following description.Apparently, execution of the present invention is not defined in the specific details that the operator had the knack of of lighting device.On the other hand, well-known composition or fabrication steps are not described in the details, with the restriction of avoiding causing the present invention unnecessary.Preferred embodiment meeting of the present invention is described in detail as follows, yet except these were described in detail, the present invention can also implement in other embodiments widely, and scope of the present invention do not limited, its with after invention scope be as the criterion.
Shadow space arithmetic (shadow volume algorithm) comprises the degree of depth by (Z pass) algorithm and degree of depth failure (Z fail) algorithm.In a plurality of continuous map sheets (frames), presumable map sheet decides the shadow region in the pixel to have reasonable usefulness by the degree of depth by algorithm, and the map sheet that has has reasonable usefulness by degree of depth failure.Therefore if only decide shadow region in the pixel, may cause the usefulness variation with a kind of shadow space arithmetic.
In a plurality of continuous map sheets, may comprise one or more scene (scene), roughly all similar at the object that map sheet presented of identical scene, especially background is partly.Though scene is identical, but because the difference of view direction, object that is presented in the map sheet and relevant shade also can be different, only pipe so, difference in same scene between close map sheet is also little, therefore if pass through algorithm in a degree of depth that map sheet is applicable to, can be in the also suitable possibility of next map sheet than the degree of depth algorithm height of failing, vice versa.After description in, the front polygon and the backfacing polygon of shadow volume are collectively referred to as the shadow volume polygon.
Fig. 2 is the schematic flow sheet according to a specific embodiment of the present invention.By prior art as can be known, polygon comprises the polygon of general imaged object and the polygon of shadow volume, and both are described in different phase, and the polygon of general object was the polygon of shadow volume then before this.At first, flow process is by step 200 beginning, and by aggregate-value, degree of depth failure aggregate-value and default shadow space arithmetic initialization, wherein shadow space arithmetic is by presetting one in algorithm and the degree of depth failure algorithm by the degree of depth in the step 201 pair degree of depth.Next step 202 begins to describe first polygon, the flow process of describing be to judge whether that by step 203 all polygons do not describe to finish as yet at the beginning.If do not describe as yet to finish, judge whether to be the shadow volume polygon by step 204.If be not the shadow volume polygon, then by step 205 color existing polygon, carry out general depth test/rough depth test and upgrade the degree of depth/color buffer district, carry out next polygonal describing by step 207 afterwards.Otherwise, if be the shadow volume polygon, then by the color existing polygonal depth value of step 206, carry out general depth test/rough depth test, the degree of depth that adds up by aggregate-value and degree of depth failure aggregate-value and renewal masterplate buffer zone, carry out next polygonal describing by step 207 afterwards.In addition, judging in step 203 is not have polygon not describe as yet, then by step 208 judge whether the degree of depth by aggregate-value greater than the degree of depth aggregate-value of failing.If greater than the degree of depth aggregate-value of failing, then the shadow space arithmetic by next map sheet of step 209 decision is degree of depth failure to the degree of depth, is carried out the initialization of next map sheet again by step 211 by aggregate-value.If the degree of depth is not more than degree of depth failure aggregate-value by aggregate-value, then the shadow space arithmetic by next map sheet of step 210 decision is that the degree of depth is passed through, and is carried out the initialization of next map sheet again by step 211.In step 211, can be designated as next map sheet by being described map sheet, and degree of depth failure aggregate-value and default shadow space arithmetic can be initialised (as being set at 0).
In view of the above, with reference to figure 3, another specific embodiment of the present invention is a kind of shadow production method of adjustment shadow space arithmetic.At first, shown in step 310, all objects of a color existing map sheet, wherein each is represented with a plurality of polygons liking, and this map sheet is existing in a plurality of pixels by coloured silk, and these pixels can be to be stored in the drawing buffer district (framebuffer).Next, shown in step 320, also add up a degree of depth simultaneously by statistical value and degree of depth failure statistical value with the shadow volume of the color existing map sheet of a shadow space arithmetic of presetting.At last, shown in step 330, behind the color existing shadow volume, from a degree of depth is failed algorithm by the algorithm and a degree of depth, select a kind of by statistical value and this degree of depth failure statistical value to this map sheet at default shadow space arithmetic as this default shadow space arithmetic according to this degree of depth.Therefore when next map sheet re-executed step 310 with step 320, then next map sheet was to come color existing shadow volume according to this map sheet at the selected shadow space arithmetic of step 330.
In view of the above, as shown in Figure 4, a specific embodiment of the present invention is a kind of plotting unit with adjustment shadow space calculation logic, and it comprises a masterplate buffer zone 22, a drawing unit 24 and a selected cell 26.Shown in step 310, drawing unit 24 is to be used for color all pixels of (render) map sheet 251 now, and masterplate buffer zone 22 is the masterplate values that are used for storing corresponding to each pixel.Drawing unit 24 is that it can be that any one map sheet that map sheet is described in the data group 23 is described data that map sheet is described data 231 according to map sheet data of description 231 color existing map sheets 251.Wherein said map sheet 251 can be any one in a plurality of continuous map sheets 25, the next map sheet of this map sheet 251 after description represent that with next map sheet 252 next map sheet 252 is that to describe data 232 coloured silks at the existing map sheet 251 of coloured silk back according to next map sheet by drawing unit 24 existing.In addition, shown in step 320, drawing unit 24 upgrades masterplate buffer zone 22 from a degree of depth of shadow volume calculation logic 241 by selecting one calculation pattern 244 and the degree of depth failure calculation pattern 246 according to an order 242, drawing unit 24 is that the masterplate value by this shadow volume calculation logical renewal masterplate buffer zone 22 defines (identify) shadow region 2512 with respect to a view direction, and add up a degree of depth simultaneously by statistical value 247 and degree of depth failure statistical value 249, order 242 corresponding to next map sheet 252 is to be produced by statistical value 247 and degree of depth failure statistical value 249 according to the degree of depth by selected cell 26, shown in step 330.
When the degree of depth is selected by calculation pattern 244, shadow volume calculation logic 241 is to decide shadow region 2512 with the degree of depth by algorithm, on the contrary, when degree of depth failure calculation pattern 246 was selected, shadow volume calculation logic 241 was to decide shadow region 2512 with degree of depth failure algorithm.Shadow region 2512 is for being arranged in the collection of pixels of shadow volume in the map sheet 251, this shadow region 2512 is that all pixels are now to produce hatching effect by drawing unit 24 with the shade color in the shadow region 2512 corresponding to the masterplate value that is not 0 in the masterplate buffer zone 22.
In addition, drawing unit 24 is that the coloured silk that utilizes depth test (Z test) to upgrade the pixel of map sheet 251 shows, and wherein the degree of depth is produced in the process of carrying out depth test by statistical value 247 and degree of depth failure statistical value 249.
The order 262 that selected cell 26 produces next map sheet according to the degree of depth by statistical value 247 and degree of depth failure statistical value 249.That is selected cell 26 is selected smaller institute shadow volume calculation accordingly pattern among both by comparing the degree of depth by statistical value 247 and degree of depth failure statistical value 249.For example when drawing unit 24 at coloured silk now during a map sheet 252, the order 262 of next map sheet can selected unit 26 as the order 261 that is this map sheet, and be sent to drawing unit 24 to become order 242.In addition, selected cell 26 can be hardware or software, for example (but not being subject to) logical circuit or be selected from the software of one of following group: driver (driver), software application are called out interface (Software AP).
The result of the rough depth test of above-mentioned Fig. 2 can be the full degree of depth by, full degree of depth failure with can't judge in wherein a kind of.Depth test or in step 320, can be only to use rough depth test in above-mentioned steps 205 and step 206, or only use general depth test, also can be earlier with rough depth test, when the result of rough depth test for can't judge the time, adopt general test again.
Comprise record and renewal a depth value in the process of all objects of existing this map sheet of wherein above-mentioned coloured silk corresponding to each pixel, and comprise the masterplate value of renewal corresponding to each pixel in the process of the shadow volume of the existing map sheet of above-mentioned coloured silk, these masterplate values are in order to define the pixel of the shadow volume that is positioned at map sheet.Masterplate value and depth value can be stored in respectively in masterplate buffer zone and the depth buffer, also may be incorporated in the buffer zone.In addition, now can be corresponding depth value to be carried out depth test to the coloured silk of shadow volume with a plurality of shadow volume polygons, the result according to depth test upgrades corresponding masterplate value again.
In addition, as in Figure 1B, two kinds of polygons are arranged, one is the shadow volume polygon, one is general object polygon (being E, F), current by coloured silk when a shadow volume polygon, should be that the pixel quantity that is positioned at general object polygon front is passed through statistical value by accumulative total to the degree of depth.Therefore when each shadow volume polygon is now intact by coloured silk, the degree of depth has added up the pixel quantity that each shadow volume polygon degree of depth is passed through by statistical value, and degree of depth failure statistical value has added up the pixel quantity of each shadow volume polygon degree of depth failure.Moreover, the above-mentioned degree of depth is that the corresponding masterplate value of pixel institute that each shadow volume polygon degree of depth is passed through is upgraded by algorithm, and above-mentioned degree of depth failure algorithm is that the corresponding masterplate value of pixel institute of each shadow volume polygon failure is upgraded.
In view of the above, compared to Fig. 1 D and Fig. 5, when map sheet quantity for a long time, can find that shadow space arithmetic of the present invention is better than prior art.Apparently, the present invention can appropriateness revise along with the content of continuous map sheet, obviously reduces the access times to the masterplate buffer zone.In addition, in step 330 and selected cell, can also be during above a threshold limit value, just to reset default deep space algorithm, by the difference between statistical value with the degree of depth with the variable quantity of minimizing deep space algorithm when degree of depth failure statistical value.
Apparently, according to the description among the top embodiment, the present invention has many corrections and difference.Therefore need be understood in the scope of its additional claim item, except above-mentioned detailed description, the present invention can also implement widely in other embodiments.Above-mentioned is preferred embodiment of the present invention only, is not in order to limit claim of the present invention; All other do not break away from the equivalence of being finished under the disclosed spirit and changes or modification, all should be included in the claim of the present invention.
Claims (9)
1, a kind of plotting unit with adjustment shadow space calculation logic is characterized in that, this plotting unit with adjustment shadow space calculation logic comprises:
One drawing unit, this drawing unit are to come a color existing map sheet with a plurality of pixels, add up a degree of depth by a value and a degree of depth fail values when wherein being included in a default shadow space arithmetic the color existing shadow volume of this map sheet; And
One selected cell, this selected cell is after with this default shadow space arithmetic this map sheet coloured silk being showed shadow volume in the drawing unit, a kind of as this default shadow space arithmetic from a degree of depth according to this degree of depth by selecting algorithm and the degree of depth failure algorithm by statistical value and this degree of depth failure statistical value, wherein if the degree of depth by statistical value greater than this degree of depth failure statistical value, then select this degree of depth failure algorithm as this default shadow volume algorithm, if this degree of depth is not more than this degree of depth failure statistical value by statistical value, then select this degree of depth by algorithm as this default shadow volume algorithm.
2, the plotting unit with adjustment shadow space calculation logic as claimed in claim 1 is characterized in that wherein above-mentioned selected cell is a software, and this software is to be selected from one of following group: driver, software application are called out the interface.
3, the plotting unit with adjustment shadow space calculation logic as claimed in claim 1, it is characterized in that, wherein above-mentioned drawing unit comprises record and upgrades a depth value and a masterplate value corresponding to each this pixel, and wherein this masterplate value is in order to define the pixel of the shadow volume that is positioned at this map sheet.
4, the plotting unit with adjustment shadow space calculation logic as claimed in claim 3, it is characterized in that, wherein above-mentioned drawing unit now comprises with a plurality of shadow volume polygons the coloured silk of this shadow volume this corresponding this depth value of a plurality of pixels institutes is carried out a depth test, to upgrade this corresponding this masterplate value of a plurality of pixel institutes, wherein these a plurality of shadow volume polygons are in order to present shadow volume.
5, the plotting unit with adjustment shadow space calculation logic as claimed in claim 4, it is characterized in that, wherein above-mentioned depth test comprises a rough depth test and a general depth test, this general depth test is to test one by one with single pixel, and this rough depth test is to be that a block is tested simultaneously with a plurality of pixels.
6, the plotting unit with adjustment shadow space calculation logic as claimed in claim 5 is characterized in that, the result of wherein above-mentioned rough depth test be this pixel of whole district's piece be the full degree of depth by, full degree of depth failure with can't judge in a kind of.
7, the plotting unit with adjustment shadow space calculation logic as claimed in claim 6 is characterized in that, the result of wherein above-mentioned rough depth test is for can't judge the time, and then this pixel of this block is carried out general depth test in addition.
8, the plotting unit with adjustment shadow space calculation logic as claimed in claim 4, it is characterized in that, wherein above-mentioned drawing unit also is included in this depth test, the pixel quantity accumulative total that each shadow volume polygon degree of depth is passed through is passed through statistical value to count this degree of depth, and the pixel quantity of each shadow volume polygon degree of depth failure is added up to count this degree of depth failure statistical value.
9, the plotting unit with adjustment shadow space calculation logic as claimed in claim 3, it is characterized in that, the wherein above-mentioned degree of depth is that this corresponding this masterplate value of pixel institute that each shadow volume polygon degree of depth is passed through is upgraded by algorithm, and this degree of depth failure algorithm is that this corresponding this masterplate value of pixel institute of each shadow volume polygon degree of depth failure is upgraded.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100998610A CN100349186C (en) | 2005-09-09 | 2005-09-09 | Shadow production method and device for adjustment shadow space arithmetic |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100998610A CN100349186C (en) | 2005-09-09 | 2005-09-09 | Shadow production method and device for adjustment shadow space arithmetic |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1737854A CN1737854A (en) | 2006-02-22 |
| CN100349186C true CN100349186C (en) | 2007-11-14 |
Family
ID=36080637
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100998610A Active CN100349186C (en) | 2005-09-09 | 2005-09-09 | Shadow production method and device for adjustment shadow space arithmetic |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100349186C (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6384822B1 (en) * | 1999-05-14 | 2002-05-07 | Creative Technology Ltd. | Method for rendering shadows using a shadow volume and a stencil buffer |
| US20040179009A1 (en) * | 2003-03-10 | 2004-09-16 | Sharp Kabushiki Kaisha | Graphic processing apparatus, graphic processing method, graphic processing program, and program storage medium |
| CN1609898A (en) * | 2004-03-19 | 2005-04-27 | 威盛电子股份有限公司 | Method and apparatus for generating shadow effect using shadow space |
-
2005
- 2005-09-09 CN CNB2005100998610A patent/CN100349186C/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6384822B1 (en) * | 1999-05-14 | 2002-05-07 | Creative Technology Ltd. | Method for rendering shadows using a shadow volume and a stencil buffer |
| US20040179009A1 (en) * | 2003-03-10 | 2004-09-16 | Sharp Kabushiki Kaisha | Graphic processing apparatus, graphic processing method, graphic processing program, and program storage medium |
| CN1609898A (en) * | 2004-03-19 | 2005-04-27 | 威盛电子股份有限公司 | Method and apparatus for generating shadow effect using shadow space |
Non-Patent Citations (2)
| Title |
|---|
| Graphics Hardware 2005. Samuli Laine,全文,Split.plane shadow volumes. 2005 * |
| 计算机应用 薛守良，苏鸿根，全文，实时阴影算法及实现 2004 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1737854A (en) | 2006-02-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7978194B2 (en) | Method and apparatus for hierarchical Z buffering and stenciling | |
| US20180365885A1 (en) | Assigning primitives to tiles in a graphics processing system | |
| US9684995B2 (en) | Setting a display list pointer for primitives in a tile-based graphics processing system | |
| JP4579262B2 (en) | Early Z-test method and system for rendering three-dimensional images | |
| US6636212B1 (en) | Method and apparatus for determining visibility of groups of pixels | |
| US7126615B2 (en) | Color compression using multiple planes in a multi-sample anti-aliasing scheme | |
| US9019271B2 (en) | Z-culling method, three-dimensional graphics processing method and apparatus threrof | |
| KR101217559B1 (en) | Method and Apparatus of rendering 3D graphics data to minimize power consumption | |
| US20040104913A1 (en) | System and method for automatically configuring graphics pipelines by tracking a region of interest in a computer graphical display system | |
| US20060209065A1 (en) | Method and apparatus for occlusion culling of graphic objects | |
| JPH06223201A (en) | Parallel image generating device | |
| CN109256076A (en) | Edge pixel display methods, system, storage equipment and display device | |
| CN105869579A (en) | Backlight brightness adjusting method and device and display terminal | |
| US20020196252A1 (en) | Method and apparatus for rendering three-dimensional images with tile-based visibility preprocessing | |
| JP2015018294A (en) | Image processing program, image processing device, image processing system, and image processing method | |
| CN115315727A (en) | Graphics processing unit rendering mode selection system | |
| US20220319145A1 (en) | Image processing device, image processing method, moving device, and storage medium | |
| US9245500B1 (en) | System and method for preventing image capture | |
| CN109599068A (en) | A kind of VR equipment and its control method | |
| US8098264B2 (en) | Method and apparatus for rendering computer graphics primitive | |
| CN100349186C (en) | Shadow production method and device for adjustment shadow space arithmetic | |
| US8120620B2 (en) | Graphics system and drawing method thereof | |
| JP6818781B2 (en) | Display device and its control method | |
| US7646385B2 (en) | Computer graphics rendering method and apparatus | |
| US20100182331A1 (en) | Method and apparatus for drawing image |
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 |