Polygon filling algorithm - raster graphics and clipping, Computer Graphics

Assignment Help:

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.


Related Discussions:- Polygon filling algorithm - raster graphics and clipping

Explain what the term blocking means in animation, Question 1: (a) Exp...

Question 1: (a) Explain what are Final Gathering and Global Illumination and state why you would use those features when you render in MAYA. (b) List clearly the steps in

Important points about the curve segment, Important Points about the Curve ...

Important Points about the Curve segment - properties of bezier curves Note : if P (u) → = Bezier curve of sequence n and Q (u) → Bezier curve of sequence m. After that Co

Z- buffer algorithm, Q.   Describe the z- Buffer algorithm for hidden surfa...

Q.   Describe the z- Buffer algorithm for hidden surface removal. Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. T

Common transformation for parallel projection-transformation, Derive the co...

Derive the common transformation for parallel projection into a specified view plane, here the direction of projection d=aI+bJ+cK is along the normal N=n1I+n2J+n3K along with the r

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

Demerit - phong shading or normal vector interpolation shadi, Demerit - pho...

Demerit - phong shading or normal vector interpolation shading Needs lot of computations to determine intensity at a point, hence increases the cost of shading in any impleme

What is homogeneous coordinate, What is homogeneous coordinate? Discuss the...

What is homogeneous coordinate? Discuss the composite transformation matrix for two successive translations and scaling. In design and picture formation process, many times

Xy-shear about the origin - 2-d and 3-d transformations, xy-Shear about the...

xy-Shear about the Origin - 2-d and 3-d transformations Suppose an object point P(x,y) be moved to P'(x',y') as a outcome of shear transformation in both x- and y-directions a

Application of animation, Application of animation: There are a variety of...

Application of animation: There are a variety of utilizations for computer animation. They can vary from fun to practical and educational ones. Medicine, military, entertainment,

Transformation for 3-d shearing, Transformation for 3-D Shearing 2-dim...

Transformation for 3-D Shearing 2-dimensional xy-shearing transformation, as explained in equation, can also be simply extended to 3-dimensional case. All coordinates are tran

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