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

Advantages of scan line algorithm, Advantages of Scan line Algorithm:  ...

Advantages of Scan line Algorithm:   This time and always we are working along with one-dimensional array as: x[0...x_max] for color not a 2D-array like in Z-buffer algorithm.

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

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

Properties of perspective projections - transformation, Properties of Persp...

Properties of Perspective projections - Transformation 1) Faraway objects seem smaller. 2) Straight lines are projected to straight lines. 3) Let line 1 and 2 is two s

Matlab, need help in coding

need help in coding

Proof of subsequent properties of bezier curves, Proof of subsequent proper...

Proof of subsequent properties of Bezier curves Note: Proof of subsequent properties of Bezier curves is left as a work out for the students P' (0) = n (p 1 - p 0 ) P

What is the minimum amount of video ram, Consider a raster system with the ...

Consider a raster system with the resolution of 1024 x 768 pixels and the color palette calls for 65,536 colors. What is the minimum amount of video RAM that the computer must have

., Define the working procedure of CRT with diagram

Define the working procedure of CRT with diagram

Definitions of hypertext, Definitions of Hypertext A manner of pre...

Definitions of Hypertext A manner of presenting information online along with links among one piece of information and the other. These links are termed as hypertext links

Gourand shading or intensity interpolation scheme, Gourand shading OR Inten...

Gourand shading OR Intensity interpolation scheme Now there polygon is rendered through linearly interpolating intensity values across the surface. Intensity values for all po

Interfacing lcd liquid crystal display, Main Objectives: Interfacing...

Main Objectives: Interfacing LCD to the Micro-controller (PIC18F4520) Programming LCD by using C- language via MPLAB Sending data or command to the LCD Component

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