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

Illustrate the advantages of using virtual reality, Illustrate the Advantag...

Illustrate the Advantages of using virtual reality - it's safer (As techniques can be tried out in advance without the dangers of real operation for example maintaining a nucle

Sprite animation interactive may be non rectangular, Sprite animation inter...

Sprite animation interactive, may be non rectangular (Computer games) In its simplest form it is a 2-D graphic object which moves across the display. Sprites frequently can hav

Math, what is the numerical numbers

what is the numerical numbers

Retracing, what do you mean by retracing? Define horizontal as well as Vert...

what do you mean by retracing? Define horizontal as well as Vertical retracing?

Explain about the computer based training, Explain about the Computer Based...

Explain about the Computer Based Training CBT makes use of a computer system to train people in numerous applications. It makes use of self-assessment and multimedia with minim

Polygon or area clipping algorithm, Polygon or Area Clipping Algorithm - Su...

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

Vertices of bezier curve find out 3 points on bezier curve, Specified p 0 ...

Specified p 0 (1, 1): p 1 (2, 3); p 2 (4, 3); p 3 (3, 1) as vertices of Bezier curve find out 3 points on Bezier curve? Solution : We consider Cubic Bezier curve as: P (

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