Scan line polygon fill algorithm - raster graphics, Computer Graphics

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

Posted Date: 4/3/2013 2:06:16 AM | Location : United States







Related Discussions:- Scan line polygon fill algorithm - raster graphics, Assignment Help, Ask Question on Scan line polygon fill algorithm - raster graphics, Get Answer, Expert's Help, Scan line polygon fill algorithm - raster graphics Discussions

Write discussion on Scan line polygon fill algorithm - raster graphics
Your posts are moderated
Related Questions
Intersection Test - Visible Surface Detection Test: It called Intersection Test also: we go for intersection test, if Min-max test fails. Now we take each edge individually

What is the maximum number of objects such can be handled via the depth/z- buffer algorithm? Solution : In z-buffer algorithm, an arbitrary number of objects can be handled sin

The purpose of this assignment is for you to create an animation like you would see on an electronic greeting card. Have fun and be creative.  Here are the requirements: you

For this assignment, you will add to the drawing program new features that are similar to features that you already have. Apply object-oriented design concepts such as inheritance

Compression methods utilized for digital video can be categorized in three major groups: General reason compression techniques can be utilized for any type of data. Intr

Given arbitrary 8 values at the vertices of a cube, please draw the curved iso-surfaces with shading. Also, please draw the saddle point. This can be done relatively easy with phys

explain interactive picture-construction techniques


How does the Cyrus Beck line clipping algorithm, clip a line segment whether the window is non convex? Solution : see the following figure 13, now the window is non-convex in s

Problem: a. Provide examples of classification of print finishing processes. b. In advertising, what do you meant by creative strategies? c. Creative strategies are div