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

Linearly interpolate - modeling and rendering, Linearly interpolate - Model...

Linearly interpolate - Modeling and Rendering I 4 = I 1 + t (I 2 - I 1 ); here t = (|y 1 - y 2 |)/(|y 1 - y 2 |) I D = I A + t (I B - I A ); here t = (|AD|)/(|AB|)

Write a c-code for a user to draw a polygon object, Write a C-code for an i...

Write a C-code for an interactive program which allows a user to draw a polygon object in a window and then gives various choices of geometric transformations on the polygon.  Once

Graphic interchange format (gif), Graphic Interchange Format (GIF): The Gr...

Graphic Interchange Format (GIF): The Graphic Interchange Format is an efficient implies to transmit images across data networks. In the early 1990 year the original designers of

PHONG INTERPOLATION, DESCRIBE PHONG INTERPOLATION SHADING METHOD

DESCRIBE PHONG INTERPOLATION SHADING METHOD

Lamberts cosine law - diffuse reflection, Lamberts Cosine Law - Diffuse Ref...

Lamberts Cosine Law - Diffuse Reflection "LAMBERTS COSINE LAW" specify that the radiant energy from any minute surface area dA in any direction θ relative to the surface usual

What is surface patch, What is surface patch?  A single surface element...

What is surface patch?  A single surface element can be explained as the surface traced out as two parameters (u, v) take all possible values between 0 and 1 in a two-parameter

Sutherland hodgeman polygon clipping algorithm, What is clipping? Explain S...

What is clipping? Explain Sutherland Hodgeman polygon clipping algorithm with example.  OR Write the algorithm for Sutherland Hodgeman Polygon. Beginning with the initial set of p

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