Scan Line Polygon Fill Algorithm
Describe briefly the Scan Line Polygon Fill Algorithm with appropriate diagram?
Expert
The Scan Line Polygon Fill Algorithm is the information for a solid body which is stored in the frame buffer and employing the pixel information that is, of both boundary and interior area are identified and, are therefore plotted. Here we are going to do scan conversion of solid area where the area is enclosed by polygonal lines. Pixels are identified for the interior of the polygonal area, and are then filled plotted with the predefined color. Now discuss the algorithm briefly, and then we will go into details on the same. This algorithm verifies and alters the characteristics (i.e., parameters and characteristics) of the pixels along the present raster scan line. As soon as it crosses over from the outside to the inside of a boundary of the specified polygon it starts resetting the color (or gray) characteristic. In effect, the filling regions along that scan line. It changes back to the original characteristic when it crosses the boundary again.
Figure shows differences of this essential idea.
Differentiate raster and random scan displays?
Explain the meaning of the parabolic splines?
Illustrate the term scan line algorithm?
Briefly define the term bundled attributes? What are its features?
List out the all advantages and disadvantages of the Plasma panel display?
Explain the term affine transformation?
What is meant by the term aliasing and anti-aliasing?
Illustrate the difference between bitBlt and pixBlt?
Illustrate the two main uses of animation?
Illustrate the term output primitive and also jaggies?
18,76,764
1953608 Asked
3,689
Active Tutors
1452731
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!