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

Overview of hardware primitives, Overview of Hardware Primitives With t...

Overview of Hardware Primitives With the advancement of computer technology, computer graphics has become a practical tool used in real life applications in diverse areas such

Axis of rotation - construction of a solid, Axis of Rotation - Construction...

Axis of Rotation - Construction of a solid with a translational sweep Figure:  (a)                                                                          Figure  (b)

Midpoint circle generation algorithm, Midpoint circle generation algorithm ...

Midpoint circle generation algorithm This makes use of a circle function. Based on this circle function, a decision parameter is created which is used to decide successive pixe

Scan line algorithm and seed fill algorithm, Scan line algorithm and seed f...

Scan line algorithm and seed fill algorithm Two basic approaches are followed in area filling on raster systems.  In the first approach overlap intervals for scan lines that cr

Progressive scan in image capture formats, Progressive Scan: Progressive o...

Progressive Scan: Progressive or non-interlaced scanning is a process which displays, transmits or stores moving images wherein, the lines of all frame are drawn in order. It is i

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

Polygon surfaces - curves and surfaces, Polygon Surfaces - Curves and Surfa...

Polygon Surfaces - Curves and Surfaces   By Figure 1 and Figure 2 it is clear that it is possible to store description of objects as a set of surface polygons and similar i

Interactive Computer Graphics, Explain the different input modes used in in...

Explain the different input modes used in interactive computer graphics.

Distinguish between convex and concave polygons, Distinguish between convex...

Distinguish between convex and concave polygons? If the line joining any two points in the polygon lies totally inside the polygon then, they are called as convex polygons. If

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