COMPUTER SCIENCE AND ENGINEERING
COMPUTER GRAPHICS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Scan Line Algorithm
|
|
|
Flood Fill Algorithm
|
|
|
Boundary Fill Algorithm
|
|
|
None of the above
|
Detailed explanation-1: -If the boundary is of one single color, this approach proceeds outwards pixel by pixel until it hits the boundary of the region. Boundary Fill Algorithm is recursive in nature.
Detailed explanation-2: -In Flood-fill algorithm a random colour can be used to paint the interior portion then the old one is replaced with a new one. In Boundary-fill algorithm Interior points are painted by continuously searching for the boundary colour. It requires huge amount of memory.
Detailed explanation-3: -Boundary-fill Algorithm If we have a specified boundary in a single color, then the fill algorithm proceeds pixel by pixel until the boundary color is encountered. This method is called the boundary-fill algorithm.
Detailed explanation-4: -Boundary Fill Algorithm: It is also called an edge fill algorithm. In this method, a seed point is taken in the polygon boundary and checks whether the adjacent or neighboring pixel is colored or not. If the adjacent pixel is not colored then, fill it. This can be done using two approaches: 4-connected or 8-connected.
Detailed explanation-5: -Boundary fill is the algorithm used frequently in computer graphics to fill a desired color inside a closed polygon having the same boundary color for all of its sides. The most approached implementation of the algorithm is a stack-based recursive function.