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

What is meant by scan code, What is meant by scan code? When a key is p...

What is meant by scan code? When a key is pressed on the keyboard, the keyboard controller places a code bear to the key pressed into a part of the memory known as the keyboard

Handling mouse input, When you set up your project, create the class as an ...

When you set up your project, create the class as an "ACM Graphics Program", rather than a plain class. This will perform the necessary preparations for you to use mouse input in y

Construction of an isometric projection - transformation, Construction of a...

Construction of an Isometric Projection - Transformation In this projection, the direction of projection i.e. d = (d 1 ,d 2 ,d 3 ) makes an identical angles with all the 3-pr

Application in image capture formats, Application Interlacing is utiliz...

Application Interlacing is utilized through all the analogue TV broadcast systems in recent use as: NTSC: 59.94 fields per second, 525 lines, still field drawn first

Liang b arsky line clipping algorithm, Write the Liang B arsky line clippin...

Write the Liang B arsky line clipping algorithm. Why is Liang Barsky algorithm more efficient than the Cohen Sutherland algorithm?  Liang Barsky Line Clipping: Faster line cl

Frame, what is frame buffer

what is frame buffer

B splines, What is uniform rational splines

What is uniform rational splines

Basics of animation - computer animation, Basics of Animation - Computer an...

Basics of Animation - Computer animation Historical and traditional methods for production of animation: As we have studied the transformations linked in computer graphics

Scaling, uniform scaling and differential scaling with the help of diagram

uniform scaling and differential scaling with the help of diagram

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