# Patent

## Title
Method for determining weighting factors for the color calculation of a color value of texels for a footprint

## Abstract

In a method for determining weighting factors for the color calculation of a color value of texels for a footprint covering a plurality of texels in a texel grid, in a graphic system, form information of the footprint is determined at first. Afterwards, the edges of the footprint are determined and the edges determined in this way are approximated by a staircase function. The texels of the texel grid contacted by the staircase function are determined and a weighting factor is determined for each texel containing a portion of the staircase function, depending on the subarea of the respective texel covered by the footprint.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is a continuation of co-pending International Application No. PCT/EP03/10017, filed Sep. 9, 2003, which designated the United States and was not published in English.


BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention generally relates to a method for displaying images or pictures on a raster display system controlled by a computer. In particular, the present invention relates to an anisotropic filtering mechanism and to a corresponding device required to reconstruct, scale or subject, to a perspective projection, stored discrete images which will subsequently be also referred to as textures, with high quality on the raster display. In particular, the present invention relates to a method for determining weighting factors for the color calculation of a color value of texels for a footprint.
2. Description of the Related Art
In the prior art, anisotropic filtering methods, such as, for example, the so-called area sampling, are known to associate a texture to a footprint. In the prior art, so-called weighted area samplings and unweighted area samplings are known, a disadvantage of the methods known from the prior art being that discontinuities in the image illustrated are produced with perceivable artifacts at a transition between a weighted and an unweighted sampling.
A “footprint” is the perspective projection of a picture element (pixel) of an object onto a curved surface. A “footprint” can be a convex four-sided (quadrilateral) illustration representing the approximate result of the perspective projection onto a regular texel grid (texture element grid) of a square picture element (pixel) of an object onto a curved surface.
SUMMARY OF THE INVENTION
Departing from this prior art, it is the object of the present invention to provide an improved method enabling the determination of texels below the edges of the footprint when producing weightings for texels of a footprint in a simple and fast way.
The present invention provides a method for determining weighting factors for the color calculation of a color value of texels for a footprint covering a plurality of texels in a texel grid, in a graphic system, comprising the following steps:

    (a) determining form information of the footprint;
    (b) determining the edges of the footprint;
    (c) approximating the edges determined in step (b) by a staircase function;
    (d) determining the texels of the texel grid contacted by the staircase function; and
    (e) determining a weighting factor for each texel containing a portion of the staircase function depending on the subarea of the respective texel covered by the footprint.


According to a preferred embodiment, a texel contacted by the staircase function is determined based on the starting points and/or endpoints of the vertical portions of the staircase function.
A uniform weighting factor is preferably associated with texels of the texel grid which are not contacted by the staircase function and which are covered by the footprint, wherein the weighting factors for each texel are associated with a data structure.
According to a further preferred embodiment, the staircase function, for each edge of the footprint, includes a plurality of steps, a plurality of horizontal step elements and a plurality of vertical step elements, wherein each edge includes a plurality of subsequent edge portions of equal lengths, wherein a horizontal edge is present when the end points of the edge portions of the edge intersect a horizontal step element of the staircase function, wherein a vertical edge is present when the end points of the edge portions of the edge intersect a vertical step element of the staircase function, wherein a horizontal edge includes a number of vertical step elements, the number being equal to the number of steps of the staircase function, wherein a vertical edge includes a number of vertical step elements, the number being larger than the number of the steps of the staircase function by an additional vertical step element, and wherein the additional vertical step element is used for calculating the weighting factors of a neighboring edge having the same vertical position.
According to another preferred embodiment, an enlargement offset (shift) is associated with the footprint, wherein after step (a), based on the enlargement offset, the footprint is enlarged by shifting the edges of the footprint to the outside by a distance depending on the enlargement offset, wherein the shifted edge is determined in step (b), wherein the shifted edge is approximated in step (c) by a staircase function, and wherein a weighting factor is determined in step (e) for each texel containing a shifted edge, depending on the subarea of the respective texel covered by the enlarged footprint.
The footprint is enlarged by shifting in a horizontal direction and in a vertical direction the edge end points by a distance determined by the enlargement offset. Preferably, the gaps resulting are filled by horizontal and vertical edges, wherein further weighting factors are subsequently determined for each texel containing an incorporated vertical edge.
The inventive method provides a novel approach for an anisotropic filtering which makes it, for example, possible to apply the known filtering technique of the area sampling to four-sided footprints which represent a perspectively projected square picture element, which are superimposed on a regular texel grid. More precisely, another input parameter, the so-called enlargement offset, is used according to the invention to control aliasing artifacts. The enlargement offset determines whether a weighted area sampling or an unweighted area sampling is to be applied to the area of the footprint, wherein it is, in particular by this, determined how big the weighting contribution or the degree of weighting for the area sampling is supposed to be. The present invention is preferably applied to deformed footprints, such as, for example, small and long footprints.
A typical characteristic and an essential feature of the present invention is that there is no hardware-based switch, on the basis of a threshold value, which determines when a weighted or an unweighted area sampling is to be performed, which would really result in discontinuities with perceivable artifacts. Instead, the magnitude of the weighted area sampling is preferably increased more and more. Preferably, the growing increase of the weighting contribution takes place with a decreasing footprint, in particular, while the footprint becomes smaller than the width or height extension of a texel.
According to a further aspect of the present invention, a method for determining a weighting factor for the color calculation of a color value of a texel for a footprint extending at least partially into the texel, in a graphic system is provided, in which form information of the footprint is determined and, based on an enlargement offset, the footprint is enlarged by shifting the edges of it to the outside by a distance depending on the enlargement offset, so that it covers several texels. Then, a weighting factor is determined for each texel containing a shifted edge, depending on the subarea of the respective texel covered by the enlarged footprint.
According to this aspect of the present invention, it is made possible for footprints only covering a small number of texels or even only one texel to put the color determination on a broader base by also taking information of neighboring texels into account due to the enlargement of the footprint. It is to be noted that the enlargement only takes place for determining the color value—the footprint is not enlarged for the later illustration of the object it is associated with.
Preferred developments of the present application are defined in the subclaims.



BRIEF DESCRIPTION OF THE DRAWINGS
These and other objects and features of the present invention will become clear from the following description taken in conjunction with the accompanying drawings, in which:
FIGS. 1A and B show a flow chart of a preferred embodiment of the inventive method;
FIG. 2 is the representation of a footprint in the texture space;
FIG. 3 is a representation for determining the edge orientation of a footprint;
FIGS. 4A and B show a flow chart representing a method for calculating edges according to an embodiment of the present invention;
FIGS. 5A and B are two examples for a filter enlargement of a footprint;
FIG. 6 is a representation of the approximation of edges of the footprint by a staircase function;
FIG. 7 is a representation of a shifted edge in a texel grid with the associated weighting table entries;
FIGS. 8A and B show a flow chart illustrating a method for processing a shifted edge according to an embodiment of the present invention;
FIG. 9 is a representation of a footprint and of an enlarged footprint with the help of which the step propagation is described;
FIGS. 10A and B are illustrations for explaining the notation of a vertex edge and of a slice (vertical step element); and
FIGS. 11A and B show a flow chart illustrating a method for calculating the color of a pixel.



DESCRIPTION OF THE PREFERRED EMBODIMENTS
A first embodiment of the present invention will be detailed subsequently referring to FIG. 1, wherein individual process steps will be explained in greater detail in the subsequent description.
Regarding the more detailed description, it is to be noted that the mathematical notation of vectors is used for the description of the footprint (illustrated in the text by BOLD PRINT). The unit length of all the coordinates and lengths is the width (or height, respectively) of a texel in the original texture or in the texture according to a MipMap step, if present. Edge attributes and vertex attributes include the index i running from 0 to 3 and all the results of index calculations exceeding i=0 and i=3, respectively, are calculated back to the actual edges. This means that a result of i=4 becomes i=0 and a result i=−1 becomes i=3.
According to a preferred embodiment, the inventive method, in block 100, receives input data or information representing the form, position and orientation of the four-sided footprint, which is ready in block 102. More precisely, the footprint data viin, the direction of rotation d of the footprint and the enlargement offset r are provided in block 102. By receiving the additional input parameter, that is the enlargement offset r, it is made possible according to the invention to determine the degree of the weighted area sampling required for small or thin footprints, in particular small or thin four-sided footprints.
In block 104, a so-called edge calculation takes place. This edge calculation includes enlarging the footprint by offsetting the edges of it based on the form information received and the enlarging parameter r. In the edge calculation 104, vertical edges are subsequently incorporated into the gaps resulting due to the enlargement, a limitation rectangle is calculated and all the edges are sorted into left and right edges in block 104, so that the attribute for the enlarged vertex edges are provided in block 106 and the attributes associated with the offset edges are provided in block 108. More precisely, the footprint information vi*, the orientation of the individual edges ai* and the resulting gaps gi* for the enlarged footprint are provided in block 106. In block 108, the vertex information vi′, an orientation of the offset edge ai′ and corresponding edge vectors si′ are provided. The information provided in block 108 is fed to block 110 in which processing regarding the offset edge is performed. On the other hand, in block 110, a step propagation Pi* provided in block 112 is calculated. The parameters provided in block 106 and in block 112 are fed to block 114 in which the vertex edge is processed.
The weighting tables for the vertex edges and the offset edges provided in blocks 116 and 118 (FIG. 1B) result from processing the vertex edge (block 114) and the offset edge (110).
Based on the tables produced in this way, there is a color calculation in block 120, wherein block 120 additionally receives information on the texture from block 122. The color calculation in block 122 then yields the pixel color provided in block 124 and output in block 126.
If no enlargement is required or provided for the footprint, there will be no offset of the edges of the footprint. Then the inventive method will only be executed on the original edges. There are no additionally inserted edges in this case or else they are set to zero for calculating.
A suitable data structure for each of the edges of the footprint is created in blocks 110 to 118. Thus the subsequently explained steps are performed in parallel for each edge. At first, an edge is approximated by a suitable number of simple steps and all the texels contacted by a staircase function of a left edge are searched. With each texel found a weighting value corresponding to the fraction of the remaining texel area to the right of the staircase function is associated. In analogy, all the texels below the structure to be illustrated and contacted by the staircase function of a right edge are searched. With the texels found in this way a respective weighting factor corresponding to the fraction of the remaining area of each texel to the left of the staircase function is associated. Subsequently, all the coordinates and corresponding weightings are stored in a suitable unique data structure associated with the edge of the footprint. In addition, a weighting value of ≦+1 or ≧−1, respectively, is associated with all the texels, that is texels to the right of a left edge or a right edge, respectively—however not contacted by it—and to the left of the right edge of the limiting rectangle. This information is added to the data structure.
Preferably the data structures produced in this way according to a preferred embodiment of the present invention are assessed in an efficient way so that each texel covered by the footprint can be addressed directly by the coordinates stored so that subsequently its corresponding color can be multiplied (weighted) by its associated weight. It is to be pointed out that each weighting factor is the sum of the weightings of those edges contained in the texel considered.
In block 120 in FIG. 1B, a color calculation is performed as is known in the prior art. For this color calculation, all the weighting factors are collected and all the weighted texels used by the footprint are also collected and subsequently the collected color is divided by the collected weighting factors. The result represents the picture fragment filtered and retrieved from the texture image, which is associated with the pixel which was intended to be imaged or projected onto the texture image.
Regarding the values vi′, ai′ and si′ and vi*, ai*, gi*, respectively, quoted in FIG. 1, it is to be pointed out that the values with apostrophe refer to the offset edges, while the values with asterisks refer to the vertex edges.
It is an advantageous of the present invention that the inventive method inherently provides the possibility to use a high degree of parallelism when embodied in an actual hardware implementation. In addition, the inventive method allows its implementation in a hardware pipeline so that, according to a preferred embodiment of the present invention the process steps described above are realized in hardware in different pipeline stages. Preferably, those process steps having been described above and producing the data structure for each edge are typically implemented as a hardware module and are instantiated (called) in parallel for each edge. These modules instantiated in parallel themselves represent a pipeline stage of the entire hardware pipeline.
The fundamental process for retrieving the pixel color from a texel array covered by a four-sided footprint is to perform an unweighted area sampling regarding this footprint. This means that the color components of the texel are at first integrated over the footprint and that the result is subsequently divided by the summed area of the footprint. The calculation of the integral requires a previous multiplication of each texel by a suitable weighting factor. The weighting factor is 1.0 for those texels arranged completely below the footprint. According to the invention, each texel only covered partly by the footprint, i.e. is arranged at the edge of the footprint, is associated a weighting factor proportional to the size of the area covered.
Thus the inventive method fulfills the following two tasks having been described herein before, that is the identification of all the texels covered fully or partly by the four-sided footprint and the calculation of a weight for each texel and the association of this weighting factor to the corresponding texel.
In addition, fading is realized according to the invention, which is controlled by the additional parameter, the enlargement parameter r, to perform fading from an unweighted into a weighted area sampling.
The background of the aspect just described is that an unweighted area sampling in the picture retrieved produces perceivable aliasing artifacts when the footprint is strongly deformed, for example has forms only including very thin and very long areas. This is also the case when the area covered by the footprint becomes considerably smaller than the area of a square texel of the texel grid.
In order to avoid the artifacts just mentioned in these cases, the area of the footprint is extended according to the invention by offsetting the four edges representing the boundary of the footprint. In the cases described above, this approximates a footprint which can be interpreted as the projection of a filter kernel fulfilling the characteristic of a weighted area sampling, wherein the filter kernel overlaps its neighbors and has a bilinear similar distribution.
In the description of the preferred embodiment of the present invention according to FIG. 1 described above it is to be noted that the inventive method basically includes blocks 100 to 118 which provide the data required for a basically conventional color calculation. In addition, it is to be noted regarding FIG. 1 that all the rectangular blocks represent the main process steps described in greater detail subsequently for preferred embodiments of the present invention. The results of the process steps are stored in data structures represented in FIG. 1 in the parallelogram-shaped blocks. These results are used as inputs for the next process steps.
The data input in FIG. 1 in block 100 and the data provided in block 102 include the information regarding the footprint viin which, according to a preferred embodiment, is convex and in which the height and the width of none of the edges are allowed to exceed a predetermined maximum value Emax. In addition, a direction of rotation d for the footprint is input, wherein d=+1 stands for a clockwise direction of rotation and d=−1 for a counter-clockwise direction of rotation. d is set to 0 when the rotation can no longer be determined due to the deformation of the footprint. In addition, the enlargement offset r is input, which is preferably limited to a value between 0.0 and 0.5.
The maximum edge length Emax mentioned above is preferably a hardware-coded value which is supposed to be a power of 2, wherein the value 8 is preferred here. Higher values will slow down the raster process, that is the processing speed of the graphic system, significantly and increase the data structures required considerably. If no power of 2 was used, the calculations in connection with Emax could only be realized in hardware with a great deal of expenditure.
FIG. 2 shows an example for a representation of a footprint in the texture space. The texture space in the example illustrated is spanned by the coordinates x and y. The footprint is defined by the four vertex vectors v0 to v3 and the four edge vectors s0 to s3. In addition, the direction of rotation d of the footprint is determined by the direction of the edge vectors s0 to s3. FIG. 2 shows the typical form of a footprint in the texture space. The footprint is defined by its enclosure which in turn consists of the four edges s0 to s3, and is thus often referred to as a four-sided element. The four vertices v0 to v3 positioned in the texture space by the four vectors shown in FIG. 2 define the edges s0 to s3.
As will be described in greater detail subsequently, a main aspect of the present invention is that horizontal and vertical step functions are applied to approximate each of the edges. In order to, however, obtain a consistent and unique weighting algorithm which can be processed in parallel for all the edges s0 to s3, it is assumed for the further calculation that the edges only provide contributions to those texels arranged to the right of an edge. Thus values from left-hand side edges are added to the effective weighting factor resulting for all the edges and values from the right-hand side edges are subtracted from the effective weighting factor resulting from all the edges. The edge attributes left, right, bottom and top are illustrated in FIG. 3.
As can be seen from FIG. 3, edges having been classified as bottom left or top right, respectively, are approximated by vertical step elements, while edges classified as bottom right or top left, respectively, are approximated by horizontal step elements. The horizontal and vertical steps just described will be explained in greater detail subsequently.
At first, a first main processing step of the inventive method according to a preferred embodiment will be detailed referring to FIG. 4, that is the edge calculation generally indicated in FIG. 1A in block 104. In block 128, the method for calculating the edges receives the data required for this, that is the footprint data viin and the enlargement offset r provided in blocks 130 and 132 of the further processing. The edge calculation produces the approximated area of the footprint, wherein a positive filter enlargement, indicated by the enlargement offset r, with r≧0, is included. Each edge of the original footprint is moved away from the center by adding an offset having a size r. These edges will be referred to as offset edges. As a result of this “explosion”, there are horizontal and vertical gaps between the original vertices of the footprint. Horizontal gaps can be ignored in the inventive method according to the embodiment described, vertical gaps, however, are simply filled by vertical edges, the so-called vertex edges.
To simplify the calculation of the edge and vertex attributes and make them less complicated as regards the hardware implementation required, footprints having a counter-clockwise direction of rotation in block 134 are always converted in footprints having a direction of rotation in the clockwise direction (see FIG. 2). The conversion takes place according to the subsequently indicated calculating rule:




  
    
      v
      ⇀
    
    
      0
      ,
      1
      ,
      2
      ,
      3
    
  
  =
  
    {
    
      
        
          
            
              v
              ⇀
            
            
              0
              ,
              1
              ,
              2
              ,
              3
            
            in
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              d
            
            ≥
            0
          
        
      
      
        
          
            
              v
              ⇀
            
            
              2
              ,
              1
              ,
              0
              ,
              3
            
            in
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              d
            
            <
            0
          
        
      
    
  




v0,1,2,3in=input data received in block 128.

The footprint data v0,1,2,3 received according to the above calculating rule is provided in block 136 for further processing.
Based on the footprint information vi provided in block 136, the edge vectors result according to the subsequent calculating rule:

{right arrow over (s)}i={right arrow over (v)}i+1−{right arrow over (v)}i

In addition, the so-called orientation vectors ai for the edges are calculated to classify the corresponding edges in left/right and top/bottom edges. Based on the classification shown in FIG. 3, it is determined for each edge in which square it is. In the following table, the values for the two components of the edge orientating vector ai, that is for the components ai,x and ai,y, are indicated for different signs of the components si,x and si,y of the edge vector si.
















sign (si,x)
sign (si,y)
ai,x
ai,y





















≧0
<0
−1
−1



>0
≧0
+1
−1



≦0
>0
+1
+1



<0
≦0
−1
+1



=0
=0
0
0










In the above table, a value of +1 shows an orientation to the right along the x-axis and to the bottom in the direction of the y-axis in the texture space spanned in FIG. 3. A value of −1 shows an orientation to the left in the direction of the x-axis and an orientation to the top in the direction of the y-axis. Horizontal edges and vertical edges are associated the values just mentioned. A “0 edge” (edge deformed in one point) results in a vector a=0 and in a value for a=0.
The orientations indicated in the table are used to determine the direction of an enlargement offset. The footprint is extended on four shifted edges vi′, si′ depending on the size of the limited enlargement parameter r. In reality each of the of original vertices is offset by the enlargement parameter r in the way described and indicated in FIGS. 5A and 5B, whereby the offset edges si′ result. Because all the edges should be sampled from the left to the right, the starting point and the end point for those edges determined to be bottom have to be exchanged which is performed according to the calculating rule indicated subsequently:




  
    
      
        
          
            a
            ⇀
          
          i
          ′
        
        =
        
        ⁢
        
          
            a
            ⇀
          
          i
        
      
    
  
  
    
      
        
          
            s
            ⇀
          
          i
          ′
        
        =
        
        ⁢
        
          
            -
            
              a
              
                i
                ,
                y
              
            
          
          ·
          
            
              s
              ⇀
            
            i
          
        
      
    
  
  
    
      
        
          
            v
            ⇀
          
          i
          ′
        
        =
        
        ⁢
        
          
            r
            ·
            
              
                a
                ⇀
              
              i
            
          
          +
          
            {
            
              
                
                  
                    
                      
                        
                          v
                          ⇀
                        
                        i
                      
                      ⁢
                      
                        
                      
                      ⁢
                      if
                      ⁢
                      
                        
                      
                      ⁢
                      
                        a
                        
                          i
                          ,
                          y
                        
                      
                    
                    <
                    0
                  
                
              
              
                
                  
                    
                      
                        v
                        ⇀
                      
                      
                        i
                        +
                        1
                      
                    
                    ⁢
                    
                      
                        
                      
                      ⁢
                      
                        
                      
                    
                    ⁢
                    else
                  
                
              
            
          
        
      
    
  




The calculations just described take place in FIG. 4A, on the one hand, in block 138, from which the edge vectors si′ provided in block 140 result. Based on this information, the offset edge vectors si′ are calculated in block 142a and provided in block 142b for being output in block 150. Based on this information, the orientation of the edges is calculated in block 142 and subsequently provided for further processing in block 144 (FIG. 4B). In block 146, based on the orientations ai′ provided in block 144, based on the footprint data vi′ provided in block 136 and based on the enlargement parameter r provided in block 132, the offset for the offset edges is calculated so that the offset edge information vi′ is provided in block 148 and output in block 150.
Gaps resulting due to the offset of each vertex of the footprint are handled by the vertical vertex edges. The offset of these edges depends on the orientation of the two neighboring edges having a length of larger than 0. These edges are indicated by j±, depending on the vertex index i, according to the calculating rule indicated subsequently:




  
    
      
        
          
            j
            +
          
          ⁡
          
            (
            i
            )
          
        
        =
        
        ⁢
        
          {
          
            
              
                
                  
                    i
                    +
                    2
                  
                  ⁢
                  
                    
                      
                    
                    ⁢
                    
                      
                    
                  
                
              
              
                
                  
                    
                      if
                      ⁢
                      
                        
                      
                      ⁢
                      
                        a
                        i
                        ′
                      
                    
                    =
                    
                      
                        a
                        
                          i
                          +
                          1
                        
                        ′
                      
                      =
                      0
                    
                  
                  ⁢
                  
                    
                  
                
              
            
            
              
                
                  
                    i
                    +
                    1
                  
                  ⁢
                  
                    
                  
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      a
                      i
                      ′
                    
                  
                  =
                  0
                
              
            
            
              
                i
              
              
                else
              
            
          
        
      
    
  
  
    
      
        
          
            j
            -
          
          ⁡
          
            (
            i
            )
          
        
        =
        
        ⁢
        
          {
          
            
              
                
                  i
                  -
                  3
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                        
                      
                      ⁢
                      
                        
                      
                    
                    ⁢
                    
                      a
                      
                        i
                        -
                        1
                      
                      ′
                    
                  
                  =
                  
                    
                      a
                      
                        i
                        -
                        2
                      
                      ′
                    
                    =
                    0
                  
                
              
            
            
              
                
                  i
                  -
                  2
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      a
                      
                        i
                        -
                        1
                      
                      ′
                    
                  
                  =
                  0
                
              
            
            
              
                
                  i
                  -
                  1
                
              
              
                else
              
            
          
        
      
    
  




The modified orientation vector ai* and the gap flag θi* results as follows using this index translation:
















a′j−(i),x
a′j−(i),y
a′j+(i),x
a′j+(i),y
a*i,x
a*i,y
θ*i







<0
<0
<0
<0
−1
−1
0


<0
<0
>0
<0
x
x
0


<0
<0
>0
>0
+1
+1
1


>0
<0
>0
<0
+1
−1
0


>0
<0
<0
>0
+1
−1
1


>0
<0
>0
>0
+1
−1
1


<0
>0
<0
<0
−1
+1
1


<0
>0
>0
<0
−1
+1
1


<0
>0
<0
>0
−1
+1
0


>0
>0
<0
<0
−1
−1
1


>0
>0
<0
>0
x
x
0


>0
>0
>0
>0
+1
+1
0










else
x
x
x









X stands for a value not having effects on following calculations which can thus have any value. The basic point for the vertex edge and the size of the enlargement gap then results according to the calculating rule indicated subsequently:




  
    
      
        
          
            v
            ⇀
          
          i
          *
        
        =
        
        ⁢
        
          
            
              v
              ⇀
            
            i
          
          +
          
            r
            ·
            
              
                a
                ⇀
              
              i
              *
            
          
        
      
    
  
  
    
      
        
          g
          i
          *
        
        =
        
        ⁢
        
          {
          
            
              
                0
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      a
                      i
                    
                  
                  =
                  0
                
              
            
            
              
                
                  
                    
                      θ
                      i
                      *
                    
                    ·
                    2
                  
                  ⁢
                  r
                
              
              
                else
              
            
          
        
      
    
  




The condition ai=0, from which gi*=0 results, ensures that a “0 edge” having two neighboring and also identical vertices having the same attributes only produces a gap edge for the subsequent texel weighting. The calculating steps described above at first take place in block 152 in which, based on the orientation ai′ provided in block 144 and based on the enlargement parameter r, an orientation of the vertex edges is calculated, which is then provided in block 154. In addition, the enlargement gap gi* is provided in block 156, which has also been produced by the calculation of block 152.
Based on the orientations ai* provided in block 154 the offset for the vertex edges vi* then provided in block 158 is calculated in block 156. In block 150, the offset vertex edges vi*, the orientations ai*, the enlargement gap g*, the orientation ai′ provided in block 144, the offset edge vectors si′ and the offset vertex information vi′ are output, as is indicated in FIG. 1A in blocks 106 and 108.
Based on the attributes vi′, si′ and ai′ output, the processing of the offset edges, which is indicated in FIG. 1A in block 110, takes place subsequently in a second main processing step. For the processing of the offset edges, they are approximated by a number of steps, the number of steps depending on the size of the offset edge. It is to be pointed out at this point that 0 edges having a value ai=0 are omitted. In addition, the width and the height of a step should not exceed a value of 1.0. At first, the number of steps nstep per edge must be determined. This takes place according to the following calculating rule:




  
    
      
        
          
            
              
                s
                max
              
              =
              
              ⁢
              
                max
                ⁡
                
                  (
                  
                    
                      
                      
                        s
                        
                          i
                          ,
                          x
                        
                        ′
                      
                      
                    
                    ,
                    
                      
                      
                        s
                        
                          i
                          ,
                          y
                        
                        ′
                      
                      
                    
                  
                  )
                
              
            
          
        
        
          
            
              
                n
                
                  i
                  ,
                  Stufe
                
              
              =
              
              ⁢
              
                ⌈
                
                  s
                  max
                
                ⌉
              
            
          
        
      
    
    
      
        1
        )
      
    
  
  
    
      
        
          n
          
            i
            ,
            Stufe
          
        
        =
        
          2
          
            ⌈
            
              
                log
                2
              
              ⁡
              
                (
                
                  s
                  max
                
                )
              
            
            ⌉
          
        
      
    
    
      
        2
        )
      
    
  




The calculating method indicated by 2) is preferred since it can be simplified significantly by the hard-coded maximum value for the edge lengths Emax and also substitutes complicated devisors by simple offset operations in the subsequent calculation of the step vectors qi. The step vectors qi are calculated according to the calculating rule indicated subsequently:




  
    
      q
      ⇀
    
    i
  
  =
  
    
      1
      
        n
        
          i
          ,
          step
        
      
    
    ·
    
      
        s
        ⇀
      
      i
      ′
    
  




In order to obtain the same weighting methods with all the vertices, two different step methods are required. The step requirement θi′ is 0, that is horizontal, for the edges at the top right and the edges at the bottom left. The step orientation θi′ is 1, that is vertical, for the steps at the top left and for the steps at the bottom right. Horizontal steps refer to horizontal intersections of a staircase function with the corresponding edge at the end of the step vector qi. The vertical steps relate to vertical intersections of the staircase function with the respective edge at the end of the step vector qi, as can be seen from FIG. 6. A slice is a vertical step element used to determine the weightings of the texels. The following calculating rule applies to the step orientation θi′:




  
    θ
    i
    ′
  
  =
  
    {
    
      
        
          1
        
        
          
            if
            ⁢
            
              
            
            ⁢
            
              (
              
                
                  (
                  
                    
                      a
                      
                        i
                        ,
                        x
                      
                    
                    <
                    0
                  
                  )
                
                ⁢
                
                  
                
                ⁢
                and
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      a
                      
                        i
                        ,
                        y
                      
                    
                    >
                    0
                  
                  )
                
              
              )
            
            ⁢
            
              
            
            ⁢
            or
            ⁢
            
              
            
            ⁢
            
              (
              
                
                  (
                  
                    
                      a
                      
                        i
                        ,
                        x
                      
                    
                    >
                    0
                  
                  )
                
                ⁢
                
                  
                
                ⁢
                and
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      a
                      
                        i
                        ,
                        y
                      
                    
                    <
                    0
                  
                  )
                
              
              )
            
          
        
      
      
        
          0
        
        
          else
        
      
    
  




Since the edges having a step orientation θi′ equaling 1 have one vertical element more than the number of steps ni,step, an additional weighting cycle would be required. Instead, it can be offset to the processing of a neighboring vertex edge of the same x position, which, in connection with the present invention, is referred to as step propagation and will be detailed subsequently referring to FIG. 9.
A slice processing loop is provided for each edge and processes one slice per cycle, as will be detailed subsequently referring to FIG. 8. Each cycle can weight one or two texels, wherein the input parameters for the processing loop are v′, q, nstep, a′y and θ′. The loop produces a data structure and fills it with corresponding data illustrated in the following table:
















y′ofs
y is the integer coordinate of a texel row k = 0.




This is the top-most row for edges for which




θ′ = 1 and in all other cases the bottom-most




row.



y′num
number of texel rows



x′ofs[k]
x is the integer coordinate of the left-most




weighted texel in this row



x′num[k]
number of weighted texels in this row



w′ofs[k]
weighting index 1 for the left-most texel



w′prop[k]
weighting factor for texels in this row which are




outside the right-most and weighted texel



w′tex[l]
texel weighting = 0.0 to 1.0










In FIG. 7 entries indicated in the above table are illustrated graphically. The highest possible value for k and l, in the preferred embodiment, depends on the maximum allowed edge extension Emax, so that the following applies:

    
    
        k=0, . . . , Emax, and
        l=0, . . . , 2 Emax.
    
    


The following calculating rule applies for the step propagation:

p*i=θ′i·1⁄2|qi,y|

Referring to FIG. 8, a preferred embodiment of the slice processing loop mentioned above will be explained in greater detail.
As regards the following description of a slice processing loop in FIG. 8, it is to be noted that an explicit indication of the index i has been dispensed with since it would appear in all the values. Only the process for one edge will be described, wherein the method described referring to FIG. 8 is usually performed in parallel for all the edges. In FIG. 8, the index l is indicated which only counts the number of texels hit by its edge (see FIG. 7) for processing the slices.
In an initial portion 160, the coordinates for the first slice are initialized, see the vectors ui,0 in FIG. 9. In block 162, the coordinates of the starting point ux, uy0 and the height duy (see FIG. 10B) are determined, wherein the actual coordinates of the first slice depend on the beginning of the edge considered, which is indicated by the corresponding starting vertex v, and on the orientation of the edge, which is indicated by θ′ or ay. Thus, for determining the actual starting point, it is at first determined in block 164 whether there is a horizontal step orientation θ′ or not for the point considered and determined in block 162. If the step orientation is horizontal, the method will proceed to block 166 in which the coordinate ux of the starting point is increased by the value qx/2. The other coordinates or parameters determined in block 162 remain unchanged.
If the step orientation determined in block 164 is not a horizontal but a vertical orientation, the method will proceed to block 168 in which the orientation ay of the edge considered is determined at first. If the edge considered is a top edge, the process will proceed to block 170 in which the coordinate value ux is increased by the value qx. The coordinate value uy0 is also increased by the value qy/2 in block 170.
If it is determined in block 168 that the edge considered is a bottom edge, the method will proceed to block 172 in which the height duy is halved.
The starting coordinates for the slice considered determined in this way are then provided to block 174. In block 174, the indices used are first initialized, wherein k counts the texel rows, l counts the texels in general and n counts the slices. The coordinate of the first texel row y′ofs corresponds to the texel below the slice starting point, wherein in the second row in block 174, regarding the starting coordinate value uy0, the so-called floor function is indicated, which illustrates the next integer value in a direction −∞ departing from the value indicated for uy0.
The number of the rows concerned and the texels concerned when processing the slice is initialized in the first row from 1, as is indicated by y′num=x′num [0]=1. In addition, the x coordinate x′ofs of the beginning of the first row will equal the slice position ux, wherein again the next integer value departing from ux in the direction −∞ will be selected. In addition, the weighting information w′ofx for the first row and the first texel is initialized to a value 0.
Based on the values initialized in block 174, the method will proceed with block 176 in FIG. 8B. In block 176, an inspection is made as to how the x position considered at this time has changed due to later calculations. Departing from block 174, it is determined that the two parameters indicated in block 176 are equal so that the method in this case proceeds to block 178 in which the first texel is weighted. In block 178, the weightings for the first texel hit by the slice are determined, which is determined according to the calculating rules indicated in block 178. In block 178, at first the slice end point uy1 and subsequently the appropriate integer texel coordinate y1int is calculated based on the next integer value of uy1, in the direction of −∞. Then, the texel fraction wx is calculated, resulting from the vertical section, as is illustrated in FIG. 7. In addition, the fraction wy0 resulting from the horizontal section is calculated. The differentiation indicated takes into account which direction the slice has (see FIG. 10B) and whether one or two texels are hit.
Based on the information regarding the fraction of the horizontal and the vertical section determined in this way, the weighting contribution w′tex[l] of the slice to the current texel is determined in block 178 by increasing the existing value by the product of wx times wy0. Finally, the weighting contribution w′prop passed on to the right texel is determined by increasing the existing value for W′prop by the value wy0.
If it has been determined in block 176 that the x position has changed by a later calculation, that is a new texel in the same row is considered, the index l and the number of texels already processed in this row x′num are at first incremented. In addition, the weighting for the new texel w′tex[l] is set to w′prop[k] so that the weighting contributions of the previous texels are passed on.
The method then proceeds from block 180 to block 178 in which a corresponding weighting of the new texel is performed in the manner described above.
If the calculation of the weighting of one texel has been completed in block 178, the method will proceed to block 182 in which it is determined whether the end point of the slice is in another row than the starting point. If this is the case, the method will proceed to block 184 in which a new texel in a new row is determined, that is a process-jump to the next row to be considered is performed so that the row number y′num, the row index k and the texel index l are incremented at first. In addition, the texel number X′num[k] is re-initialized to a value 1 and the coordinate of the first texel in the new row x′osf is determined. In addition, the index for the wtex array is determined in which the weight for the first texel of this row is stored.
The method proceeds from block 184 to block 186 in which the weighting for the second texel hit by the slice is calculated, similar to block 178, so that reference is made to the description there.
After block 186, the method proceeds to block 188 in which the x position of the slice just considered is stored and the index n is incremented in order to get to the next slice. In block 190, it is determined whether the value n is smaller than the value nstep and, if this is not the case, it is determined that the last slice has been processed. In this case the method ends. If it is, however, determined that the last slice has not yet been processed, the method will proceed to block 192 in which the coordinates for the next slice are calculated. For this, the coordinate ux is increased by the value qx and the coordinate uy0 is also increased by the value qy. The differentiation in the consideration of duy takes the case shown in FIG. 9 with respect to the edges S2 and S3 into account, according to which the last slice only comprises half the length. In the edges s0 and s1, this is already the first slice, which has already been taken into account in the starting initialization in block 160.
Based on the data determined in block 192, the texel coordinates of the starting point are re-calculated in block 194 and a new weighting calculation run for this slice is then performed.
The vertex edge processing indicated in FIG. 1A in block 114 will be detailed subsequently, which treats the vertical edges having been added to fill the vertical gaps.
Fundamentally, the weighting tables for the vertex edges provide the same parameters as have been used for the offset edges. The implementation of these weighting tables is, however, less complicated since the number of possible rows is considerable lower and the indication of the weightings and rows do not differ since the orientation of the edges considered is always vertical.
The following table indicates the weighting for the vertex edges.
















y*ofs
y integer coordinate of the texel row k = 0



x*ofs
x integer coordinate of the texel row k = 0



y*num
number of texel rows



w*tex[k]
texel weighting in the range of 0.0 to 1.0



w*prop[k]
weightings for the texels in this row which are




to the right of the weighted texel which is




arranged in the right-most position










The enlargement gap g and the step propagation p are added to the total length of a vertex edge, as is illustrated in FIG. 10A so that the coordinates (starting point and end point) of a vertex edge result according to the following calculating rule:




  
    
      
        
          (
          
            y0
            ,
            y1
          
          )
        
        =
        
        ⁢
        
          {
          
            
              
                
                  (
                  
                    
                      
                        v
                        
                          i
                          ,
                          y
                        
                        *
                      
                      -
                      
                        p
                        i
                        *
                      
                    
                    ,
                    
                      
                        v
                        
                          i
                          ,
                          y
                        
                        *
                      
                      +
                      
                        g
                        i
                        *
                      
                    
                  
                  )
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      a
                      
                        i
                        ,
                        y
                      
                      *
                    
                  
                  <
                  0
                
              
            
            
              
                
                  (
                  
                    
                      
                        v
                        
                          i
                          ,
                          y
                        
                        *
                      
                      -
                      
                        g
                        i
                        *
                      
                    
                    ,
                    
                      
                        v
                        
                          i
                          ,
                          y
                        
                        *
                      
                      +
                      
                        p
                        i
                        *
                      
                    
                  
                  )
                
              
              
                else
              
            
          
        
      
    
  
  
    
      
        x
        =
        
        ⁢
        
          v
          
            i
            ,
            x
          
          *
        
      
    
  




The edge length is g+p=2·r+p, with a max value for r and p=0.5. A maximum length of 0.5·1.0+2·0.5=1.5 results from the above calculating rule, which limits the number of texel rows to 3. The table elements for k=0, 1, 2 for a vertex edge i are determined according to the following calculating rule:

yint=y*ofs=└Y┘

y′int=└y′┘

xint=x*ofs=└x┘

y*num=y′int−yint+1

w*prop[k]=min(yint+k+1, y′)−max(yint+k, y)

w*tex[k]=w*prop[k]·(xint+1−x)

After all the weighting tables for the corresponding edges, that is the vertex edges and the offset edges, have been determined and provided according to FIG. 1B in blocks 116 and 118, the final color calculation according to block 120 in FIG. 1B can take place. Subsequently, an example of the last remaining process step from FIG. 1, that is block 120, will be discussed in greater detail. This color calculation mainly consists of a loop which assesses the data structures which have been produced and stored in the manner described above for each offset edge and each vertical edge. More explicitly, in this color calculation reference is made to all the texels contacted or covered by the enlarged footprint, for each of these texels a weighting is determined. For a texel (x, y), the weighting factor w Σ [0, 0, 1.0] is calculated to the sum of all the edge contributions read out from the weighting tables. The process for calculating the pixel color resulting depends, in detail, on the region surrounding the pixel, such as, for example, on the organization of the access to the texture memory. A functional example for the color calculating procedure will be explained in greater detail subsequently referring to FIG. 11, wherein the procedure illustrated in FIG. 11 is a loop which is passed several times to process all the texels concerned. Regarding FIG. 11, it is to be pointed out that the index i describes the parallelism of the calculations indicated for four edges. Equations in which i appears on both sides of the equal sign describe four equations, one for each edge (i=0, 1, 2, 3). i indicated values as the function argument describe four arguments. The index l indicates the texels hit by an edge within a row.
In FIG. 11A, in block 200 all the color components and the sum of all the texel weights are at first initialized to 0. The color components are generally RGB components and the α component, wherein the equations show a calculation for only an abstract component colorpix. After the initialization of the color components and the sum of all the texel weights, a bottom-most and a top-most texel row are determined in block 202, wherein the smallest and the largest y coordinate of all the texels described by the values in the two tables described above must be calculated. At first, a minimum and a maximum value of one respective edge (y′i,min and y′i,max) are determined from the table indicated above regarding the offset edges. By the equation indicated, eight equations are described, that is for the determination of ymin and Ymax for respective four edges. The differentiation indicated in the allocation takes into account whether the table has been set up in the direction of increasing or decreasing y coordinates.
In addition, the minimum and the maximum values of an edge y*i,min and y*i,max are determined in block 202 based on the table indicated above for the vertex edge processing. Afterwards eight minimum values ymin are determined from the minimum values determined for the vertex edges and the offset edges and eight maximum values ymax are determined from the determined maximum values for the offset edges and the vertex edges. After the determination of the bottom-most and the top-most texel row has been performed in this way, the method will proceed to block 204 in which the loop value y describing a texel row is initialized to the value ymin. The loop is passed for y values from ymin to ymax.
Subsequently, the values indicated in the tables described above are used in block 206 to compensate the offset contained therein. Thus, the loop parameter k′i applying to the offset edges is determined at first. The values of the corresponding table contain only values for xnum rows, beginning with the integer y coordinate of the texel row 0 (yofs). This offset is subtracted from the loop value to obtain the row index k′i within the table for the offset edges. Similarly, as has been described above regarding block 202, it has to be taken into account whether the underlying table contains the y coordinate in an increasing or decreasing order.
Subsequently, a corresponding removal of the offset for the values from the vertex edge table takes place to obtain the row index k*′i in this way. In addition, the values of the flags Δ′i and Δ*i indicating whether an edge considered is above the current y, that is will provide a contribution to the texel weights, are determined.
Afterwards, the left-most and the right-most texel in the row considered are determined in block 208. For the current row, the smallest and the largest x coordinate of all the texels are now determined, which are weighted by the tables, that is the x coordinates x′i,min and x′i,max for the offset edges and the coordinates .x*i,min and x*i,max for the vertex edges. Edges not providing a contribution, that is for which the flags Δ*i or Δ′i determined in block 206 are 0, are not taken into account in the corresponding determination of the minimal and maximal x values, which is formally described by the ±∞ contributions.
The minimum value xmin is then selected from the minimum x coordinates determined for the offset edges and the vertex edges. The maximum value xmax is also selected from the maximum x coordinates determined for the offset edges and the vertex edges. Subsequently, the method proceeds to block 210 (FIG. 11B). In block 210, the loop value x indicating a texel within the row considered is initialized to the value xmin. This loop value runs from xmin to xmax. Subsequently, the method proceeds to block 212 in which the weighting contributions for the offset edges are read out from the tables provided. Here, the contributions of all the eight edges are determined for weighting the texel at the coordinates x, y.
At first, the index li of the texel within the row for a corresponding edge is considered (see FIG. 7). Afterwards, the weighting contribution w′i for the offset edge is considered, wherein four cases for each edge must be differentiated. The texel can either be above or below the edge, wherein in this case the value Δ′i is 0 so that the concerning texel does not provide a contribution. In addition, the texel can be left of the edge, wherein in this case the index l is smaller than 0 and in this case no contribution of the texel is provided to the overall weighting. If the texel is, however, right of the edge, that is l≧xnum, the value w′prop provided in the corresponding table is selected. If the texel is on the edge, the value w′tex provided in the table is provided. The factor a′i,x negates the result for right edges.
In parallel to block 212, a corresponding read out of the tables regarding the weighting contribution of the vertex edges is performed in block 214, wherein the corresponding contribution w*i is also determined. Like in block 212, four cases must be differentiated. In the first case, the texel is above or below the edge, the corresponding value Δ*i is thus 0. In this case, the texel does not provide a contribution for the overall weighting. If the texel is left of the edge, it will not contribute to the weighting either. If the texel is to the right of the edge, x>x*i,ofs, the value w*prop determined in the table regarding the vertex edges will be selected. If the texel is on the edge, the corresponding value w*tex will be selected. In this case, the result for right edges is also negated by means of the factor a*i,x.
After the respective contributions for the offset edges and the vertex edges to weighting have been determined in blocks 212 and 214, the method proceeds to block 216 in which all the contributions are summed and the texel color is weighted. At first, the eight contributions calculated in blocks 212 and 214 are summed up to obtain the summed weighting value w. The weighting value w obtained in this way is then multiplied by the color components colortex(x,y) of the texel and added to the color of the pixel colorpix. For a later normalization of the color, the overall wsum of the texel weightings is performed. More explicitly, the value wsum is increased by the value w determined in block 216.
Finally, the method proceeds to block 218 wherein, on the one hand, the loop value x is incremented by 1 and, on the other hand, it is determined whether the value x exceeds the maximum value xmax. If this is not the case, there are still texels to be processed in the considered row and the method, from block 218, goes back to blocks 212 and 214. There is consequently a jump by one texel to the right and a corresponding revision concerning this texel is performed. If it is determined in block 218 that all the texels of a row have been processed, the method will proceed to block 220 in which the loop value y is incremented by 1 and it is examined where the loop value y exceeds the maximum y value ymax. If this is not the case, a jump to the next row is performed and the method goes back to block 206. If it is determined that the last texel row has been processed, the method proceeds from block 220 to block 222. In block 222, the actual color of the pixel colorpix is determined, wherein for the case that a weighting exists, that is wsum is unequal to 0, indicating that at least a texel has been contacted by the considered edge, the color pixel value is normalized based on the summed weighting wsum, that is colorpix/sumis determined. In a so-called 0 weighting, that is when the footprint degenerates to a point and has an enlargement offset has a value of 0, the color of the texel under the vertex 0 of the footprint is taken over unchanged (next filter). This means that the texel closest to the point coordinates is selected and is associated a constant weighting of 1.0.
Although the present invention, in the above description of the preferred embodiments, has been described on the basis of a footprint having four sides, the inventive approach can generally be extended to any footprint.
Further, it is to be pointed out that the present invention is not limited to the above embodiments in which an initial enlargement of the footprint has been performed. If such an enlargement is not desired, if, for example, no enlargement offset is associated with the receiving footprint, the inventive method operates regarding the original footprint and results in an accelerated processing of it due to the inventive steps for finding texels below edges.
While this invention has been described in terms of several preferred embodiments, there are alterations, permutations, and equivalents which fall within the scope of this invention. It should also be noted that there are many alternative ways of implementing the methods and compositions of the present invention. It is therefore intended that the following appended claims be interpreted as including all such alterations, permutations, and equivalents as fall within the true spirit and scope of the present invention.

## Claims

1. A method for displaying an image on a display, the image comprising at least one pixel, the method comprising:
determining weighting factors for a color calculation of a color value of texels for a footprint of the at least one pixel, the footprint covering a plurality of texels in a texel grid, wherein determining the weighting factors comprises:
(a) determining form information of the footprint;
(b) determining edges of the footprint;
(c) approximating the edges determined in step (b) by a staircase function;
(d) determining the texels of the texel grid contacted by the staircase function; and
(e) determining a weighting factor for each texel containing a portion of the staircase function depending on a subarea of the respective texel covered by the footprint;
wherein an enlargement offset (r) is associated with the footprint,
wherein following step (a), based on the enlargement offset, the footprint is enlarged by offsetting the edges of the footprint outwardly from current edge footprint positions by a distance depending on the enlargement offset,
wherein the offset edges are determined in step (b),
wherein the offset edges are approximated in step (c) by a staircase function, and
wherein in step (e) a weighting factor for each texel containing an offset edge is determined depending on the subarea of the respective texel covered by the enlarged footprint; and
calculating a pixel color on the basis of the determined weighting factor; and
outputting the pixel color for generating a representation of the pixel on the display.

2. The method according to claim 1, wherein gaps resulting due to the enlargement of the footprint are filled by horizontal and vertical edges.

3. The method according to claim 2, wherein in step (e) the weighting factor for each texel containing an incorporated vertical edge is determined depending on a subarea of the respective texel covered by the enlarged footprint.

4. The method according to claim 1, wherein enlarging the footprint includes offsetting edge end points in the horizontal direction and the vertical direction by the same distances determined by the enlargement offset.

5. A method for displaying an image on a display, the image comprising at least one pixel, the method comprising:
determining weighting factors for a color calculation of a color value of texels for a footprint of the at least one pixel, the footprint covering a plurality of texels in a texel grid wherein determining the weighting factors comprises:
(a) determining form information of the footprint;
(b) determining edges of the footprint;
(c) approximating the edges determined in step (b) by a staircase function;
(d) determining the texels of the texel grid contacted by the staircase function; and
(e) determining a weighting factor for each texel containing a portion of the staircase function depending on a subarea of the respective texel covered by the footprint,
wherein the staircase function for each edge of the footprint includes a plurality of steps, a plurality of horizontal step elements and a plurality of vertical step elements,
wherein each edge includes a plurality of subsequent edge portions of equal length,
wherein a horizontal edge is present when the end points of the edge portions of the edge intersect a horizontal step element of the staircase function,
wherein a vertical edge is present when the end points of the edge portions of the edge intersect a vertical step element of the staircase function,
wherein a horizontal edge includes a number of vertical step elements, the number being equal to the number of steps of the staircase function,
wherein a vertical edge includes a number of vertical step elements, the number being larger than the number of the steps of the staircase function by an additional vertical step element, and
wherein the additional vertical step element is used for calculating the weighting factors of a neighboring edge having the same vertical position; and
calculating a pixel color on the basis of the determined weighting factor; and
outputting the pixel color for generating a representation of the pixel on the display.

6. The method according to claim 5, wherein in step (d) a texel contacted by the staircase function is determined based on the starting points and/or end points of the vertical portions of the staircase function.

7. The method according to claim 5, wherein in step (e) a uniform weighting value is associated with the texels of the texel grid not contacted by the staircase function and covered by the footprint.

8. The method according to claim 5, wherein in step (e) the weighting factor for each texel is associated with a data structure.

9. The method according to claim 5, wherein determining a subarea of the texel, following step (e), includes determining the texel subarea determined by the staircase function and covered by the footprint.

10. The method according to claim 9, wherein the weighting factor determined in step (e) is determined by the ratio of the texel subarea to the texel overall area.

11. The method according to claim 5, wherein the weighting factors for all the edges of the footprint are produced in parallel.