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

What is seed fill, What is seed fill?  One way to fill a polygon is to ...

What is seed fill?  One way to fill a polygon is to begin from a given point (seed) known to be inside  the polygon and highlight outward from this point i.e. neighboring pixel

Important point about the de casteljeau algorithm, Important point about th...

Important point about the De casteljeau algorithm 1)      Bezier Curve: P (u) =    ................     (1) Here B n,i (u) = n c i u i (1 - u) n-i        ..

Dda and bresenhem line drawing algorithm, when dda algorithm is more effici...

when dda algorithm is more efficient than bresenhem line drawing algorithm

What is the difference between kerning and tracking, QUESTION (a) What ...

QUESTION (a) What is the difference between kerning and tracking? (b) What is the advantage of creating colours in the Swatches panel instead of the Colour panel? (c) Wha

Vecgen algorithm, Working of vecgen algorithm with diagram

Working of vecgen algorithm with diagram

Depth-buffer (or z-buffer) method , Depth-buffer (or z-buffer) Method ...

Depth-buffer (or z-buffer) Method  Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as

What you mean by parallel projection, What you mean by parallel projection?...

What you mean by parallel projection?  Parallel projection is one in which z coordinates is discarded and parallel lines from every vertex on the object are extended unless the

What happens while two polygons have similar z value , What happens while t...

What happens while two polygons have similar z value and the z-buffer algorithm is utilized? Solution : z-buffer algorithms, varies colors at a pixel if z(x,y)

Objectives-visible-surface detection, After going through this section, you...

After going through this section, you should be capable to: know the meaning of Visible-surface detection; distinguish among image-space and object-space approach for vi

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