Graphics processing method and system
View Patent ↗The embodiments discussed herein involve flood filling a region with anti-aliasing. In forming a fill region, a candidate pixel can be included in the region based on a color of the pixel and also a color of a neighbor of the point. The inclusion basis may be a color distance between a seed color and the points, and a color distance between the seed color and the point's neighbor. Points in the region may be weighted according to their color distance relative to the seed color, where the color distance can also take into account alpha values. Flood filling may be anti-aliased by assigning alpha values to pixels in gaps between corners of the fill region, where an alpha value may be proportional to a point's contribution to the gap. Dimples in a fill region may be tested for and used to determine which of two flood fill algorithms to use.
1. A method of flood filling a region in an image, the method comprising:
providing different first and second flood fill algorithms in a computer, each having substantially a same tolerance and each capable of flood filling regions of arbitrary images where the first flood fill algorithm uses color distance determination and antialiasing;
the computer automatically selecting which of the different first and second flood fill algorithms to use on a region; and
flood filling into the region of the image by the computer using the selected algorithm, and
wherein the selecting comprises calculating an artifact level of the flood fill of the region according to the first flood fill algorithm and using the artifact level to select which of the flood fill algorithms will be used.
2. A method according to claim 1 , wherein the using the artifact level comprises comparing the artifact level to a threshold to determine which of the flood fill algorithms will be used.
3. A method according to claim 1 , wherein the artifact level is calculated by testing pixels in the region against their respective neighbors.
4. A method according to claim 3 , wherein the testing of a pixel comprises determining if two opposing neighbors in the pixels neighborhood are different.
5. A method according to claim 4 , where the opposing neighbors are adjacent to the pixel on opposite sides of the pixel, either vertically or horizontally.