US20040196283A1 - Method and system for reducing overflows in a computer graphics system - Google Patents
Method and system for reducing overflows in a computer graphics system Download PDFInfo
- Publication number
- US20040196283A1 US20040196283A1 US10/824,904 US82490404A US2004196283A1 US 20040196283 A1 US20040196283 A1 US 20040196283A1 US 82490404 A US82490404 A US 82490404A US 2004196283 A1 US2004196283 A1 US 2004196283A1
- Authority
- US
- United States
- Prior art keywords
- bins
- primitives
- variable
- sized
- bin
- 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.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T15/00—3D [Three Dimensional] image rendering
- G06T15/10—Geometric effects
Definitions
- the present invention relates to graphics processing in a computer system, and more particularly to a method and system for more efficiently rendering a graphical image.
- a conventional computer graphics system can display a graphical image on a display.
- the display includes a plurality of displays elements, known as pixels, typically arranged in a grid.
- the conventional computer graphics system typically breaks the objects into a plurality of polygons.
- the conventional system then typically renders the polygons in a particular order. For a three-dimensional scene, the polygons are generally rendered from back to front as measured from the viewing plane of the display. Similarly, a two-dimensional scene can be displayed where polygons are rendered based on their layer. Shallower layers occlude deeper layers.
- FIG. 1 is a block diagram of a display 1 depicting a graphical image
- the display includes a plurality of pixels 8 , only one of which is labeled.
- the graphical image includes primitives 2 , 3 , 4 , 5 , and 6 which may be part of one or more objects.
- Each of the primitives 2 , 3 , 4 , 5 , and 6 may cover several pixels and includes a plurality of fragments.
- Each fragment includes data for a pixel intersected by the corresponding primitive.
- a fragment may include data relating to the color, texture, ⁇ values, and depth values for a particular primitive and a particular pixel.
- One conventional method used in rendering the graphical image renders the image primitive by primitive in a particular order.
- the primitives are generally rendered from back to front as measured from the viewing plane of the display.
- a two-dimensional scene can be displayed where primitives are rendered based on their layer. Shallower layers occlude deeper layers.
- the primitive 2 might be rendered first, followed in order by primitives 3 , 4 , 5 , and 6 .
- FIG. 2A depicts another conventional method 10 for rendering a graphical image.
- FIG. 2B depicts a display 20 including the primitives 2 , 3 , 4 , 5 , and 6 which are rendered using the conventional method 10 .
- portions of the display 1 are rendered one at a time.
- a tile is typically a two-dimensional rectangle containing n ⁇ m pixels.
- the tiles 21 , 22 , 23 , 24 , 25 , 26 , 27 , 28 , and 29 are depicted in the display 20 .
- the primitives 2 , 3 , 4 , 5 , and 6 are then rendered tile by tile and primitive by primitive.
- the portion of the primitive 2 in tile 21 is rendered first.
- the portion of the primitive 4 in tile 22 is rendered.
- the portions of the primitives 4 and 6 in tile 23 are rendered. This process continues, rendering the graphical image primitive by primitive and tile by tile, until all primitives in all tiles have been rendered.
- FIG. 3 depicts a high-level block diagram of one embodiment of such a computer graphics system 50 .
- the system 50 includes a central processing unit (CPU) 52 , a display 54 , a user interface 56 such as a keyboard or mouse or other communicating device, a memory 58 , and an image generating unit 60 coupled with one or more buses 58 .
- the display 54 includes a display, such as the display 1 .
- the display 14 also includes a display memory 55 to which data for pixels are written prior to being shown on the display 1 .
- the objects are broken into polygons to be used in rendering the objects.
- the polygons are rendered in raster order. That is, portions of the polygons are rendered pixel by pixel in the order of the pixels in the display 54 .
- the image generating unit 60 is used in rendering the graphical image.
- the image generating unit includes an interface 61 connected to the bus 58 .
- the interface 61 transmits data to a data processing unit 62 .
- the block of processors 64 identifies data describing portions of primitives (“intersecting primitives”) which intersect the area extending along a z-axis from a selected pixel in an x-y plane corresponding to a screen of the display 14 .
- the block of processors 64 may include a number of processors, allowing intersecting primitives to be processed in parallel. By processing the primitives in parallel, the block of processors 64 can provide an indication of the fragments that intersect pixels currently being processed in a particular scan line.
- An obstructed object identifier/removal unit (Quick Z) 66 receives at least a portion of the fragment from each intersecting polygon associated with the selected pixel and removes portions of the fragments for intersecting polygons that are obstructed.
- the interpolator 68 receives the remaining fragments for the intersecting polygons for the selected pixel and interpolates the data, including interpolating texture, color, and alpha values for the fragment.
- the interpolator 68 also provides a coverage mask for each fragment.
- the coverage mask indicates the portion of the pixel that the fragment covers.
- the fragments for remaining intersecting polygons are provided by the interpolator 68 to a hardware sorter 70 .
- the hardware sorter 70 sorts the fragments for the intersecting polygons based on the value of a key such as the z value, or depth value, for the fragment.
- An antialiasing/blending/accumulating unit 72 performs antialiasing using the mask provided by the interpolator 68 .
- the antialiasing unit 72 may multiple units used in antialiasing, accumulating data, and blending data.
- the antialiased data is provided to the display 14 pixel by pixel in raster order.
- the processors in the block of processors 64 may overflow.
- a number of the primitives intersecting pixels in a particular scan line (a row of pixels on the display 1 ) are processed in parallel.
- processors in the block of processors 64 There are also a finite number of processors in the block of processors 64 .
- sixty-four processors are provided in the block of processor block 64 .
- a particular scan line contains a large number of primitives
- more primitives than processors in the block of processors 64 may be attempted to be processed in parallel.
- the block of processors 64 may then overflow. Such an overflow is undesirable.
- efficient rendering of the graphical image is desired.
- the present invention provides a method and system for providing a graphical image on a display of a system.
- the graphical image is provided from data describing a plurality of to primitives.
- the display includes a plurality of pixels.
- the method and system comprise providing a plurality variable-sized bins containing the plurality of primitives and rendering the plurality of primitives by rendering each of the plurality of variable-sized bins variable-sized bin by variable-sized bin.
- the system also includes a plurality of processors for processing a portion of the plurality of primitives in parallel.
- variable-sized bin providing step further includes the steps of storing the plurality of primitives in a plurality of bins and determining if a part of a portion of the plurality of bins can be combined without causing the plurality of processors to overflow.
- the method and system also comprise combining the part of the portion of the plurality of bins to provide the plurality of variable-sized bins if the part of the portion of the plurality of bins can be combined without causing the plurality of processors to overflow.
- the plurality of variable-sized bins can include fewer bins than the plurality of bins.
- the method and system further include determining a plurality of bins for a previous frame and providing the plurality of bins containing the plurality of primitives.
- the present invention efficiently separates the graphical image into variable-sized bins that can be separately rendered without overflowing the system.
- FIG. 1 is a diagram of a display including a graphical image.
- FIG. 2A is a high-level flow chart of a conventional method for rendering a graphical image.
- FIG. 2B is a diagram of the display when the conventional method is used to render the graphical image.
- FIG. 3 is a high-level block diagram of a computer graphics system in which the present invention can be used.
- FIG. 4A is a high-level flow chart of one embodiment method for rendering a graphical image in accordance with the present invention.
- FIG. 4B is a diagram of one way in which a display could be divided in accordance with the present invention.
- FIG. 5A is a flow chart of a first embodiment of a method for providing variable-sized bins in accordance with the present invention.
- FIG. 5B is a diagram of one way in which a display could be divided in accordance when the first embodiment of a method in accordance with the present invention for providing variable-sized bins.
- FIG. 5C is a diagram of how the bins are provided and combined in accordance when the first embodiment of a method in accordance with the present invention for providing variable-sized bins.
- FIG. 6A is a more detailed flow chart of a preferred version of the first embodiment of a method for providing variable-sized bins in accordance with the present invention.
- FIG. 6B is a diagram of how the bins are provided and combined in accordance when the preferred version of the first embodiment of a method in accordance with the present invention for providing variable-sized bins.
- FIG. 7A is a flow chart of a second embodiment of a method for providing variable-sized bins in accordance with the present invention.
- FIG. 7B is a diagram of one way in which a display could be divided in accordance when the second embodiment of a method in accordance with the present invention for providing variable-sized bins.
- FIG. 7C is a diagram of how the bins are provided and combined in accordance when the second embodiment of a method in accordance with the present invention for providing variable-sized bins.
- FIG. 8A is a more detailed flow chart of the second embodiment of a method for providing variable-sized bins in accordance with the present invention.
- FIG. 8B is a diagram of how the bins are provided and combined in accordance when the preferred version of the second embodiment of a method in accordance with the present invention for providing variable-sized bins.
- the present invention relates to an improvement in processing of graphical images.
- the following description is presented to enable one of ordinary skill in the art to make and use the invention and is provided in the context of a patent application and its requirements.
- Various modifications to the preferred embodiment will be readily apparent to those skilled in the art and the generic principles herein may be applied to other embodiments.
- the present invention is not intended to be limited to the embodiment shown, but is to be accorded the widest scope consistent with the principles and features described herein.
- FIG. 1 depicts a display 1 including a graphical image.
- the graphical image includes primitives 2 , 3 , 4 , 5 , and 6 which may be part of one or more objects.
- Each of the primitives 2 , 3 , 4 , 5 , and 6 may intersect several pixels and includes a plurality of fragments.
- Each fragment includes data for a pixel intersected by the corresponding primitive.
- a fragment may include data relating to the color, texture, ⁇ values, and depth values for a particular primitive and a particular pixel.
- conventional computer graphics systems may employ a variety of methods.
- the graphical image is rendered primitive by primitive.
- the entire primitive 2 may be rendered first.
- the remaining primitives would then be rendered primitive by primitive.
- a conventional computer graphics system could break the display 1 into several tile of fixed, typically equal, size.
- the conventional system then renders the graphical image tile by tile.
- the portions of each primitive in a particular tile are rendered before a portion of the primitives in another tile.
- a recently developed computer graphics system renders a graphical image pixel by pixel, in raster order. Thus, fragments for all of the primitives intersecting a particular pixel are rendered, then the fragments for primitives intersecting another pixel are rendered.
- Such a system 50 is depicted in FIG. 2.
- the system 50 utilizes a plurality of processors in the block of processors 64 .
- the processors processes primitives intersecting a particular scan line in parallel. Preferably all of the primitives intersecting a scan line are processed in parallel. Because there are a finite number of processors, the number of primitives intersecting a scan line can exceed the number of processors. Consequently, the processors in the block of processors 64 may overflow, which adversely affects system performance.
- the present invention provides a method and system for providing a graphical image on a display of a system.
- the graphical image is provided from data describing a plurality of primitives.
- the display includes a plurality of pixels.
- the method and system comprise providing a plurality variable-sized bins containing the plurality of primitives and rendering the plurality of primitives by rendering each of the plurality of variable-sized bins variable-sized bin by variable-sized bin.
- the system also includes a plurality of processors for processing a portion of the plurality of primitives in parallel.
- variable-sized bin providing step further includes the steps of storing the plurality of primitives in a plurality of bins and determining if a part of a portion of the plurality of bins can be combined without causing the plurality of processors to overflow.
- the method and system also comprise combining the part of the portion of the plurality of bins to provide the plurality of variable-sized bins if the part of the portion of the plurality of bins can be combined without causing the plurality of processors to overflow.
- the plurality of variable-sized bins can include fewer bins than the plurality of bins.
- the method and system further include determining a plurality of bins for a previous frame and providing the plurality of bins containing the plurality of primitives.
- the present invention will be described in terms of being implemented in a particular system for a particular reason. However, one of ordinary skill in the art will readily recognize that this method and system will operate effectively for other systems. Furthermore, the present inventions will be described in terms of specific algorithms. However, one of ordinary skill in the art will readily realize that the present invention is consistent with the use of other algorithms. For example, certain steps of the flow charts described herein could be performed in another order, including in parallel. In addition, the present invention can be implemented in hardware, rather than in software. The present invention will also be described in the context of a particular number and type of processors, sections, bins, and primitives. The present invention will also be described in terms of a particular overflow condition based on the number or processors. However, one of ordinary skill in the art will readily recognize that the present invention is consistent with another number and type of processors, sections, bins, and primitives as well as a different overflow parameter.
- FIG. 4A depicting a high-level flow chart of one embodiment of method for rendering a graphical image in accordance with the present invention.
- the method is preferably implemented on the system 50 depicted in FIG. 2.
- the method and system in accordance with the present invention is implemented by or include software that may be stored in the memory 59 and executed by the CPU 52 .
- the software could be stored elsewhere or executed by another processor (not shown), such as one residing with the image generation unit 60 .
- a bin is variable sized when the section of the display (described below) to which the bin corresponds can vary in size.
- the primitives intersecting a particular variable-sized bin are stored in the variable-sized bin based on the primitives' minimum y-value and whether or not the primitives cross the right boundary of the particular variable-sized bin.
- each of at least a portion of the variable-sized bins includes few enough primitives so that the processors in the block of processors 64 do not overflow.
- each variable-sized bin includes no more than 64 primitives per scan line.
- the primitives allowed in a particular variable-sized bin may depend on other criteria.
- the primitives are then rendered by rendering the variable-sized bins variable-sized bin by variable-sized bin, via step 104 .
- step 104 includes rendering each of the variable-sized bins pixel by pixel in raster order.
- step 104 preferably includes providing the primitives for a scan line in a variable-sized bin to the processors in the block of processors 64 of FIG. 3. The portions of the primitives intersecting pixels within the scan line are then processed by the system 50 .
- FIG. 4B depicts a generalized view of a display 110 including a graphical image.
- the display 110 is analogous to the display 1 depicted in FIG. 1.
- the graphical image includes primitives 2 , 3 , 4 , 5 , and 6 .
- the graphical image has been broken into a plurality of variable-sized sections 112 , 114 , 116 , 118 and 120 .
- Each of the variable-sized sections 112 , 114 , 116 , 118 , and 120 corresponds to one of the variable-sized bins.
- One variable-sized bin stores data for the primitive 2 and the primitive 3 for the section 112 .
- a second variable-sized bin stores data for the primitive 2 and the primitive 3 in the section 114 .
- a third variable-sized bin stores data for the primitive 4 and the primitive 6 intersecting the section 116 .
- a fourth variable-sized bin stores a data for the primitives 4 , 5 , and 6 in the section 118 .
- a fifth variable-sized bin corresponds to the last section 120 .
- FIG. 5A depicts a more detailed flow chart of a first embodiment of a method 140 in accordance with the present invention for providing variable-sized bins.
- the primitives are stored in a plurality of bins, via step 142 , preferably in order based on the minimum y-value of the primitives.
- Storing a primitive may include storing the desired information for the primitive.
- the primitives are preferably stored from top to bottom along the display 1 .
- the bins are of the same size.
- the size of a bin is determined by the size of a section, discussed below, to which the bin corresponds. It is determined whether any portions of the bins, preferably adjacent bins, can be combined without violating an overflow parameter, via step 144 .
- step 144 determines whether any of the bins, in its entirety, can be combined with another bin, in its entirety.
- the overflow parameter corresponds to an overflow of the system. An overflow of the system occurs when there are more primitives in a bin than there are processors in the block of processors 64 , depicted in FIG. 3. Referring back to FIG. 5A, the portions of bins that can be combined are then combined to provide the variable sized bins, via step 146 .
- step 146 includes combining those bins, in there entirety, which step 144 determined could be combined without overflowing the processors to provide the variable-sized bins.
- portions of bins can be combined horizontally if the resulting bin crosses the entire display.
- the variable-sized bins are the provided for rendering, via step 148 .
- step 148 includes providing a display list including the primitives in each of the variable-sized bin, variable-sized bin by variable-sized bin.
- steps 146 and 148 can be provided in a single step.
- the combining of bins could take place by ordering the primitives appropriately in the display list.
- the variable-sized bins may then be rendered pixel by pixel in raster order.
- FIGS. 5A-5C For an example of how the method 140 functions, refer to FIGS. 5A-5C. For clarity, it is presumed that there are only three processors in the block of processors 64 , depicted in FIG. 2. Thus, the overflow parameter is three.
- FIG. 5B depicts one way in which the display 150 can be divided into sections when the method 140 is used. The display 150 corresponds to the display 1 and, therefore, includes primitives 2 , 3 , 4 , 5 , and 6 .
- FIG. 5C depicts the bins 161 - 166 provided and combined by one preferred embodiment of the method 140 . Preferably, the bins 161 - 166 are preferably of the same size.
- the sections 151 - 156 to which the bins 161 - 166 correspond are preferably of the same size.
- the display 150 is thus broken into sections 151 , 152 , 153 , 154 , 155 , and 156 of equal size.
- Each section 151 , 152 , 153 , 154 , 155 , and 156 corresponds to a particular bin 161 , 162 , 163 , 164 , 165 , and 166 , respectively.
- the primitives 2 , 3 , 4 , 5 , and 6 are stored in the bins 161 - 166 which correspond to the sections 161 - 166 that the primitives 2 , 3 , 4 , 5 , and 6 intersect.
- the primitives are stored in minimum y-value order.
- the bin 163 includes primitive 4 , 6 , 2 , 5 , and 3 , in that order. It is determined whether any of the bins 161 - 166 can be combined without causing an overflow.
- three processors are available.
- a bin 161 - 166 can be combined with another bin 161 - 166 if the combination 1405 P has three or fewer primitives 2 , 3 , 4 , 5 , and 6 . If section 151 and 152 are combined, there are only two primitives 2 and 3 present in the combined section.
- bins 161 and 162 and bins 164 , 165 , and 166 can be combined without violating the overflow parameter. It will thus be determined in step 144 that bins 161 and 162 and bins 164 , 165 , and 166 can be combined. Consequently, the bins 161 and 162 are combined to form bin the 167 and the bins 164 - 166 are combined to provide the bin 168 , using step 146 .
- the bin 163 includes four primitives, 2 , 3 , 4 , and 5 .
- bin 163 will cause the system to overflow even if it is not combined.
- bins 163 will be treated separately, for example by splitting or overlaying portions of the bin 163 to be rendered separately. At least the bins 167 , 163 , and 168 are thus the variable-sized bins provided for rendering.
- FIG. 6A depicts a more detailed flow chart of a preferred version of the first embodiment of a method 170 for providing the variable sized bins.
- the primitives 2 , 3 , 4 , 5 , and 6 are stored in the appropriate buckets of equal sized bins, via step 172 .
- Each bin includes a left bucket and a right bucket.
- a primitive 2 , 3 , 4 , 5 , or 6 is stored in a right bucket if the primitive 2 , 3 , 4 , 5 , or 6 crosses a right boundary of a section corresponding to a particular bin.
- a primitive 2 , 3 , 4 , 5 , or 6 is stored in the left bucket if the primitive 2 , 3 , 4 , 5 , or 6 does not cross the right boundary of the section corresponding to the particular bin.
- storing the primitives 2 , 3 , 4 , 5 , and 6 may include storing the data for the primitives in the appropriate buckets.
- Step 172 also includes ordering the primitives 2 , 3 , 4 , 5 , and 6 in the buckets based on the primitives' minimum y values.
- the primitives 2 , 3 , 4 , 5 , and 6 are arranged from first to last in the appropriate buckets, based upon the highest point in the display 150 for the primitive.
- step 172 includes storing the top and bottom scans for each primitive. The top and bottom scans correspond to the minimum and maximum y-values for the primitive.
- step 174 includes determining if any of the bins contain a sufficient number of primitives to violate the overflow parameter. Preferably this is accomplished in one step after the primitives 2 , 3 , 4 , 5 , and 6 have been stored in the appropriate bins. Step 174 is also preferably accomplished by using the top scan line and bottom scan line for each primitive store in a bin to determined the whether the number of primitives 2 , 3 , 4 , 5 , or 6 on a particular scan line of a bin is greater than the overflow parameter. If the certain bins overflow, then these bins are treated separately, via step 176 .
- step 176 includes overlaying the bins which overflow.
- step 176 could include splitting the bins that overflow is splitting the bin will prevent the overflow.
- step 176 includes a mechanism which will allow those bins that overflow, such as the bin 163 depicted in FIG. 5C, to be processed preferably without causing an overflow of the system 50 .
- a bin is selected as a current bin, via step 178 .
- step 178 includes selecting a bin as the current bin only if the bin has been determined not to overflow in step 174 . It is determined if the current bin can be combined with one or more other bins without the combination overflowing, via step 180 . Preferably, at least one of the other bins is adjacent to the current bin and the other bins are mutually adjacent. If the current bin cannot be combined without an overflow, the current bin is considered to be one of the variable-sized bins. If the current bin cannot be combined without an overflow, then it is determined if all of the desired bins have been attempted to be combined, via step 182 .
- the current bin is combined with one or more other bins to provide one of the variable-sized bins, via step 184 .
- the bin(s) with which the current bin are combined with are those which were determined in step 182 .
- the current bin is combined with other bin(s) such that a primitive in more than one bin only appears once in the variable-sized bin that results from the combination.
- Step 182 is then returned to.
- Step 182 determines whether all of the desired bins have been attempted to be combined. If not, then step 178 is returned to. If so, then a display list which orders the primitives variable-sized bin by variable-sized bin is provided, via step 186 .
- step 184 of combining the bins is carried out by providing the display list in step 186 . In such an embodiment, the primitives in the bins to be combined would be provided together in the display list without otherwise combining the bins.
- FIG. 6B is a diagram depicting how bins are combined.
- FIG. 5C depicts the sections 151 , 152 , 153 , 154 , 155 , and 156 corresponding to the bins.
- the primitives 2 , 3 , 4 , and 5 are stored in the bins 161 ′, 162 ′, 163 ′, 164 ′, 165 ′, and 166 ′.
- the bins 161 ′, 162 ′, 163 ′, 164 ′, 165 ′, and 166 ′ correspond to the sections 151 , 152 , 153 , 154 , 155 , and 156 , respectively. Because the primitives 2 and 3 cross the right boundary of the bin 161 ′ (the section 151 ), the primitives 2 and 3 are stored in the right bucket 182 of the bin 161 ′. Because there are no primitives in the display 150 that intersect bin 161 ′ (the section 1521 ) but do not cross the right boundary of the bin 161 ′ (the section 151 ), the left bucket 181 of the bin 161 ′ is empty.
- the primitives 2 and 3 cross the right boundary of the bin 162 ′ (the section 152 )
- the primitives 2 and 3 are stored in the right bucket 184 of the bin 162 ′.
- the left bucket 183 of the bin 162 ′ is empty.
- the primitives 4 and 5 cross the right boundary of the bin 163 ′ (the section 153 )
- the primitives 4 and 5 are stored in the right bucket 186 of the bin 163 ′.
- primitives 2 and 3 intersect bin 163 ′ (the section 153 ) but do not cross the right boundary of the bin 163 ′ (the section 153 ), primitives 2 and 3 are stored in the left bucket 185 of the bin 163 ′. Because the primitives 4 and 5 cross the right boundary of the bin 164 ′ (the section 154 ), the primitives 4 and 5 are stored in the right bucket 188 of the bin 164 ′. Because there are no primitives that intersect bin 164 ′ (the section 154 ) but do not cross the right boundary of the bin 164 ′ (the section 154 ), the left bucket 187 of the bin 164 ′ is empty.
- the primitive 6 crosses the right boundary of the bin 165 ′ (the section 155 ), the primitive 6 is stored in the right bucket 190 of the bin 165 ′. Because the primitives 4 and 5 intersect bin 165 ′ (the section 155 ) but do not cross the right boundary of the bin 165 ′ (the section 155 ), primitives 4 and 5 are stored in the left bucket 189 of the bin 165 ′. Because no primitives cross the right boundary of the bin 166 ′ (the section 156 ), the right bucket 192 of the bin 166 ′ is empty. Because the primitive 6 intersects bin 166 ′ (the section 156 ) but does not cross the right boundary of the bin 166 ′ (the section 156 ), the primitive 6 is stored in the left bucket 181 of the bin 162 ′.
- the overflow parameter may be four.
- none of the bins 161 ′- 166 ′, or the corresponding sections 151 - 156 include more than four primitives 2 , 3 , 4 , 5 , and 6 . Consequently, none of the bins overflow.
- all of the bins 161 ′- 166 ′ are candidates to be combined.
- the overflow parameter is four, the bins 161 ′, 162 ′, 163 ′, and 164 ′ can be combined into bin 167 ′ without overflowing.
- primitives 2 , 3 , 4 , and 5 can be stored in a single bin 167 ′ that corresponds to the bins 161 ′- 164 ′ and, therefore, to sections 151 - 154 .
- bins 165 ′ and 166 ′ can be combined into a single bin 168 ′ without overflowing.
- the bins 161 ′- 166 ′ are also preferably combined such that the primitives 2 , 3 , 4 , and 5 are stored only once in each variable sized bins 167 ′ and 168 ′. Preferably, this is accomplished by storing only those primitives which are in the left bucket for a bin, except for the last bin that is being combined. For the last bin, those primitives in the right bucket and the left bucket are combined. For example, there are no primitives in the left bucket 181 or 183 for the bins 161 ′ and 162 ′. Thus, no primitives are added. However, primitives 2 and 3 are in the left bucket 185 for the bin 163 ′.
- variable-sized bin 167 ′ includes primitives 4 and 5 in the right bucket 194 and primitive 2 and 3 in the right bucket 193 .
- the primitives 2 , 3 , 4 , and 5 are stored in order in the variable-sized bin 167 ′ based on their minimum y-values.
- variable-sized bin 167 ′ could include primitives 2 and 3 in both the right bucket 194 and the left bucket 193 and primitives 4 and 5 in the right bucket 194 .
- the right bucket 194 would store the primitive 2 ahead of the primitive 3 in the left bucket 193 .
- the right bucket 194 would store primitives 4 , 2 , 5 , and 3 in order because this arranges the primitives 2 , 3 , 4 , and 5 in minimum y-value order.
- variable-sized bin 168 ′ includes primitives 4 , 5 , and 6 .
- bin 165 ′ When bin 165 ′ is combined, primitives 4 and 5 in the left bucket 189 are stored in the left bucket 195 of the variable-sized bin 168 ′.
- the primitive 6 is not stored because it is in the right bucket 190 of the bin 165 ′.
- the bin 165 ′ when the bin 165 ′ is combined, the primitive 6 is stored because it is in the left bucket 191 of the bin 166 ′. If there were primitives in the right bucket 192 , those primitives would have been stored in the variable-sized bin 168 ′ because the bin 166 ′ is the last bin being combined.
- a display list is then provided from the variable-sized bins 167 ′ and 168 ′.
- the display list preferably provides the primitives variable-sized bin by variable-sized bin and preferably orders the primitives in minimum y-value order. Consequently, the display list would include primitives 4 , 2 , 5 , and 3 then primitives 4 , 6 , and 5 .
- the portions of primitives 4 , 2 , 5 , and 3 intersecting the variable-sized bin 167 ′ are rendered first, followed by the portions of primitives 4 , 6 , and 5 intersecting the variable sized bin 168 ′ (intersecting sections 155 and 156 ).
- the display list allows the primitives in a scan line to be provided in parallel to the processors of the block of processors in FIG. 3 and the pixels in each of the variable-sized bins 167 ′ and 168 ′ pixel by pixel in raster order.
- each variable-sized bin either does not overflow or is treated separately. In either case, each variable-sized bin can be rendered without causing an overflow in the computer graphics system, such as the system 50 . Therefore, the primitives in a scan line for each variable-sized bin can be provided in parallel to processors in the block of processors 64 . Each variable-sized bin can, therefore, be rendered pixel-by pixel in raster order without overflowing or slowing the system 50 . Consequently, efficiency of providing graphical images is improved.
- FIG. 7A depicts a more detailed flow chart of a second embodiment of a method 200 in accordance with the present invention for providing variable-sized bins.
- the method 200 is used to render a graphical image that is part of a series of graphical images. Each graphical image in the series in known as a frame.
- a plurality of bins is determined based on a previous frame, via step 202 .
- the plurality of bins was considered to be optimal under some set of criteria for rendering the previous frame.
- a set of bins is optimal if the previous frame can be rendered using the smallest total number of bins and having the smallest number of bins which violate the overflow parameter.
- each of the plurality of bins provided in step 202 can preferably vary in size.
- the previous frame is the frame immediately previous to the frame currently being rendered.
- the plurality of variable-sized bins was actually used to render the previous frame.
- the variable sized bins are determined when the previous frame was rendered.
- the plurality of variable-sized bins was not used to render the previous frame, but are determined between frames.
- the plurality of variable-sized bins that store the primitives are then provided, via step 204 , based on the plurality of bins determined in step 202 .
- the plurality of variable-sized bins is the same as the bins determined in step 202 .
- the plurality of variable-sized bins is provided based on the bins determined in step 202 . For example, portions of or all of some number of the bins determined in step 202 may be combined or split to provide the variable-sized bins, as discussed below.
- Step 202 preferably includes storing the primitives in the variable-sized bins in order based on the minimum y-value of the primitives.
- Step 202 also preferably includes storing the top and bottom scan values.
- FIG. 7B depicts the display 210 having a plurality of sections 211 , 212 , 213 , 214 , 215 , 216 , and 217 corresponding to a plurality of bins which were determined based on a previous frame.
- FIG. 7C depicts the bins 221 , 222 , 223 , 224 , 225 , 226 , and 227 corresponding to the sections 211 , 212 , 213 , 214 , 215 , 216 , and 217 , respectively.
- the bins 221 - 227 store the primitives 2 , 3 , 4 , 5 , and 6 .
- the bins 221 - 227 are used as the variable-sized bins in the step 204 .
- the variable-sized bins are provided based on the bins 221 - 227 , for example by combining portions of one or more bins 221 - 227 or by splitting one or more of the bins 221 - 227 .
- Such an embodiment might be considered to be a combination of the method 200 and the method 140 or 170 .
- FIG. 8A depicts one version of the second embodiment of a method 230 in accordance with the present invention.
- the method 230 can be considered to be a combination of the method 200 and the method 170 .
- the plurality of bins is determined based on a previous frame, via step 232 .
- the primitives 2 , 3 , 4 , 5 , and 6 are stored in the appropriate buckets of the bins which were determined in step 232 .
- Each bin includes a left bucket and a right bucket.
- a primitive 2 , 3 , 4 , 5 , or 6 is stored in a right bucket if the primitive 2 , 3 , 4 , 5 , or 6 crosses a right boundary of a section corresponding to a particular bin.
- a primitive 2 , 3 , 4 , 5 , or 6 is stored in the left bucket if the primitive 2 , 3 , 4 , 5 , or 6 does not cross the right boundary of the section corresponding to the particular bin.
- storing the primitives 2 , 3 , 4 , 5 , and 6 may include storing the data for the primitives in the appropriate buckets.
- Step 234 also includes ordering the primitives 2 , 3 , 4 , 5 , and 6 in the buckets based on the primitives' minimum y-values.
- the primitives 2 , 3 , 4 , 5 , and 6 are arranged from first to last in the appropriate buckets, based upon the highest point in the display 150 for the primitive.
- step 234 includes storing the top and bottom scans for each primitive. The top and bottom scans correspond to the minimum and maximum y-values for the primitive.
- step 236 includes determining if any of the bins contain a sufficient number of primitives to violate the overflow parameter. Preferably this is accomplished in one step after the primitives 2 , 3 , 4 , 5 , and 6 have been stored in the appropriate bins. Step 236 is also preferably accomplished by using the top scan line and bottom scan line for each primitive store in a bin to determined the whether the number of primitives 2 , 3 , 4 , 5 , or 6 on a particular scan line of a bin is greater than the overflow parameter. If certain bins overflow, then these bins are treated separately, via step 238 .
- step 238 includes overlaying the bins which overflow.
- step 238 could include splitting the bins that overflow is splitting the bin will prevent the overflow.
- step 238 includes a mechanism which will allow those bins that overflow to be processed preferably without causing an overflow of the system 50 .
- step 240 includes selecting a bin as the current bin only if the bin has been determined not to overflow in step 236 . It is determined if the current bin can be combined with one or more other bins without the combination overflowing, via step 242 . Preferably, at least one of the other bins is adjacent to the current bin and the other bins are mutually adjacent. If the current bin cannot be combined without an overflow, the current bin is considered to be one of the variable-sized bins. If the current bin cannot be combined without an overflow, then it is determined if all of the desired bins have been attempted to be combined, via step 246 .
- the current bin is combined with one or more other bins to provide one of the variable-sized bins, via step 244 .
- the bin(s) with which the current bin is combined with are those which were determined in step 242 .
- the current bin is combined with other bin(s) such that a primitive in more than one bin only appears once in the variable-sized bin that results from the combination.
- Step 246 is then returned to.
- Step 246 determines whether all of the desired bins have been attempted to be combined. If not, then step 240 is returned to. If so, then a display list which orders the primitives variable-sized bin by variable-sized bin is provided, via step 248 .
- step 244 is performed in step 248 .
- providing the display list may also effectively combine the bins by providing the primitives in the bins to be combined together in the display list.
- FIG. 8B is a diagram depicting how bins are combined.
- FIG. 7B depicts the display 210 having a plurality of sections 211 , 212 , 213 , 214 , 215 , 216 , and 217 corresponding to a plurality of bins which were determined based on a previous frame.
- the primitives 2 , 3 , 4 , and 5 are stored in the bins 221 ′, 222 ′, 223 ′, 224 ′, 225 ′, 226 ′, and 227 ′.
- the bins 221 ′, 222 ′, 223 ′, 224 ′, 225 ′, 226 ′, and 227 ′ correspond to the sections 211 , 212 , 213 , 214 , 215 , 216 , and 217 , respectively. Because the primitives 2 and 3 cross the right boundary of the bin 221 ′ (the section 211 ), the primitives 2 and 3 are stored in the right bucket 252 of the bin 221 ′. Because there are no primitives in the display 210 that intersect bin 251 ′ (the section 211 ) but do not cross the right boundary of the bin 221 ′ (the section 211 ), the left bucket 251 of the bin 221 ′ is empty.
- the primitives 2 and 3 cross the right boundary of the bin 222 ′ (the section 212 )
- the primitives 2 and 3 are stored in the right bucket 254 of the bin 222 ′. Because there are no primitives that intersect bin 222 ′ (the section 212 ) but do not cross the right boundary of the bin 222 ′ (the section 212 ), the left bucket 253 of the bin 162 ′ is empty. Because there are no primitives in the bin 223 ′ (the section 213 ), the left bucket 255 and right bucket 256 of the bin 223 ′ are empty.
- the primitives 2 and 3 intersect but do not cross the right boundary of the bin 224 ; (the section 214 ), the primitives 2 and 3 are stored in the left bucket 257 of the bin 224 ′. Because there are no primitives that intersect bin 224 ′ (the section 214 ) and cross the right boundary of the bin 224 ′ (the section 214 ), the right bucket 258 of the bin 224 ′ is empty. Because the primitives 2 , 4 , and 6 cross the right boundary of the bin 225 ′ (the section 215 ), the primitives 4 , 5 , and 6 are stored in the right bucket 260 of the bin 225 ′.
- the right bucket 264 of the bin 227 ′ is empty. Because the primitives 4 and 6 intersect the bin 227 ′ (the section 217 ) but do not cross the right boundary of the bin 227 ′ (the section 217 ), the primitives 4 and 6 are stored in the left bucket 263 of the bin 227 ′.
- the overflow parameter may be three.
- none of the bins 221 ′- 227 ′, or the corresponding sections 211 - 217 include more than three primitives 2 , 3 , 4 , 5 , and 6 . Consequently, none of the bins overflow.
- all of the bins 221 ′- 227 ′ are candidates to be combined. Because the overflow parameter is three, the bins 211 ′, 212 ′, 213 ′, and 214 ′ can be combined into bin 228 ′ without overflowing.
- primitives 2 and 3 can be stored in a single bin 228 ′ that corresponds to the bins 221 ′- 224 ′ and, therefore, to sections 211 - 214 .
- bins 225 ′, 226 ′, and 227 ′ can be combined into a single bin 229 ′ without overflowing.
- the bins 221 ′- 227 ′ are also preferably combined such that the primitives 2 , 3 , 4 , and 5 are stored only once in each variable sized bins 228 ′ and 229 ′. Preferably, this is accomplished by storing only those primitives which are in the left bucket for a bin, except for the last bin that is being combined. For the last bin, those primitives in the right bucket and the left bucket are combined. For example, there are no primitives in the left bucket 251 , 253 , or 255 for the bins 221 ′, 222 ′, and 223 ′. Thus, no primitives are added. However, primitives 2 and 3 are in the left bucket 257 for the bin 224 ′.
- variable-sized bin 228 ′ includes primitives 2 and 3 in the left bucket 265 and no primitives in the right bucket 266 .
- the primitives 2 and 3 are stored in order in the variable-sized bin 228 ′ based on their minimum y-values. Note, however, that in an alternate embodiment, the variable-sized bin 228 ′ could include primitives 2 and 3 in both the right bucket 266 and the left bucket 265 .
- Providing the display list might then combine the bins 221 ′, 222 ′, 223 ′, and 224 ′. In an alternate embodiment, no combining is provided until the display list is provided. In such an embodiment, the display list still combines the bins 221 ′, 222 ′, 223 ′, and 224 ′.
- variable-sized bin 229 ′ includes primitives 4 , 5 , and 6 .
- bin 225 ′ When bin 225 ′ is combined, no primitives are added to the buckets 267 and 268 of the variable-sized bin 229 ′ because there are no primitives in the left bucket 259 of the bin 225 ′.
- the bins 226 ′ and 227 ′ are combined, the primitives 4 , 5 , and 6 are stored because they are in the left buckets 261 and 263 of the bins 226 ′ and 227 ′, respectively.
- variable-sized bin 229 ′ could include primitives 4 , 5 , and 6 in both the right bucket 267 and the left bucket 268 .
- Providing the display list might then combine the bins 225 ′, 226 ′, and 227 ′.
- no combining is provided until the display list is provided. In such an embodiment, the display list still combines the bins 225 ′, 226 ′, and 227 ′.
- a display list is then provided from the variable-sized bins 228 ′ and 229 ′.
- the display list preferably provides the primitives variable-sized bin by variable-sized bin and preferably orders the primitives in minimum y-value order. Consequently, the display list would include primitives 2 and 3 then primitives 4 , 6 , and 5 .
- the portions of primitives 2 and 3 intersecting the variable-sized bin 228 ′ are rendered first, followed by the portions of primitives 4 , 6 , and 5 intersecting the variable sized bin 229 ′ (intersecting sections 215 , 216 , and 217 ).
- the display list allows the primitives in a scan line to be provided in parallel to the processors of the block of processors in FIG. 3 and the pixels in each of the variable-sized bins 228 ′ and 229 ′ pixel by pixel in raster order.
- each variable-sized bin either does not overflow or is treated separately. In either case, each variable-sized bin can be rendered without causing an overflow in the computer graphics system, such as the system 50 . Therefore, the primitives in a scan line for each variable-sized bin can be provided in parallel to processors in the block of processors 64 . Each variable-sized bin can, therefore, be rendered pixel-by pixel in raster order without overflowing or slowing the system 50 . Consequently, efficiency of providing graphical images is improved.
Abstract
Description
- The present invention relates to graphics processing in a computer system, and more particularly to a method and system for more efficiently rendering a graphical image.
- A conventional computer graphics system can display a graphical image on a display. The display includes a plurality of displays elements, known as pixels, typically arranged in a grid. In order to display objects, the conventional computer graphics system typically breaks the objects into a plurality of polygons. The conventional system then typically renders the polygons in a particular order. For a three-dimensional scene, the polygons are generally rendered from back to front as measured from the viewing plane of the display. Similarly, a two-dimensional scene can be displayed where polygons are rendered based on their layer. Shallower layers occlude deeper layers.
- For example, FIG. 1 is a block diagram of a
display 1 depicting a graphical image The display includes a plurality ofpixels 8, only one of which is labeled. The graphical image includesprimitives primitives - One conventional method used in rendering the graphical image renders the image primitive by primitive in a particular order. For a three-dimensional scene, the primitives are generally rendered from back to front as measured from the viewing plane of the display. Similarly, a two-dimensional scene can be displayed where primitives are rendered based on their layer. Shallower layers occlude deeper layers. For example, the primitive2 might be rendered first, followed in order by
primitives - FIG. 2A depicts another
conventional method 10 for rendering a graphical image. FIG. 2B depicts adisplay 20 including theprimitives conventional method 10. Referring to FIGS. 2A and 2B, in order to render the graphic image, portions of thedisplay 1 are rendered one at a time. Thus, a plurality of tiles, each tile having a fixed size, is defined, viastep 12. A tile is typically a two-dimensional rectangle containing n×m pixels. Thetiles display 20. Theprimitives tile 21 is rendered first. Whentile 21 has completed rendering, the portion of the primitive 4 intile 22 is rendered. Whentile 22 is completed, the portions of theprimitives tile 23 are rendered. This process continues, rendering the graphical image primitive by primitive and tile by tile, until all primitives in all tiles have been rendered. - Although these conventional methods function, one of ordinary skill in the art will readily realize that it is desirable to provide data for an image in raster order. Furthermore, it would desirable if the image is efficiently rendered. Consequently, STELLAR SEMICONDUCTOR of San Jose, Calif. developed a system for rendering a graphical image pixel by pixel, in raster order. Raster order is from left to right and top to bottom across the
display 1. This system is described in U.S. patent application Ser. No. 08/624,261, entitled “METHOD AND APPARATUS FOR IDENTIFYING AN ELIMINATING THREE-DIMENSIONAL OBJECTS VISUALLY OBSTRUCTED FORM A PLANAR SURFACE” filed on Mar. 29, 1996 and assigned to the assignee of the present application and in co-pending U.S. patent application Ser. No. 08/624,260, entitled “GRAPHICS PROCESSORS, SYSTEM AND METHOD FOR GENERATING SCREEN PIXELS IN RASTER ORDER UTILIZING A SINGLE INTERPOLATOR” filed on Mar. 29, 1996 and assigned to the assignee of the present application. - FIG. 3 depicts a high-level block diagram of one embodiment of such a
computer graphics system 50. Thesystem 50 includes a central processing unit (CPU) 52, adisplay 54, auser interface 56 such as a keyboard or mouse or other communicating device, amemory 58, and animage generating unit 60 coupled with one ormore buses 58. Thedisplay 54 includes a display, such as thedisplay 1. Thedisplay 14 also includes adisplay memory 55 to which data for pixels are written prior to being shown on thedisplay 1. In order to display graphical images, the objects are broken into polygons to be used in rendering the objects. In a preferred embodiment, the polygons are rendered in raster order. That is, portions of the polygons are rendered pixel by pixel in the order of the pixels in thedisplay 54. - The
image generating unit 60 is used in rendering the graphical image. The image generating unit includes aninterface 61 connected to thebus 58. Theinterface 61 transmits data to adata processing unit 62. The block ofprocessors 64 identifies data describing portions of primitives (“intersecting primitives”) which intersect the area extending along a z-axis from a selected pixel in an x-y plane corresponding to a screen of thedisplay 14. The block ofprocessors 64 may include a number of processors, allowing intersecting primitives to be processed in parallel. By processing the primitives in parallel, the block ofprocessors 64 can provide an indication of the fragments that intersect pixels currently being processed in a particular scan line. An obstructed object identifier/removal unit (Quick Z) 66 receives at least a portion of the fragment from each intersecting polygon associated with the selected pixel and removes portions of the fragments for intersecting polygons that are obstructed. - The
interpolator 68 receives the remaining fragments for the intersecting polygons for the selected pixel and interpolates the data, including interpolating texture, color, and alpha values for the fragment. Theinterpolator 68 also provides a coverage mask for each fragment. The coverage mask indicates the portion of the pixel that the fragment covers. The fragments for remaining intersecting polygons are provided by theinterpolator 68 to ahardware sorter 70. The hardware sorter 70 sorts the fragments for the intersecting polygons based on the value of a key such as the z value, or depth value, for the fragment. - An antialiasing/blending/accumulating
unit 72 performs antialiasing using the mask provided by theinterpolator 68. Theantialiasing unit 72 may multiple units used in antialiasing, accumulating data, and blending data. The antialiased data is provided to thedisplay 14 pixel by pixel in raster order. - Although the above-mentioned co-pending applications function well for their intended purpose, the processors in the block of
processors 64 may overflow. In order to render the images in raster order, a number of the primitives intersecting pixels in a particular scan line (a row of pixels on the display 1) are processed in parallel. There are also a finite number of processors in the block ofprocessors 64. For example, in one embodiment, sixty-four processors are provided in the block ofprocessor block 64. When a particular scan line contains a large number of primitives, more primitives than processors in the block ofprocessors 64 may be attempted to be processed in parallel. The block ofprocessors 64 may then overflow. Such an overflow is undesirable. Furthermore, efficient rendering of the graphical image is desired. - Accordingly, what is needed is a system and method for efficiently rendering a graphical image. It would be desirable if an overflow of processors can be avoided. The present invention addresses such a need.
- The present invention provides a method and system for providing a graphical image on a display of a system. The graphical image is provided from data describing a plurality of to primitives. The display includes a plurality of pixels. The method and system comprise providing a plurality variable-sized bins containing the plurality of primitives and rendering the plurality of primitives by rendering each of the plurality of variable-sized bins variable-sized bin by variable-sized bin. In a first aspect, the system also includes a plurality of processors for processing a portion of the plurality of primitives in parallel. In this aspect, the variable-sized bin providing step further includes the steps of storing the plurality of primitives in a plurality of bins and determining if a part of a portion of the plurality of bins can be combined without causing the plurality of processors to overflow. In this aspect, the method and system also comprise combining the part of the portion of the plurality of bins to provide the plurality of variable-sized bins if the part of the portion of the plurality of bins can be combined without causing the plurality of processors to overflow. The plurality of variable-sized bins can include fewer bins than the plurality of bins. In another aspect, the method and system further include determining a plurality of bins for a previous frame and providing the plurality of bins containing the plurality of primitives.
- According to the system and method disclosed herein, the present invention efficiently separates the graphical image into variable-sized bins that can be separately rendered without overflowing the system.
- FIG. 1 is a diagram of a display including a graphical image.
- FIG. 2A is a high-level flow chart of a conventional method for rendering a graphical image.
- FIG. 2B is a diagram of the display when the conventional method is used to render the graphical image.
- FIG. 3 is a high-level block diagram of a computer graphics system in which the present invention can be used.
- FIG. 4A is a high-level flow chart of one embodiment method for rendering a graphical image in accordance with the present invention.
- FIG. 4B is a diagram of one way in which a display could be divided in accordance with the present invention.
- FIG. 5A is a flow chart of a first embodiment of a method for providing variable-sized bins in accordance with the present invention.
- FIG. 5B is a diagram of one way in which a display could be divided in accordance when the first embodiment of a method in accordance with the present invention for providing variable-sized bins.
- FIG. 5C is a diagram of how the bins are provided and combined in accordance when the first embodiment of a method in accordance with the present invention for providing variable-sized bins.
- FIG. 6A is a more detailed flow chart of a preferred version of the first embodiment of a method for providing variable-sized bins in accordance with the present invention.
- FIG. 6B is a diagram of how the bins are provided and combined in accordance when the preferred version of the first embodiment of a method in accordance with the present invention for providing variable-sized bins.
- FIG. 7A is a flow chart of a second embodiment of a method for providing variable-sized bins in accordance with the present invention.
- FIG. 7B is a diagram of one way in which a display could be divided in accordance when the second embodiment of a method in accordance with the present invention for providing variable-sized bins.
- FIG. 7C is a diagram of how the bins are provided and combined in accordance when the second embodiment of a method in accordance with the present invention for providing variable-sized bins.
- FIG. 8A is a more detailed flow chart of the second embodiment of a method for providing variable-sized bins in accordance with the present invention.
- FIG. 8B is a diagram of how the bins are provided and combined in accordance when the preferred version of the second embodiment of a method in accordance with the present invention for providing variable-sized bins.
- The present invention relates to an improvement in processing of graphical images. The following description is presented to enable one of ordinary skill in the art to make and use the invention and is provided in the context of a patent application and its requirements. Various modifications to the preferred embodiment will be readily apparent to those skilled in the art and the generic principles herein may be applied to other embodiments. Thus, the present invention is not intended to be limited to the embodiment shown, but is to be accorded the widest scope consistent with the principles and features described herein.
- As discussed above, FIG. 1 depicts a
display 1 including a graphical image. The graphical image includesprimitives primitives - In order to render the graphical image, conventional computer graphics systems may employ a variety of methods. In one conventional system, the graphical image is rendered primitive by primitive. For example, the entire primitive2 may be rendered first. The remaining primitives would then be rendered primitive by primitive. Alternatively, a conventional computer graphics system could break the
display 1 into several tile of fixed, typically equal, size. The conventional system then renders the graphical image tile by tile. Thus, the portions of each primitive in a particular tile are rendered before a portion of the primitives in another tile. - In order to improve the efficiency of memory use, a recently developed computer graphics system renders a graphical image pixel by pixel, in raster order. Thus, fragments for all of the primitives intersecting a particular pixel are rendered, then the fragments for primitives intersecting another pixel are rendered. Such a
system 50 is depicted in FIG. 2. - Although this method and
system 50 depicted in and discussed in conjunction with FIG. 2 function effectively, thesystem 50 utilizes a plurality of processors in the block ofprocessors 64. The processors processes primitives intersecting a particular scan line in parallel. Preferably all of the primitives intersecting a scan line are processed in parallel. Because there are a finite number of processors, the number of primitives intersecting a scan line can exceed the number of processors. Consequently, the processors in the block ofprocessors 64 may overflow, which adversely affects system performance. - The present invention provides a method and system for providing a graphical image on a display of a system. The graphical image is provided from data describing a plurality of primitives. The display includes a plurality of pixels. The method and system comprise providing a plurality variable-sized bins containing the plurality of primitives and rendering the plurality of primitives by rendering each of the plurality of variable-sized bins variable-sized bin by variable-sized bin. In a first aspect, the system also includes a plurality of processors for processing a portion of the plurality of primitives in parallel. In this aspect, the variable-sized bin providing step further includes the steps of storing the plurality of primitives in a plurality of bins and determining if a part of a portion of the plurality of bins can be combined without causing the plurality of processors to overflow. In this aspect, the method and system also comprise combining the part of the portion of the plurality of bins to provide the plurality of variable-sized bins if the part of the portion of the plurality of bins can be combined without causing the plurality of processors to overflow. The plurality of variable-sized bins can include fewer bins than the plurality of bins. In another aspect, the method and system further include determining a plurality of bins for a previous frame and providing the plurality of bins containing the plurality of primitives.
- The present invention will be described in terms of being implemented in a particular system for a particular reason. However, one of ordinary skill in the art will readily recognize that this method and system will operate effectively for other systems. Furthermore, the present inventions will be described in terms of specific algorithms. However, one of ordinary skill in the art will readily realize that the present invention is consistent with the use of other algorithms. For example, certain steps of the flow charts described herein could be performed in another order, including in parallel. In addition, the present invention can be implemented in hardware, rather than in software. The present invention will also be described in the context of a particular number and type of processors, sections, bins, and primitives. The present invention will also be described in terms of a particular overflow condition based on the number or processors. However, one of ordinary skill in the art will readily recognize that the present invention is consistent with another number and type of processors, sections, bins, and primitives as well as a different overflow parameter.
- To more particularly illustrate the method and system in accordance with the present invention, refer now to FIG. 4A, depicting a high-level flow chart of one embodiment of method for rendering a graphical image in accordance with the present invention. The method is preferably implemented on the
system 50 depicted in FIG. 2. In a preferred embodiment, the method and system in accordance with the present invention is implemented by or include software that may be stored in thememory 59 and executed by theCPU 52. However, in another embodiment, the software could be stored elsewhere or executed by another processor (not shown), such as one residing with theimage generation unit 60. - Referring now to FIG. 4A, a plurality of variable-sized bins containing the primitives are provided, via
step 102. A bin is variable sized when the section of the display (described below) to which the bin corresponds can vary in size. Preferably, the primitives intersecting a particular variable-sized bin are stored in the variable-sized bin based on the primitives' minimum y-value and whether or not the primitives cross the right boundary of the particular variable-sized bin. In a preferred embodiment, each of at least a portion of the variable-sized bins includes few enough primitives so that the processors in the block ofprocessors 64 do not overflow. For example, if there are sixty-four primitives, then when possible, each variable-sized bin includes no more than 64 primitives per scan line. However, the primitives allowed in a particular variable-sized bin may depend on other criteria. The primitives are then rendered by rendering the variable-sized bins variable-sized bin by variable-sized bin, viastep 104. Also in a preferred embodiment,step 104 includes rendering each of the variable-sized bins pixel by pixel in raster order. Thus, if only a portion of a primitive intersects a particular variable-sized bin, only that portion of the primitive is rendered when the particular variable-sized bin is rendered. Thus, step 104 preferably includes providing the primitives for a scan line in a variable-sized bin to the processors in the block ofprocessors 64 of FIG. 3. The portions of the primitives intersecting pixels within the scan line are then processed by thesystem 50. - FIG. 4B depicts a generalized view of a
display 110 including a graphical image. Thedisplay 110 is analogous to thedisplay 1 depicted in FIG. 1. Thus, the graphical image includesprimitives sized sections sized sections section 112. Similarly a second variable-sized bin stores data for the primitive 2 and the primitive 3 in thesection 114. A third variable-sized bin stores data for the primitive 4 and the primitive 6 intersecting thesection 116. A fourth variable-sized bin stores a data for theprimitives section 118. A fifth variable-sized bin corresponds to thelast section 120. - FIG. 5A depicts a more detailed flow chart of a first embodiment of a
method 140 in accordance with the present invention for providing variable-sized bins. The primitives are stored in a plurality of bins, viastep 142, preferably in order based on the minimum y-value of the primitives. Storing a primitive may include storing the desired information for the primitive. Thus, the primitives are preferably stored from top to bottom along thedisplay 1. Preferably, the bins are of the same size. The size of a bin is determined by the size of a section, discussed below, to which the bin corresponds. It is determined whether any portions of the bins, preferably adjacent bins, can be combined without violating an overflow parameter, viastep 144. In a preferred embodiment,step 144 determines whether any of the bins, in its entirety, can be combined with another bin, in its entirety. Also in a preferred embodiment, the overflow parameter corresponds to an overflow of the system. An overflow of the system occurs when there are more primitives in a bin than there are processors in the block ofprocessors 64, depicted in FIG. 3. Referring back to FIG. 5A, the portions of bins that can be combined are then combined to provide the variable sized bins, viastep 146. In a preferred embodiment,step 146 includes combining those bins, in there entirety, which step 144 determined could be combined without overflowing the processors to provide the variable-sized bins. Also in a preferred embodiment, portions of bins can be combined horizontally if the resulting bin crosses the entire display. The variable-sized bins are the provided for rendering, viastep 148. Preferably,step 148 includes providing a display list including the primitives in each of the variable-sized bin, variable-sized bin by variable-sized bin. In one embodiment, steps 146 and 148 can be provided in a single step. Thus, the combining of bins could take place by ordering the primitives appropriately in the display list. The variable-sized bins may then be rendered pixel by pixel in raster order. - For an example of how the
method 140 functions, refer to FIGS. 5A-5C. For clarity, it is presumed that there are only three processors in the block ofprocessors 64, depicted in FIG. 2. Thus, the overflow parameter is three. FIG. 5B depicts one way in which thedisplay 150 can be divided into sections when themethod 140 is used. Thedisplay 150 corresponds to thedisplay 1 and, therefore, includesprimitives method 140. Preferably, the bins 161-166 are preferably of the same size. Thus, the sections 151-156 to which the bins 161-166 correspond are preferably of the same size. Thedisplay 150 is thus broken intosections section particular bin primitives primitives bin 163 includes primitive 4, 6, 2, 5, and 3, in that order. It is determined whether any of the bins 161-166 can be combined without causing an overflow. Suppose three processors are available. Thus, a bin 161-166 can be combined with another bin 161-166 if the combination 1405P has three orfewer primitives section primitives sections primitives bins bins step 144 thatbins bins bins bin 168, usingstep 146. Note that thebin 163 includes four primitives, 2, 3, 4, and 5. Consequently,bin 163 will cause the system to overflow even if it is not combined. In a preferred embodiment,bins 163 will be treated separately, for example by splitting or overlaying portions of thebin 163 to be rendered separately. At least thebins - FIG. 6A depicts a more detailed flow chart of a preferred version of the first embodiment of a
method 170 for providing the variable sized bins. Theprimitives step 172. Each bin includes a left bucket and a right bucket. A primitive 2, 3, 4, 5, or 6 is stored in a right bucket if the primitive 2, 3, 4, 5, or 6 crosses a right boundary of a section corresponding to a particular bin. A primitive 2, 3, 4, 5, or 6 is stored in the left bucket if the primitive 2, 3, 4, 5, or 6 does not cross the right boundary of the section corresponding to the particular bin. Thus, storing theprimitives primitives primitives display 150 for the primitive. In addition,step 172 includes storing the top and bottom scans for each primitive. The top and bottom scans correspond to the minimum and maximum y-values for the primitive. - It is then determined if any of the bins overflow, via
step 174. Thus,step 174 includes determining if any of the bins contain a sufficient number of primitives to violate the overflow parameter. Preferably this is accomplished in one step after theprimitives primitives step 176. In a preferred embodiment,step 176 includes overlaying the bins which overflow. In another embodiment, step 176 could include splitting the bins that overflow is splitting the bin will prevent the overflow. In any event,step 176 includes a mechanism which will allow those bins that overflow, such as thebin 163 depicted in FIG. 5C, to be processed preferably without causing an overflow of thesystem 50. - Referring back to FIG. 6A, a bin is selected as a current bin, via
step 178. In a preferred embodiment,step 178 includes selecting a bin as the current bin only if the bin has been determined not to overflow instep 174. It is determined if the current bin can be combined with one or more other bins without the combination overflowing, viastep 180. Preferably, at least one of the other bins is adjacent to the current bin and the other bins are mutually adjacent. If the current bin cannot be combined without an overflow, the current bin is considered to be one of the variable-sized bins. If the current bin cannot be combined without an overflow, then it is determined if all of the desired bins have been attempted to be combined, viastep 182. - If it is determined that the current bin can be combined, then the current bin is combined with one or more other bins to provide one of the variable-sized bins, via
step 184. The bin(s) with which the current bin are combined with are those which were determined instep 182. Preferably, the current bin is combined with other bin(s) such that a primitive in more than one bin only appears once in the variable-sized bin that results from the combination. Step 182 is then returned to. Step 182 determines whether all of the desired bins have been attempted to be combined. If not, then step 178 is returned to. If so, then a display list which orders the primitives variable-sized bin by variable-sized bin is provided, viastep 186. In one embodiment, step 184 of combining the bins, is carried out by providing the display list instep 186. In such an embodiment, the primitives in the bins to be combined would be provided together in the display list without otherwise combining the bins. - To further explicate the
method 170, refer to FIGS. 6B and 5C. FIG. 6B is a diagram depicting how bins are combined. FIG. 5C depicts thesections primitives bins 161′, 162′, 163′, 164′, 165′, and 166′. Thebins 161′, 162′, 163′, 164′, 165′, and 166′ correspond to thesections primitives bin 161′ (the section 151), theprimitives right bucket 182 of thebin 161′. Because there are no primitives in thedisplay 150 that intersectbin 161′ (the section 1521) but do not cross the right boundary of thebin 161′ (the section 151), theleft bucket 181 of thebin 161′ is empty. Because theprimitives bin 162′ (the section 152), theprimitives right bucket 184 of thebin 162′. Because there are no primitives that intersectbin 162′ (the section 152) but do not cross the right boundary of thebin 162′ (the section 152), theleft bucket 183 of thebin 162′ is empty. Because theprimitives bin 163′ (the section 153), theprimitives right bucket 186 of thebin 163′. Because theprimitives bin 163′ (the section 153) but do not cross the right boundary of thebin 163′ (the section 153),primitives left bucket 185 of thebin 163′. Because theprimitives bin 164′ (the section 154), theprimitives right bucket 188 of thebin 164′. Because there are no primitives that intersectbin 164′ (the section 154) but do not cross the right boundary of thebin 164′ (the section 154), theleft bucket 187 of thebin 164′ is empty. Because the primitive 6 crosses the right boundary of thebin 165′ (the section 155), the primitive 6 is stored in theright bucket 190 of thebin 165′. Because theprimitives bin 165′ (the section 155) but do not cross the right boundary of thebin 165′ (the section 155),primitives left bucket 189 of thebin 165′. Because no primitives cross the right boundary of thebin 166′ (the section 156), theright bucket 192 of thebin 166′ is empty. Because the primitive 6 intersectsbin 166′ (the section 156) but does not cross the right boundary of thebin 166′ (the section 156), the primitive 6 is stored in theleft bucket 181 of thebin 162′. - It is presumed that there are four processors in the
processor block 64 of FIG. 2. - Thus, the overflow parameter may be four. Referring back to FIGS. 5A and 6B, none of the
bins 161′-166′, or the corresponding sections 151-156, include more than fourprimitives bins 161′-166′ are candidates to be combined. Because the overflow parameter is four, thebins 161′, 162′, 163′, and 164′ can be combined intobin 167′ without overflowing. Thus,primitives single bin 167′ that corresponds to thebins 161′-164′ and, therefore, to sections 151-154. For the same reasons,bins 165′ and 166′ can be combined into asingle bin 168′ without overflowing. - The
bins 161′-166′ are also preferably combined such that theprimitives sized bins 167′ and 168′. Preferably, this is accomplished by storing only those primitives which are in the left bucket for a bin, except for the last bin that is being combined. For the last bin, those primitives in the right bucket and the left bucket are combined. For example, there are no primitives in theleft bucket bins 161′ and 162′. Thus, no primitives are added. However,primitives left bucket 185 for thebin 163′. Consequently,primitives sized bin 167′. However, theprimitives right bucket 186 and thus are not stored when thebin 163′ is combined. However, theprimitives right bucket 188 for thelast bin 164′ being combined. Thus, the primitive 4 and 5 are stored in the variable-sized bin 167′. Consequently, the variable-sized bin 167′ includesprimitives right bucket 194 and primitive 2 and 3 in theright bucket 193. Furthermore, theprimitives sized bin 167′ based on their minimum y-values. Note, however, that in an alternate embodiment, the variable-sized bin 167′ could includeprimitives right bucket 194 and theleft bucket 193 andprimitives right bucket 194. In such a case, theright bucket 194 would store the primitive 2 ahead of the primitive 3 in theleft bucket 193. Similarly, theright bucket 194 would storeprimitives primitives - Similarly, the variable-
sized bin 168′ includesprimitives bin 165′ is combined,primitives left bucket 189 are stored in theleft bucket 195 of the variable-sized bin 168′. The primitive 6 is not stored because it is in theright bucket 190 of thebin 165′. However, when thebin 165′ is combined, the primitive 6 is stored because it is in theleft bucket 191 of thebin 166′. If there were primitives in theright bucket 192, those primitives would have been stored in the variable-sized bin 168′ because thebin 166′ is the last bin being combined. - A display list is then provided from the variable-
sized bins 167′ and 168′. The display list preferably provides the primitives variable-sized bin by variable-sized bin and preferably orders the primitives in minimum y-value order. Consequently, the display list would includeprimitives primitives sized bin 167′ (intersectingsections primitives sized bin 168′ (intersectingsections 155 and 156). The display list allows the primitives in a scan line to be provided in parallel to the processors of the block of processors in FIG. 3 and the pixels in each of the variable-sized bins 167′ and 168′ pixel by pixel in raster order. - Because the
methods system 50. Therefore, the primitives in a scan line for each variable-sized bin can be provided in parallel to processors in the block ofprocessors 64. Each variable-sized bin can, therefore, be rendered pixel-by pixel in raster order without overflowing or slowing thesystem 50. Consequently, efficiency of providing graphical images is improved. - FIG. 7A depicts a more detailed flow chart of a second embodiment of a
method 200 in accordance with the present invention for providing variable-sized bins. Themethod 200 is used to render a graphical image that is part of a series of graphical images. Each graphical image in the series in known as a frame. A plurality of bins is determined based on a previous frame, viastep 202. Preferably, the plurality of bins was considered to be optimal under some set of criteria for rendering the previous frame. In a preferred embodiment, a set of bins is optimal if the previous frame can be rendered using the smallest total number of bins and having the smallest number of bins which violate the overflow parameter. Thus, each of the plurality of bins provided instep 202 can preferably vary in size. Also in a preferred embodiment, the previous frame is the frame immediately previous to the frame currently being rendered. In one embodiment, the plurality of variable-sized bins was actually used to render the previous frame. Thus, the variable sized bins are determined when the previous frame was rendered. In another embodiment, the plurality of variable-sized bins was not used to render the previous frame, but are determined between frames. - The plurality of variable-sized bins that store the primitives are then provided, via
step 204, based on the plurality of bins determined instep 202. In one embodiment, the plurality of variable-sized bins is the same as the bins determined instep 202. In another embodiment, the plurality of variable-sized bins is provided based on the bins determined instep 202. For example, portions of or all of some number of the bins determined instep 202 may be combined or split to provide the variable-sized bins, as discussed below. Step 202 preferably includes storing the primitives in the variable-sized bins in order based on the minimum y-value of the primitives. Step 202 also preferably includes storing the top and bottom scan values. - FIG. 7B depicts the
display 210 having a plurality ofsections bins sections primitives method 200, the bins 221-227 are used as the variable-sized bins in thestep 204. In another embodiment of themethod 200, the variable-sized bins are provided based on the bins 221-227, for example by combining portions of one or more bins 221-227 or by splitting one or more of the bins 221-227. Such an embodiment might be considered to be a combination of themethod 200 and themethod - FIG. 8A depicts one version of the second embodiment of a
method 230 in accordance with the present invention. Themethod 230 can be considered to be a combination of themethod 200 and themethod 170. The plurality of bins is determined based on a previous frame, viastep 232. Viastep 234, theprimitives step 232. Each bin includes a left bucket and a right bucket. A primitive 2, 3, 4, 5, or 6 is stored in a right bucket if the primitive 2, 3, 4, 5, or 6 crosses a right boundary of a section corresponding to a particular bin. A primitive 2, 3, 4, 5, or 6 is stored in the left bucket if the primitive 2, 3, 4, 5, or 6 does not cross the right boundary of the section corresponding to the particular bin. Thus, storing theprimitives primitives primitives display 150 for the primitive. In addition,step 234 includes storing the top and bottom scans for each primitive. The top and bottom scans correspond to the minimum and maximum y-values for the primitive. - It is then determined if any of the bins overflow, via
step 236. Thus,step 236 includes determining if any of the bins contain a sufficient number of primitives to violate the overflow parameter. Preferably this is accomplished in one step after theprimitives primitives step 238. In a preferred embodiment,step 238 includes overlaying the bins which overflow. In another embodiment, step 238 could include splitting the bins that overflow is splitting the bin will prevent the overflow. In any event,step 238 includes a mechanism which will allow those bins that overflow to be processed preferably without causing an overflow of thesystem 50. - Referring back to FIG. 8A, a bin is selected as a current bin, via
step 240. In a preferred embodiment,step 240 includes selecting a bin as the current bin only if the bin has been determined not to overflow instep 236. It is determined if the current bin can be combined with one or more other bins without the combination overflowing, viastep 242. Preferably, at least one of the other bins is adjacent to the current bin and the other bins are mutually adjacent. If the current bin cannot be combined without an overflow, the current bin is considered to be one of the variable-sized bins. If the current bin cannot be combined without an overflow, then it is determined if all of the desired bins have been attempted to be combined, viastep 246. - If it is determined that the current bin can be combined, then the current bin is combined with one or more other bins to provide one of the variable-sized bins, via
step 244. The bin(s) with which the current bin is combined with are those which were determined instep 242. Preferably, the current bin is combined with other bin(s) such that a primitive in more than one bin only appears once in the variable-sized bin that results from the combination. Step 246 is then returned to. Step 246 determines whether all of the desired bins have been attempted to be combined. If not, then step 240 is returned to. If so, then a display list which orders the primitives variable-sized bin by variable-sized bin is provided, viastep 248. In one embodiment,step 244 is performed instep 248. In such an embodiment, providing the display list may also effectively combine the bins by providing the primitives in the bins to be combined together in the display list. - To further explicate the
method 230, refer to FIGS. 8B and 7B. FIG. 8B is a diagram depicting how bins are combined. FIG. 7B depicts thedisplay 210 having a plurality ofsections primitives bins 221′, 222′, 223′, 224′, 225′, 226′, and 227′. Thebins 221′, 222′, 223′, 224′, 225′, 226′, and 227′ correspond to thesections primitives bin 221′ (the section 211), theprimitives right bucket 252 of thebin 221′. Because there are no primitives in thedisplay 210 that intersectbin 251′ (the section 211) but do not cross the right boundary of thebin 221′ (the section 211), theleft bucket 251 of thebin 221′ is empty. Because theprimitives bin 222′ (the section 212), theprimitives right bucket 254 of thebin 222′. Because there are no primitives that intersectbin 222′ (the section 212) but do not cross the right boundary of thebin 222′ (the section 212), theleft bucket 253 of thebin 162′ is empty. Because there are no primitives in thebin 223′ (the section 213), theleft bucket 255 andright bucket 256 of thebin 223′ are empty. Because theprimitives bin 224; (the section 214), theprimitives left bucket 257 of thebin 224′. Because there are no primitives that intersectbin 224′ (the section 214) and cross the right boundary of thebin 224′ (the section 214), theright bucket 258 of thebin 224′ is empty. Because theprimitives bin 225′ (the section 215), theprimitives right bucket 260 of thebin 225′. Because no primitives intersectbin 225′ (the section 215) but do not cross the right boundary of thebin 225′ (the section 215), no primitives are stored in theleft bucket 259 of thebin 225′. Because no primitives cross the right boundary of thebin 226′ (the section 216), theright bucket 262 of thebin 226′ is empty. Because theprimitives bin 226′ (the section 216) but do not cross the right boundary of thebin 226′ (the section 216), theprimitives left bucket 261 of thebin 226′. Because no primitives cross the right boundary of thebin 227′ (the section 217), theright bucket 264 of thebin 227′ is empty. Because theprimitives bin 227′ (the section 217) but do not cross the right boundary of thebin 227′ (the section 217), theprimitives left bucket 263 of thebin 227′. - It is presumed that there are three processors in the
processor block 64 of FIG. 2. Thus, the overflow parameter may be three. Referring back to FIGS. 7B and 8B, none of thebins 221′-227′, or the corresponding sections 211-217, include more than threeprimitives bins 221′-227′ are candidates to be combined. Because the overflow parameter is three, thebins 211′, 212′, 213′, and 214′ can be combined intobin 228′ without overflowing. Thus,primitives single bin 228′ that corresponds to thebins 221′-224′ and, therefore, to sections 211-214. For the same reasons,bins 225′, 226′, and 227′ can be combined into asingle bin 229′ without overflowing. - The
bins 221′-227′ are also preferably combined such that theprimitives sized bins 228′ and 229′. Preferably, this is accomplished by storing only those primitives which are in the left bucket for a bin, except for the last bin that is being combined. For the last bin, those primitives in the right bucket and the left bucket are combined. For example, there are no primitives in theleft bucket bins 221′, 222′, and 223′. Thus, no primitives are added. However,primitives left bucket 257 for thebin 224′. Consequently,primitives left bucket 265 of the variable-sized bin 228′. Furthermore, there are no primitives in theright buckets last bins 223′ and 224′ being combined. Thus, no other primitives are stored in the variable-sized bin 228′. Consequently, the variable-sized bin 228′ includesprimitives left bucket 265 and no primitives in theright bucket 266. Furthermore, theprimitives sized bin 228′ based on their minimum y-values. Note, however, that in an alternate embodiment, the variable-sized bin 228′ could includeprimitives right bucket 266 and theleft bucket 265. Providing the display list might then combine thebins 221′, 222′, 223′, and 224′. In an alternate embodiment, no combining is provided until the display list is provided. In such an embodiment, the display list still combines thebins 221′, 222′, 223′, and 224′. - Similarly, the variable-
sized bin 229′ includesprimitives bin 225′ is combined, no primitives are added to thebuckets sized bin 229′ because there are no primitives in theleft bucket 259 of thebin 225′. However, when thebins 226′ and 227′ are combined, theprimitives left buckets bins 226′ and 227′, respectively. If there were primitives in theright buckets sized bin 229′ because thebin 226′ and 227′ are the last bins being combined. Note, however, that in an alternate embodiment, the variable-sized bin 229′ could includeprimitives right bucket 267 and theleft bucket 268. Providing the display list might then combine thebins 225′, 226′, and 227′. In an alternate embodiment, no combining is provided until the display list is provided. In such an embodiment, the display list still combines thebins 225′, 226′, and 227′. - A display list is then provided from the variable-
sized bins 228′ and 229′. The display list preferably provides the primitives variable-sized bin by variable-sized bin and preferably orders the primitives in minimum y-value order. Consequently, the display list would includeprimitives primitives sized bin 228′ (intersectingsections primitives sized bin 229′ (intersectingsections sized bins 228′ and 229′ pixel by pixel in raster order. - Because the
methods system 50. Therefore, the primitives in a scan line for each variable-sized bin can be provided in parallel to processors in the block ofprocessors 64. Each variable-sized bin can, therefore, be rendered pixel-by pixel in raster order without overflowing or slowing thesystem 50. Consequently, efficiency of providing graphical images is improved. - A method and system has been disclosed for more efficiently rendering a graphical image. Although the present invention has been described in accordance with the embodiments shown, one of ordinary skill in the art will readily recognize that there could be variations to the embodiments and those variations would be within the spirit and scope of the present invention. Accordingly, many modifications may be made by one of ordinary skill in the art without departing from the spirit and scope of the appended claims.
Claims (31)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/824,904 US20040196283A1 (en) | 2000-05-01 | 2004-04-14 | Method and system for reducing overflows in a computer graphics system |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US20103400P | 2000-05-01 | 2000-05-01 | |
US09/782,467 US6741243B2 (en) | 2000-05-01 | 2001-02-08 | Method and system for reducing overflows in a computer graphics system |
US10/824,904 US20040196283A1 (en) | 2000-05-01 | 2004-04-14 | Method and system for reducing overflows in a computer graphics system |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/782,467 Continuation US6741243B2 (en) | 2000-05-01 | 2001-02-08 | Method and system for reducing overflows in a computer graphics system |
Publications (1)
Publication Number | Publication Date |
---|---|
US20040196283A1 true US20040196283A1 (en) | 2004-10-07 |
Family
ID=26896320
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/782,467 Expired - Fee Related US6741243B2 (en) | 2000-05-01 | 2001-02-08 | Method and system for reducing overflows in a computer graphics system |
US10/824,904 Abandoned US20040196283A1 (en) | 2000-05-01 | 2004-04-14 | Method and system for reducing overflows in a computer graphics system |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/782,467 Expired - Fee Related US6741243B2 (en) | 2000-05-01 | 2001-02-08 | Method and system for reducing overflows in a computer graphics system |
Country Status (6)
Country | Link |
---|---|
US (2) | US6741243B2 (en) |
EP (1) | EP1295256B1 (en) |
AT (1) | ATE336764T1 (en) |
AU (1) | AU2001259246A1 (en) |
DE (1) | DE60122333T2 (en) |
WO (1) | WO2001084502A1 (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040004620A1 (en) * | 2002-02-06 | 2004-01-08 | Tetsugo Inada | Image processing apparatus and method of same |
US20100164965A1 (en) * | 2008-12-30 | 2010-07-01 | Stmicroelectronics S.R.L. | Rendering module for bidimensional graphics, preferably based on primitives of active edge type |
US20140292756A1 (en) * | 2013-03-29 | 2014-10-02 | Ati Technologies Ulc | Hybrid Render with Deferred Primitive Batch Binning |
US10957094B2 (en) | 2013-03-29 | 2021-03-23 | Advanced Micro Devices, Inc. | Hybrid render with preferred primitive batch binning and sorting |
Families Citing this family (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6738069B2 (en) * | 2001-12-31 | 2004-05-18 | Intel Corporation | Efficient graphics state management for zone rendering |
US20040179007A1 (en) * | 2003-03-14 | 2004-09-16 | Bower K. Scott | Method, node, and network for transmitting viewable and non-viewable data in a compositing system |
US8085273B2 (en) * | 2003-11-19 | 2011-12-27 | Lucid Information Technology, Ltd | Multi-mode parallel graphics rendering system employing real-time automatic scene profiling and mode control |
US7961194B2 (en) * | 2003-11-19 | 2011-06-14 | Lucid Information Technology, Ltd. | Method of controlling in real time the switching of modes of parallel operation of a multi-mode parallel graphics processing subsystem embodied within a host computing system |
US20090027383A1 (en) | 2003-11-19 | 2009-01-29 | Lucid Information Technology, Ltd. | Computing system parallelizing the operation of multiple graphics processing pipelines (GPPLs) and supporting depth-less based image recomposition |
CN1890660A (en) * | 2003-11-19 | 2007-01-03 | 路西德信息技术有限公司 | Method and system for multiple 3-d graphic pipeline over a PC bus |
US8497865B2 (en) * | 2006-12-31 | 2013-07-30 | Lucid Information Technology, Ltd. | Parallel graphics system employing multiple graphics processing pipelines with multiple graphics processing units (GPUS) and supporting an object division mode of parallel graphics processing using programmable pixel or vertex processing resources provided with the GPUS |
US20080094402A1 (en) | 2003-11-19 | 2008-04-24 | Reuven Bakalash | Computing system having a parallel graphics rendering system employing multiple graphics processing pipelines (GPPLS) dynamically controlled according to time, image and object division modes of parallel operation during the run-time of graphics-based applications running on the computing system |
US8223157B1 (en) * | 2003-12-31 | 2012-07-17 | Ziilabs Inc., Ltd. | Stochastic super sampling or automatic accumulation buffering |
JP2008538620A (en) | 2005-01-25 | 2008-10-30 | ルーシッド インフォメイション テクノロジー リミテッド | Graphics processing and display system using multiple graphics cores on a monolithic silicon chip |
US20090096798A1 (en) * | 2005-01-25 | 2009-04-16 | Reuven Bakalash | Graphics Processing and Display System Employing Multiple Graphics Cores on a Silicon Chip of Monolithic Construction |
CA2637800A1 (en) * | 2006-01-18 | 2008-01-10 | Lucid Information Technology, Ltd. | Multi-mode parallel graphics rendering system employing real-time automatic scene profiling and mode control |
ITMI20070038A1 (en) * | 2007-01-12 | 2008-07-13 | St Microelectronics Srl | RENDERING DEVICE FOR GRAPHICS WITH THREE DIMENSIONS WITH SORT-MIDDLE TYPE ARCHITECTURE. |
KR102089471B1 (en) | 2012-11-30 | 2020-03-17 | 삼성전자주식회사 | Method and apparatus for tile based rendering |
Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5594467A (en) * | 1989-12-06 | 1997-01-14 | Video Logic Ltd. | Computer based display system allowing mixing and windowing of graphics and video |
US5621869A (en) * | 1994-06-29 | 1997-04-15 | Drews; Michael D. | Multiple level computer graphics system with display level blending |
US5912710A (en) * | 1996-12-18 | 1999-06-15 | Kabushiki Kaisha Toshiba | System and method for controlling a display of graphics data pixels on a video monitor having a different display aspect ratio than the pixel aspect ratio |
US6008820A (en) * | 1995-08-04 | 1999-12-28 | Microsoft Corporation | Processor for controlling the display of rendered image layers and method for controlling same |
US6191800B1 (en) * | 1998-08-11 | 2001-02-20 | International Business Machines Corporation | Dynamic balancing of graphics workloads using a tiling strategy |
US6219058B1 (en) * | 1997-09-08 | 2001-04-17 | Intel Corporation | Bin-per-span based representation and communication of graphical data |
US6344852B1 (en) * | 1999-03-17 | 2002-02-05 | Nvidia Corporation | Optimized system and method for binning of graphics data |
US6396473B1 (en) * | 1999-04-22 | 2002-05-28 | Webtv Networks, Inc. | Overlay graphics memory management method and apparatus |
US6424345B1 (en) * | 1999-10-14 | 2002-07-23 | Ati International Srl | Binsorter triangle insertion optimization |
US6819321B1 (en) * | 2000-03-31 | 2004-11-16 | Intel Corporation | Method and apparatus for processing 2D operations in a tiled graphics architecture |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5377320A (en) | 1992-09-30 | 1994-12-27 | Sun Microsystems, Inc. | Method and apparatus for the rendering of trimmed nurb surfaces |
AU5688199A (en) | 1998-08-20 | 2000-03-14 | Raycer, Inc. | System, apparatus and method for spatially sorting image data in a three-dimensional graphics pipeline |
-
2001
- 2001-02-08 US US09/782,467 patent/US6741243B2/en not_active Expired - Fee Related
- 2001-04-30 DE DE60122333T patent/DE60122333T2/en not_active Expired - Lifetime
- 2001-04-30 AU AU2001259246A patent/AU2001259246A1/en not_active Abandoned
- 2001-04-30 EP EP01932742A patent/EP1295256B1/en not_active Expired - Lifetime
- 2001-04-30 AT AT01932742T patent/ATE336764T1/en not_active IP Right Cessation
- 2001-04-30 WO PCT/US2001/013813 patent/WO2001084502A1/en active IP Right Grant
-
2004
- 2004-04-14 US US10/824,904 patent/US20040196283A1/en not_active Abandoned
Patent Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5594467A (en) * | 1989-12-06 | 1997-01-14 | Video Logic Ltd. | Computer based display system allowing mixing and windowing of graphics and video |
US5621869A (en) * | 1994-06-29 | 1997-04-15 | Drews; Michael D. | Multiple level computer graphics system with display level blending |
US6008820A (en) * | 1995-08-04 | 1999-12-28 | Microsoft Corporation | Processor for controlling the display of rendered image layers and method for controlling same |
US5912710A (en) * | 1996-12-18 | 1999-06-15 | Kabushiki Kaisha Toshiba | System and method for controlling a display of graphics data pixels on a video monitor having a different display aspect ratio than the pixel aspect ratio |
US6219058B1 (en) * | 1997-09-08 | 2001-04-17 | Intel Corporation | Bin-per-span based representation and communication of graphical data |
US6191800B1 (en) * | 1998-08-11 | 2001-02-20 | International Business Machines Corporation | Dynamic balancing of graphics workloads using a tiling strategy |
US6344852B1 (en) * | 1999-03-17 | 2002-02-05 | Nvidia Corporation | Optimized system and method for binning of graphics data |
US6396473B1 (en) * | 1999-04-22 | 2002-05-28 | Webtv Networks, Inc. | Overlay graphics memory management method and apparatus |
US6424345B1 (en) * | 1999-10-14 | 2002-07-23 | Ati International Srl | Binsorter triangle insertion optimization |
US6819321B1 (en) * | 2000-03-31 | 2004-11-16 | Intel Corporation | Method and apparatus for processing 2D operations in a tiled graphics architecture |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040004620A1 (en) * | 2002-02-06 | 2004-01-08 | Tetsugo Inada | Image processing apparatus and method of same |
US8576219B2 (en) * | 2002-02-06 | 2013-11-05 | Sony Corporation | Linear interpolation of triangles using digital differential analysis |
US20100164965A1 (en) * | 2008-12-30 | 2010-07-01 | Stmicroelectronics S.R.L. | Rendering module for bidimensional graphics, preferably based on primitives of active edge type |
US20140292756A1 (en) * | 2013-03-29 | 2014-10-02 | Ati Technologies Ulc | Hybrid Render with Deferred Primitive Batch Binning |
US10169906B2 (en) * | 2013-03-29 | 2019-01-01 | Advanced Micro Devices, Inc. | Hybrid render with deferred primitive batch binning |
US10957094B2 (en) | 2013-03-29 | 2021-03-23 | Advanced Micro Devices, Inc. | Hybrid render with preferred primitive batch binning and sorting |
US11335052B2 (en) | 2013-03-29 | 2022-05-17 | Advanced Micro Devices, Inc. | Hybrid render with deferred primitive batch binning |
US11880926B2 (en) | 2013-03-29 | 2024-01-23 | Advanced Micro Devices, Inc. | Hybrid render with deferred primitive batch binning |
US11954782B2 (en) | 2013-03-29 | 2024-04-09 | Advanced Micro Devices, Inc. | Hybrid render with preferred primitive batch binning and sorting |
Also Published As
Publication number | Publication date |
---|---|
ATE336764T1 (en) | 2006-09-15 |
EP1295256A1 (en) | 2003-03-26 |
DE60122333T2 (en) | 2007-09-13 |
US6741243B2 (en) | 2004-05-25 |
EP1295256B1 (en) | 2006-08-16 |
US20010055012A1 (en) | 2001-12-27 |
AU2001259246A1 (en) | 2001-11-12 |
DE60122333D1 (en) | 2006-09-28 |
WO2001084502A1 (en) | 2001-11-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6741243B2 (en) | Method and system for reducing overflows in a computer graphics system | |
US6509897B1 (en) | Method and system for providing implicit edge antialiasing | |
EP1177527B1 (en) | Rendering translucent layers | |
US7184041B2 (en) | Block-based fragment filtration with feasible multi-GPU acceleration for real-time volume rendering on conventional personal computer | |
US5923333A (en) | Fast alpha transparency rendering method | |
US7920141B2 (en) | Method and apparatus for rasterizer interpolation | |
US6963346B2 (en) | Method and system for efficiently using fewer blending units for antialiasing | |
US6750867B1 (en) | Image processing apparatus | |
US5175805A (en) | Method and apparatus for sequencing composite operations of pixels | |
US8648874B2 (en) | Method and system for providing edge antialiasing | |
EP1139294B1 (en) | Graphical image system and apparatus | |
US6445392B1 (en) | Method and apparatus for simplified anti-aliasing in a video graphics system | |
EP1107177B1 (en) | Method and apparatus for processing portions of primitives that are being rendered | |
US6556993B2 (en) | Method and system for providing a hardware sort in a graphics system | |
US6795088B2 (en) | Method and system for more efficiently utilizing processors of a graphics system | |
JP3626709B2 (en) | Anti-aliasing device | |
EP1222629B1 (en) | Method and system for rendering macropixels |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- AFTER EXAMINER'S ANSWER OR BOARD OF APPEALS DECISION |
|
AS | Assignment |
Owner name: BANK OF AMERICA, N.A., AS COLLATERAL AGENT, NORTH CAROLINA Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:037806/0001 Effective date: 20160201 Owner name: BANK OF AMERICA, N.A., AS COLLATERAL AGENT, NORTH Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:037806/0001 Effective date: 20160201 |
|
AS | Assignment |
Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD., SINGAPORE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:041706/0001 Effective date: 20170120 Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:041706/0001 Effective date: 20170120 |
|
AS | Assignment |
Owner name: BROADCOM CORPORATION, CALIFORNIA Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS;ASSIGNOR:BANK OF AMERICA, N.A., AS COLLATERAL AGENT;REEL/FRAME:041712/0001 Effective date: 20170119 |