reference will now be made to the exemplary embodiments illustrated in the drawings , and specific language will be used herein to describe the same . it will nevertheless be understood that no limitation of the scope of the invention is thereby intended . alterations and further modifications of the inventive features illustrated herein , and additional applications of the principles of the inventions as illustrated herein , which would occur to one skilled in the relevant art and having possession of this disclosure , are to be considered within the scope of the invention . the present invention is a system and method for increasing the rendering speed for supersampled computer graphic images . this system and method provides performance approaching systems using a high speed memory device , while retaining the costs associated with lower speed , more cost effective memory . in order to better understand the invention , a computer graphics system within which the present invention can be used will now be discussed . in fig4 a host processor 202 is provided to process a display model or database . the host processor is connected to a geometry subsystem 204 , which transforms object coordinate polygon data to the world coordinate system . the geometry system can also take care of lighting , viewing transformation and mapping to screen coordinates . the rasterization subsystem 206 converts transformed primitives to pixels and subpixels . rasterization includes scan conversion , visible - surface determination and shading . each pixel and / or subpixel is assigned an x and y coordinate , a rgba ( i . e ., red , green , blue , alpha ) color value and a z - value . the pixels are stored in a frame buffer 208 and then output to a display 210 . the present invention provides advantages for a rasterization ( or rendering ) subsystem , because it processes pixels on the interior of polygons or objects at a higher speed that is equivalent to the speed attained when antialiasing is not used on those pixels . this is because the subpixel buffers will not be used for pixels on a polygon &# 39 ; s interior . in essence , the antialiasing of pixels using supersampling is avoided when certain recognizable conditions exist . this is in contrast to the prior art that accesses each subpixel to write a depth and color for a subpixel regardless of where the pixel is located . in the present system , performance degradation generally exists for pixels on the edge of a polygon , for which the subpixel buffers are used . when the majority of pixels in a frame are in the interior of a polygon , then performance improvements may be achieved over prior art antialiasing and supersampling techniques . the performance of the present system and method can approach that of non - antialiased systems as the size of the polygons used by the system increases . some prior computer graphics systems have used a subpixel region mask , which indicates which subpixels are covered by the same polygon . then the same depth and color data is written into the group of specific subpixels based on the region mask . unfortunately , this approach still requires that some or all of the subpixels will be written into for each pixel , even if the pixel is fully covered by one polygon or the incoming polygon fragment is closer than all the stored subpixels . furthermore , when a pixel is fully covered , this means that the subpixel region mask will write a depth or color into every subpixel that corresponds with the pixel being processed . in order to overcome this problem in the present invention , an incoming polygon fragment that is closer than the stored pixel or subpixels is handled differently . as illustrated in fig1 a system 10 is shown for optimizing rendering in a supersampling antialiasing system . a pixel resolution buffer 20 is provided to store rgba values 22 for each pixel . a pixel resolution z - buffer is included that contains a depth value or z - value 26 . this depth value is the closest z - value for the pixel , if the pixel is fully covered . the pixel resolution z - buffer can also contain the closest z - value of all the subpixels corresponding to the pixel , if the pixel is not fully covered . prior art systems have not included a pixel resolution buffer z - value and that increases the bandwidth of information those systems must write into the subpixel buffer when polygons are fully covered . the pixel resolution buffer contains a polygon flag 24 for each pixel that indicates whether the pixel contains one polygon or multiple polygons . when the depth of the incoming fragment is closer than the stored depth for the current pixel and the pixel is entirely covered by a polygon , then the rgba information is written to the pixel resolution buffer . a subpixel resolution buffer is also included 30 . each pixel has multiple subpixels 32 associated with the pixel and there may be 2 , 4 , 8 , 16 , or more subpixels allocated to each pixel . each subpixel stores rgba values and a z depth value 34 . the subpixels are used for pixels that intersect polygon edges . in order to display a pixel , the system first attempts to retrieve the rgb value from the pixel resolution buffer . the pixel resolution buffer can contain a valid flag with indicates that the prb has a valid rgb value or it can contain an “ invalid ” flag value . the existence of a valid flag allows the screen refresh circuitry to read the sub - pixel buffers only for pixels on the edge of polygons . reading only pixels with more than one polygon achieves a significant bandwidth savings . if the rgba value is not valid then the rgb value is calculated from the 2 , 4 , 8 , 16 , or more rgb subpixel values stored in the subpixel buffer . the organization of fig1 allows the system to increase performance by performing antialiasing only on pixels at polygon edges . these edge pixels are generally the ones that benefit most from the antialiasing . in contrast , subpixel processing is avoided for pixels located on the interior of polygons because the pixels are fully covered . this saves the system 2 , 4 , 8 , 16 or even more extra calculations and / or memory operations for each of these pixels depending on the number of subpixels that have been allocated for each pixel . a processing module can be used to determine whether an incoming fragment is closer to the stored pixel depth and value and whether a given pixel is completely or partially covered by an incoming polygon fragment . fig2 illustrates the operations that can be performed using the architecture described in fig1 . an initial operation will be performed to compare the incoming z depth to the current pixel resolution buffer z depth . in addition , the system checks to determine whether the incoming polygon fragment fully covers the pixel , and the destination pixel contains one or multiple polygons . before the rendering process begins for a frame , the pixel resolution buffer initializes the pixel resolution z - buffer to the farthest possible z value ( i . e ., highest or lowest depth value ). in addition , the polygon flag in the pixel resolution buffer can be initialized to 1 . after the initialization has taken place then the rendering process begins . accordingly , an incoming pixel fragment is received 50 . the system first performs a depth test to determine if the z fragment of the incoming fragment is closer than the stored depth z close in the pixel resolution buffer 52 . when the incoming fragment is not closer than z close , then the system checks the polygon flag in the pixel resolution buffer ( prb ) 54 . if the destination pixel contains one polygon and z fragment is farther then z close ( i . e ., z fragment & gt ;= z close if large z values correspond to further away , or z fragment & lt ;= z close if small z values correspond to further away ) then the pixel is rejected 56 and that pixel is done 58 . on the other hand , when the polygon flag indicates that the pixel has multiple polygons then each subpixel is tested with a z test and the rgba and z are replaced for subpixels that are farther than the incoming fragment 60 . at this point , the pixel is done 62 and the process begins again for the next pixel . in the alternative case , the depth test 52 determines that the z fragment of the incoming fragment is closer than the stored depth z close . next the z fragment value is written over the z close value in the prb 64 . the system then checks to see if the incoming pixel fragment fully covers the pixel 66 . in the situation where the pixel is fully covered , the system writes the pixel rgba to the prb and sets the polygon flag to one 68 to complete the cycle 70 . if the incoming polygon fragment is not fully covered , another path is taken which uses the subpixel resolution buffer . as part of this decision path , the system writes the subpixels that are touched by the incoming fragment with the incoming rgba and z 72 . the incoming fragment will generally include data from the graphics rendering pipeline . a follow up test checks to see if the prb polygon flag indicates that the pixel has one polygon 74 . if the pixel does not have only one polygon , then the system is done 76 and it moves on to the next pixel . when the pixel does have only one polygon and the z fragment is closer than the z close , then the subpixels that are not touched by the incoming fragment are copied from the prb &# 39 ; s rgba and z values 78 . then the prb polygon flag is set to represent multiple polygons 80 and the system has completed the current pixel 82 . the polygon flag can use a 0 to represent multiple polygons or some similar flag scheme can be used . the copying of rgb and z values from the prb to the subpixel buffer when a second polygon intersects a pixel means the subpixel buffer does not need to be initialized prior to rasterization . this results in a huge savings in bandwidth . the initial depth test and storage of the depth value in the prb is a factor in speeding up the operation of this system and method as can be seen in fig2 . this is because when the pixel is fully covered by the incoming pixel fragment , the system can store the incoming depth in the prb . this only requires one memory access as opposed to the prior art , which writes the depth and color of the incoming fragment into each touched subpixel . this is expensive in memory bandwidth and access speed . an alternative embodiment of the invention allows the depth testing issues to be taken care of in another manner . for example , the polygons in the geometric model can be sorted by depth in advance of rendering as opposed to allowing the sorting to take place at the pixel level using the z - buffer method . if a list - priority algorithm or some other hidden surface removal is used that avoids depth testing at the pixel level , the present method can be simplified . fig3 is a flow chart that illustrates a method for optimizing pixel rendering when supersampling is used . this method uses a polygon coverage flag but does not include a depth test . first , the incoming pixel fragment is received 100 . the system then checks to see if the incoming pixel fragment fully covers the pixel 102 . in the situation where the pixel is fully covered , the system writes the pixel rgb and z to the pixel resolution buffer and sets the polygon flag to one 104 to complete the cycle 106 . if the incoming polygon fragment is not fully covered , the subpixel resolution buffer will be used . at this point , the system fills the subpixels that are touched by the incoming fragment with the incoming rgb and z 108 . the incoming fragment is graphics data from the graphics rendering pipeline . another test checks to see if the prb polygon flag indicates that the pixel has one polygon 110 . if the pixel does not have one polygon , then the system is done 112 and it moves on to the next pixel . when the pixel does have one polygon then the subpixels that are not touched by the incoming fragment are copied from the prb . the values that are copied from the prb &# 39 ; s into the subpixels are the rgb and z values 114 . then the prb polygon flag is set to represent multiple polygons 116 and the system has completed the current pixel 118 . it is to be understood that the above - referenced arrangements are only illustrative of the application for the principles of the present invention . numerous modifications and alternative arrangements can be devised without departing from the spirit and scope of the present invention while the present invention has been shown in the drawings and fully described above with particularity and detail in connection with what is presently deemed to be the most practical and preferred embodiments ( s ) of the invention , it will be apparent to those of ordinary skill in the art that numerous modifications can be made without departing from the principles and concepts of the invention as set forth in the claims .