Polygon filling algorithm - raster graphics and clipping, Computer Graphics

Polygon Filling Algorithm - Raster Graphics and Clipping

In several graphics displays, this becomes essential to differentiate between different regions by filling them along with different colour or at least by different shades of gray. There are various methods of filling a closed area with a specified colour or corresponding gray scale. The most general classification demonstrated through following algorithms:

a)  Scan Line polygon fill algorithm.

b)  Seed fill algorithm./Flood fill algorithm that are additionally classified as:

(a) Boundary fill algorithm and

(b) Interior fill algorithm

We confine our discussion to scan line polygon fill algorithm, while we will discuss the others in briefly at the end of such section.

Posted Date: 4/3/2013 2:02:33 AM | Location : United States







Related Discussions:- Polygon filling algorithm - raster graphics and clipping, Assignment Help, Ask Question on Polygon filling algorithm - raster graphics and clipping, Get Answer, Expert's Help, Polygon filling algorithm - raster graphics and clipping Discussions

Write discussion on Polygon filling algorithm - raster graphics and clipping
Your posts are moderated
Related Questions
For good understanding of the application of the rules specified above see the following figure, where the shaded region demonstrates the clipped polygon. Fi


I need different convincing virtual environments (2D and 3D) that alter size perception. In particular, for 2D environment or background, when any object is augmented with the 2D e

Question 1: (a) The studio provides a perfect environment for various types of video production where precise control is necessary. Discuss. (b) Studio lighting is an import

Explain working of CRT

Categorization of Light resources - Point source This is the easiest model for a light emitter. Currently rays from source obey radically diverging ways from the source positi

Implement the Scan line polygon fill algorithm for any arbitrary polygon in C-language and then use your code to fill each of the following type of polygon. i)  Convex polygon

What is the need of homogeneous coordinates?  To perform more than one transformation at a time, use homogeneous coordinates or matrixes. They decrease unwanted calculations in

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Example 1 : Determine the number of memory bits essential for three bit plane frame buffer for the 512 x 512 raster Solution: Whole memory bits needed are 3 x 512 x 512 = 786,