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

Relationships between scaling and wavelet function spaces, QUESTION (a)...

QUESTION (a) Median filters do not cater for a dynamic range of pixels in a given area, S. Thus to ensure that no loss of image details occur in S, adaptive median filters coul

Filled-area primitives - output primitives, Filled-Area Primitives  Fil...

Filled-Area Primitives  Filled-area primitives are one of the most important types of primitives used in Computer Graphics.  Basically filled-area primitives are meant to fill

Variation of intensity - modeling and rendering, Variation of Intensity - M...

Variation of Intensity - Modeling and Rendering According to the phong model the variation of Intensity (I) along with α (since I α cos n α) is: i) for shiny surface (

Crt, working of crt

working of crt

Reflection, What is the advantages and disadvantages of reflection ?

What is the advantages and disadvantages of reflection ?

Archeology-applications for computer animation, Archeology: along with the...

Archeology: along with the advent of the computer, the archeologist has obtained a new tool, computer animation. An object-model can be made comparatively quick and without any we

Simulation-applications for computer animation, Simulation: There are seve...

Simulation: There are several things, places and events people cannot witness in first person. There are a lot of causes for this. Several may happen too rapidly, several may be t

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Crt - cathode ray tube, CRT - Cathode Ray Tube Electron gun is used...

CRT - Cathode Ray Tube Electron gun is used to send an electron beam aimed at a particular point on the screen. Deflection system is used to make the beam strike the screen

Raster scan display processor, Draw the block diagram of raster scan displa...

Draw the block diagram of raster scan display processor.

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