![]() ![]() For a boundary-fill, in place of the target color, a border color would be supplied. The algorithm looks for all nodes in the array that are connected to the start node by a path of the target color and changes them to the replacement color. The traditional flood-fill algorithm takes three parameters: a start node, a target color, and a replacement color. The algorithm parameters Recursive flood fill with 8 directions ![]() Instead, see Even-odd rule and Nonzero-rule. Note that flood filling is not suitable for drawing filled polygons, as it will miss some pixels in more acute corners. A variant called boundary fill uses the same algorithms but is defined as the area connected to a given node that does not have a particular attribute. It is used in the "bucket" fill tool of paint programs to fill connected, similarly-colored areas with a different color, and in games such as Go and Minesweeper for determining which pieces are cleared. Algorithm in computer graphics to add color or texture Recursive flood fill with 4 directionsįlood fill, also called seed fill, is a flooding algorithm that determines and alters the area connected to a given node in a multi-dimensional array with some matching attribute. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |