Scan line polygon fill algorithm - raster graphics, Computer Graphics

Assignment Help:

Scan Line Polygon Fill Algorithm - Raster Graphics

In such algorithm, the information for a solid body is stored in the frame buffer and utilizing that information each pixel that is, of both interior region and boundary are considered and, are so plotted. This time we are going to perform scan conversion of solid regions; here the areas are bounded through polygonal lines.  Pixels are considered for the interior of the polygonal area and are then filled plotted along with the predefined colour. Now let us discuss the algorithm briefly and then we will further discuss details on the similar.

This algorithm checks and modifies the attributes (that is parameters and characteristics) of the pixels only with the current raster scan line. Immediately it crosses over from the outside to the inside of a boundary of the particular polygon it begins resetting the colour or as gray attribute. In filling effect the region along that scans line. Such changes back to the initial attribute while it crosses the boundary again. In following figure, shows variations of this basic idea.

1234_Scan Line Polygon Fill Algorithm - Raster Graphics 1.png

Figure: Concept of scan line polygon filling

Hence as to understand Scan Line Polygon Fill Algorithm in detail consider in following figure:

1607_Scan Line Polygon Fill Algorithm - Raster Graphics 2.png

Figure: Scan line polygon filling


Related Discussions:- Scan line polygon fill algorithm - raster graphics

3d graphics, Define hermite interpolation in deatail description with examp...

Define hermite interpolation in deatail description with example?

Offset lithography printing, QUESTION A trainee designer, Susan, joins ...

QUESTION A trainee designer, Susan, joins your place of work. During a workshop, you are asked to present on printing procedures and agencies in Mauritius. Susan asks you what

Summary of graphic primitives, Summary of Graphic Primitives In this a...

Summary of Graphic Primitives In this all section, we have illustrated the basic graphic primitives that are line, point and circle; we have also illustrated both practical an

#, normal vector

normal vector

Character generation, Which is the most usable and frequent method to gener...

Which is the most usable and frequent method to generate a character?

Line segment that joining by using bresenham line algorithm, Sketch Line Se...

Sketch Line Segment That Joining By Using Bresenham Line Algorithm Example: Sketch line segment that joining (20, 10) and (25, 14) by using Bresenham line generation algorit

Compare bresenham line generation algorithm with dda, 1. Compare Bresenham...

1. Compare Bresenham line generation with Digital Differential Analyzer line generation. Ans.   Bresenham line generation algorithm is better than Digital Differential Analyze

Remark for the bresenham line generation algorithm, Remark for the Bresenha...

Remark for the Bresenham Line Generation Algorithm Remark: The algorithm will be properly the same if we suppose | m | Algorithm | m | (a) Input two line endi

What is meant by addressability, What is meant by Addressability? Ans. ...

What is meant by Addressability? Ans. Addressability is the number of individual dots per inch (d.p.i.) that can be formed. If the address of the current dot is (x, y) then the

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd