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

Fixed point scaling, what is fixed point scaling? how composit transformati...

what is fixed point scaling? how composit transformation techniques works on it

Bresenham line generation algorithm, Bresenham Line Generation Algorithm ...

Bresenham Line Generation Algorithm This algorithm is exact and efficient raster line generation algorithm. Such algorithm scan converts lines utilizing only incremental integ

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

Introduction, how can we write the introduction matter for graphicaluser in...

how can we write the introduction matter for graphicaluser interface

Basic transformations - 2-d and 3-d transformations, Basic Transformations ...

Basic Transformations - 2-d and 3-d Transformations Consider the xy-coordinate system upon a plane. An object or Obj in a plane can be identified as a set of points. All objec

Describe and explain four features of firewire, QUESTION 1. Describe an...

QUESTION 1. Describe and explain four features of Firewire. 2. Explain clearly what is sampling rate and how does it influences the quality of video produced. 4. In Adobe

2d line segment generation - 2d shape primitives, 2D Line Segment Generatio...

2D Line Segment Generation  A digitally plotted line is basically an approximation of infinite number of points on an abstract line segment by only a finite number of points on

Sutherland hodgman algorithm, Sutherland-Hodgman Algorithm Any polygon...

Sutherland-Hodgman Algorithm Any polygon of any type of arbitrary shape can be explained with the assist of some set of vertices connected with it. While we try to clip the po

B splines, What is uniform rational splines

What is uniform rational splines

How is sampling done, Image Processing 1. How is sampling done? Explain...

Image Processing 1. How is sampling done? Explain quantization in digital image processing? 2. Explain in brief: (1) Image Subtraction (ii) Image averaging. 3. Explain in

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